CS301 FINAL TERM CURRENT PAPER FALL 2017
CS301 some questions of 5 marks
Question No.1:
Making Huffman binary tree using
A, b, c, d, e, f and their frequency is 40,11,33,9,5,20.
Question No.2:
Making Threaded binary tree using
40,34,57,70,93,23 traversal order should be Left to right.
Question No.3:
Correct this code.
Class A
{
private:
Int c;
Public:
Int& fun (&int x) const
{
c = x;
Int y =10;
cout <return (&x);
}
};
Question No.4:
Using union operation data are
3,2,4,6,9
And also define working of "-1" word in union operation.
Question No.5:
Making skip list sketch s0 to s3
Data are 12,34,56,78
CS301 SOME QUESTIONS OF 3 MARKS
Question No.1:
define the characteristic of skip list
Question No.2:
tell the frequency of letter given diagram of Huffman code.
Question No.1:
Define the Union operation of disjoint set.
Question No.1:
By using Huffman coding how to image segmentation.