munotes®

BSc CS Sem 3 2023 2024 2024 DATA STRUCTURES Question Paper - Mumbai University | munotes

DATA STRUCTURES.pdf
SEM 3 · 2023-2024 · 1 May 2025

Loading PDF...

Questions asked in this paper

  • 2) Figures to the right indicate marks
  1. Q3 in-depth answers and diagrams will be appreciated
  2. Q4 Mixing of sub-questions is not allowed
  3. Q1 Attempt any three. [ 20 marks
  4. Q1 What is Linked List? Explain different ADT of Linked List
  5. Q2 How to insert new node at the beginning of Linked List?
  6. Q3 How to use Stack for balanced delimiter? Explain with suitable example
  7. Q4 Give an algorithm for reversing a queue To access the queue, we are only allowed to use the methods of queue ADT
  8. Q5 What is data structures? Explain classification of data structures
  9. Q6 Consider following infix expression and convert it into prefix and postfix notation
  10. Q2 Attempt any three. [ Write short note on Balanced BST 20 marks
  11. Q2 What is Doubly Linked List? State its advantages and disadvantages
  12. Q3 Consider following elements and draw min Heap
  13. Q4 Consider following tree and find out inorder, preorder, postorder traversals
  14. Q5 Consider following string ABCADFABAEF and find the code using Huftman
  15. Q6 What are different advantages and disadvantages of Priority Queue?
  16. Q3 Attempt any three. 20 marks
  17. Q1 Consider above graph and find traversal using DFS
  18. Q2 A table of length 10 uses open addressing with hash function
  19. Q10 and linear probing. After insesting 6 values into an empty hash table, the lable is as shown below. Pind the sequence in which key ilues could have inserted in the table?
  20. Q3 Find out the shortest path of given graph using Dijkstra’s Algorithm
  21. Q4 Write a short note on Collision Resolution Techniques
  22. Q5 What is Graph? What are different types of Graphs?
  23. Q6 Consider following draw Adjacency matrix and list
  24. Q4 Attempt any five. 15 marks
  25. Q1 Define Heap
  26. Q2 Write an algorithm to traverse Singly Linked List
  27. Q3 What is Deque?
  28. Q4 Define Hashing
  29. Q5 What are different applications of Graph?
  30. Q6 Define skew tree with suitable example

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

Report or request

Something wrong on this page? Report it and we will check it against the scan.

Quick Help

No. The full paper opens straight away, with no login and nothing to pay.

Something wrong with this paper? Report it.

Connected Papers
BSc CS / Sem 3 · 72 papers
Browse all →
Questions? Email contact@munotes.in
Done!
Done!