AVL Tree | Binary Tree- C Questions(Previous Year)-5

Technical Placement Questions(Previous Year)-5

 

AVL Tree | Binary Tree- C Questions

C Questions

 

  1. The Default Parameter Passing Mechanism is called as
    1. Call by Value
    2. Call by Reference
    3. Call by Address
    4. Call by Name                       Answer : A
  2. C is ______ Language?
    1. Low Level
    2. High Level
    3. Assembly Level
    4. Machine Level                      Answer : B
  3. 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
  4. 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
  5. The “C” language is
    1. Context free language
    2. Context sensitive language
    3. Regular language
    4. None of the above                  Answer : A
  6. Number of binary trees formed with 5 nodes are
    1. 30
    2. 36
    3. 108
    4. 42                   Answer : D
  7. The _______ memory allocation function modifies the previous allocated space.
    1. calloc
    2. free
    3. malloc
    4. realloc             Answer : D
  8. The _______ memory allocation function modifies the previous allocated space.
    1. calloc
    2. free
    3. malloc
    4. realloc              Answer : C

Previous Page

Next Page

Related posts

2 thoughts on “AVL Tree | Binary Tree- C Questions(Previous Year)-5”

  1. Pingback: Constant Pointer | Dequeue- C Questions(Previous Year)-4 - Answers4u

  2. Pingback: Binary Tree | Do While Loop- C Questions(Previous Year)-6 - Answers4u

Leave a Comment

Your email address will not be published. Required fields are marked *

Scroll to Top
%d bloggers like this: