vu cs301 Final Term - Quiz No.5
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 one of the following is valid postfix expression?
ab+c*d-
abc*+d-
abc+*d-
abc*)+d-
Question 2: Which of the following status ements is correct property of binary trees?
A binary tree with N internal nodes has N+1 internal links.
A binary tree with N external nodes has N+1 internal nodes.
A binary tree with N internal nodes has N+1 external nodes.
None of above statement is a property of the binary tree.
Question 3: Which of the following is true regarding the maze generation?
Randomly remove walls until the entrance and exit cells are in same set.
Removing a wall is the same as doing a union operation
Do not remove a randomly chosen wall if the cells it separates are already in the same set
All of the given
Question 4: __________ is an area in computer memory that is allocated dynamically.
Heap
Stack
Queue
Linked List
Question 5: Select the one FALSE statement about binary trees:
Every binary tree has at least one node.
Every non-empty tree has exactly one root node.
Every node has at most two children.
Every non-root node has exactly one parent.
Question 6: In the call by __________ methodology, a copy of the object is passed to the called function.
Reference
Value
Reference & Value
Copy of the object can not be passed
Question 7: In C++, we place the class interface in __________ file.
.cpp
.cppp
.h
.hh
Question 8: During the union by size method, all the array element initialized to -1 shows:
Tree is complete now
Initial condition of tree
Every tree has two elements each
None of given
Question 10: Huffman encoding uses __________ tree to develop codes of varying lengths for the letters used in the original message.
Linked list
Stack
Queue
Binary tree
