Review day1

Question 1

Pseudocode

Answer 1

A way to plan a program’s logic before writing actual code.

Question 2

if statement

Answer 2

IF condition THEN
sequence 1
ELSE
sequence 2
ENDIF

Question 3

while loop

Answer 3

WHILE condition
sequence
ENDWHILE

Question 4

for loop

Answer 4

FOR iteration bounds
sequence
ENDFOR

Question 5

Pseudocode Example 1:
Find the Maximum Number

Answer 5

START
SET max to first element of the list
FOR each element in the list
IF the element is greater than max
SET max to the element
END IF
END FOR
RETURN max
END

Question 6

Pseudocode Example 2:
Find the sum

Answer 6

START
SET sum to 0
FOR each number in the list
ADD number to sum
END FOR
RETURN sum
END

Question 7

Computational thinking Principles

Answer 7

Decomposition, pattern recognition, abstraction and algorithmic thinking.

Question 8

Decomposition

Answer 8

Breaking down complex problems into smaller parts.

Question 9

Pattern Recognition

Answer 9

Identifying similarities and differences between problems and solutions, and using this knowledge to generalize solutions.

Question 10

Abstraction

Answer 10

Focusing on the important details and ignoring irrelevant information, creating a simplified model of the problem.

Question 11

Algorithms

Answer 11

Developing a step-by-step set of instructions to solve the problem .

Question 12

Analyzing code

Answer 12

Examine the code to identify issues such as bugs. Fix the problem, then test it again

Question 13

Nature of programming languages (Java)

Answer 13

Java is a high-level, object-oriented, class-based, general-purpose, and platform-independent programming language

Question 14

Object-Oriented

Answer 14

Java is built around the concept of objects, which encapsulate both data and behavior. This promotes code reusability, modularity, and maintainability.

Question 15

Class-Based

Answer 15

Java uses classes as blueprints for creating objects.

Question 16

General-Purpose

Answer 16

Java can be used to develop a wide variety of applications, from simple scripts to complex enterprise systems.

Question 17

Platform-Independent

Answer 17

Java code can run on any platform that supports the Java Virtual Machine (JVM).

Question 18

Recursion

Answer 18

A function calls itself

Question 19

Three main parts of Recursion

Answer 19

1.Base case
2. Recursive case
3. A change of state that moves the function closer to the base case

Question 20

Base case

Answer 20

This is the condition that stops the recursion

Question 21

Recursive Case

Answer 21

The function calls itself with a slightly modified version of the input

Question 22

Change of State

Answer 22

This ensures that each recursive call brings the function closer to the base case.

Question 23

Recursion Example 1:
Calculate the sum from 1 to n

Answer 23

public static int sum(int n)
{
if (n == 1)
{
return 1;
}
return n + sum(n - 1);
}