csc211

Data Structures and Algorithms

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

Community

FM: 60 PM: 24

Data Structures and Algorithms

2078 Boards

Section A

Answer any two questions.

1

Define Queue. Write are different applications of queue? Explain queue operations with example.

10

!

2

Explain circular linked list with example. How do you implement linked list operation in singly linked list? Explain.

10

!

3

What is binary search tree? Write a program to implement insertion and deletion algorithms in binary search tree.

10

!

Section B

Answer any eight questions.

4

How do you find complexity of algorithms? Explain

5

!

5

Evaluate the expression ABCD-x+ using stack where A=5, B=4, C=3 and D=7

5

!

6

What is priority queue? Why do you need this type of queue?

5

!

7

Write a recursive program to find nth fibonacci number.

5

!

8

Explain array implementation of list.

5

!

9

Hand test selection sort with array of numbers 4, 71, 32, 19, 61, 2, -5 in descending order.

5

!

10

Write a program to implement sequential search algorithm.

5

!

11

What is graph traversal? Explain.

5

!

12

Write short notes on:

Divide and Conquer sorting
AVL Tree

5

!