2025 exam paper BIT201 · Data Structures and Algorithms · BIT Semester 3 ==================== Exam | Full marks | Pass marks | Time 2025 regular | 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. Define stacks. [1] 2. Define lists. [1] 3. Define queues. [1] 4. Define recursion. [1] 5. Define trees. [1] 6. Define trees. [1] 7. Define graphs. [1] 8. Define stacks. [1] 9. Define queues. [1] 10. Define queues. [1] Group B Attempt any five questions. [5 × 5 = 25] 1. Explain stacks with a suitable example. [5] 2. Explain queues and its importance. [5] 3. Explain lists in detail. [5] 4. Explain recursion and its importance. [5] 5. Explain trees with a suitable example. [5] 6. Explain sorting and searching with a suitable example. [5] Group C Attempt any two questions. [2 × 10 = 20] 1. Explain queues in detail. Support your answer with an example. [10] 2. Explain lists in detail. Support your answer with an example. [10] 3. Explain recursion in detail. Support your answer with an example. [10] Downloaded from BCA Sansar — free study materials for Nepali students.