B.TECH - Semester 3 data structures and algorithms Question Paper 2019 (apr)
Practice authentic previous year university questions for better exam preparation.
Sample Questions
- 306 : DATA STRUCTURES AND ALGORITHMS (FR) Time : 3 Hours Max. Marks : 100 PART - A Answer all questions.
- What is frequency count? Explain with an example.
- Compare array and linked list.
- How will you check the validity of an arithmetic expression using stack ?
- Write an algorithm for deleting a node from a specified position in a circular queue.
- Free memory blocks of size $60 \mathrm{~K}, 25 \mathrm{~K}, 12 \mathrm{~K}, 35 \mathrm{~K}, 45 \mathrm{~K}$ and 40 K are available in this order. Show the memory allocation for a sequence of job requests of size $22 \mathrm{~K}, 10 \mathrm{~K}, 42 \m...
- Analyse the best and worst case behavior of binary search algorithm.
- List out any two applications of graphs.
- What do you mean by stability of a sorting algorithm ? Give examples for stable sorting techniques.
- Write a pseudocode to concatenate two strings.
- List any four hashing functions. PART - B Answer any one full question from each Module, 20 marks each.
- P.T.O.
- Write down preorder, inorder and postorder traversal the tree.
- Module - IV
- 1) When collisions are handled by separate chaining. 2) When collisions are handled by linear probing. 3) When collisions are handled by double hashing using second hash function $\mathrm{h}^{\prime}=5-(5 \bmod \mathrm{k})$.