CS301 All Current Final Term Papers 20 August 2016 to 02 September 2016

For more discuss and ask question join this group
 

https://www.facebook.com/groups/143792885956764/

Solved  By : Tahir Siddiqui(Mani)

BC-140201235@Vu.edu.pk

DAY CS301 PAPER

MCQ MOSTLY MOAZZ FILE S THY OR JO BAKI THY WO SARY AVL TREE K TOPIC M S THY
Q1 :HOW SINGEL LEFT ROTATION CAN BE PERFORMED IN AVL TREE.
Q2 : HOW CAN WE DELET AN ELEMENT FROM SKIP LIST.
Q3: WHEN HASHING IS NOT SUITABLE?
Q4 : HOW MANY LEAF AND NON LEAF NODES ARE PRESENT IN A COMPLETE BINERY TREE IT IS DEPTH IS 7.
Q5CONFIGURE MIN HEAP WITH ARRY TABLE 9,8,6,15,22,7,23.
Q6 MAX HEAP K LIY DIGIT THY USY CONFIGURE KRNA THA WITH ARRY TABLE .
Q7 BTANA THA K VALUE CALCUTE HAFFSMAN M KHA S HTI H ASSI YA EK OR OPTION THA WO YAD NI . BHT EASY THA PAPER .

�#�cs301_today_paper�
mostly mcqs in moaaz fileeee
avl tree sy kafe queston ay thyyyy
what is hashing .... 2m
how we can apply unioun operation on element initially difference sts...2m
describe the case in wich expression tru does not work binary tree......2m
draw AVL treee..... 5m

CS301 Exam

1. How one can find the height of a binary tree? (2 marks)
2. Name any two of "divide and conquer" algorithms. (2 marks)
3. Why do we use Huffman encoding? (2 marks)
4. How does heap sort work? (2 marks)
5. Explain the working of Heap sort. (3 marks)
6. A function defined with const was given. Output was required. (3 marks)
7. Insertion sort is used for small lists and quick sort is used for large lists. Why? (3 marks)
8. Heap tree was given to find either it's Max or Min. The tree data was required to write as an array as well. (3 marks)
9. Define Collision, Linear Probing, Quadratic Probing. (5 marks)
10. Data was given to make an AVL Tree. (5 marks)
11. Sets were given to make Union Tree using weight rule. (5 marks)
12. Expression tree was given to write Infix expression with parenthesis. (5 marks)

#‎cs301_today_paper‬
mostly mcqs in moaaz fileeee avl tree sy kafe queston ay thyyyy what is hashing .... 2m how we can apply unioun operation on element initially difference sts...2m describe the case in wich expression tru does not work binary tree......2m draw AVL treee..... 5m