wayground logo

Free Printable Worksheets

Font size

S
M
L
XL
Worksheets

Pre Test Konsep Berpikir Komputasional

Total questions: 27

Worksheet time: 16mins

Name
Class
Date
1.

What is the concept or method for observing problems and applying computer science technology to obtain solutions?

a)

Creative Thinking

b)

Critical Thinking

c)

Computational Thinking

d)

Logical Thinking

e)

Systematic Thinking

2.

What is one of the benefits of computational thinking?

a)

Memorizing data and information

b)

Breaking down large problems into smaller ones

c)

Identifying patterns without analysis

d)

Developing creativity without logic

e)

Solving problems only with computers

3.

The stage that transforms large problems into smaller ones to facilitate problem-solving is called?

a)

Abstraction

b)

Algorithm

c)

Pattern Recognition

d)

Decomposition

e)

Data Analysis

4.

The ability to ignore irrelevant details and focus on important information is called?

a)

Algorithm

b)

Pattern Recognition

c)

Abstraction

d)

Decomposition

e)

Generalization

5.

The process of seeing similarities or trends in different problems to find efficient solutions is called?

a)

Abstraction

b)

Decomposition

c)

Algorithm

d)

Pattern Recognition

e)

Automation

6.

Structured and detailed steps to solve a problem are called?

a)

Abstraction

b)

Decomposition

c)

Algorithm

d)

Pattern Recognition

e)

Representation

7.

What is one of the benefits of computational thinking?

a)

Solving complex problems in a simple and effective way

b)

Manually sorting data

c)

Solving problems that only relate to computers

d)

Training memory

e)

Creating new hardware

8.

Computational thinking trains the mindset to become?

a)

Logical, creative, and structured

b)

Sequential, linear, and rigid

c)

Automatic, mechanical, and planned

d)

Intuitive, random, and fast

e)

Spontaneous, reactive, and unstructured

9.

The application of computational thinking also helps to identify, analyze, and implement solutions in various ways and resources in a?

a)

Slow and careful manner.

b)

Difficult and complicated manner.

c)

Manual and conventional manner.

d)

Efficient and effective manner.

e)

Expensive and exclusive manner.

10.

The stages of computational thinking in order are?

a)

Algorithm, Abstraction, Decomposition, Pattern Recognition

b)

Pattern Recognition, Abstraction, Decomposition, Algorithm

c)

Decomposition, Pattern Recognition, Abstraction, Algorithm

d)

Abstraction, Pattern Recognition, Decomposition, Algorithm

e)

Decomposition, Algorithm, Pattern Recognition, Abstraction

11.

The method used to check whether an object meets certain criteria is called the technique of?

a)

Sorting

b)

Searching

c)

Clustering

d)

Comparison

e)

Filtering

12.

The search technique that checks each object sequentially is called?

4 lines
13.

Is it meeting the criteria or not, called technique...

a)

Sorting

b)

Searching

c)

Grouping

d)

Comparison

e)

Filtering

14.

The searching technique that checks each object sequentially is called...

a)

Binary Searching

b)

Quick Searching

c)

Sequential Searching

d)

Logical Searching

e)

Random Searching

15.

The process of sorting data from the lowest value to the highest is called...

a)

Descending

b)

Random

c)

Ascending

d)

Quick

e)

Patterned

16.

Here is one type of sorting technique...

a)

Binary Search

b)

Pattern Recognition

c)

Bubble Sort

d)

Decomposition

e)

Random Sorting Technique

17.

The two types of searches discussed in the teaching module are...

a)

Sequential Search and Quick Search

b)

Sequential Search and Binary Search

c)

Binary Search and Random Search

d)

Quick Search and Pattern Search

e)

Logical Search and Manual Search

18.

The process of sorting data from the highest value to the lowest is called...

a)

Random

b)

Descending

c)

Ascending

d)

Quick

e)

Ordered

19.

The sorting method that compares and swaps adjacent elements is called...

a)

Insertion Sort

b)

Quick Sort

c)

Bubble Sort

d)

Merge Sort

e)

Selection Sort

20.

A data sorting technique discussed in the material is...

a)

Searching Technique

b)

Sorting Technique

c)

Decomposition Technique

d)

Abstraction Technique

e)

Discovery Technique

21.

The order of data from the lowest to the highest is called...

a)

Descending

b)

Ascending

c)

Sequential

d)

Random

e)

Searching

22.

The sorting technique that divides data into two parts, sorts each part, and then merges them back is...

a)

Bubble Sort

b)

Insertion Sort

c)

Quick Sort

d)

Merge Sort

e)

Selection Sort

23.

In the context of data structures, a stack is known as...

a)

First-In, First-Out (FIFO)

b)

Last-In, First-Out (LIFO)

c)

First-In, Last-Out (FILO)

d)

Last-In, Last-Out (LILO)

e)

Last-Out, First-In (LOFI)

24.

The topmost part of a stack is called...

a)

Front

b)

Tail

c)

Top

d)

Pop

e)

Push

25.

The operation to add an element to the stack is called...

a)

Pop

b)

Pull

c)

Push

d)

Remove

e)

Insert

26.

The data structure where the first element in will be the first to come out is...

a)

Stack (Tumpukan)

b)

Queue (Antrean)

c)

Tree

d)

Graph

e)

Array

27.

In a queue, the first element that enters is in the position...

a)

Tail

b)

Count

c)

Rear

d)

Front

e)

Top