Data Structures & Algorithms

Data Structures & Algorithms

12th Grade

10 Qs

quiz-placeholder

Similar activities

User Interface Design - Topic 1

User Interface Design - Topic 1

12th Grade

15 Qs

3rd week g9 summative

3rd week g9 summative

7th - 12th Grade

15 Qs

Treasure Hunt

Treasure Hunt

12th Grade

10 Qs

Recap

Recap

12th Grade

10 Qs

ม.3 การประเมินความน่าเชื่อถือของแหล่งข้อมูลอ้างอิงและผลกระทบ

ม.3 การประเมินความน่าเชื่อถือของแหล่งข้อมูลอ้างอิงและผลกระทบ

9th - 12th Grade

10 Qs

Family Quizz

Family Quizz

5th Grade - Professional Development

15 Qs

U26 Q7 - CIDR

U26 Q7 - CIDR

KG - University

12 Qs

Chapter 2: Input Device

Chapter 2: Input Device

12th Grade - University

12 Qs

Data Structures & Algorithms

Data Structures & Algorithms

Assessment

Quiz

Computers

12th Grade

Practice Problem

Hard

Created by

Stuart Forsyth

Used 17+ times

FREE Resource

AI

Enhance your content in a minute

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

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

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

By signing up, you agree to our Terms of Service & Privacy Policy

Already have an account?