Syllabuses
What do you mean by algorithmic complexity? Discuss a priori analysis and posteriori testing of an algorithm.
What do you mean by algorithmic complexity? Discuss a priori analysis and posteriori testing of an algorithm.
Write an algorithm to find all the connected components of a graph. Also give the time analysis of your algorithm.
Write an algorithm to find all the connected components of a graph. Also give the time analysis of your algorithm.
What are the different types of search techniques? Explain the one which is more efficient among them. Explain the following: i) Symbol table ii) Hash table iii) Dynamic tree table
What are the different types of search techniques? Explain the one which is more efficient among them. Explain the following:
i) Symbol table
ii) Hash table
iii) Dynamic tree table
What is min heap? Create the min heap for the given data set: 6, 15, 50, 3, 33, 45, 40, 80, 10
What is min heap? Create the min heap for the given data set: 6, 15, 50, 3, 33, 45, 40, 80, 10
Compare merge sort and quick sort algorithms in terms of storage space and time required to execute them.
Compare merge sort and quick sort algorithms in terms of storage space and time required to execute them.
Create B-Tree of order 5 from the following lists of data items: 20, 30, 10, 40, 10, 50, 60, 55, 65.
Create B-Tree of order 5 from the following lists of data items: 20, 30, 10, 40, 10, 50, 60, 55, 65.
Discuss about the implementation of fixed size block and variable size block dynamic memory allocation.
Discuss about the implementation of fixed size block and variable size block dynamic memory allocation.
Write the recursive Inorder, Preorder and Postorder tree traversal algorithms.
Write the recursive Inorder, Preorder and Postorder tree traversal algorithms.