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.

Chapter Wise Notes Question Banks Syllabus Chapter Wise Questions Viva Practical

Institute of Science and Technology

2080

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]

What is stack? Explain different stack operations. Explain algorithm to evaluate postfix expression.

[1+4+5]

Explain almost complete binary tree with example. How do you insert, search, and delete nodes in a binary search tree? Explain with suitable example?

[3+7]

Discuss the limitation of choosing first element as pivot in quick sort. Using merge sort algorithm, sort the numbers 40, 6, 5,21, 3, 100, 90, 7, 8, 12, 30.

[4+6]

"Section B"

Short Answer Questions. Attempt any EIGHT questions.

[8 × 5 = 40]

Define data type and ADT. What are the benefits of using ADT? Explain

[2+3]

What is space complexity? Explain omega notation with example.

[1.5+3.5]

What is circular queue? How can you implement circular queue?

[1.5+3.5]

Define recursion. Explain Tower of Hanoi (TOH) with example.

[1.5+3.5]

How can we use linked list to implement queue? Explain.

[5]

What are different applications of binary tree? Explain.

[5]

Why do we need hashing? Explain quadratic probing.

[2+3]

Define spanning tree. Explain minimum spanning tree with example.

[1.5+3.5]

Write short notes on:

a. Doubly circular linked list

b. Breadth first search

[2×2.5 = 5]

BIT Data Structure and Algorithms

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

Institute of Science and Technology