Part 2 ITE6201 Data Structures and Algorithms

 Part 2 ITE6201 Data Structures and Algorithm Analysis

The rearranging of pairs of elements which are out of order, until no such pairs remain.

Select one:

___________ sorting algorithm is frequently used when n is small, where n is the total number of elements.

Select one:

Feedback

The heap is an efficient implementation of an abstract data type called _______________
Select one:

The method used by card sorter.

Select one:

Which of the following is not the required condition for binary search algorithm?

Select one:
The most important properties of Heap is that its _________________ is at its root.
Select one:
We use a ______________, which corresponds to a heap where the largest element is at the top.
Select one:

Partition and exchange sort is ____________.

Select one:

Which of the following sorting algorithm is of priority queue sorting type?

Select one:

_____________ order is the best possible for array sorting algorithm which sorts n item.

Select one:

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.

Select one:

Which of the following is not a limitation of binary search algorithm?

Select one:

Binary search algorithm cannot be applied to _______________.

Select one:

If the number of records to be sorted is small, then __________ sorting can be efficient.

Select one:

Sorting algorithm can be characterized as ________________.

Select one:

The complexity of sorting algorithm measures the __________ as a function of the number n of items to be shorter.

Select one:

The complexity of bubble sort algorithm.

Select one:
When the largest element is at its root it's called
Select one:
Compare to Queue, In Heap you can __________ the whole collection.
Select one:
To make heap from range we used ____________
Select one:
Using put() can perform
Select one:

The complexity of merge sort algorithm.

Select one:
Maps allows us to store elements so they can be located quickly using _________.
Select one:
the association of keys and values defines a ____________.
Select one:
It uses a hash function to compute an index into an array of buckets
Select one:

The average case occurs in linear search algorithm _______________.

Select one:
In order to indicate that an object is not present in the map, we assume that there exists a special sentinel ___________ called end.
Select one:
If Priority queues can be implemented by Heaps, Heaps can be implemented by ___________?
Select one:
The upward movement of the newly inserted entry by means of swapping
Select one:
A Binary Tree that stores a collection of elementswith their associated keys at its nodes.
Select one:

The worst case occurs in linear search algorithm when ________________.

Select one:
The following are some of the applications of heaps except
Select one:

The complexity of linear search algorithm.

Select one: