CS301 Subjective Questions

Come and join us at WebLyceum

For Past Papers, Quiz, Assignments, GDBs, Video Lectures etc

Go to and click Register · In Case of any Problem Contact Administrators · Rana Muhammad Safdar (rana.sfdr ) · Bilal Farooq (bilal.zaheem ) · Come and join us at VU Social · For Non-Study Material Sharing, Chatting, etc, · Go to and click Register · (Weblyceum is not responsible for any solved content) · SUBJECTIVE QUESTIONS

Q31. Describe the conditions for second case of deletion in AVL Trees. (1 marks)

Q32. What is Table abstract data type. (1 marks)

Q33. How we can generate a maze .Give an algorithm. (2 marks)

Q34. Represent the following Binary tree using array representation. (2 marks)

Q35. What is an Equivalent relation? Give any two examples. (3 marks)

Q36. "For smaller lists, linear insertion sort performs well, but for larger lists, quick sort is suitable to apply." Justify why? (3 marks)

Q37. depth is 7 ? (3 marks)

Q38. Remove the smallest element from the following array which represents a min-heap. (5 marks)

original min-heap

and show the resultant heap in the form of array as shown below,

Q39. Here is an array with exactly 15 elements: (5 marks)

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15. Suppose that we are doing a binary search for an element. Indicate any elements that will be found by examining two or fewer numbers from the array.

Q40. (10 marks)

1. Write C++ algorithm for Binary Search

int isPresent(int *arr, int val, int N)

int low = 0; int high = N - 1; int mid; while ( low <= high )

mid = ( low + high )/2; if (arr[mid] == val) return 1; // found! else if (arr[mid] < val) low = mid + 1; else high = mid - 1;

return 0; // not found

b) Consider the following array of values; show how the binary search algorithm would find the value -5. Clearly show/explain your work; that is, show the values of start, end, etc. for each step of the algorithm.