Scribd
Upload
100 views

Cape Computer Science 2015 Unit 2 P2

Cape Computer Science 2015 Unit 2 P2

Uploaded by

dnitehawk q
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
100 views

Cape Computer Science 2015 Unit 2 P2

Cape Computer Science 2015 Unit 2 P2

Uploaded by

dnitehawk q
Copyright
© © All Rights Reserved
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 7
Ce. rest cope 02215020 FORM TP 2015167 . MAY/JUNE 2015 CARIBBEAN EXAMINATIONS COUNCIL CARIBBEAN ADVANCED PROFICIENCY EXAMINATION® COMPUTER SCIENCE FURTHER TOPICS IN COMPUTER SCIENCE UNIT 2 - Paper 02 2 hours 30 minutes 18 MAY 2015, READ THE FOLLOWING INSTRUCTIONS CAREFULLY. 1. This paper consists of THREE sections. 2. EACH section consists of TWO questions. 3. Answer ALL questions in the THREE sections. DO NOT TURN THIS PAGE UNTIL YOU ARE TOLD TO DO SO. Copyright © 2014 Caribbean Examinations Council All rights reserved. 02215020/CAPE 2015 2- SECTION A DATA STRUCTURES Answer BOTH questions. (a) Why are stacks and queues classified as ADTS? [2 marks} (b) Describe the main differences between stacks and queues. Support your answer by giving a real-life example to illustrate how EACH ADT can be used. Note: An example should be given for each ADT. [6 marks} (©) Use C code to: (i) Write a function that adds an integer to a stack. The arguments for your function should be the stack and the number to be added. Your function should not call any other functions. [7 marks} (ii) Write a function that adds an integer to a queue. The arguments for your function should be the queue and the number to be added. Your function should not call any other functions. [7 marks} (d) Letters A, C, X and E have been added to a stack in the given order, Draw a diagram to illustrate how the letter C could be removed from this stack. Use the diagram to show the changing contents of the stack at EACH stage of the process. [3 marks} ‘Total 25 marks GO ON TO THE NEXT PAGE, 02215020/CAPE 2015 El (@) (b) © -3- Consider the array called data below, au | 10 3} s flees Cli 4 A selection sort algorithm is being used to sort the eight integers in aseending order (that is, smaller values must come before bigger values). Draw the array after the first, second and third passes of selection sort (that is, 3 diagrams inal). [6 marks} ‘A linked list contains three nodes with the integers 3, 4 and 5, where 3 is at the head of the list, 4 is in the middle and 5 is at the end. (i) Draw a diagram to show the linked list. [3 marks] (ii) Explain how to delete the integer 3 from the linked list. [4 marks} Assume that an array, numbers, of size 50 is already loaded with 50 integers and sorted in ascending order. (i) Write code to obtain the value of an integer, target, from the user. [2 marks} (ii) Using the array, numbers, write code to search for the value, target, using binary search, If target is found, print its location, otherwise print—1. [Target is the value obtained from the user in (¢) (i) above.] [10 marks} Total 25 marks GO ON TO THE NEXT PAGE 02215020/CAPE 2015

You might also like