ITE-6201 - Data Structures and Algorithm Analysis oed answer key
Showing 201 to 220 of 228 total answers.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
This is a linear list in which insertions and deletions are made to form either end of the structure.
Answer
Dequeue
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
When using single inheritance, the inheritance relation between classes in a C++ program forms a tree.
Answer
True
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
___________ sorting algorithm is frequently used when n is small, where n is the total number of elements.
Answer
Insertion
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
Answer
Input restricted dequeue
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
In the linked representation of the stack, __________ pointer behaves as the top pointer variable of stack.
Answer
Start
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Graph G is _____________ if for any pair u, v of nodes in G, there is a path from u to v or path from v to u.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
the upward movement of the newly inserted entry by means of swaps is conventionally called __________________
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
A bank simulation of its teller operation to see how waiting times would be affected by adding another teller.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
The complexity of sorting algorithm measures the __________ as a function of the number n of items to be shorter.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called ____________________.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
If the integers 3,6,9,12 are enqueued onto a queue in that order, what will be the result of the queue after running a dequeue?
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
The value in the left child of a node (if it exists) in a binary search tree will be greater than the value in the node itself.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
The value in the right child of a node (if it exists) in a binary search tree will be greater than the value in the node itself.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
A queue abstract data structure is a list of collection with the restriction that insertion and deletion can perform at the same end
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
In order to indicate that an object is not present in the map, we assume that there exists a special sentinel ___________ called end.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
In order to indicate that an object is not present in the map, we assume that there exists a special sentinel ___________ called end.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
The last step when inserting an element at the tail of a singly linked list is to assign a tail reference itself to the new created node
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
A program to keep track of patients as they check into a medical clinic, assigning patients to doctors on a first-come, first-served basis.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis