0% found this document useful (0 votes)
81 views

CAPE Computer Science Unit 2 2019 p1

I do not own copyrights

Uploaded by

Bianca Jeffers
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
81 views

CAPE Computer Science Unit 2 2019 p1

I do not own copyrights

Uploaded by

Bianca Jeffers
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 12
no g z FORM TP 2019183 ‘CANDIDATES RLEASENGT PRINT our aameon theline below and return Se rae | Testcope 02215010 MAY/JUNE 2019 CARIBBEAN EXAMINATIONS COUNCIL CARIBBEAN ADVANCED PROFICIENCY EXAMINATION® COMPUTER SCIENCE, UNIT 2~ Paper 01 T hour 30 minutes 11 JUNE 2019 (a.m.) READ THE FOLLOWING INSTRUCTIONS CAREFULLY. ‘This test consists of 45 items. You will have I hour and 30 minutes to answer them. In addition to this test booklet, you should have an answer sheet, Do not be concerned that the answer sheet provides spaces for more answers than there are items in this test. Each item in this test has four suggested answers lettered (A), (B), (C), (D). Read each item you ‘are about to answer and decide which choice is best. On your answer sheet, find the number which corresponds to your item and shade the space having, the same letter as the answer you have chosen. Look at the sample item below. Sample Item How many selection lines does an 8 = | multiplexer hav ‘Sample Answer wt ©©@0 (B) 2 © 3 (~D) 8 ‘The best answer to this item is 3", so (C) has been shaded. If you want to change your answer, erase it completely before you fill in your new choice. When you are told to begin, turn the page and work as quickly and as carefully as you can. Ifyou cannot answer an item, go on to the next one. You may return to that item later. You may do any rough work in this booklet. Figures are not necessarily drawn to seale. The use of silent, non-programmable calculators is allowed. DO NOT TURN THIS PAGE UNTIL YOU ARE TOLD TO DO SO. inations Council Copyright © 2018 Caribbean Exan All rights reserved 02215010/MI/CAPE 2019 710 ‘x00 70 ‘A000 ie 2 3. A queue is implemented using a one- dimensional array. Which of the following BEST describes the dequeue operation performed using the array? (A) Retum the last element in the array. (B) Return the first element in the array and shift the remaining elements up one place. (C) Check that the queue is not empty, then return the first element in the array and shift the remaining elements up one place. (D) Check that the queue is empty then return the first element in the array and shift the remaining elements up one place. Items 2 and 3 refers to the following list of creatures. frog, ant, dog, grasshopper, bee, fish, snake Which of the following lists will NOT be obtained at any point while applying the selection sort algorithm? (A) ant, frog, dog, grasshopper, bee, fish, snake (B) ant, bee, frog, dog, grasshopper, fish, snake (©) ant,bee, dog, fish, frog, grasshopper, snake (D) ant, bee, dog, grasshopper, frog, fish, snake Assume that the list is sorted. When searching the sorted list, which of the following will be found the fastest using binary search? (A) ant (B) dog © fish (D) grasshopper (02215010/MJ/CAPE 2019 Item 4 refers to the following diagrams. Figure | below shows the state of a stack before the POP operation is performed. igure 2 shows the state after the POP operation is performed. Which of the following combinations of arrows correctly identifies the top of the stack structures? Figure 1 | -——— u a im 2 Iv N +a: Figure 2 ¥. z vi a vu N vu (A) Land Vv (B) Hand VI (© Mand Vi (D) Wand VII GO ON TO THE NEXT PAGE no ‘A000 Item 5 refers to the following diagrams which show two items stored in a queue. Initial State FRONT REAR Final State FRONT — REAR 4 + aiewaieEsi] 5. Which sequence of operations would transform the queue from the initial state to the final state? (A) DEQUBUE, ENQUEUE(K), ENQUEUE(L) (B) — ENQUEUE(L), ENQUEUE(K), DEQUEUE (©) DEQUEUE, DEQUBUE, ENQUEUE(L), ENQUEUE(K), ENQUEUE() (D) _ DEQUEUE, DEQUEUE, ENQUEUE(), ENQUEUE(K), ENQUEUE(L) Item 6 refers to the following diagram. e | e >| @ nu 6. Which of the following operations is associated with the ADT above? (A) Pop (B) Insert (©) Enqueue (D) —Dequeue GO ON TO THE NEXT PAGE 02215010/MJ/CAPE 2019 10 ‘ag00 no 000 % Item 7 refers to the following arrays. 23 | 89| 6 23 | 50 | 89 Pieei= fees If Array 1 is implemented as a stack, and the top of the stack is indicated by the arrow, which of the following sequences of operations will result in the stack being identical to Array 2? (A) POP, POP, POP PUSH, PUSH, PUSH (B) POP, PUSH, POP, PUSH (©) POP, PUSH, PUSH, PUSH () POP, PUSH Item 8 refers to the following diagram. ATSle[rle[K[rt] If the target value is | and a binary search ‘employed, how many comparisons are made before it can be concluded that the letter I does not appear in the list? (a) 2 B) 3 © 4 @) 7 A queue is implemented using an array. A procedure to add an element to the queue would involve (A) incrementing the pointer to the front of the queue (B) incrementing the pointer to the rear of the queue (© decrementing the pointer to the front of the queue (D) _decrementing the pointer to the rear of the queue 0221S010/MI/CAPE 2019 Re 10. Item 10 refers to a segment of an algorithm for performing a linear search for farget on an array with size n. count =0 flag = false REPEAT IF (list{count] = target) THEN I ENDIF 1 UNTIL flag=true or MIT IF flag = false THEN Vv ENDIF Which of the following sequences of steps would complete the procedure? (A) 1-flag=true Il—add 1 to count II —count=n—1 IV — WRITE target not found (B) [flag = true Tadd 1 t0 count M1 —count =n 1 IV - WRITE target found (©) 1-flag= true H—add 1 to count II = count =n IV — WRITE target not found (D) I= flag = true Il add | to count HI count=n IV ~ WRITE target found GO ON TO THE NEXT PAGE 70 ‘A000 Items L1=12 refer to the following scenario. A student is asked to implement a stack using arrays. The student develops the following operations and programming statements. Operation: push(ele) pop () 1. retum ele 11, if ptr! = array_size ML ptr=ptr+1 WV. tr 1 v. fata [ptr] VI fata [ptr + 1] VII. data [ptr] = ele VIII. data [ptr 1] =ele. IX. if (ptr! =-1) In the scenario, data refers to the array which stores the data, ptr is the address of the last element inserted into the stack and ele is the data element being acted on. 11. Which of the following sequences below gives a working implementation for the “push (ele)' operation? (A) Vill, 1, 1 () VIL, IV, IL © tt, vu © iit 12. Which of the following sequences below gives a working implementation for the “pop ()) operation? @ IX NILE ®) ILV.IVI (© VLIVILI ©) IXY IYE 02215010/MJ/CAPE 2019 a 13. Item 13 refers toa segment of an incomplete algorithm for sorting an array list of size n using a bubble sort. REPEAT flag = false FOR pos = I ton—1 DO IF(list{pos}>list[pos + 1]) THEN 1 " Mm Vv END IF END FOR subtract I from n UNTIL flag = false or n =1 Which of the following sequences would complete the algorithm? (A) [flag = true I= ist{pos] = list{pos * 1] III ~ temp = list{pos] 1V=list{[pos +1] =temp (8B) Itemp = list{pos] II list{pos] = list[pos + 1) III list{pos + 1] = temp IV flag = true (©) [-flag = true temp = list{pos] III = list{pos + 1 1V=list{pos] (D) — I-temp st[pos] T1=[istfpos + 1] = temp III = list{pos] = list{pos + 1] IV flag = true GO ON TO THE NEXT PAGE 10 ‘A000 710 ‘A000 14. B- ‘tem 14 refers to the following segment of 15. analgorithm for performing a selection sort on an array /ist in ascending order. FORi=0ton—2D0 min =i FORj=i+1ton—1DO IF 1 THEN min=j END IF SWAP list[i] and I END FOR END FOR Which of the following sequence of steps would correctly complete the algorithm? (A) I-listfj] list{min} = list{min] © ist{j] < list{min] tL] ©) list] > list{min] 11 listfj] 02215010/MJ/CAPE 2019 If the elements P, T, 8, Rand Q are added to a queue in that order and then removed one at a time, in what order will they be removed? (A) (B) © () GO ON TO THE NEXT PAGE no ‘000 site 16. Which ofthe following diagrams does NOT violate any rules for constructing data flow diagrams? ake (A) | Passenger aoe (8) | Passenger be» (© | Passenger (D) | Passenger 17. A feasibility study 18. Which of the following graphical tools is MOST suitable for showing howa software (A) describes a cost effective means of development project and its subtasks developing the proposed system should be completed within a specified (B) discusses whether the proposed timeframe? system will be cost effective (© is usually a lengthy and costly (A) Data flow diagram process (B) System flowchart (D) describes how current software and (©) Decision tree hardware can be used to develop (D) Gantt chart the proposed system GO ON TO THE NEXT PAGE (0221501 0/MJ/CAPE 2019 0 ‘A000 70 ‘A000 S 19, Which of the following terms represent types of software maintenance? 1 Adaptive _ I. Corrective Il Defective (A) Land Ionly (B) Land Il only (© Wand It only ©) 1 Mand mt 20. (A) Useful documentation (B) Consistent, meaningful variable names (©) Pieces of code with well-defined purpose (D) Code that provides functionality not currently used, but which will possibly be used in the future 21. Which of the following is considered a functional requirement? (A) Inputs (B) _ Reusability (©) Availability (D) Response time 22, When the individual modules of a software system were tested, no errors were discovered. However, when all the modules were merged and tested, the system failed. Which of the following would MOST likely help in identifying the failure? (A) Acceptance testing (B) Integration testing © Te live data (D) Testing individual modules 02215010/MJ/CAPE 2019 23. 24, 26. Which of the following is NOT a tenet of good programming style? (A) Using comments for documentation (B) Appropriately spacing code (C)__ Indenting where necessary (D) Fixing logic errors Which of the following design processes refers to the identification of subsystems and their relationships? (A) Architectural (B) Data structure (©) Component (D) Interface tem 25 refers to the following scenario, A car dealer uses a relational database to store data on the orders made by customers, the types of cars in stock and payments made. How many entities can be identified? (A) One (B) Two (© Three () Four Which life cycle model approach is BEST suited for a system with critical safety and security requirements? (A) Waterfall approach, since software is well structured (B) Evolutionary development, since any security problems can be easily rectified by creating anew system (©) Fountain approach, since any secutity problems can be easily rectified by further iterations (D) Formal transformation, since itcan be proven that the system fulfils requirements GO ON TO THE NEXT PAGE no ‘9000 27. 28, 29, ‘A small company with fewer than ten employees is interested in replacing its existing paper-based system with a software application. Which of the following is MOST appropriate for gathering information during analysis? (A) Distributing questionnaires to employees and clients of the company (B) Researching company practices on the Internet (C)__ Interviewing priority clients of the company (D) Interviewing key people at the ‘company Which of the following is LEAST helpful in an error message presented to a user? (A) System-specific terms (B) —_User-oriented language (C)__ Description of the error (D) Many options for recovery In database modelling, an ‘attribute’ is (A) an object of interest to an organization about which data is stored (B) a link or association between entities (©) a property or characteristic of an entity (D) a property or characteristic of an ‘organization 02215010/MI/CAPE 2019 30, 31. 32. Software evolution refers to (A) improving software by addressing bugs (B) developing new software from an existing system (C) automatically adapting software to changing customer needs and wants (D) modifying software to satisfy changes in customer and market requirements A process is said to be blocked when. (A) the CPU is unavailable (B) _ithas now entered the system (C)___itiswaiting for /O and cannot use the CPU even if it were free (D) processes with higher priority are given CPU time A.clientis interested in setting up a wireless LAN for his place of business. Very high data rates (30 Mbps—40 Mbps) are critical tothe network applications of this business. Which standard should be employed, 802.11a or 802.1 1b? (A) 802.11a, since it can support the desired data rates. (B) 802.11b, since it can support the desired data rates. (©) 802.11a or 802.11b will give similar performance since these standards do not differ in data rates. (D) Neither $02.11 or 802.11b since they do NOT support transmission over a large distance. GO ON TO THE NEXT PAGE m0 ‘A000 no 23, 35. -10- Which of the following phrases BEST describes ‘paging"? (A) The division of documents into smaller chunks : (B) The assignment of chunks of a program called frames to main memory called pages (C) The assignment of chunks of a progam called frames to different secondary storage media 36. (D) The assignment of chunks of a program called pages to chunks of memory called frames A webmaster has decided to design his website offline and upload the various files and graphics to the web server remotely. 37. Which of the following would be BEST suited for providing the fastest and MOST secure method of uploading the data? (A) FIP (8) GSM (© UML @) HTML 38, Which of the following features enable a user to run multiple programs, such as a web browser, word processor and media player if RAM is too small to hold them all? (A) Folders (B) Cache (© — Buffers (D) Virtual memory 0221S010/MJ/CAPE 2019 ‘tem 36 refers to the following diagram, ee Resource B Resource A. Sie What does the diagram above represent (A) Deadlock (B) Interrupt (©) Round robin (D) __ Fetch-decode-execute cycle Which of the following outcomes relat to the use of virtual memory? (A) Ensures that all programs are | memory (B) _Createsanillusionthatthe comput has more memory (C)__ Ensures that memory works fast (D)__ Results in faster execution speed Which of the following determines amount of time a running process ge to use the CPU when a round-robi scheduling algorithm is used? (A) The priority of the process (B) The estimated running time of th process (C) The time is fixed by the operatia system (D) The order of arrival of the proces ‘on the ready queue GO ON TO THE NEXT PAG| m0 ‘A000 39, The term “firewire’ refers to a (A) (B) © ©) type of cabling that allows communication between computers software running on a computer that protects it from external attacks high-speed serial bus system type of computer virus Item 40 refers to the following diagram. Y and X respectively represent a “ (B) © () hub and node server and hub workstation and node workstation and server 1em 4] refers to the following diagram. compurer SILI fuoven\ /\ /\/1 IMopem|-! LI Lfcomputer’ 41. The diagram BEST illustrates (A) (B) © (@) multiplexing and expandibility modulation and demodulation addressing routing 42. Which of the following terms refers to a state when an excessive amount of CPU time is spent swapping data between RAM and auxiliary storage? (A) (B) © () Paging ‘Thrashing Partitioning, Fragmenting 02215010/MJ/CAPE 2019 re GO ON TO THE NEXT PAGE m0 ‘000 43. 44, -12- Inanetwork where the running applications 45. generate a significant amount of traffic, which of the following devices would NOT be suitable? (A) Hub (B) Switch (©) Router (D) Bridge Which of the following statements is true about a process being scheduled with a non-preemptive algorithm? (A) tis placed at the top of the ready queue if it has a higher priority than all the processes already in the queue. (B) Once it enters the running state, it is allowed to run to completion or until it yields the processor. (©) Once it enters the running state, it is given a fixed amount of time touse the CPU after which other processes get a chance to use the CPU. (D) Once it enters the running state, it is, given a variable amount of time to.use the CPU depending on its priority. END OF TEST Arunning process initiates = input request to get data from the keyboard. Which of the following state transitions wall take place when the data is made available? (A) Ready to running (B) Running to ready (©) Blocked to ready (D) Blocked to manning IF YOU FINISH BEFORE TIME IS CALLED, CHECK YOUR WORK ON THIS TEST. 02215010/MI/CAPE 2019

You might also like