Syllabuses

Explain Bubble sort algorithm and simulate it for the following data 35, 33, 42, 10, 14, 19, 27, 44. Also find the number of comparisons and interchanges.

Write a C program to insert and delete elements in the Binary Search Tree.

Insert the elements 18, 23, 10, 12, 30, 18, 25, 4, 21, 36, 14, 20, 47 into a balanced Binary Search Tree and count the number of comparisons.

Explain briefly about the Circular Linked list and its operations.

Explain the operations performed on stack with a program.

What are the different operations performed on data structures? Explain with an example.

Give a simple condition on the weights of a graph that will guarantee that there is a unique maximal spanning tree for the graph.

Explain Tautologies, Contradiction and Contingencies with suitable examples.

Find PDNF by constructing its PCNF of (Q ^ V P) -> (~ V R) ^ (~P V ~Q).

Prove that the set G = {0, 1, 2, 3, 4, 5, 6} is a finite abelian group of order 7 with respect to multiplication modulo 7.