GITA Autonomous College, Bhubaneswar

QUIZ TEST
3rd Semester B.Tech (CSIT), Section-1
Subject: Data Structures using C

Time: 30 Minutes FM: 20

Answer all questions. Choose the most appropriate answer.

Each question carries equal marks. [1×20]

1. A binary tree in which if all its levels except possibly the last, have the maximum number
of nodes and all the nodes at the last level appear as far left as possible, is known as
(a) Full binary tree. (b) AVL tree.
(c) Threaded tree. (d) Complete binary tree.
2. A full binary tree with n leaves contains
(a) n nodes. (b) Log n2 nodes.
(c) 2n –1 node (d) n2 nodes.
3. The smallest element of an array’s index is called its
(a) Lower bound. (b) Upper bound.
(c) Range. (d) Extraction.
4. The maximum degree of any vertex in a simple graph with n vertices is
(a) n–1 (b) n+1
(c) 2n–1 (d) n
5. The data structure required for Breadth First Traversal on a graph is
(a) queue (b) stack
(c) array (d) tree
6. The data structure required to evaluate a postfix expression is
(a) Queue (b) stack
(c) Array (d) linked-list
7. The complexity of searching an element from a set of n elements using Binary search
algorithm is
(a) O (n) (b) O (log n)
2)
(c) O (n (d) O (n log n)
8. The goal of hashing is to produce a search that takes
(a)O (1) time (b) O (n2) time
(c) O (log n) time (d) O(n log n ) time
9. Time complexities of three algorithms are given. Which should execute the slowest for
large values of N?
(a) O (N1/2) (b) O (N)
(c) O(log N) (d) None of these
10. A linear list of elements in which deletion can be done from one end (front) and insertion
can take place only at the other end (rear) is known as a ……?
(a) Queue (b) Stack
(c) Tree (d) Linked list
11. A queue follows __________
(a) FIFO (First In First Out) principle (b) LIFO (Last In First Out) principle
(c) Ordered array (d) Linear tree
12. A data structure in which elements can be inserted or deleted at/from both the ends but
not in the middle is?
(a) Queue (b) Circular queue
(c) Dequeue (d) Priority queue
13. A normal queue, if implemented using an array of size MAX_SIZE, gets full when
(a) Rear = MAX_SIZE – 1 (b) Front = (rear + 1)mod MAX_SIZE
(c) Front = rear + 1 (d) Rear = front
14. Time complexity of Depth First Traversal of is

(a) Θ (|V|+|E|) (b) Θ (|V|)

(c) Θ (|E|) (d) Θ (|V|*|E|)

 15. What should be the value of rear (end) if the queue is full (elements are completely
occupied)?
(a) 1 (b) - 1
(c) MAX + 1 (d) MAX - 1
16. Which data structures find their applications in BFS and DFS Traversal mechanisms on a
Tree respectively?
(a)Graph & Stack (b) Queue & Stack
(c)Queue & Graph (d) None of the Above

17. Which of the following techniques represents the precise sequence of an In - Order
Traversal of a Binary Tree?
(a)Visit the Root, Traverse Left Subtree, Traverse Right Subtree
(b)Traverse Left Subtree, Visit the Root, Traverse Right Subtree
(c)Traverse Left Subtree, Traverse Right Subtree, Visit the Root
(d)None of the Above
18. Before inserting into stack one must check the condition ………
(a) Overflow ` (b) Underflow
(c) Maximum elements (d) Existing elements
19. In Binary trees nodes with no successor are called ……
(a) End nodes (b) Terminal nodes
(c) Final nodes (d) Last nodes
20. Before deletion condition into stack …… has to be checked.
(a) Overflow (b) Underflow
(c) Maximum elements (d) Existing elements

***Best of Luck***