CS3311-question Set
CS3311-question Set
Page 1 of 3
8 Write a C program to implement the binary heap using priority queues.
9 Find the shortest paths from the source to all vertices in the given
graph using Dijkstra’s algorithm.
14 Consider an array of size 7 with elements 13, 9, 21, 15, 39, 19, and 27 and find
the n
element 39 in the list mplementing linear search algorithm guage.
by i in C la
17 Consider an array of size 7 with elements 13, 9, 21, 15, 39, 19, and 27 and find
the
Page 2 of 3
element 39 in the list m
by i plementing linear search algorithm in C language
Page 3 of 3
18 Write a C program to sort the given unsorted array of elements using insertion
sort
{13,32,26,9,35,18}
20 Write a C program to find Maximum and minimum of element in max heap tree.
Page 4 of 3