{"id":216,"date":"2022-01-20T15:57:40","date_gmt":"2022-01-20T14:57:40","guid":{"rendered":"https:\/\/wiskunst.hjgsoft.nl\/?page_id=216"},"modified":"2022-01-24T09:45:47","modified_gmt":"2022-01-24T08:45:47","slug":"oefeningen","status":"publish","type":"page","link":"https:\/\/wiskunst.nl\/index.php\/programmeren1\/programmeren\/oefeningen\/","title":{"rendered":"Oefeningen"},"content":{"rendered":"

Hier vindt u de oplossingen van de oefeningen.<\/p>\n

Natuurlijk geldt hier dat u uw uiterste best heeft gedaan alvorens de oplossingen te raadplegen.<\/p>\n

Verder geldt dat de oplossing die u hier vindt natuurlijk niet dezelfde hoeft te zijn als uw oplossing.<\/p>\n

<\/a>Ga naar:<\/p>\n

Oefening 8.1<\/a>
\nOefening 8.2<\/a>
\nOefening 9.1<\/a>
\nOefening 9.2<\/a>
\nOefening 10.1<\/a>
\nOefening 10.2<\/a>
\nOefening 11.1<\/a>
\nOefening 11.2<\/a>
\nOefening 11.3<\/a>
\nOefening 11.4<\/a>
\nOefening 11.5<\/a>
\nOefening 11.6<\/a>
\nOefening 12.1<\/a>
\nOefening 12.2<\/a>
\nOefening 12.3<\/a>
\nOefening 13.1<\/a>
\nOefening 14.1<\/a><\/p>\n

<\/a>program O8_1;<\/span><\/p>\n

type s60 = string[60];<\/span><\/p>\n

var regel: s60;<\/span><\/p>\n

procedure horlijn;<\/span>
\n{maak een horizontale lijn van 70 x-en}<\/span>
\n\u00a0 var x: integer;<\/span><\/p>\n

begin<\/span>
\n\u00a0 for x := 1 to 70 do<\/span>
\n\u00a0 \u00a0 write(‘x’);<\/span>
\n\u00a0 writeln;<\/span>
\nend;<\/span><\/p>\n

procedure kader(r: s60);<\/span>
\n{maak een kader van x-en en zet de regel daarin gecentreerd neer}<\/span>
\n\u00a0 var l: integer;<\/span><\/p>\n

begin<\/span>
\n\u00a0 horlijn;<\/span>
\n\u00a0 l := length(r);<\/span>
\n\u00a0 write(‘x’);<\/span>
\n\u00a0 gotoxy(35 – (l div 2), wherey); {begin regel op pos 35 –\u00a0 \u00a0helft lengte regel}<\/span>
\n\u00a0 write(r);<\/span>
\n\u00a0 gotoxy(70, wherey);<\/span>
\n\u00a0 writeln(‘x’);<\/span>
\n\u00a0 horlijn;<\/span>
\nend;<\/span><\/p>\n

begin<\/span>
\n\u00a0 write(‘Geef een regeltje tekst: ‘);<\/span>
\n\u00a0 readln(regel);<\/span>
\n\u00a0 writeln;<\/span>
\n\u00a0 writeln;<\/span>
\n\u00a0 kader(regel);<\/span>
\nend.<\/span><\/p>\n

Naar boven<\/a><\/p>\n

<\/a>program O8_2;<\/span><\/p>\n

type s60 = string[60];<\/span><\/p>\n

var regel: s60;<\/span><\/p>\n

procedure horlijn(k: char);<\/span>
\n{maak een horizontale lijn van 70 x-en}<\/span>
\n\u00a0 var x: integer;<\/span><\/p>\n

begin<\/span>
\n\u00a0 for x := 1 to 70 do<\/span>
\n\u00a0 \u00a0 write(k);<\/span>
\n\u00a0 writeln;<\/span>
\nend;<\/span><\/p>\n

procedure kader(r: s60; k: char);<\/span>
\n{maak een kader van x-en en zet de regel daarin gecentreerd neer}<\/span>
\n\u00a0 var l: integer;<\/span><\/p>\n

begin<\/span>
\n\u00a0 horlijn(k);<\/span>
\n\u00a0 l := length(regel);<\/span>
\n\u00a0 write(k);<\/span>
\n\u00a0 gotoxy(35 – (l div 2), wherey); {begin regel op pos 35 –\u00a0 helft lengte regel}<\/span>
\n\u00a0 write(r);<\/span>
\n\u00a0 gotoxy(70, wherey);<\/span>
\n\u00a0 writeln(k);<\/span>
\n\u00a0 horlijn(k);<\/span>
\nend;<\/span><\/p>\n

begin<\/span>
\n\u00a0 write(‘Geef een regeltje tekst: ‘);<\/span>
\n\u00a0 readln(regel);<\/span>
\n\u00a0 writeln;<\/span>
\n\u00a0 writeln;<\/span>
\n\u00a0 kader(regel,’#’);<\/span>
\nend.<\/span><\/p>\n

Naar boven<\/a><\/p>\n

<\/a>program O9_1;<\/span><\/p>\n

function FibIter(n: Byte): Integer;<\/span>
\n\u00a0 var t, t1, t2, s: integer;<\/span>
\nbegin<\/span>
\n\u00a0 if (n = 1) or (n = 2) then<\/span>
\n\u00a0 \u00a0 FibIter := 1<\/span>
\n\u00a0 else<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 t1 := 1;<\/span>
\n\u00a0 \u00a0 \u00a0 t2 := 1;<\/span>
\n\u00a0 \u00a0 \u00a0 for t := 3 to n do<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 ts := t1 + t2;<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 t1 := t2;<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 t2 := ts;<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 end;<\/span>
\n\u00a0 \u00a0 \u00a0 FibIter := ts;<\/span>
\n\u00a0 \u00a0 end;\u00a0<\/span>
\nend;<\/span><\/p>\n

begin<\/span>
\n\u00a0 writeln(FibIter(12));<\/span>
\nend.<\/span><\/p>\n

Naar boven<\/a><\/p>\n

<\/a>program O9_2;<\/span><\/p>\n

type s80 = string[80];<\/span><\/p>\n

function UCase(s: s80): s80;<\/span>
\n\u00a0 var x: byte;<\/span>
\nbegin<\/span>
\n\u00a0 for x := 1 to length(s) do<\/span>
\n\u00a0 \u00a0 if s[x] in [‘a’..’z’] then<\/span>
\n\u00a0 \u00a0 \u00a0 s[x] := chr(ord(s[x]) – 32);<\/span>
\n\u00a0 UCase := s;<\/span>
\nend;<\/span><\/p>\n

begin<\/span>
\n\u00a0 writeln(UCase(’turbo pascal’));<\/span>
\nend.<\/span><\/p>\n

Naar boven<\/a><\/p>\n

<\/a>program O10_1;<\/span><\/p>\n

type s80 = string[80];<\/span><\/p>\n

var<\/span>
\n\u00a0 tb: text;<\/span>
\n\u00a0 regel,bestnaam: s80;<\/span>
\n\u00a0 aantal: integer;<\/span><\/p>\n

function Bestaat(bn: s80): boolean;<\/span>
\n\u00a0 var b: file;<\/span>
\nbegin<\/span>
\n\u00a0 assign(b,bn);<\/span>
\n\u00a0 {$I-}<\/span>
\n\u00a0 \u00a0 reset(b);<\/span>
\n\u00a0 {$I+}<\/span>
\n\u00a0 if IOResult = 0 then<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 Bestaat := true;<\/span>
\n\u00a0 \u00a0 \u00a0 close(b);<\/span>
\n\u00a0 \u00a0 end<\/span>
\n\u00a0 else<\/span>
\n\u00a0 \u00a0 Bestaat := false;<\/span>
\nend;<\/span><\/p>\n

begin<\/span>
\n\u00a0 write(‘Geef bestandsnaam: ‘);<\/span>
\n\u00a0 readln(bestnaam);<\/span>
\n\u00a0 if Bestaat(bestnaam) then<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 assign(tb,bestnaam);<\/span>
\n\u00a0 \u00a0 \u00a0 reset(tb);<\/span>
\n\u00a0 \u00a0 \u00a0 while not eof(tb) do<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 readln(tb,regel);<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 aantal := aantal + 1;<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 end;<\/span>
\n\u00a0 \u00a0 \u00a0 close(tb);<\/span>
\n\u00a0 \u00a0 \u00a0 writeln(bestnaam,’ heeft ‘,aantal,’ regels.’);<\/span>
\n\u00a0 \u00a0 end<\/span>
\n\u00a0 else<\/span>
\n\u00a0 \u00a0 writeln(bestnaam,’ niet gevonden.’);<\/span>
\nend.<\/span><\/p>\n

Naar boven<\/a><\/p>\n

<\/a>program O10_2;<\/span><\/p>\n

type s80 = string[80];<\/span><\/p>\n

var<\/span>
\n\u00a0 tbo,tbn: text;<\/span>
\n\u00a0 regel,bestnaam,extensie: s80;<\/span>
\n\u00a0 aantal: integer;<\/span><\/p>\n

function UCase(s: S80): s80;<\/span>
\n\u00a0 var x: byte;<\/span>
\nbegin<\/span>
\n\u00a0 for x := 1 to length(s) do<\/span>
\n\u00a0 \u00a0 if s[x] in [‘a’..’z’] then<\/span>
\n\u00a0 \u00a0 \u00a0 s[x] := chr(ord(s[x])-32);<\/span>
\n\u00a0 UCase := s;<\/span>
\nend;<\/span><\/p>\n

function Bestaat(bn: s80): boolean;<\/span>
\n\u00a0 var b: file;<\/span>
\nbegin<\/span>
\n\u00a0 assign(b,bn);<\/span>
\n\u00a0 {$I-}<\/span>
\n\u00a0 \u00a0 reset(b);<\/span>
\n\u00a0 {$I+}<\/span>
\n\u00a0 if IOResult = 0 then<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 Bestaat := true;<\/span>
\n\u00a0 \u00a0 \u00a0 close(b);<\/span>
\n\u00a0 \u00a0 end<\/span>
\n\u00a0 else<\/span>
\n\u00a0 \u00a0 Bestaat := false;<\/span>
\nend;<\/span><\/p>\n

begin<\/span>
\n\u00a0 write(‘Geef naam van Pascal-bestand: ‘);<\/span>
\n\u00a0 readln(bestnaam);<\/span>
\n\u00a0 if UCase(copy(bestnaam,length(bestnaam)-3,4)) = ‘.PAS’\u00a0 then<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 if Bestaat(bestnaam) then<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 aantal := 1;<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 assign(tbo,bestnaam);<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 reset(tbo);<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 assign(tbn,copy(bestnaam,1,length(bestnaam)-3)+’NUM’);<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 rewrite(tbn);<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 while not eof(tbo) do<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 readln(tbo,regel);<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 writeln(tbn,aantal:5,’: ‘,regel); {met aantal:5 worden 5 posities voor aantal gereserveerd en wordt aantal meteen rechts uitgelijnd.}<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 aantal := aantal + 1;<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 end;<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 close(tbo);<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 close(tbn);<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 writeln(‘klaar.’);<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 end<\/span>
\n\u00a0 \u00a0 \u00a0 else<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 writeln(bestnaam,’ niet gevonden.’);<\/span>
\n\u00a0 \u00a0 end<\/span>
\n\u00a0 else<\/span>
\n\u00a0 \u00a0 writeln(bestnaam,’ is geen Pascal-bestand.’);<\/span>
\nend.<\/span><\/p>\n

Naar boven<\/a><\/p>\n

<\/a>function <\/span>FacIter(n: byte): integer;<\/span>
\nvar<\/span>
\n\u00a0 \u00a0 t: byte;<\/span>
\n\u00a0 \u00a0 p: integer;<\/span>
\nbegin<\/span>
\n\u00a0 p := 1;<\/span>
\n\u00a0 for t := 1 to n do<\/span>
\n\u00a0 \u00a0 p := p * t;<\/span>
\n<\/b>\u00a0 FacIter := p;<\/span>
\n<\/b>end;<\/span>
\n<\/b><\/span>
\nNaar boven<\/a><\/p>\n

<\/a>Program O11_2;<\/span><\/p>\n

Var<\/span>
\n\u00a0 i: Integer;<\/span><\/p>\n

Function FibRec(n: Byte): Integer;<\/span>
\nBegin<\/span>
\n\u00a0 If (n=1) or (n=2) Then<\/span>
\n\u00a0 \u00a0 FibRec := 1<\/span>
\n\u00a0 Else<\/span>
\n\u00a0 \u00a0 FibRec := FibRec(n-1) + FibRec(n-2);<\/span>
\nEnd;<\/span><\/p>\n

Function FibIter(n: Byte): Integer;<\/span>
\n\u00a0 var t,t1,t2,ts: Integer;<\/span>
\nBegin<\/span>
\n\u00a0 If (n=1) Or (n=2) Then<\/span>
\n\u00a0 \u00a0 FibIter := 1<\/span>
\n\u00a0 Else<\/span>
\n\u00a0 \u00a0 Begin<\/span>
\n\u00a0 \u00a0 \u00a0 t1 := 1;<\/span>
\n\u00a0 \u00a0 \u00a0 t2 := 1;<\/span>
\n\u00a0 \u00a0 \u00a0 For t := 3 to n Do<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 Begin<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 ts := t1 + t2;<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 t1 := t2;<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 t2 := ts;<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 End;<\/span>
\n\u00a0 \u00a0 \u00a0 FibIter := ts;<\/span>
\n\u00a0 \u00a0 End;<\/span>
\nEnd;<\/span><\/p>\n

Begin<\/span>
\n\u00a0 Write(‘Geef n-e term (>0): ‘);<\/span>
\n\u00a0 Readln(i);<\/span>
\n\u00a0 Writeln(‘De ‘,i,’-e term is ‘,FibIter(i),’ [Iteratief].’);<\/span>
\n\u00a0 Writeln(‘De ‘,i,’-e term is ‘,FibRec(i),’ [Recursief].’);<\/span>
\n\u00a0 Writeln;<\/span>
\nEnd.<\/span><\/p>\n

Naar boven<\/a><\/p>\n

<\/a>Program O11_3;<\/span><\/p>\n

\u00a0 var<\/span>
\n\u00a0 \u00a0 As: Byte;<\/span>
\n\u00a0 \u00a0 Aantal: Integer;<\/span><\/p>\n

Procedure Hanoi(a: Byte;s1,s2,s3: Char);<\/span>
\nBegin<\/span>
\n\u00a0 Aantal := Aantal + 1;<\/span>
\n\u00a0 If a=1 Then<\/span>
\n\u00a0 \u00a0 Write(s1,’->’,s3,’ ‘)<\/span>
\n\u00a0 Else<\/span>
\n\u00a0 \u00a0 Begin<\/span>
\n\u00a0 \u00a0 \u00a0 Hanoi(a-1,s1,s3,s2);<\/span>
\n\u00a0 \u00a0 \u00a0 Write(s1,’->’,s3,’ ‘);<\/span>
\n\u00a0 \u00a0 \u00a0 Hanoi(a-1,s2,s1,s3);<\/span>
\n\u00a0 \u00a0 End<\/span>
\nEnd;<\/span><\/p>\n

Begin<\/span>
\n\u00a0 Write(‘Geef aantal stenen: ‘);<\/span>
\n\u00a0 Readln(As);<\/span>
\n\u00a0 Aantal := 0;<\/span>
\n\u00a0 Hanoi(As,’A’,’B’,’C’);<\/span>
\n\u00a0 Writeln;<\/span>
\n\u00a0 Writeln;<\/span>
\n\u00a0 Writeln(‘Minimaal aantal zetten: ‘,Aantal);<\/span>
\n\u00a0 Writeln;<\/span>
\nEnd.<\/span><\/p>\n

Naar boven<\/a><\/p>\n

<\/a>function <\/span>Keerom(s: s80): s80;<\/span>
\n<\/b>begin<\/span>
\n\u00a0 if length(s) = 1 then<\/span>
\n\u00a0 \u00a0 Keerom := s<\/span>
\n\u00a0 else<\/span>
\n<\/b>\u00a0 \u00a0 Keerom := copy(s,length(s),1) + Keerom(copy(s,1,length(s)-1))<\/span>
\n<\/b>end;<\/span><\/span>
\n<\/b><\/span>
\nNaar boven<\/a><\/p>\n

<\/a>function <\/span>Keer(a,b: integer): integer;<\/span>
\n<\/b>begin<\/span>
\n\u00a0 if (a=0) or (b=0) then<\/span>
\n\u00a0 \u00a0 Keer := 0<\/span>
\n\u00a0 else<\/span>
\n\u00a0 \u00a0 if a=1 then<\/span>
\n\u00a0 \u00a0 \u00a0 <\/span>Keer := b<\/span>
\n\u00a0 \u00a0 else<\/span>
\n\u00a0 \u00a0 \u00a0 <\/span>Keer := b + Keer(a-1,b)<\/span>
\n<\/b>end;<\/span><\/span>
\n<\/b><\/span>
\nNaar boven<\/a><\/p>\n

<\/a>Deze functie rekent a*b uit, waarbij a en b positieve gehele getallen moeten zijn.
\nDeze recursieve methode is een (idiote) implementatie van Ethiopisch vermenigvuldigen:<\/p>\n

Het verhaal gaat dat er op een markt in Ethiopi\u00eb er op enig moment onenigheid ontstond tussen een koper en verkoper van koeien over de totale prijs.
\nDe koper had 19 koeien tegen 11 geldstukken per koe gekocht en beide konden niet verder dan 100 rekenen.
\nOm te voorkomen dat beide mannen met elkaar op de vuist zouden gaan werd vlug de dorps-wijze erbij gehaald.
\nDe bracht een zak vol kleine steentjes mee. Op de plaats aangekomen maakte hij twee rijen kuiltjes boven elkaar in het zand.
\nIn het eerste kuiltje van de bovenste rij deed hij 19 stenen. In het kuiltje daaronder 11.
\nIn het kuiltje daarnaast (bovenste rij) deed hij de helft (evt. naar beneden afgerond) van het aantal steentjes van het kuiltje links, dus 9.
\nIn het kuiltje daaronder deed hij het dubbele van het kuiltje daar links van, dus 22.
\nHij ging daarmee door totdat in het meest rechtse kuiltje van de bovenste rij nog maar 1 steentje lag.
\nIn dit voorbeeld waren dus de volgende twee rijen steentjes ontstaan:<\/p>\n

19\u00a0\u00a09\u00a0\u00a04\u00a0\u00a02\u00a0\u00a01<\/span>
\n11\u00a022\u00a044\u00a088\u00a0176<\/span>
\n<\/span>
\nNu ging hij alle steentjes verzamelen uit de onderste rij kuiltjes waarvan het aantal steentje in de corresponderende kuiltjes daarboven oneven was.
\nDus de steentjes uit het eerste, tweede en vijfde kuiltje: resp. 11, 22 en 176.
\nTot slot telde hij de verzamelde steentjes en zij tegen de koper dat hij 209 (=11+22+176) geldstukken moest betalen.<\/p>\n

Naar boven<\/a><\/p>\n

<\/a>program\u00a0O12_1;<\/span><\/p>\n

const<\/span>
\n\u00a0 Max = 10;<\/span><\/p>\n

type<\/span>
\n\u00a0 TMatrix = array[1..Max,1..Max] of real;<\/span><\/p>\n

var<\/span>
\n\u00a0 MatrixA, MatrixB, MatrixP: TMatrix;<\/span>
\n\u00a0 rijen, kolommen: byte;<\/span><\/p>\n

procedure\u00a0VoerMatrixIn(r,k:\u00a0byte;var\u00a0m:\u00a0TMatrix);<\/span>
\n\u00a0 var rij,kolom: byte;<\/span>
\nbegin<\/span>
\n\u00a0 for rij := 1 to r do<\/span>
\n\u00a0 \u00a0 for kolom := 1 to k do<\/span>
\n\u00a0 \u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 write(‘Geef element[‘,rij,’,’,kolom,’]: ‘);<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 readln(m[rij,kolom]);<\/span>
\n\u00a0 \u00a0 \u00a0 end;<\/span>
\nend;<\/span><\/p>\n

procedure\u00a0ToonMatrix(d:\u00a0byte;m:\u00a0TMatrix);<\/span>
\n\u00a0 var rij,kolom: byte;<\/span>
\nbegin<\/span>
\n\u00a0 for rij := 1 to d do<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 for\u00a0kolom\u00a0:=\u00a01\u00a0to\u00a0d\u00a0do<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 write(m[rij,kolom]:8:2);<\/span>
\n\u00a0 \u00a0 \u00a0 writeln;<\/span>
\n\u00a0 \u00a0 end;<\/span>
\nend;<\/span><\/p>\n

procedure\u00a0VermMatrices(r,k:\u00a0byte;m1,m2:\u00a0TMatrix;var\u00a0m3:\u00a0TMatrix);<\/span>
\n\u00a0 var<\/span>
\n\u00a0 \u00a0 d,s,z,rij,kolom: byte;<\/span>
\n\u00a0 \u00a0 p: real;<\/span>
\nbegin<\/span>
\n\u00a0 if r > k then<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 d\u00a0:=\u00a0r;<\/span>
\n\u00a0 \u00a0 \u00a0 s\u00a0:=\u00a0k;<\/span>
\n\u00a0 \u00a0 end<\/span>
\n\u00a0 else<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 d\u00a0:=\u00a0k;<\/span>
\n\u00a0 \u00a0 \u00a0 s\u00a0:=\u00a0r;<\/span>
\n\u00a0 \u00a0 end;<\/span>
\n\u00a0 for rij := 1 to d do<\/span>
\n\u00a0 \u00a0 for kolom := 1 to d do<\/span>
\n\u00a0 \u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 p := 0;<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 for z := 1 to s do<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 p := p + m1[rij,z] * m2[z,kolom];<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 m3[rij,kolom] := p;<\/span>
\n\u00a0 \u00a0 \u00a0 end;<\/span>
\nend;<\/span><\/p>\n

begin<\/span>
\n\u00a0 write(‘Geef aantal kolommen van 1e matrix: ‘);<\/span>
\n\u00a0 readln(kolommen);<\/span>
\n\u00a0 write(‘Geef aantal rijen van 1e matrix: ‘);<\/span>
\n\u00a0 readln(rijen);<\/span>
\n\u00a0 writeln(‘Eerste matrix inlezen:’);<\/span>
\n\u00a0 writeln;<\/span>
\n\u00a0 VoerMatrixIn(rijen,kolommen,MatrixA);<\/span>
\n\u00a0 writeln;<\/span>
\n\u00a0 writeln(‘Tweede matrix inlezen:’);<\/span>
\n\u00a0 writeln;<\/span>
\n\u00a0 VoerMatrixIn(kolommen,rijen,MatrixB);<\/span>
\n\u00a0 writeln;<\/span>
\n\u00a0 VermMatrices(rijen,kolommen,MatrixA,MatrixB,MatrixP);<\/span>
\n\u00a0 writeln(‘Resultaat vermenigvuldiging:’);<\/span>
\n\u00a0 writeln;<\/span>
\n\u00a0 if kolommen > rijen then<\/span>
\n\u00a0 \u00a0 rijen := kolommen;<\/span>
\n\u00a0 ToonMatrix(rijen,MatrixP);<\/span>
\nend.<\/span><\/p>\n

Naar boven<\/a><\/p>\n

<\/a>program\u00a0O12_2;<\/span><\/p>\n

type<\/span>
\n\u00a0 s80 = string[80];<\/span>
\n\u00a0 TDatum =<\/span>
\n\u00a0 \u00a0 record<\/span>
\n\u00a0 \u00a0 \u00a0 jaar,\u00a0maand,\u00a0dag:\u00a0integer;<\/span>
\n\u00a0 \u00a0 end;<\/span><\/p>\n

var<\/span>
\n\u00a0 Datum: TDatum;<\/span>
\n\u00a0 sDatum: s80;<\/span><\/p>\n

function\u00a0CorrecteDatum(j,m,d:\u00a0integer):\u00a0Boolean;<\/span>
\n{De volgende constructie heet een const-array. Kijk goed naar het handige gebruik hiervan!}<\/span>
\n\u00a0 const<\/span>
\n\u00a0 \u00a0 ad: array[1..12] of byte = (31,28,31,30,31,30,31,31,30,31,30,31);<\/span>
\n\u00a0 var<\/span>
\n\u00a0 \u00a0 schrikkel, ok: Boolean;<\/span>
\nbegin<\/span>
\n\u00a0 ok := (m>=1) and (m<=12);<\/span>
\n\u00a0 if ok then<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n{Een jaar is schrikkel als het deelbaar is door 4 maar niet door 100 tenzij door 400}<\/span>
\nschrikkel\u00a0:=\u00a0(j\u00a0mod\u00a04\u00a0=\u00a00)\u00a0and\u00a0((j\u00a0mod\u00a0100\u00a0<>\u00a00)\u00a0or\u00a0(j\u00a0mod\u00a0400\u00a0=\u00a00));<\/span>
\n\u00a0 \u00a0 \u00a0 if\u00a0schrikkel\u00a0and\u00a0(m=2)\u00a0then<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 ok := (d <= 29)<\/span>
\n\u00a0 \u00a0 \u00a0 else<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 ok := (d <= ad[m]);<\/span>
\n\u00a0 \u00a0 end;<\/span>
\n\u00a0 CorrecteDatum := ok;<\/span>
\nend;<\/span><\/p>\n

procedure\u00a0StringNaarDatum(s:\u00a0s80;\u00a0var\u00a0d:\u00a0TDatum);<\/span>
\n\u00a0 var<\/span>
\n\u00a0 \u00a0 p, as, c: integer;<\/span>
\n\u00a0 \u00a0 ok: boolean;<\/span>
\n\u00a0 \u00a0 dt: TDatum;<\/span>
\nbegin<\/span>
\n\u00a0 p := 1;<\/span>
\n\u00a0 ok := true;<\/span>
\n\u00a0 if s[p] in [‘0’..’9′] then<\/span>
\n\u00a0 \u00a0 p := p + 1<\/span>
\n\u00a0 else<\/span>
\n\u00a0 \u00a0 ok := false;<\/span>
\n\u00a0 while ok and (p <= length(s)) do<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 if\u00a0ok\u00a0and\u00a0((s[p]\u00a0in\u00a0[‘0’..’9′])\u00a0or\u00a0(s[p]\u00a0in\u00a0[‘-‘,’\/’]))\u00a0then<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 p := p + 1<\/span>
\n\u00a0 \u00a0 \u00a0 else<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 ok := false;<\/span>
\n\u00a0 \u00a0 \u00a0 if\u00a0s[p]\u00a0in\u00a0[‘-‘,’\/’]\u00a0then<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 as := as + 1;<\/span>
\n\u00a0 \u00a0 end;<\/span>
\n\u00a0 with dt do<\/span>
\n\u00a0 \u00a0 if ok then<\/span>
\n\u00a0 \u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 p := Pos(‘-‘,s);<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 if p = 0 then<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 p := Pos(‘\/’,s);<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 val(copy(s,1,p-1),dag,c);<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 s := copy(s,p+1,length(s));<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 p := Pos(‘-‘,s);<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 if p = 0 then<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 p := Pos(‘\/’,s);<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 val(copy(s,1,p-1),maand,c);<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 s := copy(s,p+1,length(s));<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 if length(s) = 1 then<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 s := ‘200’ + s;<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 if length(s) = 2 then<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 s := ’20’ + s;<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 val(s,jaar,c);<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 if not CorrecteDatum(jaar,maand,dag) then<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 jaar\u00a0:=\u00a00;<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 maand\u00a0:=\u00a00;<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 dag\u00a0:=\u00a00;<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 end;<\/span>
\n\u00a0 \u00a0 \u00a0 end<\/span>
\n\u00a0 \u00a0 else<\/span>
\n\u00a0 \u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 jaar := 0;<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 maand := 0;<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 dag := 0;<\/span>
\n\u00a0 \u00a0 \u00a0 end;<\/span>
\n\u00a0 d := dt;<\/span>
\nend;<\/span><\/p>\n

function\u00a0Jaar(d:\u00a0TDatum):\u00a0Integer;<\/span>
\nbegin<\/span>
\n\u00a0 Jaar := d.jaar;<\/span>
\nend;<\/span><\/p>\n

function\u00a0Maand(d:\u00a0TDatum):\u00a0Integer;<\/span>
\nbegin<\/span>
\n\u00a0 Maand := d.maand;<\/span>
\nend;<\/span><\/p>\n

function\u00a0Dag(d:\u00a0TDatum):\u00a0Integer;<\/span>
\nbegin<\/span>
\n\u00a0 Dag := d.dag;<\/span>
\nend;<\/span><\/p>\n

begin<\/span>
\n\u00a0 write(‘Voer een datum in (dd-mm-[jj]jj): ‘);<\/span>
\n\u00a0 readln(sDatum);<\/span>
\n\u00a0 StringNaarDatum(sDatum,Datum);<\/span>
\n\u00a0 writeln;<\/span>
\n\u00a0 writeln(‘Uw datum: ‘,Dag(Datum),’-‘,Maand(Datum),’-‘,Jaar(Datum));<\/span>
\nend.<\/span><\/p>\n

Naar boven<\/a><\/p>\n

<\/a>program\u00a0Breuken;<\/span><\/p>\n

\u00a0 const bestnaam = ‘BREUKEN.TXT’;<\/span><\/p>\n

\u00a0 type<\/span>
\n\u00a0 \u00a0 s80 = string[80];<\/span>
\n\u00a0 \u00a0 TBreuk =<\/span>
\n\u00a0 \u00a0 \u00a0 record<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 teller, noemer: integer;<\/span>
\n\u00a0 \u00a0 \u00a0 end;<\/span>
\n\u00a0 \u00a0 TBreuken = array[1..3] of TBreuk;<\/span><\/p>\n

\u00a0 var<\/span>
\n\u00a0 \u00a0 getal1, getal2: integer;<\/span>
\n\u00a0 \u00a0 breuk: TBreuken;<\/span>
\n\u00a0 \u00a0 naarschijf, stoppen: Boolean;<\/span><\/p>\n

procedure\u00a0DrukToets;<\/span>
\n\u00a0 var c: Char;<\/span>
\nbegin<\/span>
\n\u00a0 write(‘Druk op een toets…’);<\/span>
\n\u00a0 Read(KBD,c);<\/span>
\n\u00a0 writeln;<\/span>
\nend;<\/span><\/p>\n

function\u00a0JaNee(vraag:\u00a0S80):\u00a0Boolean;<\/span>
\n\u00a0 var c: Char;<\/span>
\nbegin<\/span>
\n\u00a0 write(vraag,’ [J,n]’);<\/span>
\n\u00a0 repeat<\/span>
\n\u00a0 \u00a0 Read(KBD,c)<\/span>
\n\u00a0 until c In [‘j’,’J’,’n’,’N’,#13];<\/span>
\n\u00a0 gotoxy(wherex-5,wherey);<\/span>
\n\u00a0 clreol;<\/span>
\n\u00a0 if c=#13<\/span>
\n\u00a0 \u00a0 then writeln(‘J’)<\/span>
\n\u00a0 else writeln(c);<\/span>
\n\u00a0 JaNee := (c In [‘j’,’J’,#13]);<\/span>
\nend;<\/span><\/p>\n

function\u00a0Bestaat(bn:\u00a0s80):\u00a0boolean;<\/span>
\n\u00a0 var f: File;<\/span>
\nbegin<\/span>
\n\u00a0 assign(f,bn);<\/span>
\n\u00a0 {$I-}<\/span>
\n\u00a0 \u00a0 reset(f);<\/span>
\n\u00a0 {$I+}<\/span>
\n\u00a0 if IOResult = 0 then<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 close(f);<\/span>
\n\u00a0 \u00a0 \u00a0 Bestaat\u00a0:=\u00a0true;<\/span>
\n\u00a0 \u00a0 end<\/span>
\n\u00a0 else<\/span>
\n\u00a0 \u00a0 Bestaat := false;<\/span>
\nend;<\/span><\/p>\n

function\u00a0Ggd(a,b:\u00a0integer):\u00a0integer;<\/span>
\n\u00a0 var x,y,d,r: integer;<\/span>
\nbegin<\/span>
\n\u00a0 if a > b then<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 x\u00a0:=\u00a0a;<\/span>
\n\u00a0 \u00a0 \u00a0 y\u00a0:=\u00a0b;<\/span>
\n\u00a0 \u00a0 end<\/span>
\n\u00a0 else<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 x\u00a0:=\u00a0b;<\/span>
\n\u00a0 \u00a0 \u00a0 y\u00a0:=\u00a0a;<\/span>
\n\u00a0 \u00a0 end;<\/span>
\n\u00a0 d := x div y;<\/span>
\n\u00a0 r := x mod y;<\/span>
\n\u00a0 if r = 0 then<\/span>
\n\u00a0 \u00a0 Ggd := y<\/span>
\n\u00a0 else<\/span>
\n\u00a0 \u00a0 Ggd:= Ggd(y,r);<\/span>
\nend;<\/span><\/p>\n

function\u00a0Kgv(a,b:\u00a0integer):\u00a0integer;<\/span>
\n{Gebruiken we verder niet, maar hij is zo elegant}<\/span>
\nbegin<\/span>
\n\u00a0 Kgv := (a * b) div Ggd(a,b);<\/span>
\nend;<\/span><\/p>\n

procedure\u00a0LeesBreukIn(var\u00a0b:\u00a0TBreuk);<\/span>
\n\u00a0 var t,n: integer;<\/span>
\nbegin<\/span>
\n\u00a0 write(‘Geef teller: ‘);<\/span>
\n\u00a0 readln(t);<\/span>
\n\u00a0 repeat<\/span>
\n\u00a0 \u00a0 write(‘Geef noemer: ‘);<\/span>
\n\u00a0 \u00a0 readln(n);<\/span>
\n\u00a0 until n <> 0;<\/span>
\n\u00a0 if ((t<0) and (n<0)) or (n<0) then<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 t\u00a0:=\u00a0-t;<\/span>
\n\u00a0 \u00a0 \u00a0 n\u00a0:=\u00a0-n<\/span>
\n\u00a0 \u00a0 end;<\/span>
\n\u00a0 b.teller := t;<\/span>
\n\u00a0 b.noemer := n;<\/span>
\nend;<\/span><\/p>\n

function\u00a0IntToStr(i:\u00a0integer):\u00a0s80;<\/span>
\n\u00a0 var<\/span>
\n\u00a0 \u00a0 r,d: integer;<\/span>
\n\u00a0 \u00a0 s: s80;<\/span>
\n\u00a0 \u00a0 n: boolean;<\/span>
\nbegin<\/span>
\n\u00a0 if i <0 then<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 i\u00a0:=\u00a0-i;<\/span>
\n\u00a0 \u00a0 \u00a0 n\u00a0:=\u00a0true;<\/span>
\n\u00a0 \u00a0 end<\/span>
\n\u00a0 else<\/span>
\n\u00a0 \u00a0 n := false;<\/span>
\n\u00a0 r := i mod 10;<\/span>
\n\u00a0 d := i div 10;<\/span>
\n\u00a0 s := chr(r+48);<\/span>
\n\u00a0 while d > 10 do<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 r\u00a0:=\u00a0d\u00a0mod\u00a010;<\/span>
\n\u00a0 \u00a0 \u00a0 d\u00a0:=\u00a0d\u00a0div\u00a010;<\/span>
\n\u00a0 \u00a0 \u00a0 s\u00a0:=\u00a0chr(r+48)\u00a0+\u00a0s;<\/span>
\n\u00a0 \u00a0 end;<\/span>
\n\u00a0 if d > 0 then<\/span>
\n\u00a0 \u00a0 s := chr(d+48) + s;<\/span>
\n\u00a0 if n then<\/span>
\n\u00a0 \u00a0 s := ‘-‘ + s;<\/span>
\n\u00a0 IntToStr := s;<\/span>
\nend;<\/span><\/p>\n

function\u00a0SBreuk(b:\u00a0TBreuk;HelenEruit:\u00a0boolean):\u00a0s80;<\/span>
\n\u00a0 var s: s80;<\/span>
\nbegin<\/span>
\n\u00a0 if HelenEruit then<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 if\u00a0b.teller\u00a0>=\u00a0b.noemer\u00a0then<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 s := IntToStr(b.teller div b.noemer);<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 if b.teller mod b.noemer <> 0 then<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 s\u00a0:=\u00a0s\u00a0+\u00a0‘\u00a0‘\u00a0+\u00a0IntToStr(b.teller\u00a0mod\u00a0b.noemer)\u00a0+\u00a0‘\/’\u00a0+\u00a0IntToStr(b.noemer);<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 end<\/span>
\n\u00a0 \u00a0 \u00a0 else<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 s := IntToStr(b.teller) + ‘\/’ + IntToStr(b.noemer);<\/span>
\n\u00a0 \u00a0 end<\/span>
\n\u00a0 else<\/span>
\n\u00a0 \u00a0 s := IntToStr(b.teller) + ‘\/’ + IntToStr(b.noemer);<\/span>
\n\u00a0 SBreuk := s;<\/span>
\nend;<\/span><\/p>\n

procedure\u00a0Vereenvoudig(var\u00a0b:\u00a0TBreuk);<\/span>
\n\u00a0 var g: integer;<\/span>
\nbegin<\/span>
\n\u00a0 g := Ggd(abs(b.teller),abs(b.noemer));<\/span>
\n\u00a0 if b.teller < 0 then<\/span>
\n\u00a0 \u00a0 b.teller := -1 * (abs(b.teller) div g)<\/span>
\n\u00a0 else<\/span>
\n\u00a0 \u00a0 b.teller := b.teller div g;<\/span>
\n\u00a0 b.noemer := b.noemer div g;<\/span>
\nend;<\/span><\/p>\n

procedure\u00a0Telop(b1,b2:\u00a0TBreuk;var\u00a0br\u00a0:TBreuk);<\/span>
\nbegin<\/span>
\n\u00a0 if b1.noemer <> b2.noemer then<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 b1.teller\u00a0:=\u00a0b1.teller\u00a0*\u00a0b2.noemer;<\/span>
\n\u00a0 \u00a0 \u00a0 b2.teller\u00a0:=\u00a0b2.teller\u00a0*\u00a0b1.noemer;<\/span>
\n\u00a0 \u00a0 \u00a0 b1.noemer\u00a0:=\u00a0b1.noemer\u00a0*\u00a0b2.noemer;<\/span>
\n\u00a0 \u00a0 \u00a0 b2.noemer\u00a0:=\u00a0b1.noemer;<\/span>
\n\u00a0 \u00a0 end;<\/span>
\n\u00a0 br.teller := b1.teller + b2.teller;<\/span>
\n\u00a0 br.noemer := b1.noemer;<\/span>
\n\u00a0 Vereenvoudig(br);<\/span>
\nend;<\/span><\/p>\n

procedure\u00a0TrekAf(b1,b2:\u00a0TBreuk;var\u00a0br:\u00a0TBreuk);<\/span>
\nbegin<\/span>
\n\u00a0 if b1.noemer <> b2.noemer then<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 b1.teller\u00a0:=\u00a0b1.teller\u00a0*\u00a0b2.noemer;<\/span>
\n\u00a0 \u00a0 \u00a0 b2.teller\u00a0:=\u00a0b2.teller\u00a0*\u00a0b1.noemer;<\/span>
\n\u00a0 \u00a0 \u00a0 b1.noemer\u00a0:=\u00a0b1.noemer\u00a0*\u00a0b2.noemer;<\/span>
\n\u00a0 \u00a0 \u00a0 b2.noemer\u00a0:=\u00a0b1.noemer;<\/span>
\n\u00a0 \u00a0 end;<\/span>
\n\u00a0 br.teller := b1.teller – b2.teller;<\/span>
\n\u00a0 br.noemer := b1.noemer;<\/span>
\n\u00a0 Vereenvoudig(br);<\/span>
\nend;<\/span><\/p>\n

procedure\u00a0Maal(b1,b2:\u00a0TBreuk;var\u00a0br:\u00a0TBreuk);<\/span>
\nbegin<\/span>
\n\u00a0 br.teller := b1.teller * b2.teller;<\/span>
\n\u00a0 br.noemer := b1.noemer * b2.noemer;<\/span>
\n\u00a0 Vereenvoudig(br);<\/span>
\nend;<\/span><\/p>\n

procedure\u00a0Deel(b1,b2:\u00a0TBreuk;var\u00a0br:\u00a0TBreuk);<\/span>
\nbegin<\/span>
\n\u00a0 if b2.teller = 0 then<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 writeln(‘Delen\u00a0door\u00a0nul\u00a0kan\u00a0niet!’);<\/span>
\n\u00a0 \u00a0 \u00a0 halt(1);<\/span>
\n\u00a0 \u00a0 end<\/span>
\n\u00a0 else<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 br.teller\u00a0:=\u00a0b1.teller\u00a0*\u00a0b2.noemer;<\/span>
\n\u00a0 \u00a0 \u00a0 br.noemer\u00a0:=\u00a0b1.noemer\u00a0*\u00a0b2.teller;<\/span>
\n\u00a0 \u00a0 \u00a0 Vereenvoudig(br);<\/span>
\n\u00a0 \u00a0 end;<\/span>
\nend;<\/span><\/p>\n

procedure\u00a0MaakDecimaal(br:\u00a0TBreuk;ad:\u00a0integer);<\/span>
\n\u00a0 var<\/span>
\n\u00a0 \u00a0 g,x: integer;<\/span>
\n\u00a0 \u00a0 tf: text;<\/span>
\nbegin<\/span>
\n\u00a0 if naarschijf then<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 assign(tf,bestnaam);<\/span>
\n\u00a0 \u00a0 \u00a0 append(tf)<\/span>
\n\u00a0 \u00a0 end;<\/span>
\n\u00a0 write(SBreuk(br,false),’ = ‘,br.teller div br.noemer,’, ‘);<\/span>
\n\u00a0 if naarschijf then<\/span>
\n\u00a0 \u00a0 write(tf,SBreuk(br,false),’ = ‘,br.teller div br.noemer,’, ‘);<\/span>
\n\u00a0 g := br.teller mod br.noemer;<\/span>
\n\u00a0 for x := 1 to ad do<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 g\u00a0:=\u00a0g\u00a0*\u00a010;<\/span>
\n\u00a0 \u00a0 \u00a0 write(g\u00a0div\u00a0br.noemer);<\/span>
\n\u00a0 \u00a0 \u00a0 if\u00a0naarschijf\u00a0then<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 write(tf,g div br.noemer);<\/span>
\n\u00a0 \u00a0 \u00a0 g\u00a0:=\u00a0g\u00a0mod\u00a0br.noemer;<\/span>
\n\u00a0 \u00a0 \u00a0 if\u00a0x\u00a0mod\u00a05\u00a0=\u00a00\u00a0then<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 write(‘ ‘);<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 if naarschijf then<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 write(tf,’\u00a0‘);<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 end;<\/span>
\n\u00a0 \u00a0 end;<\/span>
\n\u00a0 if naarschijf then<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 writeln(tf);<\/span>
\n\u00a0 \u00a0 \u00a0 close(tf);<\/span>
\n\u00a0 \u00a0 end;<\/span>
\nend;<\/span><\/p>\n

procedure\u00a0MenuOptie(mo:\u00a0byte);<\/span>
\n\u00a0 var<\/span>
\n\u00a0 \u00a0 aantaldecimalen: integer;<\/span>
\n\u00a0 \u00a0 tf: Text;<\/span><\/p>\n

\u00a0 procedure LBI;<\/span>
\n\u00a0 begin<\/span>
\n\u00a0 \u00a0 writeln(‘1e breuk inlezen:’);<\/span>
\n\u00a0 \u00a0 LeesBreukIn(breuk[1]);<\/span>
\n\u00a0 \u00a0 writeln(‘2e breuk inlezen:’);<\/span>
\n\u00a0 \u00a0 LeesBreukIn(breuk[2]);<\/span>
\n\u00a0 end;<\/span><\/p>\n

begin<\/span>
\n\u00a0 if naarschijf then<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 assign(tf,bestnaam);<\/span>
\n\u00a0 \u00a0 \u00a0 append(tf);<\/span>
\n\u00a0 \u00a0 end;<\/span>
\n\u00a0 case mo of<\/span>
\n\u00a0 \u00a0 1: begin { + }<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0LBI;<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0TelOp(breuk[1],breuk[2],breuk[3]);<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0writeln(SBreuk(breuk[1],true),’ + ‘,<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0SBreuk(breuk[2],true),’ = ‘,<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0SBreuk(breuk[3],false),’ ( = ‘,<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0SBreuk(breuk[3],true),’ )’);<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0if naarschijf then<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0writeln(tf,SBreuk(breuk[1],true),’ + ‘,<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 SBreuk(breuk[2],true),’ = ‘,<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 SBreuk(breuk[3],false),’ ( = ‘,<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 SBreuk(breuk[3],true),’ )’);<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0end;<\/span>
\n2:\u00a0begin\u00a0{\u00a0–\u00a0}<\/span>
\n\u00a0 \u00a0 \u00a0LBI;<\/span>
\n\u00a0 \u00a0 \u00a0TrekAf(breuk[1],breuk[2],breuk[3]);<\/span>
\n\u00a0 \u00a0 \u00a0writeln(SBreuk(breuk[1],true),’ – ‘,<\/span>
\n\u00a0 \u00a0 \u00a0SBreuk(breuk[2],true),’ = ‘,<\/span>
\n\u00a0 \u00a0 \u00a0SBreuk(breuk[3],false),’ ( = ‘,<\/span>
\n\u00a0 \u00a0 \u00a0SBreuk(breuk[3],true),’ )’);<\/span>
\n\u00a0 \u00a0 \u00a0if naarschijf then<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0writeln(tf,SBreuk(breuk[1],true),’ – ‘,<\/span>
\n\u00a0 \u00a0 \u00a0SBreuk(breuk[2],true),’ = ‘,<\/span>
\n\u00a0 \u00a0 \u00a0SBreuk(breuk[3],false),’ ( = ‘,<\/span>
\n\u00a0 \u00a0 \u00a0SBreuk(breuk[3],true),’ )’);<\/span>
\n\u00a0 \u00a0end;<\/span>
\n3:\u00a0begin\u00a0{\u00a0*\u00a0}<\/span>
\n\u00a0 \u00a0 \u00a0LBI;<\/span>
\n\u00a0 \u00a0 \u00a0Maal(breuk[1],breuk[2],breuk[3]);<\/span>
\n\u00a0 \u00a0 \u00a0writeln(SBreuk(breuk[1],true),’ * ‘,<\/span>
\n\u00a0 \u00a0 \u00a0SBreuk(breuk[2],true),’ = ‘,<\/span>
\n\u00a0 \u00a0 \u00a0SBreuk(breuk[3],false),’ ( = ‘,<\/span>
\n\u00a0 \u00a0 \u00a0SBreuk(breuk[3],true),’ )’);<\/span>
\n\u00a0 \u00a0 \u00a0if naarschijf then<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0writeln(tf,SBreuk(breuk[1],true),’ * ‘,<\/span>
\n\u00a0 \u00a0 \u00a0SBreuk(breuk[2],true),’ = ‘,<\/span>
\n\u00a0 \u00a0 \u00a0SBreuk(breuk[3],false),’ ( = ‘,<\/span>
\n\u00a0 \u00a0 \u00a0SBreuk(breuk[3],true),’ )’);<\/span>
\n\u00a0 \u00a0end;<\/span>
\n4:\u00a0begin\u00a0{\u00a0\/\u00a0}<\/span>
\n\u00a0 \u00a0 \u00a0LBI;<\/span>
\n\u00a0 \u00a0 \u00a0Deel(breuk[1],breuk[2],breuk[3]);<\/span>
\n\u00a0 \u00a0 \u00a0writeln(SBreuk(breuk[1],true),’ \/ ‘,<\/span>
\n\u00a0 \u00a0 \u00a0SBreuk(breuk[2],true),’ = ‘,<\/span>
\n\u00a0 \u00a0 \u00a0SBreuk(breuk[3],false),’ ( = ‘,<\/span>
\n\u00a0 \u00a0 \u00a0SBreuk(breuk[3],true),’ )’);<\/span>
\n\u00a0 \u00a0 \u00a0if naarschijf then<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0writeln(tf,SBreuk(breuk[1],true),’ \/ ‘,<\/span>
\n\u00a0 \u00a0 \u00a0SBreuk(breuk[2],true),’ = ‘,<\/span>
\n\u00a0 \u00a0 \u00a0SBreuk(breuk[3],false),’ ( = ‘,<\/span>
\n\u00a0 \u00a0 \u00a0SBreuk(breuk[3],true),’ )’);<\/span>
\n\u00a0 \u00a0end;<\/span>
\n5:\u00a0begin\u00a0{\u00a0vereenvoudigen\u00a0}<\/span>
\n\u00a0 \u00a0 \u00a0writeln(‘breuk inlezen:’);<\/span>
\n\u00a0 \u00a0 \u00a0LeesBreukIn(breuk[1]);<\/span>
\n\u00a0 \u00a0 \u00a0breuk[3] := breuk[1];<\/span>
\n\u00a0 \u00a0 \u00a0Vereenvoudig(breuk[3]);<\/span>
\n\u00a0 \u00a0 \u00a0writeln(SBreuk(breuk[1],false),’ is vereenvoudigd ‘,<\/span>
\n\u00a0 \u00a0 \u00a0SBreuk(breuk[3],false),’ ( = ‘,<\/span>
\n\u00a0 \u00a0 \u00a0SBreuk(breuk[3],true),’ )’);<\/span>
\n\u00a0 \u00a0 \u00a0if naarschijf then<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 writeln(tf,SBreuk(breuk[1],false),’ is vereenvoudigd ‘,<\/span>
\n\u00a0 \u00a0 \u00a0SBreuk(breuk[3],false),’ ( = ‘,<\/span>
\n\u00a0 \u00a0 \u00a0SBreuk(breuk[3],true),’ )’);<\/span>
\n\u00a0 \u00a0end;<\/span>
\n6:\u00a0begin\u00a0{\u00a0decimaal\u00a0maken\u00a0}<\/span>
\n\u00a0 \u00a0 \u00a0writeln(‘breuk inlezen’);<\/span>
\n\u00a0 \u00a0 \u00a0LeesBreukIn(breuk[1]);<\/span>
\n\u00a0 \u00a0 \u00a0write(‘Geef aantal decimalen: ‘);<\/span>
\n\u00a0 \u00a0 \u00a0readln(aantaldecimalen);<\/span>
\n\u00a0 \u00a0 \u00a0MaakDecimaal(breuk[1],aantaldecimalen);<\/span>
\n\u00a0 \u00a0end;<\/span>
\n7:\u00a0begin\u00a0{\u00a0Toggle\u00a0naarschijf\u00a0}<\/span>
\n\u00a0 \u00a0 \u00a0naarschijf := not naarschijf;<\/span>
\n\u00a0 \u00a0 \u00a0if naarschijf then<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0begin<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0assign(tf,bestnaam);<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0if not Bestaat(bestnaam) then<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0begin<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0rewrite(tf);<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0close(tf);<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0end;<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0end<\/span>
\n\u00a0 \u00a0end;<\/span>
\n\u00a0 end;<\/span>
\n\u00a0 if naarschijf then<\/span>
\n\u00a0 \u00a0 close(tf);<\/span>
\n\u00a0 writeln;<\/span>
\n\u00a0 DrukToets;<\/span>
\nend;<\/span><\/p>\n

procedure\u00a0ToonMenu;<\/span>
\n\u00a0 var c: char;<\/span>
\nbegin<\/span>
\n\u00a0 clrscr; {maakt het scherm schoon}<\/span>
\n\u00a0 writeln(‘BREUKEN MENU’);<\/span>
\n\u00a0 writeln;<\/span>
\n\u00a0 writeln(‘1 – Optellen’);<\/span>
\n\u00a0 writeln(‘2 – Aftrekken’);<\/span>
\n\u00a0 writeln(‘3 – Vermenigvuldigen’);<\/span>
\n\u00a0 writeln(‘4 – Delen’);<\/span>
\n\u00a0 writeln(‘5 – Vereenvoudigen’);<\/span>
\n\u00a0 writeln(‘6 – Decimaal maken’);<\/span>
\n\u00a0 write(‘7 – Resultaten naar schijf: ‘);<\/span>
\n\u00a0 if naarschijf then<\/span>
\n\u00a0 \u00a0 writeln(‘AAN’)<\/span>
\n\u00a0 else<\/span>
\n\u00a0 \u00a0 writeln(‘UIT’);<\/span>
\n\u00a0 writeln;<\/span>
\n\u00a0 writeln(‘0 – Stoppen’);<\/span>
\n\u00a0 writeln;<\/span>
\n\u00a0 writeln;<\/span>
\n\u00a0 write(‘Maak keuze (0-7): ‘);<\/span>
\n\u00a0 repeat<\/span>
\n\u00a0 \u00a0 read(kbd,c)<\/span>
\n\u00a0 until c in [‘0’..’7′];<\/span>
\n\u00a0 writeln(c);<\/span>
\n\u00a0 writeln;<\/span>
\n\u00a0 if c = ‘0’ then<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 writeln;<\/span>
\n\u00a0 \u00a0 \u00a0 if\u00a0JaNee(‘Wilt\u00a0u\u00a0echt\u00a0stoppen?’)\u00a0then<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 stoppen := true<\/span>
\n\u00a0 \u00a0 \u00a0 else<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 ToonMenu;<\/span>
\n\u00a0 \u00a0 end<\/span>
\n\u00a0 else MenuOptie(ord(c)-48);<\/span>
\nend;<\/span><\/p>\n

begin<\/span>
\n\u00a0 stoppen := false;<\/span>
\n\u00a0 naarschijf := false;<\/span>
\n\u00a0 repeat<\/span>
\n\u00a0 \u00a0 ToonMenu<\/span>
\n\u00a0 until stoppen;<\/span>
\nend.<\/span><\/p>\n

Naar boven<\/a><\/p>\n

<\/a>program O13_1;<\/span><\/p>\n

\u00a0 const<\/span>
\n\u00a0 MaxNamen = 3000;<\/span><\/p>\n

\u00a0 type<\/span>
\n\u00a0 \u00a0 S20 = String[20];<\/span><\/p>\n

\u00a0 var<\/span>
\n\u00a0 \u00a0 Namen: Array[1..MaxNamen] of S20;<\/span><\/p>\n

procedure Schrijf2;<\/span>
\nvar<\/span>
\n\u00a0 i: Integer;<\/span>
\nbegin<\/span>
\n\u00a0 i := 1;<\/span>
\n\u00a0 while Namen[i] <> ” do<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 write(Namen[i]:40);<\/span>
\n\u00a0 \u00a0 \u00a0 i := i + 1;<\/span>
\n\u00a0 \u00a0 end;<\/span>
\nend;<\/span><\/p>\n

procedure Verwijder2(VNaam: S20);<\/span>
\nvar<\/span>
\n\u00a0 i,v: Integer;<\/span>
\n\u00a0 bepaald: Boolean;<\/span>
\nbegin<\/span>
\n\u00a0 i := 1;<\/span>
\n\u00a0 bepaald := false;<\/span>
\n\u00a0 while not bepaald and (Namen[i] <> ”) do<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 if Namen[i] = VNaam then<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 bepaald := true<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 end;<\/span>
\n\u00a0 \u00a0 \u00a0 i := i + 1;<\/span>
\n\u00a0 \u00a0 end;<\/span>
\n\u00a0 if bepaald then<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 while Namen[i] <> ” do<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 Namen[i-1] := Namen[i];<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 i := i + 1;<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 end;<\/span>
\n\u00a0 \u00a0 \u00a0 Namen[i-1] := ”;<\/span>
\n\u00a0 \u00a0 end<\/span>
\nend;<\/span><\/p>\n

procedure Leeg2;<\/span>
\nvar<\/span>
\n\u00a0 i: Integer;<\/span>
\nbegin<\/span>
\n\u00a0 for i := 1 to MaxNamen do<\/span>
\n\u00a0 \u00a0 Namen[i] := ”;<\/span>
\nend;<\/span><\/p>\n

procedure VoegToe2(NieuweNaam: S20);<\/span>
\nvar<\/span>
\n\u00a0 i,j,k: Integer;<\/span>
\n\u00a0 bepaald: Boolean;<\/span>
\nbegin<\/span>
\n\u00a0 i := 1;<\/span>
\n\u00a0 bepaald := false;<\/span>
\n\u00a0 while not bepaald and (Namen[i] <> ”) do<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 if NieuweNaam <= Namen[i] then<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 bepaald := true<\/span>
\n\u00a0 \u00a0 \u00a0 else<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 i := i + 1;<\/span>
\n\u00a0 \u00a0 end;<\/span>
\n\u00a0 if bepaald then<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 j := i;<\/span>
\n\u00a0 \u00a0 \u00a0 while Namen[j] <> ” do<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 j := j + 1;<\/span>
\n\u00a0 \u00a0 \u00a0 for k := j+1 downto i+1 do<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 Namen[k] := Namen[k-1];<\/span>
\n\u00a0 \u00a0 \u00a0 Namen[i] := NieuweNaam;<\/span>
\n\u00a0 \u00a0 end<\/span>
\n\u00a0 else<\/span>
\n\u00a0 \u00a0 Namen[i] := NieuweNaam;<\/span>
\nend;<\/span><\/p>\n

function Lengte2: Integer;<\/span>
\nvar<\/span>
\n\u00a0 i: integer;<\/span>
\nbegin<\/span>
\n\u00a0 i := 1;<\/span>
\n\u00a0 while Namen[i] <> ” do<\/span>
\n\u00a0 \u00a0 i := i + 1;<\/span>
\n\u00a0 Lengte2 := i-1;<\/span>
\nend;<\/span><\/p>\n

procedure Lijst2(aantal: Integer);<\/span>
\nvar<\/span>
\n\u00a0 i,j: Integer;<\/span>
\n\u00a0 s: S20;<\/span>
\nbegin<\/span>
\n\u00a0 Leeg2;<\/span>
\n\u00a0 if aantal > MaxNamen then<\/span>
\n\u00a0 \u00a0 aantal := MaxNamen;<\/span>
\n\u00a0 for i := 1 to aantal do<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 s := ”;<\/span>
\n\u00a0 \u00a0 \u00a0 for j := 1 to 20 do<\/span>
\n\u00a0 \u00a0 \u00a0 \u00a0 s := s + Chr(97+Random(26));<\/span>
\n\u00a0 \u00a0 \u00a0 VoegToe2(s);<\/span>
\n\u00a0 \u00a0 end;<\/span>
\n\u00a0 Schrijf2;<\/span>
\nend;<\/span><\/p>\n

procedure Test;<\/span>
\nbegin<\/span>
\n\u00a0 clrscr;<\/span>
\n\u00a0 Lijst2(MaxNamen);<\/span>
\n\u00a0 writeln(‘Lengte=’,Lengte2);<\/span>
\n\u00a0 Verwijder2(Namen[1]);<\/span>
\n\u00a0 writeln(‘Lengte=’,Lengte2);<\/span>
\n\u00a0 Leeg2;<\/span>
\n\u00a0 writeln(‘Lengte=’,Lengte2);<\/span>
\nend;<\/span><\/p>\n

begin<\/span>
\n\u00a0 Test;<\/span>
\nend.<\/span><\/p>\n

Naar boven<\/a><\/p>\n

<\/a>program O14_1;<\/span><\/p>\n

\u00a0 type<\/span>
\n\u00a0 \u00a0 pStapel = ^tStapel;<\/span>
\n\u00a0 \u00a0 tStapel = record<\/span>
\n\u00a0 \u00a0 \u00a0 waarde: integer;<\/span>
\n\u00a0 \u00a0 \u00a0 vorige: dStapel;<\/span>
\n\u00a0 \u00a0 end;<\/span><\/p>\n

\u00a0 var<\/span>
\n\u00a0 \u00a0 kop, staart: pStapel;<\/span><\/p>\n

procedure Push(w: integer);<\/span>
\nvar<\/span>
\n\u00a0 huidige: pStapel;<\/span>
\nbegin<\/span>
\n\u00a0 new(huidige);<\/span>
\n\u00a0 huidige^.waarde := w;<\/span>
\n\u00a0 if staart = nil then<\/span>
\n\u00a0 \u00a0 staart := huidige;<\/span>
\n\u00a0 if kop = nil then<\/span>
\n\u00a0 \u00a0 huidige^.vorige := nil<\/span>
\n\u00a0 else<\/span>
\n\u00a0 \u00a0 huidige^.vorige := kop;<\/span>
\n\u00a0 kop := huidige;<\/span>
\nend;<\/span><\/p>\n

function Lengte: integer;<\/span>
\nvar<\/span>
\n\u00a0 ref: pStapel;<\/span>
\n\u00a0 a: integer;<\/span>
\nbegin<\/span>
\n\u00a0 a := 0;<\/span>
\n\u00a0 ref := kop;<\/span>
\n\u00a0 while ref <> nil do<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 a := a + 1;<\/span>
\n\u00a0 \u00a0 \u00a0 ref := ref^.vorige;<\/span>
\n\u00a0 \u00a0 end;<\/span>
\n\u00a0 Lengte := a;<\/span>
\nend;<\/span><\/p>\n

function Pop: integer;<\/span>
\nvar<\/span>
\n\u00a0 huidige: pStapel;<\/span>
\nbegin<\/span>
\n\u00a0 huidige := kop;<\/span>
\n\u00a0 if huidige <> nil then<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 Pop := huidige^.waarde;<\/span>
\n\u00a0 \u00a0 \u00a0 huidige := huidige^.vorige;<\/span>
\n\u00a0 \u00a0 \u00a0 dispose(kop);<\/span>
\n\u00a0 \u00a0 \u00a0 kop := huidige;<\/span>
\n\u00a0 \u00a0 end<\/span>
\n\u00a0 else<\/span>
\n\u00a0 \u00a0 Pop := -MaxInt;<\/span>
\nend;<\/span><\/p>\n

function Fac(n: byte): integer;<\/span>
\nvar<\/span>
\n\u00a0 m: byte;<\/span>
\n\u00a0 p: integer;<\/span>
\nbegin<\/span>
\n\u00a0 m := n;<\/span>
\n\u00a0 while n > 0 do<\/span>
\n\u00a0 \u00a0 begin<\/span>
\n\u00a0 \u00a0 \u00a0 Push(n);<\/span>
\n\u00a0 \u00a0 \u00a0 n := n – 1;<\/span>
\n\u00a0 \u00a0 end;<\/span>
\n\u00a0 p := 1;<\/span>
\n\u00a0 While Lengte > 0 do<\/span>
\n\u00a0 \u00a0 p := p * Pop;<\/span>
\n\u00a0 Fac := p;<\/span>
\nend;<\/span><\/p>\n

begin<\/span>
\n\u00a0 kop := nil;<\/span>
\n\u00a0 staart := nil;<\/span>
\n\u00a0 writeln(‘Fac(5)=’,Fac(5));<\/span>
\nend.<\/span><\/p>\n

Naar boven<\/a><\/p>\n

[Oplossing raadsel 6<\/a>]<\/span><\/p>\n","protected":false},"excerpt":{"rendered":"

Hier vindt u de oplossingen van de oefeningen. Natuurlijk geldt hier dat u uw uiterste best heeft gedaan alvorens de oplossingen te raadplegen. Verder geldt dat de oplossing die u hier vindt natuurlijk niet dezelfde hoeft te zijn als uw oplossing. Ga naar: Oefening 8.1 Oefening 8.2 Oefening 9.1 Oefening 9.2 Oefening 10.1 Oefening 10.2 […]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":185,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"templates\/template-full-width.php","meta":{"_lmt_disableupdate":"","_lmt_disable":"","footnotes":""},"class_list":["post-216","page","type-page","status-publish","hentry"],"yoast_head":"\nOefeningen - Wiskunst<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/wiskunst.nl\/index.php\/programmeren1\/programmeren\/oefeningen\/\" \/>\n<meta property=\"og:locale\" content=\"nl_NL\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Oefeningen - Wiskunst\" \/>\n<meta property=\"og:description\" content=\"Hier vindt u de oplossingen van de oefeningen. Natuurlijk geldt hier dat u uw uiterste best heeft gedaan alvorens de oplossingen te raadplegen. Verder geldt dat de oplossing die u hier vindt natuurlijk niet dezelfde hoeft te zijn als uw oplossing. Ga naar: Oefening 8.1 Oefening 8.2 Oefening 9.1 Oefening 9.2 Oefening 10.1 Oefening 10.2 […]\" \/>\n<meta property=\"og:url\" content=\"https:\/\/wiskunst.nl\/index.php\/programmeren1\/programmeren\/oefeningen\/\" \/>\n<meta property=\"og:site_name\" content=\"Wiskunst\" \/>\n<meta property=\"article:modified_time\" content=\"2022-01-24T08:45:47+00:00\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Geschatte leestijd\" \/>\n\t<meta name=\"twitter:data1\" content=\"15 minuten\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/wiskunst.nl\\\/index.php\\\/programmeren1\\\/programmeren\\\/oefeningen\\\/\",\"url\":\"https:\\\/\\\/wiskunst.nl\\\/index.php\\\/programmeren1\\\/programmeren\\\/oefeningen\\\/\",\"name\":\"Oefeningen - Wiskunst\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/wiskunst.nl\\\/#website\"},\"datePublished\":\"2022-01-20T14:57:40+00:00\",\"dateModified\":\"2022-01-24T08:45:47+00:00\",\"breadcrumb\":{\"@id\":\"https:\\\/\\\/wiskunst.nl\\\/index.php\\\/programmeren1\\\/programmeren\\\/oefeningen\\\/#breadcrumb\"},\"inLanguage\":\"nl-NL\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/wiskunst.nl\\\/index.php\\\/programmeren1\\\/programmeren\\\/oefeningen\\\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/wiskunst.nl\\\/index.php\\\/programmeren1\\\/programmeren\\\/oefeningen\\\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\\\/\\\/wiskunst.nl\\\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Programmeren\",\"item\":\"https:\\\/\\\/wiskunst.nl\\\/index.php\\\/programmeren1\\\/\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"Programmeren met Pascal\",\"item\":\"https:\\\/\\\/wiskunst.nl\\\/index.php\\\/programmeren1\\\/programmeren\\\/\"},{\"@type\":\"ListItem\",\"position\":4,\"name\":\"Oefeningen\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/wiskunst.nl\\\/#website\",\"url\":\"https:\\\/\\\/wiskunst.nl\\\/\",\"name\":\"Wiskunst\",\"description\":\"2\u221e\u2227>\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\\\/\\\/wiskunst.nl\\\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"nl-NL\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Oefeningen - Wiskunst","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/wiskunst.nl\/index.php\/programmeren1\/programmeren\/oefeningen\/","og_locale":"nl_NL","og_type":"article","og_title":"Oefeningen - Wiskunst","og_description":"Hier vindt u de oplossingen van de oefeningen. Natuurlijk geldt hier dat u uw uiterste best heeft gedaan alvorens de oplossingen te raadplegen. Verder geldt dat de oplossing die u hier vindt natuurlijk niet dezelfde hoeft te zijn als uw oplossing. Ga naar: Oefening 8.1 Oefening 8.2 Oefening 9.1 Oefening 9.2 Oefening 10.1 Oefening 10.2 […]","og_url":"https:\/\/wiskunst.nl\/index.php\/programmeren1\/programmeren\/oefeningen\/","og_site_name":"Wiskunst","article_modified_time":"2022-01-24T08:45:47+00:00","twitter_card":"summary_large_image","twitter_misc":{"Geschatte leestijd":"15 minuten"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/wiskunst.nl\/index.php\/programmeren1\/programmeren\/oefeningen\/","url":"https:\/\/wiskunst.nl\/index.php\/programmeren1\/programmeren\/oefeningen\/","name":"Oefeningen - Wiskunst","isPartOf":{"@id":"https:\/\/wiskunst.nl\/#website"},"datePublished":"2022-01-20T14:57:40+00:00","dateModified":"2022-01-24T08:45:47+00:00","breadcrumb":{"@id":"https:\/\/wiskunst.nl\/index.php\/programmeren1\/programmeren\/oefeningen\/#breadcrumb"},"inLanguage":"nl-NL","potentialAction":[{"@type":"ReadAction","target":["https:\/\/wiskunst.nl\/index.php\/programmeren1\/programmeren\/oefeningen\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/wiskunst.nl\/index.php\/programmeren1\/programmeren\/oefeningen\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/wiskunst.nl\/"},{"@type":"ListItem","position":2,"name":"Programmeren","item":"https:\/\/wiskunst.nl\/index.php\/programmeren1\/"},{"@type":"ListItem","position":3,"name":"Programmeren met Pascal","item":"https:\/\/wiskunst.nl\/index.php\/programmeren1\/programmeren\/"},{"@type":"ListItem","position":4,"name":"Oefeningen"}]},{"@type":"WebSite","@id":"https:\/\/wiskunst.nl\/#website","url":"https:\/\/wiskunst.nl\/","name":"Wiskunst","description":"2\u221e\u2227>","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/wiskunst.nl\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"nl-NL"}]}},"_links":{"self":[{"href":"https:\/\/wiskunst.nl\/index.php\/wp-json\/wp\/v2\/pages\/216","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/wiskunst.nl\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/wiskunst.nl\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/wiskunst.nl\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/wiskunst.nl\/index.php\/wp-json\/wp\/v2\/comments?post=216"}],"version-history":[{"count":17,"href":"https:\/\/wiskunst.nl\/index.php\/wp-json\/wp\/v2\/pages\/216\/revisions"}],"predecessor-version":[{"id":548,"href":"https:\/\/wiskunst.nl\/index.php\/wp-json\/wp\/v2\/pages\/216\/revisions\/548"}],"up":[{"embeddable":true,"href":"https:\/\/wiskunst.nl\/index.php\/wp-json\/wp\/v2\/pages\/185"}],"wp:attachment":[{"href":"https:\/\/wiskunst.nl\/index.php\/wp-json\/wp\/v2\/media?parent=216"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}