Tribhuvan University
Bachelor of Science in Computer Science and Information Technology
Semester 3 · TU Board 2078
Course Title: Data Structures and Algorithms (CSC211)
Full Marks: 60Pass Marks: 24Time: 3 hours
Candidates are required to give their answers in their own words as far as practicable. The figures in the margin indicate full marks.
Attempt any TWO Questions (2 x 10 = 20)(2 × 10 = 20)
- 1.10
Define Queue. Write are different applications of queue? Explain queue operations with example.
Answer comingAlso asked in 2080, 2077
- 2.10
Explain circular linked list with example. How do you implement linked list operation in singly linked list? Explain.
Answer comingAlso asked in 2081, 2080
- 3.10
What is binary search tree? Write a program to implement insertion and deletion algorithms in binary search tree.
Answer comingAlso asked in 2074
- 4.10
How do you find complexity of algorithms? Explain
Answer comingAlso asked in 2075
- 5.10
Evaluate the expression ABCD-x+ using stack where A=5, B=4, C=3 and D=7
Answer comingAlso asked in 2079, 2077
- 6.10
What is priority queue? Why do you need this type of queue?
- 7.10
Write a recursive program to find nth fibonacci number.
- 8.10
Explain array implementation of list.
- 9.10
Hand test selection sort with array of numbers 4, 71, 32, 19, 61, 2, -5 in descending order.
Answer comingAlso asked in 2077
- 10.10
Write a program to implement sequential search algorithm.
- 11.10
What is graph traversal? Explain.
- 12.10
Write short notes on:
- Divide and Conquer sorting
- AVL Tree
Attempt any EIGHT Questions (8 x 5 = 40)(8 × 5 = 40)
- 1.10
Define Queue. Write are different applications of queue? Explain queue operations with example.
Answer comingAlso asked in 2080, 2077
- 2.10
Explain circular linked list with example. How do you implement linked list operation in singly linked list? Explain.
Answer comingAlso asked in 2081, 2080
- 3.10
What is binary search tree? Write a program to implement insertion and deletion algorithms in binary search tree.
Answer comingAlso asked in 2074
- 4.10
How do you find complexity of algorithms? Explain
Answer comingAlso asked in 2075
- 5.10
Evaluate the expression ABCD-x+ using stack where A=5, B=4, C=3 and D=7
Answer comingAlso asked in 2079, 2077
- 6.10
What is priority queue? Why do you need this type of queue?
- 7.10
Write a recursive program to find nth fibonacci number.
- 8.10
Explain array implementation of list.
- 9.10
Hand test selection sort with array of numbers 4, 71, 32, 19, 61, 2, -5 in descending order.
Answer comingAlso asked in 2077
- 10.10
Write a program to implement sequential search algorithm.
- 11.10
What is graph traversal? Explain.
- 12.10
Write short notes on:
- Divide and Conquer sorting
- AVL Tree
— The End —