vu cs301 Final 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 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: If one pointer of the node in a binary tree is NULL then it will be a/an __________.
Root node
External node
Inner node
Leaf node
Question 2: Binary Tree traversal can be performed with the help of __________.
Recursive calls only
Non-recursive calls
Both Recursive and Non-recursive calls
None of the given
Question 3: Suppose A is an array containing numbers in increasing order, but some numbers occur more than once when using a binary search for a value, the binary search always finds __________
the first occurrence of a value.
the second occurrence of a value.
may find first or second occurrence of a value.
None of the given options.
Question 4: Which of the following is NOT a correct statement about Table ADT.
In a table, the type of information in columns may be different.
A table consists of several columns, known as entities.
The row of a table is called a record.
A major use of table is in databases where we build and use tables for keeping information.
Question 5: The array in binary search is sub divided __________.
Once
Twice
N time
Untill a sublist is no more divisible
Question 6: If unions are done by weight (size), the depth of any element is never greater than
log 3n
log2 n
n log2 n
log n*n
Question 7: Note that 7 is the front element whereas 4 is rear element of queue."
7 5 2 4
3 7 5 2 4
7 5 2 4 3
5 2 4 3
Question 8: Consider a min heap, represented by the following array:
11,22,33,44,55
After inserting a node with value 66 which of the following is the updated min heap?
11,22,33,44,55
After inserting a node with value 66 which of the following is the updated min heap?
11,22,33,44,55,66
11,22,33,44,66,55
11,22,33,66,44,55
11,22,66,33,44,55
Question 9: Price is used to encourage buyers to try a new product or to purchase existing brands during periods when sales slow down (e.g., recessions). This illustrates the pricing objective of which one of the following options?
Gain market share
Achieve financial performance
Create product positioning
Stimulate demand