# Data Structures And Algorithms Quiz

16 Questions | Total Attempts: 12021  Settings  We present to you a super fun and informational data structures and algorithms quiz! Attempt them carefully. The questions are set from the topics such as arrays, records, pointers, linked lists, stacks, queues, recursion, trees, sorting, and searching. Let's see how well versed are you with the various concepts of data structures & algorithms. For a better conceptual understanding and to expand your knowledge, this quiz is very useful. Let's go for it. Best of luck to you!

• 1.
The Average case occurs in the linear search algorithm.
• A.

When Item is somewhere in the middle of the array

• B.

When Item is not in the array at all

• C.

When Item is the last element in the array

• D.

When Item is the last element in the array or is not there at all

• 2.
The complexity of the linear search algorithm is
• A.

O(n)

• B.

O(log n)

• C.

O(n2)

• D.

O(n log n)

• 3.
The complexity of the Binary search algorithm is
• A.

O(n)

• B.

O(log )

• C.

O(n2)

• D.

O(n log n)

• 4.
The complexity of the Bubble sort algorithm is
• A.

O(n)

• B.

O(log n)

• C.

O(n2)

• D.

O(n log n)

• 5.
The complexity of the merge sort algorithm is
• A.

O(n)

• B.

O(log n)

• C.

O(n2)

• D.

O(n log n)

• 6.
Arrays are the best data structures
• A.

For relatively permanent collections of data

• B.

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

• C.

For both of the above situation

• D.

For none of the above situation

• 7.
Linked lists are the best suited
• A.

For relatively permanent collections of data

• B.

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

• C.

For both of the above situation

• D.

For none of the above situation

• 8.
How can you measure the efficiency of an the algorithm?
• A.

Processor and memory

• B.

Complexity and capacity

• C.

Time and space

• D.

Data and space

• 9.
How can we measure the time factor when determining the efficiency of the algorithm?
• A.

Counting microseconds

• B.

Counting the number of key operations

• C.

Counting the number of statements

• D.

Counting the kilobytes of algorithm

• 10.
The complexity theory does not contain the following case, which is?
• A.

Best case

• B.

Worst case

• C.

Average case

• D.

Null case

• 11.
When an indirect change of the values of a variable in one module by another module happens, it's called what?
• A.

Internal change

• B.

Inter-module change

• C.

Side effect

• D.

Side-module update

• 12.
Can you guess which of the following data structure is NOT a linear data structure?
• A.

Arrays

• B.

• C.

Both of above

• D.

None of above

• 13.
Can you guess which of the following data structure is linear data structure?
• A.

Trees

• B.

Graphs

• C.

Arrays

• D.

None of above

• 14.
Which function findings the location of the element with a given value is:
• A.

Traversal

• B.

Search

• C.

Sort

• D.

None of above

• 15.
Each array declaration does not give, implicitly or explicitly, the information about which of the following?
• A.

The name of the array

• B.

The exact data type of array

• C.

The first data from the set that will be stored

• D.

Index set

• 16.
Why are the elements of an array are stored successively memory cells?
• A.

In this way, the computer can keep track only the address of the first element, and the addresses of other elements can be calculated

• B.

The architecture of computer memory does not allow arrays to store other than serially

• C.

Both of above

• D.

None of above

Related Topics Back to top