INTRODUCTION TO DATA STRUCTURES

Multiple Choice

Which of the following is NOT typically discussed when learning about data structures?

• Classification of Data Structures

• Operations on Data Structures

• Algorithm Usage

• History of Programming Languages

Open Ended

Why do you think it is important to choose the right data structure when solving a problem?

Open Ended

Why is organizing information important when trying to answer complex questions?

Open Ended

How many cities with more than 50,000 people lie within 300 miles of Tashkent?

Multiple Choice

What is the primary purpose of most computer programs according to the slides?

• To perform calculations

• To store and retrieve information

• To display graphics

• To connect to the internet

Fill in the Blanks

Fill in the blank: A

is a collection of values and set of operations that act on those values.

Multiple Choice

Which of the following best describes the difference between data structure and file structure?

• Data structure is for organizing data in main memory, while file structure is for organizing data on peripheral storage.

• Data structure is for organizing data on disk, while file structure is for organizing data in main memory.

• Both are used for organizing data in main memory.

• Both are used for organizing data on peripheral storage.

Multiple Select

Select all that are considered goals of computer program design as described in the slides.

• To design an algorithm that is easy to understand, code, and debug

• To design an algorithm that makes efficient use of the computer’s resources

• To design an algorithm that is visually appealing

• To design an algorithm that requires no resources

Multiple Choice

Which of the following is NOT a step to be performed while selecting data structures?

• Analysis of the problem to determine basic operations

• Quantify the resource constraints for each operation

• Select the data structure that best meets the requirements

• Implement the program before selecting the data structure

Multiple Choice

What are the two main categories of data structures shown in the classification diagram?

• Primitive and Non-Primitive

• Linear and Non-Linear

• Integer and Real

• Arrays and Trees

Fill in the Blanks

Fill in the blank: The operation of arranging data elements in a particular order is called

.

Open Ended

Explain why it is important for a data structure to be both rich enough to represent relationships and simple enough for effective processing.

Multiple Choice

Which of the following statements about problems and functions is correct?

• A problem is a matching between inputs and outputs.

• A function is a task to be performed.

• A problem is best thought of in terms of inputs and matching outputs.

• A function is a method or process followed to solve a problem.

Multiple Select

Select all the properties that an algorithm must have.

• Correctness

• Ambiguity

• Finite number of steps

• Termination

Multiple Choice

Which of the following is NOT a property that an algorithm must possess?

• It must be correct.

• It must be composed of a finite number of steps.

• It must be ambiguous.

• It must terminate.

Fill in the Blanks

A computer program is a representation of an

in some programming language.

Open Ended

Explain the difference between an algorithm and a program, and why it is important to distinguish between the two.

Multiple Choice

Which of the following best describes an Abstract Data Type (ADT)?

• A physical implementation of data in memory.

• A set of objects sharing the same properties and behaviors.

• A specific programming language feature.

• A type of algorithm.

Open Ended

Describe the difference between the logical form and the physical form of a data item, and give an example of each.

Multiple Choice

Which of the following statements best describes asymptotic complexity?

• It measures the exact running time of an algorithm for all input sizes.

• It describes the running time of an algorithm as a function of input size for large n, using the highest-order term.

• It only considers the smallest input size.

• It ignores the behavior of the function in the limit.

Multiple Choice

What are the main types of asymptotic notations used to describe the rate-of-growth relations between functions?

• Theta (Θ), Big-O (O), and Omega (Ω)

• Alpha (α), Beta (β), and Gamma (γ)

• Sigma (Σ), Pi (π), and Delta (Δ)

• Lambda (λ), Mu (μ), and Nu (ν)

Fill in the Blanks

O(g(n)) is the set of functions f(n) such that there exist positive constants

and n0, and for all n ≥ n0, 0 ≤ f(n) ≤ c g(n).

Multiple Choice

Which of the following functions is in O(n^2)?

• an + b

• n^3 + 2n

• 3n^3

• n^4

Open Ended

For the function n^3 + 2n, choose appropriate values for c and n0 to show that it belongs to Ω(n).

Multiple Choice

Which of the following best describes the meaning of Θ(g(n)) for a function f(n)?

• It is the set of all functions that grow slower than g(n).

• It is the set of all functions that have the same rate of growth as g(n).

• It is the set of all functions that grow faster than g(n).

• It is the set of all functions that are bounded above by g(n).

Open Ended

Given the function 10n^2 - 3n, explain how you would determine appropriate values for the constants n₀, c₁, and c₂ to show that 10n^2 - 3n = Θ(n^2).

Open Ended

After reviewing the contents of this lesson, what is one question you still have about data structures or algorithms?

Multiple Choice

Which of the following topics is NOT listed in the contents of the Data Structures lesson?

• Data Structures

• Classification of Data Structures

• Programming Languages

• Algorithm