PDS - 04225 Intro to Data Structures and Algorithms - Chapter 2

A Data Structure is:

• A C++ vector

• A way of organizing, storing and performing operations on data.

• A function in any programming language

• A sequence of steps to solve a problem.

Which one is not a data structure?.

• Graph

• Index

• Binary Tree

• Record

Which C++ Abstract Data Type is similar to a record?.

• Graph

• Function

• Struct

• Enum

An Algorithm is:

• The process to transform the design into code.

• Braking a large problem into smaller ones

• A list of steps needed to solve a problem

• None of the above.

Is the Data Structure used irrelevant for the creation of a program?.

• Yes

• No

A list is:

• An ADT for storing items in which the order does not matter and duplicate items are allowed.

• An ADT for a collection of distinct items

• An ADT in which items are only inserted on or removed from the top of the stack.

• An ADT for holding ordered data

Computational Complexity is:

• The amount of resources used by the algorithm.

• The amount of time taken by an algorithm.

• The amount of electricity used by an algorithm.

• The amount of bytes included in the algorithm.

The efficiency of an algorithm is measured by:

• The run-time of the program.

• The length of the algorithm.

• The computational complexity of the algorithm.

• The speed of the CPU

Abstraction means:

• Is an art type.

• An object that is hidden from the end user.

• A data type that only can be accessed by the developer.

• To have a user interact with an item at a high-level, with lower-level internal details hidden from the user.

Does Abstracts Data Types support the programmer's efficiency?.

• Yes

• No