00080.2 rekenaarstudie hg computer studies hg (vraestel 2)

TYD/TIME: 3 UUR/HOURS
PUNTE/MARKS: 100
00080.2
REKENAARSTUDIE HG
COMPUTER STUDIES HG
(VRAESTEL 2)
(PAPER 2)
NOVEMBER 2005
SENIOR SERTIFIKAAT-EKSAMEN
SENIOR CERTIFICATE EXAMINATION
2005
REKENAARSTUDIE HG (VRAESTEL 2)
COMPUTER STUDIES HG (PAPER 2)
Hierdie vraestel bestaan uit 19 bladsye.
This question paper consists of 19 pages.

2
INSTRUKSIES
1.
2.
3.
4.
5.
6.
7.
8.
9.
REKENAARSTUDIE HG (00080.2)
HIERDIE IS ‘N DRIE-UUR-EKSAMEN. WEENS DIE AARD VAN HIERDIE
EKSAMEN IS DIT BELANGRIK OM DAAROP TE LET DAT JY NIE TOEGELAAT
SAL WORD OM DIE EKSAMENLOKAAL VOOR DIE EINDE VAN DIE
EKSAMENSESSIE TE VERLAAT NIE.
Beantwoord AL die vrae.
Vrae 1 en 2 moet beantwoord word deur gebruik te maak van MS Access.
Jy mag enige Java IDE gebruik om die Java-vrae, d.i. vrae 3 en 4, te beantwoord.
Die opsiener sal vir jou ‘n disket gee wat al die lêers bevat wat vir die eksamen
benodig word of jy sal instruksies kry oor waar om die lêers op die netwerk te vind.
Indien jy ‘n disket ontvang het, moet jy jou naam en eksamennommer op die etiket
skryf.
10. Geen drukwerk word vereis nie.
11.
12.
Stoor jou werk gereeld as ‘n voorsorgmaatreël teen kragonderbrekings.
Lees asseblief die vrae noukeurig. Moenie meer doen as wat die vraag vereis nie.
‘n Kopie van die meesterlêers is by die opsiener beskikbaar. As jy per ongeluk die
lêers wat aan jou gegee is beskadig, kan jy die opsiener om nog kopieë vra.
Aan die einde van die eksamen moet jy net die disket inlewer wat deur die opsiener
aan jou gegee is of seker maak dat jou werk op die netwerk gestoor is soos deur
die opsiener/onderwyser aan jou verduidelik is. Maak asseblief seker dat al die
lêers gelees kan word.
Gedurende die eksamen mag jy gebruik maak van die handleidings wat
oorspronklik saam met die apparatuur en programmatuur voorsien is. Jy mag ook
van die HELP-funksies van die programmatuur gebruik maak. Jy mag nie na enige
ander bronmateriaal verwys nie.
Indien jy enigsins twyfel oor die betekenis van ‘n bepaalde Afrikaanse term,
raadpleeg gerus die Engelse weergawe van die vraestel.

INSTRUCTIONS
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
COMPUTER STUDIES HG (00080.2) 3
THIS IS A THREE-HOUR EXAMINATION. 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.
Answer ALL the questions.
Questions 1 and 2 must be answered using MS Access.
You may use any Java IDE to answer the Java questions, i.e. Questions 3 and 4.
The invigilator will give you a disk containing all the files needed for the examination
or you will be given instructions as to where to find the files on the network. If a
disk has been issued, please write your name and examination number on the
label.
Save your work at regular intervals as a precaution against power failures.
Please read the questions carefully. Do not do more than what is required by the
question.
A copy of the master files will be available from the invigilator. Should you
accidentally corrupt the files given to you, you may request further copies from the
invigilator.
At the end of the examination you must hand in only the disk given to you by the
invigilator or you must make sure that all the files have been saved on the network
as explained to you by the invigilator/teacher. Please ensure that all files can be
read.
No printing is required.
During the examination you may make use of the manuals originally supplied with
the hardware and software. You may also use the HELP functions of the software.
You may not refer to any other resource material.

4
REKENAARSTUDIE HG (00080.2)
AFDELING A – DATABASISONTWIKKELING
VRAAG 1
‘n Databasis met die naam “Nobelpryswenners.mdb” is aan jou verskaf. Dit bevat een
tabel genaamd “Hoof”. Elke veld in die tabel is gedefineer as tipe “Text” en het ‘n
grootte van 50 .
Die databasis sal gebruik word om op hoogte te bly van ‘n nuwe boek wat oor
Nobelpryswenners geskryf gaan word. Die databasis benodig omvattende herontwerp.
Jy gaan dit doen deur ‘n nuwe databasis te skep en die data van die oorspronklike
databasis “Nobelpryswenners.mdb” in te voer.
1.1 Skep ‘n nuwe leë databasis genaamd “NPP2006.mdb”. Voer die tabel
genaamd “Hoof” van die databasis genaamd “Nobelpryswenners.mdb” in. [2]
Bring nou die volgende veranderings aan die tabel genaamd “Hoof” in die databasis
genaamd “NPP2006.mdb” aan.
1.2 Die veld genaamd “Naam” word nie meer verlang nie en moet verwyder word.
Wis die veld genaamd “Naam” en die inhoud daarvan uit. [1]
1.3 Verander die veld genaamd “Bladsye” na ‘n numeriese tipe. [1]
1.4 Verander die ander “Text”-velde na geskikte groottes. [2]
1.5 Voeg ‘n “Autonumber”-veld by en stel dit as die Primêre Sleutel. Noem hierdie
veld “MainID”. [2]
1.6 Die huidige data in die veld genaamd “Aanvaar” is leeg om “Ja” aan te dui en
bevat die woord “NEE” om “Nee” aan te dui. Die nuwe veldtipe moet ‘n
regmerkie () vertoon om “Ja” aan te dui en moet leeg wees om “Nee” aan te
dui.
Doen wat ookal nodig is om die veld genaamd “Aanvaar” na ‘n Ja/Nee-tipe te
verander. Maak seker dat die huidige inskrywings behoue bly. [3]
Verskeie nuwe tabelle sal oor ‘n uitgebreide ontwikkelings periode bygevoeg word. Die
eerste van hierdie tabelle is ‘n tabel genaamd “Skrywers” wat gebruik sal word om op
hoogte te bly van die onderskeie skrywers wat betrek gaan word om ‘n aantal bladsye
oor Nobelpryswenners te skryf. Een skrywer kan gevra word om oor ‘n aantal
pryswenners te skryf, maar slegs een skrywer sal aan elke pryswenner se inskrywing
toegewys word.

COMPUTER STUDIES HG (00080.2)
SECTION A – DATABASE DEVELOPMENT
QUESTION 1
The database called “Nobel Prize Winners.mdb” has been provided for you. It
contains one table called “Main”. Each field in the table has been declared of type Text,
with a size of 50.
The database is to be used to keep track of a new book to be written about Nobel Prize
winners. The database requires extensive re-design. You are going to do this by
creating a new database and importing data from the original “Nobel Prize
Winners.mdb” database.
1.1 Create a new blank database called “NPP2006.mdb”. Import the table called
“Main” from the database called “Nobel Prize Winners.mdb”. [2]
Now make the following changes to the table called “Main” in the database called
“NPP2006.mdb”:
1.2 The field called “Name” is no longer required and must be discarded. Delete
the field called “Name” and its contents. [1]
1.3 Change the field called “Pages” to a numerical type. [1]
1.4 Change the other “Text” fields to suitable sizes. [2]
1.5 Add an “Autonumber” field and set it as the Primary Key. Call this field
“MainID”. [2]
1.6 The current data in the field called “Accepted” is blank to indicate “Yes” and
contains the word “NO” to indicate “No”. The new field type should display a
tick () to indicate “Yes” and must be blank to indicate “No”.
Do whatever is necessary to change the field called “Accepted” to a Yes/No
type. Ensure that the current entries are retained. [3]
Several new tables will be added over an extended period of development. The first of
these is a table called “Writers”, which will be used to keep track of the various authors
who will be enlisted to write a number of pages on Nobel Prize winners. One author
may be asked to write on a number of prize winners but only one author will be assigned
to each prize winner’s entry.
5

6
REKENAARSTUDIE HG (00080.2)
1.7 Skep die volgende tabel genaamd “Skrywers” met toepaslik gedefinieerde
velde om die volgende data te stoor. In sommige gevalle sal hierdie meer as
een veld benodig.
(a) Die naam van die skrywer, bestaande uit voorname en van
(b) Die titel, wat slegs Mnr, Me, Dr of Prof moet wees. Die databasisveld
moet tot slegs hierdie inskrywings beperk word.
(c) Die adres van die skrywer (straat/kantoor; stad; land; poskode)
(d) ‘n Kontak telefoonnommer vir die skrywer (bv. Hamburg 3452 333)
Voorbeeld van data van ‘n skrywer: Prof Jens van Dyk,
Oberneuland Str 20
Hamburg
Duitsland
78332
Foon: Hamburg 3452 333
(e) ‘n “Autonumber”-veld wat as ‘n Primêre Sleutel dien. [4]
1.8 Skep ‘n vreemde sleutel (“foreign key”) in die tabel genaamd “Hoof” (noem dit
“SkrywerID”) en skep dan ‘n verwantskap tussen die “Hoof”- en “Skrywers”tabelle.
[2]
1.9 ‘n Skrywer genaamd Professor Jens van Dyk het baie skrywersondervinding in
Nederland en het onderneem om alle materiaal oor wenners uit Nederland te
skryf. Skep ‘n gepaste inskrywing in die “Skrywers”-tabel om die volgende
inligting te stoor wat gebruik sal maak van die verwantskap wat as 1.8 geskep
is. Verander die toepaslike data in die “Hoof”-tabel vir die wenners uit
Nederland.
Prof Jens van Dyk,
Oberneuland Str 20
Hamburg
Duitsland
78332
Foon: Hamburg 3452 333 [2]
1.10 Jacques Depardieu sal oor al die wenners uit Frankryk skryf. Hein Rinkoffel
sal oor al die wenners uit Duitsland skryf. Skep ‘n gepaste inskrywing in die
“Skrywers”-tabel om die volgende inligting te stoor wat gebruik sal maak van
die verwantskap wat as 1.8 geskep is. Verander die toepaslike data in die
“Hoof”-tabel vir die wenners uit Frankryk en Duitsland.
Dr Jacques Depardieu
p.a. Nobelpryskantoor Parys
Foon: Parys 123213
Dr Hein Rinkoffel
p.a. Nobelpryskantoor Berlyn
Foon: Berlyn 123213 [2]
21

COMPUTER STUDIES HG (00080.2) 7
1.7 Create the following table called “Writers” with suitably defined fields to store
the following data. In some cases this will require more than one field.
(a) The name of the writer comprising of the first and last names
(b) The title, which must only be Mr, Ms, Dr or Prof. The database field
should be restricted to allow only these entries.
(c) The address of the writer (street/office; city; country; postal code)
(d) A contact telephone number for the writer (e.g. Hamburg 3452 333)
Example of data for a writer: Prof Jens van Dyk,
20 Oberneuland Str
Hamburg
Germany
78332
Phone: Hamburg 3452 333
(e) An Autonumber field which acts as a Primary Key. [4]
1.8 Create a foreign key in the table called “Main” (call it “WriterID”) and then
create a relationship between the “Main” and “Writers” tables. [2]
1.9 A writer called Professor Jens van Dyk has a lot of experience in writing in the
Netherlands and has undertaken to write all material relating to winners from
the Netherlands. Create a suitable entry in the “Writers” table to store the
following information, which will make use of the relationship created in 1.8.
Alter the appropriate data in the “Main” table for the winners from the
Netherlands.
Prof Jens van Dyk,
20 Oberneuland Str
Hamburg
Germany
78332
Phone: Hamburg 3452 333 [2]
1.10 Jacques Depardieu will be writing about all the winners from France. Hein
Rinkoffel will be writing about all the winners from Germany. Create a suitable
entry in the “Writers” table to store the following information, which will make
use of the relationship created in 1.8. Alter the appropriate data in the “Main”
table for the winners from France and Germany.
Dr Jacques Depardieu
c/o Nobel Prize Paris Office
Phone: Paris 123213
Dr Hein Rinkoffel
c/o Nobel Prize Berlin Office
Phone: Berlin 123213 [2]
21

8
VRAAG 2
REKENAARSTUDIE HG (00080.2)
Gebruik die databasis “NPP2006.mdb” wat jy in vraag 1 geskep het om die volgende
vrae te beantwoord:
LW: As jy onsuksesvol was in die skepping van die databasis “NPP2006.mdb”
maak gebruik van die databasis genaamd “Nobelpryswenners.mdb” in plaas
daarvan. ‘n Gedeelte van die punte sal aan jou toegeken word.
Gebruik kort beskrywende name vir elke navraag.
2.1 Kry al die Nobelpryswenners wat uit Duitsland gekom het en wat die Nobelvredesprys
ontvang het. Vertoon SLEGS hul van, land en jaar in stygende
volgorde volgens vanne. [2]
2.2 Skep ‘n navraag wat al die inskrywings wat “UK” of “U.K.” in die veld genaamd
“Land” het na “United Kingdom” sal verander. [2]
2.3 Skep ‘n navraag wat ‘n berekende veld sal bevat, genaamd “Fooi”, wat die
bedrag in Rand wat aan die skrywer betaal sal word, sal aandui. Die
standaardfooi is R125,00 per bladsy. Die aantal bladsye wat geskryf sal word,
word in die “Bladsye”-veld vertoon. Vertoon die skrywer se naam, bladsye en
die fooi vir die inskrywings in “Hoof” wat verband hou met die inskrywings in
“Skrywers”. [2]
2.4 Skep ‘n navraag wat die naam van die skrywer, die skrywer se ID-nommer, die
som van die aantal bladsye wat hy/sy moet skryf en die totale fooi wat hy/sy sal
ontvang sal vertoon. [3]
9

QUESTION 2
COMPUTER STUDIES HG (00080.2) 9
Use the database “NPP2006.mdb” which you created in Question 1 to answer the
following questions:
NB: If you have been unsuccessful in creating the database “NPP2006.mdb”,
use the database called “Nobel Prize Winners.mdb” instead and you will be
awarded a portion of the marks.
Use short descriptive names for each query.
2.1 Locate all the Nobel Prize winners who came from Germany and who received
the Nobel Peace Prize. Display ONLY their last names, country and year, in
ascending order of last name. [2]
2.2 Create a query which will change all the entries which have “UK” or “U.K.” in
the field called “Country” to “United Kingdom”. [2]
2.3 Create a query which will contain a calculated field called “Fee” which shows
the amount in Rands which will be paid to the writer. The standard fee is
R125,00 per page. The number of pages to be written is shown in the “Pages”
field. Display the writer’s name, pages and the fee for the entries in “Main”
which are related to the entries in “Writers”. [2]
2.4 Create a query which will display the name of the writer, the writer’s ID number,
the sum of the number of pages he/she has to write and the total fee he/she will
receive. [3]
9

10
REKENAARSTUDIE HG (00080.2)
AFDELING B – JAVAPROGRAMMERING
VRAAG 3
Die probleem in Vraag 4 behels die ontwikkeling van ‘n speletjie. Op ‘n latere tydstip sal
dit nodig wees om inligting oor die spelers by te hou.
3.1
3.1.1
Skep ‘n klas (“class”) genaamd “Speler” wat gepas vir hierdie doel sal wees.
Die klas moet EEN “constructor” hê. (2)
3.1.2 Die klas moet die volgende stoor:
(a) Die naam van die speler
(b) Die speler se hoogste telling (2)
3.1.3 Die klas moet “GET”- en “SET”-metodes (“accessor” en “mutator”) hê wat
toegang en verandering tot hierdie veranderlikes sal toelaat. (2)
3.1.4 Die klas moet ‘n “toString()”-metode hê om die veranderlikes te vertoon. (2) [8]
3.2 Skep ‘n klas genaamd “Kenner” wat “Speler” uitbrei en wat ‘n addisionele
eienskap genaamd “sekuriteitKode” het, wat die speler toelaat om die speletjie
gekoppeld (“on line”) te speel. Die klas moet ook “GET”- en “SET”–metodes vir
hierdie eienskap hê. [2]
10

COMPUTER STUDIES HG (00080.2)
SECTION B – JAVA PROGRAMMING
QUESTION 3
The problem in Question 4 involves the development of a game. At some later stage it
will be necessary to keep information on players.
3.1
3.1.1
Create a class called “Player” which will be suitable for this purpose.
The class must have one constructor. (2)
3.1.2 The class must store the following:
(a) The name of the player
(b) The player’s highest score (2)
3.1.3 The class must have GET and SET methods (accessor and mutator) which will
allow these variables to be accessed and changed. (2)
3.1.4 The class should have a toString() method to display the variables. (2) [8]
3.2 Create a class called “Expert” which extends “Player” and which has an
additional attribute called “securityCode”, which allows the player to play on
line. The class should also have GET and SET methods for this attribute. [2]
11
10

12
VRAAG 4
REKENAARSTUDIE HG (00080.2)
Lees die hele vraag deur voordat jy dit begin beantwoord.
Die kaartspel “Pelmenism” behels ‘n stel prentkaarte wat met die regte kant ondertoe op ‘n tafel
geplaas word. Elke speler draai dan twee kaarte om die beurt om om sodoende soortgelyke
kaarte te vind. Wanneer ‘n speler twee soortgelyke kaarte vind, word hulle deur daardie speler
behou. As die twee kaarte verskillend is, moet die speler hulle weer omdraai sodat die regte kant
ondertoe wys. Die oogmerk is dat elke speler die posisie van die kaarte moet onthou en om
soveel pare moontlik op te tel. Wanneer al die kaarte opgetel is (of een paar bly op die tafel oor)
is die spel verby. Elke speler tel die aantal kaarte wat hy/sy opgetel het om die wenner te
bepaal.
Jy is gevra om ‘n bietjie eenvoudige voorlopige kode vir hierdie speletjie te skryf. GEEN
GRAFIKA WORD BENODIG NIE. Die vereistes is soos volg:
‘n Tweedimensionele skikking is ewekansig gevul met pare dierename soos hieronder
aangetoon.
Kat Kalkoen Olifant Haas
Eend Kalkoen Leeu Eend
Kat Hond Hoender Hond
Olifant Haas Leeu Hoender
Hierdie name word nie aan die gebruikers getoon nie. Een gebruiker word versoek om twee
posisies op ‘n slag te kies en hierdie keuse word dan vertoon.
VOORBEELD 1:
Hieronder word die afvoer gegee wanneer ‘n gebruiker posisie 1,1 (dit is Ry 1 en Kolom 1) en 2,2
(dit is Ry 2 en Kolom 2) as sy/haar keuse intik het.
Speler 1 KIES
Bordposisie 1 RY? : 1
Bordposisie 1 KOLOM? : 1
Bordposisie 2 RY? : 2
Bordposisie 2 KOLOM? : 2
XXX XXX XXX XXX
XXX Kalkoen XXX XXX
XXX XXX Hoender XXX
XXX XXX XXX XXX
Speler 2 KIES
Bordposisie 1 RY? :
Speler 1 het nie ‘n paar gekry nie.
Speler 2 maak nou sy/haar keuse.

QUESTION 4
COMPUTER STUDIES HG (00080.2)
Read through the whole question before you begin to answer it.
The card game “Pelmenism” involves placing a set of picture cards face down on a table. Each
player then turns over two cards in turn, trying to find matching cards. When a player finds two
matching cards they are kept by that player. If the two cards chosen differ, the player must turn
them over again so that the right side faces downwards. The objective is for each player to
remember the position of the cards and to pick up as many pairs as possible. When all cards
have been picked up (or one pair remains on the table) then the game is over. Each player
counts the number of cards he/she has picked up in order to determine the winner.
You have been asked to write some simple preliminary code for this game. NO GRAPHICS
ARE REQUIRED. The requirements are as follows:
A two-dimensional array is filled randomly with pairs of names of animals as shown below.
Cat Turkey Elephant Rabbit
Duck Turkey Lion Duck
Cat Dog Chicken Dog
Elephant Rabbit Lion Chicken
The users are not shown these names. One user is prompted to select two positions at a time
and his selection is then displayed.
EXAMPLE 1:
Shown below is the output when a user types in position 1,1 (that is Row 1 and Column 1) and
2,2 (that is Row 2 and Column 2) as his/her selection.
Player 1 SELECT
Board Position 1 ROW? : 1
Board Position 1 COLUMN? : 1
Board Position 2 ROW? : 2
Board Position 2 COLUMN? : 2
XXX XXX XXX XXX
XXX Turkey XXX XXX
XXX XXX Chicken XXX
XXX XXX XXX XXX
Player 2 SELECT
Board Position 1 ROW? :
Player 1 did not locate a pair.
Player 2 now makes his/her
selection.
13

14
VOORBEELD 2:
REKENAARSTUDIE HG (00080.2)
Wanneer ‘n speler ‘n paar kry, gaan hy/sy voort om te speel:
Speler 2 KIES
Bordposisie 1 RY? : 0
Bordposisie 1 KOLOM? : 0
Bordposisie 2 RY? : 2
Bordposisie 2 KOLOM? : 0
Kat XXX XXX XXX
XXX XXX XXX XXX
Kat XXX XXX XXX
XXX XXX XXX XXX
Speler 2 KIES
Bordposisie 1 RY? :
Die program moet telling hou van hoeveel pare elke speler gekies het.
Jou program moet die volgende insluit:
4.1 Skep ‘n klas (“class”) “MemoryCard” wat die volgende insluit:
Speler 2 het ‘n paar gekry en
word gevra om weer te speel.
(a) Geskikte “Constructor(s)”
(b) Geskikte eienskappe om inligting oor die volgende te hou:
• die naam van die kaart (Haas, Kat, Olifant, ens.)
• of die kaart met die regte kant boontoe (d.w.s. die speler kan die name
van die kaarte sien) of met die regte kant ondertoe (d.w.s. die speler
kan nie die name van die kaarte sien nie) is
• wie die paar gekies het (Speler 1 of Speler 2)
(c) Geskikte “GET”- en “SET”-metodes (“accessors” en “mutators”)
(d) ‘n Geskikte “toString()”-metode om die naam van die kaart te vertoon
wanneer dit met die regte kant boontoe is en om “XXX” te vertoon as dit
met die regte kant ondertoe is. [11]
4.2 Die hooftoepassing moet begin deur die gebruiker te vra om ‘n roostergrootte
(die grootte van die bord) te kies en die gebruiker moet slegs 4, 6 of 8 kan kies
(geen onewe getalle nie). Die toevoer moet geldig verklaar word om hierdie
beperking af te dwing. (Die voorbeeld aan die begin van die vraag het ‘n
roostergrootte van 4 gebruik.) [10]
4.3 ‘n Tweedimensionele skikking van “MemoryCard”-objekte moet dan met pare
ewekansiggekose diername gevul word. Die stel name, waaruit hierdie
skikking ewekansig gekies is, word op die skyf in die lêer genaamd
“Animals.txt” verskaf. Die inhoud word hieronder aangedui.
Rabbit
Lion
Cat
Dog
Duck
Chicken
Turkey
Elephant
Snake
Parrot
Goose
Giraffe
Rat
Mouse
Tortoise
Horse
Buffalo
Hedgehog
Hippo
Tiger
Chimp
Gorilla
Seal
Whale
Dolphin
Donkey
Eagle
Parakeet
Baboon
Bear
Cow
Sheep
Pigeon
Kangaroo
Badger
Beaver
Bat
Tarantula
Koala
Panda
Platypus
Skunk
Crocodile
Springbok
Tahr
Eel
Puffin
Fulmar
Zebra
Aardvark [8]

EXAMPLE 2:
COMPUTER STUDIES HG (00080.2)
When a player locates a pair, he/she continues playing:
Player 2 SELECT
Board Position 1 ROW? : 0
Board Position 1 COLUMN? : 0
Board Position 2 ROW? : 2
Board Position 2 COLUMN? : 0
Cat XXX XXX XXX
XXX XXX XXX XXX
Cat XXX XXX XXX
XXX XXX XXX XXX
Player 2 SELECT
Board Position 1 ROW? :
Player 2 located a pair and is
asked to play again.
The program should keep a count of how many pairs have been selected by each player.
Your program should include the following:
4.1 Create a class called “MemoryCard” which includes the following:
(a) Suitable Constructor(s)
(b) Suitable attributes to keep information on the following:
• the name of the card (Rabbit, Cat, Elephant, etc.)
• whether the card is face up (i.e. the player can see the names of the
cards) or face down (i.e. the player cannot see the names of the cards)
• who has chosen the pair (Player 1 or Player 2)
(c) Suitable GET and SET methods (accessors and mutators)
(d) A suitable toString method to display the name of the card if it is face up,
and to display “XXX” if it is face down. [11]
4.2 The main application should begin by asking the user to select a grid size (the
size of the board) and the user should be allowed to only select a size of 4, 6 or
8 (no odd numbers). The input must be validated to enforce this restriction.
(The example at the start of this question used a grid size of 4.) [10]
4.3 A two-Dimensional array of MemoryCard objects should then be filled with pairs
of randomly chosen animal names. The set of names, from which this array is
randomly chosen, is provided on disk in the file called “Animals.txt”. The
contents are shown below.
Rabbit
Lion
Cat
Dog
Duck
Chicken
Turkey
Elephant
Snake
Parrot
Goose
Giraffe
Rat
Mouse
Tortoise
Horse
Buffalo
Hedgehog
Hippo
Tiger
Chimp
Gorilla
Seal
Whale
Dolphin
Donkey
Eagle
Parakeet
Baboon
Bear
Cow
Sheep
Pigeon
Kangaroo
Badger
Beaver
Bat
Tarantula
Koala
Panda
15
Platypus
Skunk
Crocodile
Springbok
Tahr
Eel
Puffin
Fulmar
Zebra
Aardvark [8]

16
REKENAARSTUDIE HG (00080.2)
4.4 Die spel begin dan vir twee spelers. Speler 1 kies ‘n ry en ‘n kolom vir sy/haar
eerste kaart en dan vir sy/haar tweede kaart. As hy/sy suksesvol is, sal die
twee kaarte sigbaar bly vir die res van die spel. Hy/Sy word toegelaat om nog
keuses uit te oefen totdat hy/sy onsuksesvol is. As sy/haar keuse onsuksesvol
is, is sy/haar beurt verby en Speler 2 maak dan sy/haar keuse.
Die huidige stand van die spel moet na elke rondte op die skerm vertoon word
(soos hieronder aangedui). Die pare suksesvol gekose dierename moet
sigbaar wees, anders moet “XXX” vertoon word.
Bordposisie 1 RY? : 0
Bordposisie 1 KOLOM? : 2
Bordposisie 2 RY? : 3
Bordposisie 2 KOLOM? : 0
XXX XXX Olifant Leeu
XXX XXX XXX XXX
Leeu XXX Kalkoen XXX
Olifant XXX XXX Kalkoen
Speler 2 KIES
Bordposisie 1 RY? :
Huidige stand in spel
toon suksesvolle
keuses en name wat
nog opgespoor moet
word
Die huidige status van die bord moet bygewerk word om aan te dui watter
speler suksesvol ‘n paar gekies het. [13]
4.5 Wanneer ‘n speler versoek word vir die posisie in die eerste Ry kan hy/sy die
woord “HELP” in plaas van ‘n getal intik. ‘n Lys van die beskikbare dierename
word dan in alfabetiese volgorde vertoon en die gebruiker word dan weer gevra
om die Rygetal in te tik. (Let wel: Dit is net beskikbaar vir die speler se eerste
RY-inskrywing, maar dit is beskikbaar elke keer as enige van die twee spelers
‘n nuwe kaartkeuse maak.)
Speler 1 KIES
Bordposisie 1 RY? : HELP
Die beskikbare dierename is:
1 - Cat
2 - Chicken
3 - Dog
4 - Duck
5 - Elephant
6 - Lion
7 - Rabbit
8 - Turkey
Let daarop dat hierdie name
vir ‘n 4x4-skikking ewekansig
uit die lys name op die skyf
gekies is.
Bordposisie 1 RY? : [10]

COMPUTER STUDIES HG (00080.2)
4.4 The game then commences for two players. Player 1 selects a row and a
column for his/her first card and then for his/her second card. If he/she is
successful the two cards will remain visible for the remainder of the game.
He/She is allowed to keep making selections until he/she is unsuccessful. If
his/her choice is unsuccessful then his/her turn is finished and Player 2 makes
his/her selection.
The current stage of the game should be displayed on the screen after each
turn (as shown below). The pairs of successfully chosen animal names should
be visible, otherwise “XXX” should be displayed.
Board Position 1 ROW? : 0
Board Position 1 COLUMN? : 2
Board Position 2 ROW? : 3
Board Position 2 COLUMN? : 0
XXX XXX Elephant Lion
XXX XXX XXX XXX
Lion XXX Turkey XXX
Elephant XXX XXX Turkey
Player 2 SELECT
Board Position 1 ROW? :
17
Current stage of game
showing successful
choices and names
still to be located
The current state of the board should be updated to reflect which player has
successfully chosen a pair. [13]
4.5 When a player is prompted for the first Row position he/she can type the word
“HELP” instead of a number. A list of the available animal names is then
displayed in alphabetical order and the user is again requested to enter the
Row number. (Note: This is only available for the player’s first ROW entry, but
it is available each time either player makes a new card selection.)
Player 1 SELECT
Board Position 1 ROW? :HELP
The available animal names are:
1 - Cat
2 - Chicken
3 - Dog
4 - Duck
5 - Elephant
6 - Lion
7 - Rabbit
8 - Turkey
Note that these 8 names for a
4 X 4 array were randomly
selected from the list of
names on disk.
Board Position 1 ROW? : [10]

18
REKENAARSTUDIE HG (00080.2)
4.6 Wanneer al die kaarte gekies is (of wanneer slegs een paar op die tafel oorbly)
moet die boodskap “Spel Klaar” vertoon word en moet die aantal kaarte (of
pare kaarte) wat suksesvol deur Speler 1 en Speler 2 gekies is op die skerm
vertoon word. [8]
60
TOTAAL: 100 PUNTE

COMPUTER STUDIES HG (00080.2)
4.6 When all cards have been selected (or when only one pair remains on the
table) the message “Game Over” should be displayed and the number of cards
(or pairs of cards) successfully selected by Player 1 and Player 2 should be
displayed on the screen. [8]
19
60
TOTAL: 100 MARKS