Introduction to Algorithm, History, and Its Role Flashcards

1
Q

set of instructions that computers follow to perform calculations or solve problems.

A

Algorithm

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

The word “algorithm” originated from the name of the Central Asian scientist, Abu Abdullah Muhammad ibn Moussa al-Khwarizmi.

A

9th Century

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

The word “blank” originated from the name of the Central Asian scientist, Abu Abdullah Muhammad ibn Moussa al-Khwarizmi.

A

algorithm

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

Scientists began applying algorithms to other mathematical procedures besides just calculations.

A

1360

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

Around 1360 French philosopher Nicole Oresme wrote a mathematical treatise called “blank”, where he used degrees with fractional exponents, coming close to the idea of logarithms.

A

Algorismus proportionum

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

Around 1360 Manuals on accounting on lines were called “blank” (rules for accounting on lines).

A

Algorithmus linealis

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

Gottfried Leibniz, in his work “Nova Methodvs pro maximis et minimis, itemque tangentibus…”, used the word “Algorithmo” to describe a systematic way to solve differential calculus problems.

A

1684

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

1684: Gottfried Leibniz, in his work “Nova Methodvs pro maximis et minimis, itemque tangentibus…”, used the word “blank” to describe a systematic way to solve differential calculus problems.

A

Algorithmo

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

The concept of algorithm was precisely defined, allowing for the proof of algorithmic insolvability of many mathematical problems. Alan Turing described a theoretical machine that could solve problems by following coded algorithms.

A

1936

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

Turing’s paper “Computing machinery and intelligence” explored the relationship between algorithms and intelligent machines.

A

1950

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

Turing’s paper “blank” explored the relationship between algorithms and intelligent machines.

A

Computing machinery and intelligence

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

IBM’s Deep Blue machine defeated chess champion Garry Kasparov in a symbolic match between human and artificial intelligence.

A

1997

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

The US military invested in war robots, creating BigDog, the first robotic animal. Over 2,000 bomb disposal robots were deployed in Iraq and Afghanistan.

A

2005

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

The US military invested in war robots, creating (blank), the first robotic animal. Over 2,000 bomb disposal robots were deployed in Iraq and Afghanistan.

A

BigDog

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

Google introduced voice recognition software on iPhones. Since then, Google has introduced numerous improved versions of Go, a programming language.

A

2008

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

Algorithms receive input data in various formats, like numbers, text, or images.

A

Input

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

Algorithms process this input data through logical and mathematical operations, transforming it.

A

Processing

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

Once processed, the algorithm produces an output, which could be a result, a decision, or other meaningful information.

A

Output

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

Algorithms aim to be efficient, solving tasks quickly with minimal resources.

A

Efficiency

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

Under efficiency, Algorithm designers continually work to improve their algorithms for speed and reliability.

A

Optimization

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

Under efficiency, Algorithms are implemented in various programming languages for computers to execute them and produce the desired results.

A

Implementation

22
Q

Algorithms help understand scalability by breaking down large problems into smaller steps for faster analysis.

A

Scalability

23
Q

The real world is complex. Algorithms allow us to break down problems into smaller steps, making them more manageable.

A

Performance

24
Q

A straightforward approach that tries all possible solutions. Suitable for small problems but can become impractical for larger ones due to high time complexity.

A

Brute force algorithm

25
Q

Breaks a problem into smaller, similar subproblems and repeatedly applies itself until reaching a base case. Effective for tasks with recursive structures.

A

Recursive algorithm

26
Q

Transforms data into a secure, unreadable form using cryptographic techniques, ensuring confidentiality and privacy.

A

Encryption algorithm

27
Q

A trial-and-error technique that explores potential solutions by undoing choices when they lead to incorrect outcomes. Used in puzzles and optimization problems.

A

Backtracking algorithm

28
Q

Finds a specific target within a dataset, enabling efficient information retrieval.

A

Searching algorithm

29
Q

Arranges elements in a specific order, like numerical or alphabetical, to enhance data organization and retrieval.

A

Sorting algorithm

30
Q

Converts data into a fixed-size hash value for rapid data access and retrieval.

A

Hashing algorithm

31
Q

Breaks a complex problem into smaller subproblems, solves them independently, and combines their solutions to address the original problem.

A

Divide and conquer algorithm

32
Q

Makes locally optimal choices at each step in the hope of finding a global optimum. Useful for optimization problems but may not always lead to the best solution.

A

Greedy algorithm

33
Q

Stores and reuses intermediate results to avoid redundant computations, enhancing the efficiency of solving complex problems.

A

Dynamic programming algorithm

34
Q

Utilizes randomness to achieve a solution, often used when an approximate or probabilistic answer is sufficient.

A

Randomized algorithm

35
Q

Illustrate the general flow of a process and the relationships between components.

A

Process flow diagrams

36
Q

Visualize how data is processed in an information system from input to output.

A

Data flow diagrams

37
Q

Illustrate the steps involved to complete a task or execute a process efficiently.

A

Workflow diagrams

38
Q

Visualize multiple flows of information or categories to clarify roles and responsibilities.

A

Swimlane flowcharts

39
Q

(Also known as dichotomous keys) make it easy to visualize different paths based on yes/no decisions.

A

Yes/no flowcharts

40
Q

Used at the start and end points of a flowchart.

41
Q

Used to show the direction of information flow.

42
Q

Used to depict tasks or processes within a flowchart.

43
Q

Used in data flow diagrams to represent input or output.

A

Parallelogram

44
Q

Used in yes/no flowcharts to represent decisions.

45
Q

of commands that must be followed for a computer to perform calculations or other problem-solving operations

46
Q

from the name of the great Central Asian scientist Abu Abdullah Muhammad ibn Moussa al-Khwarizmi.

47
Q

1360, French philosopher Nicole Oresme wrote a mathematical treatise “blank”, in which he first used degrees with fractional exponents and actually came close to the idea of ​​logarithms.

A

Algorismus proportionum

48
Q

the abacus was replaced by the so-called account on the lines, numerous manuals on it began to be called “blank” - the rules of the account on the lines.

A

Algorithmus linealis

49
Q

In 1684, Gottfried Leibniz, in the “Nova Methodvs pro maximis et minimis, itemque tangentibus …,” first used the word “blank” in an even broader sense: as a systematic way to solve the problems of differential calculus.

A

Algorithmo

50
Q

Types of algorithms

A
  • Brute Force Algorithm
  • Recursive Algorithm
  • Encryption Algorithm
  • Backtracking Algorithm
  • Searching Algorithm
  • Sorting Algorithm
  • Hashing Algorithm
  • Divide and Conquer Algorithm
  • Greedy Algorithm
  • Dynamic Programming Algorithm
  • Randomized Algorithm
51
Q

Types of flowcharts

A
  • Process Flow Diagrams
  • Data Flow Diagrams
  • Workflow Diagrams
  • Swimlane Flowcharts
  • Yes/No Flowcharts