ITE-6201 - Data Structures and Algorithm Analysis oed answer key

Showing 221 to 228 of 228 total answers.

#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis

The operation commonly performed in graphs that store the graph in computer memory using a particular graph representation is called ________________

Answer

Create the graph

#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis

Given the following code which contains THREE pushes and ONE POP, what will be output of the stack?stack<int> s;spush(1);spush(2);spush(3);cout<<spop;

Answer

12

#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis

Algorithm that finds the location of the smallest element in the unsorted portion of the list and moves it to the top of the unsorted portion of the list

Answer

Selection Sort

#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis

Given an empty array with 5 in size and the following operations have been executedEnqueue(8)Enqueue(1)Enqueue(7)Enqueue(2)Enqueue(6)What will happen if an attempt to execute enqueue(3)?

Answer

A queue overflow error will occur

#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis

Inserting an item into the stack when stack is not full is called ____________ while operation and deletion of item from the stack, when stack is not empty is called ________________ operation.

Answer

push, pop

#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis

A word processor to have a PF key that causes the preceding command to be redisplayed. Every time the PF key is pressed, the program is to show the command that preceded the one currently displayed

#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis

State True or False for internal sorting algorithms.i. Internal sorting are applied when the entire collection if data to be sorted is small enough that the sorting can take place within main memory.ii. The time required to read or write is considered significant in evaluating the performance of internal sorting.

#ITE-6201
Awesome StudentQuestion • Data Structures and Algorithm Analysis

State True or False for internal sorting algorithms. i. Internal sorting are applied when the entire collection if data to be sorted is small enough that the sorting can take place within main memory. ii. The time required to read or write is considered significant in evaluating the performance of internal sorting.

Page 12 of 12