User Account

All Pages

Poset , computer science, Basic Computer Science

Assignment Help:
1. (40 points) Add a course drop method to the system that you implemented in Problem Set
1. Modularize your new implementation properly. For any new methods that you introduce:
1. Write a speci cation.
2. Write an implementation sketch.
3. Annotate the code.
2. (80 points) A partially ordered set (PoSet) is a pair (S; R) where S is a set and R  S  S
is a binary relation over S such that:
 R is re
exive: 8 x 2 S : xRx
 R is antisymmettric: 8 x; y 2 S : xRy ^ yRx ) x = y
 R is transitive: 8 x; y; z 2 S : xRy ^ yRz ) xRz
R is called a partial order over S.
Implement PoSet as an abstract data type. Your implementation must provide the following
operations:
 Create an empty partially ordered set (S; R), i.e., S = ;, R = ;.
 Add an element x to S: S := S [ fxg, with R remaining unchanged.
 Add an ordering between two existing elements x; y 2 S: R := R [ (x; y), provided that
this does not violate the partial order conditions.
 Answer a membership query x 2 S.
 Answer an ordering query (x; y) 2 R.
You may use any class in the Java collections framework.
Your solution must include the following:
1. An abstraction function and representation invariant for the class that implements PoSet.
2. Overview statements for every class.
3. Speci cation, implementation sketch, and annotation for all methods, with the exception
of very simple and obvious methods such as one line getter methods.

Related Discussions:- Poset , computer science

Processor, Processor: Processor plays major role in a computer. One sh...

Processor: Processor plays major role in a computer. One should carefully decide about the type of processor and its speed before making a choice. Currently Core 2 Duo process

Python Identifiers, A Python identifier is a name used for classify a funct...

A Python identifier is a name used for classify a function, variable, class, module or any other object. An identifier begins with a letter A to Z or a to z or an underscore (_) fo

Cryptography, For which X,Y in {o, O, Theta, Omega, omega}, do the relation...

For which X,Y in {o, O, Theta, Omega, omega}, do the relationships t(n)+t''(n) = X(min(t(n),t''(n))) and t(n)+t''(n) = Y(max(t(n),t''(n))) hold for all t,t'' such that t(n),t''(n)

Computer, identify application software from the list? ms excel linux inter...

identify application software from the list? ms excel linux internet explorer adobe photshop sound card driver window disk manger adobe dream weaver windows file explorer

MIDI, Explain about MIDI audio

Explain about MIDI audio

Login, Login Because the information on a network is sharable, network...

Login Because the information on a network is sharable, networks are very susceptible to unauthorized intruders. In order to prevent unauthorized access to use the services o

Micro-computer, explain the function of each block in the block diagram of ...

explain the function of each block in the block diagram of micro-computer

Data structure, #question.a tree has 0 off springs at each node. if it had ...

#question.a tree has 0 off springs at each node. if it had a label L, what will be the maximum number of nodes that the tree can have. only an expression involving the number of no

Socket, socket programming

socket programming

Explain the concept of linking and relocation, Question 1 Write an assembl...

Question 1 Write an assembly language program to find the highest among two numbers Question2 Draw and explain the internal architecture of 8085 briefly Question3 Explai

Write Your Message!

Captcha
Order Assignment

Featured Services

Order Now

Popular Subjects

Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

Submit Assignment

Academics

Major Subjects

Majors

Get In Touch

whatsapp: +91-977-207-8620

Phone: +91-977-207-8620

Email: [email protected]

TERMS & POLICIES

HELP & SUPPORT

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd