BC090402053 : Samina Abdul Rehman
Quiz Start Time: 09:09 PM
Time Left 75
sec(s)
Question # 1 of 15 ( Start time: 09:09:20 PM ) Total Marks: 1
In threaded binary tree, the NULL pointers are replaced by the
Select correct option:
preorder successor or predecessor
inorder successor or predecessor
postorder successor or predecessor
NULL pointers are not replaced
BC090402053 : Samina Abdul Rehman
Quiz Start Time: 09:09 PM
Time Left 67
sec(s)
Question # 2 of 15 ( Start time: 09:10:23 PM ) Total Marks: 1
If one pointer of the node in a binary tree is NULL then it will be a/an
Select correct option:
Inner node
Leaf node
External node
Root node
BC090402053 : Samina Abdul Rehman
Quiz Start Time: 09:09 PM
Time Left 65
sec(s)
Question # 3 of 15 ( Start time: 09:11:26 PM ) Total Marks: 1
When a complete binary tree represented by an array then if right child is at position 5 then left child will be at position _____
Select correct option:
2
3
4
6
BC090402053 : Samina Abdul Rehman
Quiz Start Time: 09:09 PM
Time Left 47
sec(s)
Question # 4 of 15 ( Start time: 09:12:14 PM ) Total Marks: 1
See the below code and fill the appropriate answer for? void fastInorder(TreeNode* p) { while((p=nexInorder(p)) != ? ) cout << p->getInfo(); }
Select correct option:
dummy
rootNode
LTH
RTH
BC090402053 : Samina Abdul Rehman
Quiz Start Time: 09:09 PM
Time Left 6
sec(s)
Question # 5 of 15 ( Start time: 09:13:09 PM ) Total Marks: 1
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)
BC090402053 : Samina Abdul Rehman
Quiz Start Time: 09:09 PM
Time Left 28
sec(s)
Question # 6 of 15 ( Start time: 09:14:36 PM ) Total Marks: 1
Which of the following statement is not correct about Binary Trees, where binary tree traversals are carried out repeatedly?
Select correct option:
The overhead of stack operations during recursive calls can be costly.
If we use non-recursive but stack driven traversal procedure then it would be costly again.
It is useful to modify the tree data structure which represents the binary tree to speed up the inorder traversal process by making it stack free.
It is very cumbersome to modify the tree data structure as most of pointer fields are not NULL.
BC090402053 : Samina Abdul Rehman
Quiz Start Time: 09:09 PM
Time Left 74
sec(s)
Question # 7 of 15 ( Start time: 09:15:51 PM ) Total Marks: 1
Traversing a binary tree can only be done using _________
Select correct option:
Iteration
Recursion
Both recursion and iteration
None of the given options
BC090402053 : Samina Abdul Rehman
Quiz Start Time: 09:09 PM
Time Left 68
sec(s)
Question # 8 of 15 ( Start time: 09:17:14 PM ) Total Marks: 1
If the bottom level of a binary tree is NOT completely filled, depicts that the tree is NOT a ----------
Select correct option:
Complete Binary tree
Threaded binary tree
Expression tree
Perfectly complete Binary tree
BC090402053 : Samina Abdul Rehman
Quiz Start Time: 09:09 PM
Time Left 84
sec(s)
Question # 9 of 15 ( Start time: 09:18:27 PM ) Total Marks: 1
Finding the minimum is easy; it is _____ of the min heap.
Select correct option:
Top
Left most child
Right most child
None of the given options.
BC090402053 : Samina Abdul Rehman
Quiz Start Time: 09:09 PM
Time Left 70
sec(s)
Question # 10 of 15 ( Start time: 09:18:50 PM ) Total Marks: 1
Which of the following statement is true about dummy node of threaded binary tree?
Select correct option:
This dummy node never has a value
This dummy node has always some dummy value
This dummy node has either no value or some dummy value.
This dummy node has always some integer value.
BC090402053 : Samina Abdul Rehman
Quiz Start Time: 09:09 PM
Time Left 45
sec(s)
Question # 11 of 15 ( Start time: 09:19:57 PM ) Total Marks: 1
Consider a min heap, represented by the following array: 3,4,6,7,5,10 After inserting a node with value 1. Which of the following is the updated min heap?
Select correct option:
3,4,6,7,5,10,1
3,4,6,7,5,1,10
1,4,6,7,5,10,3
1,4,3,7,5,10,6
BC090402053 : Samina Abdul Rehman
Quiz Start Time: 09:09 PM
Time Left 62
sec(s)
Question # 12 of 15 ( Start time: 09:21:02 PM ) Total Marks: 1
For the inorder traversal of threaded binary tree, we introduced a dummy node. The left pointer of the dummy node is pointing to the ________ node of the tree.
Select correct option:
left most
root
right most
any of the given node
BC090402053 : Samina Abdul Rehman
Quiz Start Time: 09:09 PM
Time Left 47
sec(s)
Question # 13 of 15 ( Start time: 09:21:51 PM ) Total Marks: 1
A binary tree with N internal nodes has _____ links, _______ links to internal nodes and ________ links to external nodes.
Select correct option:
2N, N-1, N+1
N-1, 2N, N+1
N+1, 2N, N-1
N+1, N-1, 2N
BC090402053 : Samina Abdul Rehman
Quiz Start Time: 09:09 PM
Time Left 68
sec(s)
Question # 14 of 15 ( Start time: 09:23:22 PM ) Total Marks: 1
In complete binary tree the bottom level is filled from ________
Select correct option:
Left to right
Right to left
Not filled at all
None of the given options
BC090402053 : Samina Abdul Rehman
Quiz Start Time: 09:09 PM
Time Left 64
sec(s)
Question # 15 of 15 ( Start time: 09:24:13 PM ) Total Marks: 1
Consider a max heap, represented by the following array: 40,30,20,10,15,16,17,8,4 After inserting a node with value 35.Which of the following is the updated max heap?
Select correct option:
40,30,20,10,15,16,17,8,4,35
40,30,20,10,35,16,17,8,4,15
40,35,20,10,30,16,17,8,4,15
40,35,20,10,15,16,17,8,4,30
--
Naveed Abbas
BSCS 5th Semester
Naveed Abbas home page
yahoo ID
G mail
--
--
Please visit www.vuzs.net For Current & Old Papers, Quizzes, Assignments and study material.
--
You received this message because you are subscribed to the Google
Groups "vuZs" group.
--
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 from your virtual university email address to
vuZs+subscribe@googlegroups.com
or visit
http://groups.google.com/group/vuZs/subscribe
---
For more information Contact vuZs Manager at info@vuzs.net
No comments:
Post a Comment