vu cs301 Final Term - Quiz No.10
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: Which of the following statement is FALSE?
Arrays are dense lists and static data structure
data elements in linked list need not be stored in adjecent space in memory
pointers store the next data element of a list
linked lists are collection of the nodes that contain information part and next pointer
Question 2: Consider the following infix expression:
x – y * a + b / c
Which of the following is a correct equivalent expression(s) for the above?
x – y * a + b / c
Which of the following is a correct equivalent expression(s) for the above?
x y - a * b + c /
x * y a - b c / +
x y a * - b c / +
x y a * - b / + c
Question 3: A hash function returns a __________ value.
Integer
Double
Float
Char
Question 4: Which one of the following is TRUE about recursion?
Recursion extensively uses stack memory.
Threaded Binary Trees use the concept of recursion
Recursive function calls consume a lot of memory.
Iteration is more efficient than iteration.
Question 5: Suppose you implement a Min heap (with the smallest element on top) in an array. Consider the different arrays below; determine the one that cannot possibly be a heap:
16, 18, 20, 22, 24, 28, 30
16, 20, 18, 24, 22, 30, 28
16, 24, 18, 28, 30, 20, 22
16, 24, 20, 30, 28, 18, 22
Question 7: Which of the following is not an example of equivalence relation:
Electrical Connectivity
Set of people
<= relation
Set of pixels
Question 8: In threaded binary tree the NULL pointers are replaced by
preorder successor or predecessor
inorder successor or predecessor
postorder successor or predecessor
NULL pointers are not replaced
Question 9: The union operation is based on size or weight but the reducing the in-between links or path compression from __________ to the __________ is done by the find method.
roots, node
nodes, root
root, root
node, node
Question 10: a * (b+c)-d is an example of __________ expression.
infix
prefix
postfix
allfix