munotes®

B.Sc. (Data Science) SEM III 2022 2023 2023 DATA STRUCTURE AND ALGORITHM USING PYTHON Question Paper - Mumbai University | munotes

S.Y.D.S SEM III DATA STRUCTURE AND ALGORITHM USING PYTHON (7 OC.pdf
SEM III · 2022-2023 · 1 May 2025

Loading PDF...

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 Answer the following (Any three) IS
    • a. Explain inheritance in detail
    • b. the concept of Shallow and Deep Copying Write a program to demonstrate Dequue operations
    • d. Theta notation with proper example
    • e. Explain different goals of python
    • f. Explain in detail amortized analysis
  4. Q11 Answer the following .(Any three) 15 marks
    • a. stack and its different operations = b. Write a program to demonstrate append operation in single linked list Explain a double linked list with proper representation
    • d. Write a program to demonstrate arrays structure
    • e. Explain in detail Deleting an element in a circular list Write a program to Bracket-matching application Answer the following.(Any three) 15 Mark
    • a. Explain Node-based queues with proper representation
    • b. Post-order traversal with proper example Write a program to demonstrate Breadth-first traversal
    • d. Ternary search tree in detail Write a program to delete a node from a tree
    • f. in detail Binary search tree operations Answer the following.(Any three) 15 Marks
    • a. Write a program to retrieve elements from the hash table
    • b. chaining concept with suitable example
    • c. Explain in detail the priority queue
    • d. a to demonstrate inseriion operation in heap Write a short note on the selection algorithm Convert the below graph in adjacency matrix DATA STRUCTURE AND ALGORITHM USING PYTHON Answer the following.(Any three) Mark: Sort the below elements using insertion sort
    • b. Program to demonstrate Quick sort algorithm in detail the Median of medians Partitioning Step
    • d. in detail The Rabin-Karp algorithm, Write a program to demonstrate guick sort,
    • f. Randomized Select

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.

Done!
Done!