CS301 Fall 2011 Final Term Feb 2012 – VU Current Paper – 16 Feb 2012

TOTAL QUESTIONS: 52:
MCQs: 40:

Subjective paper is here:
Q: 41: How can we generate maze. Give an algorithm. MARKS: 2:
Q: 42: The relation “>” between real numbers is equivalence relation or not? Explain. MARKS: 2:
Q: 43: What is meant by the following statement in context of linked list data structure?

Node* new Node = new Node(9); MARKS: 2:
Q: 44: Give the names of any two Nlog(N) sorting algorithm. MARKS: 2:
Q: 45: Give any three characteristics of Union by weight methode. MARKS: 3:
Q: 46: “For smaller list linear insertion sort performs well, but for larger lists, quick sort is suitable to apply. Why? MARKS: 3:
Q: 47: The relation “is a sibling of” (used to pairs of distict people, who have the same Parents) on the set of all human beings is equivalence relation or not? Explain. MARKS: 3:
Q: 48: Write down the code for isEmpty() and isFull() functions of the stack data structure implemented through arrays.
MARKS: 3:
Q: 49: Give an array of ontegers. Draw a maximum heap and show the final updates array.
12 57 19 87 15 44 23 MARKS: 5:
Q: 50: Here is an array of 15 elements :
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
Suppose that we have Binary search tree for an element.
Indicate any element will be found by examining two or few numbers from the array. MARKS: 5:
Q: 51: If we use linked list implemented push and pop stack. What is the better side for Push an element and also for Pop an element in to the array. MARKS: 5:

 

DOWNLOAD SOLUTION HERE
loading...