Free Online Flashcard Deck

12 Integrated Programming Projects Free Online FlashCards

Study 12 Integrated Programming Projects with 12 free online flashcards. Review key terms, definitions, and concepts with this interactive flashcard deck.

12 cards
01
Front

What should you identify before writing an integrated program?

Back

Start by identifying the program’s inputs, outputs, rules, data, operations, and constraints before writing code.

02
Front

What is decomposition in programming?

Back

Decomposition divides a large problem into smaller responsibilities that are easier to describe, test, and reuse.

03
Front

How should a data structure match a programming need?

Back

Use a list for an ordered collection, a dictionary for key-value information, a set for unique values, and an object for related state and behavior.

04
Front

What is an algorithm?

Back

An algorithm is a finite, ordered procedure that specifies what happens, in what order, and under which conditions.

05
Front

How does an `if`/`elif` chain choose a branch?

Back

A conditional selects among alternatives; once a true branch is found in an `if`/`elif` chain, later branches are skipped.

06
Front

When should you use `for` versus `while`?

Back

A `for` loop is appropriate for processing each item in a collection, while a `while` loop repeats until its condition becomes false.

07
Front

What does abstraction accomplish?

Back

Abstraction exposes important operations while hiding implementation details. A clear contract specifies inputs, outputs, and error conditions.

08
Front

What is the difference between a class and an object?

Back

A class defines the structure and behavior of a kind of object; an object is an instance created from that class.

09
Front

When is inheritance appropriate?

Back

Use inheritance for a genuine “is-a” relationship when a specialized class follows the base class’s general interface.

10
Front

How should a program handle invalid input?

Back

Validate expected input at the system boundary, and use exceptions when an operation cannot produce a valid result.

11
Front

What do boundary tests examine?

Back

Boundary tests check values at and around important limits, such as scores of 90, 89.99, 60, and 59.99.

12
Front

What is the time complexity of `best_student()`?

Back

The `best_student()` method runs in linear time, written as O(n)O(n), because it examines each student once.