BSc CS Sem 2 BSc CS Semester 2 (2020 2021) 2021 DataStructures Question Paper - Mumbai University | munotes

Questions asked in this paper

1. Q5 t tack which data structure is suitable? dequeue priority queue 3 structure Container are Array is not a Which of these best describes an array? hierarchical objects of immutable data 2 Objects of mixed of [store are the advantages of arrays? data types can y element of |elements of 4 8 y yP cannot be be stored sorted array is 1 same data Data structure wastage of memory space |Index value of |Elements are like queue or What are the disadvantages of arrays? if elements 2 stack cannot be inserted in an |be negative accessed lesser than the
2. Q10 |Elements in an array are accessed randomly sequentially ly 1 Acollection of be The entries are There is a Entries in a stack are “ordered”. What is the meaning of y Sequential
3. Q13 this statement? stacks is compared stored ina entry that is sortable with the list one by one In a stack, if a user tries to remove an element from Empty Garbage empty stack it is called Underflow collection Overflow Collection Pushing an element into stack already having five Empty Garbage 4 marks
4. Q15 elements and stack size of 5, then stack becomes Underflow collection Overflow Collection 3 marks
5. Q16 |Which of the following applications may use a stack? balancing local variables |Syntax between two program at run time Analyzer asynchronou The data structure required to check whether an Which of the following operations accesses each record 4 marks
6. Q19 exactly once so that certain items may be processed? Inserting Traversing Searching Deleting Which is the logical or mathematical model of a . Data 2 marks
7. Q29 Which of the following sorting algorithm is of divide and Bubble sort Quick sort Merge sort Insertion memory and capacity Which of the following case does not exist in the The complexity of Bubble sort algorithm is n) log n)
8. Q26 A linear collection of data elements where the linear Linked list Node list Primitive list Unordered 1 node is given by means of pointer is called? list Simulation of Simulation of
9. Q27 |Queues serve major role in Simulation of arbitrary Simulation of Circular Queue is also known as Ring Buffer Square Buffer Curve Buffer 2 marks
10. Q2 A data structure in which elements can be inserted or Queue Circular queue | Dequeue Priority 29- | deleted at/from both the ends but not in the middle is? q q queue A binary tree whose every node has either zero or two complete binary |binary search null binary children is called. tree tree binary tree tree 3 marks

Read from the scan above, so a character or two may differ. The scan is the original.