| Exam | Full marks | Pass marks | Time |
|---|---|---|---|
| 2020 back | 60 | 24 | 3 hours |
Tribhuvan University · Institute of Science and Technology · BIT Semester 3 · BIT201 Data Structures and Algorithms. Candidates are required to give their answers in their own words as far as practicable.
Group A
Attempt all questions. [10 × 1 = 10]
- 1.[1]
Define queues.
- 2.[1]
Define stacks.
- 3.[1]
Define lists.
- 4.[1]
Define lists.
- 5.[1]
Define trees.
- 6.[1]
Define sorting and searching.
- 7.[1]
Define introduction.
- 8.[1]
Define introduction.
- 9.[1]
Define stacks.
- 10.[1]
Define queues.
Group B
Attempt any five questions. [5 × 5 = 25]
- 1.[5]
Explain stacks in detail.
- 2.[5]
Explain queues in detail.
- 3.[5]
Explain lists in detail.
- 4.[5]
Explain recursion in detail.
- 5.[5]
Explain trees in detail.
- 6.[5]
Explain sorting and searching in detail.
Group C
Attempt any two questions. [2 × 10 = 20]
- 1.[10]
Explain queues with a suitable example. Support your answer with an example.
- 2.[10]
Explain lists and its importance. Support your answer with an example.
- 3.[10]
Explain recursion in detail. Support your answer with an example.