Program Options
Program Options
2. To obtain a C-, C or C+
Include if-then-else statements and loops. Including
arrays will give you a high C grade. The better your
error correction the higher the grade.
3. To obtain B-, B or B+
Include functions and procedures. You do not need to
support recursion. Including arrays will give you a higher grade.
Include error correction. Without error correction and
arrays you will get a B- if other parts are working.
4. To get A or A-
Implement the whole project.
program Option1;
var x: integer;
Begin
x := first / 4;
write(first);
write('\n');
write(second);
write('\n');
write(third);
write('\n');
write(x);
write('\n')
end.
Program Average;
Begin
sum := 0;
count := 0;
read(number);
begin
count := count + 1;
read(number)
end;
if count = 0 then
else
begin
average := sum/count;
write(average)
end
end.
Program printarray;
begin
read(size);
Write('Enter data');
count := 0;
begin
count := count + 1;
read(data);
x[count] := data
end;
count:= size;
begin
write(x[count]);
write('\n');
count := count - 1
end
end.
program Option3;
var amt:integer;
procedure addemup(amount:integer); !averages "amount" numbers
var
sum := 0;
count := 0;
write('Enter numbers');
begin
read(number);
count := count + 1;
end;
if count = 0 then
else
begin
average := sum/count;
write(average)
end
Begin
read (amt);
addemup(amt)
end.
program FeetAndInches;
procedure FeetToInches(feet:integer);
begin
write(inches)
end;
procedure InchesToFeet(inches:integer);
var
begin
feet := inches/12;
Write(feet);
write(remainder);
end;
begin
read(whichone);
if whichone = 1 then
begin
read(feet);
feettoinches(feet)
end
else
begin
read(inches);
inchestofeet(inches)
end
end.
program bubblesort;
procedure bubblesort(size:integer);
begin
i:=0;
k:=0;
write('In Sort\n');
while i<(size) do
begin
k:=0;
while k<(size-1) do
begin
if values[k]>values[k+1] then
begin
tempswap:=values[k+1];
values[k+1]:=values[k];
values[k]:=tempswap
end;
k:=k+1
end;
i:=i+1
end
end;
Begin
x:=0;
else
begin
begin
read(temp);
values[x]:=temp;
x:=x+1
end;
bubblesort(size);
x:=0;
write('Sorted:\n');
begin
write(values[x]);
write('\n');
x:=x+1
end
end
end.
program recursive; ! adds up the first n positive numbers
begin
if n = 1 then
add := 1
else
add := n + add(n-1)
end;
begin
read(number);
answer := add(number);
write(answer)
end.
program hanoi ;
var
height: integer;
begin
write(start);
write(' to ');
write(goal);
write('\n');
move(extra,goal,start,height-1)
end
end;
begin
read(height);
move(1,3,2,height)
end.