B.TECH - Semester 4 data structures and algorithms Question Paper 2021 (dec)
Practice authentic previous year university questions for better exam preparation.
Sample Questions
- How is a direcled graph represenled? Explain with examples.
- Summarize the methods for analysis of algorithms.
- Compare the basic data structures.
- Write the pseudo code for the basio operations performed on linked lists,
- Explain boundary lag method. 6 Mention the difference between Hashing and Extendible Hashing with examples.
- Discuss the advanlages and Disadvantages of collision resolution strategies.
- Explain insertion sorting with an example.
- Distinguish internal and external sorting. ( $10 \times 4=40$ Marks) P.T.O. Answer one full questions from each Module. Each carries 20 marks
- Explain slack dala structure with ils operations and convert the given Infix expression to Posilix using stack. Expression $A+\left(B^{\circ} C-\left(D / E^{\circ} F\right) \cdot E\right) \cdot M . \quad 20$
- (a) Explain the operations of threaded binary tree. 10
- (b) Summarize the applications of Graph. 10
- (a) Construct a Binary Iree for the given dala and perform all the traversals Data; 782694234397.
- (b) Explain the methods for Physical Representalion of Strings.
- Oulline the breadth first traversal algorithm for a graph and apply the breadth Tirst traversal algorithm lo the following direcled graph. Slarl with node 5 and illustrate the Iraversal process slep by slep. 15 Given inpul \{4371, 1323, 6173, 4199, ...