Education and Career Forum

The question paper is divided into five sections, and the candidates have to answer five questions in all. All questions carry equal marks. Some of the questions are: define data structures and explain the various data structures, what is the complexity of a program, write a C program for searching an element when the list is unsorted or sorted, what is Stack and how is it represented, write a suitable program for Push and POP operations in stack, what is Heap Sort and what are the various kinds of Heap Sort, explain the various heap operations, what are the various kinds of Graphs, write an algorithm for finding minimum distance of all nodes from any node in the graph, write Kruskal algorithm for construction of a minimal cost spanning tree and explain it with an illustrative example, explain the meaning of circular linked list, distinguish between sequential searching and binary searching.

i want ksou distance learning question paper for msc IT i semester