0% found this document useful (0 votes)
26 views6 pages

Intro to Computational Thinking

The document contains 10 exam questions about computational thinking and algorithms including defining key terms like iteration, input/output, and flowcharts. It asks the learner to write pseudocode, create a flowchart, and explain concepts like breaking down problems and computational complexity.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
26 views6 pages

Intro to Computational Thinking

The document contains 10 exam questions about computational thinking and algorithms including defining key terms like iteration, input/output, and flowcharts. It asks the learner to write pseudocode, create a flowchart, and explain concepts like breaking down problems and computational complexity.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

4.1.1 - 4.1.

1. What is Computational Thinking, and why is it useful in problem-solving?

2. List three properties that all algorithms must have.

3. Provide a simple example of an algorithm for making a peanut butter and jelly sandwich.

4. Explain what input and output mean in the context of algorithms. Give an example.

5. Describe the main benefits of using flowcharts to represent algorithms.

6. Create a flowchart that calculates the average of three numbers and displays the result.

7. Write pseudocode for an algorithm that finds the largest number in a list of numbers.

8. Why is breaking down a complex problem into smaller, manageable parts important in

algorithm design?

9. Define iteration in algorithms and give an example of an algorithm that uses a loop.

10. What does "computational complexity" mean in computer science, and how does it affect

the efficiency of algorithms?


4.1.6 - 4.1.8

Certainly! Here are 10 slightly easier exam questions related to the topic of iteration and

computational thinking:

What does iteration mean in computer science, and why is it useful in solving problems?

Explain the difference between a "from to loop" and a "while loop." Provide a simple example for

each.

In a flowchart, what does the diamond shape represent when dealing with iteration, and how

does it help make decisions?

Create a flowchart that calculates the sum of numbers from 1 to 10 using a "from to loop."

List one advantage of using a "from to loop" in algorithms.

How is a Boolean test used in a "while loop," and why is it important?

What is pseudocode, and why is it a useful way to express algorithms?

Explain how the choice of iteration method in algorithm design can affect the efficiency of a

program. Provide an example to illustrate.


- 4.14 - 4.2

1. What concurrent processing ?

2. Explain the difference between concurrent processing and sequential processing ?

3. Define abstraction and provide an example of its use ?

4. Does OOP use abstraction , if so when ?

5. Define collection and state an example of a collection?

6. The difference between modeling and simulation and how they relate to each other?

7. List 3 advantages of modular programs ?

8. List the 8 primitive data types?

9. Are strings , classes, arrays primitive data types , answers with True or False ?

10.

- 4.3 - 4.3.6

1. List and define the 4 fundamental operations of a computer.

2. Distinguish between fundamental and compound operations.

3. Distinguish between a programming language’s semantics and syntax.

4. Why do we need high level languages? List 3 examples of HLLs.

5. Define grammar.
6. Distinguish between natural and computer language.

7. Define mnemonics.

8. Distinguish between compilers and interpreters.

9. Define Java virtual machines.

10. Define a variable.

11. In what instance would a constant variable be used?

12. Define operators and list 5 examples.

13. Define OOP and objects.

— 4.3.7 – 4.3.9:

● Explain two advantages of using constant variables.

● Complete the following truth table:

X Y X AND Y

0 0 0

0 1 0

1 0 0

1 1 1

● Distinguish between an object’s properties and its methods.


● Write Java code to to declare a variable of type short called age and assign a value of 43

to it.

● Identify the output of the following line of code:

[Link](42 % 5 >= 3)

- 4.3.10 - 4.3.13:

4.3.10:Explain the difference between lists and arrays.

Define what the following ArrayList methods do:

Add (value)

clear()

indexOf(Value)

set(index,value)

Define what the following String methods do:

Substring(X)

Length()

indexof(X)

What is a sub-program?

What are the benefits of code reuse?

What are the advantages of modular design?

What is a palindrome?
What is a parameter?

What is a multi-dimensional array?

You might also like