[ vuZs.net ] My Today's CS301 Data Structure

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

--
--
Please visit www.vuzs.net For Current & Old Papers, Quizzes, Assignments and study material.
 
To post a new message on this group, send email to vuZs@googlegroups.com
 
Message Posting Rules: http://vuzs.net/faq/4795-vuzs-google-groups-basic-rules-for-posting-messages.html
--
To unsubscribe from this group, send email to vuZs+unsubscribe@googlegroups.com
--
To join this group Send blank email to vuZs+subscribe@googlegroups.com
or visit
http://groups.google.com/group/vuZs/subscribe