cd3291 Data Structures Modeli QP
cd3291 Data Structures Modeli QP
PART B (5 x 16 = 80 Marks)
11. (A) Explain Shallow and Deep Copying (8)
(B) Explain divide and conquer with an example? (8)
(or)
Explain Asymptotic notations? (16)
13. Explain insertion and deletion of nodes in Doubly Linked List with an example. (16)
(or)
Write a Python implementation for a double ended queue? (16)
Prepared by Approved by
Ms. D.Sujatha
AP / IT HOD/IT