SRI RAMANJAR ENGINEERING COLLEGE

DEPARTMENT of ELECTRONIC AND COMMUNICATION ENGINEERING

EC 8393 Fundamental Of DATA STRUCTURE
MODEL EXAM
MARKS: 100
TIME: 2hrs
PART A
Answer all Questions (50 x 1 = 5 marks)
1. Which if the following is/are the levels of implementation of data structure
A) Abstract level
B) Application level
C) Implementation level
D) All of the above
2. A binary search tree whose left subtree and right subtree differ in height by at most 1
unit is called
A) AVL tree
B) Red-black tree
C) Lemma tree
D) None of the above
3. ……………….. level is where the model becomes compatible executable code
A) Abstract level
B) Application level
C) Implementation level
D) All of the above
4. Stack is also called as
A) Last in first out
B) First in last out
C) Last in last out
D) First in first out
5. Which of the following is true about the characteristics of abstract data types? i) It
exports a type. ii) It exports a set of operations
A) True, False
B) False, True
C) True, True
D) False, False
6. ………. sorting is good to use when alphabetizing a large list of names.
A. Merge
B. Heap
C. Radix
D. Bubble
7. The easiest sorting is ……..
 A. quick sort
B. shell sort
C. heap sort
D. selection sort
8. Which of the following sorting algorithm is of divide and conquer type?
A. Bubble sort
B. Insertion sort
C. Quicksort
D. Merge sort
9. Merging k sorted tables into a single sorted table is called ……
A. k way merging
B. k th merge
C. k+1 merge
D. k-1 merge
10. The function used to modify the way of sorting the keys of records is called ……..
A. Indexing function
B. Hash function
C. Addressing function
D. All of the above
11. If the number of record to be sorted large and the key is short, then …… sorting can be
efficient.
A. Merge
B. Heap
C. Radix
D. Bubble
12) The total number of comparisons in a bubble sort is ….
A. O(n logn)
B. O(2n)
C. O(n2)
D. O(n)
13) If the number of record to be sorted large and the key is long, then …… sorting can be
efficient.
A. Merge
B. Heap
C. Quick
D. Bubble
14) The time complexity of heap sort is ….
A. O(n)
B. O(logn)
C. O(n2)
D. O(n logn)
15) The complexity of selection sort is …….
A. O(n)
B. O(n2)
C. O(n logn)
D. O(logn)
16. …………… is not the component of the data structure.

A) Operations
B) Storage Structures
C) Algorithms
D) None of the above

17. Which of the following is not the part of ADT description?

A) Data
B) Operations
C) Both of the above
D) None of the above

18. Inserting an item into the stack when stack is not full is called …………. Operation and
deletion of item form the stack, when stack is not empty is called ………..operation.
A) push, pop
B) pop, push
C) insert, delete
D) delete, insert

19. ……………. Is a pile in which items are added at one end and removed from the other.
A) Stack
B) Queue
C) List
D) None of the above

20. ………… is very useful in situation when data have to stored and then retrieved in
reverse order.
A) Stack
B) Queue
C) List
D) Link list

21. Linked lists are best suited …..

A. for relatively permanent collections of data.
B. the size of the structure and the data in the structure are constantly changing.
C. data structure
D. for none of the above situation

22) The operation of processing each element in the list is known as ……

A. sorting
B. merging
C. inserting
D. traversal
23) The situation when in a linked list START=NULL is ….
 A. Underflow
B. Overflow
C. Houseful
D. Saturated
24) Each node in singly linked list has …….. fields.
A. 2
B. 3
C. 1
D. 4
25) Which of the following are two-way lists?
A. Grounded header list
B. Circular header list
C. Linked list with header and trailer nodes
D. List traversed in two directions
26) Which is the pointer associated with the availability list?
A. FIRST B. AVAIL C. TOP D. REAR
27) Value of first linked list index is ….
A. 0 B. 1 C. -1 D. 2
28) In linked lists, there are no NULL links in
A. single linked list
B. linear doubly linked list
C. circular linked list
D. linked list
29) Each node in a linked list must contain at least …..
A. Three fields
B. Two fields
C. Four fields
D. Five fields
30) The dummy header in linked list contain …..
A. first record of the actual data
B. last record of the actual data
C. pointer to the last record of the actual data
D. middle record of the actual data
31) The post-order traversal of the binary tree is DEBFCA. Find out the pre-order
traversal.
A. ABFCDE
B. ADBFEC
C. ABDECF
D. ABDCEF
32) While converting the binary tree into an extended binary tree, all the original nodes in
the binary tree are …….
A. Internal nodes on extended tree
B. External nodes on extended tree
C. Vanished on extended tree
D. Intermediate nodes on extended tree
33) The in-order traversal of the tree will yield a sorted listing of elements of tree in ……..
 A. binary trees
B. binary search trees
C. heaps
D. binary heaps
34) In a binary tree, certain null entries are replaced by special pointers which point to
nodes higher in the tree for efficiency. These special pointers are called ………
A. Leaf
B. Branch
C. Path
D. Thread
35) In a head tree …..
A. values in a node are greater than every value in the left subtree and smaller
than the right subtree. B. values in a node are greater than every value in children
of it.
C. conditions.
D. terms.
36) The in-order traversal of the tree will yield a sorted listing of elements of tree in…
A. Binary trees
B. Binary search trees
C. Merging
D. AVL Trees
37) In a graph if e=(u,v) means …….
A. u is adjacent to v but v is not adjacent to u.
B. e begins at u and ends at v
C. u is node and v is an edge.
D. both u and v are edges.
38) A binary tree whose every node has either zero or two children is called ………
A. Complete binary tree
B. Binary Search tree
C. Extended binary tree
D. E2 tree
39) If every node u in G is adjacent to every other node v in G, A graph is said to be ……..
A. isolated
B. complete
C. finite
D. strongly connected.
40) The post order traversal of a binary tree is DEBFCA. Find out the pre-order Traversal.
A. ABFCDE
B. ADBFEC
C. ABDECF
D. ABDCEF
41. ……… form of access is used to add and remove nodes from a queue.
A. LIFO, Last In First Out
B. FIFO, First In First Out
C. Both a and b
D. None of these
42) In liked representation of stack ……. holds the elements of the stack.
A. INFO fields
B. TOP fields
C. LINK fields
D. NULL fields
43) …….. form of access is used to add remove nodes from a stack.
A. LIFO
B. FIFO
C. Both A and B
D. None of these
44) In the linked representation of the stack ……… behaves as the top pointer variable of
stack.
A. Stop pointer
B. Begin pointer
C. Start pointer
D. Avail pointer
45) New nodes are added to the ……… of the queue.
A. Front
B. Back
C. Middle
D. Both A and B
46) In linked representation of stack the null pointer of the last node in the list signals
……….
A. Beginning of the stack
B. Bottom of the stack
C. Middle of the stack
D. In between some value
47) What happens when you push a new node onto a stack?
A. The new node is placed at the front of the linked list
B. The new node is placed at the back of the linked list
C. The new node is placed at the middle of the linked list
D. No Changes happens
48) A queue is a ………
A. FIFO
B. LIFO
C. FILO
D. LOFI
49) Which of the following name does not relate to stacks?
A. FIFO lists
B. LIFO lists
C. Piles
D. Push down lists
50) The retrieval of items in a stack is ……….. operation.
A. push
B. pop
C. retrieval
 D. access

PART B (25 x 2 = 50 marks)

1. What are the different data types available in “C‟?
2. What are Keywords?
3.What is meant by Enumerated data type.
4. Difference between Local and Global variable in C.
5. What are Operators? Mention their types in C.
6. Differentiate between data type and data structures.
7. Give examples of Linear and Non-Linear Data Structures.
8. List the operation of set ADT?
9. Give some applications of stack.
10. Define Dequeue.
11. Distinguish between stack and queue.
12. State the difference between array and linked list.
13. Convert the infix (a+b)*(c+d)/f into postfix & prefix expression
14. Define Doubly Linked List.
15. Define node, degree, siblings, depth/height, level.
16. Define nonterminal nodes in a tree
17. What are the tasks performed during preorder traversal?
18. What are the tasks performed during inorder traversal?
19. Give the pre & postfix form of the expression (a + ((b*(c-e))/f).
20. What is undirected graph.
21. Define a weakly connected graph.
22. Define a weighted graph.
23. Define parallel edges
24. Define a path in a graph.
25. Give the adjacency list representation for the following