vu cs301 Final Term - Quiz No.13
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: Merge sort and quicksort both fail into the same category of sorting algorithms, What is this category ?
O(nlogn) sorts
Interchange sort
Average time is quadratic
None of the given options.
Question 3: The __________ of a node in a binary tree is defined as the height of its left subtree minus height of its right subtree.
Height
Balance
Width
None of the above
Question 4: A kind of expression where the operator is present between two operands called __________ expressions .
Postfix
Infix
Prefix
None of the above
Question 5: The above mentioned relation is __________."
Reflexive
Symmetry
Transitive
None of the given
Question 6: when we have declared the size of the array, it is not possible to increase or decrease it during the __________ of the program.
Declaration
Execution
Defining
None of the above
Question 7: There are three decision involved in designing a sample. Which of the following is NOT a part of sample designing?
Sampling unit
Sampling size
Sampling procedure
Sampling cost
Question 8: Each node in a double link list has __________.
1 pointer
2 pointer
3 pointer
4 pointers
Question 9: For Binary Search Tree, we call the findMax() method as __________.
findMin(tree->getLeft())
findMin(tree->getRight())
findMin(tree->getCenter())
findMin(tree->getDown())