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

How one can find the height of a binary tree? (2 marks)
Name any two of "divide and conquer" algorithms. (2 marks)
Why do we use Huffman encoding? (2 marks)
How does heap sort work? (2 marks)
Explain the working of Heap sort. (3 marks)
A function defined with const was given. Output was required. (3 marks)
Insertion sort is used for small lists and quick sort is used for large lists. Why? (3 marks)
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)
Define Collision, Linear Probing, Quadratic Probing. (5 marks)
Data was given to make an AVL Tree. (5 marks)
Sets were given to make Union Tree using weight rule. (5 marks)
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

cs302 Solved Quiz

estion # 1 of 10 ( Start time: 03:03:55 PM ) Total Marks: 1 Divide-by-32 counter can be acheived by using Select correct option: Flip-Flop and DIV 10 Flip-Flop and DIV 16 Flip-Flop and DIV 32 DIV 16 and DIV 32 Question # 2 of 10 ( Start time: 03:05:20 PM ) Total Marks: 1 The counter states or the range of numbers of a counter is determined by the formula. (“n” represents the total number of flip-flops) Select correct option: (n raise to power 2) (n raise to power 2 and then minus 1) (2 raise to power n) (2 raise to power n and then minus 1) Question # 3 of 10 ( Start time: 03:06:36 PM ) Total Marks: 1 A 4- bit UP/DOWN counter is in DOWN mode and in the 1010 state. on the next clock pulse, to what state does the counter go? Select correct option: 1001 1011 0011 1100 Question # 4 of 10 ( Start time: 03:07:37 PM ) Tot...

CS401 Assignment#1 Solution Spring 2018

Assignment No. 1 Graded Semester Spring 2018 Computer Architecture and Assembly Language Programming– CS401 Total Marks: 15 Due Date: 10/05/2018 Question: 1 [15...

Array Basic

TOPIC : ARRAY Array is used to store collection of variables of same data type. It may be single dimensional type or multidimensional type.Arrays help a lot ,instead of defining variables again and again , use a single array with multiple variables you want to define. It consists of contiguous memory locations, lowest address corresponds to first element in the array. Single dimensional arrays Syntax: type arrayname[ array size] = {}; Type: type can be any c++ data type Array size: array size must be integer constant greater than zero Array name: valid c++ identifier Example : int x[1]={10}; ==> Note: x is an array of one integer with array size one. Example : int x[10]; ==> Note: here x is an array of 10 integers ...

Virtual university Of Pakistan

Search This Blog