101)a two part circular linked chain implementation of a queue

A. All other answers

B.keep nodes that are deallocated for future use

C. Allocates newnode on demand when there are no available nodes

D.is intialized with ni available nodes

102)In an array based implementationof a queue a possible solution to dealing with the full condition is to 

A. All other answers

B. Check for frontIndex equal to backIndex

C.wait for an arrayFullException to be thrown

D. Maintain a count of queue items

103)In a linked chain implementation of a queue, the performance of the enqueue operation 

A. O(1)

B.O(n)

C.O(logn)

D.O(n2)

104)In the linked chain implementation of a queue the chains first node contains

A. Both of the answers

B. The queues back entry

C. None of the other answers

D. The queue front entry

105)if we use a chajn of linked nodes with only a heard references to implement a queue which statement is true?

A. You must traverse the entire chain to access the last node

B. Boyh if the answers

C. Accessing the last node is very inefficient

D. None of the other amswers

106)In a circular array based implementation if a queue what is the performance when the enqueue operation if you amortize the cost id resizing the array over all additions to the 

A. O(1)

B.O(n)

C.O(logn)

D.O(n2)

107)When a linke chain contain nodes that reference both the next node and the previous node it is called a(n)

A. Two way linked chain

B. Multi linked chain

C. Ordinary chain

D. Doubly linked chain

108)A linked chain whose last node is full is sometiems called an 

A.linear linked chain

B.null terminated linked chajn

C.circular linked chain

D. All other amswers

109)when removing a node from a two part circular linked chain implementation of a queue

A. All other answers

B. The node is moved to the part of the chain that is available for the enqueue method

C. Entry at the front of the queue is returned

D.the queue node is advanced

110)In a doubly linked chain implementation of a queue, what is the performance when the dequeue operation

A. O(1)

B.O(n)

C.O(logn)

D.O(n2)

98)What item is at the front of the list after these statements are executed?

DequeInterface<String> waitingLine= new LinkedDeque<>();

WaitingLine.addToFront("Jack");

WaitingLine.addToFront("Rudy");

WaitingLine.addToBack("Larry");

WaitingLine.addToBack("sam");

String name =waitingLine.getFront();

A.sam B. Larry. C. Rudy. D. Jack

97)The java class library interface queue method to put an entey on the back of a queue that returns false if the method falls is 

A. Add

B.put

C.poll

D.offer

94)The java class library interface queue method tagg retrieves the entey at the front of a queue but themrows a NosuchElementException if the queue was empty is 

A.poke

B.empty

C.look

D.peek

93)when a counter enumerates simulated time units. It is called a(n) 

A. All other amswers

B.time driven simulation

C.event drivem simulation

D.clock simulation

91)what item is at the front of the list after these statements are executed?

DequeInterface<String> waitingLine= new LinkedDeque<>();

WaitingLine.addToFront("Jack");

WaitingLine.addTolBack("Rudy");

WaitingLine.addToBack("Larry");

WaitingLine.addTolFront("sam");

 name =getBack();

WaitingLine.addtoBack("Adam");

A.sam B. Adam. C. Rudy. D. Jack E. all other answers

90)The radix sort

A. Treats array entries asif they were strings that have same plength

B. Is not suitable as a general purpose sorting algorithm

C.restrcits the data that it sorts on

D. All other answera

89)Which of the following statements are true about quick sort

A. It can degrade into an O(n2) sort if the pivot selection scheme is bad

B. It doesnt require additional memory that merges sort does 

C. All other answers

D.in practice it can be transfer than merge sort