ITE/CS no.5

Question 1

A type of control structure that enables programs to perform statements repeatedly as long as a condition remains true.

Answer 1

LOOPING CONTROL STRUCTURE

Question 2

Also called finite loops

Answer 2

INDEX LOOPS

Question 3

Also called unended loops

Answer 3

INFINITE LOOPS

Question 4

• Repeats a statement or group of statements while a given condition is true.
• It tests the condition before executing the loop body.
• minimum output is 0 or more

Answer 4

WHILE LOOP

Question 5

• It executes the code block once, before checking if the condition is TRUE, then it will repeat as long as the condition is TRUE.
• minimum output is 1 or more

Answer 5

DO WHILE LOOP

Question 6

• A repetition control structure that allows you to efficiently write a loop that needs to execute a specific number of times
• the minimum output is 0 or more

Answer 6

FOR LOOP

Question 7

It is a collection of data items, all of the same type, accessed using a common name.

Answer 7

ARRAYS

Question 8

These are declared by providing more than one set of square [ ] brackets after the variable name in the declaration statement.

Answer 8

MULTIDIMENSIONAL ARRAYS

Question 9

________ dimensional arrays do not require the dimension to be given if the array is to be completely initialized.

Answer 9

ONE DIMENSIONAL ARRAYS

Question 10

these are used to rearrange a given array or list elements according to a comparison operator on the elements

Answer 10

SORTING ALGORITHMS

Question 11

list in which data items are placed in a particular order

Answer 11

SORTED LIST

Question 12

list in which data items are placed in no particular order; the only relationships between data elements are the list predecessor and successor relationships.

Answer 12

UNSORTED LIST

Question 13

A category of unsorted list in which the arrangement of the elements are in decreasing order, then you need to sort it in increasing order

Answer 13

WORST CASE

Question 14

A category of unsorted list in which the arrangement of the elements are in random order, then you need to sort it in increasing order

Answer 14

AVERAGE CASE

Question 15

A category of unsorted list in which the arrangement of the elements are in increasing order, then you need to sort it in increasing order

Answer 15

BEST CASE

Question 16

• an arrangement of its members into a sequence or linear order, or if the set is already ordered, a rearrangement of its elements.
• the act or process of changing the linear order of an ordered set.

Answer 16

PERMUTATION

Question 17

It is the process in which a new permutation is formed

Answer 17

PASS (P0 to Pn)

Question 18

the exchanging of values from different locations or exchanging positions of two values.

Answer 18

SWAP

Question 19

• it is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order.
• also referred to as sinking sort

Answer 19

BUBBLE SORT

Question 20

It sorts an array by repeatedly by finding the minimum element (considering ascending order) from the unsorted part and putting it at the beginning.

Answer 20

SELECTION SORT

Question 21

• The sorting mechanism where the sorted array is built having one item at a time.
• The array elements are compared with each other sequentially and then arranged simultaneously in some particular order

Answer 21

INSERTION SORT