Data Structures & Other Objects Using C++ - Chapter 1

Front 1

Organized collection of data

Back 1

Data Structures

Front 2

The Phases of Software Development (do not have to be exact, order does not matter)

Back 2

* Specification of the task
* Design of a solution
* Implementation (coding) of the solution
* Analysis of the solution
* Testing and debugging
* Maintenance and evolution of the system
* Obsolescence

Front 3

Software development does not depend on any particular _____ ?

Back 3

programing language

Front 4

This person designed the C++ language

Back 4

Bjarne Stroustrup

Front 5

A technique that encourages important strategies of information hiding and component reuse

Back 5

object-oriented programming (OOP)

Front 6

What are the two benefits when you design your own data structures that is compliant with the Standard Library? ( 2 Answers)

Back 6

* Other Programmers will understand your work more easily.

* Your own work will readily benefit from other pieces of the Standard Library

Front 7

Define Specification

Back 7

A precise description of the problem

Front 8

What is the design phase?

Back 8

Creating the steps to solve the problem

Front 9

Implementation?

Back 9

The actual C++ code that carries out of design.

Front 10

What do you need for a good specification?

Back 10

Needs to be precise, leaving no doubt about what the program must accomplish.

Front 11

A set of instructions for solving a problem.

Back 11

An Algorithm

Front 12

This mixture of English and a programming language is called?

Back 12

Pseudocode

Front 13

The reason for pseudocode is to improve?

Back 13

clarity

Front 14

A good technique for designing an algorithm

Back 14

Break down the problem into smaller and smaller subtasks until the code to write it becomes trivial.

Front 15

What are the aspects of a good decomposition? (3 answers)

Back 15

* The subtasks should help produce short pseudocode

* Code reuse

* Easily make maintenance updates

Front 16

The functions that you write need to be ?

Back 16

genuinely separated from one another.

Front 17

Know only a much as you need, but not more

Back 17

Information hiding

Front 18

Specify your function's behavior by using what ?

Back 18

preconditions and post conditions

Front 19

True or False
When you are using a function you only need to think about what the function does, you don't need to think about how the function doe its work.

Back 19

True

Front 20

When we pretend that we do not know how a function is implemented we are using a form of ? called?

Back 20

information hiding called procedural abstraction

Front 21

A statement giving the condition that is required to be true when a function is called. The function is not guaranteed to perform as it should unless this is true.

Back 21

A precondition

Front 22

a statement describing what will be true when a function call is completed. if the function is correct and the precondition was true when the function was called, then the function will complete, and this will be true when the call is completed.

Back 22

A postcondition

Front 23

Stating the pre and post conditions should be the last step in designing any function.

Back 23

False, it should be the first step

Front 24

This consists of the function's return type, name, and parameter list, all following a semicolon.

Is there anything else that should be added ?

Back 24

A prototype

Include the pre and post conditions

Front 25

The precondition/postcondition forms a contract between?

Back 25

the programmer who writes the function and the programmer who uses the function.

Front 26

There is one difference between using old header file names (such as iostream.h) and the new names (iostream)

Back 26

The new header files are part of a feature called the standard namespaces, also called std.

Front 27

The statement used for the standard namespace

Back 27

using namespace std;

Front 28

its value will never be changed while the program is running

Back 28

A declared constant

Front 29

(True or False)
Once a constant has been declared, it can be used throughout the program

Back 29

True

Front 30

This indicates that the program is not allowed to change the variables value

Back 30

use the keyword 'const' in front of a variable

Front 31

Who is responsible for ensuring that the precondition is valid?

Back 31

The programmer who uses the function

Front 32

The first action of a function

Back 32

Check that the precondition is valid

Front 33

The assert facility is a good approach to?

Back 33

detecting Invalid data at an early point

Front 34

The assert facility uses what include directive?

Back 34

#include <cassert>

Front 35

Explain the assert function

Back 35

Use the assert function to check if an expression is true or false, if its true its valid, if its false halt the program, and display error message

Front 36

Give an example of the assert function in use

Back 36

assert( c >= MINIMUM_CELSIUS);

Front 37

Assertions can be turned off by placing this statement immediately before the programs include directives

Back 37

#define NDEBUG

Front 38

Where is the EXIT_SUCCESS constant defined in?

Back 38

csdtdlib

Front 39

What is commonly used for run time errors?

Back 39

Exception handling

Front 40

What are two considerations for selecting good sub tasks?

Back 40

A) The potential for code reuse

B) The possibility of future changes to the program

Front 41

What are the elements of a C++ prototype?

Back 41

A function prototype consists of the return type, name, and parameter list, which are all followed by a semi-colon.

Front 42

An assert statement that checks whether the month variable in the function date_check is a valid integer

Back 42

assert(month > 0 && month <= 12);

Front 43

The include directive that must appear before using the sqrt function

Back 43

#include <cmath>

Front 44

Why is it a good idea to stop a program a the earliest point when invalid data is detected?

Back 44

Stopping early with an error message makes debugging easier

Front 45

Time analysis

Back 45

The reasoning about an algorithm's speed

Front 46

Instead of measuring the actual elapsed time during each method

Back 46

count certain operations that occur while carrying out the methods.

Front 47

We do not usually measure the actual time taken to run the program because...

Back 47

the number of seconds can depend on too many extraneous factors (such as speed of processor and if the processor is busy)

Front 48

(true or false)

The speed of the processor is more important than the order of an algorithm

Back 48

False, the order of an algorithm is more important

Front 49

Linear Pattern

Back 49

A loop that does a fixed amount of operations n times requires O(n) time.

Front 50

Worst-Case analysis

Back 50

Counting the maximum number of operations

Front 51

Average-case analysis

Back 51

Determines the average number of operations required for a given n.

Front 52

Best-case analysis

Back 52

determines the fewest number of operations required for given n.

Front 53

Program testing

Back 53

When you run a program and observe its behavior

Front 54

Properties of Good Test Data

(2 answers)

Back 54

1) You must know what output a correct program should produce for each test input

2) The test inputs should include those inputs that are most likely to cause errors

Front 55

Boundary value

Explain and give an example

Back 55

an input that is one step away from a different kind of behavior

int time_check(int hour);
// precondition: hour lies in range (0 <= hour <= 23)

Front 56

Fully exercising code

(2 rules/answers)

Back 56

1) Make sure that each line of your code is executed atleast once by some test data.

2) Test all conditions in your loop, like tests that skip certain procedures

Front 57

What is a profiler?

Back 57

A software tool that will generate a list indicating how often each statement of your program was executed.

Front 58

Best practice for debugging

Back 58

Limit code changes, find the exact culprit of the problem and fix the error, then rerun all the tests.