Question

Assignment 1 Year 2 ICTEDU term 1 2019 For question 1 and 2 the report should consist the following sections on each task: Task Description: Pseudo code / Algorithm: Testing: implementation (working program) screenshots NOTE: Question 1 and 2 Attach a well commented C source file of the program in a zipped file QUESTION 1-Simple C functions 1. Write a short C function that takes an integer (year) and checks whether the year is a Leap Year or not. If it is leap year it should print true to the screen and if not it should print false. Remember Leap Years occurs every 4 years (10 marks) 2. Write a short C function that takes an integer n and returns the sum of all the integers smaller than n. (10 marks) QUESTION 2- Stacks or Queues . A palindrome is a string that reads the same forwards as backwards e.g "DAD". Write a program using stacks or queues to determine if a string is a palindrome. Assume that the string is read from standard input one character at a time. The algorithm should output true or false as appropriate. (10 marks). S OUECTIO

Answer 1

Question 1:

1)

bool checkLeapYear(int year) {
return year % 4 == 0;
}

\r\n6 15 ...Program finished with exit code 0 Press ENTER to exit console. \r\n7 abcdcba 1 . Program fini shed wi th exit code 0 Press ENTER to exit console. \r\n8 abcdefgh 0 . .Program finished with exit code 0 Press ENTER to exit console. "",""error"":null,""modified"":1560707601,""source"":""automated""}"

2)

int sumOfNumbers(int number) {
number--;
return number * (number + 1) / 2;
}

Question 2:

#include <stdio.h>
#include <stdbool.h>
#define MAX 50

char stack[MAX];
char queue[MAX];

int stackTop = -1;
int queueFront = 0;
int queueRear = 0;

void stackPush(char c) {
stackTop++;
stack[stackTop] = c;
}

char getStackTop() {
return stack[stackTop];
}

void stackPop() {
stack[stackTop] = '\0';
stackTop--;
}

bool stackEmpty() {
return stackTop == -1;
}

void queuePush(char c) {
queue[queueRear] = c;
queueRear++;
}

char getQueueFront() {
return queue[queueFront];
}

void queuePop() {
queue[queueFront] = '\0';
queueFront++;
}

bool isPalindrome(char string[MAX], int size) {
for (int i = 0; i < size; i++) {
stackPush(string[i]);
queuePush(string[i]);
}
while (!stackEmpty()) {
if (getStackTop() != getQueueFront())
return false;
stackPop();
queuePop();
}
return true;
}

comment down for any queries

please give a thumbs up