New game
Download
Get Academic Plan
Share game
Integrate it into your platform

You can integrate the game into an LMS compatible with LTI 1.1 or LTI 1.3 such as Canvas, Moodle, or Blackboard. This way, the scores will be automatically saved into the platform’s gradebook.
Download
You have exceeded the maximum number of games you can integrate into Google Classroom with your current Plan.

To integrate as many games as you want in Google Classroom, you need an Academic Plan or a Commercial Plan.

You have exceeded the maximum number of games you can integrate into Microsoft Teams with your current Plan.

To integrate as many games as you want in Microsoft Teams, you need an Academic Plan or a Commercial Plan.

Downloading games is an exclusive feature for users with an Academic Plan or a Commercial Plan.

Get your Academic Plan or your Commercial Plan now and start integrating your games into your LMS, website or blog.

If you wish, you can download a demo game here and test its integration:

Data Structures Quiz

Quiz

Played 0

About this activity

DS Fundamentals Quiz

Created by

India

Download the paper version to play

Make your own free game from our game creator
Compete against your friends to see who gets the best score in this game

Top Games

%
Anonymous
Anonymous
%
%
%
You have exceeded the maximum number of games you can print with your current Plan.

To print as many games as you want, you need an Academic Plan or a Commercial Plan.

Print your game
Data Structures Quiz
 

Data Structures QuizOnline version

DS Fundamentals Quiz

by Dr. G Kalyani, Associate Professor, Dept of IT
1

Which data structure is LIFO (last in, first out)?

2

Which operation adds an element to the end of a queue?

3

In a singly linked list, what pointer connects a node to the next node?

4

In a binary search tree, how are keys arranged relative to the root?

5

What is the average time complexity to search in a balanced BST?

6

What is a collision in a hash table?

7

Which data structure provides FIFO behavior?

8

Which data structure allows constant-time random access by index?

9

What operation adds a node at the beginning of a linked list?

10

Which traversal of a BST yields keys in sorted order?

Feedback

Stacks follow LIFO: the last item pushed is the first popped.

Enqueue adds to the rear; dequeue removes from the front.

Each node typically has a next pointer to the following node.

BSTs place lesser keys to the left and greater keys to the right of a node.

Balanced BSTs allow logarithmic search time on average.

Collisions occur when different keys map to the same bucket.

Queues process elements in the order they were added (first in, first out).

Arrays support direct indexing for O(1) access.

Prepending places a new node before the current head.

In-order traversal of a BST visits nodes in ascending key order.

Are you sure you want to leave the page?

If you leave, you will lose the game in progress.