This is the old Version of MeroSpark, all the data and pages are migrated to

Data Structure and Algorithm – BSc.CSIT (TU) Question Paper 2072 | Second SEM

Download our Android App from Google Play Store and start reading Reference Notes on your mobile.

Data Structure and AlgorithmTribhuvan University(TU)| Old is Gold
Institute of Science and Technology (IOST)
Subject: Data Structure and Algorithm

Question Paper | Year: 2072
Bachelor Level/ First Year/ Second Semester / Science
Computer Science and Information Technology (CSc.154)

Full Marks: 60 | Pass Marks: 24 | Time: 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.

Section A – Attempt any two questions. [2 X 10 = 20]

1. What is binary search tree? Explain with an example. Write an algorithm to search, insert and delete node in binary search tree.
2. What is Postfix expression? Write an algorithm to evaluate value of postfix expression. Trace the following expression into postfix expression.
((A + B*C) + D- E/F)
3. What is circular queue? Write an algorithm and C function to implement Circular queue.
Section B

Attempt any eight questions. (8 X 5 = 40)

4. What is Recursion? Write a recursive algorithm to implement binary search.
5. Differentiate between array and pointer with example.
6. What is an algorithm? Write down the features of an algorithm.
7. How stack as ADT? Explain with example.
8. What an algorithm and C function to delete node in singly link list.
9. Write an algorithm and C function for merge sort.
10. What do you mean by graph traversal? Explain primes algorithm with example.
11. Differentiate between selection sort and bubble sort.
12. Write and algorithm to implement tower of Hanoi.
13. Write short notes on:

a) Hashing
b) Doubly Link list

Posted By : Hari Prasad Chaudhary | Comment RSS | Category : Bachelor Level, Tribhuvan University
Tag :

Post a Comment

Your email is never published nor shared. Required fields are marked *