DSAquiz1FinL5

What is a data structure in computer science?

• A way of organizing and managing data.

• A programming language.

• A method of retrieving data only.

• None of the above.

Which of the following is a linear data structure?

• Tree

• Graph

• Array

• Heap

In which data structure are elements stored in a contiguous memory location?

• Stack

• Array

• Queue

• Graph

What operation in an array involves processing each element sequentially?

• Insertion

• Deletion

• Traversal

• Sorting

Which data structure is suitable for hierarchical data organization?

• Stack

• Array

• Tree

• Queue

Which of these statements about arrays is true?

• Arrays are dynamically sized in all programming languages.

• Arrays are always one-dimensional.

• Arrays require contiguous memory allocation.

• Arrays do not use indices.

What is the time complexity of a search in an unsorted array?

• O(1)

• O(N)

• O(log N)

• O(N^2)

When we say an array is 'finite,' we mean:

• It can only store one type of data.

• It has a fixed size defined at creation.

• It can grow as needed.

• It stores data in non-contiguous memory.

Which operation involves combining elements from two arrays into a new one?

• Traversal

• Merging

• Insertion

• Sorting

If an array is sorted, what is the time complexity for binary search?

• O(N)

• O(log N)

• O(N log N)

• O(1)