CSS100 - CHAPTER 1

Theoretical Computer Science

The study of logical and mathematical properties of problems and their solutions.

Norman Gibbs and Allen Tucker

According to their definition, the central concept in computer science is the algorithm

1) Their formal and mathematical operations
2) Their hardware realizations

3) Their linguistic realizations

4) Their applications

The design process of an algorithm includes the following operations:

Algorithm

A procedure for solving a mathematical problem in a finite number of steps that frequently involves repetition of an operation.

Algorithm

Informally, an _______ is an ordered sequence of instructions that is guaranteed to solve a specific problem.

1) Sequential

2) Conditional

3) Iterative

The three categories of operations used to construct algorithms:

Sequential Operations

It carries out a single well-defined task. When that task is finished, the algorithm moves on to the next operation.

Sequential Operations

Are usually expressed as simple
declarative sentences

Conditional Operations

These are the “question-asking” instructions of an algorithm.

Iterative Operations

These are the “looping” instructions of an algorithm.

Iterative Operations

They tell us not to go on to the next instruction but, instead, to go back and repeat the execution of a previous block of instructions

Computing agent

In computer science terminology, the machine, robot, person, or thing carrying out the steps of the algorithm is called a ____

Computer Science

The science of algorithmic problem solving.

Algorithm

A well-ordered collection of unambiguous and effectively computable operations that produces a result and halts in a finite amount of time.