问题 选择题

中国古代官营手工业历史悠久,官营手工业由政府直接经营,其生产不计成本,产品大多精美。

答案

答案:A

题目分析:中国古代手工业多种经营方式长期并存,其中官营手工业素称发达长期占统治地位。官营手工业由官府统一管理,规模大、分工细、水平高、资金雄厚。生产不计成本,产品不投放市场,全部供皇室和贵族消费。故选A。

点评:中国古代手工业分为三种形态:

官营手工业:规模庞大、行业众多、分工细致、组织形式严密、管理制度完善、主要生产军用品和皇室、贵族消费品;

私营手工业:主要生产民间消费品

家庭手工业:家庭手工业是农户的一种副业,产品主要供自己消费和交赋税,剩余部分才拿到市场出售。

阅读理解

       File-sharing occurs whenever one individual sends a file to another. The only way to even try to limit this process is to monitor all communication between ordinary people. Despite the crackdown on Napster, Kazaa and other peer-to-peer(对等网络) services over the past decade, the volume of file-sharing has grown exponentially. Even if the authorities closed down all other possibilities, people could still send copyrighted files as attachments to e-mails or through private networks. If people start doing that, should we give the government the right to monitor all mail and all encrypted(加密) networks? Whenever there are ways of communicating in private, they will be used to share copyrighted material. If you want to stop people doing this, you must remove the right to communicate in private. There is no other option. Society has to make a choice.

The world is at a crossroads. The internet and new information technologies are so powerful that no matter what we do, society will change. But the direction has not been decided.

The internet it still in its infancy, but already we see fantastic things appearing as if by magic. Take Linux, the free computer operating system, or Wikipedia, the free encyclopedia. But where technology opens up new possibilities, our intellectual property laws do their best to restrict them. Linux is held back by patents, the rest of the examples by copyright. The public increasingly recognizes the need for reform.

Our manifesto(声明) is to reform copyright laws and gradually abolish(废除) the patent system. We oppose mass surveillance (监视)and censorship(审查制度) on the net, as in the rest of society. We intend to devote all our time and energy to protecting the basal civil liberties on the net and elsewhere.

Political decisions taken over the next five years are likely to set the course we take into the information society, and will affect the lives of millions for many years into the future. The information revolution is happening here and now. It is up to us to decide what future we want.

41. Which of the following statements is NOT true according to the passage?

A. Over the past decade, the volume of file-sharing has increased doubly.

B. Over the past decade, other peer-to-peer(对等网络) services have been beaten down.

C. Copyright laws should be reformed.

D. File-sharing occurs unless a file is sent on the Internet.

42. In the opinion of the writer, the government ________.

A. has to make a choice

B. should stop people sharing the copyrighted files

C. shouldn't stop people sharing the copyrighted files

D. should monitor all the mail and all encrypted (加密) networks

43. The author's main purpose in writing the passage is____________.

A. to have the basal citizen's freedom on the net and elsewhere

B. to establish the patent system

C. to abolish copyright laws

D. to reform computer operating system

44. The underlined word “restrict” in Paragraph 3 most probably means__________.

A. remove           B. limit               C. close                D. reform

45. We can infer from the passage_______________.

A. A new information revolution will be coming.

B. People won't share copyrighted material on the net

C. People can share the free encyclopedia

D. The future of the Internet will rely on the government

填空题

【说明4.1】 假设两个队列共享一个循环向量空间(如图1-2所示),其类型Queue2定义如下:typedef struct { DateType data [MaxSize]; int front[2],rear[2]; }Queue2; 对于i=0或1,front[i]和rear[i]分别为第i个队列的头指针和尾指针。函数.EnQueue (Queue2*Q,int i,DaleType x)的功能是实现第i个队列的入队操作。 【函数4.1】 int EnQueue(Queue2 * Q, int i, DateType x) { /*若第i个队列不满,则元素x入队列,并返回1;否则,返回0*/ if(i<0‖i>1) return 0; if(Q->rear[i]==Q->front[ (1) ] return 0; Q->data[ (2) ]=x; Q->rear[i]=[ (3) ]; return 1; } 【说明4.2】 函数BTreeEqual(BinTreeNode*T1,BinTtneNode*T2)的功能是递归法判断两棵二叉树是否相等,若相等则返回1,否则返回0。函数中参数T1和T2分别为指向这两棵二叉树根结点的指针。当两棵树的结构完全相同,并且对应结点的值也相同时,才被认为相等。 已知二叉树中的结点类型BinTreeNode定义为: struct BinTreeNode { char data; BinTreeNode * left, * right; }; 其中dau为结点值域,leR和risht分别为指向左、右子女结点的指针域, 【函数4.2】 int BTreeEqual(BinTreeNode * T1, BinTreeNode * T2) { if(Ti == NULL && T2 == NULL)return 1 /*若两棵树均为空,则相等*/ else if( (4) )return 0; /*若一棵为空一棵不为空,则不等*/ else if( (5) ) return 1; /*若根结点值相等并且左、右子树*//*也相等,则两棵树相等,否则不等*/ else return 0; }