Quiz 1: Introduction to Data Structures and Algorithms

What is an algorithm fundamentally defined as?

• A type of programming language.

• A graphical user interface.

• A set of well-defined steps to solve a problem.

• A database management system.

Which concept deals with data representation concepts, uses of data, and different types of data organization?

• Algorithm Analysis

• Data Structure

• Programming Language

• Software Engineering

Big-O Notation is used to quantify an algorithm's:

• Debugging time.

• Time and Space Complexity.

• Development cost.

• User interface quality.

An algorithm that involves repeating a set of instructions using loops is known as:

• Recursion

• Iteration

• Greedy Method

• Dynamic Programming

What is a primary characteristic of a recursive algorithm?

• It uses only loops.

• It calls itself repeatedly until a base condition is met.

• It makes locally optimal choices.

• It always runs in constant time.

Which tool is a graphical representation of an algorithm or process, using standardized symbols?

• Pseudocode

• DFD

• Flowchart

• Code editor

What is 'Space Complexity'?

• The time an algorithm takes to run.

• The amount of memory an algorithm requires.

• The size of the input data.

• The number of steps in an algorithm.

Which algorithm design strategy makes locally optimal choices at each step in the hope of finding a global optimum?

• Iteration

• Recursion

• Greedy Method

• Divide and Conquer

Pseudocode is best described as:

• Actual executable code.

• An informal high-level description of an algorithm.

• A database query language.

• A binary representation of data.

What does DFD stand for, and what is its primary use?

• Data File Diagram; for storing files.

• Design Flowchart Diagram; for sequential steps.

• Data Flow Diagram; illustrates the flow of information.

• Dynamic Function Definition; for flexible functions.