vu cs301 Mid Term - Quiz No.6
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: Which one of the following group is not often perceived by the majority of potential buyers as typical consumers?
Habitual buyers
Innovators
Brand personalities
Reference groups
Question 3: What requirement is placed on an array, so that binary search may be used to locate an entry?
The array elements must form a heap.
The array must have at least 2 entries.
The array must be sorted.
The array's size must be a power of two.
Question 6: Consider the following paragraph with blanks.
A __________ is a linear list where __________ and __________ take place at the
same end . This end is called the __________.
What would be the correct filling the above blank positions?
A __________ is a linear list where __________ and __________ take place at the
same end . This end is called the __________.
What would be the correct filling the above blank positions?
(i) queue (ii) insertion (iii) removals (iv) top
(i) stack (ii) insertion (iii) removals (iv) bottom
(i) stack (ii) insertion (iii) removals (iv) top
(i) tree (ii) insertion (iii) removals (iv) top
Question 7: I have implemented the queue with a circular array. If data is a circular array of CAPACITY elements, and last is an index into that array, what is the formula for the index after last?
(last % 1) + CAPACITY
last % (1 + CAPACITY)
(last + 1) % CAPACITY
last + (1 % CAPACITY)
Question 8: Which one of the following calling methods does not change the original value of the argument in the calling function?
Call by passing the value of the argument
Call by passing reference of the argument
Call by passing the address of the argument
None of the given options
Question 9: __________ is a binary tree where every node has a value, every node's left subtree contains only values less than or equal to the node's value, and every node's right subtree contains only values that are greater then or equal?
Strictly Binary Tree
Binary Search tree
AVL tree
All of these
Question 10: When Nokia introduced its new mobile set in the market in response to consumer demand, which one of the following philosophy is consistent with such action?
Selling concept
Production concept
Customer concept
Marketing concept