(VU-Study-Corner) Re: [ vuZs.net ] CS301 Today's paper

CS301 Data Structure 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, 

 1. Add

 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


  Regards:

BC100402402

Farrukh

B.S(Comp.Science)

3rd semester

Farrukh095@gmail.com

+92 334 7711095

--
Join us at facebook: https://www.facebook.com/VU.Study.Corner
 
Group Link: http://groups.google.com/group/VU-Study-Corner?hl=en
 
Group Rules: http://groups.google.com/group/VU-Study-Corner/web/group-rules
 
Unsubscribe: VU-Study-Corner+unsubscribe@googlegroups.com
 
Adult contents, Spamming, Immoral & Rudish talk, Cell number, Websites & Groups links specially in paper days are strictly prohibited and banned in group.