CS301 Data Structure Final Term Subjective Questions Jan-2012
Q 41: Where is hashing suitable? 2 Marks
Q.42 When Hashing is not Suitable? 2 Marks
Q.45 How many parameters used in following operation? write their names,
0. Find,
1. Add
3. Remove 3 Marks
Q.46 Forgot
Q.49 Union by size tree formation, Assignment no4 was asked 5 Marks
Q.50 Code for Union and find operation in disjoints sets. 5Marks
Q.51 A function Hash(x) = (x*2)/ tablesize and is given index from 0 to 11, to find out the contents of tables of values in order 11, 29, 36, 22, 27 5Marks
Q.42 When Hashing is not Suitable? 2 Marks
Q.45 How many parameters used in following operation? write their names,
0. Find,
1. Add
3. Remove 3 Marks
Q.46 Forgot
Q.49 Union by size tree formation, Assignment no4 was asked 5 Marks
Q.50 Code for Union and find operation in disjoints sets. 5Marks
Q.51 A function Hash(x) = (x*2)/ tablesize and is given index from 0 to 11, to find out the contents of tables of values in order 11, 29, 36, 22, 27 5Marks
Total Number 80
Time 120 minutes
Total Question 52
40 MCQs from Past Papers
2 four-long questions
3 four-long questions
5 four-long questions
Q1. How we can implement Table ADT using Linked List (2)
Q2. What is hashing? (2)
Q3. Describe the conditions for second case of deletion in AVL Trees. (2)
Q4. What is an Equivalent relation? Give any two examples. (2)
Q1. Write down the parameter name of the following:- (3)
1. Delete
2. Insert
3. Find
Q2. Where Inorder Predecessor of a non leaf node is is present in a Binary Search Tree? :- (3)
Q3. How we can search an element in Skip List. (3)
Q4. Convert the given infix form to postfix form. Y-Z*X-Q^P-(3)
Q1. 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.? (5)
Q2. Here is an array of ten integers:
5 3 8 9 1 7 0 2 6 4
The array after the FIRST iteration of the large loop in a selection sort (sorting from smallest to largest)? (5)
Q3. Consider the following array as input
Time 120 minutes
Total Question 52
40 MCQs from Past Papers
2 four-long questions
3 four-long questions
5 four-long questions
Q1. How we can implement Table ADT using Linked List (2)
Q2. What is hashing? (2)
Q3. Describe the conditions for second case of deletion in AVL Trees. (2)
Q4. What is an Equivalent relation? Give any two examples. (2)
Q1. Write down the parameter name of the following:- (3)
1. Delete
2. Insert
3. Find
Q2. Where Inorder Predecessor of a non leaf node is is present in a Binary Search Tree? :- (3)
Q3. How we can search an element in Skip List. (3)
Q4. Convert the given infix form to postfix form. Y-Z*X-Q^P-(3)
Q1. 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.? (5)
Q2. Here is an array of ten integers:
5 3 8 9 1 7 0 2 6 4
The array after the FIRST iteration of the large loop in a selection sort (sorting from smallest to largest)? (5)
Q3. Consider the following array as input
|
13 |
4 |
6 |
8 |
9 |
7 |
10 |
15 |
|
|
|
Prove that it is a heap and also explain what type of heap it is.? Draw the final NOT for all?
Q4. Draw the following sequence of union commands on the set of elements {1,2,3,4, 5}:
union(4,2)
union(3,1)
union(5,4)
union(5,3)
Show the result when the unions are performed. We need only Final results of union NOT for all.?
Q4. Draw the following sequence of union commands on the set of elements {1,2,3,4, 5}:
union(4,2)
union(3,1)
union(5,4)
union(5,3)
Show the result when the unions are performed. We need only Final results of union NOT for all.?
