Data Structure and Algorithm

Data Structure and Algorithm

12th Grade

15 Qs

quiz-placeholder

Similar activities

19.1 Algorithms Cambridge iA 9618

19.1 Algorithms Cambridge iA 9618

12th Grade

20 Qs

Struktur Data

Struktur Data

9th - 12th Grade

20 Qs

Arrays, lists, tuples, stacks and queues

Arrays, lists, tuples, stacks and queues

11th - 12th Grade

14 Qs

DATA STRUCTURES

DATA STRUCTURES

12th Grade

10 Qs

ADT recap!

ADT recap!

10th - 12th Grade

15 Qs

Recursive Algorithms

Recursive Algorithms

12th Grade

15 Qs

Data Structures using C

Data Structures using C

12th Grade - University

20 Qs

2.3.1 Graph Traversal & Path Finding Algorithms

2.3.1 Graph Traversal & Path Finding Algorithms

12th Grade - University

20 Qs

Data Structure and Algorithm

Data Structure and Algorithm

Assessment

Quiz

Computers

12th Grade

Hard

Created by

Jayson Belmes

Used 90+ times

FREE Resource

15 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

45 sec • 2 pts

It is a formal language comprising a set of instructions that produce various kinds of output.

instructions for computers

programming language

programmable machines

data structure and algorithm

2.

MULTIPLE CHOICE QUESTION

45 sec • 2 pts

It contains elements of one particular data type

Array

Stacks

Lists

Queue

3.

MULTIPLE CHOICE QUESTION

45 sec • 2 pts

It is a data structure that follows the FIFO rule - the first item in is the first item out.

Lists

Array

Stack

Queue

4.

MULTIPLE CHOICE QUESTION

45 sec • 2 pts

A __________ is a data structure where elements are only inserted or deleted at

the top

Queue

Lists

Stack

Array

5.

MULTIPLE CHOICE QUESTION

45 sec • 2 pts

Algorithm should be clear. Each of its steps (or phases), and their inputs/outputs should be clear and must lead to only one meaning.

Input

Unambiguous

Finiteness

Feasibility

Independent

6.

MULTIPLE CHOICE QUESTION

45 sec • 2 pts

Algorithms must terminate after a finite number of steps.

Output

Feasibility

Independent

Finiteness

Unambiguous

7.

MULTIPLE CHOICE QUESTION

45 sec • 2 pts

An algorithm should have step-by-step directions, which should be

independent of any programming code.

Unambiguous

Output

Finiteness

Independent

Feasibility

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?