Question Bank for UT-I (SE ENTC)

Subject: Data Structure
UT - I   Question Bank
    Multiple Choice Questions                                               
1. The process of accessing data stored in a tape is similar to manipulating data on a ______
a)Stack                        b)Queue          c)Array            d)List
2.  Pop operation of stack popped ____________.
a)First inserted element           b)Last inserted element
c) Any element                        d)None of Above
3.  What can be said about array representation of circular queue when it contains only one    
      element?
a)Front = Rear = NULL         b)Front = Rear + 1
c)Front = Rear – 1                   d)None of the above.
4. The postfix expression for  X + Y - Z  is ____________.
a)X Y Z + -                 b)X Y + Z -     c)X Y Z - +     d)+ - X Y Z
5.  Array is a ____________ data structure.
a)  Primitive                           b)   Non Primitive
 c) User defined                    d)   None of Above
     6. Stack is useful in implementing _________.
            a)Breadth First Traversal        b)Radix Sort        c)Recursion                        d)None
     7. Queue is called __________ .
             a)LIFO                                   b)FIFO                        c)FILO                        d)LILO
    8.  Underflow condition of stack is due to _________ operation.
               a)Push                                  b)Pop                           c)Insert            d)Enq
     9. In _________ queue, the elements are inserted and deleted according to some property.
            a) DEQUE      b) Linear queue           c) Priority queue          d) Circular queue
     10.  In circular queue, the enqueue operation increments the rear pointer as follows –
            a) rear = rear+1                        b) rear = front +1       
            c) rear = (rear+1)% max          d) rear = (front+1) % max
     11. The top pointer is __________ when an element is popped from stack.
            a) Incremented                        b) decremented           c) multiplied    d) divided
     12. The following sequence of operations are performed on stack.
       Push(10),Push(20),Pop(),Push(10),Push(20),Pop(),Pop(),Pop(),Push(20),Pop().
       The sequence of values popped out is _____________.
           a)20,10,20,10,20          b)20,20,10,10,20         c)10,20,20,10,20         d)20,20,10,20,10
      13. In queue, elements are Inserted from
           a) rear                           b) front                        c) top                           d) none of these
      14. In circular queue we have to give sacrifice of ______ slot.
            a) 1                              b) 2                              c) 3                              d) 4
      15. Overflow condition of queue is
            a) rear = MAX – 1      b) front = MAX – 1    c) top = MAX -1         d) both a & b
      16. If Top is initialized to  -1  and we want to add 5 to the stack, the first step is
            a) POP             b) PUSH 5      c) Increment top          d) Decrement top
      17. The prefix notation is also called as
            a) Polish notation        b) Reverse polish notation      c) Both a & b              d) None
      18. The postfix notation is also called as
            a) Polish notation        b) Reverse polish notation      c) Both a & b              d) None
      19. Dynamic memory allocation means allocating the memory at
            a) Run time                 b) Execution time        c) Both a & b                          d) None
      
4  Marks Questions :
       1. Define Queue. Write and explain different operations performed on queue.
       2. Write an algorithm for “Postfix Expression Evaluation”. Give an example.
       3. Explain basic operations on stack with neat diagrams.
 4. Convert infix to postfix using the algorithm:  (A+B) * (C+D) - E.
 5. What is value of postfix expression   579*+493/+-   ?
 6. Differentiate between Static and Dynamic memory allocation.
 7. What is circular queue? Explain with neat diagrams how elements are inserted and
     deleted from circular queue.
       8. Define Queue. Write and explain different operations performed on queue.
       9. What is Linked List? Explain its types with neat diagrams.
8  Marks Questions :
       1. Write an algorithm to convert infix expression to postfix expression. Give Example.
       2. Explain -     1. Linear Queue       2. Priority Queue       3. DEQUE
       3. Define linked list. Write operations for the following:
i) Insertion of singly linked list
            ii) Deletion of Singly linked list
iii) Display data of singly linked list
       4. What is Circular Queue? Write down all its operations with neat diagram.
       5. Write C program to implement following stack operations
             i) Push            ii) Pop      iii) Stack Empty      iv) Stack Full       v) Stack Display
      6. What is doubly Circular linked list? Explain all its operations with neat diagram


   ----------------------------------------------------