FUNDAMENTAL IT ENGINEER EXAMINATION (NETWORK)(AFTERNOON) docx

MINISTRY OF SCIENCE AND TECHNOLOGY HOÀ LC HIGH TECH PARK MANAGEMENT BOARD VIETNAM IT EXAMINATION AND TRAINING SUPPORT CENTER (VITEC) FUNDAMENTAL INFORMATION TECHNOLOGY ENGINEER EXAMINATION 26 th January 2003 Afternoon Do not open the exam booklet until instructed to do so. Inquiries about the exam questions will not be answered. B KHOA HC VÀ CÔNG NGH BAN QUN LÝ KHU CÔNG NGH CAO HOÀ LC TRUNG TÂM SÁT HCH CÔNG NGH THÔNG TIN VÀ H TR ÀO TO (VITEC) SÁT HCH K S CÔNG NGH THÔNG TIN C BN Ngày 26 tháng 1 nm 2003 Phn thi bui chiu Không m đ thi trc khi đc phép. Các thc mc v câu hi thi s không đc tr li Date of Birth Examinee Number Year Month Day F E 0 0 3 󲃚 19 2003 VITEC Class II Information Technology Engineer Examination - Afternoon Fundamental IT Engineer Examination (Afternoon) Questions must be answered in accordance with the following: Question Nos. Q1-Q5 Q6-Q9 Q10-Q13 Question Selection Compulsory Select 1 of 4 Select 1 of 4 Examination Time 13:30 ~ 16:00 (150 minutes) Instructions: 1. Use an HB pencil. If you need to change an answer, erase your previous answer completely and neatly. Wipe away any eraser debris. 2. Mark your examinee information and test answers in accordance with the instructions below. Your test will not be graded if you do not mark properly. Do not mark or write on the answer sheet outside of the prescribed places. (1) Examinee Number Write your examinee number in the space provided, and mark the appropriate space below each digit. (2) Date of Birth Write your date of birth (in numbers) exactly as it is printed on your examination admission card, and mark the appropriate space below each digit. (3) Question Selection󲃕 Q6-Q9 and Q10-Q13󲃖 Mark the s of the question you select to answer in the “Selection Column” on your answer sheet. (4) Answers Mark your answers as shown in the following sample question. [Sample Question] In which month is the Spring Fundamental IT Engineer Examination conducted? a) March b) April c) May d) June Since the correct answer is “b” (April), mark your answer sheet as follows: [Sample Reply] a  󲄐 󲄑 3. This test booklet will be picked up at the end of the test. Your test will not be graded unless you turn this test booklet in. 4. Assembler specifications are provided as a reference at the end of this booklet. Do not open the exam booklet until instructed to do so. Inquiries about the exam questions will not be answered. Ngày sinh S hiu thí sinh Nm Tháng Ngày F E 0 0 3 󲃚 19 2003 VITEC Class II Information Technology Engineer Examination - Afternoon Sát hch k s Công ngh thông tin c bn (Bui chiu) Các câu hi phi đc tr li tuân theo điu sau: S hiu câu hi Q1-Q5 Q6-Q9 Q10-Q13 Câu hi la chn Bt buc Chn 1 trong 4 câu Chn 1 trong 4 câu Thi gian sát hch 13:30 ~ 16:00 (150 phút) Hng dn: 1. Dùng bút chì HB. Nu bn cn đi câu tr li, hãy xoá ht câu tr li trc. Phi sch bi ty trên giy. 2. ánh du thông tin sát hch và câu tr li sát hch ca bn theo hng dn di đây. Bài sát hch ca bn s không đc chm nu bn không đánh du đúng. ng đánh du hay vit lên t giy tr li bên ngoài ch đã qui đnh. (1) S hiu thí sinh Hãy vit s hiu thí sinh  ch đã cho, và đánh du vào ch thích hp di mi ch s. (2) Ngày sinh Hãy vit ngày sinh ca bn (theo s) đích xác nh nó đc in trong phiu d thi, và đánh du vào ch thích hp di mi ch s. (3) Chn la câu hi󲃕Q6-Q9 và Q10-Q13󲃖 Bôi đen ô s  câu hi bn chn tr li trong “Ct chn la” trên giy tr li ca bn. (4) Tr li Bôi đen câu tr li ca bn nh đc nêu trong câu hi mu di đây. [Câu hi mu] Kì sát hch k s CNTT c bn mùa Xuân đc tin hành vào tháng nào? a) 3 b) 4 c) 5 d) 6 Vì câu tr li đúng là “b” (4), nên đánh du t giy tr li ca bn nh sau: [Tr li mu] a  󲄐 󲄑 3. Tp giy thi này s đc thu li vào cui kì thi. Bài thi ca bn s không đc chm chng nào bn còn cha np li tp giy thi này. 4. Các đc t hp ng đc cung cp làm tài liu tham kho ti cui ca tp giy thi này. Không m tp giy thi chng nào cha đc hng dn làm nh vy. Mi vic hi thêm v các câu hi sát hch s không đc tr li. Company names and product names appearing in the test questions are trademarks or registered trademarks of their respective companies. Note that the ® and ™ symbols are not used within. Tên công ti và tên sn phm xut hin trong các câu hi sát hch là thng hiu hay thng hiu đã đng kí ca các công ti đó. Chú ý rng các kí hiu ® và ™ không đc dùng bên trong. 3 Questions 1 through 5 are complusory. Answer every question. Q1. Read the following descriptions of logical operations and full adders, and then answer Sub- Questions 1 through 3. (1) The logical circuit symbols for the main logical operations are as follows. Logical operation name Logical circuit symbols Logical product (AND) Logical sum (OR) Exclusive logical sum (XOR) (A, B: Input, Z: Output) B A Z B A Z B A Z A k B k C k (2) Below is a figure which shows a full adder that adds binary numbers digit by digit with considerations for carry. The table shown below is the truth table for that full adder. Full adder k C k+1 Z k A k , B k : Input C k : Carry from k-1th digit C k+1 : Carry to k+1th digit Z k : Output Fig. Full Adder (k th digit) Table: Truth Table of Full Adder Input Output C k A k B k C k+1 Z k 0 0 0 0 0 0 0 1 0 1 0 1 0 0 1 0 1 1 1 0 1 0 0 0 1 1 0 1 1 1 0 1 0 1 1 1 1 1 4 Các câu hi 1 ti 5 là bt buc. Hãy tr li mi câu hi. Q1. Hãy đc nhng mô t di đây v các phép toán logic và b cng đy đ, sau đó tr li các câu hi con 1 ti 3. (2) Các kí hiu mch logic cho các phép toán logic chính nh sau. Logical operation name Logical circuit symbols Logical product (AND) Logical sum (OR) Exclusive logical sum (XOR) (A, B: Input, Z: Output) B A Z B A Z B A Z A k B k C k (2) Sau đây là hình v b cng đy đ, thc hin vic cng các s nh phân theo tng ch s có tính ti vic nh. Bng đc di đây là bng chân lí cho b cng đy đ đó. Full adder k C k+1 Z k A k , B k : Input C k : Carry from k-1th digit C k+1 : Carry to k+1th digit Z k : Output Hình v. B cng đy đ (ch s th k) Bng: Bng chân lí cho b cng đy đ u vào u ra C k A k B k C k+1 Z k 0 0 0 0 0 0 0 1 0 1 0 1 0 0 1 0 1 1 1 0 1 0 0 0 1 1 0 1 1 1 0 1 0 1 1 1 1 1 5 Sub-Question 1 From the answer group below, select the correct answer to insert in the blank box in the truth table of the full adder. Answer group: a) 0 0 b) 0 1 c) 1 0 d) 1 1 Sub-Question 2 From the answer group below, select the correct answer to insert in the blank box in the logical circuit of the full adder. Z k A k C k C k+ 1 B k Answer group: a) b) c) 6 Câu hi con 1 T nhóm câu tr li di đây, hãy chn câu tr li đúng đ đin vào hp trng trong bng chân lí ca b cng đy đ. Nhóm câu tr li: a) 0 0 b) 0 1 c) 1 0 d) 1 1 Câu hi con 2 T nhóm câu tr li di đây, hãy chn câu tr li đúng đ đin vào hp trng trong mch logic ca b cng đy đ. Z k A k C k C k+ 1 B k Nhóm câu tr li: a) b) c) 7 Sub-Question 3 When a logical circuit is configured with full adders to add n-digit binary numbers represented as two’s complement, the addition of the most significant digits (A n , B n and C n ) causes an overflow (the shaded part of the full adder truth table). A logical circuit for detecting this can be configured with one XOR. Select from the answer group below the correct combination of X and Y inputs to this logical circuit. Full adder 1 Z 1 C 2 Full adder 2 Z 2 Full adder n Z n C n+1 (Overflows when V = 1 ) A 1 B 1 C 1 A 2 B 2 C 2 A n B n C n Note: C 1 is set to "0". V X Y C 3 Answer group: a) A n , B n b) A n , Z n c) B n , Z n d) C n , C n+1 e) C n , Z n f) C n+1 , Z n [...]... variables, etc • Variable Value {statement} Condition expression • Process 1 • Process 2 Condition expression • Process Substitutes expression value for variable Writes comment Indicates selection When the condition expression is true, process 1 is executed When false, process 2 is executed Indicates looping with the termination test at the top While the condition expression is true, the process is executed... of S3 to S2 is ¦ S1 S0 ¡ S2 S3 Figure 2 State Transition Diagram of Flags Answer group for “a”: a) red flag up and white flag up b) red flag up and white flag down c) red flag down and white flag up d) red flag down and white flag down Answer group for “b” and “c”: a) raise the red flag b) lower the red flag c) raise the white flag d) lower the white flag 33 ... raise the red flag, lower the red flag, raise the white flag, lower the white flag, and move neither flag (when a response is not detected within the response detection time) The program detects the player’s response If correct, it adds “1” to the number of correct responses and sends the correct response window to the output device If incorrect, it sends the incorrect response window to the output... internally holds the current status of the flag Red flag status: Up or Down White flag status: Up or Down (2) The program reads the initial value file and sets the initial status of both the red flag and white flag to “Down” Initial value file format Response detection time (3) Incorrect response window display time No of repetitions The program randomly selects a flag for the raise/lower instruction... transition diagram of the flags Which of the statements listed c a through in the following description below correctly complete blanks about Figure 2? S0 indicates the initial status and the “raise the red flag” response corresponds to state a transition ¦ from S0 to S1 In this case, S1 is the state And, the response b corresponding to state transition of S3 to S0 is and that for state transition... incorrect, it sends the incorrect response window to the output device and, after the incorrect window display time in the initial value file has elapsed, it sets the flag in the window to the correct state The programs repeats steps (3) through (5) the number of repetitions written in the initial value file The program sends the player’s score to the output device 31 [Gi i thích ch ng trình] (1) Ch ng trình... N Y N N Y Y N Answer group for “b”: a) X X – – b) X X – – X X – X – X – d) X X X – – c) X X – – X X – – X X X X e) – – – – X – – X X – – – – – X X X – X – X – – X X 11 – – X Title of Table Conditions Condition description Condition specification Actions Action description Action specification Description Specification Câu h i con 1 M u nào trong các m u d trong b ng quy t i ây i n úng cho các ch tr... ¥500 food allowance – – – – X X Pay ¥10,000 lodging expense Actions N Pay ¥500 per diem Conditions Less than 20 km one-way N N X – X – X – a b X – X – Note: In the Conditions section, “Y” means true, “N” means false and “-” means neither true nor false (not applicable) In the Actions section, “X” means the condition has been satisfied and the action specified for that line is taken, whereas “-” means... tính khác c a các th t c, bi n, v.v • Variable Value {statement} Condition expression • Process 1 • Process 2 Condition expression • Process Th bi u th c value vào variable Vi t l i chú thích Ch ra l a ch n Khi condition expression là úng, process 1 Khi sai, process 2 c th c hi n Ch ra chu trình v i phép ki m tra k t thúc nh Khi condition expression là úng, process 22 c th c hi n c th c hi n [Program]... Hành ng, “X” ngh a là i u ki n c tho mãn và hành ng ch ra dòng ó c th c hi n, trong khi “-” ngh a là hành ng không c th c hi n Các ph n cho b ng quy t nh này c t tên nh sau 10 Title of Table Conditions Condition description Condition specification Actions Action description Action specification Description Specification Sub-Question 1 Which of the following patterns correctly complete blanks a and in . 19 2003 VITEC Class II Information Technology Engineer Examination - Afternoon Fundamental IT Engineer Examination (Afternoon) Questions must be answered in accordance with the following:. HIGH TECH PARK MANAGEMENT BOARD VIETNAM IT EXAMINATION AND TRAINING SUPPORT CENTER (VITEC) FUNDAMENTAL INFORMATION TECHNOLOGY ENGINEER EXAMINATION 26 th January 2003 . below each digit. (2) Date of Birth Write your date of birth (in numbers) exactly as it is printed on your examination admission card, and mark the appropriate space below each digit. (3) Question