Data Structures P1 - Short

Data Structures P1 - Short

11th Grade

65 Qs

quiz-placeholder

Similar activities

Revision Question (Topic 1.1 - Topic 1.3)

Revision Question (Topic 1.1 - Topic 1.3)

11th - 12th Grade

66 Qs

Exploring Computer Science Midterm Study Guide

Exploring Computer Science Midterm Study Guide

9th - 12th Grade

70 Qs

Intro to Control Systems and Sensors

Intro to Control Systems and Sensors

9th - 12th Grade

65 Qs

Ôn tập CĐ1: Máy tính và xã hội tri thức lớp 11

Ôn tập CĐ1: Máy tính và xã hội tri thức lớp 11

11th Grade

61 Qs

Preparing for MTA Certification

Preparing for MTA Certification

KG - University

60 Qs

Soal kocak Aku

Soal kocak Aku

11th Grade

61 Qs

GCSE Computer Science - Computer Systems

GCSE Computer Science - Computer Systems

10th - 11th Grade

63 Qs

python concepts class 11

python concepts class 11

11th - 12th Grade

60 Qs

Data Structures P1 - Short

Data Structures P1 - Short

Assessment

Quiz

Computers

11th Grade

Practice Problem

Hard

Created by

muhammad abdulmajeed

FREE Resource

AI

Enhance your content in a minute

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

65 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which data structure follows the First-In-First-Out (FIFO) principle?

Stack

Queue

Tree

Graph

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

In a stack, which operation adds an element to the top?

push

pop

peek

enqueue

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the time complexity of accessing an element in a linked list?

O(1)

O(log n)

O(n)

O(n^2)

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

How many dimensions does a 2D array have?

1

2

3

4

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which tree traversal visits the root node last?

Preorder

Inorder

Postorder

Level order

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the maximum number of edges in a simple graph with n vertices?

n

n-1

n(n-1)/2

2^n

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Dijkstra's algorithm is used to find:

Minimum spanning tree

Shortest path

Longest path

Euler circuit

Access all questions and much more by creating a free account

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

Already have an account?