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 Structure

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 Structure

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 Structure

Take Quiz