vu cs301 Final Term - Quiz No.11
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: Which of the following statements is correct property of binary trees?
A binary tree with N 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 nodes.
None of above statement is a property of the binary tree
Question 2: Can we store elements with different data types in a single array?
Yes
No
In some cases
None of the given
Question 3: A balanced binary search tree where the height of the two subtrees (children) of a node differs by at most one
Balanced Binary Tree
None
AVL tree
big-O notation
Question 6: If we have 1000 sets each containing a single different person. Which of the following relation will be true on each set:
Reflexive
Symmetric
Transitive
Associative
Question 7: The easiest case of deleting a node from BST is the case in which the node to be deleted __________.
Has left subtree only
Is a leaf node
Has right subtree only
Has both left and right subtree
Question 8: Economic factors focus on which one of the following concepts?
Level of economic development
Bureaucracy
Behavioral pattern
Stability of government
Question 10: The main use of AVL tree is:
Searching of data
Storing of data
Insertion of data
Security of data