BSc CS Sem 2 BSc CS Semester 2 (ATKT) 2019 2020 Nov 2020 ATKT DATA STRUCTURES Question Paper - Mumbai University | munotes

Questions asked in this paper

• 2) Figures to the right indicate marks

1. Q3 Illustrations, in-depth answers and diagrams will be appreciated
2. Q4 Mixing of sub-questions is not allowed
3. Q1 Attempt All(Each of 5 marks)
   • (2) Multiple Choice Questions The elements of an array are stored successively in memory cells because
   • A. the architecture of computer memory does arrays to store
   • B. by this way computer can keep track only the address of the first aid the addresses of other can be calculated
   • C. both of
   • D. none of above
4. Q2 Which of the following algorithmic paradigm is used in the merge sort?
   • C. Greedy method D. Divide and Conquer
5. Q3 The data structure required to evaluate a postfix expression is
6. Q4 The pre-order and post order traversal of a Binary Tree generates the same output. The tree can have maximum
   • C. One node Any number of nodes
7. Q5 What Member function places a new node at the end of the linked list?
   • (b) in the blanks ( queue, dequeue, 15 ,"push" and "pop" , stack, 16, referential structure, nodes )
8. Q1 related to the Stack
9. Q2 process removes data from the front of the single ended queue
10. Q3 6,8, 4,3, and 1 are inserted into a data structure in that order. An item is deleted using only a 5 basic data structure operation. If the deleted item is a 1, the data structure cannot be a
11. Q4 is used to implement linked list the maximum possible number of nodes in a binary tree at level 3
12. Q2 Define Complexity
13. Q3 Define Circular Linked List +) Define Binary Tree
14. Q5 What are different operations on data structures?
15. Q2 Attempt the following. (Any THREE)(Each of 5 Marks) (15M)
    • a) What is Abstraction? Explain with its different types
    • b) Write short note on Bag ADT What is array? Explain working of 2D- Array
    • d) How to create python list and insert new item at the end of it?
16. Q2 Short note on Big-O notation
    • f) What is Binary search? Consider following list of items and write steps to search element 25
17. Q3 Attempt the following. (Any THREE)(Each of 5 Marks) (15M)
    • a) Explain representation of Linked List? Write python code for traversal and searching
    • b) Write short note on Polynomial ADT
    • c) What is Stack? Explain working of insertion and deletion
    • d) Consider following postfix expression and check weather its valid or invalid using stack
    • e) Write a program to implement queue insertion and deletion
    • f) What is Multi-Linked List? Explain working with suitable example
18. Q4 Attempt the following. (Any THREE)(Each of 5 Marks) (15M)
    • a) What is recursion? What are properties of Recursion? Write code for calculating factorial What is Hashing? Explain clustering
    • c) Sort set of elements using merge sorting technique
    • d) Fora given tree perform inorder, preorder and postorder traversal
    • e) Draw a binary tree using following traversal techniques
    • f) What is Heap? What are different types of Heap representation?
19. Q5 Attempt the following. (Any THREE)(Each of 5 Marks) (15M)
    • a) Explain iterator ADT with example
    • b) How to build linked list using Tail reference? Write a program for appending node Represent following expression using tree
    • d) What is sorting? Consider following list of items and write step by step moves to sort this list Generate Heap using following sequence

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