vu cs301 Mid 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 Mid 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 2: If both pointers of the node in a binary tree are NULL then it will be a/an __________.
Inner node
Leaf node
Root node
None of the given options
Question 4: We access elements in AVL Tree in __________.
Linear way only
Non linear way only
Both linear and non linear ways
None of the given options
Question 5: How many stages involved in the consumer adoption process?
Six
Seven
Three
Five
Question 6: Which of the following is NOT a form of direct marketing?
Personal selling
Advertising
Telephone marketing
Direct-mail marketing
Question 8: __________ is the maximum number of nodes that you can have on a stack-linked list?
Zero
2n (where n is the number of nodes in linked list)
Any Number
None of these
Question 10: Suppose that the class declaration of SomeClass includes the following function prototype.
bool LessThan( SomeClass anotherObject );
Which of the following tests in the client code correctly compares two class objects alpha and beta?
bool LessThan( SomeClass anotherObject );
Which of the following tests in the client code correctly compares two class objects alpha and beta?
if (alpha < beta)
if (alpha.LessThan(beta))
if (LessThan(alpha, beta))
if (LessThan(alpha).beta)
