# Data Structure and Algorithm Analysis Set 7

## Data Structure and Algorithm Analysis

### Questions 61 to 70

61.
List out the areas in which data structures are applied extensively.
 (a) Compiler Design (b) Operating System (c) Database Management System (d) Both (a) and (b) above (e) (a), (b) and (c) above.
62.
What is the major data structure used in the Network data model?
 (a) Stack (b) Array (c) Tree (d) Graph (e) Queue.
63.
The data structure used in the Hierarchical data model is
 (a) Array (b) Tree (c) Graph (d) Stack (e) Queue.
64.
Minimum number of queue(s) needed to implement the priority queue is(are)
 (a) Two (b) One (c) Three (d) Four (e) Depends upon the application.
65.
What data structure is used to perform recursion?
 (a) Queue (b) Linked List (c) Stack (d) Double Linked List (e) Circular Queue.
66.
For the expression ((A + B) * C – (D – E) ^ (F + G)), the equivalent Postfix notation is
 (a) AB + C * DE - - ^ FG + (b) AB + CDE - - * FG + ^ (c) AB + C * DE - FG + - ^ (d) AB + C * DE - - FG + ^ (e) AB + C - DE - * FG + ^.
67.
The Prefix notation for the above infix expression is
 (a) - * +ABC - DE ^ + FG (b) ^ - * +ABC - DE + FG (c) ^ - +AB * C - DE + FG (d) ^ - + * ABC - DE + FG (e) - ^ * + ABC - DE + FG.
68.
Sorting is not possible by using which of the following methods?
 (a) Insertion (b) Selection (c) Deletion (d) Exchange (e) Partitioning.
69.
The number of null branches for a binary tree with 20 nodes is
 (a) 21 (b) 20 (c) 22 (d) 19 (e) 18
70.
What is the type of the algorithm used in solving the 8 Queens problem?
 (a) Greedy (b) Dynamic (c) Branch and Bound (d) Divide and Conquer (e) Backtracking.

<< PrevNext >>