CS301 Current FinalTerm Paper 18 February 2018 | FALL 2017 |
Today 18/02/2018 CS301 data structure
50% mcq in past paper.
Long and shot question.
1. Making huffman binary tree using
A,b,c,d,e,f and their frequency is 40,11,33,9,5,20 ( 5 marks ).
2. Making Threaded binary tree using
40,34,57,70,93,23 traversal order should be Left to right ( 5 marks ).
3. Correct this code ( 5 marks ).
Class A
{
private:
Int c;
Public:
Int& fun ( &int x) const
{
c = x;
Int y =10;
cout <<y;
return (&x);
}
};
4. ( 5.marks ) Using union operation data are
3,2,4,6,9
And also define working of "-1" word in union operation.
5. ( 5 marks ) Making skip list sketch s0 to s3
Data are 12,34,56,78
6. ( 3 marks ) define the characteristic of skip list
7. ( 3 marks ) tell the frequency of letter given diagram of huffman code.
8.( 3 marks )Define the Union operation of disjoint set.
9. ( 3.marks )By using huffman coding how to image segmentation.
Emoticon