vu cs301 Final Term - Quiz No.16
vu cs301 Data Structures Quiz
This quiz belongs to book/course code vu cs301 Data Structures of vu organization. We have 40 quizzes available related to the book/course Data Structures. This quiz has a total of 10 multiple choice questions (MCQs) to prepare and belongs to topic Final Term. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to prepare online MCQs and quizzes.
NVAEducation also facilitates users to contribute in online competitions with other students to make a challenging situation to learn in a creative way. You can create one to one, and group competition on an topic of a book/course code. Also on NVAEducation you can get certifications by passing the online quiz test.
Question 1: A complete binary tree is a tree that is __________ filled, with the possible exception of the bottom level.
partially
completely
incompletely
partly
Question 3: All of the following options are the part of 4 Cs EXCEPT:
Care
Choice
Community
Culture
Question 4: In a perfectly balanced tree the insertion of a node needs __________.
One rotation
Two rotations
Rotations equal to number of levels
No rotation at all
Question 6: In the poat-order traversal of a binary search tree, nodes process as:
Left-subtree, Right-subtree, Root
Rightt-subtree, Root, Left-subtree
Left-subtree, Root, Right-subtree
Rightt-subtree, Left-subtree, Root
Question 7: One difference between a queue and a stack is
Queues require dynamic memory, but stacks do not.
Stacks require dynamic memory, but queues do not.
Queues use two ends of the structure, stacks use only one.
Stacks use two ends of the structure, queues use only one.
Question 8: Which of the following statement is correct property of binary trees?
A binary tree with internal nodes has N+1 internal links
A binary tree with N external nodes has 2N internal nodes.
A binary tree with N internal nodes has N+ 1 external node.
None of above statement is a property of the binary tree.
Question 10: When two or more items should be kept in the same location, especially in hash tables, that is, when two or more different keys hash to the same value
None
Collision Resolution Scheme
Child
Collision