Thapar University 2010 B.E Data Structure & IT - Question Paper
Roll Number:
Thapar University, Patiala Computer Scicnceand Engineering Department
BE (EC 4h SEM) Mid-SemTest CS048: Data structure & IT
March 11. 2010
Time: 02 Hours; MM: 25 Name of Faculty: Rinklc Aggarwal, Ajay Kumar
Instruction to Students:
Attempt all questions. Assume any missing data.
Q 1. Define queue. Discuss the operations (insertion and deletion) on (7)
circular queue with algorithms and examples.
Q 2. Convert the following infix expression into the postfix expression. (4)
X*M-(Y + (P + Q / (R-T) | 2 ) * S - G / H)
Q 3. Write the sequence of steps to insert a given item of information (7) in a sorted (descending) circular header linked list. Explain your algorithm with the help of an example.
Q 4. Write an algorithm to arrange array elements in decreasing order (7)
using quick sort. Explain each and every step with the help of a suitable example w'ith atleast 10 elements.
Attachment: |
Earning: Approval pending. |