C Multiple Choice Questions

  1. In which tree, for every node the height of its left subtree and right subtree differ almost by one?
    1. Binary search tree
    2. AVL tree
    3. Threaded Binary Tree
    4. Complete Binary Tree
Answer :
B
Explanation:
Added By : Suchit

  1. The worst case time complexity of AVL tree is better in comparison to binary search tree for
    1. Search and Insert Operations
    2. Search and Delete Operations
    3. Insert and Delete Operations
    4. Search, Insert and Delete Operations
Answer :
D
Explanation:
Added By : Suchit


  1. The "C" language is
    1. Context free language
    2. Context sensitive language
    3. Regular language
    4. None of the above
Answer :
A
Explanation:
Added By : Suchit

  1. Number of binary trees formed with 5 nodes are
    1. 30
    2. 36
    3. 108
    4. 42
Answer :
D
Explanation:
Added By : Rajat

  1. The _______ memory allocation function modifies the previous allocated space.
    1. calloc
    2. free
    3. malloc
    4. realloc
Answer :
D
Explanation:
Added By : Rajat

  1. The statement printf("%c", 100); will print?
    1. prints 100
    2. print garbage
    3. prints ASCII equivalent of 100
    4. None of the above
Answer :
C
Explanation:
Added By : Rahul


  1. Which of the following data structure is linear type?
    1. Strings
    2. Queue
    3. Lists
    4. All of the above
Answer :
D
Explanation:
Added By : Rahul

  1. To represent hierarchical relationship between elements, which data structure is suitable?
    1. Priority
    2. Tree
    3. Dqueue
    4. All of the above
Answer :
B
Explanation:
Added By : Rahul

Post Your Question
Social Sharing
Search