July 17, 2021 in C and CPP
b) Suppose that the graph G = (V,E) is represented as an adjacency matrix. Give a simple
implementation of Prim’s algorithm for this case that runs in O(V2) time.July 17, 2021 in C and CPP
a) Suppose that a Graph G has a minimum spanning tree already computed. How quickly can
the minimum spanning tree be updated if a new vertex and incident edges are added to G?July 17, 2021 in C and CPP
b) Modify bubble sort algorithm in more efficient form so that it stops when no interchanges are needed.July 17, 2021 in C and CPP
a) Use the bubble sort to put the numbers 3, 2, 4, 1, 5 into increasing order. Illustrate the output returned in each pass clearly. Also write the pseudo algorithm to it.July 17, 2021 in C and CPP
b) Show the results of inserting the keys F, S, Q, K, C, H, T, V, W, M, R, N, P, A, B, X, Y, D, Z, E in order into an empty B tree.July 17, 2021 in C and CPP
a) Write an algorithm to delete an element x from a binary search tree t. Discuss your method with an example.July 17, 2021 in C and CPP
b) Let P be of type of linked list. Write a ‘C’ function split to create two linked lists Q & R. Q contains all elements in odd positions of P and R contains the remaining elements. Your function should not change list P. What is the complexity of your program?July 17, 2021 in C and CPP
a) Let A and B be two n x n lower triangular matrices. The total number of elements in the
lower triangles of the two matrices is n(n+1). Write a ‘C’ program to represent both triangles in an array d[n+1][n].July 17, 2021 in C and CPP
b) Describe the implementation methods insertBefore(p,e), InsertFirst(e) and InsertLast(e)
of the list ADT, assuming the list is implemented using a doubly linked list.July 17, 2021 in C and CPP
a) Let A and B be two structures of type Linked List. Write a ‘C’ function to create a new
Linked List C that contains elements alternately from A and B beginning with the first
element of A. If you run out of elements in one of the lists, then append the remaining
elements of the other list to C.
