LinkedIn Quiz Flashcards

1
Q

An algorithm that is deterministic does what?

A

always produces the same output from a given set of inputs

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

An algorithm that takes 8x longer to operate on a data set that is 2x as large is said to be _____ in time.

A

cubic

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

Which classifications apply to Euclid’s algorithm for finding the least common denominator?

A

exact and deterministic

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

Which algorithm type derives a new set of data from an existing set of data?

A

a computational algorithm

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

A _________ algorithm uses calculations to derive and output new data from another set of input data.

A

computational

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

The order of operation is the time scale to perform an algorithmic operation and is indicated by _____ notation.

A

Big-O

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

The measurement of algorithm performance is dependent on which criteria?

A

the input data

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

What is the purpose of an algorithm?

A

to solve a specific problem with a sequential set of steps

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

calculate item index = O(__)

A

1

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

insert or delete item at the beginning = O(___)

A

n

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

insert or delete item in the middle = O(___)

A

n

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

insert or delete item in the end = O(__)

A

1

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

______ is when a function calls itself

A

recursion

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

Given that it is faster to search ordered lists, what is the downside of using them?

A

they are more time consuming to create and maintain than unordered lists

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

Why does a test for ordering require an algorithm that is linear in time complexity?

A

it must test every element

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

Searching in an unordered list requires computational time that is ____ in the list size

A

linear