H446 Paper 2 Prep

H446 Paper 2 Prep

12th Grade

10 Qs

quiz-placeholder

Similar activities

Computer Quiz For NM(06.05.2021)

Computer Quiz For NM(06.05.2021)

11th - 12th Grade

15 Qs

Threats to Data

Threats to Data

9th - 12th Grade

11 Qs

1.1.1 The structure and function of the processor

1.1.1 The structure and function of the processor

11th Grade - University

15 Qs

Tin 12 - Bài 1 - Củng cố

Tin 12 - Bài 1 - Củng cố

12th Grade

10 Qs

INTRODUCCION A LA PROGRAMACION

INTRODUCCION A LA PROGRAMACION

6th Grade - University

10 Qs

MEDIA AND INFORMATION LITERACY

MEDIA AND INFORMATION LITERACY

12th Grade

10 Qs

To Change or Not to Change?

To Change or Not to Change?

12th Grade

10 Qs

General Ict Quiz

General Ict Quiz

4th Grade - University

15 Qs

H446 Paper 2 Prep

H446 Paper 2 Prep

Assessment

Quiz

Computers

12th Grade

Practice Problem

Easy

Created by

RHSC Computing

Used 4+ times

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

10 questions

Show all answers

1.

MATCH QUESTION

1 min • 5 pts

Match the following 2.1 Elements of computational thinking

Thinking procedurally

Simplifying a problem by focusing on the important information only.

Thinking abstractly

Breaking down a complex problem into smaller, more manageable parts

Concurrently

The parts of a problem that can be tackled at the same time.

Thinking ahead

What data will be needed often, we should cache this

Thinking logically

Creating a step-by-step solution to the problem.

2.

MATCH QUESTION

1 min • 5 pts

Match the following 2.2.1 Programming techniques

Encapsulation

A function that calls itself in order to solve a problem.

Polymorphism

Repeating a set of instructions a certain number of times or until a condition is met.

Inheritance

Combining data and methods that operate on that data into a single unit, or class

Recursion

The mechanism by which one class can get the attributes and methods from another class.

Iteration

The ability to present the same interface for different underlying forms (data types).

3.

MATCH QUESTION

1 min • 5 pts

Match the following 2.2.2 Computational methods

Simulation

Breaking a problem into smaller sub-problems, solving each sub-problem

Simulation

All possible solutions to a problem, building and abandoning paths to determine the solution.

Divide and Conquer

Process of searching large volumes of data for patterns.

Data Mining

Creating a model that can imitate the operation of a real-world process or system over time.

Backtracking

A model that can imitate the operation of a real-world process or system over time.

4.

MATCH QUESTION

1 min • 5 pts

Match the following Performance Modeling questions

Latency

Testing how well a system performs when many tasks are done at the same time.

Throughput

A part of the system that slows everything else down.

Bottleneck

The ability of a system to handle more work or grow larger.

Scalability

The amount of work a system can do in a certain amount of time.

Load Testing

The delay before a transfer of data begins following an instruction for its transfer

5.

MATCH QUESTION

1 min • 5 pts

Match the following

Worst Case

Minimum amount of time an algorithm can take to complete.

Time Complexity

How long an algorithm takes to complete a function

Best Case

Maximum amount of time an algorithm can take to complete

Big O Notation

The amount of memory an algorithm uses in relation to the input size

Space Complexity

Notation for running time

6.

MATCH QUESTION

1 min • 5 pts

Match the following search algorithms definitions

Breadth-First Search (BFS)

Operates by dividing the search interval in half repeatedly; requires a sorted list.

Depth-First Search (DFS)

Checks each element in a list sequentially until the desired element is found or the list ends.

Linear Search

Uses a function to directly compute the index of the desired element.

Hash Table Search

Explores as far down a branch as possible before backtracking.

Binary Search

Explores all neighbors at the present depth level before moving on to nodes at the next depth level.

7.

MATCH QUESTION

1 min • 5 pts

Match the following sorting algorithms definitions

Quick Sort

builds the final sorted array one item at a time, with each new item being inserted into its correct position.

Merge Sort

divides the array into two halves, recursively sorts them, and then merges the two sorted halves.

Bubble Sort

repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order.

Insertion Sort

repeatedly selects the smallest (or largest) element from the unsorted portion and moves it to the sorted portion.

Selection Sort

picks an element as a pivot and partitions the array around the pivot.

Create a free account and access millions of resources

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?