# QuizMagic

Now available on:
Last hour Sandhiya Velayudham 122 points
24 hours Sandhiya Velayudham 122 points
24 * 7

Recently Played
Ramayana
By Anonymous   1 days ago
IPL quiz
By Anonymous   4 days ago
Simple IQ Quiz 5
By Anonymous   7 days ago
New Quizzes  Show All
Top Played  Show All
Tags

• ## QuizMagic Contest

• All Quizzes
Create you own quizzes

## Data Structures

Created by Quizmagic Team on Jan 09, 2013 07:17 PM.
`A basic quiz that will test your knowledge of data structures. It randomly picks questions related to indexed structures, or linked list or array or about algorithms.`
Top 5 Scores
 98 00:35 91 00:15 91 00:31 91 01:18 90 00:22
 Questions 10 Minutes 5 High Score 98 00:35 Quiz Played 5905 times
Last played on Mar 23, 2023View comments
Congratulation!

You are in top 5 scorers.
 0 0 0 0 N/A
Answering this correctly will make the indicated neighbouring questions be automatically treated as having been answered correctly.
Answering this incorrectly will make the indicated neighbouring questions be automatically treated as having been answered incorrectly.
Answering this correctly will earn you some extra points.
Answering this incorrectly will cause you to lose some points.
Answering this correctly will increase the total time available to you.
Answering this incorrectly will reduce the total time available to you.
Rate this quiz

Copy this HTML code and paste in your website code to run this quiz on your site.

Size:
Size:

### Sample Questions

Question 1
The Average case occur in linear search algorithm
 When Item is not in the array at all When Item is somewhere in the middle of the array When Item is the last element in the array When Item is the last element in the array or is not there at all
Question 2
The Worst case occur in linear search algorithm when
 Item is not in the array at all Item is the last element in the array or is not there at all Item is somewhere in the middle of the array Item is the last element in the array
Question 3
Which of the following case does not exist in complexity theory
 Average case Null case Best case Worst case
Question 4
The space factor when determining the efficiency of algorithm is measured by
 Counting the minimum memory needed by the algorithm Counting the maximum memory needed by the algorithm Counting the average memory needed by the algorithm Counting the maximum disk space needed by the algorithm
Question 5
The time factor when determining the efficiency of algorithm is measured by
 Counting the number of statements Counting the number of key operations Counting microseconds Counting the kilobytes of algorithm