Data Structure and Algorithm

Data Structure and Algorithm

12th Grade

15 Qs

quiz-placeholder

Similar activities

DATA STRUCTURE USING C

DATA STRUCTURE USING C

KG - University

15 Qs

Array

Array

10th - 12th Grade

20 Qs

Data Structures

Data Structures

10th Grade - University

18 Qs

Quiz on Data Structure

Quiz on Data Structure

12th Grade

10 Qs

Computational Thinking Quiz

Computational Thinking Quiz

9th - 12th Grade

20 Qs

susulan dan ramedial Uji Pemahaman Komputasional

susulan dan ramedial Uji Pemahaman Komputasional

9th Grade - University

16 Qs

CP M8 Assessment Review

CP M8 Assessment Review

9th - 12th Grade

17 Qs

Algorithm and Problem Solving Quiz

Algorithm and Problem Solving Quiz

12th Grade

10 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?