24. Which of the following statements is FALSE?
(a) Queues use FIFO queueing discipline.
(b) Hash tables work well even with high load factors.
(c) Priority queues can simulate stacks and queues.
(d) Stacks are better for recursive situations than queues.
(e) Stacks are not as versatile as lists.
25. The following is a priority queue which stores events that are to occur specified times. In this
list the letters are event names, the integers are the times the events are to occur:
a:1, b:3, c:20, d:22
The following events are added to the priority queue:
e:20, f:25, g:30
Elements are then taken from the queue until time = 10. Which of the following best describes
the state of the queue?
(a) b,c,d,e,f,g
(b) c,e,d,f,g
(c) c,d,e,f,g
(d) c,e,d,g,f
(e) e,c,f,d,g