ITE-6201 - Data Structures and Algorithm Analysis oed answer key
Showing 101 to 120 of 228 total answers.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
The retrieval of items in a stack is ___________ operation.
Answer
pop
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Which is the pointer associated with the availability list?
Answer
AVAIL
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
____________________ is not the component of data structure.
Answer
None of these
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
"The elements are removal from a stack in _________ order. "
Answer
Reverse
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
A structure that is showing some descendants is also a tree.
Answer
True
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
What does the sequential representation of binary trees use?
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Binary search algorithm cannot be applied to _______________.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
This form of access is used to add/remove nodes from a stack.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
A linear list in which the last node points to the first node.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
The dummy header in linked list contains ____________________.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
C++ Stack Operation to push the element on the top of the stack
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
In a graph, if e=[u,v], then u and v are called _______________
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
The depth of complete binary tree is given by ________________.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
The ordering of a linked list follows the rule ________________
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
"This form of access is used to add/remove nodes from a stack. "
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
A connected graph T without any cycles is called a ____________.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
A program to keep track of the soccer teams in a city tournament
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Unsorted lists are elements arranged according to some criteria.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis