BSc CS Sem 3 BSc CS Semester 3 (2022 2023) Oct 2023 DATA STRUCTURES Question Paper - Mumbai University | munotes
Loading PDF...
Older exam
Oct 2023 - JAVA BASED APPLICATION DEVELOPMENT
Semester-end · BSc CS Semester 3 (2022 2023)
→
Newer exam
Oct 2023 - CREATIVE CONTENT WRITING
Semester-end · BSc CS Semester 3 (2022 2023)
→
Questions asked in this paper
- 2) Figures to the right indicate marks
-
Q3 Illustrations, in-depth answers and diagrams will be appreciated
-
Q4 Mixing of sub-questions is not allowed
-
Q1 Attempt the following, (Any Four)
- a) What is data structures? Explain different types of data structures
- b) What is ADT? How to create user-specific ADT? How to use Linked List for polynomial equation? Explain with suitable example
- d) What is Stack? What are different advantages and disadvantages of it?
- e) Consider following infix expression and convert it into prefix and postfix notation,
- f) What is Queue? Explain linked representation of Queue
-
Q2 Attempt the following. (Any Four) [ 20 marks
- a) How to delete any node from Doubly Linked List from end?
- b) Write short note on Balanced Binary Tree
- c) Define depth, height and size of any node of a tree Consider following tree and find depth of G, height of H, size of B
- d) Consider above tree and find inorder, preorder and postorder
- e) Consider following elements and draw max Heap
- f) What is Priority Queue? Explain applications of it
-
Q3 Attempt the following. (Any Four) 20 marks
- a) What is Graph? What are different operations can be perform on Graph?
- b) Consider following graph and draw Adjacency matrix and Adjacency list
- c) Consider following graph and find out sequence in which all nodes get access using
- d) The keys 12, 18, 13, 2, 3, 23, 5 and 15 are inserted into an initially empty hash table of length 10 using open addressing with hash function h(k) = k mod 10 and linear probing. What is the resultant hash table?
- e) What is Hashing? What are the different components of Hashing?
- f) How to Choose Hash Function? What are different characteristics of good Hash
-
Q4 Attempt the following. (Any Five) [1SMarks]
- a) What is Singly Linked List?
- b) What is reverse polish notation?
- c) What is AVL tree?
- d) State advantages of Doubly Linked List What are the different traversal techniques of Graph?
Read from the scan above, so a character or two may differ. The scan is the original.
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.
Related Resources
Something wrong with this paper? Report it.
Connected Papers
BSc CS / Sem 3 · 72 papers
2017 - ATKT Combinatorics And Graph Theory
2017 - ATKT Database Management System
2017 - ATKT Operating System
2017 - ATKT Skill Enhancement Web Programming
2016 - ATKT COMPUTER III
2016 - ATKT COMPUTER II
2015 - ATKT Computer I
2014 - Comp I ADD
2014 - Comp II ADD 15 1
2014 - Comp III ADD
2014 - ATKT Comp III
2014 - ATKT Maths I
Questions? Email contact@munotes.in
Done!