We have been working very hard since 2009 to facilitate in your learning Read More. We can't keep up without your support. Donate Now.

www.bit.ly/vucodes

+ Link For Assignments, GDBs & Online Quizzes Solution

www.bit.ly/papersvu

+ Link For Past Papers, Solved MCQs, Short Notes & More

MY DBMS Paper on 14 Feb 2011

 

Question: What is dynamic Equivalence problem? Explain with an example? Marks 5

 

Question: Explain the following term.      Marks 5

  1. Collision
  2. Liner Probing
  3. Quadratic Probing

 

Question: convert the following binary tree. Marks 5

 

 

a)     Perform post-order traversal

b)     Perform in-order traversal

 

Question: What we can conclude from the running time analysis of disjoint sets? Marks 3

 

Question: When Hashing is NOT suitable? Marks 3

 

Question: Give any three properties of complete binary tree? Marks 3

 

Question: What is meant by minimum heap and maximum heap? Marks 2

 

Question: How we cam apply Find operation on elements combined through Union operation? Marks 2

 

 

Question: How we and delete a nod with two Childs in a binary search tree using its right sub tree? Marks 2

 

Question: Give the name of two Divide and Conquer algorithms? Marks 2

 

 

 


+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

+ Click Here to Search (Looking For something at vustudents.ning.com?)

+ Click Here To Join (Our facebook study Group)


Views: 53

Attachments:

© 2020   Created by +M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service

.