Data Structures and Algorithms using C Quiz

What is a data structure?

• A storage format for data

• A collection of data values

• A way to organize, store, and manipulate data

• A programming language

What is a static data structure?

• A data structure with fixed memory allocation

• A data structure that can resize dynamically

• A data structure that uses pointers

• A data structure stored in a file

Which of the following is an example of a static data structure?

• Linked List

• Binary Tree

• Array

• Graph

What is the main disadvantage of static data structures?

• They are slow to access

• They require dynamic memory allocation

• They cannot grow or shrink during execution

• They can only store numerical data

Which memory management function is used in dynamic data structures in C?

• malloc()

• calloc()

• realloc()

• All of the above

How is an array stored in memory?

• Random locations

• Contiguous memory locations

• Separate memory blocks

• Linked memory blocks

What is the advantage of arrays?

• Fixed size allocation

• Faster access using index

• Efficient memory utilization

• None of the above

How is a sparse matrix different from a normal matrix?

• It has more zero values than nonzero values

• It takes more memory space

• It has only one row

• It cannot be stored in memory

What does Big-O notation describe?

• Best-case complexity

• Worst-case complexity

• Average-case complexity

• Asymptotic upper bound

If an algorithm runs in O(n²) time, what does it mean?

• The running time increases linearly with input size

• The running time increases quadratically with input size

• The running time is constant

• The running time is logarithmic