Big Idea 4

Question 1

What are the three building blocks of algorithms and what are examples?

Answer 1

Sequencing- a function
Selection- if statement
Iteration- for loops

Question 2

What is the definition of sequencing?

Answer 2

Sequencing is the application of each step of an algorithm in the order in which the statements are given.

Question 3

What is the definition of selection?

Answer 3

Selection uses a Boolean condition to determine which of two parts of an algorithm is used.

Question 4

What is the definition of selection?

Answer 4

Iteration is the repetition of part of an algorithm until a condition is met or for a specified number of times.

Question 5

Algorithms can be combined to make new algorithms. True or false?

Answer 5

True. Many algorithms have individual operations that undergo. When combined, they can achieve a greater goal that integrates each intention. By using algorithms as building blocks for constructing a new algorithm, it ensures the new algorithm being correct.

Question 6

Is there only one way to solve a problem?

Answer 6

No. Many different algorithms can be made to solve one issue. The more algorithms you can develop for the same problem shows insight to the problem.

Question 7

What language types can algorithms include (give examples)?

Answer 7

natural languages (just commanding), pseudocode (actions and demands based on logic-like natural languages), and visual (snap) and textual programming languages (python).

Question 8

What do natural languages and pseudo codes consist of?

Answer 8

They describe algorithms so that humans can understand them.

Question 9

Can programming languages be used in ay domain? Why or why not?

Answer 9

Some programming languages are designed for specific domains and are better for expressing algorithms in those domains.

Question 10

The language used to express the algorithm can affect whether an algorithmic solution exists. True or false?

Answer 10

False. The language used only affects the clarity or readability of the algorithm.

Question 11

Does it really matter what language you use when expressing any algorithm?

Answer 11

Nope. They’re all equivalent.

Question 12

Why would one consider one language versus another?

Answer 12

For the purpose of clarity or readability-whatever the user prefers, basically.

Question 13

What is considered a reasonable time for an algorithm to run?

Answer 13

The number of steps the algorithm takes should be less than or equal to a polynomial function(constant, linear, square, cube, etc) of the size of the input.

Question 14

What should a coder do if a problem cannot be solved in a reasonable time?

Answer 14

In these cases, heuristic approaches may be helpful to find solutions in reasonable time.

Question 15

What is a heuristic approach?

Answer 15

A heuristic is a technique that may allow us to find an approximate solution when typical methods fail ti fins an exact solution.

Question 16

What optimization problems cannot be solved within a reasonable time without approximations?

Answer 16

A “find the best” or “find the smallest” problem would be examples.

Question 17

Can any problem be solved through an algorithm?

Answer 17

No. You cannot turn to an algorithm for an answer as to why he isn’t answering your email. Deal with it.

Question 18

What is an undecidable problem?

Answer 18

An undecidable problem may have instances that have an algorithmic solution, but there is no algorithmic solution that solves all instances of the problem.

Question 19

What is a decidable problem?

Answer 19

A decidable problem is one in which an algorithm can be constructed to answer “yes” or “no” for all inputs. (e.x. is the number even?)

Question 20

How does one analyze an algorithm empirically?

Answer 20

Empirical analysis of an algorithm is done by implementing the algorithm and running it on different inputs. (trial and error)

Question 21

How can you test the efficiency or correctness of an algorithm?

Answer 21

Through reasoning formally or mathematically about the problem (not by using trial and error).

Question 22

Why might one want to go through the trouble to finding the most efficient version of an algorithm?

Answer 22

Finding an efficient algorithm for a problem can help solve larger instances of the problem.

Question 23

What two factors are taken into account when considering efficiency?

Answer 23

Execution time and memory usage.

Question 24

What instances are linear and binary search used?

Answer 24

Linear search can be used when searching for an item in any list; binary search can be used only when the list is sorted.