Tribhuvan University

Institute of Science and Technology


Bachelor Level / third-semester / Science

Computer Science and Information Technology( CSC211 )

Data Structure and Algorithm

Full Marks: 60 + 20 + 20

Pass Marks: 24 + 8 + 8

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.

Long Questions

Attempts any two questions (2 x 10 = 20)


How can you use stack to convert an infix expression to postfix? Convert infix expression (A + B)*(C – D) to postfix using stack.


Explain concept of divide and conquer algorithm. Hand test quick algorithm with array of numbers (78, 34, 21, 43, 7, 18, 9, 56, 38, 19).sorting What is time complexity of quick sort algorithm?


Discuss depth first and breadth first traversal of a graph with suitable example.

Short Questions

Attempt any Eight questions (8 x 5 = 40)


What do you mean by complexity of algorithms? How do you find time complexity?


Compare stack with queue. How is linear queue different from circular queue?


What is ADT? Discuss stack as an ADT.


Define recursive algorithm? How do you implement recursive algorithms while writing computer programs?


What are the benefits of using linked list over array? How can you insert a node in a singly linked list?


How do you implement binary search algorithm? What is time complexity of this algorithm?


What is hashing? Discuss rehashing with example.


How do you transverse a binary tree? Discuss.


Write short notes on:

  1. Dynamic memory allocation
  2. Game tree