GATE Data Structure Quiz

10 Questions | Total Attempts: 2006

SettingsSettingsSettings
GATE Data Structure Quiz - Quiz

So, here is a challenge for you. Can you pass this Gate data structure quiz with a score equal to or above 70? If yes, then you will be called an expert. In the field of computer science, a data structure is meant by a data organization, management, and storage format usually chosen for the purpose of efficient access to data. These are some questions that are not only for your practice but also to give you a better understanding of the data structure. All the best.


Questions and Answers
  • 1. 
    In linked lists, there are no NULL links in
    • A. 

      Single linked list

    • B. 

      Linear doubly linked list.

    • C. 

      Circular linked list

    • D. 

      None of these

  • 2. 
    In a balanced binary tree, the height of two sub-trees of every node can not differ by more than
    • A. 

      2

    • B. 

      1

    • C. 

      0

    • D. 

      3

  • 3. 
    In the array representation of the binary tree, the right child of the root will be at the location of
    • A. 

      2

    • B. 

      5

    • C. 

      3

    • D. 

      0

  • 4. 
    The number of possible ordered trees with 3 nodes A, B, and C is 11.
    • A. 

      True

    • B. 

      False

  • 5. 
    Write the output of the following program:int a[ ] = {1,2,3,} *p;
    • A. 

      3

    • B. 

      Junk value

    • C. 

      Run time error

    • D. 

      Address of the third element

  • 6. 
    If the out-degree of every node is exactly equal to M or 0 and the number of nodes at level K is Mk-1 [con sider root at level 1], then the tree is called as  (i) Full m-ary try(ii) Com plete m-ary tree(iii)Positional m-ary tree
    • A. 

      Only (i)

    • B. 

      Only (ii)

    • C. 

      Both (i) and (ii)

    • D. 

      Both (ii) and (III)

  • 7. 
    A queue has configuration a,b,c,d. If you want to get the configuration d,c,b,a, you need a minimum of 2 deletions and 3 additions.
    • A. 

      True

    • B. 

      False

  • 8. 
    In the following tree: If post-order traversal generates sequence XY-zw*+, then label of nodes 1234567 will be
    • A. 

      +, -, *, x, y, z, w

    • B. 

      X, -, y, +, z, *, w

    • C. 

      X, y, z, w, -, *, +

    • D. 

      -, x, y, +, *, z, w

  • 9. 
    On which principle does stack work?
    • A. 

      FILO

    • B. 

      FIFO

    • C. 

      LIFO

    • D. 

      Both a and c above

  • 10. 
    The order of the binary search algorithm is
    • A. 

      N

    • B. 

      N2

    • C. 

      N log n

    • D. 

      Log n

Back to Top Back to top
×

Wait!
Here's an interesting quiz for you.

We have other quizzes matching your interest.