ITE-6201 - Data Structures and Algorithm Analysis oed answer key
Showing 161 to 180 of 228 total answers.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Maps allows us to store elements so they can be located quickly using _________.
Answer
keys
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
____________________ level is where the model becomes compatible executable code.
Answer
Implementation level
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
A program to receive data that is to be saved and processed in the reverse order.
Answer
Stack
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
A simple sorting algorithm that works the way we sort playing cards in our hands.
Answer
Insertion
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
It doesn't require a binary tree to be traverse when using insertion or deletion.
Answer
False
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
On average, searching in a binary search tree is faster than searching in a list.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
The address of the first node in the list is stored in a separate location called
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Which of the following is not the required condition for binary search algorithm?
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Indexing the ________________ element in the list is not possible in linked lists.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
The operation of processing each element in the list is known as ________________.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
in _____________ the parent should always be greater or equal than the child nodes.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
The most important properties of Heap is that its _________________ is at its root.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
In a linked list, the ____________ contains the address of next element in the list.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Which of the following data structure can't store the non-homogeneous data elements?
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
In linked representation of stack, ___________ fields hold the elements of the stack.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
In C++ using positions() means to Return a position list of all the nodes of the tree.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
The heap is an efficient implementation of an abstract data type called _______________
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
_____________ order is the best possible for array sorting algorithm which sorts n item.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis