CSC211 Data Structures and Algorithms

Data Structures 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.

3×Asked in 2081, 2080, 2075
Define circular queue. How queue differ from stack. Write a program to implement linear queue.Answer coming10
See the wording in each paper
3×Asked in 2081, 2080, 2078
Define list. How can you use linked list to implement stack? Explain circular linked list.Answer coming10
See the wording in each paper
3×Asked in 2080, 2078, 2077
Explain push and pop operations of stack. What are different applications of stack?Answer coming5
See the wording in each paper
3×Asked in 2081, 2079, 2075
Write short notes on: 1. Breadth First traversal of graph 1. TOHAnswer coming5
See the wording in each paper
- Write short notes on: 1. Breadth First traversal of graph 1. TOHTU Board 2081
- Write short noes on: a) Priority Queue b) Breadth First traversal of a graphTU Board 2079
- Discuss depth first and breadth first traversal of a graph with suitable example.TU Board 2075
3×Asked in 2079, 2078, 2077
Evaluate the postfix expression 574 8/4+ using stack.Answer coming5
See the wording in each paper
- Evaluate the postfix expression 574 8/4+ using stack.TU Board 2079
- Evaluate the expression ABCD x+ using stack where A=5, B=4, C=3 and D=7TU Board 2078
- Explain algorithm for evaluation of postfix expression using stackTU Board 2077
2×Asked in 2079, 2074
Write a program to implement binary search.Answer coming5
See the wording in each paper
- Write a program to implement binary search.TU Board 2079
- Differentiate between sequential searching and binary searching.TU Board 2074
2×Asked in 2080, 2075
Explain binary search with an example. What is the time complexity of binary search?Answer coming5
See the wording in each paper
- Explain binary search with an example. What is the time complexity of binary search?TU Board 2080
- How do you implement binary search algorithm? What is time complexity of this algorithm?TU Board 2075
2×Asked in 2078, 2077
Hand test selection sort with array of numbers 4, 71, 32, 19, 61, 2, 5 in descending order.Answer coming10
See the wording in each paper
- Hand test selection sort with array of numbers 4, 71, 32, 19, 61, 2, 5 in descending order.TU Board 2078
- Hand test bubble sort with array of numbers 53, 42, 78, 3, 5, 2, 15 in ascending order.TU Board 2077
2×Asked in 2078, 2075
How do you find complexity of algorithms? ExplainAnswer coming10
See the wording in each paper
- How do you find complexity of algorithms? ExplainTU Board 2078
- What do you mean by complexity of algorithms? How do you find time complexity?TU Board 2075
2×Asked in 2078, 2074
What is binary search tree? Write a program to implement insertion and deletion algorithms in binary search tree.Answer coming10
See the wording in each paper
- What is binary search tree? Write a program to implement insertion and deletion algorithms in binary search tree.TU Board 2078
- Illustrate the algorithm for Binary search tree with example.TU Board 2074
2×Asked in 2081, 2079
Sort the number 82, 73, 12, 39, 26, 88, 2, 9, 60, 41 using shell sort.Answer coming5
See the wording in each paper
- Sort the number 82, 73, 12, 39, 26, 88, 2, 9, 60, 41 using shell sort.TU Board 2081
- Sort the numbers 82,73,12,39,26,88,2,9,60,41 using shell sort.TU Board 2079
2×Asked in 2080, 2077
Write Dijkstra's algorithm to find shortest path between any two vertices of a graph.Answer coming5
See the wording in each paper
- Write Dijkstra's algorithm to find shortest path between any two vertices of a graph.TU Board 2080
- What is shortest path? Explain Dijkstra algorithm for finding shortest path using suitable example.TU Board 2077
2×Asked in 2081, 2077
Write a program to find GCD of two numbers using recursion.Answer coming5
See the wording in each paper
- Write a program to find GCD of two numbers using recursion.TU Board 2081
- Write a recursive program to find GCD of two numbers.TU Board 2077