Latest Activity In Study Groups

Join Your Study Groups

VU Past Papers, MCQs and More

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


CS301 - Data Structures Quiz No. 02 Due Date Jan 16, 2013 12:00 AM Jan 17, 2013 11:59 PM

Please share here your current online quizs

Views: 1770

Replies to This Discussion

Please Share your online Quizzes here to help each other.thanks

share you quiz for help

cs301 quizz 10 marks sorry 2 nahi huye save 

Consider a binary tree, represented by the following array: A,B,C,D,E,F,G,I,J Is it a strictly binary tree?

A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its __________ successor.

Which of the following statement concerning heaps is NOT true?

A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its __________ successor

See the below code and fill the appropriate answer for? void fastInorder(TreeNode* p) { while((p=nexInorder(p)) != ? ) cout p->getInfo(); }

A variable P is called pointer if

Which of the following statement is false?

In case of insertion of left outer node in BST

thank u any1 else???

See Attachment file

Attachments:

Thanks sir g.

thanks alot .....big help 

plz share more quiz

plz koi current quizzes share kray agr kisi nay solved keay hain tu plzzzzzzzzzzzzzzzzzz???????????

yar upload the quiz here 

Today online Quiz No. 03 Solved

Question # 1 of 10
If we want to find median of 50 elements, then after applying buildHeap method, how many times deleteMin method will be called ?
Select correct option:
5

  • 25

35
50
Question # 2 of 10
If Ahmed is cousin of Ali and Ali is cousin of Asad then Ahmed is also cousin of Asad. This statement has the following property
Select correct option:
Reflexivity
Symmetry

  • Transitivity

All of the above

Question # 3 of 10
If we want to find 3rd minimum element from an array of elements, then after applying buildHeap method, how many times deleteMin method will be called ?
Select correct option:
1
2

  • 3

4

Question # 4 of 10
The preculateDown procedure will move the smaller value__ and bigger value____.
Select correct option:
left,right
right,left
up,down

  • down,up


Question # 5 of 10
If the height of a perfect binary tree is 4. What will be the total number of nodes in it?
Select correct option:

  • 15

16
31
32

Question # 6 of 10
The worst case of building a heap of N keys is _____ .
Select correct option:
N
N^2

  • NlogN

2^N

Question # 7 of 10
Which of the following method is helpful in creating the heap at once?
Select correct option:

  • insert

add
update
preculateDown

Question # 8 of 10
Consider a min heap, represented by the following array: 11,22,33,44,55 After inserting a node with value 66.Which of the following is the updated min heap?
Select correct option:

  • 11,22,33,44,55,66

11,22,33,44,66,55
11,22,33,66,44,55
11,22,66,33,44,55

Question # 9 of 10
Which of the following heap method lowers the value of key at position ‘p’ by the amount ‘delta’?
Select correct option:
increaseKey(p,delta)

  • decreaseKey(p,delta)

preculateDown(p,delta)
remove(p,delta)

Question # 10 of 10
Consider a min heap, represented by the following array: 3,4,6,7,5 After calling the function deleteMin().Which of the following is the updated min heap?
Select correct option:
4,6,7,5

  • 6,7,5,4

4,5,6,7
4,6,5,7, 

+ "ƒå†ìmÅ" Thanks for sharing ur quiz 

RSS

Looking For Something? Search Below

VIP Member Badge & Others

How to Get This Badge at Your Profile DP

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

Management: Admins ::: Moderators

Other Awards Badges List Moderators Group

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

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