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

Decision table , No charges are reimbursed to the patient until the deducti...

No charges are reimbursed to the patient until the deductible has been met. Hospital visits are reimbursed at 80% and Lab visits are reimbursed at 70%. Doctor''s office visits are

Explain acl with its types, Question 1 Discuss the two basic operational c...

Question 1 Discuss the two basic operational characteristics of RR Only an active route is redistributed Route redistribution does not impact local route selection

Grammar, Given the following grammar: -> [ , ] | -> | { } -> a...

Given the following grammar: -> [ , ] | -> | { } -> a | b | cwhich are the strings generated by the grammar? Show the parse tree(s). a). { [ a , b ] }b). [ { a } , b ]

Artificial intelligence-intelligence performanc of computer , "Just how are...

"Just how are we capable to get a computer to performe intelligent tasks?" One thing to answer the question is to tell that: Logic generate a science out of many forms of re

Input devices, Input Devices Keyboard Keyboard is the dev...

Input Devices Keyboard Keyboard is the device through which the commands, instructions required for execution of a program is entered. It consists of a number of

How Round robin scheduling algorithm is useful than others ?, Round robin (...

Round robin (RR) is one of the simplest, oldest, fairest and most extensively used algorithms. • In the round robin scheduling, processes are posted in a FIFO manner but are given

Explain digital multiplexers, Problem 1 Perform the following conversio...

Problem 1 Perform the following conversion a. (ABE) 16 =() 2 b. (101011) 2 =() 10 2 Explain how full adder adds three bits 3 Explain digital multiplexers

Operating system, advantage and disadvantage of operating system

advantage and disadvantage of operating system

Unix shell and history problem, UNIX Shell and History feature. 1.Creating ...

UNIX Shell and History feature. 1.Creating a child process. 2.Creating a history feature. Its exactly "programming project 1 - Unix Shell and History Feature (p.157-159)" in the Si

Write Your Message!

Captcha
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!

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