πŸ’‘ Jump to Important Questions ↓

Important Questions

Important Questions

Introduction to Data Structures & Algorithms

Asked in 2081Short Question5 Marks
1.
Write short notes on: a. Breadth First traversal of graph b. TOH [5]
Asked in 2081Short Question5 Marks
2.
Explain big oh notation in brief. Find big oh of the following function: f(x)=5x4+9x2+7x+9f(x) = 5x^4 + 9x^2 + 7x + 9. [5]
Asked in 2080Short Question5 Marks
3.
Write short notes on: a. Abstract data type b. Circular linked list [5]
Asked in 2080Short Question5 Marks
4.
What is asymptotic analysis? Explain theta notation with example. [5]
Asked in 2079Short Question5 Marks
5.
Write short notes on: a. Priority Queue b. Breadth First traversal of a graph [5]
Asked in 2079Short Question5 Marks
6.
Why do we need asymptotic notation? Describe about Big oh notation with its curve. [5]
Asked in 2078Short Question5 Marks
7.
Write short notes on: a. Divide and Conquer sorting b. AVL Tree [5]
Asked in 2078Short Question5 Marks
8.
How do you find complexity of algorithms? Explain. [5]
Asked in 2077Short Question5 Marks
9.
Write short notes on: a. Tail recursion b. Collision resolution techniques [5]
Asked in 2077Short Question5 Marks
10.
What is dynamic memory allocation? Compare data structure with abstract data type. [5]
Asked in 2075Short Question5 Marks
11.
Write short notes on: a. Dynamic memory allocation b. Game tree [5]
Asked in 2075Short Question5 Marks
12.
How do you implement binary search algorithm? What is time complexity of this algorithm? [5]
Asked in 2075Short Question5 Marks
13.
What do you mean by complexity of algorithm? How do you find time complexity? [5]
Asked in 2075Long Question10 Marks
14.
Explain concept of divide and conquer algorithm. Hand test quick sort algorithm with array of numbers (78, 34, 21, 43, 7, 18, 9, 56, 38, 19). What is time complexity of quick sort algorithm? [10]
Asked in 2074Short Question5 Marks
15.
Describe the Big 'O' notation. [5]
Asked in 2074Short Question5 Marks
16.
Differentiate between structure and union. [5]