Virtual University Help Center

My today paper of cs301

Total 52 questions

4o mcqs

4 questions of 2 marks

4 questions of 3 marks

4 questions of 5 marks

Almost all Mcqs from the file final term solved mcqs with reference by mooaz

Subjective questions:

Questions of 2 marks
In the array representation of union what represents  -1?
For smaller lists, linear insertion sort performs well, but for larger lists, quick sort is suitable to apply." Justify why?from mooaz file
If we want to delete the node from BST which has left and right child then which rotation is applied ?
Collision in hashing definition?

Question of 3 marks:
Algorithm union by weight?
One tree is given question is it heap or not if it is heap then write its type
Which data structure is best for priority queue?



Questions of 5 marks:
Some numbers are given and using those make BST?
One array is given we require to sort it using bubble sort and write only 2 iterations?
One tree is given which not the heap but after minimum changes it becomes max heap make it?
Make tree your are required to show only the final tree

Union(4,1) es trah se dia hua thay