Final Term Current Paper 2019
Must Visit On Regular Basis if u need Current Papers
Paper 1
Heap Method 5 Marks
How to optimize, find a method using path compression 5 Marks
How many parameters are used in 5 Marks
1- Remove
2- Insert
3- Find
Statements are given till which is valid and invalid 3 marks
Converts infix expression to postfix expression delete a node from a BST and show the tree and again do rebalance the tree using rotation 5 Marks
Time 8:am
90% objective from Past papers...
50% Subjective from Past papers
Some Subjective Questions are below
1) Construct BST ( binary search tree )
2) Equliance Relation
3) Expression tress
4) AVL tree
5) convert linked list into BST
6) Find MIN Heap
7) Describe 2i , 2i+1
Paper 2
Cs301 Current Paper 2019Time 8:am
90% objective from Past papers...
50% Subjective from Past papers
Some Subjective Questions are below
1) Construct BST ( binary search tree )
2) Equliance Relation
3) Expression tress
4) AVL tree
5) convert linked list into BST
6) Find MIN Heap
7) Describe 2i , 2i+1
Paper 3
Paper past papers mai sy tha 40 percent baki tree heap or sorting and array sy related question thay
4o mcqs thy baki 2 question min heap k bary m tha skip list k bary m threshold binary aur equilance structure aur ik code ka output btna tha
>>> Best of Luck <<<
0 Comments