vu cs301 Mid Term - Quiz No.17
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 2: For the in order traversal of threaded binary tree, we introduced a dummy node. The left pointer of the dummy node is pointing to the __________ node of the tree.
left most
root
right most
any of the given node
Question 3: Which of the following is Non Linear Data Structure?
Binary Search Trees
LinkLists
Arrays
None of these
Question 4: What boolean expression will be true when cursor refers to the tail node of the list?
(currentNode == null)
(nextNode.data == null)
(currentNode->nextNode == null)
(currentNode.data == 0.0)
Question 5: Consider the function X as under
int X (int Value)
{
return Value;
}
Now a and b are integers in a calling function. Which one of the following is a valid call to the above function X.
int X (int Value)
{
return Value;
}
Now a and b are integers in a calling function. Which one of the following is a valid call to the above function X.
a = X (b);
a = X (&b);
a = X (*b);
None of the given options
Question 6: If the bottom level of a binary tree is NOT completely filled, depicts that the tree is NOT a
Expression tree
Threaded binary tree
complete Binary tree
Perfectly complete Binary tree
Question 8: Which of the following is a property of binary tree?
A binary tree of N external nodes has N internal node.
A binary tree of N internal nodes has N+ 1 external node.
A binary tree of N external nodes has N+ 1 internal node.
A binary tree of N internal nodes has N- 1 external node.
Question 9: Which one of the following is not an example of equivalence relation:
Electrical connectivity
Set of people
<= relation
Set of pixels
Question 10: Which one of the following the target audience for an advertising campaign?
Information base on which to develop the campaign
Location and geographic distribution of persons
Group of people toward whom the advertisements are directed
Overall goal of the advertising campaign
