1.

(10 )
2 2
. 0.5
. (stack) First In First Out
2. postx O(n) n
token
3. int A[5][4][3]; C++ A 12
1

.4 n1000 + 2n = (n1000 )
5. (stack) (array)
(linked-list)

( 20101103)

November 9, 2011

1 / 10

1. (10 )
2 2
. 0.5
. (stack) First In First Out
2. postx O(n) n
token
3. int A[5][4][3]; C++ A 12
1

.4 n1000 + 2n = (n1000 )
5. (stack) (array)
(linked-list)

( 20101103)

November 9, 2011

1 / 10

1. (10 )
2 2
. 0.5
. (stack) First In First Out
2. postx O(n) n
token
3. int A[5][4][3]; C++ A 12
1

.4 n1000 + 2n = (n1000 )
5. (stack) (array)
(linked-list)

( 20101103)

November 9, 2011

1 / 10

1. (10 )
2 2
. 0.5
. (stack) First In First Out
2. postx O(n) n
token
3. int A[5][4][3]; C++ A 12
1

.4 n1000 + 2n = (n1000 )
5. (stack) (array)
(linked-list)

( 20101103)

November 9, 2011

1 / 10

1. (10 )
2 2
. 0.5
. (stack) First In First Out
2. postx O(n) n
token
3. int A[5][4][3]; C++ A 12
1

.4 n1000 + 2n = (n1000 )
5. (stack) (array)
(linked-list)

( 20101103)

November 9, 2011

1 / 10

2. (10 ) 6 sparse matrix

(transpose) FastTranspose
RowSize RowStart
.
row column value
0
1
3
0
3
9
1
0
-5
2
4
1
3
2
10
4
0
8
4
5
-3
5
1
21
5
3
15
5
4
16
0 1 2 3 4 5
RowSize 2 2 1 2 2 1
A[0]
A[1]
A[2]
A[3]
A[4]
A[5]
A[6]
A[7]
A[8]
A[9]

row
0
0
1
1
2
3
3
4
4
5

A[0]
A[1]
A[2]
A[3]
A[4]
A[5]
A[6]
A[7]
A[8]
A[9]

RowStart
.

( 20101103)

column
1
4
0
5
3
0
5
2
5
4
0 1 2
0 2 4
.

value
-5
8
3
21
10
9
15
1
16
-3
3 4
5 7
.

November 9, 2011

5
9
.

2 / 10

. 3. (10 )

. 2n2 + 30n = O(n2 )

n 1 2n2 + 30n 32n2
2n2 + 30n = O(n2 )
2. 7n3 4n2 = (n2 )
1

C > 0 n > C+1

7
7n3 > (C + 4)n2
7n3 4n2 > Cn2
2n2 + 30n = O(n2 )

( 20101103)

November 9, 2011

3 / 10

. 3. (10 )

. 2n2 + 30n = O(n2 )

n 1 2n2 + 30n 32n2
2n2 + 30n = O(n2 )
2. 7n3 4n2 = (n2 )
1

C > 0 n > C+1

7
7n3 > (C + 4)n2
7n3 4n2 > Cn2
2n2 + 30n = O(n2 )

( 20101103)

November 9, 2011

3 / 10

. 4. (20 ) failure functions

a) hashealthhashope
b) easycomeeasygo
a)
b)

0
h
-1
e
-1

1
a
-1
a
-1

2
s
-1
s
-1

3
h
0
y
-1

4
e
-1
c
-1

5
a
-1
o
-1

6
l
-1
m
-1

7
t
-1
e
0

8
h
0
e
0

9
h
0
a
1

10
a
1
s
2

( 20101103)

11
s
2
y
3

12
h
3
g
-1

13
o
-1
o
-1

14
p
-1

November 9, 2011

15
e
-1

4 / 10

5. (20 ) inx() postx(

. ) prex()

. A B C/D + E (X + Y)
(((A B) (C/D)) + (E (X + Y)))
postx: A B C D / E X Y + +
prex: + A B / C D E + X Y
2. A + B > C/D > E F G == H
1

((((A + B) > (C/D)) > ((E F) G)) == H)

postx: A B + C D / > E F G > H == >
prex: == > > + A B / C D E F G H

( 20101103)

November 9, 2011

5 / 10

5. (20 ) inx() postx(

. ) prex()

. A B C/D + E (X + Y)
(((A B) (C/D)) + (E (X + Y)))
postx: A B C D / E X Y + +
prex: + A B / C D E + X Y
2. A + B > C/D > E F G == H
1

((((A + B) > (C/D)) > ((E F) G)) == H)

postx: A B + C D / > E F G > H == >
prex: == > > + A B / C D E F G H

( 20101103)

November 9, 2011

5 / 10

6. (10 ) (prex
expressions) (postx expressions)
.

. +/625/638
prex: 48
2. 58 65 2/43 + +
1

postx: 12

( 20101103)

November 9, 2011

6 / 10

7. (10 ) 7 8

0
1
0
1
1
0
1

0
1
0
0
0
0
1

0
0
0
0
0
0
0

0
1
0
0
1
1
0

0
0
0
0
0
0
0

0
1
0
0
0
0
0

0
0
0
0
0
1
0

0
0
1
1
1
0
0

( 20101103)

November 9, 2011

7 / 10

8. (10 ) A,B,C,D,E

a
b
c
d
ABCDE
CAEDB
EDCBA
DECBA
e
. ECBDA

a ,
c
d
,

( 20101103)

November 9, 2011

8 / 10

9. (5 )
.
A queue is an ordered list in which insertions and deletions take
place at dierent ends. The end at which new elements are added
is called the rear, and that from which old elements are deleted is
called the front. The restrictions on a queue imply that if we insert
A, B, C, D, and E in that order, then A is the rst element deleted
from the queue. Since the rst element inserted into a queue is the
rst element removed, queues are also known as
First-In-First-Out(FIFO) lists.

A,
B, C, D E A

( 20101103)

November 9, 2011

9 / 10

. 10. (10 )

.
(4 )
2.
1

(3 )
.3 (3 )

( 20101103)

November 9, 2011

10 / 10