ITE-6201 - Data Structures and Algorithm Analysis oed answer key
Showing 121 to 140 of 228 total answers.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
What is the minimum number of stacks needed to implement a queue?
Answer
2
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Which of the following you will use to remove an item to a queue?
Answer
Dequeue
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
A connected graph T without any cycles is called ________________.
Answer
free graph
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Compare to Queue, In Heap you can __________ the whole collection.
Answer
Access
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Linked representation of binary tree needs ______ parallel arrays.
Answer
3
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
A list may be linear or nonlinear, depending on its implementation.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
In data structure, a pop is when you remove an element in the stack
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
In priority queue, items are removed according to time they entered
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
The average case occurs in linear search algorithm _______________.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
What operation is used to check the number of objects in the queue?
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
In binary trees, nodes with no successor are called _______________.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
It uses a hash function to compute an index into an array of buckets
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
The upward movement of the newly inserted entry by means of swapping
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
A program keeping track of where canned goods are located on a shelf.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Each node in a linked list must contain at least ___________________.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Every node (except the last node) contains the _____________________?
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
There are two types of linked lists; sorted lists and unsorted lists.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
A linear list in which the pointer points only to the successive node.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis