Question 6: Briefly discuss the significant difference between a priority queue and an ordinary queue. Using an everyday example, explain how a priority queue is used as an underlying data structure.
Major Topic: PRIORITY QUEUES
Blooms Designation: EV
Score: 7
b) After the following statements execute, what are the contents of the priority queue?
PriorityQueueInterface<String> myPriorityQueue = new LinkedPriorityQueue<String>();
myPriorityQueue.add("al");
myPriorityQueue.add("a4");
myPriorityQueue.add("a3");
myPriorityQueue.add("a2");
String st = myPriorityQueue.remove();
myPriorityQueue.add(st);
myPriorityQueue.add(myPriorityQueue.peek());
myPriorityQueue.add("a2");
myPriorityQueue.remove();
Initially, assume myPriorityQueue is empty and priority is interpreted as coming first in a lexicographical ordering (dictionary order).
Major Topic: PRIORITY QUEUES
Blooms Designation: PRIORITY
Score: 8
c) Compare and contrast the linear search and binary search algorithms by searching for the numbers 45 and 84 in the following list: 38 12 34 54 84 91 11 10 12 0.
Major Topic: SEARCHING
Blooms Designation: BINARY
Score: -