Font size
WorksheetsPre Test Konsep Berpikir Komputasional
Total questions: 27
Worksheet time: 16mins
What is the concept or method for observing problems and applying computer science technology to obtain solutions?
Creative Thinking
Critical Thinking
Computational Thinking
Logical Thinking
Systematic Thinking
What is one of the benefits of computational thinking?
Memorizing data and information
Breaking down large problems into smaller ones
Identifying patterns without analysis
Developing creativity without logic
Solving problems only with computers
The stage that transforms large problems into smaller ones to facilitate problem-solving is called?
Abstraction
Algorithm
Pattern Recognition
Decomposition
Data Analysis
The ability to ignore irrelevant details and focus on important information is called?
Algorithm
Pattern Recognition
Abstraction
Decomposition
Generalization
The process of seeing similarities or trends in different problems to find efficient solutions is called?
Abstraction
Decomposition
Algorithm
Pattern Recognition
Automation
Structured and detailed steps to solve a problem are called?
Abstraction
Decomposition
Algorithm
Pattern Recognition
Representation
What is one of the benefits of computational thinking?
Solving complex problems in a simple and effective way
Manually sorting data
Solving problems that only relate to computers
Training memory
Creating new hardware
Computational thinking trains the mindset to become?
Logical, creative, and structured
Sequential, linear, and rigid
Automatic, mechanical, and planned
Intuitive, random, and fast
Spontaneous, reactive, and unstructured
The application of computational thinking also helps to identify, analyze, and implement solutions in various ways and resources in a?
Slow and careful manner.
Difficult and complicated manner.
Manual and conventional manner.
Efficient and effective manner.
Expensive and exclusive manner.
The stages of computational thinking in order are?
Algorithm, Abstraction, Decomposition, Pattern Recognition
Pattern Recognition, Abstraction, Decomposition, Algorithm
Decomposition, Pattern Recognition, Abstraction, Algorithm
Abstraction, Pattern Recognition, Decomposition, Algorithm
Decomposition, Algorithm, Pattern Recognition, Abstraction
The method used to check whether an object meets certain criteria is called the technique of?
Sorting
Searching
Clustering
Comparison
Filtering
The search technique that checks each object sequentially is called?
Is it meeting the criteria or not, called technique...
Sorting
Searching
Grouping
Comparison
Filtering
The searching technique that checks each object sequentially is called...
Binary Searching
Quick Searching
Sequential Searching
Logical Searching
Random Searching
The process of sorting data from the lowest value to the highest is called...
Descending
Random
Ascending
Quick
Patterned
Here is one type of sorting technique...
Binary Search
Pattern Recognition
Bubble Sort
Decomposition
Random Sorting Technique
The two types of searches discussed in the teaching module are...
Sequential Search and Quick Search
Sequential Search and Binary Search
Binary Search and Random Search
Quick Search and Pattern Search
Logical Search and Manual Search
The process of sorting data from the highest value to the lowest is called...
Random
Descending
Ascending
Quick
Ordered
The sorting method that compares and swaps adjacent elements is called...
Insertion Sort
Quick Sort
Bubble Sort
Merge Sort
Selection Sort
A data sorting technique discussed in the material is...
Searching Technique
Sorting Technique
Decomposition Technique
Abstraction Technique
Discovery Technique
The order of data from the lowest to the highest is called...
Descending
Ascending
Sequential
Random
Searching
The sorting technique that divides data into two parts, sorts each part, and then merges them back is...
Bubble Sort
Insertion Sort
Quick Sort
Merge Sort
Selection Sort
In the context of data structures, a stack is known as...
First-In, First-Out (FIFO)
Last-In, First-Out (LIFO)
First-In, Last-Out (FILO)
Last-In, Last-Out (LILO)
Last-Out, First-In (LOFI)
The topmost part of a stack is called...
Front
Tail
Top
Pop
Push
The operation to add an element to the stack is called...
Pop
Pull
Push
Remove
Insert
The data structure where the first element in will be the first to come out is...
Stack (Tumpukan)
Queue (Antrean)
Tree
Graph
Array
In a queue, the first element that enters is in the position...
Tail
Count
Rear
Front
Top
