Algorithms, integers, matrices Flashcards

1
Q

finite set of precise instructions for performing a computation or solving a problem, can be described using computer language

A

algorithm

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

an algorithm has input values from a specified set

A

input

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

from each set of input values, an algorithm produces output values from a specified set

A

output

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

the steps of an algoirthm must be defined precisely

A

definitness

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

an algorithm should produce the correct output values for each set of input values

A

corectness

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

an algorithm should produce the desired output after a finite number of steps for any input in the set

A

finiteness

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

it must be possible to perform each step of an algorithm exactly and in a finite amount of time

A

effectiveness

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

the prcedure should be applicable for all problems of the desired form, not just a particular set of input values

A

generality

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

written using pascal programming language

A

pseudocode

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

a high level language that is more or less independent of a particular type of computer

A

pascal

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

provides an intermediate step between an english language description of an algorithm and an implementation of the algorithm in a programming language

A

pseudocode

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

this algorithm can be used when the list has terms occurring in increasing size

A

binary search

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

the process of arranging elements in order

A

sorting

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

this algorithm puts a list in increasing order by successively comparing adjacent elements, interchanging them if the are in the wrong order

A

bubble sort

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

always begins with the second element. the second element will be compared with the first and so on

A

insertion sort

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

the part of mathematics involving integers and their properties belong to____

A

number theory

17
Q

a = nq + r

A

division algorithm

18
Q

h(k)=kmodm

A

hashing function

19
Q

random numbers that are generated by a systematic method are called ____

A

pseudorandom numbers

20
Q

most common method in generating pseudorandom numbers

A

linear congruential method (LGC)

21
Q

sends secret messages by shifting each letter three letters forwards in the alphabet

A

caesar cipher

22
Q

process of making secret message

A

encryptionq

23
Q

a rectangular array of numbers and its elements are enclosed in square brackets

24
Q

matrices whose elements are either zero or a one

A

zer0-one matrices

25
the ___ and ___ of two zero-one matrices are analogous to boolean operations or and and
join & meet
26
the product is taken as the sum of the products of the elements in the rows of the first matric, and the elements in the columns of the second matrix
boolean prouct
27
A Hashing function is also an ____ function
onto
28
methods in resolving collision in hashing functions
linear probing and quadratic probing
29
every positive integer can be written uniquely as a product of prime numbers
fundamentel theorem of arithmetic