www.vustudents.ning.com

We non-commercial site working hard since 2009 to facilitate learning Read More. We can't keep up without your support. Donate.

CS301 plz share ur current paper here

Stay blessed and Best of Luck for final exam.

Best Regards,

sana

Views: 603

Replies to This Discussion

CS301 Fall 2011 Final Term Feb 2012 – VU Current Paper – 03 Feb 2012

All MCQS from past papers and long questions Given below.

Q 41: Where is hashing suitable? 2 Marks
Q.42 When Hashing is not Suitable? 2 Marks
Q.43 Forgot 2 Marks
Q.44 Forgot 2 Marks
Q.45 How many parameters used in following operation? write their names,
0. Find,
3. Remove 3 Marks
Q.46 Forgot
Q.49 Union by size tree formation, Assignment no4 was asked 5 Marks
Q.50 Code for Union and find operation in disjoints sets. 5Marks
Q.51 A function Hash(x) = (x*2)/ tablesize and is given index from 0 to 11, to find out the contents of tables of values in
order 11, 29, 36, 22, 27 5Marks
Q.52 Forgot 5 Marks

CS301 Fall 2011 Final Term Feb 2012 – VU Current Paper – 03 Feb 2012

what is tree?(2)
what is hashing(2)
apply union operation and draw the tree applying following union operation?(5)

Another Paper:

all mcqs were from past solved papers jo papers bilal bhai ne upload kiay huay hain. 40 mai se almost 30 mcqs un papers mai se thay.

long questions mai se:

write down the algorithm for making maze? 2 marks
difine recursive relationship between siblings and parnts from distinct people? 2 marks
array was given sort that by bubble sort method? 5 marks
array was given sort that by selection sort method? 3 marks
array was given make a binary search tree and then remove a node from resultant tree.? 5 marks
define union by weight? 3 marks
define merge sort algorithm? 2 marks

CS301 Fall 2011 Final Term Feb 2012 – VU Current Paper – 06 Feb 2012

mcq’s boht asan thy simple sy thy samjh a jati thi
or subject me
1 Q tha k stack me postfin or infix kesy kam karty hai 5 marks
2 heapsort or array mil k kesy kth smallest value maloom karty hai 5 marks
3 number thy usy selection sort me karna tha 5 marks
4 numer thy usy kaha k binary search tree me kar k pta nai kia maloos kary us ki samjh nai i 5 marks
5 lenght() method maloom karna tha in query 3 marks
6 heap sort ki advantage 3 marks
7 searing in skip list method 3 marks
8 number thy usy merge array me karna tha 3 marks
9 what is ADT 2 marks
10 collision ka pocha tha k kesy hoti hai 2 marks
11 divide and conquer k elwa kn sa sort k method hai 2 marks
12 heapsort k bary me he tha Q bhol gya

Another Paper:

All MCQS from past papers and long questions Given below.

Q 41: Where is hashing suitable? 2 Marks
Q.42 When Hashing is not Suitable? 2 Marks
Q.43 Forgot 2 Marks
Q.44 Forgot 2 Marks
Q.45 How many parameters used in following operation? write their names,
0. Find,
3. Remove 3 Marks
Q.46 Forgot
Q.49 Union by size tree formation, Assignment no4 was asked 5 Marks
Q.50 Code for Union and find operation in disjoints sets. 5Marks
Q.51 A function Hash(x) = (x*2)/ tablesize and is given index from 0 to 11, to find out the contents of tables of values in order 11, 29, 36, 22, 27 5Marks
Q.52 Forgot 5 Marks

Top Trends

1

2

3

4

5

Asrukh

------------------------------------

Latest Activity

6 minutes ago

5190548569664491853_play.mp4_logo_US

9 minutes ago
Kamran Shahid updated their profile
38 minutes ago
Ammara Sabir liked 刀のの尺's discussion "Karwy Log"
42 minutes ago
Ammara Sabir liked ZAINAB MUGHAL's discussion PARENTS
1 hour ago
1 hour ago

Chala jaon ga

1 hour ago
+ ₱ɆⱤ₣Ɇ₵₮ ҉S҉M҉O҉K҉ER ⱫɆⱠⱠłsH ♥♥ posted a discussion