Data Structures & Algorithms

Data Structures & Algorithms

12th Grade

10 Qs

quiz-placeholder

Similar activities

Arrays, lists, tuples, stacks and queues

Arrays, lists, tuples, stacks and queues

11th - 12th Grade

14 Qs

Queues and Stacks

Queues and Stacks

12th Grade

10 Qs

PT101 - Mobile and Game Platform

PT101 - Mobile and Game Platform

11th Grade - University

12 Qs

Assesmen Kognitif (XI)

Assesmen Kognitif (XI)

11th Grade - University

15 Qs

هياكل البيانات_علوم الحاسب_المكدس والطابور_12

هياكل البيانات_علوم الحاسب_المكدس والطابور_12

12th Grade

8 Qs

Sumatif Akhir Informatika

Sumatif Akhir Informatika

1st Grade - University

10 Qs

Azure Fundamentals

Azure Fundamentals

12th Grade

15 Qs

Data Structures

Data Structures

12th Grade

15 Qs

Data Structures & Algorithms

Data Structures & Algorithms

Assessment

Quiz

Computers

12th Grade

Hard

Created by

Stuart Forsyth

Used 11+ times

FREE Resource

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following data structures is a LIFO data structure?

hash table

queue

stack

tree

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the the following properties would mean that a graph is not a tree?

unweighted

undirected

cyclical

acyclical

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following data structures is not dynamic?

list

stack

tree

circular queue

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the sorting and searching algorithms is most time efficient?

linear search

binary search

bubble sort

merge sort

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Problems with a solution that cannot be solved in which time or less are considered intractable?

exponential

factorial

linear

polynomial

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is not a type of graph traversal?

breadth first search

depth first search

reverse in order search

anti order search

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which approach can be used to turn intractable problems into tractable ones?

heuristic algorithms

dijkstra's

decomposition

abstraction

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?