BIT Data Structure and Algorithms

bitsemester 3

This course contains the concepts of different types of data structures and concepts of algorithms and their analysis.

2078

Bachelor in Information Technology

Data Structure and Algorithms

BIT 201

Full Marks: 60

Pass Marks: 24

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"

Long Answer Questions Attempt any TWO questions.

[2 × 10 = 20]

Explain algorithm to convert an infix expression to postfix using stack? Use this algorithm to convert \((A+B)*C-D\) to postfix.

Explain merge sort along with its time complexity. Use this algorithm to sort array of numbers given below:

25, 37, 48, 25, 23, 17, 31, 45, 7, 21, 15, 8, 11

What is shortest path algorithm? Use Dijkstra’s algorithm to find shortest path between the vertices of a and z in the graph given below.

"Section B"

Short Answer Questions Attempt any EIGHT questions.

[8 × 5 = 40]

What is data Structure? Explain an array as an abstract data type.

Explain big oh(O) notation with suitable example.

Define priority queue. How do you implement priority queue? Explain.

Define recursion. Explain Tower of Hanoi algorithm in detail.

How can you implement queue using linked list? Explain.

What is binary tree? Explain different application of binary tree.

Explain sequential search. How is it different from binary search?

Define hashing. Explain quadratic probing with example.

What is graph traversal? Explain breadth first search.

BIT Semester 3 Data Structure and Algorithms Question Paper 2078 – Solved