Bi tp chng 2

Phn stack, queue

Bi 1. Thc hin lin tip cc lnh sau i vi mt stack rng, kt qu thu c s l g? V hnh
minh ha.
Push(3);
Push(5);
Pop()
Push(7);
Pop();
Push(8);
Pop();
Pop();
Bi 2. Cho mt danh sch mc ni vi cu trc mi nt nh sau:
typedef struct node
{
float data;
struct node *pNext;
} NODE;
Hy vit hm reverse in ra ni dung danh sch mc ni theo th t ngc
void reverse (NODE* pHead)
Gi : s dng stack
Bi 3. Tnh gi tr cc biu thc hu t sau, m t r cc bc lm
a) 3 4 + 5 6 7 2
b) 3 4 + 2 ^ 6 4 2 /
c) 3 4 7 + % 2 3 /
d) 3 3 5 % ^ 9 5 2 / 6
Bi 4. Chuyn cc biu thc trung t sau sang biu thc hu t
a) ( + ) ^( + 4 5 (9/3))
b) 3 + 4/(2 + ) 7%(5 + )
c) 2 + (3 (4 (5^%)))

d) 3 (3^2 6%(5 + 9))

Bi 5. nh gi cc biu thc hu t sau (cc ton hng v ton t cch nhau 1 du cch, cc ton

hng c th gm nhiu ch s) l ton t 1 ngi cn bc hai, , , l cc ton t logic,

, >, l cc ton t quan h, ! l ton t 1 ngi tnh giai tha, l ton t 1 ngi tnh gi tr
tuyt i
a) 15 2 3 + / 2 ^ 4 12 2 % +

b)
c)
d)
e)

1 3 5 + + 2 ^ 4 12 6 / +
2 1 27 3 2 ^ / + 3 % 4 +
3 0 45 7 > 5 6
2 3 1 12 3 4 / + ^ %

f) 3 4 ! 4 5 + % 12 + 15 +
g) 1 16 5 + 4 6 + /

Bi 6. Chuyn cc biu thc sau t dng trung t v dng hu t (cc ton hng v ton t cch nhau
1 du cch, cc ton hng c th gm nhiu ch s)

a) 3 + 5 ^ (12 / 6 + 1) 7 15 / 3 + 6
b) (5 + 7) + 2 6 5 + 3 ^ 2 ^ / 2

c) 23 + (6 + 5) / 9 ^ 2 cos(3 ) (ch (6 + 5) l tng ng vi

6 + 5)

d) (3 ) ( ) (4 < )

e) 5 ^ 2 ^ 3 ^ (4 9 5 / + 6) % (7 + + )
f) (6 2 + 7 ) ^ 2 / + 5

Bi 7. Ci t thut ton nh gi biu thc trung t tng qut (thc hin trn tp cc ton t trong
slide)
Bi 8. Ci t thut ton chuyn biu thc dng trung t sang dng hu t
Bi 9. Bi ton kim tra cp ngoc trong biu thc c hp l
Mt biu thc c du ngoc l hp l nu s du ngoc m phi bng s du ngoc ng cng loi.
V d:
Biu thc hp l
{2 + 3 (5/3^2)}/{7 }
2 + {3 [4 + 6 (2/3^2)]}

Biu thc khng hp l

{3 + (6 [5 2)}
4 + (6 (5 )

Hy vit chng trnh nhn u vo l 1 biu thc, kim tra xem biu thc c hp l hay khng.
Bi 10. Bi ton i snh th HTML
Trong mt vn bn HTML th mi th m phi i km vi 1 th ng
<div class="header-right">
<form method="get" id="searchform" action="http://tinhocdaicuong.wordpress.com/" >
<div><label class="hidden" for="s">Tm kim:</label>
<input type="text" value="" name="s" id="s" />
<input type="submit" id="searchsubmit" value="Go" /></div>
</form>
</div>

Hy vit chng trnh c vo 1 file .html v kim tra xem trong file c th no b li hay khng

Bi 11. Cho mt Queue c lu tr bi mt mng c 5 nh

front

rear

Ban u front =-1 v rear = 1, thc hin lin tip cc lnh sau
1.
2.
3.
4.
5.
6.

enQueue(5)
dequeue()
enQueue(3)
deQueue()
deQueue()
enQueue(9)

Hy v trng thi ca queue sau mi bc

Nu Queue c t chc dng vng th kt qu c g khc sau khi ta cng thc hin lin tip 6 lnh
trn, ng thi thc hin tip cc lnh
7. enQueue(1)
8. deQueue()
9. enQueue(10)
Bi 12. Ci t minh ha queue vng dng mng
Bi 13. So snh u nhc im khi lu tr queue bng cu trc lin tip (mng) v cu trc lin kt
(danh sch lin kt n)
Bi 14. Ci t ng dng ca queue m phng hng i khm bnh ti bnh vin nh m t
trong slide