Unit 2: Computational Thinking and Algorithms — Short Questions

Computational thinking is a problem-solving approach in which a problem is understood, broken into smaller parts, and solved step by step using logical thinking. It involves looking for patterns, removing unnecessary details, and creating clear steps that can be followed by humans or computers.

Computational thinking is important because it helps us understand problems clearly and break big problems into smaller, simpler parts. It allows us to focus on important points by removing unnecessary details, and to create clear, correct-order steps, which prevents errors and allows both humans and computers to follow and solve the problem logically.

Decomposition is the process of breaking a large or complex problem into smaller and manageable parts. Each smaller part can then be understood and solved more easily, which makes solving the overall problem simpler.

An algorithm is a step-by-step set of instructions used to solve a problem or perform a task. The steps must be followed in the correct order so that the solution works correctly, and they can be followed by humans or computers, such as the steps to make tea: Start → Boil Water → Steep Tea → Add Milk or Lemon → Serve Tea → End.

In computer science, logic means using rules to make correct decisions. It helps computers understand true and false conditions and process information correctly. Logical statements are used in programs and algorithms to control the flow of programs, forming the basis of many computer operations.

A proposition is a statement that is either true or false, but not both at the same time. Questions and commands are not propositions. For example, "The sun rises in the east" is a proposition, usually represented by a capital letter such as P, Q, or R.

Truth values are the two possible values a proposition can take: True (T) or False (F). Each proposition, such as P or Q, is assigned one of these values, and the truth value of a compound proposition is determined by the truth values of its component propositions.

A truth table is a table used to show the truth values of a logical expression for all possible combinations of its inputs. It lists every combination of True/False values of the propositions and shows the final result of the expression for each combination.

Propositional satisfiability is a concept in logic that checks whether a statement can be true, i.e., whether there is at least one combination of truth values that makes the expression true. A proposition is satisfiable if at least one such case exists; if no combination makes it true, it is unsatisfiable.

A predicate is a logical expression that describes a property or relationship of a subject, and whose truth depends on the value of the variable(s) involved. For example, Tall(Ali) means "Ali is tall," and isEven(x) is true if x is an even number.