NEW 1.4.2 Data Structures

NEW 1.4.2 Data Structures

2nd Grade

39 Qs

quiz-placeholder

Similar activities

PTS - PBO / 2024

PTS - PBO / 2024

1st - 3rd Grade

40 Qs

ICT for Grade 2

ICT for Grade 2

2nd Grade

38 Qs

PERSIAPAN US

PERSIAPAN US

1st - 3rd Grade

35 Qs

Quiz Typing 2

Quiz Typing 2

1st - 3rd Grade

40 Qs

Основи програмування Тест№1

Основи програмування Тест№1

2nd Grade

36 Qs

MS office 2016

MS office 2016

1st Grade - Professional Development

40 Qs

chương trình con

chương trình con

1st Grade - University

43 Qs

สอบกลางภาค วิชาคอมพิวเตอร์และสารสนเทศเพื่องานอาชีพ

สอบกลางภาค วิชาคอมพิวเตอร์และสารสนเทศเพื่องานอาชีพ

1st - 12th Grade

40 Qs

NEW 1.4.2 Data Structures

NEW 1.4.2 Data Structures

Assessment

Quiz

Computers

2nd Grade

Practice Problem

Medium

Created by

Matt Hunt

Used 10+ times

FREE Resource

AI

Enhance your content in a minute

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

39 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The following code: Print(Animal(4,1)) outputs the string, 'Dog'. However, the code: Animal(4,1)='Cat' produces an error. Why could this be?

Animal has not been declared
Animal is a variable
'Cat' is not a string
Animal is a tuple

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

One of the differences between stacks and queues is:

A stack is dynamic but a queue is static
A stack can hold any type of data but a queue cannot
A stack has one pointer, a queue has two
A stack has two pointers, a queue has one

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The data structure used to store return addresses and local variables when a function is executing is a:

Stack
Dictionary
Queue
Graph

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is a tuple?

An immutable list
A function of a class
A mutable list
An array of characters to create a string

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

A list is an example of which type of data structure?

Undirected
Directed
Static
Dynamic

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The data structure used to handle interrupts is a:

Stack
Graph
Dictionary
Queue

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Sarah is making a version of a board game called Othello which is played on an 8x8 grid. Which data structure should Sarah use to store the colour of the counters in each space to make her algorithms for the game most efficient?

Binary tree
List
Array
Graph

Access all questions and much more by creating a free account

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?