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:

a. Distribution

b. Selection

c. Exchange

d. Insertion

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

Select one:

a. Heap

b. Quick

c. Bubble

d. Insertion

Feedback

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

Select one:

a. linked lists

b. Heap-order

c. none of the choices

d. priority queue

The method used by card sorter.

Select one:

a. Insertion

b. Heap

c. Radix sort

d. Quick

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

Select one:

a. The list must be sorted

b. There should be the direct access to the middle element in any sub list.

c. Number values should only be present

d. There must be mechanism to delete and/or insert elements in list

The most important properties of Heap is that its _________________ is at its root.

Select one:

a. child element

b. parent element

c. lowest element

d. highest element

We use a ______________, which corresponds to a heap where the largest element is at the top.

Select one:

a. Comparator

b. Pointer

c. Root

d. Sort

Partition and exchange sort is ____________.

Select one:

a. tree sort

b. quick sort

c. heap sort

d. bubble sort

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

Select one:

a. Insertion sort

b. Bubble sort

c. Selection sort

d. Merge sort

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

Select one:

a. O(n+logn)

b. O(n logn)

c. O(n2)

d. O(logn)

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:

a. True, True

b. False, True

c. True, False

d. False, False

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

Select one:

a. there must be a mechanism to access middle element directly

b. must use a sorted array

c. binary search algorithm is not efficient when the data elements more than 1500

d. requirement of sorted array is expensive when a lot of insertion and deletions are needed

Binary search algorithm cannot be applied to _______________.

Select one:

a. sorted linear array

b. sorted linked list

c. sorted binary trees

d. pointer array

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

Select one:

a. Selection

b. Heap

c. Merge

d. Bubble

Sorting algorithm can be characterized as ________________.

Select one:

a. Both of the choices

b. Simple algorithm which require the order of n2 comparisons to sort n items

c. Sophisticated algorithms that require the O(nlog2n) comparisons to sort items

d. None of these

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

Select one:

a. average-case complexity

b. average time

c. case-complexity

d. running time

The complexity of bubble sort algorithm.

Select one:

a. O(n)

b. O(n2)

c. O(logn)

d. O(n logn)

When the largest element is at its root it's called

Select one:

a. Priority queue

b. Max-heap

c. Min-heap

d. Heap pointer

Compare to Queue, In Heap you can __________ the whole collection.

Select one:

a. Retrieve

b. Access

c. Return

d. Add

To make heap from range we used ____________

Select one:

a. create()

b. makeheap()

c. make_heap()

d. heap()

Using put() can perform

Select one:

a. replace key-value pair

b. iterator to first entry

c. find an entry with key

d. remove key-value pair

The complexity of merge sort algorithm.

Select one:

a. O(logn)

b. O(n)

c. O(n logn)

d. O(n2)

Maps allows us to store elements so they can be located quickly using _________.

Select one:

a. keys

b. arrays

c. search

d. coordinates

the association of keys and values defines a ____________.

Select one:

a. searching

b. mapping

c. pairing

d. traversing

It uses a hash function to compute an index into an array of buckets

Select one:

a. Hash

b. Hash table

c. Maps

d. Bucket Array

The average case occurs in linear search algorithm _______________.

Select one:

a. when item is not the array at all

b. when item is somewhere in the middle of the array

c. when item is the last element in the array

d. item is the last element in the array or item is not there at all

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:

a. marker

b. iterator

c. terminator

d. indicator

If Priority queues can be implemented by Heaps, Heaps can be implemented by ___________?

Select one:

a. Array

b. Queues

c. Lists

d. Stacks

The upward movement of the newly inserted entry by means of swapping

Select one:

a. up-heap swapping

b. up-heap sorting

c. up-heap traversing

d. up-heap bubbling

A Binary Tree that stores a collection of elementswith their associated keys at its nodes.

Select one:

a. Hash map

b. Complete Binary Tree

c. Priority Queue

d. Heap

The worst case occurs in linear search algorithm when ________________.

Select one:

a. Item is not in the array at all

b. Item is somewhere in the middle of the array

c. Item is the last element in the array or item is not there at all

d. Item is the last element in the array

The following are some of the applications of heaps except

Select one:

a. Priority Queue

b. Stacks

c. Heap Sort

d. Graph Algorithms

The complexity of linear search algorithm.

Select one:

a. O(logn)

b. O(n logn)

c. O(n)

d. O(n2)