Data Structures Quiz

Data structures are primarily used for:

• Increasing execution time

• Organizing and managing data efficiently

• Reducing program readability

• Replacing algorithms

Which of these is a linear data structure?

• Tree

• Graph

• Stack

• Hash table

An abstract data type (ADT) defines:

• Only data representation

• Data and allowed operations

• Only algorithm flow

• Memory allocation rules

Big-O notation represents:

• Exact execution time

• Lower bound

• Worst-case time complexity

• Average-case performance

Which is a static data structure?

• Array

• Linked list

• Stack (linked)

• Queue (linked)

Time complexity for accessing an element in an array using an index is:

• O(1)

• O(n)

• O(log n)

• O(n²)

Which asymptotic notation describes best-case performance?

• Big O

• Big Theta

• Big Omega

• Little o

The main drawback of linear queues is:

• Complex implementation

• Memory wastage due to front deletions

• Cannot store integers

• No traversal possible

What is the principle of stack?

• FIFO

• LIFO

• FILO

• Both b and c

Which is not an application of stack?

• Recursion

• Infix to postfix conversion

• Balanced parenthesis checking

• Job scheduling in printers