KERALA UNIVERSITY Class 4 data structures and algorithms Question Paper 2019

Practice authentic previous year questions for better exam preparation.

Sample Questions

Explain Collision resolution in hashing.
(b) Explain any one external sorting method.
Convert the following infix expression to its equivalent prefix and postfix forms $$ A+(B * C-(D / E \uparrow F) * G) * H . $$
(a) Write an algorithm to convert an infix expression to its equivalent postfix expression and evaluate it.
(a) Write the algorithm for heapsert. Illustrate the working of the algorithm on the following set of numbers. $42,23,74,11,65,58$.