Data Structure Aptitude

Basic Data Structures

Data Structure MCQ 2

  1. A queue is an example of ______________ data structure

    A.

    B.

    C.

    D.

  2. To insert a node in a circular list at rear position it should be inserted at which position?

    A.

    B.

    C.

    D.

  3. Time required to search an element in a linked list of length n is:

    A.

    B.

    C.

    D.

  4. A full binary tree with n leaves contains

    A.

    B.

    C.

    D.

  5. Which of the following is useful in traversing a given graph by breadth first search (BFS)

    A.

    B.

    C.

    D.

  6. Which of the following is correct?

    A.

    B.

    C.

    D.

  7. A variable which can be accessed by all the module in a program is

    A.

    B.

    C.

    D.

  8. Recursion is

    A.

    B.

    C.

    D.

  9. Read the following code snippet and write the output: public class array { public static void main(String args[]) { int []arr = {11,22,3,4,55}; System.out.println(arr[5]); } }

    A.

    B.

    C.

    D.

  10. Which of the following condition may occur in pop operation in stack

    A.

    B.

    C.

    D.


Please Share this page