vu cs301 Final Term - Quiz No.9
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 tree structure is a
Linear data structure
Non-linear data structure
Graphical data structure
data structure like queue
Question 2: The following are statements related to queues.
The last item to be added to a queue is the first item to be removed
A queue is a structure in which both ends are not used
The last element hasnt to wait until all elements preceding it on the queue are removed
A queue is said to be a last-in-first-out list or LIFO data structure.
Which of the above is/are related to normal queues?
The last item to be added to a queue is the first item to be removed
A queue is a structure in which both ends are not used
The last element hasnt to wait until all elements preceding it on the queue are removed
A queue is said to be a last-in-first-out list or LIFO data structure.
Which of the above is/are related to normal queues?
(iii) and (ii) only
(i), (ii) and (iv) only
(ii) and (iv) only
None of the given options
Question 3: Which promotion mix ingredient costs considerably more than advertising to reach one person but can provide more immediate feedback?
Publicity
Sales promotion
Personal selling
Public relations
Question 5: What is the best definition of a collision in a hash table?
Two entries are identical except for their keys
Two entries with different data have the exact same key
Two entries with different keys have the same exact hash value
Two entries with the exact same key have different hash values
Question 6: __________ is when function is calling to itself.
Loop
Recursion
Iteration
Nasted loop
Question 8: In the statement int& a=b;
a and b pointing to two different memory location
a and b are two different names of the same memory location
a and b are two different variable names
b hold the address of variable a
Question 9: We convert the __________ pointers of binary to threads in threaded binary tree.
Left
Right
NULL
None of the given options
Question 10: Those factors that determine the size and means of payment exchanged for goods and services are part of which one of the following mix?
Price promotion mix
Price factor mix
Basic price mix
Production price mix