SLR24 Notes

Question 1

What is a computable problem?

Answer 1

A computable problem is one that can be solved with algorithms.

Question 2

What is a tractable problem?

Answer 2

A tractable problem is one that can be solved in polynomial time or better, meaning it runs quickly enough to be practical and useful.

Question 3

What is an intractable problem?

Answer 3

An intractable problem is one that cannot be solved in polynomial time or better, meaning it becomes unsolvable within a reasonable time frame as input size increases.

Question 4

What is a heuristic method?

Answer 4

Heuristic methods can be used to solve intractable problems by sacrificing the optimal answer for one that is ‘good enough’.

Question 5

How can abstraction and decomposition help solve problems?

Answer 5

Abstraction and decomposition simplify the complexity of a problem, making it easier to write an algorithm to solve the problem.

Question 6

What is enumeration?

Answer 6

Enumeration involves designing an algorithm that performs an exhaustive search and attempts all possible solutions until the correct one is found. It is useful for puzzles.

Question 7

What is a theoretical approach in problem-solving?

Answer 7

A theoretical approach involves reducing the problem to pure theory, represented using mathematical equations, making it easier for computers to solve.

Question 8

What is simulation?

Answer 8

Simulation involves designing a model of a real system to understand its behavior.

Question 9

What is automation?

Answer 9

Automation involves building problem-solving models and putting them into action, often using abstraction to turn complex problems into solvable ones.

Question 10

What is problem recognition?

Answer 10

Problem recognition is the ability to recognize that a problem exists and to define it clearly, including identifying the system requirements.

Question 11

What questions help with problem recognition?

Answer 11

Questions include: Is there a problem? What is its exact nature? What data is needed? What variables are involved? What processes and techniques should be considered?

Question 12

What is problem decomposition?

Answer 12

Problem decomposition is the process of breaking a large problem into smaller, more manageable subproblems, making the project easier to manage.

Question 13

What is step-wise refinement?

Answer 13

Step-wise refinement is a method of breaking down a problem into smaller modules, which can be tested in isolation before integration into the final solution.

Question 14

How does problem decomposition aid in development?

Answer 14

Decomposition allows multiple parts of a project to be developed in parallel, speeding up delivery and making debugging easier.

Question 15

What is the divide and conquer technique?

Answer 15

Divide and conquer reduces the size of a problem with each iteration by halving the problem and solving the subproblems recursively.

Question 16

What is the principle of ‘decrease and conquer’?

Answer 16

Decrease and conquer is similar to divide and conquer, but the problem is reduced by less than half in each iteration.

Question 17

What is the time complexity of divide and conquer?

Answer 17

Divide and conquer generally has a time complexity of O(logn), where the time taken to solve does not grow as significantly as the problem size increases.

Question 18

What is representational abstraction?

Answer 18

Representational abstraction removes excessive details to simplify a problem, allowing programmers to focus on the core aspects of a solution.

Question 19

What is abstraction in computer games?

Answer 19

In computer games, abstraction allows developers to focus on the realism and enjoyability of the game without trying to replicate every variable and interaction.

Question 20

What are levels of abstraction?

Answer 20

Levels of abstraction allow complex projects to be split into simpler components, making it easier for teams to work on different layers of a system.

Question 21

What is abstraction by generalisation?

Answer 21

Abstraction by generalisation creates a broader concept by focusing on common features and ignoring specific details.

Question 22

What is backtracking?

Answer 22

Backtracking is a method where partial solutions are built incrementally, and if the solution cannot be completed, it backtracks to a previous successful state.

Question 23

What is data mining?

Answer 23

Data mining is the process of analyzing vast amounts of data to discover trends, correlations, and outliers that are not immediately obvious.

Question 24

What is Big Data?

Answer 24

Big Data refers to large datasets that are analyzed computationally to reveal patterns and trends, especially in areas like human behavior.

Question 25

What are heuristics in problem-solving?

Answer 25

Heuristics use experience and estimates to find an approximate solution when the standard solution is too time-consuming or resource-intensive.

Question 26

What is performance modeling?

Answer 26

Performance modeling approximates how well a system performs using simulations and mathematical approximations, which is crucial for safety-critical systems.

Question 27

What is pipelining?

Answer 27

Pipelining involves splitting a large task into manageable chunks, processing them in parallel to speed up the overall process.

Question 28

What are visualizations?

Answer 28

Visualizations allow us to present data in a more understandable format, helping to identify trends that are not otherwise obvious.

Question 29

What are the uses of visualizations?

Answer 29

Visualizations are used to create mental images of how a program works, identify trends, and inform business decisions by representing data as graphs, charts, or tables.

Question 30

What is abstraction’s role in simplification?

Answer 30

Abstraction simplifies complex problems by focusing only on the most relevant components, making it easier to develop algorithms.

Question 31

How can decomposition improve problem-solving?

Answer 31

Decomposition makes large problems manageable by breaking them into smaller, more understandable sub-problems.

Question 32

What is recursion in backtracking?

Answer 32

In backtracking, recursion allows the solution process to explore multiple paths, and backtrack if a solution cannot be completed.

Question 33

What is the goal of divide and conquer?

Answer 33

The goal of divide and conquer is to break down a problem into smaller parts, solve the subproblems, and combine them to form the final solution.