vu cs301 Mid Term - Quiz No.14
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 1: In the linked list implementation of the stack class, where does the push member function places the new entry on the linked list?
At the tail
After all other entries that are greater than the new entry
At the head
After all other entries that are smaller than the new entry
Question 2: In the worst case of deletion in AVL tree requires __________.
Only one rotation
Rotation at each non-leaf node
Rotation at each leaf node
Rotations equal to log2 N
Question 4: Consider the following sequence of push operations in a stack:
stack.push('7');
stack.push('8');
stack.push('9');
stack.push('10');
stack.push('11');
stack.push('12');
stack.push('7');
stack.push('8');
stack.push('9');
stack.push('10');
stack.push('11');
stack.push('12');
9 8 11 10 7 12
9 10 8 11 12 7
7 8 9 10 11 12
9 10 8 12 7 11
Question 5: In which of the following tree, parent node has key greater than or equal to its both children?
Max heap
Binary search tree
Threaded Binary tree
Complete Binary tree
Question 6: In complete binary tree the bottom level is filled from __________
Left to right
Right to left
Not filled at all
None of the given options
Question 7: Suppose currentNode refers to a node in a linked list (using the Node class with member variables called data and nextNode). What boolean expression will be true when cursor refers to the tail node of the list?
(currentNode == null)
(currentNode->nextNode == null)
(nextNode.data == null)
(currentNode.data == 0.0)
Question 8: Which of the following statement is NOT true about threaded binary tree?
Right thread of the right-most node points to the dummy node.
Left thread of the left-most node points to the dummy node.
The left pointer of dummy node points to the root node of the tree.
Left thread of the right-most node points to the dummy node.
Question 9: In C what is the operation that you can not do with primitive types?
Assign a value to primitive type using a literal
Declare primitive types to be constant using the Const keyword
Create a new instance of primitive type with New keyword
None of these
Question 10: An established company with respected brands might introduce, which one of the following options to compete against low priced rivals?
Value pricing
A fighter brand
Special sales promotions
Price cuts
