ITE-6201 - Data Structures and Algorithm Analysis oed answer key
Showing 141 to 160 of 228 total answers.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
The worst case occurs in linear search algorithm when ________________.
Answer
Item is the last element in the array or item is not there at all
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
This is a binary tree whose every node has either zero or two children.
Answer
extended binary tree
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Accessing a linked list from head node until the last node of the list is
Answer
Traversing
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
In C++ using size() means to Return the number/size of nodes in the tree.
Answer
True
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
In sequential implementation, the stack stored in a one-dimensional array
Answer
True
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
To return the number of nodes of a Binary Tree ADT in C++ we use number()
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Which of the following is a pros of a sequential implementation of a stack?
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Which of the following sorting algorithm is of priority queue sorting type?
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
A dictionary of words used by a spelling checker to be built and maintained.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
If a graph has a directional flow, the graph is defined to be ______________
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
It is a pile in which items are added at one end and removed from the other.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Which of the following is/are the levels of implementation of data structure?
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
To represent a graph (in computer memory), we can use _______________________.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Which data structure allows deleting data elements from and inserting at rear?
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Which data structure is used in breadth first search of a graph to hold nodes?
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
A binary tree is a tree in which each node can have zero, one, or two children.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
A pointer variable which contains the location at the top element of the stack.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Algorithms that use a list must know whether the list is array based or linked.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis