BIT201 Data Structure and Algorithms
Data Structure and Algorithms: most repeated questions
Questions that have come up in more than one paper, matched by what they ask rather than exact wording. Most repeated first.
- 4×Asked in 2080, 2078How can we use linked list to implement queue? Explain.Answer coming5
See the wording in each paper
- 3×Asked in 2080, 2079, 2078What is stack? Explain different stack operations. Explain algorithm to evaluate postfix expression.Answer coming10
See the wording in each paper
- What is stack? Explain different stack operations. Explain algorithm to evaluate postfix expression.TU Board 2080
- How stack is used in recursion? Explain different stack operations. Explain algorithm to convert an infix expression to postfix using stack.TU Board 2079
- Explain algorithm to convert an infix expression to postfix using stack? Use this algorithm to convert (A+B) C D to postfix.TU Board 2078
- 3×Asked in 2080, 2079, 2078What are different applications of binary tree? Explain.Answer coming5
See the wording in each paper
- 2×Asked in 2080, 2078Why do we need hashing? Explain quadratic probing.Answer coming5
See the wording in each paper
- 2×Asked in 2080, 2078Define recursion. Explain Tower of Hanoi (TOH) with example.Answer coming5
See the wording in each paper
- 2×Asked in 2080, 2079Define spanning tree. Explain minimum spanning tree with example.Answer coming5
See the wording in each paper
- 2×Asked in 2083, 2080Differentiate between doubly linked list and doubly circular linked list.Answer coming5
See the wording in each paper
- 2×Asked in 2083, 2080What is balanced tree? How do you insert and delete a node in a Binary Search Tree? Explain.Answer coming10
- 2×Asked in 2079, 2078What is time complexity? Explain big oh notation with example.Answer coming5
See the wording in each paper