... important to appreciate that, just as it took a full
half-century (1900— 53) to recognize the reality of brain acti-
vation in sleep, it has taken another half-century (19 53 20 03) for
us to come to ... Bottom the recognition that 'I
2 I
Introduction xi
1 What is dreaming? 1
2 Why did the analysis of dream content fail to become a
science? 17
3 How is the brain activated in sleep? 35 ... turn of
27
Why did the analysis of dream content fail to become a science?
32
had another terrible accident on a bicycle before we stopped him
from riding with his own impaired motor control...
... Sections 9 .2, 9 .3, and 9.4.
7. AUTOMATA
ã Patterns and Pattern Matching
ã Finite State Machines and Automata
ã Deterministic and Nondeterministic Automata
Reading: Sections 10 .2 and 10 .3.
8. REGULAR ... opportunities to get an English-working skill and a better
knowledge in computer science.
0 .2 TEXTBOOK AND HANDOUTS
There is one required text for this course:
Foundations of ComputerScience (C Edition) ... COMPUTER SCIENCE
HANDOUT #0. COURSE INFORMATION
K5 & K6, ComputerScience Department, Văn Lang University
Second semester Feb, 20 02
Instructor: Trần Đức Quang
0.1 OBJECTIVES AND PREREQUISITES
This...
... REVIEWS
K5 & K6, ComputerScience Department, Văn Lang University
Second semester Feb, 20 02
Instructor: Trần Đức Quang
Major themes:
1. IntroductiontoComputer Science
2. Three Columns: Data ... figure, num is an array of type int with size 4. In general, the type of
objects is any type in the type system of C.
10 02
5
0
num
8
3
10
0
1
2
3
INTRODUCTIONTOCOMPUTER SCIENCE
HANDOUT #1. REVIEWS
K5 ... abstraction
3. Write a program to solve it ==> mechanization
How to write a good computer program?
1. Design data structures
2. Design good algorithms
3. Choose an appropriate programming language to...
... 1
Region 2 Region 3 Region 4
S T
16 INTRODUCTIONTOCOMPUTER SCIENCE: HANDOUT #2. SET THEORY
Code: Baûn mã chương trình. Any written program (in any programming languages,
including machine languages).
Listing: ... SCIENCE
HANDOUT #2. SET THEORY
K5 & K6, ComputerScience Department, Văn Lang University
Second semester Feb, 20 02
Instructor: Trần Đức Quang
Major themes:
1. The Set Data Model
2. Set Algebra
3. Implementation ... property P."
12 INTRODUCTIONTOCOMPUTER SCIENCE: HANDOUT #2. SET THEORY
Equality of Sets
Two sets are equal if they have exactly the same members. This doesn’t necessarily
mean their representations...
... the logical operators such as AND, OR, and NOT. The result of this operation is
as follows:
Course StudentId Grade
CS101
CS101
EE200
EE200
CS101
PH100
1 23 4 5
67890
1 23 4 5
22 222
33 333
67890
A
B
C
B+
A−
C+
Course ... A
i
component of r anyway.
Suppose we have two tables CDH and CR as follows:
The table CDH.
StudentId
1 23 4 5
67890
22 222
33 333
Course Day Hour
CS101
CS101
CS101
EE200
EE200
EE200
M
W
F
Tu
W
Th
9AM
9AM
9AM
10AM
1PM
10AM
... Grade
CS101
CS101
CS101
1 23 4 5
67890
33 333
A
B
A−
18 INTRODUCTIONTOCOMPUTER SCIENCE: HANDOUT #3. THE RELATIONAL DATA MODEL
The last must be false since it is not in the relation.
We can use an infix notation...
... xếp.
top: Đỉnh (choàng xeáp).
INTRODUCTIONTOCOMPUTER SCIENCE
HANDOUT #4. THE LIST DATA MODEL
K5 & K6, ComputerScience Department, Vaên Lang University
Second semester Feb, 20 02
Instructor: ... hàng.
4 .2 STACKS 25
A smart way to implement a stack by an array is to create a structure consisting of:
1. An array to hold the elements, and
2. A variable top to keep track of the top of stack.
In ... Info2 Info3 Info4
ã
28 INTRODUCTIONTOCOMPUTER SCIENCE: HANDOUT #4. THE LIST DATA MODEL
push: Đẩy (vào chồng xếp).
pop: Nhặt, lấy (ra khỏi chồng xếp).
Postfix expression: Biểu thức hậu vị. An...
... tree.
r
n
1
n
2
n
3
n
4
n
5
30 INTRODUCTIONTOCOMPUTER SCIENCE: HANDOUT #5. THE TREE DATA MODEL
In the figure, r is the root and has three children: n
1
, n
2
, and n
3
. We can define
important concepts ... INTRODUCTIONTOCOMPUTER SCIENCE
HANDOUT #5. THE TREE DATA MODEL
K5 & K6, ComputerScience Department, Vaên Lang University
Second semester Feb, 20 02
Instructor: Trần Đức Quang
Major ... and n
1
are ancestors of n
4
.
3. Nodes n
1
, n
2
, and n
3
are siblings; so are n
4
and n
5
.
4. The height of r is 2; this is also the height of the tree. The height of n
1
is 1 and
of n
4
...