Data Structure Aptitude

Basic Data Structures

Data Structure MCQ 3

  1. When we insert an element in the stack, it is known as __________

    A.

    B.

    C.

    D.

  2. A linear collection of data elements which are connected through linear node by means of pointer is called _____________

    A.

    B.

    C.

    D.

  3. Pushing an element into stack already having 7 elements and stack size is 7 , then  _________ will occur.

    A.

    B.

    C.

    D.

  4. In linked list each node contain minimum of two fields. One field is __________  and the second field is ____________

    A.

    B.

    C.

    D.

  5. If the elements “X”, “B”, “Y” and “D” are placed in a queue and are deleted one at a time, in what order will they be removed?

    A.

    B.

    C.

    D.

  6. The data structure in which elements can be inserted or deleted from both the ends but not in the middle is _____________

    A.

    B.

    C.

    D.

  7. Which of the following problems can be solved using recursion?

    A.

    B.

    C.

    D.

  8. When does the ArrayIndexOutOfBoundsException occur?

    A.

    B.

    C.

    D.

  9. Which of the following is not the type of queue?

    A.

    B.

    C.

    D.

  10. What does pointer holds in doubly linked list?

    A.

    B.

    C.

    D.


Please Share this page
Like every other website we use cookies. By using our site you acknowledge that you have read and understand our Cookie Policy, Privacy Policy, and our Terms of Service. Learn more Got it!