csc211

Data Structures and Algorithms

Easy Exam Preparation: 2 days
Question Papers (9)
logo

Community

FM: 60 PM: 24

Data Structures and Algorithms

2074 Boards

Section A

Answer any two questions.

1

Illustrate the algorithm for Binary search tree with example.

10

!

2

What do you mean by circular list? Differentiate between stack as a circular list and Queue as a circular list.

10

!

3

Explain the procedure for construction of Huffman algorithm with example.

10

!

Section B

Answer any eight questions.

4

Differentiate between structure and union.

5

!

5

Describe the Big ‘O’ notation.

5

!

6

Explain the infix to post fix conversion algorithm.

5

!

7

Explain the Tower of Hanoi (TOH) with practical example.

5

!

8

What do you mean by double linked list? Explain with example.

5

!

9

What are the types of binary tree? Compare between them.

5

!

10

Differentiate between pre-order traversal and in order traversal.

5

!

11

What do you mean by sorting? Explain the Bubble sort with example.

5

!

12

Differentiate between sequential searching and binary searching.

5

!

13

Discuss the Kruskal’s algorithm with example.

5

!