CS-301 Final Term Exams Preparation Virtual University With Answers

image
image
image

CS-301 Final Term Exams Preparation Virtual University

Sr. # Questions Answers Choice
1 In a min heap , preculateDown procedure will move smaller value______ and bigger value______. left,right right,left up,down down,up
2 Consider the following postfix expression S and the initial values of the variable,
S = A B - C + D E F - + ^ Assume that A=3, B=2, C=1, D=1, E=2, F=3 What would be the final output of the stack?
 1 2 0 -1
3 In a selection sort of n element ,how many times the swap function is called the execution of the algorithm? n-1 0 n log n 1
4 If the bottom level of a binary tree is NOT completely filled, depicts that the tree is NOT a Expression tree threaded binary tree complete binary tree perfectly complete binary tree
5 Which of the following is a property of binary tree? A binary tree of N external nodes has N internal node. A binary tree of N internal nodes has N+ 1 external node A binary tree of N external nodes has N+ 1 internal node A binary tree of N internal nodes has N- 1 external node.
6 Which of the following statements is correct property of binary trees? A binary tree with N internal nodes has N+1 internal links A binary tree with N external nodes has 2N internal nodes A binary tree with N internal nodes has N+1 external nodes. None of above statement is a property of the binary tree
7 Consider te following array 23 15 5 12 40 10 7 After the first pass of a particular algorithm, the array looks like 15 5 12 23 10 7 40 Name the algorithm used Heap sort Selection sort Insertion sort Bubble sort
8 Which of the following heap method increase the value of key at position „p‟ by the amount „delta‟? increaseKey(p,delta) decreaseKey(p,delta) preculateDown(p,delta) remove(p,delta)
9 Which one of the following is TRUE about iteration? Iteration extensively uses stack memory Threaded Binary Trees use the concept of iteration. Iterative function calls consumes a lot of memory. Recursion is more efficient than iteration.
10 Which one of the following is TRUE about recursion ? Recursion extensively use stack memory Threaded Binary Trees use the concept of recursion. Recursive function calls consume a lot of memory. Iteration is more efficient than iteration.
Download This Set
×