P.D. Patil Institute Of Polytechnic And Technology DSU Exam - November 2024 PDF

**P.D. PATIL INSTITUTE OF POLYTECHNIC AND TECHNOLOGY, TALEGAON FIRST PROGRESSIVE ASSESMENT TEST, NOVEMBER-2024** **DEPARTMENT OF COMPUTER ENGINEERING** **Course Code: CW-3K** **Semester: 3rd Sem** **Subject: DSU Subject Code: 313301** **Max Marks: 30 Times: 90 Minutes** **\...\...\...\...\...\...

**P.D. PATIL INSTITUTE OF POLYTECHNIC AND TECHNOLOGY, TALEGAON FIRST PROGRESSIVE ASSESMENT TEST, NOVEMBER-2024** **DEPARTMENT OF COMPUTER ENGINEERING** **Course Code: CW-3K** **Semester: 3rd Sem** **Subject: DSU Subject Code: 313301** **Max Marks: 30 Times: 90 Minutes** **\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...\...** **Q1. Attempt any FIVE \[5 X 2= 10\]** \(a) Differentiate between stack and queue. (any two points) (CO4) \(b) Show the memory representation of stack using array with the help of a diagram. (CO4) \(c) Convert the following infix expression to its prefix form using stack A+B-C\*D/E+F (CO4) \(d) Define queue. State any two applications where queue is used. (CO5) \(e) Evaluate the following prefix expression : -- \*+ 4 3 2 5 show diagrammatically each step of evaluation using stack. (CO4) \(f) Draw the diagram of circular queue with front and rear pointers. (CO5) \(g) Draw a binary search tree for the given numbers : 50, 33, 44, 22, 77, 35, 60, 40. (CO6) **Q2. Attempt any FIVE \[5 x 4 = 20\]** (a). Convert the following Infix expression to its prfix form using stack. Show the details of stack at each step of conversion. Expression : P \* Q ↑ R -- S / T + \[U/V\]. (CO4) \(b) Show the effect of PUSH and POP operation on to the stack of size 10. The stack contains 40, 30, 52, 86, 39, 45, 50 with 50 being at top of the stack. Show diagrammatically the effect of : (i) PUSH 59 (ii) PUSH 85 (iii) POP ) POP (v) PUSH 59 (vi) POP Sketch the final structure of stack after performing the above said operations. (CO4) (c). Convert following expression into postfix form. Give stepwise procedure. A + B ↑ C \* (D / E) -- F / G (CO4) (d). Create a singly linked list using data fields 90, 25, 46, 39, 56. Search a node 40 from the SLL and show procedure step-by-step with the help of diagram from start to end. : (CO3) (e)Draw an expression tree for the following expression : (a -- 2b + 5c)^2^ \* (4d = 6e)^5^: (CO6) \(f) Traverse the following tree by the in-order, pre-order and post-order methods : (CO6)