Exam Paper Code - 11009

Tata Institute of Social Sciences

School of Vocational Education

Programme Name: B. Voc. In Software Development Sem 3 Exam : Main

Course Title : Data Structure Course Code : BVOC-SD 3.2

Exam Date : 27/2/23 Venue : TISS SVE HUB

Time : 10 am to 1 pm Session : Morning

Total Marks : 100 Duration : 3 Hours

Instructions: Write concise, to the point answers. Longer is not always better. Rambling answers that do not convey
understanding of the subject will be penalized by lower marks. As far as possible, bullet point your answers. Please
write neatly, someone will have to read your handwriting. Clearly mark question numbers so the evaluator knows
which question you are answering.

Q1. Multiple Choice Questions : Two main measures for the efficiency of an algorithm are 1 Marks

1) Processor and memory 2) Complexity and capacity 3) Time and space 4) Data and space

Q2. Multiple Choice Questions : Which of the following case does not exist in complexity theory 1 Marks

1) Best case 2) Worst case 3) Average case 4) Null case

Q3. Multiple Choice Questions : Which of the following data structure is not linear data structure? 1 Marks

1) Arrays 2) Linked lists 3) Both of above 4) None of above

Q4. Multiple Choice Questions : Any node is the path from the root to the node is called 1 Marks

1) Successor node 2) Ancestor node 3) Internal node 4) None of the above

Q5. Multiple Choice Questions : Which of the following data structures are indexed structures? 1 Marks

1) Linear arrays 2) Linked lists 3) Queue 4) Stack

Q6. Multiple Choice Questions : Very slow way of sorting is .......... 1 Marks

1) Insertion sort 2) Heap sort 3) Bubble sort 4) Quick sort

 1/6 Exam Paper Code - 11009
Q7. Multiple Choice Questions : A doubly linked list has .......... pointers with each node. 1 Marks

1) 0 2) 1 3) 2 4) 3

Q8. Multiple Choice Questions : A ............. is a header list where the last node points back to the 1 Marks
header node.
1) rounded header list 2) circular header list 3) common header list 4) forward header list

Q9. Multiple Choice Questions : A linear list in which each node has point to the predecessor and 1 Marks
successors nodes is called ........
1) singly linked list 2) circular linked list 3) doubly linked list 4) linear linked list

Q10. Multiple Choice Questions : Binary trees with threads are called as ........... 1 Marks

1) Threaded trees 2) Pointer trees 3) Special trees 4) Special pointer trees

Q11. Multiple Choice Questions : A terminal node in a binary tree is called ............ 1 Marks

1) Root 2) Leaf 3) Child 4) Branch

Q12. Multiple Choice Questions : In a linked list the .......... field contains the address of next element 1 Marks
in the list.
1) Link field 2) Next element field 3) Start field 4) Info field

Q13. Multiple Choice Questions : _________refers to a linear collection of data items. 1 Marks

1) List 2) Tree 3) Graph 4) Edge

Q14. Multiple Choice Questions : Which if the following is/are the levels of implementation of data 1 Marks
structure
1) Abstract level 2) Application level 3) Implementation level 4) All of the above

Q15. Multiple Choice Questions : A ....... is a data structure that organizes data similar to a line in the 1 Marks
supermarket, where the first one in line is the first one out.
1) Queue linked list 2) Stacks linked list 3) Both of them 4) Neither of them

Q16. Multiple Choice Questions : Identify the data structure which allows deletions at both ends of 1 Marks
the list but insertion at only one end.
1) Input restricted dequeue 2) Output restricted qequeue 3) Priority queues 4) Stack
 2/6 Exam Paper Code - 11009
Q17. Multiple Choice Questions : To represent hierarchical relationship between elements, Which 1 Marks
data structure is suitable?
1) Dequeue 2) Priority 3) Tree 4) Graph

Q18. Multiple Choice Questions : A tool for specifying logical properties of a data type is……….. 1 Marks

1) Abstract Data Type 2) Logical Data Type 3) Non Abstract Data Type 4) Linear Data Type

Q19. Multiple Choice Questions : Which sorting method(s) runs fastest for file which is already 1 Marks
sorted?
1) selection sort 2) insertion sort 3) bubble sort 4) quick sort

Q20. Identify True or False. If False write correct statement. : All nodes in a list point to some other 1 Marks
node.
1) TRUE 2) FALSE

Q21. Identify True or False. If False write correct statement. : In a queue, elements are both inserted 1 Marks
and deleted from one end.
1) TRUE 2) FALSE

Q22. Identify True or False. If False write correct statement. : AVL Ttrees are variations of Binary 1 Marks
Search Trees.
1) TRUE 2) FALSE

Q23. Identify True or False. If False write correct statement. : A node of n children should have n 1 Marks
values.
1) TRUE 2) FALSE

Q24. Identify True or False. If False write correct statement. : A tree is an example of a linear data 1 Marks
structure.
1) TRUE 2) FALSE

Q25. Identify True or False. If False write correct statement. : A node with no children is called a leaf 1 Marks
node.
1) TRUE 2) FALSE

Q26. Multiple Choice Questions : A data structure is a logical method of representing …….. in 1 Marks
memory.
1) database 2) item 3) data 4) record
 3/6 Exam Paper Code - 11009
Q27. Multiple Choice Questions : _________is the process of visiting every node in a tree atleast 1 Marks
once.
1) Travsersal 2) searching 3) sorting 4) selection

Q28. Multiple Choice Questions : In ……………………..traversal, the root node is visited first. 1 Marks

1) postorder 2) inorder 3) preorder 4) traverse

Q29. Multiple Choice Questions : ________pointers are used to traverse a doubly linked list. 1 Marks

1) 1 2) 2 3) 3 4) 4

Q30. Multiple Choice Questions : Children of the same parent are called…………………... . 1 Marks

1) subtree 2) twins 3) siblings 4) child

Q31. Multiple Choice Questions : The complexity of the average case of an algorithm is 2 Marks

1) Much more complicated to analyze than that of worst case 2) Much more simpler to analyze than that of
worst case 3) Sometimes more complicated and some other
times simpler than that of worst case 4) None or above
Q32. Multiple Choice Questions : The elements of an array are stored successively in memory cells 2 Marks
because
1) by this way computer can keep track only the address of
the first element and the addresses of other elements can be calculated 2) the architecture of computer memory
does not allow arrays to store other
than serially 3) both of above 4) none of above
Q33. Multiple Choice Questions : The time complexity of quick sort is ........ 2 Marks

1) O(n) 2) O(logn) 3) O(n2) 4) O(n logn)

Q34. Multiple Choice Questions : A ..........list is a header list where the node points back to the 2 Marks
header node.
1) Circular header 2) Grounded header 3) Two way header 4) One way header

Q35. Multiple Choice Questions : Trees are said .......... if they are similar and have same contents at 2 Marks
corresponding nodes.
1) Duplicate 2) Carbon copy 3) Replica 4) Copies

Q36. Multiple Choice Questions : In-order traversing a tree resulted E A C K F H D B G; the pre- 2 Marks
order traversal would return.
1) FAEKCDBHG 2) FAEKCDHGB 3) EAFKHDCBG 4) FEAKDCHBG
 4/6 Exam Paper Code - 11009
Q37. Multiple Choice Questions : Which of the following is true about the characteristics of abstract 2 Marks
data types?i) It exports a type.ii) It exports a set of operations
1) True, False 2) False, True 3) True, True 4) False, False

Q38. Multiple Choice Questions : Simulations are implemented using _______ data structure. 2 Marks

1) Stack 2) Queue 3) Linked list 4) Tree

Q39. Identify True or False. If False write correct statement. : Structured data types include 2 Marks
operations performed on data types.
1) TRUE 2) FALSE

Q40. Identify True or False. If False write correct statement. : Sorting is always performed on the 2 Marks
elements stored in primary memory.
1) TRUE 2) FALSE

Q41. Identify True or False. If False write correct statement. : A self-referential structure contains a 2 Marks
pointer member that points to a structure of the same structure type. For example, the following
definition of structure node. struct node { int data; struct node *nextPtr; };
1) TRUE 2) FALSE

Q42. Identify True or False. If False write correct statement. : Priority queue’s priority function 2 Marks
cannot be changed.
1) TRUE 2) FALSE

Q43. Multiple Choice Questions : The assertion given in the beginning segment in an algorithm is 2 Marks
called a ……………………..
1) end 2) precondition 3) postcondtion 4) initial

Q44. Multiple Choice Questions : If a node is a terminal node, then its left child and right child field 2 Marks
are filled with………………....
1) last 2) NULL 3) end 4) none of above

Q45. Multiple Choice Questions : The………………………...method is optimal because the sorted 2 Marks
array is developed without using any extra storage space.
1) selection sort 2) bubble sort 3) merge sort 4) Insertion Sort

Answer any 8 out of 10

Q46) Explain : What is algorithm? 5 Marks

Q47) Explain : What is a queue in data-structure? 5 Marks
Q48) Explain : What is bubble sort and how bubble sort works? 5 Marks
 5/6 Exam Paper Code - 11009
Q49) Explain : What is a binary tree? 5 Marks
Q50) Explain : How Prim's algorithm finds spanning tree? 5 Marks
Q51) Explain : What is the advantage of the heap over a stack? 5 Marks
Q52) Explain : What are doubly linked lists? 5 Marks
Q53) Explain : What actions are performed when a function is called? 5 Marks
Q54) Explain : Why you need a data structure? 5 Marks
Q55) Do As Directed : List the applications of stacks. 5 Marks