ITE-6201 - Data Structures and Algorithm Analysis oed answer key
Showing 181 to 200 of 228 total answers.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
If the number of records to be sorted is small, then __________ sorting can be efficient.
Answer
Selection
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
In the stack, if the user try to remove element from the empty stack then it is called as
Answer
Underflow of stack
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Trees are ________ if they are similar and have the same contents at corresponding nodes.
Answer
copies
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
A Binary Tree that stores a collection of elementswith their associated keys at its nodes.
Answer
Heap
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
The terms depth-first and breadth-first are two most common graph ______________ algorithm
Answer
traversal
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Unlike an array, inserting an element on a particular node is not allowed in a linked list
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
If a linked list is unordered, we can insert a new item at either the end or the beginning.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
The data structure that consists of finite set of _____________which are also called nodes.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Tree is usually visualized by connections between parents and children with straight lines.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Which data structure is suitable to represent the hierarchal relationship between elements?
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Every node N in a binary tree T except the root has a unique parent called the ________ of N.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
We use a ______________, which corresponds to a heap where the largest element is at the top.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
A Data Structure that can be accessed only at one of its ends for storing and retrieving data.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
Indicate which structure would be a more suitable choice for each of the following applications.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
The item search, insertion, and deletion operations all require the binary tree to be traversed.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
The data structure that stores data in the form of key and value pairs where every key is unique.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
This is very useful in situation when data have to be stored and then retrieved in reverse order.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis
This may take place only when there is some minimum amount or no space left in free storage list.
#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis