Ite 1 Reviewer

ITE 1 REVIEWER
What is Computing?
-is the ultimate mental amplifier
-can mechanize any intellectual activity we can imagine.
Two reasons why everyone should study computing:

1. Most exciting and important technologies, arts, and sciences of today and tomorrow are driven by
computing.
2. Understanding computing illuminates deep insights and questions into the nature of our minds.
Computer is a machine that can:

1. Accept input. Input could be entered by a human typing at a keyboard.
2. Execute a mechanical procedure where each step can be executed without any thought.
3. Output could be data displayed to a human that effects the world outside the computer such as
electrical signals that control how a device operates.
1.1 Processes, Procedures, and Computer
Computer science- study of information processes.
Procedure- description of a process.
Mechanical procedure- procedure that can be followed without any thought.
Algorithm- mechanical procedure that is guaranteed to eventually finish.
1.2 Measuring Computing Power
Two properties that measure the power of a computing machine are:

1. How much information it can process?
2. How fast can it process?
Bit -primary unit of information.

-equivalent to answering a “yes” or “no” question.
Binary question- question with two possible answers.

-we often represent the values as 0 and 1
1.2.2 REPRESENTING DATA sequences of bits to represent many kinds of data
 Numbers
 Discrete Values
 Text
 Rich Data
 Summary
1.3 Science, Engineering, and the Liberal Arts
Science- understand aspects of nature deeply enough to make accurate quantitative predications.
Engineering- use scientific principles to create their designs, and focus on designing under practical
constraints.
Liberal Arts- purpose of expanding the intellects of free people from the illiberal arts
- medicine and carpentry that were pursued for economic purposes
Traditional seven liberal arts

Trivium (three roads), focused on language:
• Grammar — “the art of inventing symbols and combining them to express thought”
• Logic — “the art of thinking”
• Rhetoric — “the art of communicating thought from one mind to another, the adaptation of
language to circumstance”
Quadrivium, focused on numbers:
• Arithmetic — “theory of number”

• Geometry — “theory of space”
• Music — “application of the theory of number”
• Astronomy — “application of the theory of space”
LANGUAGE
What is language?
-set of a surface form and meanings and mapping between the surface forms and their associated
meanings.
TYPES OF LANGUAGES:
- NATURAL LANGUAGE
-A LANGUAGE SPOKEN BY HUMANS LIKE ENGLISH OR S WAHILI .
- DESIGNED LANGUAGE
-FOR EXPRESSING PROCEDURES TO BE EXECUTED BY COMPUTERS.
- TEXTUAL LANGUAGE
-FOCUSES ON LANGUAGE WHERE SURFACE FORMS ARE SEQUENCES OF CHARACTERS.
String
-IT IS A SEQUENCE OF ZERO OR MORE CHARACTERS.
ALPHABET
-EACH CHARACTER IS A SYMBOL DRAWN FROM A FINITE SET.
Grace Hopper
-She was a pioneer of computer programming.
-American computer scientist, mathematician.
LANGUAGE INFINITY - a useful language must be able to express infinitely many different meanings.
COMPONENTS OF LANGUAGE:
 PRIMITIVE LANGUAGE - we can create a new word by adding anti- in front of an existing word.
 MEANS OF ABSTRACTION- allows us to simplify complex ideas by giving them a simple name.
To define a language- we need to define a system that produces all strings in the language and no other strings.
Recursive Transition Network (RTN) - is a graph consisting of nodes and edges
Terminals- labels on the output edges of the RTNs that we have seen are straight outputs.
unique identifier- a subnetwork's beginning component.
Noun- is the only edge that deviates from the sentence.

independent subnetwork -leap to the Noun node in order to follow the edge.
John Warner Backus - He invented the Backus-Naur Form(BNF) in the late 1950s.
- A Grammar is a set of rules for generating all strings in the language.
Backus led efforts at IBM- the first widely used programming language.
Nonterminals- these are the symbols on the left side, not in the final string.
- represented in Italics
Terminals - the basic elements of the language

- output symbols on the left side, not in the final string.
- represented in Bold.
grammar rule is crucial- without it, strings cannot be generated
language- defined as a collection of strings.
RTNs and BNFs. - A limitless number of different languages
PROGRAMMING
COMPILER- is a computer program that generates other programs.
INTERPRETER- An alternative to a compiler is an interpreter

- is a tool that translates between a higher-level language and a lower-level language.
Scheme - The input to our programming system is a program written in a programming language.
Expression- is a syntactic element that has a value.
EVALUATION- The act of determining the value associated with an expression.
Primitives- are the smallest units of meaning.
NUMBERS- represent numerical values
BOOLEANS- represent truth values.
PRIMITIVE PROCEDURES- corresponding to many common functions.
Application Expressions- apply procedures to operands.
TWO IMPORTANT DIFFERENCES:
- State
- Resources
Evaluation Rules:
- Primitives- evaluates to its pre-defined value.

- Names- evaluates to the value associated with that name.
- Application-
- Lambda
- If.
PROBLEMS AND PROCEDURES
Problem- defined by its inputs and the desired property of the output.
Procedure- precise description of a process and a procedure is guaranteed to always finish is called an algorithm.
MUHAMMAD IBN MUSA ALKHWARIZMI(C.780-C.850)
- Algorithm is a Latinization of the name of the Persian mathematician and scientist, Muhammad Ibn
Musa AlKhwarizmi.
COMPOSING PROCEDURES - involves combining multiple procedure is used as the input for another, resulting in a
more complex solution.
higher-order procedure- is a procedure that takes other procedures as in- higher-order puts.
RECURSIVE PROBLEM SOLVING- a method of solving problems that involves breaking a problem down into smaller
and smaller subproblems until you get to a small enough problem that it can be solved trivially.
DATA
TYPES OF DATA
- BOOLEAN – data types contains two values: true and false.

- NUMBER - type includes all whole numbers, negative numbers, and rational numbers.
- PROCEDURES- can take various types as inputs and produce different types as outputs.
PAIRS
- The simplest structured data construct is a Pair.

- A Pair packages two values Pair together.
- We call each box of a Pair a cell
Specialized Problem-Solving Strategy for Lists
1. Be very optimistic: Since lists are recursive data structures, most list-related problems can be solved using
recursion.
2. Base case: Identify the simplest version of the problem that you can solve. For lists, this is usually the empty list.
3. Recursive case: Solve the larger problem by solving a smaller version of it. For lists, the smaller version is usually
the rest (cdr) of the list.
4. Combine: Use the base case and recursive case together to solve the entire problem.

Ite 1 Reviewer

Uploaded by

Copyright:

Available Formats

Ite 1 Reviewer

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Ite 1 Reviewer

Uploaded by

Copyright:

Available Formats

ITE 1 REVIEWER

Two reasons why everyone should study computing:

Computer is a machine that can:

1.1 Processes, Procedures, and Computer

Computer science- study of information processes.

Procedure- description of a process.

Mechanical procedure- procedure that can be followed without any thought.

Algorithm- mechanical procedure that is guaranteed to eventually finish.

1.2 Measuring Computing Power

Two properties that measure the power of a computing machine are:

Bit -primary unit of information.

Binary question- question with two possible answers.

1.2.2 REPRESENTING DATA sequences of bits to represent many kinds of data

1.3 Science, Engineering, and the Liberal Arts

Traditional seven liberal arts

Quadrivium, focused on numbers:

• Arithmetic — “theory of number”

Recursive Transition Network (RTN) - is a graph consisting of nodes and edges

unique identifier- a subnetwork's beginning component.

Noun- is the only edge that deviates from the sentence.

Terminals - the basic elements of the language

grammar rule is crucial- without it, strings cannot be generated

language- defined as a collection of strings.

RTNs and BNFs. - A limitless number of different languages

INTERPRETER- An alternative to a compiler is an interpreter

Expression- is a syntactic element that has a value.

EVALUATION- The act of determining the value associated with an expression.

Primitives- are the smallest units of meaning.

NUMBERS- represent numerical values

BOOLEANS- represent truth values.

PRIMITIVE PROCEDURES- corresponding to many common functions.

Application Expressions- apply procedures to operands.

TWO IMPORTANT DIFFERENCES:

- Primitives- evaluates to its pre-defined value.

PROBLEMS AND PROCEDURES

MUHAMMAD IBN MUSA ALKHWARIZMI(C.780-C.850)

- BOOLEAN – data types contains two values: true and false.

- The simplest structured data construct is a Pair.

Specialized Problem-Solving Strategy for Lists

You might also like