CS301 Final Term Current Paper (Feb 2011)
Tuesday, February 15, 2011 Posted In .Final Term Exam (Feb 2011) Edit This
CS301 Final Term Current Paper (Feb 2011)
Q.No. 1 What is Skip List?
Q.NO. 2. Write the names of Two divide & conquer Alogrthims. Ans , Quick Sort & Merge Sort.
Q.NO. 3. Descrbe 3 characterestics of union by weight method
Q.NO. 4 What is ADT Table, Describe its two implementatoins.
Q.No. 5 Explain , Collision, Linear Probing, Quadratic Probing.
Q. No. 6 How binary Search tree is degenerated.
Q.NO. 2. Write the names of Two divide & conquer Alogrthims. Ans , Quick Sort & Merge Sort.
Q.NO. 3. Descrbe 3 characterestics of union by weight method
Q.NO. 4 What is ADT Table, Describe its two implementatoins.
Q.No. 5 Explain , Collision, Linear Probing, Quadratic Probing.
Q. No. 6 How binary Search tree is degenerated.
..................
Another Paper:
CS301 todays paper
Total 52 questions
40MCQ's and
2x4=questions
3x4=questions
5x4=questions
Question No: 41 ( Marks: 2 )
Convert the given infix form to postfix form.
A+B/C-D^E-F
Question No: 42 ( Marks: 2 )
How we can implement Table ADT using Linked List
Question No: 43 ( Marks: 2 )
If we allow assignment to constants what will happen?
Question No: 44 ( Marks: 2 )
How heap sort works to sort a set of data.
Question No: 46 ( Marks: 3 )
Give your comment on the statement that heap uses least memory in array representation of binary trees. Justify your answer in either case.
Question No: 47 ( Marks: 3 )
How we can use concept of equivalence relations to generate a Maze.
Question No: 48 ( Marks: 3 )
"For smaller lists, linear insertion sort performs well, but for larger lists, quick sort is suitable to apply." Justify why?
Question No: 49 ( Marks: 5 )
6 9 5 0 4 1 7 3 2
Show the first five merging steps for Merge sort on this array.
Question No: 50 ( Marks: 5 )
What is Disjoint Sets? Explain with an example.
Question No: 51 ( Marks: 5 )
Write the code of the perculateDown() function and also comment it.
Question No: 52 ( Marks: 5 )
Here is an array with exactly 15 elements:
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.
Total 52 questions
40MCQ's and
2x4=questions
3x4=questions
5x4=questions
Question No: 41 ( Marks: 2 )
Convert the given infix form to postfix form.
A+B/C-D^E-F
Question No: 42 ( Marks: 2 )
How we can implement Table ADT using Linked List
Question No: 43 ( Marks: 2 )
If we allow assignment to constants what will happen?
Question No: 44 ( Marks: 2 )
How heap sort works to sort a set of data.
Question No: 46 ( Marks: 3 )
Give your comment on the statement that heap uses least memory in array representation of binary trees. Justify your answer in either case.
Question No: 47 ( Marks: 3 )
How we can use concept of equivalence relations to generate a Maze.
Question No: 48 ( Marks: 3 )
"For smaller lists, linear insertion sort performs well, but for larger lists, quick sort is suitable to apply." Justify why?
Question No: 49 ( Marks: 5 )
6 9 5 0 4 1 7 3 2
Show the first five merging steps for Merge sort on this array.
Question No: 50 ( Marks: 5 )
What is Disjoint Sets? Explain with an example.
Question No: 51 ( Marks: 5 )
Write the code of the perculateDown() function and also comment it.
Question No: 52 ( Marks: 5 )
Here is an array with exactly 15 elements:
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.
