Gifted & Talented Coding Diagnostic Exam

Gifted & Talented Coding Diagnostic Exam

9th - 12th Grade

44 Qs

quiz-placeholder

Similar activities

UTS SIMKES

UTS SIMKES

12th Grade - University

40 Qs

teknik informatika

teknik informatika

10th Grade

40 Qs

SOAL PAT CHASIS KELAS XI

SOAL PAT CHASIS KELAS XI

10th Grade

40 Qs

Year 11 General AIT Hardware Quiz

Year 11 General AIT Hardware Quiz

11th Grade

40 Qs

Kuis Kejahatan Dunia Maya

Kuis Kejahatan Dunia Maya

12th Grade

41 Qs

SOAL PAT LISTRIK OTOMOTIF KELAS XI

SOAL PAT LISTRIK OTOMOTIF KELAS XI

11th Grade

40 Qs

สอบ กลางภาค ไมโครบิต 6/1 2567

สอบ กลางภาค ไมโครบิต 6/1 2567

12th Grade

40 Qs

Revision Quiz

Revision Quiz

11th Grade

43 Qs

Gifted & Talented Coding Diagnostic Exam

Gifted & Talented Coding Diagnostic Exam

Assessment

Quiz

Instructional Technology

9th - 12th Grade

Hard

Created by

Ashraf Milhim

FREE Resource

44 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following best describes a loop that runs 10 times?

repeat until x = 10

for x = 1 to 10 do

while x > 10

repeat forever

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What does this pseudocode output? if x > 5 then print("A") else print("B") end if Given x = 3:

A

B

AB

None

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the output of the following pseudocode? x = 3 y = 2 if x > y then print("X") else print("Y") end if

Y

X

XY

None

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which data structure is best for accessing elements by an index?

Queue

Stack

Array

Linked List

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

How many times will the loop run? count = 0 while count < 3 do count = count + 1 end while

2

3

4

Infinite

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What does the following pseudocode do? result = 0 for x = 1 to 5 do result = result + x end for

Calculates the product of 1 to 5

Calculates the sum of 1 to 5

Prints numbers from 1 to 5

Nothing

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the time complexity of searching in a sorted array using binary search?

O(n)

O(log n)

O(n^2)

O(1)

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?

Discover more resources for Instructional Technology