Programming and Algorithms COMP 1028

Convert the following while loop into a for loop.

#include < stdio.h >
int main() {
int sum = 0, i = 3;
while (i < 10) {
i++;
if (i % 3 == 0)
sum += i;
}
return 0;
}

What reserved word can be used to end an execution of a loop?

Complete the program below by using switch statement, to compute and print the appropriate value of weightedScore using the weightings given in the following table.

#include < stdio.h >
int main() {
int testNumber, score;
float weight = 0.0;
printf("Please enter the test number and the score: ");
scanf("%d%d", & testNumber, & score);
//complete your switch statement here
printf("A score of %d on test %d give a weighted score of %.2f\n", score, testNumber, weight);
return 0;
}

Write a function that solves the same problem described in part ii) using only conditional expressions.

The whole body of the function should be written using only one statement.

The following C program will display the following output for an input of 3 and 27:

A score of 27 on test 3 gives a weighted score of 5.4.

#include < stdio.h >
float result(int testNumber, int score); //function prototype
int main() {
int testNumber, score;
float weight = 0.0;
printf("Please enter the test number and the score: ");
scanf("%d%d", & testNumber, & score);
weight = result(testNumber, score);
printf("A score of %d on test %d give a weighted score of %.2f\n", score, testNumber, weight);
return 0;
}
float result(int testNumber, int score) {
//write your function
}

#include <stdio.h>
int inclusion(int n1, int n2);
int mystery(int n);
int main(){
int n;
printf("%d", mystery(n));
return 0;
}
int inclusion(int n1, int n2){
if (n1 == 0)
return 0;
else
return n2 + inclusion(n1 - 1, n2);
}
int mystery(int n){
if (n == 0)
return 1;
else
return inclusion(2, mystery(n - 1));
}

flowchart LR
  subgraph A
  A[A?] -->|YES| E
  A -->|NO| B
  end
  B --> F
  subgraph F
  F[F?] -->|YES| J
  F -->|NO| G
  end
  G --> D
  subgraph D
  D[D?] -->|YES| J
  D -->|NO| D
  end
  J[Do J]
  E[Do E]
  D[Do D]
  G[Do G]
  B[Do B]

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
// linked list node for a list of c-strings
typedef struct node {
char *data; //string data in this node
struct node *next; //next node or NULL if none
} Node;
// print strings in list that starts at head
void print(Node *head); //function prototype print
// add x to front of strlist and return pointer to new list head
Node *push_node(Node x, Node *strlist);
//function prototype push_node
// link two nodes together as a list and then print the list
int main () {
Node n1;
Node n2;
Node *list = NULL;
// copy "1028" to first node and push onto front of list
strcpy(n1.data, "1028");
list = push_node(n1, list);
// copy "COMP" to second node and push onto front of list
strcpy(n2.data, "COMP");
list = push_node(n2, list);
// print list
print(list);
return 0;
}
// print strings in list that starts at head
void print(Node *head) {
Node *p = head;
while (p != NULL) {
printf("%s", p->data);
p = p->next;
}
}
// add x to front of strlist and return pointer to new list head
Node *push_node(Node x, Node *strlist) {
x.next= strlist;
return &x;
}

int mysteryFunction(char *x){
char *marker;
int count = 0;
for (marker = x; *marker; ++marker)
++count;
return count;
}

#include <stdio.h>
char *username = "UNMC";
double average( int *x, int n);
int main(){
int z[5];
int i;
for(i=0;i<5;i++)
z[i] = i;
printf("%.2lf\n",average(z,5));
double average( int *x, int n) {
int sum=0;
int i;
for(i=0;i<n;i++)
sum = sum + x[i];
return (double)sum/n;
}

String

For loop

While Loop

Ending a loop

Switch statement

Conditional Expression

Pseudocode

Pointer

Linked list

Scope

Function

Global variable

Input

Output

Recursion

Conditional statement

Loop

Assignment

Array

Local variable

Boolean

Loop condition

User input

Pointer variable

Modify

Dynamic

Segmentation Fault

Push Node

Breakpoint

Calculation Function

Function Name

Loop body

Function arguments

Debugging

Memory error

Logic error