Data Structure Aptitude

Basic Data Structures

Data Structure MCQ 4

  1. What are the common ways to implement a two dimensional array in C?

    A.

    B.

    C.

    D.

  2. 1. Prior knowledge of number of elements,

    2. Can expand by half of its initial size

    3. Updating elements in array is time consuming

     

    Which of the above is correct about Linear array?

    A.

    B.

    C.

    D.

  3. In C, a String is terminated by ______________ 

    A.

    B.

    C.

    D.

  4. In C, this function appends a source String to the end of the destination String _________ 

    A.

    B.

    C.

    D.

  5. __________ is a strictly binary tree in which leaf nodes contain operands and non-leaf node contains operator, root nodes contain the operator that is applied to result of left and right subtree. 

    A.

    B.

    C.

    D.

  6. In C, this function returns the length of a String without counting the null character___________

    A.

    B.

    C.

    D.

  7. A queue is a __________ linear data structure 

    A.

    B.

    C.

    D.

  8. What are the different kind of deque?

     

    A.

    B.

    C.

    D.

  9. What are the applications of queues from among listed below?

    A.

    B.

    C.

    D.

  10. What is the correct formula to calculate front of the queue? 

     

    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!