[Link].
(CA & IT) – Sem III
Introduction to Algorithms – 303
Total Marks: 70 Time: 2½ Hours
--------------------------------------------------------
Que. 1 Attempt Any Three. (18 Marks)
1. What is flowchart? Explain symbols used in flowchart.
2. Explain linear and binary search with example.
3. Write an algorithm for merge sort.
4. Explain array, structure and pointer with example.
5. What is recursion? Explain with example.
6. Explain asymptotic notations with examples.
--------------------------------------------------------
Que. 2 A. Attempt Any Two. (05 Marks)
1. What is recursion?
2. What is searching?
3. What is sorting?
--------------------------------------------------------
Que. 2 B. Attempt Any Two. (12 Marks)
1. What is algorithm? Explain asymptotic notation and efficiency classes.
2. Apply quick sort on: 5 3 1 9 8 2 4 7
3. Explain Radix sort / Merge sort with algorithm and example.
--------------------------------------------------------
Que. 3 Attempt Any Three. (18 Marks)
1. Explain IRD and ORD with example.
2. Write an algorithm for postfix evaluation.
3. Explain stack operations with algorithm.
4. Explain circular queue with insert and delete algorithms.
5. What is queue? Explain types with example.
6. What is algorithm visualization?
--------------------------------------------------------
Que. 4 A. Attempt Any Two. (05 Marks)
1. Polish notation.
2. Priority queue.
3. Data structure.
--------------------------------------------------------
Que. 4 B. Attempt Any Two. (12 Marks)
1. Explain primitive and non-primitive data structures with examples.
2. Write an algorithm to generate Fibonacci number using recursion.
3. Explain types of queue in detail.
--------------------------------------------------------