题目内容

将文件夹下的RDEV文件夹中的文件KING.MAP删除。 2．在文件夹下BEF文件夹中建立一个名为SEOG的新文件夹。 3．将文件夹下RM文件夹中的文件PALY.PRG复制到文件夹下BMP文件夹中。 4．将文件夹下TEED文件夹中的文件KESUT.AVE设置为隐藏和只读属性。 5．将文件夹下QENT文件夹中的文件PTITOR.FRX移动到文件夹下KNTER文件夹中，并改名为SOLE.CDX。

查看答案

搜索结果不匹配？点我反馈

更多问题

在UML的通用机制中， (7) 用于把元素组织成组； (8) 是系统中遵从一组接口规范且付诸实现的物理的、可替换的软件模块。

A. 包
B. 类
C. 接口
D. 构件

Where are they

A. On a bus.
B. In subway.
C. On a taxi.

Tom enjoyed going to the movies. He especially liked seeing movies made from stories he had read in the books. He went at least once a week. He liked to sit in the same seat, but sometimes when the theater was full, this was not possible. He had to sit wherever there was an empty seat. One evening, he found himself sitting behind a man who had his arm around a large dog on the seat beside him. This was strange, but even stranger was the dog’s behaviour(举止，行为). It seemed to be watching the movie with interest, but from time to time it would turn to the man and bark quietly in his ear. The man would just nod, and the dog would turn back to watch the movie. Sometimes when something funny happened in the movie, the clog barked quite loudly and wagged(摆动) its tail. Tom sat behind the man and his dog for a long time without saying anything. He thought it would be rude to speak to them while the movie was still on. But when it came to the end and the lights in the theater went on, Tom decided to say something. He tapped the man on the shoulder. The man turned around. "Yes" he said. "What is it" "Please don’t think me rude," Tom said, "but isn’t your dog’s behaviour rather strange" "You’re right," the man agreed. "It’s strange. He hated the film.\ It seemed that the dog could understand the film, didn’t it

A. Yes, it did.
B. No, it didn’t.
C. Yes, it could.

【说明】以下程序的功能是设计一个栈类stack＜T＞，并建立一个整数栈。【程序】 #include ＜ iostream. h ＞ #include ＜ stdlib. h ＞ const int Max =20; //栈大小 template ＜ class T ＞ class stack{ //栈元素数组 T s[Max]; //栈顶下标 int top; public: stack( ) { top =-1; //栈顶初始化为-1 } void push( const T &item); //item入栈 T pop( ); //出栈 int stackempty( ) const; //判断栈是否为 }; template ＜ class T ＞ void stack ＜T ＞::push(const T &item) { if(top== (1) ) { cout ＜＜"栈满溢出" ＜＜endl; exit(1); } top ++ s[top] = item; } template ＜ class T ＞ T stack＜T＞ ::pop() { T temp; if(top== (2) ) { cout ＜＜"栈为空，不能出栈操作" ＜＜ endl; exit(1); } temp =s[top]; top --; return temp; } template ＜ class T ＞ int stack ＜ T ＞:: stackempty( ) const { return top == -1; { void main( ) { stack ＜int＞ st; int a[] ={1,2,3,4,5}; cout ＜＜"整数栈" ＜＜endl; cout ＜＜"入栈序列:" ＜＜endl; for(int i=0;i＜4;i ++) { cout ＜＜a[i] ＜＜" "; (3) ; } cout ＜＜ endl ＜＜"出栈序列"; while( (4) ) tout＜＜ (5) ＜＜" "; cout＜＜ endl; }