Asymptotic Complexity Quiz

Question 1

What is the main difference between asymptotic complexity and practical efficiency?

Accepted Answer

Asymptotic complexity is theoretical, practical efficiency is real-world

Answer

Both are exactly the same

Answer

Practical efficiency only relates to memory

Answer

Asymptotic complexity is for small inputs

Question 2

If an algorithm has O(n) asymptotic complexity but is practically slow, what could be the reason?

Accepted Answer

Hidden constants and memory overhead

Answer

O(n) complexity should always be fast

Answer

Practical efficiency is unrelated to asymptotic complexity

Answer

There is an error in algorithm notation

Question 3

For what type of problems is asymptotic analysis most useful?

Accepted Answer

Problems with very large input sizes

Answer

Problems with fixed input size

Answer

Only for sorting algorithms

Answer

Only for small problems

Question 4

When can an O(n²) algorithm outperform an O(n log n) algorithm?

Accepted Answer

Lower constants and better cache locality

Answer

Only for large inputs

Answer

When input has negative numbers

Answer

Never, O(n log n) is always better

Question 5

Which factor is often overlooked but crucial when measuring practical efficiency?

Accepted Answer

Hardware characteristics and cache efficiency

Answer

Just the algorithm name

Answer

Programming language version

Answer

Developer's age

Question 6

What is the difference between asymptotic complexity and practical efficiency when input size is very small?

Accepted Answer

Constants become more significant in small inputs

Answer

Asymptotic complexity matters more for small inputs

Answer

Practical efficiency is undefined for small inputs

Answer

No difference exists

Question 7

If two algorithms have the same asymptotic complexity, which one will be faster?

Accepted Answer

Depends on constants and cache efficiency

Answer

Second algorithm is always faster

Answer

Both always run at same speed

Answer

First algorithm is always faster

Question 8

Why might an O(1) algorithm not always be faster than an O(n) algorithm in practice?

Accepted Answer

Can have very large hidden constants

Answer

Practical efficiency doesn't matter

Answer

Asymptotic complexity is wrong

Answer

O(1) is always fastest

Question 9

When can asymptotic analysis be unreliable?

Accepted Answer

For small/moderate input sizes or large constants

Answer

Only for O(n²) algorithms

Answer

Never unreliable

Answer

When programmer is inexperienced

Question 10

What does practical efficiency testing provide that asymptotic analysis cannot?

Accepted Answer

Real-time and memory usage data

Answer

Mathematical proofs

Answer

No additional information

Answer

Just the algorithm name

असिम्प्टोटिक जटिलता

पिछले स्कोर

क्विज़ आँकड़े

संबंधित क्विज़

नए क्विज़