Comp Sci Unit 1 Flashcards

You may prefer our related Brainscape-certified flashcards:
1
Q

Strong Password

A

a password that is easy for a user to remember but would be difficult for someone else to guess based on knowledge of that user

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

Algorithm

A

a finite set of instructions that accomplish a specific task

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

Abstraction

A

the process of reducing complexity by focusing on the main idea

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

Sequencing

A

the application of each step of an algorithm in the order in which the code statements are given

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

Selection

A

determines which parts of an algorithm are executed based on a condition being true or false

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

Iteration

A

a repeating portion of an algorithm

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

Encryption

A

the process of encoding data to prevent unauthorized access

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

Decryption

A

the process of decoding the data

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

Programming Languages

A

used to implement algorithms executed by programs

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

Problem

A

a general description of a task that can (or cannot) be solved algorithmically

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

Instance of a Problem

A

a specific task that needs to be solved with specific input

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

Decision problem

A

a problem with a yes/no answer

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

Optimization problem

A

a problem with the goal of finding the “best” solution among many

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

Decidable problem

A

a decision problem for which an algorithm can be written to produce a correct output for all inputs

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

Undecidable Problem (Halting Problem)

A

one in which no algorithm can be constructed that always leads to a correct yes-or-no answer

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

Scalability

A

the capacity for a system to change in size and scale to meet new demands

17
Q

Efficiency

A

an estimation of the amount of computational resources used by an algorithm

18
Q

Linear or Sequential Search

A

search algorithms that check each element of a list, in order, until the desired value is found or all elements in the list have been checked

19
Q

Binary Search

A

a search algorithm that starts at the middle of a sorted data set of numbers and eliminates half of the data; this process repeats until the desired value is found or all elements have been eliminated

20
Q

Heuristic

A

an approach to a problem that produces a solution that is not guaranteed to be optimal but may be used when techniques that are guaranteed to always find an optimal solution are impractical

21
Q

Algorithmic Bias

A

bias embedded into algorithms and any level of software development

22
Q

Low-level Programming Language

A

Binary/Machine Language

23
Q

High-level programming Language

A

Easy to understand for computers and humans

24
Q

Pseudocode

A

“fake code” Understandable by people

25
Q

Vigenere Cipher

A

Use numbers of each letter and add–> convert back

26
Q

Caesar Cipher

A

offset by number

27
Q

Quadratic vs. Constant vs. Logarithmic vs. Linear (programs)

A

Quadratic= As the size of a problem grows, the amount of extra work required increases much more quickly.
Constant= Same amount of work no matter what
Logarithmic=Every doubling of the size of a problem only requires one extra unit of work.
Linear= As the size of a problem grows, the amount of work required grows at approximately the same rate.