# 161-170 Questions

Q1:The nested loops are evaluated using a) stacks b) queues c) structures d) binary tree Answer:

Q2:

The data structure used in resource sharing systems is a) stacks b) queues c) arrays d) binary tree Answer:

Q3:

Which of the following is not a linear data structure a) stacks b) queues c) linked list d) binary tree Answer:

Q4:

In evaluation of postfix expression the data structure used is a) stacks b) queues c) arrays d) binary tree Answer:

Q5:

Linked list uses __________ type of memory allocation a) static b) random c) dynamic d) compile time Answer:

Q6:

Binary tree can be implemented using a) arrays b) double linked list c) a & b d) b only Answer:

Q7:

In a complete binary tree, if the parent is at nth position then the children will be at a) n+1, n+2 b) 2n,2n-1 c) 2n,2n+1 d) 2n+1,2n-1 Answer:

Q8:

The number of non leaf nodes in a complete binary tree of height 5 is a) 16 b) 32 c) 31 d) 15 Answer:

Q9:

The number of leaf nodes in a complete binary tree of height 5 is a) 16 b) 32 c) 31 d) 15

Q10:

The number of nodes in a complete binary tree of height 5 is a) 16 b) 32 c) 31 d) 15 Answer: