Algorithms and Data Structure Quiz

Which of the following best defines an algorithm?

• A set of random steps to solve a problem

• A step-by-step procedure to solve a problem in finite time

• A program written in any programming language

• A mathematical formula without execution steps

Which is not a characteristic of a good algorithm?

• Finiteness

• Ambiguity

• Input

• Output

In algorithm analysis, time complexity refers to:

• The amount of memory used

• The number of steps executed with respect to input size

• The type of programming language used

• The size of the output generated

Which of the following best defines a data structure?

• A step-by-step problem-solving procedure

• A way to organize, manage, and store data efficiently

• An algorithm that sorts numbers

• A programming language feature only for arrays

Primitive data structures are:

• User-defined structures like trees and graphs

• Basic data types such as int, float, char, boolean

• Data stored in files and databases

• Structures derived from classes and objects

Which of the following is a non-primitive data structure?

• Integer

• Float

• Linked List

• Boolean

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

• Array

• Linked List

• Stack implemented with linked list

• Binary tree

A data structure whose memory size can change during execution is called:

• Static

• Dynamic

• Sequential

• Primitive

Which of the following is a non-linear data structure?

• Stack

• Queue

• Array

• Graph

In a linear data structure, elements are arranged:

• In hierarchical order

• In random order

• Sequentially one after another

• In a circular manner only