CS301 Current Final Term Papers Fall 2010 (11~26 Feb 2011)

[+ M.Tariq Malik]

CS301 Current Final Term Papers Fall 2010 (11~26 Feb 2011)
Please Share Your Current Paper pattern, MCQs & subjective Questions to help each other. Thanks

[NOMAN]

objective mostly past prrz

1-3 important characteristics of skip list.

2-drawback of using array to store BST.

3-examples of hashing.

4-c++ code to add node in doubly link list.

5-wat u conclude from the running time analysis of disjoint sets.

6-explain how heap sort work.

7-what is c++ template.

8-explain and write the code for union and find operation of parent array in disjoint sets.

And  2 question of coding ........

5 3 8 9 1 7 0 2 6 4 is main select sort operation

[+ M.Tariq Malik]

See the attached files for CS301 Final Term Paper Fall 2010

 

[+ M.Tariq Malik]

today cs301 current paper short questions

Short Question :linear probing qud probing union by weight union by size quick sort merge sort and collision

[+ M.Tariq Malik]

total 56 que
40 MCQS and 12 subjective
postfix to infix conversion
insertion
show all steps by converting the array into min heap
conclusion of running time analysis of ADT
length() method

c++ code

[+ M.Tariq Malik]

objective mostly past prrz sy aya tha...............
1-3 important characteristics of skip list.
2-drawback of using array to store BST.
3-examples of hashing.
4-c++ code to add node in doubly link list.
5-wat u conclude from the running time analysis of disjoint sets.
6-explain how heap sort work.
7-what is c++ template.
8-explain and write the code for union and find operation of parent array in disjoint sets.

aur 2 question main coding thi.........aik main error theakh krna tha aur dosra yaad nae kia krna tha
han aik aur v question tha...............5 3 8 9 1 7 0 2 6 4 is main select sort operation krna tha..........

[+ M.Tariq Malik]

Q.No. 1 What is Skip List?
Q.NO. 2. Write the names of Two divide & conquer Alogrthims. Ans , Quick Sort & Merge Sort.
Q.NO. 3. Descrbe 3 characterestics of union by weight method
Q.NO. 4 What is ADT Table, Describe its two implementatoins.
Q.No. 5 Explain , Collision, Linear Probing, Quadratic Probing.
Q. No. 6 How binary Search tree is degenerated.

[fajar]

algorthim for making a maze.

methods to solve collision

sorting

refrence varible

binary search tree

try to clear concept because all question are about their understanding

[+ M.Tariq Malik]

My TODAYS PAPERS.


40MCQ's and
2x4=questions
3x4=questions
5x4=questions

Question No: 41      ( Marks: 2 )

Convert the given infix form to postfix form.

A+B/C-D^E-F

 

Question No: 42      ( Marks: 2 ) 

How we can implement Table ADT using Linked List

 

Question No: 43      ( Marks: 2 ) 

If we allow assignment to constants what will happen?

 

Question No: 44      ( Marks: 2 ) 

How heap sort works to sort a set of data.

 

 

Question No: 46      ( Marks: 3 ) 

  

Give your comment on the statement that heap uses least memory in array representation of binary trees. Justify your answer in either case.

 

Question No: 47      ( Marks: 3 ) 

How we can use concept of equivalence relations to generate a Maze.

Question No: 48     ( Marks: 3 ) 

"For smaller lists, linear insertion sort performs well, but for larger lists, quick sort is suitable to apply." Justify why?

Question No:  49    ( Marks: 5 )
 6 9 5 0 4 1 7 3 2
Show the first five merging steps for Merge sort on this array.

Question No: 50     ( Marks: 5 ) 

What is Disjoint Sets? Explain with an example.

 

 

Question No: 51      ( Marks: 5 )

 Write the code of the perculateDown() function and also comment it.

 

 

 

Question No: 52      ( Marks: 5 ) 

 Here is an array with exactly 15 elements:

1   2   3   4   5   6   7   8   9   10   11   12   13   14   15.

Suppose that we are doing a binary search for an element. Indicate any elements that will be found by examining two or fewer numbers from the array.

 

[♥●๋•Naina Z Here●๋•♥]

AOA to All.

Its My ToDay CS301 Final Papr

WiShinG U BeSt Ov LuCk

[+~M Mujtaba~+]

My today cs301 paper

See The Attachment...........!!!