CC4 Sorting & Queue

Question 1

Given a list of data FIND the location of a particular value or report that value is not present​

Answer 1

Searching

Question 2

A fundamental application for computers​

Done to make finding data (searching) faster​

Answer 2

Sorting

Question 3

The data collection to be sorted is kept in the MAIN memory.

Answer 3

Internal Sorting

Question 4

The sorting of data stored on secondary devices. Data is sorted in the main memory and written back to the SECONDARY DEVICE.

Answer 4

External Sorting

Question 5

is the SIMPLEST iterative algorithm operates by comparing each item or element with the item next to it and swapping them if needed.

Answer 5

Bubble Sort

Question 6

has achieved SLIGHTLY better performance and is efficient than bubble sort algorithm.

Answer 6

Selection Sort

Question 7

Is a SIMPLE sorting algorithm that allows for efficient, in-place sorting of the array, one element at a time.

Answer 7

Insertion Sort

Question 8

s a type of a DIVIDE AND CONQUER algorithm used to sort a given array; this means that the array is divided into halves and then further sub-divided till division can no longer take place.​

Answer 8

Merge Sort

Question 9

when size of UNSORTED LIST or portion of array is small use INSERTION SORT, OTHERWISE USE

Answer 9

Hybrid Sorts

Question 10

(T)

Language libraries often have sorting algorithms in them​

Java Arrays and Collections classes​

C++ Standard Template Library​

Python sort and sorted functions​

Question 11

(T)

Many other sorting algorithms exist.

Question 12

is a special type of LinkedList. It is a FIFO (First-in, First-out) data structure. That is, the first element to be added will be the first element to be removed, and so forth.

Answer 12

Queue

Question 13

three main operations:

Answer 13

enqueue, dequeue, and peek.

Question 14

a LIST-LIKE STRUCTURE that provides restricted access to its elements.

Answer 14

Queues

Question 15

(T)

In Queue, however an insertion must happen at one end that we call rear or tail of the queue and any removal must happen at the other end called front or end of the queue

Question 16

A LIST OR COLLECTION with the restriction that insertion can be performed at one end (rear) and deletion can be performed at the other end (front).​

​

Answer 16

Operations​

EnQueue(x)​

DeQueue()​

Front()​

IsEmpty​

Question 17

All member functions for both the array-based and linked queue implementations REQUIRE

Answer 17

Constant Time

Question 18

issues are the same as for the equivalent stack implementations. ​

Answer 18

Space Comparison

Question 19

(T)

Unlike the array-based stack implementation, there is no convenient way to store two queues in the same array, unless items are always transferred directly from one queue to the other.​