Home / MCQs / MCQ | Data Structure Part 3

MCQ | Data Structure Part 3

on in


Data Structure - PART 3


1. Any recursive function can be converted into an equivalent non-recursive function






  [NET]

2. Recursion is equivalent to






  [NET]

3. Which statement is true about recursion






  [NET]

4. Reduction in wastage due to fragmentation is minimum in






  [NET]

5. Memory allocation at the run time is known as






  [NET]

6. A technique which collect all deleted space onto free storage list is called






  [NET]

7. Memory allocation at the compile time is known as






  [NET]

8. In memory allocation the first entry which has free block equal to or more than required one is selected by






  [NET]

9. The preorder traversal of a binary tree begins with






  [NET]

10. The postorder traversal of a binary tree begins with






  [NET]

You May Also Like:
-
Tags

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)