The principle for a stack memory to store data is (72) ．(72)

A．FIFO

B．random

C．FILO

D．other way

[单选题]The principle for a stack memory to store data is （） 。（）A. FIFO B. FILO C. random D. other way

[单选题]The principle for a stack memory to store data isA．FIFOB．FILOC．randomD．other way

[单选题]The principle for a stack memory to store data is(72).A．FIFOB．randomC．FILOD．other way

[名词解释] Stack栈

[试题]（ 15 ）请将下列栈类 Stack 补充完整class Stack{private:int pList[100]; // int 数组 , 用于存放栈的元素int top; // 栈顶元素 ( 数组下标 )public:Stack():top(0){}void Push(const int &item); // 新元素 item 压入栈int Pop(void); // 将栈顶元素弹出栈};void Stack::Push(const int &item){if(top == 9

[单选题]On a(75)memory system，the logical memory space available to the program is totally independent of the physical memory space．A．cacheB．virtualC．RAMD．ROM

[单选题]用STO键可以( )A．保存的数据从0~9共10组B．调出内存单元中的数据C．直接结合运算符号进行计算D．清空所有存储数据

[单选题]The Cooperative Principle is proposed by ( ).A.SaussureB.GriceC.ChomskyD.Le

[单选题]The Cooperative Principle is proposed by ( ).A.SaussureB.GriceC.ChomskyD.Le

[单选题]假定栈用顺序的方式存储，栈类型stack定义如下：TYPE stack=RECORDA．: ARRAY[1..M0OF datatype;t:0..M0;E．ND;下面是栈的一种基本运算的实现：PROCEDURE xxxx(VAR s:stack)B．EGINIF s.t=0THEN print('underflow')E．LSE s.t:=s.t-1;E．ND;请问这是栈的哪种基本运算?( )。A．) 栈的推入B．) 栈的弹出C．) 读栈顶元素D．) 将栈置为空栈A．B．C．D．