皮皮学，免费搜题
登录
搜题
【简答题】
三插座下边两是接( )线的,仍按 左零右火 接线,上边大接 ( )线 。
手机使用
分享
复制链接
新浪微博
分享QQ
微信扫一扫
反馈参考答案：
举一反三
【单选题】The operation of removing an element from the stack is said to（ ）the stack.
A.
pop
B.
push
C.
store
D.
fetch
【单选题】There are two common types in page replacement algorithm: stack and non-stack strategies. When a real page number increase only stack algorithm can increase the hit rate monotonously. In the following...
A.
FIFO
B.
LRU
C.
PFF
D.
OPT
【单选题】有下列程序： #include＜iosteram.h＞ using namespace std class Stack { public: Stack(unsignedn=10):size(n){rep_=new int [size]top=O} Stack(Stack&s):size(s.size) { rep_=new int[size] fo
A.
4,3,2,1，
B.
4,3,6,7,2,1，
C.
4,3,6,2,1，
D.
1,2,3,4，
【单选题】What is the content of stack pointer (SP)?
A.
address of the current instruction
B.
address of the next instruction
C.
address of the top element of the stack
D.
size of the stack
【单选题】There are two common types in page replacement algorithm : stack and non-stack strategies.When a real page number increase only stack algorithm can increase the hit rate monotonously.In the following ...
A.
FIFO
B.
LRU
C.
OPT
D.
non of above
【单选题】The following is not the basic operation of the stack? ( )
A.
Insert a new element at the top of stack
B.
Adding an element at a random location k.
C.
Determines if stack is empty
D.
Reads the value of stack top
【单选题】有如下程序： #include ＜iostream.h＞ using namespace std; class Stack { public: Stack(unsigned n=10):size(n){rep_=new int [size]; top=0;} Stack(Stack&s): size (s.size) { rep_=new int[size]; for (int i=0;i＜siz...
A.
4,3,2,1,
B.
4,3,6,7,2,1,
C.
4,3,6,2,1,
D.
1,2,3,4,
【简答题】《历代帝王图》的作者是:
【单选题】有如下程序: #include ＜iostream＞ using namespace std; class Stack { public: Stack(unsigned n= 10):size(n) {rep_=ew int[size]; top=0;} Stack(Stack& s):size(s.size) { rep_=new int[size]; for(int i=0;i＜size;i+...
A.
4,3,2,1，
B.
4,3,6,7,2,1，
C.
4,3,6,2,1，
D.
1，2，3，4，
相关题目：
参考解析：
知识点：
题目纠错 0
发布
