Scribd
Upload
19 views5 pages

PRLD5121 Ta

The document outlines the assessment details for the 'Programming Logic and Design' module, including instructions, academic honesty declaration, and learning objectives. It consists of three main questions covering topics such as flowcharts, pseudocode, arrays, and sorting techniques, with a total mark allocation of 60. Students are required to complete the test independently within a specified time frame, adhering to closed book rules and without the use of calculators.

Uploaded by

lehlohonoloratlou1972
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
19 views5 pages

PRLD5121 Ta

The document outlines the assessment details for the 'Programming Logic and Design' module, including instructions, academic honesty declaration, and learning objectives. It consists of three main questions covering topics such as flowcharts, pseudocode, arrays, and sorting techniques, with a total mark allocation of 60. Students are required to complete the test independently within a specified time frame, adhering to closed book rules and without the use of calculators.

Uploaded by

lehlohonoloratlou1972
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

22; 23; 24 2024

MODULE NAME: MODULE CODE:


PROGRAMMING LOGIC AND DESIGN PRLD5121/d/p

ASSESSMENT TYPE: TEST (PAPER ONLY)


TOTAL MARK ALLOCATION: 60 MARKS
TOTAL HOURS: 1 HOUR (+10 minutes reading time)
INSTRUCTIONS:
1. Please adhere to all instructions in the assessment booklet.
2. Independent work is required.
3. Ten minutes per hour of the assessment to a maximum of ten minutes is dedicated to reading
time before the start of the assessment. You may make notes on your question paper, but not
in your answer sheet. Calculators may not be used during reading time.
4. You may not leave the assessment venue during reading time, or during the first hour or the
last 15 minutes of the assessment.
5. Ensure that your name is on all pieces of paper or books that you will be submitting. Submit all
the pages of this assessment’s question paper as well as your answer script.
6. Answer all the questions on the answer sheets or in answer booklets provided. The phrase
‘END OF PAPER’ will appear after the final set of questions of this assessment.
7. Remember to work at a steady pace so that you can complete the assessment within the
allocated time. Use the mark allocation as a guideline as to how much time to spend on each
section.
Additional instructions:
1. This is a CLOSED BOOK assessment.
2. Calculators are not allowed.
3. Answer All Questions.

ACADEMIC HONESTY DECLARATION

Please complete the Academic Honesty Declaration below.

SIGN
I have read the assessment rules provided in this declaration.
This assessment is my own work.
I have not copied any other student’s work in this assessment.
I have not downloaded my assessment response from a website.
I have not used any AI tool without reviewing, re-writing, and re-working this
information, and referencing any AI tools in my work.
I have not shared this assessment with any other student.

© The Independent Institute of Education (Pty) Ltd 2024


Page 1 of 5
22; 23; 24 2024

Assessment Outcomes ____

Learning Unit/s Objectives covered in this test:

At the end of this assessment, students should be able to:


(LU1)
• (LO3) Draw flowcharts to solve programming problems
• (LO4) Design pseudocode to solve programming problems
• (LO5) Discuss data types, input, output, variables and constants
• (LO7) Design a program by breaking the problem up into modules
• (LO8) Draw a hierarchy chart for the modules of a program
• (LO10) Describe the three basic control structures

(LU2)
• (LO2) Include relational operators in a selection structure
• (LO3) Include the logical operators AND, OR, and NOT in a selection structure
• (LO4) Apply the precedence rules for logical operators in combined logical or Boolean
expressions
• (LO5) Create complex selection structures
• (LO7) Write pseudocode using counted loops and conditional loops
• (LO8) Include nested loops in your programming solution.

(LU3)
• (LO1) Explain an array data structure
• (LO2) Access the elements in an array
• (LO3) Write pseudocode that searches for a specific value in an array
• (LO4) Discuss parallel arrays
• (LO5) Explain why data should be sorted
• (LO6) Write pseudocode to sort an array using a Bubble Sort

© The Independent Institute of Education (Pty) Ltd 2024


Page 2 of 5
22; 23; 24 2024

Question 1 (Marks: 20)

Q.1.1 Explain with an example the difference between a variable and a constant. (4)

Q.1.2 Snake casing is one of the variable naming conventions. Explain snake casing and (4)
give an example.

Q.1.3 Draw a flowchart that will determine the volume of a cylinder. (7)

Input the values of h (height) and r (radius). Calculate the volume (v) using the
formula given below and display the volume. PI is a constant and is equal to 3.14.

v=pi*r*r*h

Q.1.4 Draw a hierarchy chart and indicate the following modules as forming part of the (5)
application to be developed:
• login()
• calculateVolume()
• calculateSurfaceArea()

© The Independent Institute of Education (Pty) Ltd 2024


Page 3 of 5
22; 23; 24 2024

Question 2 (Marks: 15)

Q.2.1 Write the pseudocode to calculate the sum of the numbers 1 to 10. Make use of a (10)
while loop. Comment on your code.

The sample output:


Sum = 109

Q.2.2 Write the “if “statement in a pseudocode snippet. Determine if “a” is less than “b” (5)
or “a” is less than “c”. If “a” is less than either “b” or “c” then display the message
“Yes, it is the correct value” otherwise display the message “You entered the
wrong value”.

© The Independent Institute of Education (Pty) Ltd 2024


Page 4 of 5
22; 23; 24 2024

Question 3 (Marks: 25)

Q.3.1 Declare an array called MONTH. Initialise the array by assigning the values below: (3)

January, February, March, April, May, June, July, August, September, October,
November, December.

Q.3.2 Identify the sorting technique and then explain the logic in the pseudocode (10)
snippet.

for (int z = 0; z < 4; z++)


for (int x= 0; x < 3; x++)
if marks[x] > marks[x+1] then
temp = marks[x]
marks[x] = marks[x+1]
marks[x+1] = temp
endif
endfor
endfor

Q.3.3 Write pseudocode to search for an item price using parallel arrays. (12)

The first array ITEMS, should be populated with values “Pencil”, “Rubber”, and
“Paintbrush” and the second array PRICES, should be populated with values 3, 5
and 10.

The user must be prompted to enter an item to search for: e.g., Paintbrush and
then display its price. Include comments.

END OF PAPER

© The Independent Institute of Education (Pty) Ltd 2024


Page 5 of 5

You might also like