Deepa PhD CS

  Data Structures   1. Which of the following is/are the levels of implementation of data structure? a) abstract level     b) application level      c) implementation level               d) all of the above   2. The best data structure to check whether an arithmetic expression has balanced parentheses a) Queue                                b) Stack                 c) Tree                    d) List   3. Stack data structure is needed to convert a) infix to postfix notation            ...

  DATA STRUCTURES – MCQ   1. Entries in a stack are “ordered”. What is the meaning of this statement? a) A collection of stacks is sortable b) Stack entries may be compared with the ‘<‘ operation c) The entries are stored in a linked list d) There is a Sequential entry that is one by one   2. In a stack, if a user tries to remove an element from an empty stack it is called _________ a) Underflow b) Empty collection c) Overflow d) Garbage Collection   3. Which of the following is not the application of stack? a) A parentheses balancing program b) Tracking of local variables at run time c) Compiler Syntax Analyzer d) Data Transfer between two asynchronous process   4. In a circular queue, how do you increment the rear end of the queue? a) rear++ b) ( rear+1) % CAPACITY c) (rear % CAPACITY)+1 d) rear–   5. In linked list each node contains a minimum of two fields. One field is data field to store the data second field is...