vu cs301 Mid Term - Quiz No.2
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: Consider a min heap, represented by the following array:
10,30,20,70,40,50,80,60
After inserting a node with value 31 which of the following is the updated min heap?
10,30,20,70,40,50,80,60
After inserting a node with value 31 which of the following is the updated min heap?
10,30,20,31,40,50,80,60,70
10,30,20,70,40,50,80,60,31
10,31,20,30,40,50,80,60,31
31,10,30,20,70,40,50,80,60
Question 2: Suppose we have a circular array implementation of the queue class, with ten items in the queue stored at data[2] through data[11]. The CAPACITY is 42, i.e., the array has been declared to be of size 42. Where does the push member function place the new entry in the array?
data[1]
data[2]
data[11]
data[12]
Question 3: The data of the problem is of 2GB and the hard disk is of 1GB capacity, to solve this problem we should __________.
Use better data structures
Increase the hard disk space
Use as much data as we can store on the hard disk
Use the better algorithm
Question 4: Four statements about trees are below. Three of them are correct. Which one is INCORRECT?
Trees are recursively defined multi-dimensional data structures tree
The order of a tree indicates a maximum number of children allowed at each node of the
A search tree is a special type of tree where all values (i.e. keys) are ordered
If Tree1's size is greater than Tree2's size, then the height of Tree1 must also be greater than Tree2's height.
Question 5: If a complete binary tree has height h then its no. of nodes will be __________.
Log (h)
2h+1- 1
Log (h) - 1
2h - 1
Question 6: bool LessThan( SomeClass anotherObject ); Which of the following tests in the client code correctly compares two class objects alpha and beta?
if (alpha.LessThan(beta))
if (LessThan(alpha).beta)
if (LessThan(alpha, beta))
if (alpha < beta)
Question 7: Which one is NOT the stage that customers go through in the process of adopting a new product?
Awareness
Interest
Evaluation
Culture
Question 8: Selecting the right competitive advantage is part of which one of the following concepts?
Target marketing
Market Positioning
Market segmentation
Undifferentiated Marketing
Question 9: Which one of the following statements is NOT correct?
Array size can be changed after its creation.
Link List size can be changed after its creation
Binary Search Tree size can be changed after its creation
AVL Tree size can be changed after its creation
Question 10: Finance, research and development, purchasing and manufacturing are all activities of which element of the micro environment?
The supplier
The Competitor
The company
The public