B.Sc. (Data Science) SEM III 2023 2024 2024 DATA STRUCTURES AND ALGORITHMS USING PYTHON Question Paper - Mumbai University | munotes

Questions asked in this paper

1. Q1 Attempt any tliree of the following: 15M
   • a. Explain the concept of Shallow and deep copying
   • b. What are the goals, principles and patterns of python programming
   • c. Write a note on Recursion and backtracking
   • d. Write a short note on Asymptotic analysis
   • e. Explain ChainMaps in detail
   • f. Write a short note on Ordered dietionaries
2. Q2 Attempt any three of the following: 15M
   • a. Explain in detail array pointer concept
   • b. Differentiate between append operation and a faster append operation
   • c. Explain in detail deleting nodes in the singly linked list
   • d. Explain Doubly linked list class in detail
   • e. Explain operation of circular linked list with suitable example
   • f. Write a short note on Bracket-matching application ; Q3. Attempt any three of the following: 15M
   • a. Write a program to implement inorder, preorder and postorder traversal of trees
   • b. Explain the stack based implementation of a queue
   • c. Write a program to demonstrate Breadth-first traversal
   • d. List out the benefits of a binary search tree
   • e. Explain in detail Ternary search tree
   • f. Explain the concept of finding the minimum and maximum nodes in the tree
3. Q4 Attempt any three of the following: 15M
   • a. Explain different types of hashing functions,
   • b. Write a short note on Chaining
   • c. Explain the concept of Graph traversal in detail
   • d. Write a short note on Weighted graph VCD/ S.Y.B.S.C(Data Science) SEMIII Data Structures and Algorithm Using
   • e. Explain the following terms: Explain in detail breadth first traversal in graph Attempt any three of the following: 15M
   • a. Explain in detail the Quick sort algorithm
   • b. Write a note on the Median of medians partitioning step
   • c. Sort the elements using selection sort algorithm
   • d. Explain the concept of pivot selection illustrated with an example
   • e. a short note on Brute- force algorithm Explain the concept of Insertion sort algorithm with example

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