Top Data Structure Quizzes & Trivia

How does your computer access data stored in an array? Does your filing cabinet store your personal information in a hierarchical database, or a relational one? Could you explain what a hash table is to a friend without leaving him scratching his head by the time you were through?

Data structures describe the ways that a computer can pack away information for storage, from the details your doctor has entered into your health record, to the essay you saved on your hard drive; from the saved games on your video game console, to the music on your MP3 player. Want to know more about the magic that these machines work every time you click “Save As”? Take our data structure quiz to find out more!

Data Structure Questions and Answers

In linked lists there are no NULL links in

Single linked list

Linear doubly linked list

Circular linked list

None of these

Data structure question from

Gate Data Structure Online Test

Take Quiz
In a stack the command to access nth element from the top of the stack S will be

S [Top-n]

S [Top+n]

S [Top-n-1]

None of the above

Data structure question from

Gate Data Structure Online Test

Take Quiz
If yyy, xxx and zzz are the elements of a lexically ordered binary tree, then in preorder traversal which node will be traverse first

xxx

yyy

zzz

Can not be determined

Data structure question from

Gate Data Structure Online Test

Take Quiz
What are the correct intermediate steps of the following data set when it is being sorted with the Insertion sort? 15,20,10,18

15,20,10,18 -- 10,15,20,18 -- 10,15,18,20 -- 10,15,18,20

15,18,10,20 -- 10,18,15,20 -- 10,15,18,20 -- 10,15,18,20

15,10,20,18 -- 15,10,18,20 -- 10,15,18,20

10, 20,15,18 -- 10,15,20,18 -- 10,15,18,20

Data structure question from

Insertion Sort Quiz

Take Quiz
Consider the following lists of partially sorted numbers. The double bars represent the sort marker. How many comparisons and swaps are needed to sort the next number. [1 3 4 8 9 || 5 2]

2 comparisons, 3 swaps

3 comparisons, 2 swaps

4 comparisons, 3 swaps

3 comparisons, 4 swaps

Data structure question from

Insertion Sort Quiz

Take Quiz
Consider the following lists of partially sorted numbers. The double bars represent the sort marker. How many comparisons and swaps are needed to sort the next number. [1 3 4 5 8 9 || 2]

5 comparisons, 4 swaps

4 comparisons, 5 swaps

6 comparisons, 5 swaps

5 comparisons, 6 swaps

Data structure question from

Insertion Sort Quiz

Take Quiz
An Array is what kind of data structure

Linear

Non- Linear

Complex

All the above

None

Data structure question from

Data Structures

Take Quiz
While inserting an item in an array of integers which loop is right, where pos is the pos at which insertion is to be made(assume array starts from 1 and N is the max no. of items in the array.)

for(i=pos;i>=1;i--) { A[i] = A[i+1]; }

for(i=pos ; i

for(i=N; i>=pos;i--) { A[i] = A[i+1]; }

for(i=N; i>=pos;i--) { A[i+1] = A[i] }

for(i=N; i

Data structure question from

Data Structures

Take Quiz
To delete an item from an array which loop is correct, where p is the position of deletion( assume array starts from 1 and N is the max no. of items in the array.)

for(i=N;i>=pos;i--) { a[i] = a[i+1]; }

for(i=pos;i

for(i=pos;i

for(i=pos-1;i

None

Data structure question from

Data Structures

Take Quiz
Linked lists are best suited

for relatively permanent collections of data

for the size of the structure and the data in the structure are constantly changing

for both of above situation

for none of above situation

Data structure question from

Data Structures Algorithms Online Quiz

Take Quiz
The complexity of merge sort algorithm is

. O(n)

O(log n)

O(n2)

O(n log n)

Data structure question from

Data Structures Algorithms Online Quiz

Take Quiz
Which of the following data structure is not linear data structure?

Arrays

Linked lists

Both of above

None of above

Data structure question from

Data Structures Algorithms Online Quiz

Take Quiz

‹ ›

All Time Popular

Data Structures Algorithms Online Quiz

Questions: 41 | Attempts: 228

Sample Question
Linked lists are best suited

For relatively permanent collections of data

For the size of the structure and the data in the structure are constantly changing

For both of above situation

For none of above situation

Searching And Sorting Algorithms

Questions: 13 | Attempts: 201

Sample Question
Searching and sorting algorithms are best implemented with which data structure?

An array based list

A linked list

Both above

Data Structure

Following are the multiple choice questions (MCQs) or objective questions from Data Structures and Algorithms. The questions are set from the topics such as arrays, records, pointers, linked lists, stacks, queues, recursion,...

Questions: 20 | Attempts: 156

Sample Question
Two main measures for the efficiency of an algorithm are

Processor and memory

Complexity and capacity

Time and space

Data and space

It's All About The Concept Of Data Structure.

Questions: 20 | Attempts: 124

Sample Question
Data is nothing but

Collection of node

Collection of information

Set of value

Set of node

Data Structure

Questions: 10 | Attempts: 108

Sample Question
A linear collection of data elements where the linear node is given by means of pointer is

Linked list

Node list

Primitive list

None of these

Data Structure And Algorithm

Questions: 20 | Attempts: 89

Sample Question
The _____________ algorithm works by repeatedly scanning through the list, comparing adjacent elements, and swapping them if they are in the wrong order.

Bubble sort

Insertion Sort

Merge Sort

Selection sort

Data Structure & Algorithyms

Lets Check Yourself......

Questions: 15 | Attempts: 65

Sample Question
The situation when in a linked list START=NULL is

Underflow

Overflow

Housefull

saturated

Fundamentals Final (ch 1-7)

Questions: 60 | Attempts: 47

Sample Question
Objects are created from

Methods

Classes

Parameters

Commands

Breevol3secfo

Questions: 75 | Attempts: 42

Sample Question
Range cards are a record of

Range data

Firing data

Call signs

Training

15it32c - Data Structures And Algorithms - Multiple Choice Test

Questions: 26 | Attempts: 40

Sample Question
Which of the following data structure is not linear data structure?

Arrays

Linked lists

Both of above

None of above

Uses Of Shell Sort In Data Structure

In the computing world, there is a wide load of data from which we get what we want. Shell sorting in data structure as a result becomes essential and in the quiz below we look at its uses.

Questions: 5 | Attempts: 40

Sample Question
What are the correct intermediate steps of the following data set when it is being sorted with the Shell sort? 15,20,10,18

15,10,20,18 -- 15,10,18,20 -- 10,15,18,20

15,20,10,18 -- 15,10,20,18 -- 10,15,20,18

10, 20,15,18 -- 10,15,20,18 -- 10,15,18,20

15,18,10,20 -- 10,18,15,20 -- 10,15,18,20

Breevol1secfo

Questions: 100 | Attempts: 38

Sample Question
As a result of the reorganization of the War Department in 1943, which office was established?

Military Aviation Companies

Air Provost Marshal

Military Police Guard Companies

Air Police Companies

Advance Data Structure Quiz-a-2

Advance Data Structure Quiz-1

Questions: 15 | Attempts: 33

Sample Question
Which of the following trees have height as O(lgn) where number of nodes is n.

R-B Tree

Binary Search Tree

Binary Tree

2-3 Tree

Data Structure - Midterm Exam

Questions: 20 | Attempts: 32

Advance Data Structure Quiz-1

Questions: 15 | Attempts: 28

Sample Question
Which of the following trees have height as O(lgn) where number of nodes is n.

R-B Tree

Binary Search Tree

Binary Tree

2-3 Tree

Advance Data Structure Quiz-c-1

Advance Data Structure Quiz-1

Questions: 15 | Attempts: 27

Sample Question
Which of the following trees have height as O(lgn) where number of nodes is n.

R-B Tree

Binary Search Tree

Binary Tree

2-3 Tree

Advance Data Structure Quiz-c-2

Advance Data Structure Quiz-1

Questions: 15 | Attempts: 26

Sample Question
Which of the following trees have height as O(lgn) where number of nodes is n.

R-B Tree

Binary Search Tree

Binary Tree

2-3 Tree

Advance Data Structure Quiz-b-2

Advance Data Structure Quiz-1

Questions: 15 | Attempts: 26

Sample Question
Which of the following trees have height as O(lgn) where number of nodes is n.

R-B Tree

Binary Search Tree

Binary Tree

2-3 Tree

Advance Data Structure Quiz-b-1

Advance Data Structure Quiz-1

Questions: 15 | Attempts: 24

Sample Question
Which of the following trees have height as O(lgn) where number of nodes is n.

R-B Tree

Binary Search Tree

Binary Tree

2-3 Tree

Data Structures Final Review

Questions: 81 | Attempts: 22

Sample Question
Stack is an Abstract Class

True

False

Data Recovery Quiz

Simple quiz about data recovery

Questions: 3 | Attempts: 18

Sample Question
What happens when you delete a file on your PC?

It is deleted permanently from the PC.

It is moved to the Recycle Bin.

It does not get deleted

Data Structure Online Test

Total Questions-> 30Full Time-> 10 minutesNegative marking->0.15 for each question if answered wrongTotal Marks-> 30 (1 for each question)Before starting the test please fill out the form...

Questions: 164 | Attempts: 16

Sample Question
For a binary search algorithm to work, it is necessary that the array (list) must be

Unsorted

Sorted

In a heap

Popped out of stack

Test_3(27-8-2014)

Oops,String & Collection

Questions: 20 | Attempts: 6

Sample Question
Select Correct options in given below

Collection list = new ArrayList();

ArrayList list = new ArrayList();

ArrayList list = new ArrayList();

A,B & C

Top Data Structure Quizzes & Trivia

Related Topics

Data Structure Questions and Answers