asd

1. Queue is a ? a. FIFO list b. LIFO list c. ordered array d. linear tree 2.A queue data-structure can be used for. a. expression parsing b. recursion c. resource allocation d. all of the above 3. Which of this not about linked list? a. A nonlinear collection of data elements b. It can be used to implement several other common abstract data types example stack, queue, tree C. It uses more memory than arrays because of the storage used by their pointers. d. Each record of a linked list is often called an 'element' or 'node' 4. The situation when in a linked list START=NULL is. a. underflow b. overflow c. list full d. saturated 5.which data structure type allows deleting data elements from front and inserting at rear? Stacks Queues Dequeue Binary search tree 6.push () and pop () functions are found in? queues lists stacks trees7. The difference between queue and stack is a. queues require dynamic memory but stack do not b. stack requires dynamic memory but queue do not c. queue use two ends of the structure; stack use only one d. stack use two ends of the structure; queue use only one 8.Which of this not about linked list? a. A nonlinear collection of data elements b. It can be used to implement several other common abstract data types example stack, queue, tree c. It uses more memory than arrays because of the storage used by their pointers. d. Each record of a linked list is often called an 'element' or 'node' 9.A queue data-structure can be used for. A. expression parsing b. recursion c. resource allocation d. all of the above 10.Act of adding values into a stack is called. popping polling pushing none 11. In linked list each node contains minimum of two fields. One field is data field to store the data second field is? Pointer to character Pointer to node Pointer to integer Node 12. Stack is used for? CPU resource allocation breadth first traversal recursion none of the above13. New nodes are added to what part of the queue? front back middle 14. Deletion operation is done on what part of the queue? front back middle 15. What happens when you push a new node onto a stack? the new node is placed at the front of the linked list the new node is placed at the back of the linked list the new node is placed at the middle of the linked list no changes happen Two variables used in queue are a. top and down b. rear and front c. left and right d. rear and top