NEW 1.4.2 Data Structures

NEW 1.4.2 Data Structures

2nd Grade

39 Qs

quiz-placeholder

Similar activities

Vissual Basic

Vissual Basic

1st - 6th Grade

40 Qs

OCR Cambridge National ICT LO3

OCR Cambridge National ICT LO3

KG - Professional Development

34 Qs

menu dan ikon excel

menu dan ikon excel

1st - 5th Grade

38 Qs

PPL Game

PPL Game

1st - 12th Grade

40 Qs

quiz operasi pascal

quiz operasi pascal

KG - Professional Development

39 Qs

LATIHAN TRY OUT XII TKJ

LATIHAN TRY OUT XII TKJ

1st - 12th Grade

40 Qs

REMEDIAL KELAS 9

REMEDIAL KELAS 9

1st - 5th Grade

43 Qs

PAS SISTEM KOMPUTER X

PAS SISTEM KOMPUTER X

1st Grade - University

40 Qs

NEW 1.4.2 Data Structures

NEW 1.4.2 Data Structures

Assessment

Quiz

Computers

2nd Grade

Medium

Created by

Matt Hunt

Used 10+ times

FREE Resource

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

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?