Project: Priority Queues
Generic implementations of priority queue
-Apply generic algorithms in solving programming problems
-Define and give examples of generic associative containers
-Define and give examples of generic algorithms
-Define the ADT Priority Queue
-Implement the ADT Priority Queue as a generic associative container subject to various constraints, including:
a. Push(t) <= O(size), Pop() = Θ(1)
b. Push(t) = Θ(1), Pop() <= O(size)
c. Push(t) <= O(log size), Pop() <= O(log size)
-Use namespaces to develop and test multiple implementations of an ADT.
Priority queues are used in several important applications, including:
- Operating system job schedulers
- Communications Satelite schedulers
- Discrete Event simulations
- Embedded/RealTime Systems
- Control structures for certain algorithms, such as Best First Search
Procedural Requirements-
1. The official development/testing/assessment environment is specified in the Course Organizer.
2. Be sure start and maintain your log.txt.
3. After creating your log.txt, begin by copying all of the files from LIB/proj8 into your project directory.
4. Create and work within a separate subdirectory. The usual COP 4530 rules apply (see Introduction/Work Rules). In particular: It is a violation of course ethics and the student honor code to use, or attempt to use, files other than those explicitly distributed in the course code library.
Attachment:- Priority Queues Assignment.rar