CS301 Final Term Current Paper (Feb 2011)
Saturday, February 19, 2011 Posted In .Final Term Exam (Feb 2011) Edit This
CS301 Final Term Current Paper (Feb 2011)
5 marks questions
explain and write the code for union and find operation of parent array in disjoint sets.
merge sort, and array deletion of nodes in tree
MCQs were new
mostly from BST, min and max heap, thread binary tree, quick sort, merge sort
2 and 3 marks
drawback of using array to store BST.
applications of hashing.
what is c++ template.
meant by "Sibling" in relation
5≥2 is any equivalence relation between there?
mostly from BST, min and max heap, thread binary tree, quick sort, merge sort
2 and 3 marks
drawback of using array to store BST.
applications of hashing.
what is c++ template.
meant by "Sibling" in relation
5≥2 is any equivalence relation between there?
5 marks questions
explain and write the code for union and find operation of parent array in disjoint sets.
merge sort, and array deletion of nodes in tree
