Questions
Syllabus
Qns. By Syllabus

Semester

Subject

Year

Tribhuwan University

Institute of Science and Technology

2075

Bachelor Level / Second Year / Third Semester / Science

B.Sc in Computer Science and Information Technology (CSC211)

(Data Structures and Algorithms)

Full Marks: 60

Pass Marks: 24

Time: 3 Hours

Candidates are required to give their answers in their own words as for as practicable.

The figures in the margin indicate full marks.

Section A

Long Answers Questions

Attempt any TWO questions.
[2*10=20]
1.
How can you use stack to convert an infix expression to postfix? Convert infix expression (A+B)*(C-D) to postfix using stack.[10]
2.
Discuss depth first and breadth first traversal of a graph with suitable example.[10]
3.
Explain concept of divide and conquer algorithm. Hand test quick sort algorithm with array of numbers (78, 34, 21, 43, 7, 18, 9, 56, 38, 19). What is time complexity of quick sort algorithm?[10]
Section B

Short Answers Questions

Attempt any Eight questions.
[8*5=40]
4.
Compare stack with queue. How is linear queue different from circular queue? [5]
5.
What is ADT? Discuss stack as an ADT. [5]
6.
Define recursive algorithm? How do you implement recursive algorithm while writing computer programs? [5]
7.
What are benifits of using linked list over array? How can you insert a node in a singly linked list? [5]
8.
What is hashing? Discuss rehashing with example. [5]
9.
How do you traverse a binary tree? Discuss. [5]
10.
What do you mean by complexity of algorithm? How do you find time complexity? [5]
11.
How do you implement binary search algorithm? What is time complexity of this algorithm? [5]
12.
Write short notes on: a. Dynamic memory allocation b. Game tree [5]