vu cs301 Final Term - Quiz No.20
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: The search for new-product ideas should be __________ rather than haphazard.
Consistent
Systematic
Continual
Seldom
Question 2: Collecting, analyzing and interpretation of data refer to which of the following concepts?
Marketing research
Marketing intelligence
Marketing information
Marketing knowledge
Question 4: If we singly linked list to implement list, then there is an issue that it gives difficulty when we:
Move forward in the list
Move backward in the list
We will increase its size
We will decrease its size
Question 5: Which traversal gives a decreasing order of elements in a heap where the max element is stored at the top?
post-order
level -order
in order
none of the above
Question 6: The simplest case in a BST to delete a node is:
When the node, that is to be deleted is root node
When the node, that is to be deleted has both left and right child
When the node, that is to be deleted has only one child
When the node, that is to be deleted is a leaf node
Question 7: Why is the headline of a print advertisement such a critical component of the copy?
It determines the final layout design.
It is often the only part of the advertisement that is read.
It takes up the most space.
It links the copy to the signature.
Question 8: If a complete binary tree has n number of nodes then its height will be
Log2(n+1)-1
2n
2n-1
2n - 1
Question 9: If you know the size of the data structure in advance, i.e., at compile time, which one of the following is a good data structure to use.
Array
List
Both of these
None of these
Question 10: If a hash function returns 4 for more than one value, this condition is called __________.
Merging
Collision
Mapping
Clustering