题目内容

？Read the memo and the advertisement below.
？Complete the form. on the opposite page.
？Write a word or phrase (in CAPITAL LETTERS) or a number on lines 41-45 on your Answer Sheet.
King's Human Resources Consultancy
MEMO
To: Jim White/PA
From: Marjory King/Director
Date: 22/5/04
Subject: Conference
We're taking part in the HR conference again. Gillian Rolland has agreed to give a talk on international recruitment, and she'll take three colleagues along with her. Except for Mark Hughes, they'll require single rooms for the evening before. Gillian would rather attend the earlier conference - she's busy the week after. She's giving a Powerpoint presentation and just needs a screen - she'll take her laptop with her. Please make the booking asap.
HUMAN RESOURCES CONFERENCE 2004
There will be two one-day conferences this year - one in Edinburgh on September 2 and one in London on September 12.
The booking fee is ￡400 per company, payable four weeks in advance. For groups of five or more, the fee (with a 20% reduction) is ￡320. Please complete the attached form. and send to Simon Winters.
(41)

查看答案

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

更多问题

阅读以下说明和算法，完善算法并回答问题。
【说明】
假设以二维数组G[1..m，1..n)表示一幅图像各像素的颜色，则G[i，j]表示区域中点(i，j)处的颜色，颜色值为0～k的整数。
下面的算法将指定点(i0，j0)所在的同色邻接区域的颜色置换为给定的颜色值。约定所有与点(i0，j0)同色的上、下、左、右可连通的点组成同色邻接区域。
例如，一幅8×9像素的图像如图2-1所示。设用户指定点(3，5)，其颜色值为0，此时其上方(2，5)、下方(4，5)、右方(3，6)邻接点的颜色值都为0，因此这些点属于点(3，5)所在的同色邻接区域，再从上、下、左、右四个方向进行扩展，可得出该同色邻接区域的其他点(见图2-1中的阴影部分)。将上述同色区域的颜色替换为颜色值7所得的新图像如图2-2所示。
【算法】
输入：矩阵G，点的坐标(i0，j0)，新颜色值newcolor。
输出：点(i0，j0)所在同色邻接区域的颜色置换为newcolor之后的矩阵G。
算法步骤(为规范算法，规定该算法只在第七步后结束)如下。
第一步：若点(i0，j0)的颜色值与新颜色值newcolor相同，则(1)；
第二步：点(i0，j0)的颜色值→oldcolon创建栈S，并将点坐标(i0，j0)入栈；
第三步；若(2)，则转第七步；
第四步；栈顶元素出栈→(x,y)，并(3)；
第五步；1)若点(x，y-1)在图像中且G[x，y-1]等于oldcolor，则(x,y-1)入栈S；
2)若点(x，y+1)在图像中且GIx，y+1]等于oldeolor，则(x，y+1)入栈S；
3)若点(x-1，y)在图像中且G[x-1，y)等于oldcolor，则(x-1，y)入栈S；
4)若点(x+1，y)在图像中且G[x+1，y)等于oldcolor，则(x+1，y)入栈S；
第六步：转(4)；
第七步：算法结束。
【问题】
是否可以将算法中的栈换成队列？回答；(5) 。

在事件4中，验收小组组成妥当吗？为什么？正式验收的一般程序包括八个步骤，请列出。

阅读下列说明，回答问题1至问题4。
[说明]
某地区政府部门建设一个面向公众服务的综合性网络应用系统，对现有的零散管理系统和服务平台进行重组整合，整个项目由政府的信息中心负责统一规划分期建设，由各共建单位的主要领导组成了领导小组，招标选择了监理公司全程监理建设过程。一期重点建设了社保、民政和交换中心三个应用系统。建设过程中由于机构改革、职能需要重新定位等原因，《需求规格说明书》始终找不到最终用户签字。在监理方和承建单位的一再努力下，只有一个共建单位的主管领导在该子系统的需求分析上签字确认，为了赶进度承建单位决定先行设计和实施，监理方认为可以理解且就目前的实际情况而言，也只好默许。
在实施中，承建单位制定了如下图所示的单元测试进度计划，图中已标出每个节点的最早开始时间和最迟开始时间。监理工程师在第5天进行检查时，发现工作A已经完成，工作B已经实施3天，工作C已经实施1天，工作D已经实施1天。
工程竣工验收时，承建单位向监理单位提交了验收申请并将竣工验收所需要的全部资料报送项目监理单位，申请竣工验收。总监理工程师认为系统已经过初验和3个月的试运行，并且运行情况良好，随即对验收申请予以签认，并协助建设单位进行后续的验收工作。
在本项目需求分析阶段的监理中，监理方有没有不妥当的地方，监理应该怎样做？阐述软件需求分析阶段监理的主要任务。

听力原文：M: Harrisons Trading Firm Ltd. How can I help you？
F: This is Anita Freeman, the assistant manager at Best Hardware. Is Mr Hunter there？
M: Speaking.
F: Mr Hunter, the goods we ordered arrived here last week. After reinspection, we found 30 steel rollers were terribly rusty. We have already sent you the photos of them by E-mail.
M: Really？ I'm so surprised to hear this. Anyway, I regret this incident should happen. Maybe the dampness at sea caused the rust.
F: Before unloading, our surveyors went on board and found the holds in perfect conditions. If you look at the photos, it's evident that the rust is due to poor workmanship. I demand a refusal of the full amount for the goods. We are in urgent need of the steel rollers. With so many faulty ones in hand, our project will surely be delayed.
M: Don't worry, Ms Freeman, we'll lay our best to mend your loss. I'll call our home office and ask them to dispatch the replacements. You can rest assured that your project won't be delayed.
F: OK. It sounds to be a good solution. When could the replacements be expected？
M: I think the earliest time would be this Friday. I would also like to have the faulty ones returned for examination.
F: That's OK. Mr Hunter, thanks a lot. Bye-bye.
M: Bye-bye.
&8226;Look at the notes below.
&8226;You will hear a woman calling to ask for a claim.
Harrison Trading Firm Ltd.
Notes
Customer: Anita Freeman, (9)
Goods ordered: (10)
Problem: 30 became rusty
Cause: due to poor (11)
Action: call home office and ask to send (12)
Time: Friday, 30/Oct/02