STACK SEGMENT STACK
DW 32DUP()
STACK ENDS
DATA SEGMENT
BUF DB 50()
DATA ENDS
CODE SEGMENT
START PROC FAR
ASSUME CS:CODE,DS:DATA,SS:STACK
MOV AX,DATA
MOV DS,AX
LEA SI,BUF
(1)
CON:
INT 21H
MOV [SI],AL
INC SI
(2)
JNE CON
MOV AX,4C00H
INT 21H
START ENDP
CODE ENDS
END START
STACK SEGMENT STACK
DW 32 DUP()
STACK ENDS
DATA SEGMENT
BUF DB 50()
DATA ENDS
CODE SEGMENT
START PROC FAR
ASSUME CS: CODE, DS: DATA, SS: STACK
MOV AX, DATA
MOV DS, AX
LEA SI, BUF
[1]
CON:
INT 2IH
MOV [SI],AL
INC SI
[2]
JNE CON
MOV AX, 4COOH
INT 2IH
START ENDP
CODE ENDS
END START
Which of the following is NOT mentioned in the passage concerning the expedition?
A.Lack of navigation equipment.
B.Severe winter in Patagonia.
C.The death of Magellan.
D.Dangers from rocks and storms.
The author points out that the Greeks who studies conic section ______.
A.were unaware of the value of their studies
B.were mathematicians
C.resigned
D.were interested in navigation
An appropriate title for this passage would be ______. ()
A.Rendezvous in Space
B.Landing at a Space Station
C.New Radar for the Space Age
D.Space Navigation
放进筒中的数据被后放进筒中的数据“压住”,只有放进筒中的数据都取出后,先放进去的数据才能被取出,称为“后进先出”。堆栈的长度可随意增加。堆栈结构可用链表实现。设计一个链表结构需包含两个成员:一个存放数据,一个为指向下一个节点的指针。当每次有一个新数据要放入堆栈时,称为“压入堆栈”,这时动态建立一个链表的节点,并连接到链表的结尾;当每次从堆栈中取出一个数据时.称为“弹出堆栈”,这意味着从链表的最后一个节点中取出该节点的数据成员,同时删除该节点,释放该节点所占的内存。
A.move
B.fly
C.steer
D.swim