DSA Quiz-1

What’s the first word that comes to your mind when you hear “Data Structures and Algorithm”?

What do you value more when solving a problem?

• A quick solution (even if messy)

• A clean and efficient solution

• One that I can explain to a friend

• One that I found myself

What is the primary goal of a data structure?

• • To make data look good

• • To store and access data efficiently

• • To hide complexity from users

• • To write shorter code

Which operation is the most expensive in a basic array?

• Traversal

• • Insertion at end

• • Insertion at beginning

• • Accessing an element

Explain in your own words how you would explain an “Array” to a 10-year-old.

I am working with a list of student names. I want to find a name quickly. Currently, the names are not sorted.
Question: Which search algorithm will give worst-case performance here?

• Linear Search

• • Binary Search

• • None of them

• Both of them

What would be the best use case for using an array over other structures?

• • When data size changes frequently

• • When fast insertions are needed

• • When fixed-size, indexed access is needed

• • When you want to avoid memory waste

What is the time complexity of accessing an element in an array?

• • O(n)

• • O(log n)

• • O(1)

• • O(n log n)

If a loop runs n times, and inside it, another loop runs n times, what is the total time

• • O(n)

• • O(log n)

• • O(n log n)

• • O(n²)

Big-O notation gives us:

• • Exact time

• • Worst-case growth

• • Best-case runtime

• • Compilation time