ADL Callum Beckwith

Question 1 i
procedure calcNonRepCombinations(IN n, IN r, OUT combinations)
	declare numbersGivenFac, numbersChosenFac, diffFac, combinations
numbersGivenFac  calculateFactorial(IN n)
numbersChosenFac  calculateFactorial(IN r)
diffFac  calculateFactorial(IN (n – r))
combinations  numbersChosenFac DIV (numbersChosenFac * diffFac)
end

ii

procedure calcRepCombinations(IN n, IN r, OUT combinations)
	declare diffPlusFac, numChosenFac, numGivenDiffFac
	diffPlusFac  calculateFactorial(IN (r + n - 1))
	numChosenFac  calculateFactorial(IN r)
	numGivenDiffFac  calculateFactorial(IN (n - 1))
combinations  diffPlusFac DIV (numChosenFac*numGivenDiffFac)
end

Question 2 i

procedure sumCalc(OUT sum)

declare sum, currentNumber

	for currentNumber  999 to 3 by -1 do
		  if (currentNumber MOD 5 = 0 or currentNumber MOD 3 = 0) do
			sum  sum + currentNumber
		  endif
	end

end


ii

procedure calculateFactorialSum(OUT sum)
declare factorial, currentNumber, previousNumber, currentDigit    declare sum, I, digitCount
factorial  returnFactorial(100)
digitCount  getDigits(factorial)
previousNumber  0
for i  1 to digitCount by 1 do
	 currentNumber  factorial MOD 10^i
 currentDigit  (currentNumber – previousNumber) DIV 10^(i-1)
 previousNumber  currentNumber
 sum  sum + currentDigit

end
end

Question 3
  function primeNoCount(IN positiveNumbers[], IN arraySize)
  declare primeCount, currentNumber, isDivisible
  declare index, divideNumber
  primeCount  0
  for index  1 to arraySize by 1 do
  	currentNumber  positiveNumbers[index]
	isDivisible  false
	divideNumber  currentNumber - 1
	while ( isDivisible = false ) do
		if (divideNumber = 1)then
			primeCount  primeCount + 1
			isDivisible  true
else if ( currentNumber MOD divideNumber = 0)then
			isDivisible  true
		endif
		divideNumber  divideNumber – 1
    end
  end
  return primeCount
end