CS301 Data Structures 07-03-2015 Current Paper
40% MCQ's Comes From Past Papers
Q:3 5 9 8 1 7 0 2 6 4 , draw after the 1st iteration of large loop in a selection sort (smallest to largest)
Q:Here is an array of ten integers:
5 3 8 9 1 7 0 2 6 4
Draw this array after the FIRST iteration of the large loop in an insertion sort (sorting from smallest to largest). This iteration has shifted at least one item in the array.
Q:How heap sort works to sort a set of data.
Q:Give the name of two Divide and Conquer algorithms.
Q:What is Disjoint Sets? Explain with an example.
Q:Calculate the codes of the following characters in table below using the haffman encoding tree, is ka table tha....
0 comments:
Post a Comment