J277 2.1.1 Crucial Knowledge

What is the process of removing unnecessary details and including only the relevant details in computational thinking called?

• Abstraction

• Decomposition

• Algorithmic Thinking

• Pseudocode

Which of the following best describes decomposition in computational thinking?

• Breaking a complex problem into smaller, manageable parts

• Writing code in a specific programming language

• Removing unnecessary details from a problem

• Testing a program for errors

Which of the following is NOT an advantage of program decomposition?

• It makes problems easier to solve

• It increases development time

• Different people can work on different parts at the same time

• Program components can be reused in other programs

What is algorithmic thinking?

• A way of getting to a solution by identifying the individual steps needed

• A method of representing sequences of steps in a diagram

• A process of breaking problems into smaller parts

• A type of programming error

Which of the following is considered an input in a program?

• Anything supplied to the program to meet its goals

• The calculations performed by the program

• The output displayed by the program

• The errors found in the program

What should you consider when determining the output of a program?

• What your program needs to output and the form it should take

• How to break the problem into smaller parts

• The grammatical rules of the programming language

• The steps needed to solve the problem

Which symbol in a flowchart is typically used to represent a decision point?

• Diamond

• Rectangle

• Oval

• Parallelogram

What is the main purpose of a structure diagram?

• To show a top-down breakdown of a complex problem

• To represent the sequence of steps in an algorithm

• To write code in a simplified form

• To test the accuracy of an algorithm

Which type of error stops a program from being run or translated due to breaking grammatical rules?

• Syntax Error

• Logic Error

• Runtime Error

• Decomposition Error

Why are trace tables useful when working with algorithms?

• They help track down logic errors by recording the state of variables

• They break problems into smaller parts

• They represent the sequence of steps in a diagram

• They remove unnecessary details from a problem