B.Sc. (Computer Science) Sem 3 Data Structures Nov 2024 Question Paper - Mumbai University | munotes

Questions asked in this paper

1. Q1 All questions are compulsory
2. Q2 Mixing of sub questions are allowed
3. Q3 Write in clear and legible writing Attempt any FOUR (20)
   • A) Explain different type.s of data structures and give their classifications
   • B) What is Linked List? Explain different types of ADT of Linked List
   • C) What is Stack? Explain Advantages and Disadvantages of Stack
   • D) Explain of Stack like prefix to postfix notation with the help of an Example
   • E) What is Queue? Explain different types of ADT of Queue
   • F) What is Circular Queue? Explain Advantages and Disadvantages of Queue Q Attempt any FOUR (20)
   • A) What is Doubly Linked List? Explain Advantages and Disadvantages of Doubly Linked
   • B) Explain Basic Operation carried out in Doubly Linked List
   • C) What ts Tree? Explain different types of ADT of Tree
   • D) What is BST? Explain with the help of an Example
   • E) Explain and Traversals of Tree’s
   • F) Explain Application of Heaps with the help of an Example Attempt any FOUR (20)
   • A) What is Graph? Explain Advantages and Disadvantages of Graph
   • B) Explain Basic Operation carried out in Graph
   • C) Explain Graph Representation using adjacency matrix
   • D) Explain Graph operations like deletion of nodes
   • E) Explain Concept of Hashing
   • F) Explain Collision? Explain Different types of Collision
4. Q1 V Attempt any FIVE 15 marks
   • A) What is ADT? How does the user Creates user-specific ADT?
   • B) Explain Application of Linked List like with the help of an Example
   • C) What is Doubly Linked List? Explain types of ADT of Doubly Linked List
   • D) Explain Insertion and deletion cf nodes at various in Doubly Linked List
   • E) What is Graph? Explain different types of ADT of
   • F) Explain Graph Traversa!s with the heip of BFS Algorithm

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