NATIONAL SENIOR CERTIFICATE GRADE 12

Size: px
Start display at page:

Download "NATIONAL SENIOR CERTIFICATE GRADE 12"

Transcription

1 NATIONAL SENIOR CERTIFICATE GRADE 12 INFORMATION TECHNOLOGY P1 NOVEMBER 2014 MARKS: 150 TIME: 3 hours This question paper consists of 22 pages.

2 Information Technology/P1 2 DBE/November 2014 NSC INSTRUCTIONS AND INFORMATION 1. This paper is divided into THREE sections. Candidates must answer ALL THREE sections. 2. The duration of this examination is three hours. Because of the nature of this examination it is important to note that you will not be permitted to leave the examination room before the end of the examination session. 3. This paper is set in programming terms that are not specific to any particular programming language (Delphi/Java (using the Netbeans IDE)). 4. Make sure that you answer the questions according to the specifications that are given in each question. Marks will be awarded according to the set requirements only. 5. Answer only what is asked in each question. For example, if the question does not ask for data validation, then no marks will be awarded for data validation. 6. Your programs must be coded in such a way that they will work with any data and not just the sample data supplied or any data extracts that appear in the question paper. 7. Routines such as search, sort and selection must be developed from first principles. You may not use the built-in features of a programming language for any of these routines. 8. All data structures must be defined by you, the programmer. You may not use components provided within the interface to store and later retrieve data. 9. You must save your work regularly on the disk you have been given, or the disk space allocated to you for this examination session. 10. Make sure that your examination number appears as a comment in every program that you code as well as on every event indicated. 11. If required, print the programming code of all the programs/classes that you completed. You will be given half an hour printing time after the examination session. 12. At the end of this examination session you must hand in a disk/cd/dvd/flash disc with all your work saved on it OR you must make sure that all your work has been saved on the disk space allocated to you for this examination session. Ensure that all files can be read.

3 Information Technology/P1 3 DBE/November 2014 NSC 13. The files you need to complete this question paper have been given to you on a disk/cd/dvd/flash disk or the disk space allocated to you in the form of a password-protected executable file: Delphi learners must use the file DelphiDataENG.exe Java learners must use the file JavaDataENG.exe Do the following: Double click on the file Click on the extract button Enter the following password: Transport@(!$ List of files provided in the folder DelphiDataENG/JavaDataENG (once extracted): Delphi files Question1: Question1_P.dpr Question1_P.res Question1_U.dfm Question1_U.pas Question2: Delivery_U.pas DeliveryInfo.txt Question2_P.dpr Question2_P.res Question2_U.dfm Question2_U.pas Question3: Question3_P.dpr Question3_P.res Question3_U.dfm Question3_U.pas Java (Netbeans) files Question1: Question1.form Question1.java Question2: Delivery.java DeliveryInfo.txt Question2.form Question2.java Question3: Question3.form Question3.java

4 Information Technology/P1 4 DBE/November 2014 NSC SCENARIO: SuperTrans Courier Services is a national transport company with branches throughout South Africa. You are requested to assist with some of the software applications the company intends to implement shortly. SECTION A QUESTION 1: GENERAL PROGRAMMING SKILLS INSTRUCTIONS: Delphi programmers The project Question1 is provided in the DelphiDataENG folder. Open the incomplete project file Question1_P.dpr in the Question1 folder. Add your examination number as a comment in the first line of the main form unit (Question1_U) file. Java programmers The project Question1 is provided in the JavaDataENG folder. Open the incomplete class called Question1.java contained in the folders Source Packages (src), Question1Package. Add your examination number as a comment in the first line of the class (Question1). Do the following: Compile and execute the program. The interface displays five different sections labelled Question 1.1 to Question 1.5. The program currently has no functionality. An example of the interface is given below:

5 Information Technology/P1 5 DBE/November 2014 NSC Complete the code for each section of QUESTION 1 as described in QUESTIONS 1.1 to QUESTION 1.5 below. 1.1 Button [Confirm Delivery] Obtain the following data from the relevant components: Place of departure from the Place of Departure combo box Destination from the Destination combo box Number of kilometres from the Kilometres text box Create a line of text as output that indicates the place of departure, the destination and the number of kilometres as shown in the example below. Place the constructed line of text in the label component provided. Example of possible input: Required output: (5) 1.2 Button [Delivery cost] The following components are provided: A list box that indicates the weight categories of deliveries in terms of codes (A1 A4) in the following format: <code><space><(range in kg)> The following tariffs per weight category apply: Category A1 A2 A3 A4 Tariff per kilometre R0,60 R1,00 R1,25 R1,65

6 Information Technology/P1 6 DBE/November 2014 NSC A check box that indicates whether speed post must be used. A standard amount of R100,00 is charged for speed post. When the user clicks on the Delivery cost button the number of kilometres entered in QUESTION 1.1, the selected weight category and whether speed post is required or not must be used to calculate the delivery cost. Example of the output if the number of kilometres is 635, the weight of the item to be delivered is in the A2 category and speed post is required: (10) 1.3 Button [Delivery box number] Items to be delivered need to be placed in specific delivery boxes. The correct delivery box for each individual item must be determined using the criteria below: There are five delivery boxes numbered from 1 to 5. All speed post items will be placed in delivery box 4. All the other delivery items will be randomly placed in the remaining delivery boxes (1, 2, 3 or 5). Display the number of the delivery box into which the item must be placed. Example of output if speed post was requested in QUESTION 1.2 (on the next page):

7 Information Technology/P1 7 DBE/November 2014 NSC Example of output when speed delivery is NOT required in QUESTION 1.2: NOTE: Due to the nature of the random function the value for the delivery box displayed in the screenshot above may differ from the value displayed by your program. (9) 1.4 Button [Validate bar code] A Universal Product Code (UPC) bar code is printed on items to be delivered. The picture on the next page shows an example of a UPC bar code:

8 Information Technology/P1 8 DBE/November 2014 NSC The bar code number consists of twelve digits. For example, the bar code number shown in the picture above is The last digit of a UPC is called a check digit. The check digit is used by a scanner to determine whether a bar code is valid or not. Use the algorithm below to write code for the Validate bar code button. The code needs to verify the check digit and display a message to indicate whether the bar code is valid or not. Algorithm: 1. barcode text box value 2. sumoddpositions 0 3. sumevenpositions 0 4. loop from first digit to second last digit of barcode 5. if the logical position of the digit in the bar code is even sumevenpositions sumevenpositions + digit at position else sumoddpositions sumoddpositions + digit at position 6. sum sumoddpositions * 3 + sumevenpositions 7. checkdigit 10 (sum modulus 10) 8. if checkdigit = last digit of barcode display the check digit and a suitable message indicating that the bar code is valid else display a suitable message indicating that the bar code is invalid Example: If the bar code is then: sumoddpositions = = 32 sumevenpositions = = 11 Example of a possible output for a valid bar code:

9 Information Technology/P1 9 DBE/November 2014 NSC Example of a possible output for an invalid bar code: (14) 1.5 Button [View and save deliveries] All deliveries for December 2014 are stored in the given array called arrdecdeliveries. The format of each entry in the array is as follows: <date><space><place of departure><space>to<space><destination> Example: Durban to Cape Town The user has to select a city from the provided combo box. All the deliveries that were made during December 2014 to or from the selected city must be displayed in the provided output area and also written to a text file. Write code to do the following: Create a text file where the name of the file is made up of the text 'December2014' combined with the name of the city that was selected. Example: If Durban was selected, the name of the text file must be December2014Durban.txt. Use the data stored in the arrdecdeliveries array and display the deliveries to and from the selected city in the output area provided. Use the name of the city as a heading. Store the deliveries to and from the selected city in the text file that was created one delivery per line.

10 Information Technology/P1 10 DBE/November 2014 NSC Example of the contents of the output area if the city of Durban is selected: Example of the contents of the December2014Durban.txt text file: (12) Enter your examination number as a comment in the first line of the program file. Save your program. A printout of the code may be required. TOTAL SECTION A: 50

11 Information Technology/P1 11 DBE/November 2014 NSC SECTION B QUESTION 2: OBJECT-ORIENTATED PROGRAMMING SuperTrans Courier Services owns five trucks. The trucks are classified as light, medium or heavy-duty trucks. The trucks are used on four different routes (RN1 to RN4) to deliver cargo. INSTRUCTIONS: Delphi programmers The project Question2 is provided in the DelphiDataENG folder which contains: o o o A main form unit called Question2_U.pas An incomplete unit file called Delivery_U.pas A text file (DeliveryInfo.txt) that contains information on deliveries Open the incomplete project file called Question2_P.dpr in the Question2 folder. View (Ctrl + F12) the unit file Delivery_U.pas and add your examination number as a comment in the first line of both files Question2_U.pas and Delivery_U.pas. Java programmers The project Question2 is provided to you in the JavaDataENG folder which contains: o A GUI class file called Question2.java o An incomplete object class file called Delivery.java o A text file (DeliveryInfo.txt) that contains information on deliveries Open the incomplete classes called Question2.java and Delivery.java in the folders Source Packages (src), Question2Package. Add your examination number as a comment in the first line of both classes Question2.java and Delivery.java. Do the following: Compile and execute the program. The program currently has no functionality. An example of the interface is shown on the next page:

12 Information Technology/P1 12 DBE/November 2014 NSC Complete the code for this program as specified in QUESTION 2.1 and QUESTION 2.2 below. 2.1 The given incomplete object class (TDelivery/Delivery) contains the following code: The declaration of five attributes which describes a delivery object The declaration of a two-dimensional array to be used to determine toll fees A tostring method The attributes of a delivery object are the following: Names of attributes Delphi Java Description fdeliverynum deliverynum Number assigned to a specific delivery, for example 1, 2, et cetera ftrucknum trucknum Truck number, for example Tr1, Tr2, Tr3, Tr4 or Tr5 ffuelused fuelused Fuel used during the delivery fodostart odostart Odometer reading at the start of the delivery fodoend odoend Odometer reading on completion of the delivery

13 Information Technology/P1 13 DBE/November 2014 NSC Complete the code in the given delivery class (TDelivery/Delivery) as described in QUESTION to QUESTION below: Write code for a constructor method to receive the delivery number, truck number, odometer reading at the start of the delivery and odometer reading on completion of the delivery as parameter values. Assign these values to the relevant attributes of the object class. (3) Write a mutator method and an accessor method for the ffuelused/fuelused attribute. (4) Write a method called calculatedistance to calculate and return the distance travelled based on the start and end odometer readings for the delivery. (3) Different toll fees must be paid on different toll routes. The routes used are RN1, RN2, RN3 and RN4. Toll fees on these routes are dependent on the type of truck used. The company's trucks are classified as follows: Light-duty trucks: Tr1, Tr2 Medium-duty truck: Tr3 Heavy-duty trucks: Tr4, Tr5 A two-dimensional array called tollfees contains the toll fees for the different routes for different types of trucks and is supplied as part of the given code. The contents of the array can be represented as follows: Light-duty truck Medium-duty truck Heavy-duty truck RN1 R105,50 R135,00 R210,00 RN2 R35,00 R54,00 R82,00 RN3 R85,00 R129,00 R205,00 RN4 R112,00 R170,00 R219,00 Rows: Columns: Represents the routes RN1 to RN4 Represents the types of trucks Write a method called determinetollfees to determine and return the toll fees to be paid for the delivery. The method must receive the route (RN1, RN2, RN3 or RN4) as a parameter. Use the two-dimensional array called tollfees to look up the toll fee for the route and type of truck that was used for the delivery. NOTE: It is compulsory to use the given two-dimensional array in your solution to look up the toll fee. (10)

14 Information Technology/P1 14 DBE/November 2014 NSC 2.2 A text file named DeliveryInfo.txt contains an unknown number of lines of information on previously completed deliveries. Each line of information contains data on a single delivery in the following format: <delivery number>#<truck number>#<odometer reading on completion of the delivery> Example of some of the data in the text file named DeliveryInfo.txt: 1#Tr1# #Tr2#8010 3#Tr3# #Tr4#700 5#Tr1# #Tr3#15653 : The data of the first delivery can be interpreted as follows: Delivery 1 identifies the delivery. Truck Tr1 was used to make the delivery. The reading on the odometer on completion of the delivery was Do the following to complete the code for each button in the main form unit (Delphi)/GUI class (Java) as described below: Button [Get data from file] Select the specific truck to be used from the provided Truck number combo box. Use the given text file DeliveryInfo.txt to determine the following: o o New delivery number The delivery number for the new delivery will follow on the number of the last delivery stored in the text file. If the information of 20 deliveries are stored in the text file, the number of the new delivery will be 21. Start odometer reading The odometer reading for the last delivery that was made by the selected truck must be used as the start odometer reading for the new delivery. Example: If truck Tr4 is selected and the odometer reading that was captured in the text file on completion of the last delivery for Tr4 is 1648, then the value of 1648 must be used as the odometer reading at the start of the new delivery.

15 Information Technology/P1 15 DBE/November 2014 NSC Display the new delivery number and start odometer reading in the text boxes provided. Display a suitable message in a dialog box and terminate the program if the text file cannot be accessed. Example of the content of the relevant text boxes when truck Tr4 is selected: NOTE: If you are unable to read the required information from the given text file, type in the number and the start odometer reading for the delivery into the text boxes to continue with the rest of the program. (14) Button [New delivery] To instantiate a new Delivery object, the user needs to first enter the end odometer reading for the delivery in the textbox provided. NOTE: The end odometer reading entered by the user must be greater than the previous odometer reading of the truck, because it is the start odometer reading for this delivery. No validation is necessary. NOTE: The Delivery object variable has already been declared globally as part of the given code.

16 Information Technology/P1 16 DBE/November 2014 NSC Write code for the New delivery button to do the following: Use the new delivery number, the truck number, the odometer reading at the start and the odometer reading at the end of the delivery to instantiate the Delivery object. Display a message indicating that the object has been instantiated successfully. Obtain the distance travelled by calling the calculatedistance method and calculate the estimated litres of fuel used for the delivery. Use the following information: One litre of fuel is used for every five kilometres travelled. Use the method you have written in QUESTION 2.1 to set the ffuelused/fuelused attribute to this calculated value. NOTE: The following buttons must be enabled: Check fuel used Calculate toll fees (10) Button [Display delivery] Display the object in the output area provided using the tostring method. Example of the output for truck Tr4 with an end odometer reading of 2000: (2)

17 Information Technology/P1 17 DBE/November 2014 NSC Button [Check fuel used] The driver of the truck is required to refill the fuel tank at the end of each delivery. Due to the nature of the routes, the amount of fuel used to refill the tank may sometimes differ from the fuel calculated for the delivery. Write code to do the following: Enter the amount of fuel used to refill the tank in the text box provided. HINT: The value of 75 can be used to test the code. Obtain the calculated amount of fuel used from the relevant attribute in the object class. Calculate the difference between the fuel used to refill the tank and the calculated fuel used as stored in the attribute of the Delivery object. o If the difference is less than 10%, the ffuelused/fuelused attribute must be updated by setting its value to the new value as entered in the text box. An appropriate message must be displayed in the text box provided, indicating whether the value of the ffuelused/fuelused attribute has been updated or not. Example of the output if the delivery was done by truck Tr4 and the actual fuel used is 75,0: o If the difference is greater than or equal to 10%, an error message should be displayed and the value of the ffuelused/fuelused attribute must not be updated.

18 Information Technology/P1 18 DBE/November 2014 NSC Example of the output if the delivery was done by truck Tr4 and the actual fuel used is 85,0: (9) Button [Calculate toll fees] To determine the toll fees for the route used for the new delivery, the route number (for example RN3) must be entered in the text box provided. This route number must be sent as a parameter to the determinetollfees method. The toll fees must be displayed in the label component provided. The amount must be displayed as currency (rand) to TWO decimal places. Example of the output if the delivery was done by truck Tr4 on route RN3: (5) Ensure that your examination number is entered as a comment in the first line of the class as well as the form. Save all the files. Print code you created for both the classes, if printouts are required. TOTAL SECTION B: 60

19 Information Technology/P1 19 DBE/November 2014 NSC SECTION C QUESTION 3: PROBLEM-SOLVING SuperTrans Courier Services provides a daily speed service from Cape Town to Johannesburg. The storage space in the truck used for the deliveries is divided into two shelves for fragile and non-fragile items respectively. The maximum capacity of the shelf reserved for fragile items is 20 items while a maximum of 30 items can be placed on the shelf reserved for non-fragile items. The loading zone at the company controls the clearing of a load, loading of items into the truck and checking the status of the truck load at any given time. An incomplete program has been provided to manage the loading of trucks. INSTRUCTIONS: Delphi programmers The project Question3 is provided in the DelphiDataENG folder. Open the incomplete project file Question3_P.dpr in the Question3 folder. Add your examination number as a comment in the first line of the main form unit (Question3_U) files. Java programmers The project Question3 is provided in the JavaDataENG folder. Open the incomplete class called Question3.java in the folders Source Packages (src), Question3Package. Add your examination number as a comment in the first line of the class (Question3). Do the following: Compile and execute the program. The program currently has no functionality. An example of the interface is given below.

20 Information Technology/P1 20 DBE/November 2014 NSC The output area of the GUI labelled 'Loading progress display area' represents the storage area of the truck. An asterisk (*) is used to represent an item placed on a shelf. Example of the display of a fully loaded truck with 20 fragile and 30 non-fragile items: Write code to complete QUESTION 3.1 to QUESTION 3.3 as explained in the instructions below: 3.1 Button [Load item] Write code to do the following when an item is loaded: Create a loading code. Add the item, represented by an asterisk (*), to the correct shelf in the loading progress display area. Loading code: The loading code is compiled using the letter 'F' for fragile items and the letters 'NF' for non-fragile items, followed by the sequence number of the item on the shelf. For example: F1 refers to item 1 on the shelf for fragile items. NF6 refers to item 6 on the shelf for non-fragile items. Add item to loading progress display area: If there is space on the shelf, create and display the loading code in the text box provided and update the loading progress display area to show the new item. If the item cannot be loaded, the loading code must be left empty and a dialog box must be used to display the following message: 'Loading of item cannot be processed No loading space' Example of output of the 'Loading progress display area' if the item loaded is the first non-fragile item. In this example five fragile items have already been loaded (on the next page):

21 Information Technology/P1 21 DBE/November 2014 NSC Example of an attempt to load a fragile item when the shelf for fragile items is full: (20) 3.2 NOTE: If you could not complete QUESTION 3.1, use the data below to complete QUESTION 3.2: Number of fragile items: 4 Number of non-fragile items: 13 Button [Check load status] The delivery can be made if the truck has a minimum load of: 50% fragile items (10 fragile items), and 50% non-fragile items (15 non-fragile items) When this button is clicked, a load status report must display a summary of the number of both fragile and non-fragile items, using the following column headings: Item type Number of items Percentage loaded If the percentage of items loaded is 50% or more for both fragile and non-fragile items, the message 'The delivery may progress' must be displayed.

22 Information Technology/P1 22 DBE/November 2014 NSC If the percentage of items loaded is less than 50% for fragile OR non-fragile items, then the message 'The delivery may not progress' must be displayed along with the outstanding number of items for each type required to make up the minimum load. NOTE: Marks will be awarded for column formatting and for displaying the percentage loaded to TWO decimal places. Example 1: If the load status of the truck is 4 fragile items and 10 non-fragile items, the load status report should be as follows: Example 2: If the load status of the truck is 12 fragile items and 17 non-fragile items, the load status report should be as follows: (17) 3.3 Button [Clear load] Initialise all variables and data structures to prepare for a new load. Also clear all text from the output area. (3) Enter your examination number as a comment in the first line of the program file. Save your program. A printout of the code may be required. TOTAL SECTION C: GRAND TOTAL:

23 NATIONAL SENIOR CERTIFICATE GRADE 12 INFORMATION TECHNOLOGY P1 NOVEMBER 2014 MEMORANDUM MARKS: 150 This memorandum consists of 28 pages.

24 Information Technology/P1 2 DBE/November 2014 GENERAL INFORMATION: These marking guidelines are to be used as the basis for the marking session. They were prepared for use by markers. All markers are required to attend a rigorous standardisation meeting to ensure that the guidelines are consistently interpreted and applied in the marking of candidates work.. Note that learners who provide an alternate correct solution to that given as example of a solution in the marking guidelines will be given full credit for the relevant solution, unless the specific instructions in the paper was not followed or the requirements of the question was not met Annexures A, B and C (pages 3-8) include the marking grid for each question for using either one of the two programming languages. Annexures D, E, and F (pages 9-16) contain examples of solutions for Java for Questions 1 to 3 in programming code. Annexures G, H and I (pages 17-28) contain examples of solutions for Delphi for Questions 1 to 3 in programming code. Copies of Annexures A, B and C (pages 3-8) should be made for each learner and completed during the marking session.

25 Information Technology/P1 3 DBE/November 2014 ANNEXURE A: SECTION A: QUESTION 1: MARKING GRID - GENERAL PROGRAMMING SKILLS CENTRE NUMBER: QUESTION EXAMINATION NUMBER: DESCRIPTION If a learner has a problem reading from a combo box, penalise only once for the error. 1.1 Button - [Confirm delivery] Extract departure from combobox; (to be used as text) AND Extract destination from combobox; (to be used as text) Extract the number of kilometres from text box convert to number (can also be converted in 1.2) Create the string to join departure, destination and distance and assign to the label provided 1.2 Button - [Delivery cost] Extract the choice selected from the list box Correct variable in condition All 4 possibilities (A1..A4 OR item index 0..3) Correct selection structure (if/case/switch) Use the correct tariff for each option Calculate cost: tariff x distance Check if speed post is selected, add 100 to cost Set the cost to the text box provided formatted to 1 or 2 decimal places (Accept solutions that did not consider the leading spaces) 1.3 Button - [Delivery box number] Create variable to store box number Check if speed post is selected Set box number = 4 else (could be another if statement) Generate random number in the correct range Ensure that the value is not 4 (Only one mark if generated once more) Display box number MAX. MARKS LEARNER'S MARKS

26 Information Technology/P1 4 DBE/November 2014 QUESTION 1: MARKING GRID - GENERAL PROGRAMMING SKILLS (continue) 1.4 Button - [Validate bar code] Extract the barcode Set sumodd and sumeven to 0 Loop from first to the second last digit Check if the position of the digit is even Add value of the digit (integer) at position to sumeven Else Add value of the digit at position to sumodd Multiply sumodd by 3 Add sumeven and sumodd Calculate checkdigit: Subtract total modulus 10 from 10 If checkdigit equals last digit (Must be same data types) Display appropriate message that bar code is valid Else Display message that the bar code is not valid (Display of the check digit not necessary for the if or else) 1.5 Button - [View and save deliveries] Extract the selected name of the city from the combo box Display the name of the city in the output area as a heading Create a text file with the correctly constructed name Loop from first position to last position in the array Check if city name is part of the correct array entry Display the entry in the output area if found and store the entry in the text file One delivery per line Close the text file outside loop TOTAL: 50

27 Information Technology/P1 5 DBE/November 2014 ANNEXURE B: SECTION B: QUESTION 2: MARKING GRID - OBJECT-ORIENTED PROGRAMMING CENTRE NUMBER: QUESTION DESCRIPTION EXAMINATION NUMBER: Constructor: Heading with ONLY four values Correct data types Assign parameter values to four attributes (default for fuelused can be included) Accessor and mutator METHODs: setfuelused (non return) with parameter value assigned to attribute getfuelused(return) with correct return data type calculatedistance METHOD: return type a number substract odostart from odoend (-1 if received as parameters) return answer determinetollfees METHOD: Receive route as string parameter Determine correct row in 2D depending on routenr (subtract 1 mark each mistake max 2) Determine correct column in 2D depending on TruckNr Tr1 OR Tr2: 1 st column, Tr3: 2 nd column, Tr4 OR Tr5: 3 rd column Find and return tollfees value at position [row] [column] (-1 for incorrect order) Button [Get data from file]: Receive vehicle number from combo box & convert to string {Delphi: AssignFile, Reset Java: Create object to read from file Test if file does not exist & display message Use loop counter/delivery number of last entry Increment last delivery number for new Delivery number Loop through file Read line from text file Find and keep last occurrence of vehicle number Separate information using (#) to obtain the odometer reading, use split/copy/pos/indexof Obtain odometer from string Display values in text boxes MAX. MARKS LEARNER'S MARKS

28 Information Technology/P1 6 DBE/November 2014 QUESTION 2: MARKING GRID - OBJECT-ORIENTED PROGRAMMING - continue Button [New delivery]: Obtain newtripnumber, odometer, end odometer, truck number Instantiate the object with values: Left side of assign Right side of assign, Correct number and order of parameters (4) and type casting (or obtain from variables of correct type) Display message after object has been created Use object to call calculatedistance and calculate fuelused (divide by 5) (Java: Ensure the fuelused value is a double value) Call set method to set fuelused attribute to calculated value Enable the fuel used and toll fees buttons (Buttons can also be enabled in 2.2.3) Button [Display delivery]: Display information in text area using tostring Button [Check fuel used]: Read fuel used from text box and convert to a real number Use object and call getmethod to get fuel used Calculate difference, calculate % Test if less than 10% difference (provide for positive and negative) Change fuel used using set method Display message to indicate change has been made Else Display error message Button [Calculate toll fees]: Read route number from text box Use object to call determinetollfees method and send route number as parameter Display toll fees in currency format (R##.##) TOTAL: 60

29 Information Technology/P1 7 DBE/November 2014 ANNEXURE C: SECTION C: QUESTION 3: MARKING GRID PROBLEM SOLVING CENTRE NUMBER: EXAMINATION NUMBER: QUES- DESCRIPTION TION 3.1 Button [Load item] Declare variable for loading code Test if fragile is selected Test if fragileitems < 20 Create loading code F number Update fragileitems by adding a * Else (Test if non fragile is selected) Test if nonfragileitems < 30 Create loading code Update nonfragileitems by adding a * Test if there is space for the item Display loading code in the text box Else Display a message indicating the item is not loaded Display heading Display string representing fragileitems Display string representing nonfragileitems 3.2 Button [Check load status] Determine the number of fragile items Determine the number of non-fragile items (Mark given for assigning given values 4 and 13) OR (Mark given for using values from 3.1) Calculate percentage fragile items Calculate percentage non-fragile items Display column headings and detail in columns Display fragile item details, formatted, percentage to 2 decimal spaces Display non-fragile item details % formatted to 2 decimal places If condition (percent fragile >=50 AND percent non-fragile >=50 ) Nested if acceptable Display message "to progress" on text area else Display message "may not progress" If (condition) (numfragile <10) Display fragileitems still required on text area, calculation If (condition) (numnonfragile <15) Display nonfragileitems still required on text area, calculation Note:The condition can be reversed displaying the corresponding messages. Numbers (10 and 15) can be used instead of percentages. MAX. MARKS LEARNER'S MARKS

30 Information Technology/P1 8 DBE/November 2014 QUESTION 3: MARKING GRID PROBLEM SOLVING - continue 3.3 Button [Clear load] Clear fragileitems Clear nonfragileitems Clear text area 3 TOTAL: 40 SUMMARY OF LEARNER S MARKS: MAX. MARKS LEARNER'S MARKS SECTION A SECTION B SECTION C QUESTION 1 QUESTION 2 QUESTION 3 GRAND TOTAL

31 Information Technology/P1 9 DBE/November 2014 ANNEXURE D: SOLUTION FOR QUESTION 1: JAVA // A solution to Question 1 package Question1Package; import java.io.filenotfoundexception; import java.io.filewriter; import java.io.ioexception; import java.io.printwriter; import java.util.calendar; import java.util.scanner; import java.util.logging.level; import java.util.logging.logger; import javax.swing.joptionpane; public class Question1_Solution extends javax.swing.jframe { int kilometres = 635; public Question1_Solution() { initcomponents(); this.setlocationrelativeto(this); this.setvisible(true); lstkgs.setselectedindex(0); txfbarcode.settext(" "); // Question 1.1 private void btndeliveryactionperformed(java.awt.event.actionevent evt) { String departure = (String) (cmbdepart.getselecteditem()); String destination = (String) (cmbdestination.getselecteditem()); kilometres = Integer.parseInt(txfDistance.getText()); lbldelivery.settext(departure + " to " + destination + " : " + kilometres + " km"); // Question 1.2 private void btndeliverycostactionperformed(java.awt.event.actionevent evt) { int position = (int) (lstkgs.getselectedindex()); double costtransport = 0; switch (position) { case 0: costtransport = 0.6 * kilometres; break; case 1: costtransport = 1.0 * kilometres; break; case 2: costtransport = 1.25 * kilometres; break; case 3: costtransport = 1.65 * kilometres; break; if (chbspeedpost.isselected()) { costtransport += 100; txfcost.settext(string.format("r%2.2f",costtransport));

32 Information Technology/P1 10 DBE/November 2014 // Question 1.3 private void btnboxnumberactionperformed(java.awt.event.actionevent evt) { int boxnumber = 0; if (chbspeedpost.isselected()) { boxnumber = 4; else { do { boxnumber = (int) (Math.random() * 5) + 1; while (boxnumber == 4); txfboxnumber.settext("" + boxnumber); // Question 1.4 private void btnbarcodeactionperformed(java.awt.event.actionevent evt) { String barcode = txfbarcode.gettext(); int sumodd = 0; int sumeven = 0; for (int cnt = 0; cnt < barcode.length()-1; cnt ++) { if ((cnt+1) % 2 ==0) sumeven = sumeven + Integer.parseInt(barCode.substring(cnt, cnt + 1)); else sumodd = sumodd + Integer.parseInt(barCode.substring(cnt, cnt + 1)); int sum = sumodd * 3 + sumeven; int checkdigit = 10 - (sum % 10); if(checkdigit == Integer.parseInt(barCode.substring(barCode.length()-1))) { txfdisplaybarcode.settext("the bar code is valid. Check digit: " + checkdigit); else { txfdisplaybarcode.settext("the bar code is NOT valid. Correct check digit: " + checkdigit); // Question 1.5 private void btnviewdeliveriesactionperformed(java.awt.event.actionevent evt) { String place = (String)(cmbCityName.getSelectedItem()); outputarea.settext(place+"\n"); try { PrintWriter out = new PrintWriter(new FileWriter( "December2014"+place+".txt")); for (int i = 0;i<arrDecDeliveries.length;i++){ if(arrdecdeliveries[i].indexof(place) >=0){ outputarea.append(arrdecdeliveries[i]+"\n"); out.println(arrdecdeliveries[i]); out.close(); catch (IOException e) { JOptionPane.showMessageDialog(null,"Error");

33 Information Technology/P1 11 DBE/November 2014 ANNEXURE E: SOLUTION FOR QUESTION 2: JAVA // A solution to Question 2 OBJECT CLASS: DELIVERY (GIVEN) public class Delivery { //======================================================================== //This code is given in the program //======================================================================== private int deliverynum; private String trucknum; private double fuelused; private int odostart; private int odoend; double[][] tollfees = {{105.50, , , {35.00, 54.00, 82.00, {85.00, , , {112.00, , ; public String tostring() { DecimalFormat df = new DecimalFormat("0.0"); String output = "Delivery number: " + deliverynum + "\ntruck number: " + trucknum + "\nodometer reading: \n\t(start) " + odostart + "\n\t(end) " + odoend + "\nfuel used: " + df.format(fuelused) + " litres"; return output; // Question public Delivery(int deliverynum, String trucknum, int odostart, int odoend) { this.deliverynum = deliverynum; this.trucknum = trucknum; this.odostart = odostart; this.odoend = odoend; // Question //Accessor method public double getfuelused() { return fuelused; //Mutator method public void setfuelused(double fuel) { fuelused = fuel;

34 Information Technology/P1 12 DBE/November 2014 // Question public int calculatedistance() { return odoend - odostart; // Question public double determinetollfees(string route) { double tollamount = 0; int row = Integer.parseInt(route.substring(2, 3)) - 1; if (trucknum.equals("tr1") trucknum.equals("tr2")) { tollamount = tollfees[row][0]; else if (trucknum.equals("tr3")) { tollamount = tollfees[row][1]; else { tollamount = tollfees[row][2]; /* Alternative: switch (trucknum) { case "Tr1": case "Tr2": tollamount = tollfees[row][0]; break; case "Tr3": tollamount = tollfees[row][1]; break; default: tollamount = tollfees[row][2]; break; */ return tollamount;

35 Information Technology/P1 13 DBE/November 2014 GUI CLASS: QUESTION2_SOLUTION package Question2Package; import java.io.file; import java.io.filereader; import java.text.decimalformat; import java.util.scanner; import javax.swing.joptionpane; public class Question2_Solution extends javax.swing.jframe { // Given code Delivery objdelivery; public Question2_Solution() { initcomponents(); this.setlocationrelativeto(this); this.setvisible(true); btntollfees.setenabled(false); btnfuelchange.setenabled(false); // Code not copied for graphics // Question private void btngetfromfileactionperformed(java.awt.event.actionevent evt) { File file = new File("DeliveryInfo.txt"); if (!file.exists()) { JOptionPane.showMessageDialog(rootPane, "File does not exists"); System.exit(0); else { String trucknr = (String) cmbvehiclenumber.getselecteditem(); try { String lasttruckline = "", line = ""; Scanner sc = new Scanner(new FileReader("DeliveryInfo.txt")); String[] temp; while (sc.hasnext()) { line = sc.next(); if (line.contains(trucknr)) { lasttruckline = line; temp = line.split("#"); int newtrip = Integer.parseInt(temp[0]) + 1; txfnewtripnum.settext("" + newtrip); temp = lasttruckline.split("#"); txfstartodometer.settext(temp[2]); catch (Exception e) {

36 Information Technology/P1 14 DBE/November 2014 // Question private void btnnewdeliveryactionperformed(java.awt.event.actionevent evt) { int newtripnum = Integer.parseInt(txfNewTripNum.getText()); int startodoreading = Integer.parseInt(txfStartOdometer.getText()); int endodoreading = Integer.parseInt(txfEndOdometer.getText()); String trucknr = (String) cmbvehiclenumber.getselecteditem(); objdelivery = new Delivery(newTripNum, trucknr, startodoreading, endodoreading); JOptionPane.showMessageDialog(rootPane, "Delivery object created successfully."); int distance = objdelivery.calculatedistance(); objdelivery.setfuelused(distance / 5.0); btntollfees.setenabled(true); btnfuelchange.setenabled(true); // Question private void btndisplaydeliveryactionperformed(java.awt.event.actionevent evt) { txaoptiona.settext(objdelivery.tostring()); // Question private void btnfuelchangeactionperformed(java.awt.event.actionevent evt) { double fueladded = Double.parseDouble(txfFuel.getText()); double fuelused = objdelivery.getfuelused(); if (Math.abs(fuelAdded - fuelused) / fuelused < 0.1) { objdelivery.setfuelused(fueladded); txffuelmessage.settext("fuel changed from " + fuelused + " to " + fueladded + " litres"); else { txffuelmessage.settext("error: Difference in fuel used is too great"); // Question private void btntollfeesactionperformed(java.awt.event.actionevent evt) { String output = String.format("%-23sR%2.2f", "Toll fees to be paid:", objdelivery.determinetollfees(txfroute.gettext())); lbltollfees.settext(output);

37 Information Technology/P1 15 DBE/November 2014 ANNEXURE F: SOLUTION FOR QUESTION 3: JAVA // A possible solution to Question 3 package Question3Package; import javax.swing.joptionpane; public class Q3 extends javax.swing.jframe { //Global variables String fragileitems = ""; String nonfragileitems = ""; //======================================================================== //This code is given in the program //======================================================================== public Question3_Solution() { initcomponents(); this.setlocationrelativeto(this); this.setvisible(true); rbtfragile.setselected(true); // Question 3.1 private void btnloadactionperformed(java.awt.event.actionevent evt) { String loadingcode = ""; if (rbtfragile.isselected()) { if (fragileitems.length() < 20) { loadingcode = "F" + (fragileitems.length() + 1); fragileitems += "*"; else { if (nonfragileitems.length() < 30) { loadingcode = "NF" + (nonfragileitems.length() + 1); nonfragileitems += "*"; txfloadingcode.settext(loadingcode); if (loadingcode.equals("")) { JOptionPane.showMessageDialog(null, "Loading of item cannot be processed - No loading space\n", "Information", WIDTH); txaoutput.settext("loading progress display area: \n==============================\n\n"); txaoutput.append(string.format("%-20s%-25s%n", "Fragile items:", fragileitems)); txaoutput.append(string.format("%-20s%-25s", "Non-fragile items:", nonfragileitems));

38 Information Technology/P1 16 DBE/November 2014 // Question 3.2 private void btnstatusactionperformed(java.awt.event.actionevent evt) { int numfragile = fragileitems.length(); int numnonfragile = nonfragileitems.length(); double percfragile = (numfragile) / 20.0 * 100; double percnonfragile = (numnonfragile) / 30.0 * 100; txaoutput.settext(" Load status report:\n =====================\n"); txaoutput.append(string.format("%-15s%-25s%-15s%n", " Item type", "Number of items", "Percentage loaded")); txaoutput.append(string.format("%-15s%-25s%-13.2f%n", " Fragile", numfragile, percfragile)); txaoutput.append(string.format("%-15s%-25s%-13.2f%n", " Non-fragile", numnonfragile, percnonfragile)); if (percfragile >= 50 && percnonfragile >= 50) { txaoutput.append("\n The delivery may progress."); if (numfragile < 10 numnonfragile < 15) { txaoutput.append("\n The delivery may not progress."); if (numfragile < 10) { txaoutput.append("\n Number of fragile items still required : " + (10 - numfragile)); if (numnonfragile < 15) { txaoutput.append("\n Number of non-fragile items still required : " + (15 - numnonfragile)); // Question 3.3 private void btnclearactionperformed(java.awt.event.actionevent evt) { fragileitems=""; nonfragileitems=""; txaoutput.settext("");

39 Information Technology/P1 17 DBE/November 2014 ANNEXURE G: SOLUTION FOR QUESTION 1: DELPHI unit Question1_U_Memo; interface //Possible solution for Question 1 uses Windows, Messages, SysUtils, Variants, Classes, Graphics, Controls, Forms, Dialogs, StdCtrls, ExtCtrls, ComCtrls, StrUtils; type TfrmQuestion1 = class(tform) grpq1_1: TGroupBox; grpq1_3: TGroupBox; grpq1_2: TGroupBox; grpq1_4: TGroupBox; lbldeliveryfrom: TLabel; lbldeliveryto: TLabel; lblnokm: TLabel; edtkm: TEdit; btndeliveryconfirmation: TButton; grpdlabel: TGroupBox; lbldeliverycode: TLabel; grpspeedpost: TGroupBox; btndeliverycost: TButton; grprange: TGroupBox; edtdeliverycost: TEdit; lstrangekm: TListBox; btndeliveryboxnumber: TButton; edtdeliveryboxnumber: TEdit; btncreatebarcode: TButton; edtcreatebarcode: TEdit; cbodeliveryfrom: TComboBox; cbodeliveryto: TComboBox; lblupcbarcode: TLabel; edtupcbarcode: TEdit; chkspeedpost: TCheckBox; grpq1_5: TGroupBox; cbocityname: TComboBox; btnviewdeliveries: TButton; redoutputarea: TRichEdit; lblcity: TLabel; procedure btndeliveryconfirmationclick(sender: TObject); procedure btndeliverycostclick(sender: TObject); procedure FormCreate(Sender: TObject); procedure btndeliveryboxnumberclick(sender: TObject); procedure btncreatebarcodeclick(sender: TObject); procedure btnviewdeliveriesclick(sender: TObject); private { Private declarations public { Public declarations var frmquestion1: TfrmQuestion1; ikilometres : Integer = 635; //default value

40 Information Technology/P1 18 DBE/November 2014 //given do not change arrdecdeliveries : array[1..32] of String = (' Durban to Cape Town', ' Polokwane to Johannesburg', ' Cape Town to Johannesburg ', ' Polokwane to Potchefstroom ', ' Bloemfontein to Port Elizabeth', ' Polokwane to Potchefstroom', ' Cape Town to Port Elizabeth ', ' Port Elizabeth to Potchefstroom ', ' Port Elizabeth to Durban', ' Polokwane to Kimberley', ' Cape Town to Kimberley ', ' Polokwane to Potchefstroom ', ' Kimberley to Port Elizabeth', ' Durban to Kimberley', ' Bloemfontein to Potchefstroom', ' Durban to Potchefstroom', ' Cape Town to Potchefstroom', ' Polokwane to Cape Town', ' Cape Town to Johannesburg ', ' Polokwane to Potchefstroom ', ' Bloemfontein to Kimberley', ' Polokwane to Johannesburg', ' Cape Town to Port Elizabeth ', ' Port Elizabeth to Potchefstroom ', ' Potchefstroom to Durban', ' Cape Town to Kimberley', ' Cape Town to Kimberley ', ' Polokwane to Potchefstroom ', ' Kimberley to Port Elizabeth', ' Potchefstroom to Kimberley', ' Bloemfontein to Polokwane', ' Durban to Bloemfontein'); implementation {$R *.dfm procedure TfrmQuestion1.btnDeliveryConfirmationClick(Sender: TObject); //Question 1.1 ikilometres := StrToInt(edtKm.Text); lbldeliverycode.caption := cbodeliveryfrom.items[cbodeliveryfrom.itemindex] + ' to ' + cbodeliveryto.items[cbodeliveryto.itemindex] + ' : ' + edtkm.text + 'km'; procedure TfrmQuestion1.btnDeliveryCostClick(Sender: TObject); var ipositon : integer; rcosttransport : real; //Question 1.2 ipositon := lstrangekm.itemindex; rcosttransport := 0; Case (ipositon) of

41 Information Technology/P1 19 DBE/November : rcosttransport := 0.60 * ikilometres; 1: rcosttransport := 1.00 * ikilometres; 2: rcosttransport := 1.25 * ikilometres; 3: rcosttransport := 1.65 * ikilometres; if chkspeedpost.checked = True then rcosttransport := rcosttransport + 100; edtdeliverycost.text := FloatToStrF(rCostTransport, ffcurrency, 8,2); procedure TfrmQuestion1.btnDeliveryBoxNumberClick(Sender: TObject); var iboxnumber : integer; //Question 1.3 if chkspeedpost.checked = true then iboxnumber := 4; end else //generate a random number between 1 to 5 which is not 4 repeat iboxnumber := random(5)+1; until iboxnumber <> 4; edtdeliveryboxnumber.text := IntToStr(iBoxNumber); procedure TfrmQuestion1.btnCreateBarCodeClick(Sender: TObject); var sbarcode : string; isumodd, isumeven, icounter, itotal, icheckdigit : Integer; //Question 1.4 sbarcode := edtupcbarcode.text; isumodd := 0; isumeven := 0; for icounter := 1 to Length(sBarCode)-1 do if (icounter MOD 2) = 0 then inc(isumeven, StrToInt(sBarCode[iCounter])) else inc(isumodd, StrToInt(sBarCode[iCounter])); itotal := (isumodd * 3) + isumeven; icheckdigit := 10 - (itotal mod 10); if icheckdigit = StrToInt(sBarCode[Length(sBarCode)]) then edtcreatebarcode.text := 'The bar code is valid. ' + 'Check digit: ' + IntToStr(iCheckDigit) else edtcreatebarcode.text := 'The bar code is NOT valid. ' +

42 Information Technology/P1 20 DBE/November 2014 IntToStr(iCheckDigit) ; ' Correct check digit: ' + procedure TfrmQuestion1.btnViewDeliveriesClick(Sender: TObject); var scity, sfilename : string; txtfile : TextFile; icounter : Integer; //Question 1.5 redoutputarea.clear; scity := cbocityname.items[cbocityname.itemindex]; redoutputarea.lines.add(scity); sfilename := 'December2014'+sCity + '.txt'; AssignFile(txtFile, sfilename); Rewrite(txtFile); for icounter := 1 to 32 do if pos(scity, arrdecdeliveries[icounter]) > 0 then redoutputarea.lines.add(arrdecdeliveries[icounter]); Writeln(txtFile, arrdecdeliveries[icounter]); CloseFile(txtFile); procedure TfrmQuestion1.FormCreate(Sender: TObject); lstrangekm.selected[0] := True; CurrencyString := 'R'; Randomize; end.

43 Information Technology/P1 21 DBE/November 2014 ANNEXURE H: SOLUTION FOR QUESTION 2: DELPHI CLASS UNIT: DELIVERY_U.PAS unit Delivery_U; //Possible solution for Question 2 - class unit. interface uses sysutils; type TDelivery = class(tobject) private fdeliverynum : integer; ftrucknum : string; ffuelused : real; fodostart : integer; fodoend : integer; public function tostring: string; constructor Create(iDeliverNumber: integer; strucknumber : string; iodostart, iodoend : integer); function getfuelused: real; procedure setfuelused (rfuelused : Real); function calculatedistance: Integer; function determinetollfees(sroute : string): real; var //Given to be used in question tollfees : array[1..4,1..3] of real = ((105.50, , ), (35.00, 54.00, 82.00), (85.00,129.00,205.00), (112.00, , )); implementation // Question constructor TDelivery.Create(iDeliverNumber: integer; strucknumber: string; iodostart, iodoend: integer); fdeliverynum := idelivernumber; ftrucknum := strucknumber; fodostart := iodostart; fodoend := iodoend; // Question function TDelivery.getFuelUsed: real; Result := ffuelused;

NATIONAL SENIOR CERTIFICATE GRADE 12

NATIONAL SENIOR CERTIFICATE GRADE 12 NATIONAL SENIOR CERTIFICATE GRADE 12 INFORMATION TECHNOLOGY P1 NOVEMBER 2014 MEMORANDUM MARKS: 150 This memorandum consists of 28 pages. Information Technology/P1 2 DBE/November 2014 GENERAL INFORMATION:

More information

NATIONAL SENIOR CERTIFICATE GRADE 12

NATIONAL SENIOR CERTIFICATE GRADE 12 NATIONAL SENIOR CERTIFICATE GRADE 12 INFORMATION TECHNOLOGY P1 FEBRUARY/MARCH 2016 MARKS: 150 TIME: 3 hours This question paper consists of 21 pages. Information Technology/P1 2 DBE/Feb. Mar. 2016 INSTRUCTIONS

More information

NATIONAL SENIOR CERTIFICATE GRADE 12

NATIONAL SENIOR CERTIFICATE GRADE 12 NATIONAL SENIOR CERTIFICATE GRADE 12 INFORMATION TECHNOLOGY P1 FEBRUARY/MARCH 2016 MARKS: 150 TIME: 3 hours This question paper consists of 21 pages. Information Technology/P1 2 DBE/Feb. Mar. 2016 NSC

More information

NATIONAL SENIOR CERTIFICATE GRADE 12

NATIONAL SENIOR CERTIFICATE GRADE 12 NATIONAL SENIOR CERTIFICATE GRADE 12 INFORMATION TECHNOLOGY P1 NOVEMBER 2017 MARKS: 150 TIME: 3 hours This question paper consists of 18 pages. Information Technology/P1 2 DBE/November 2017 INSTRUCTIONS

More information

NATIONAL SENIOR CERTIFICATE GRADE12

NATIONAL SENIOR CERTIFICATE GRADE12 NATIONAL SENIOR CERTIFICATE GRADE12 INFORMATION TECHNOLOGY P1 NOVEMBER 2017 MARKING GUIDELINES MARKS: 150 These marking guidelines consist of 26 pages. Information Technology/P1 2 DBE/November 2017 GENERAL

More information

NATIONAL SENIOR CERTIFICATE GRADE12

NATIONAL SENIOR CERTIFICATE GRADE12 NATIONAL SENIOR CERTIFICATE GRADE12 INFORMATION TECHNOLOGY P1 FEBRUARY/MARCH 2017 MEMORANDUM MARKS: 150 This memorandum consists of 29 pages. Information Technology/P1 2 DBE/Feb. Mar. 2017 GENERAL INFORMATION:

More information

NATIONAL SENIOR CERTIFICATE GRADE12

NATIONAL SENIOR CERTIFICATE GRADE12 NATIONAL SENIOR CERTIFICATE GRADE12 INFORMATION TECHNOLOGY P1 NOVEMBER 2015 MEMORANDUM MARKS: 150 This memorandum consists of 32 pages. Information Technology/P1 2 DBE/November 2015 GENERAL INFORMATION:

More information

NATIONAL SENIOR CERTIFICATE GRADE12

NATIONAL SENIOR CERTIFICATE GRADE12 NATIONAL SENIOR CERTIFICATE GRADE12 INFORMATION TECHNOLOGY P1 NOVEMBER 2016 MEMORANDUM MARKS: 150 This memorandum consists of 32 pages. Information Technology/P1 2 DBE/November 2016 GENERAL INFORMATION:

More information

SENIOR CERTIFICATE EXAMINATION

SENIOR CERTIFICATE EXAMINATION SENIOR CERTIFICATE EXAMINATION INFORMATION TECHNOLOGY P1 2015 MARKS: 150 TIME: 3 hours This question paper consists of 23 pages. Information Technology/P1 2 DBE/2015 SCE INSTRUCTIONS AND INFORMATION 1.

More information

NATIONAL SENIOR CERTIFICATE GRADE 12

NATIONAL SENIOR CERTIFICATE GRADE 12 NATIONAL SENIOR CERTIFICATE GRADE 12 INFORMATION TECHNOLOGY P1 EXEMPLAR 2014 MARKS: 150 TIME: 3 hours This question paper consists of 18 pages. Information Technology/P1 2 DBE/2014 INSTRUCTIONS AND INFORMATION

More information

NATIONAL SENIOR CERTIFICATE GRADE12

NATIONAL SENIOR CERTIFICATE GRADE12 NATIONAL SENIOR CERTIFICATE GRADE12 INFORMATION TECHNOLOGY P1 FEBRUARY/MARCH 2018 MARKING GUIDELINES MARKS: 150 These marking guidelines consist of 21 pages. Information Technology/P1 2 DBE/Feb. Mar. 2018

More information

NATIONAL SENIOR CERTIFICATE GRADE 12

NATIONAL SENIOR CERTIFICATE GRADE 12 F NATIONAL SENIOR CERTIFICATE GRADE 12 INFORMATION TECHNOLOGY P1 NOVEMBER 2010 MARKS: 120 TIME: 3 hours This question paper consists of 34 pages, 3 annexures and an information sheet. Information Technology/P1

More information

NATIONAL SENIOR CERTIFICATE GRADE 12 INFT.1 INFORMATION TECHNOLOGY P1 FEBRUARY/MARCH 2010

NATIONAL SENIOR CERTIFICATE GRADE 12 INFT.1 INFORMATION TECHNOLOGY P1 FEBRUARY/MARCH 2010 NATIONAL SENIOR CERTIFICATE GRADE 12 INFT.1 INFORMATION TECHNOLOGY P1 FEBRUARY/MARCH 2010 MARKS: 120 TIME: 3 hours This question paper consists of 26 pages, 3 annexures and an information sheet. MORNING

More information

NATIONAL SENIOR CERTIFICATE GRADE 12

NATIONAL SENIOR CERTIFICATE GRADE 12 NATIONAL SENIOR CERTIFICATE GRADE 12 INFORMATION TECHNOLOGY P1 NOVEMBER 2008 MARKS: 120 TIME: 3 hours This question paper consists of 32 pages. Information Technology/P1 2 INSTRUCTIONS AND INFORMATION

More information

NATIONAL SENIOR CERTIFICATE GRADE 12

NATIONAL SENIOR CERTIFICATE GRADE 12 NATIONAL SENIOR CERTIFICATE GRADE 12 INFORMATION TECHNOLOGY P1 FEBRUARY/MARCH 2015 MEMORANDUM MARKS: 150 This memorandum consists of 32 pages. Information Technology/P1 2 DBE/Feb. Mar. 2015 GENERAL INFORMATION:

More information

GRADE 12 SEPTEMBER 2012 INFORMATION TECHNOLOGY P1 MEMORANDUM

GRADE 12 SEPTEMBER 2012 INFORMATION TECHNOLOGY P1 MEMORANDUM Province of the EASTERN CAPE EDUCATION NATIONAL SENIOR CERTIFICATE GRADE 12 SEPTEMBER 2012 INFORMATION TECHNOLOGY P1 MEMORANDUM MARKS: 120 This memorandum consists of 11 pages. 2 INFORMATION TECHNOLOGY

More information

GRADE/GRAAD 11 NOVEMBER 2013 INFORMATION TECHNOLOGY P1 INLIGTINGSTEGNOLOGIE V1 MEMORANDUM

GRADE/GRAAD 11 NOVEMBER 2013 INFORMATION TECHNOLOGY P1 INLIGTINGSTEGNOLOGIE V1 MEMORANDUM NATIONAL SENIOR CERTIFICATE NASIONALE SENIOR SERTIFIKAAT GRADE/GRAAD 11 NOVEMBER 2013 INFORMATION TECHNOLOGY P1 INLIGTINGSTEGNOLOGIE V1 MEMORANDUM MARKS/PUNTE: 150 This memorandum consists of 6 pages.

More information

GRADE 11 NOVEMBER 2012 INFORMATION TECHNOLOGY P1 INLIGTINGSTEGNOLOGIE V1 MEMORANDUM

GRADE 11 NOVEMBER 2012 INFORMATION TECHNOLOGY P1 INLIGTINGSTEGNOLOGIE V1 MEMORANDUM Province of the EASTERN CAPE EDUCATION NATIONAL SENIOR CERTIFICATE GRADE 11 NOVEMBER 2012 INFORMATION TECHNOLOGY P1 INLIGTINGSTEGNOLOGIE V1 MEMORANDUM MARKS/PUNTE: 120 This memorandum consists of 10 pages.

More information

2. Design and Development

2. Design and Development Postage Calculator 1. The task Design and implement a program for employees of a travel agency who send out documents to the UK and EU only; the program will calculate the cost of postage. Each envelope

More information

PROVINCIAL EXAMINATION INFORMATION TECHNOLOGY PAPER 1 JUNE 2015 GRADE 11

PROVINCIAL EXAMINATION INFORMATION TECHNOLOGY PAPER 1 JUNE 2015 GRADE 11 PROVINCIAL EXAMINATION INFORMATION TECHNOLOGY PAPER 1 JUNE 2015 GRADE 11 TIME: 3 hours MARKS: 150 Copy Right reserved This question paper consists of 10 pages. Copy Right reserved 2 MP/June 2015 INSTRUCTIONS

More information

Introduction to Programming Using Java (98-388)

Introduction to Programming Using Java (98-388) Introduction to Programming Using Java (98-388) Understand Java fundamentals Describe the use of main in a Java application Signature of main, why it is static; how to consume an instance of your own class;

More information

Our first program is a simple calculator, which will carry out the arithmetic operations of adding, subtracting, multiplying and dividing numbers.

Our first program is a simple calculator, which will carry out the arithmetic operations of adding, subtracting, multiplying and dividing numbers. Chapter 2: Calculations 29 2 Calculations Most computer programs need to carry out calculations, for example: with money, quantities of materials, or dates and times. In this chapter, we will examine how

More information

NATIONAL SENIOR CERTIFICATE GRADE 12

NATIONAL SENIOR CERTIFICATE GRADE 12 NATIONAL SENIOR CERTIFICATE GRADE 12 INFORMATION TECHNOLOGY P1 NOVEMBER 2013 MARKS: 120 TIME: 3 hours This question paper consists of 16 pages and 3 annexures. Information Technology/P1 2 DBE/November

More information

INFORMATION TECHNOLOGY: PAPER II. 1. This question paper consists of 9 pages. Please check that your question paper is complete.

INFORMATION TECHNOLOGY: PAPER II. 1. This question paper consists of 9 pages. Please check that your question paper is complete. NATIONAL SENIOR CERTIFICATE EXAMINATION NOVEMBER 2011 INFORMATION TECHNOLOGY: PAPER II Time: 3 hours 120 marks PLEASE READ THE FOLLOWING INSTRUCTIONS CAREFULLY 1. This question paper consists of 9 pages.

More information

Two hours QUESTION PAPER MUST NOT BE REMOVED FROM THE EXAM ROOM UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE

Two hours QUESTION PAPER MUST NOT BE REMOVED FROM THE EXAM ROOM UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE Two hours QUESTION PAPER MUST NOT BE REMOVED FROM THE EXAM ROOM UNIVERSITY OF MANCHESTER SCHOOL OF COMPUTER SCIENCE High-Level Programming (Java) Date: Thursday 20th January 2011 Time: 14:00-16:00 Answer

More information

2018 EXAM SESSION INFORMATION (JUNE & NOVEMBER 2018)

2018 EXAM SESSION INFORMATION (JUNE & NOVEMBER 2018) Dear Student, 2018 EXAM SESSION INFORMATION (JUNE & NOVEMBER 2018) This document contains essential information about the upcoming exam sessions including this letter; a section titled Important Information

More information

Please read all of these sections of the document carefully to ensure that you do not miss anything.

Please read all of these sections of the document carefully to ensure that you do not miss anything. Dear Student INVITATION TO THE NOVEMBER 2017 EXAM SESSION: NQF This document contains essential information about the upcoming exam session including this letter; a section titled Important Information

More information

JAVA PROGRAMMING (340)

JAVA PROGRAMMING (340) Page 1 of 8 JAVA PROGRAMMING (340) REGIONAL 2016 Production Portion: Program 1: Base K Addition (335 points) TOTAL POINTS (335 points) Judge/Graders: Please double check and verify all scores and answer

More information

Check out how to use the random number generator (introduced in section 4.11 of the text) to get a number between 1 and 6 to create the simulation.

Check out how to use the random number generator (introduced in section 4.11 of the text) to get a number between 1 and 6 to create the simulation. Chapter 4 Lab Loops and Files Lab Objectives Be able to convert an algorithm using control structures into Java Be able to write a while loop Be able to write an do-while loop Be able to write a for loop

More information

University of Cape Town ~ Department of Computer Science. Computer Science 1015F ~ 2007

University of Cape Town ~ Department of Computer Science. Computer Science 1015F ~ 2007 Name: Please fill in your Student Number and Name. Student Number : Student Number: University of Cape Town ~ Department of Computer Science Computer Science 1015F ~ 2007 Final Examination Question Max

More information

In this chapter we will examine arrays, and the ways that they can be used in combination with loop structures to process data in programs.

In this chapter we will examine arrays, and the ways that they can be used in combination with loop structures to process data in programs. Chapter 5: Loops and arrays 117 5 Loops and arrays In this chapter we will examine arrays, and the ways that they can be used in combination with loop structures to process data in programs. The first

More information

NATIONAL SENIOR CERTIFICATE GRADE 12 CATN.1 COMPUTER APPLICATIONS TECHNOLOGY P1 FEBRUARY/MARCH 2011

NATIONAL SENIOR CERTIFICATE GRADE 12 CATN.1 COMPUTER APPLICATIONS TECHNOLOGY P1 FEBRUARY/MARCH 2011 NATIONAL SENIOR CERTIFICATE GRADE 12 CATN.1 COMPUTER APPLICATIONS TECHNOLOGY P1 FEBRUARY/MARCH 2011 MARKS: 200 TIME: 3 hours This question paper consists of 20 pages and a separate information sheet. MORNING

More information

a) Answer all questions. b) Write your answers in the space provided. c) Show all calculations where applicable.

a) Answer all questions. b) Write your answers in the space provided. c) Show all calculations where applicable. Name: Please fill in your Student Number and Name. Student Number : Student Number: University of Cape Town ~ Department of Computer Science Computer Science 1015F ~ 2008 January Exam Question Max Internal

More information

Cambridge Assessment International Education Cambridge International General Certificate of Secondary Education. Published

Cambridge Assessment International Education Cambridge International General Certificate of Secondary Education. Published Cambridge Assessment International Education Cambridge International General Certificate of Secondary Education COMPUTER SCIENCE 0478/21 Paper 2 MARK SCHEME Maximum Mark: 50 Published This mark scheme

More information

Systems and Principles Unit Syllabus

Systems and Principles Unit Syllabus Systems and Principles Unit Syllabus Level 2 Creating an event driven computer program using Java 7540-007 www.cityandguilds.com October 2010 Version 2.0 About City & Guilds City & Guilds is the UK s leading

More information

CSC 1051 Algorithms and Data Structures I. Final Examination May 2, Name:

CSC 1051 Algorithms and Data Structures I. Final Examination May 2, Name: CSC 1051 Algorithms and Data Structures I Final Examination May 2, 2015 Name: Question Value 1 10 Score 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 20 TOTAL 100 Please answer questions in the spaces provided.

More information

University of Cape Town ~ Department of Computer Science. Computer Science 1015F ~ 2007

University of Cape Town ~ Department of Computer Science. Computer Science 1015F ~ 2007 Name: Please fill in your Student Number and Name. Student Number : Student Number: University of Cape Town ~ Department of Computer Science Computer Science 1015F ~ 2007 Supplementary Examination Question

More information

1 Using the NetBeans IDE

1 Using the NetBeans IDE Chapter 1: Using the NetBeans IDE 5 1 Using the NetBeans IDE In this chapter we will examine how to set up a new application program using the NetBeans Integrated Development Environment with the language

More information

NEO CONVENT SR. SEC. SCHOOL, PASCHIM VIHAR, DELHI 63 Paper IP, Class XI-C, Unit Test 1 ( ) Answer Key Max. Marks: 40

NEO CONVENT SR. SEC. SCHOOL, PASCHIM VIHAR, DELHI 63 Paper IP, Class XI-C, Unit Test 1 ( ) Answer Key Max. Marks: 40 NEO CONVENT SR. SEC. SCHOOL, PASCHIM VIHAR, DELHI 63 Paper IP, Class XI-C, Unit Test (0.07.07) Answer Key Max. Marks: 40 Q.a) b) c) d) e) f) Ans. What are the major strengths and weaknesses of a computer?

More information

Data Structures and Algorithms

Data Structures and Algorithms Data Structures and Algorithms Introduction: Data Structures What is a data structure? Way of storing data in computer so can be used efficiently Set of operations that access the data in prescribed ways

More information

Final Exam. CSC 121 Fall Lecturer: Howard Rosenthal. Dec. 13, 2017

Final Exam. CSC 121 Fall Lecturer: Howard Rosenthal. Dec. 13, 2017 Your Name: Final Exam. CSC 121 Fall 2017 Lecturer: Howard Rosenthal Dec. 13, 2017 The following questions (or parts of questions) in numbers 1-17 are all worth 2 points each. The programs have indicated

More information

CSC 1051 Algorithms and Data Structures I. Final Examination May 12, Name

CSC 1051 Algorithms and Data Structures I. Final Examination May 12, Name CSC 1051 Algorithms and Data Structures I Final Examination May 12, 2017 Name Question Value Score 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 10 10 10 TOTAL 100 Please answer questions in the spaces provided.

More information

Delphi Generics.Collections

Delphi Generics.Collections Delphi Generics.Collections Copyright(C) 2008 Embarcadero Technologies, Inc. All Rights Reserved. Delphi Generics.Collections Table of Contents Generics.Collections.TCollectionNotification 1 Generics.Collections.TCollectionNotifyEvent

More information

Loops. Eng. Mohammed Abdualal. Islamic University of Gaza. Faculty of Engineering. Computer Engineering Department

Loops. Eng. Mohammed Abdualal. Islamic University of Gaza. Faculty of Engineering. Computer Engineering Department Islamic University of Gaza Faculty of Engineering Computer Engineering Department Computer Programming Lab (ECOM 2114) Created by Eng: Mohammed Alokshiya Modified by Eng: Mohammed Abdualal Lab 6 Loops

More information

CO Java SE 8: Fundamentals

CO Java SE 8: Fundamentals CO-83527 Java SE 8: Fundamentals Summary Duration 5 Days Audience Application Developer, Developer, Project Manager, Systems Administrator, Technical Administrator, Technical Consultant and Web Administrator

More information

NATIONAL SENIOR CERTIFICATE GRADE 12

NATIONAL SENIOR CERTIFICATE GRADE 12 NATIONAL SENIOR CERTIFICATE GRADE 12 COMPUTER APPLICATIONS TECHNOLOGY P1 NOVEMBER 2012 MARKS: 200 TIME: 3 hours This question paper consists of 18 pages and a separate information sheet. Computer Applications

More information

Introduction to Programming. June Marking Scheme

Introduction to Programming. June Marking Scheme Introduction to Programming June 2015 Marking Scheme This marking scheme has been prepared as a guide only to markers. This is not a set of model answers, or the exclusive answers to the questions, and

More information

Homework #3 CS2255 Fall 2012

Homework #3 CS2255 Fall 2012 Homework #3 CS2255 Fall 2012 MULTIPLE CHOICE 1. The, also known as the address operator, returns the memory address of a variable. a. asterisk ( * ) b. ampersand ( & ) c. percent sign (%) d. exclamation

More information

Course Text. Course Description. Course Objectives. StraighterLine Introduction to Programming in C++

Course Text. Course Description. Course Objectives. StraighterLine Introduction to Programming in C++ Introduction to Programming in C++ Course Text Programming in C++, Zyante, Fall 2013 edition. Course book provided along with the course. Course Description This course introduces programming in C++ and

More information

NATIONAL SENIOR CERTIFICATE GRADE 12

NATIONAL SENIOR CERTIFICATE GRADE 12 NATIONAL SENIOR CERTIFICATE GRADE 12 COMPUTER APPLICATIONS TECHNOLOGY P1 FEBRUARY/MARCH 2013 MARKS: 200 TIME: 3 hours This question paper consists of 18 pages and a separate information sheet. Computer

More information

NATIONAL SENIOR CERTIFICATE GRADE 12

NATIONAL SENIOR CERTIFICATE GRADE 12 NATIONAL SENI CERTIFICATE GRADE COMPUTER APPLICATIONS TECHNOLOGY P FEBRUARY/MARCH 05 MEMANDUM/MARKING GUIDELINE MARKS: 80 CENTRE FINAL MARK QUESTION 5 6 7 TOTAL POSSIBLE MARK 8 8 0 0 80 CANDIDATE MARK

More information

Exercise 4: Loops, Arrays and Files

Exercise 4: Loops, Arrays and Files Exercise 4: Loops, Arrays and Files worth 24% of the final mark November 4, 2004 Instructions Submit your programs in a floppy disk. Deliver the disk to Michele Zito at the 12noon lecture on Tuesday November

More information

CSC 1051 Algorithms and Data Structures I. Final Examination May 12, Name: KEY. Question Value Score

CSC 1051 Algorithms and Data Structures I. Final Examination May 12, Name: KEY. Question Value Score CSC 1051 Algorithms and Data Structures I Final Examination May 12, 2017 Name: KEY Question Value Score 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 10 10 10 TOTAL 100 Please answer questions in the spaces

More information

1 Short Answer (15 Points Each)

1 Short Answer (15 Points Each) Name: Write all of your responses on these exam pages. If you need extra space please use the backs of the pages. 1 Short Answer (15 Points Each) 1. Write the following Java declarations, (a) A double

More information

3. Convert 2E from hexadecimal to decimal. 4. Convert from binary to hexadecimal

3. Convert 2E from hexadecimal to decimal. 4. Convert from binary to hexadecimal APCS A Midterm Review You will have a copy of the one page Java Quick Reference sheet. This is the same reference that will be available to you when you take the AP Computer Science exam. 1. n bits can

More information

Final Exam. CSC 121 Fall Lecturer: Howard Rosenthal. Dec. 13, 2017

Final Exam. CSC 121 Fall Lecturer: Howard Rosenthal. Dec. 13, 2017 Your Name: Final Exam. CSC 121 Fall 2017 Lecturer: Howard Rosenthal Dec. 13, 2017 The following questions (or parts of questions) in numbers 1-17 are all worth 2 points each. The programs have indicated

More information

CS1083 Week 2: Arrays, ArrayList

CS1083 Week 2: Arrays, ArrayList CS1083 Week 2: Arrays, ArrayList mostly review David Bremner 2018-01-08 Arrays (1D) Declaring and using 2D Arrays 2D Array Example ArrayList and Generics Multiple references to an array d o u b l e prices

More information

Introduction to Computer Science Midterm 3 Fall, Points

Introduction to Computer Science Midterm 3 Fall, Points Introduction to Computer Science Fall, 2001 100 Points Notes 1. Tear off this sheet and use it to keep your answers covered at all times. 2. Turn the exam over and write your name next to the staple. Do

More information

Recitation: Loop Jul 7, 2008

Recitation: Loop Jul 7, 2008 Nested Loop Recitation: Loop Jul 7, 2008 1. What is the output of the following program? Use pen and paper only. The output is: ****** ***** **** *** ** * 2. Test this program in your computer 3. Use "for

More information

AP Computer Science A

AP Computer Science A AP Computer Science A 2nd Quarter Notes Table of Contents - section links - Click on the date or topic below to jump to that section Date: 11/9/2017 Aim: Binary Numbers (lesson 14) Number Systems Date:

More information

Mandatory Assignment 1, INF 4130, 2017

Mandatory Assignment 1, INF 4130, 2017 Mandatory Assignment 1, INF 4130, 2017 Deadline: Monday October 2. First: Read the general requirements for mandatory assignments at the department here: Norwegian: https://www.uio.no/studier/admin/obligatoriske-aktiviteter/mn-ifi-obliger-retningslinjer.html

More information

Do not open this examination paper until instructed to do so. Answer all the questions.

Do not open this examination paper until instructed to do so. Answer all the questions. M11/5/COMSC/HP2/ENG/TZ0/XX 22117012 Computer science HIGHER level Paper 2 Friday 20 May 2011 (morning) 2 hours 15 minutes INSTRUCTIONS TO CANDIDATES Do not open this examination paper until instructed

More information

This exam is open book. Each question is worth 3 points.

This exam is open book. Each question is worth 3 points. This exam is open book. Each question is worth 3 points. Page 1 / 15 Page 2 / 15 Page 3 / 12 Page 4 / 18 Page 5 / 15 Page 6 / 9 Page 7 / 12 Page 8 / 6 Total / 100 (maximum is 102) 1. Are you in CS101 or

More information

INTI COLLEGE MALAYSIA

INTI COLLEGE MALAYSIA CSC 107 (F) / Page 1 of 6 INTI COLLEGE MALAYSIA COMPUTING AND INFORMATION TECHNOLOGY CERTIFICATE CSC 107 : PROGRAMMING IN C (BASED ON AB) FINAL EXAMINATION : AUGUST 2000 SESSION This paper consists of

More information

BLOCK STRUCTURE. class block main method block do-while statement block if statement block. if statement block. Block Structure Page 1

BLOCK STRUCTURE. class block main method block do-while statement block if statement block. if statement block. Block Structure Page 1 BLOCK STRUCTURE A block is a bundle of statements in a computer program that can include declarations and executable statements. A programming language is block structured if it (1) allows blocks to be

More information

Java for Non Majors. Final Study Guide. April 26, You will have an opportunity to earn 20 extra credit points.

Java for Non Majors. Final Study Guide. April 26, You will have an opportunity to earn 20 extra credit points. Java for Non Majors Final Study Guide April 26, 2017 The test consists of 1. Multiple choice questions 2. Given code, find the output 3. Code writing questions 4. Code debugging question 5. Short answer

More information

CSC 222: Object-Oriented Programming. Fall Object-oriented design

CSC 222: Object-Oriented Programming. Fall Object-oriented design CSC 222: Object-Oriented Programming Fall 2015 Object-oriented design example: word frequencies w/ parallel lists exception handling System.out.format example: word frequencies w/ objects object-oriented

More information

Contents Chapter 1 Introduction to Programming and the Java Language

Contents Chapter 1 Introduction to Programming and the Java Language Chapter 1 Introduction to Programming and the Java Language 1.1 Basic Computer Concepts 5 1.1.1 Hardware 5 1.1.2 Operating Systems 8 1.1.3 Application Software 9 1.1.4 Computer Networks and the Internet

More information

CS 201 Advanced Object-Oriented Programming Lab 6 - Sudoku, Part 2 Due: March 10/11, 11:30 PM

CS 201 Advanced Object-Oriented Programming Lab 6 - Sudoku, Part 2 Due: March 10/11, 11:30 PM CS 201 Advanced Object-Oriented Programming Lab 6 - Sudoku, Part 2 Due: March 10/11, 11:30 PM Introduction to the Assignment In this lab, you will finish the program to allow a user to solve Sudoku puzzles.

More information

NATIONAL SENIOR CERTIFICATE GRADE 12

NATIONAL SENIOR CERTIFICATE GRADE 12 NATIONAL SENIOR CERTIFICATE GRADE 12 INFORMATION TECHNOLOGY P1 NOVEMBER 2012 MEMORANDUM MARKS: 120 The memorandum consists of 32 pages. Information Technology/P1 2 DBE/November 2012 GENERAL INFORMATION

More information

Simple Java Reference

Simple Java Reference Simple Java Reference This document provides a reference to all the Java syntax used in the Computational Methods course. 1 Compiling and running... 2 2 The main() method... 3 3 Primitive variable types...

More information

Software Systems Development Unit AS1: Introduction to Object Oriented Development

Software Systems Development Unit AS1: Introduction to Object Oriented Development New Specification Centre Number 71 Candidate Number ADVANCED SUBSIDIARY (AS) General Certificate of Education 2014 Software Systems Development Unit AS1: Introduction to Object Oriented Development [A1S11]

More information

Cambridge Ordinary Level 2210 Computer Science June 2016 Principal Examiner Report for Teachers

Cambridge Ordinary Level 2210 Computer Science June 2016 Principal Examiner Report for Teachers COMPUTER SCIENCE Paper 2210/11 Paper 1 Key messages This syllabus has now been running for a few sessions and candidate s work continues to improve. There is a continued move to provide questions where

More information

CS Programming I: File Input / Output

CS Programming I: File Input / Output CS 200 - Programming I: File Input / Output Marc Renault Department of Computer Sciences University of Wisconsin Madison Spring 2018 TopHat Sec 3 (AM) Join Code: 427811 TopHat Sec 4 (PM) Join Code: 165455

More information

5. PLEASE TAKE HOME the question bundle, but turn in 2 paper sheets: The scantron AND the paper where you wrote your programming question solution!

5. PLEASE TAKE HOME the question bundle, but turn in 2 paper sheets: The scantron AND the paper where you wrote your programming question solution! FINAL EXAM Introduction to Computer Science UA-CCI- ICSI 201--Fall13 This is a closed book and note examination, except for one 8 1/2 x 11 inch paper sheet of notes, both sides. There is no interpersonal

More information

Cambridge International General Certificate of Secondary Education 0478 Computer Science June 2016 Principal Examiner Report for Teachers

Cambridge International General Certificate of Secondary Education 0478 Computer Science June 2016 Principal Examiner Report for Teachers COMPUTER SCIENCE Paper 0478/11 Paper 1 Key messages This syllabus has now been running for a few sessions and candidate s work continues to improve. There is a continued move to provide questions where

More information

What two elements are usually present for calculating a total of a series of numbers?

What two elements are usually present for calculating a total of a series of numbers? Dec. 12 Running Totals and Sentinel Values What is a running total? What is an accumulator? What is a sentinel? What two elements are usually present for calculating a total of a series of numbers? Running

More information

M11/5/COMSC/HP2/ENG/TZ0/XX/M MARKSCHEME. May 2011 COMPUTER SCIENCE. Higher Level. Paper pages

M11/5/COMSC/HP2/ENG/TZ0/XX/M MARKSCHEME. May 2011 COMPUTER SCIENCE. Higher Level. Paper pages M11/5/COMSC/HP2/ENG/TZ0/XX/M MARKSCHEME May 2011 COMPUTER SCIENCE Higher Level Paper 2 13 pages 2 M11/5/COMSC/HP2/ENG/TZ0/XX/M This markscheme is confidential and for the exclusive use of examiners in

More information

APPLICATION NOTE: KONSTANTER LSP32K Interface Protocol

APPLICATION NOTE: KONSTANTER LSP32K Interface Protocol APPLICATION NOTE: KONSTANTER LSP32K Interface Protocol 1 Interface Type At the DB9 connector the LSP32K Power Supply device offers a serial data interface with TTL logic level for remote control and readout

More information

This homework has an opportunity for substantial extra credit, which is described at the end of this document.

This homework has an opportunity for substantial extra credit, which is described at the end of this document. CS 2316 Pair Homework Box Packer Due: Tuesday, June 17th, before 11:55 PM Out of 100 points Files to submit: 1. boxpacker.py For Help: - TA Helpdesk Schedule posted on class website. - Email TA's or use

More information

LAMPIRAN Listing Program

LAMPIRAN Listing Program LAMPIRAN Listing Program unit umain; interface uses Windows, Messages, SysUtils, Variants, Classes, Graphics, Controls, Forms, Dialogs, ComCtrls, StdCtrls, ExtCtrls, ExtDlgs, DCPcrypt2, DCPrc4, DCPsha1,

More information

1. Which of the following is the correct expression of character 4? a. 4 b. "4" c. '\0004' d. '4'

1. Which of the following is the correct expression of character 4? a. 4 b. 4 c. '\0004' d. '4' Practice questions: 1. Which of the following is the correct expression of character 4? a. 4 b. "4" c. '\0004' d. '4' 2. Will System.out.println((char)4) display 4? a. Yes b. No 3. The expression "Java

More information

University of Cape Town ~ Department of Computer Science Computer Science 1015F ~ June Exam

University of Cape Town ~ Department of Computer Science Computer Science 1015F ~ June Exam Name: Please fill in your Student Number and Name. Student Number : Student Number: University of Cape Town ~ Department of Computer Science Computer Science 1015F ~ 2009 June Exam Question Max Internal

More information

NATIONAL SENIOR CERTIFICATE GRADE 11

NATIONAL SENIOR CERTIFICATE GRADE 11 NATIONAL SENIOR CERTIFICATE GRADE COMPUTER APPLICATIONS TECHNOLOGY P NOVEMBER 007 This memandum consists of 0 pages. Computer Applications Technology/P DoE/November 007 QUESTION : TOTAL marks Item/Criteria

More information

CS Programming I: File Input / Output

CS Programming I: File Input / Output CS 200 - Programming I: File Input / Output Marc Renault Department of Computer Sciences University of Wisconsin Madison Fall 2017 TopHat Sec 3 (PM) Join Code: 719946 TopHat Sec 4 (AM) Join Code: 891624

More information

NATIONAL SENIOR CERTIFICATE GRADE 11

NATIONAL SENIOR CERTIFICATE GRADE 11 NATIONAL SENIOR CERTIFICATE GRADE 11 INFORMATION TECHNOLOGY P1 EXEMPLAR 2007 MARKS: 120 TIME: 3 hours This question paper consists of 9 pages. Information Technology/P1 2 INSTRUCTIONS AND INFORMATION 1.

More information

Module Contact: Dr Gavin Cawley, CMP Copyright of the University of East Anglia Version 1

Module Contact: Dr Gavin Cawley, CMP Copyright of the University of East Anglia Version 1 UNIVERSITY OF EAST ANGLIA School of Computing Sciences Main Series UG Examination 2017-18 PROGRAMMING 1 CMP-4008Y Time allowed: 2 hours Answer FOUR questions. All questions carry equal weight. Notes are

More information

F1 A Java program. Ch 1 in PPIJ. Introduction to the course. The computer and its workings The algorithm concept

F1 A Java program. Ch 1 in PPIJ. Introduction to the course. The computer and its workings The algorithm concept F1 A Java program Ch 1 in PPIJ Introduction to the course The computer and its workings The algorithm concept The structure of a Java program Classes and methods Variables Program statements Comments Naming

More information

Documentation Requirements Computer Science 2334 Spring 2016

Documentation Requirements Computer Science 2334 Spring 2016 Overview: Documentation Requirements Computer Science 2334 Spring 2016 These requirements are based on official Java coding conventions but have been adapted to be more appropriate to an academic environment.

More information

2.2 - Making Decisions

2.2 - Making Decisions 2.2 - Making Decisions So far we have only made programs that execute the statements in order, starting with the statements at the top of the screen and moving down. However, you can write programs that

More information

AP Computer Science Chapter 10 Implementing and Using Classes Study Guide

AP Computer Science Chapter 10 Implementing and Using Classes Study Guide AP Computer Science Chapter 10 Implementing and Using Classes Study Guide 1. A class that uses a given class X is called a client of X. 2. Private features of a class can be directly accessed only within

More information

Assessment Specialist Portal User Guide

Assessment Specialist Portal User Guide Assessment Specialist Portal User Guide Assessment Specialist Portal User Guide Page 1 Contents Overview... 3 How to log in & navigate around the portal... 4 Amending your profile details... 11 How to

More information

SCOPE. public class ABC { public static void main( String args [ ] ) { Not accessible outside the block. Local to this block; accessible within it

SCOPE. public class ABC { public static void main( String args [ ] ) { Not accessible outside the block. Local to this block; accessible within it SCOPE The scope of a declaration is its range within the written computer program. Inside its scope, the declared identifier represents the declared entity. Outside the scope, the identifier is either

More information

https://asd-pa.perfplusk12.com/admin/admin_curric_maps_display.asp...

https://asd-pa.perfplusk12.com/admin/admin_curric_maps_display.asp... 1 of 8 8/27/2014 2:15 PM Units: Teacher: ProgIIIAPCompSci, CORE Course: ProgIIIAPCompSci Year: 2012-13 Computer Systems This unit provides an introduction to the field of computer science, and covers the

More information

Object Oriented Programming with Java

Object Oriented Programming with Java Object Oriented Programming with Java What is Object Oriented Programming? Object Oriented Programming consists of creating outline structures that are easily reused over and over again. There are four

More information

19 Much that I bound, I could not free; Much that I freed returned to me. Lee Wilson Dodd

19 Much that I bound, I could not free; Much that I freed returned to me. Lee Wilson Dodd 19 Much that I bound, I could not free; Much that I freed returned to me. Lee Wilson Dodd Will you walk a little faster? said a whiting to a snail, There s a porpoise close behind us, and he s treading

More information

Course Outline. Introduction to java

Course Outline. Introduction to java Course Outline 1. Introduction to OO programming 2. Language Basics Syntax and Semantics 3. Algorithms, stepwise refinements. 4. Quiz/Assignment ( 5. Repetitions (for loops) 6. Writing simple classes 7.

More information

SENIOR CERTIFICATE EXAMINATIONS

SENIOR CERTIFICATE EXAMINATIONS SENIOR CERTIFICATE EXAMINATIONS INFORMATION TECHNOLOGY P2 2017 MARKS: 150 TIME: 3 hours This question paper consists of 15 pages. Information Technology/P2 2 DBE/2017 INSTRUCTIONS AND INFORMATION 1. This

More information

Final Exam Practice. Partial credit will be awarded.

Final Exam Practice. Partial credit will be awarded. Please note that this problem set is intended for practice, and does not fully represent the entire scope covered in the final exam, neither the range of the types of problems that may be included in the

More information

Happy Cinco de Mayo!!!!

Happy Cinco de Mayo!!!! CSC 1051 Algorithms and Data Structures I Happy Cinco de Mayo!!!! Final Examination May 5, 2018 Name: Question Value Score 1 10 2 10 3 10 4 10 5 10 6 10 7 10 8 10 9 20 TOTAL 100 Please answer questions

More information