 |
|
#1
11-22-2011, 02:36 PM
|
||||
|
||||
cs301 complete solved package spring term
find the attachments for complete assistance for preparation
|
|
#2
11-22-2011, 02:39 PM
|
||||
|
||||
|
find attachments again
|
|
#3
11-22-2011, 02:40 PM
|
||||
|
||||
|
some more material
name of two divide n conquore algorithm (2 marks)
difference bw call by value n call by reference (2 marks) skip list (3) heap and two types of heap(3) union by size (3) height of a tree is 5 find sum of heights (2) Dummy note (5) collision ,linear probing and quadratic probing note (5) ( 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. Q1 Write one example of hashing? Q2 Height of a tree is 5 find sum of heights Q3 How do we carry out degeneration of Complete Binary Tree? Q4 What is a skip List? Q5 How we can generate a maze with the help of union Q6 Make a max heap with (few numbers were given, I thik 7) and also update the resultant array? Q7 Following 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 Q1. Write down the C++ code to implement insertion sort algorithm. 10 Marks Q2. What is Table ADT. Discuss any twi implementations of table ADT. 5 Marks Q3. Suppose we have the following representation for a complete binary search tree. Tell the left and right child nodes and parent node of node D. 5Marks A B C D E F G H I J K L M N O P Q R S 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 Q4.Consider the following max heap. Add node 24 in it and show the resultant Heap. 3Marks Q5. Here is an array of 10 integers. 5 3 8 1 7 0 2 6 4. Draw this array after the first iteration of the large loop in a selection sort (Sorting from smallest to largest) 3 Marks Q6.What is an equivalent relation.? give 2 examples. 3 Marks Q7. What are the properties of equivilance class? 3marks Q8. How heap sort works to set a set of data. 2Marks Q9. How can we search an element in skip list. 2Marks Q10. What is an ADT?
|
|
Linear Mode
