Week 08 Laboratory Exercises

Download note_compare.c here, or copy it to your CSE account using the following command:

cp -n /web/cs1511/20T1/activities/note_compare/note_compare.c .

Your task is to add code to this function in note_compare.c:

//Returns 1 if a is higher than b
//       -1 if b is higher than a
//        0 if they are equal
int note_compare(Note a, Note b) {
    //TODO: Change this return.
    return -42;

}

struct note {
    int octave;
    int key;
    struct note *next;
};

It has also been given a typedef, as shown below:

  typedef struct note *Note;

Your task in this exercise is first to complete the function int note_compare(Note a, Note b) so that it returns:

• 1 if the Note contained in a is higher than the Note in b
• -1 if the Note contained in b is higher than the Note in a
• 0 if the two Notes are the same

Comparing Notes

To compare two Notes, you should first compare their octaves. A higher note will have a larger octave number. If the two octave numbers are the same, the higher Note will have a larger key number.

For example, A Note with octave 3, and key 6 is higher than a Note with octave 2 and key 8, and higher than a Note with octave 3 and key 1; but lower than a Note with octave 3 and key 9, and lower than a Note with octave 4 and key 1.

Testing

Do not change this main function. If you want to change it, you have misread the question.

Your note_compare function will be called directly in marking. The main function is only to let you test your note_compare function

Here is how you use main function allows you to test note_compare:

dcc -o note_compare note_compare.c
./note_compare
3 4
4 4
b is higher than a
./note_compare
3 6
3 4
a is higher than b

Assumptions/Restrictions/Clarifications.

note_compare should not change the notes it is given. Your function should not change the octave or key fields of the passed structs.

note_compare should not use arrays.

note_compare should not call malloc.

note_compare should not call scanf (or getchar or fgets).

note_compare should not print anything. It should not call printf.

Do not change the supplied main function. It will not be tested or marked.

1511 style note_compare.c

When you think your program is working, you can use autotest to run some simple automated tests:

1511 autotest note_compare

When you are finished working on this exercise, you and your lab partner must both submit your work by running give:

give cs1511 lab08_note_compare note_compare.c

Note, even though this is a pair exercise, you both must run give from your own account before Friday 12 April 20:00 to obtain the marks for this lab exercise.

struct note {
    int octave;
    int key;
    Note next;
};

It has also been given a typedef, as shown below:

  typedef struct note *Note;

Your task in this exercise is first to complete the functions int note_subtract(Note a, Note b) and void print_note(Note n) so that they return a new Note created with malloc, with a value that is the larger note subtracted from the smaller.

Download note_subtract.c here, or copy it to your CSE account using the following command:

cp -n /web/cs1511/20T1/activities/note_subtract/note_subtract.c .

Subtracting Notes

When subtracting notes, the resulting octave is the larger octave minus the smaller octave. The resulting key is the key of the larger Note, minus the other key. If the resulting key is negative, you should subtract one from the octave, and add 12 to the key (that is, if you would have octave 3 and key -1, you should actually have octave 2 and key 11).

Testing

Do not change this main function. If you want to change it, you have misread the question.

Your note_subtract function will be called directly in marking. The main function is only to let you test your note_subtract function

Here is how you use main function allows you to test note_subtract:

dcc -o note_subtract note_subtract.c
./note_subtract
7 4
4 3
3 01
./note_subtract
7 3
4 3
3 00
./note_subtract
7 2
4 3
2 11

Assumptions/Restrictions/Clarifications.

note_subtract should return a Note created with malloc.

note_subtract will be given two arguments, and you are guaranteed that higher will be larger than or equal to lower. You do not need to check this.

note_subtract will be given two arguments, and you are guaranteed that higher and lower will have octaves between 0 and 9, and keys between 0 and 11. You do not need to check this.

note_subtract and print_note should not change the notes they are given. Your functions should not change the octave or key fields of the passed structs.

note_subtract and print_note should not use arrays.

note_subtract should call malloc. print_note should not call malloc or free.

note_subtract and print_note should not call scanf (or getchar or fgets).

note_subtract should not print anything. It should not call printf.

Do not change the supplied main function. It will not be tested or marked.

1511 style note_subtract.c

When you think your program is working, you can use autotest to run some simple automated tests:

1511 autotest note_subtract

When you are finished working on this exercise, you and your lab partner must both submit your work by running give:

give cs1511 lab08_note_subtract note_subtract.c

Note, even though this is a pair exercise, you both must run give from your own account before Friday 12 April 20:00 to obtain the marks for this lab exercise.

Download list_print.c here, or copy it to your CSE account using the following command:

cp -n /web/cs1511/20T1/activities/list_print/list_print.c .

Your task is to add code to this function in list_print.c:

// print a linked list in this format:
// 17 -> 34 -> 51 -> 68 -> X
void print(struct node *head) {

    // PUT YOUR CODE HERE
}

Add code to print so that it prints the elements in the list

For example if the linked list contains these 8 elements:

1, 7, 8, 9, 13, 19, 21, 42

print should print 1 -> 7 -> 8 -> 9 -> 13 -> 19 -> 21 -> 42 -> X

Testing

This main function:

• converts the command-line arguments to a linked list
• assigns a pointer to the first node in the linked list to head
• calls list_print(head)

Do not change this main function. If you want to change it, you have misread the question.

Your list_print function will be called directly in marking. The main function is only to let you test your list_print function

Here is how you use main function allows you to test list_print:

dcc list_print.c -o list_print
./list_print 1 2 4 8 16 32 64 128 256
1 -> 2 -> 4 -> 8 -> 16 -> 32 -> 64 -> 128 -> 256 -> X
./list_print 2 4 6 5 8 9
2 -> 4 -> 6 -> 5 -> 8 -> 9 -> X
./list_print 42 4
42 -> 4 -> X
./list_print 43
43 -> X
./list_print
X

Assumptions/Restrictions/Clarifications.

print should not use arrays.

print should not call malloc.

print should not call scanf (or getchar or fgets).

Do not change the supplied main function. It will not be tested or marked.

1511 style list_print.c

When you think your program is working, you can use autotest to run some simple automated tests:

1511 autotest list_print

When you are finished working on this exercise, you and your lab partner must both submit your work by running give:

give cs1511 lab08_list_print list_print.c

Note, even though this is a pair exercise, you both must run give from your own account before Friday 12 April 20:00 to obtain the marks for this lab exercise.

Download list_insert_head.c here, or copy it to your CSE account using the following command:

cp -n /web/cs1511/20T1/activities/list_insert_head/list_insert_head.c .

Your task is to add code to this function in list_insert_head.c:

// Insert a new node containing value at the start of the linked list.
// The head of the new list is returned.
struct node *insert_head(int value, struct node *head) {

    // PUT YOUR CODE HERE (change the next line!)
    return NULL;

}

Add code to insert_head so that it creates a new list node (using malloc) containing value and places it at the start of the list.

insert_head should return a pointer to the new list.

For example if value is 12 and the linked list contains these 3 elements:

16, 7, 8

insert_head should return a pointer to a list with these elements:

12, 16, 7, 8

Testing

This main function:

• converts the command-line arguments to a linked list
• assigns a pointer to the first node in the linked list to head
• reads a single integer from standard input and assigns it to value
• calls insert_head(value, head)
• prints the result.

Do not change this main function. If you want to change it, you have misread the question.

Your insert_head function will be called directly in marking. The main function is only to let you test your insert_head function

dcc list_insert_head.c -o list_insert_head
./list_insert_head 16 7 8
12
[12, 16, 7, 8]
./list_insert_head 16
42
[42, 16]
./list_insert_head
2
[2]

Assumptions/Restrictions/Clarifications.

insert_head should not call scanf (or getchar or fgets).

insert_head should not print anything. It should not call printf.

Do not change the supplied main function. It will not be tested or marked.

1511 style list_insert_head.c

When you think your program is working, you can use autotest to run some simple automated tests:

1511 autotest list_insert_head

When you are finished working on this exercise, you and your lab partner must both submit your work by running give:

give cs1511 lab08_list_insert_head list_insert_head.c

Note, even though this is a pair exercise, you both must run give from your own account before Friday 12 April 20:00 to obtain the marks for this lab exercise.

Download list_contains.c here, or copy it to your CSE account using the following command:

cp -n /web/cs1511/20T1/activities/list_contains/list_contains.c .

Your task is to add code to this function in list_contains.c:

// Return 1 if value occurs in linked list, 0 otherwise
int contains(int value, struct node *head) {

    // PUT YOUR CODE HERE (change the next line!)
    return 42;

}

Add code to contains so that its returns 1 if value occurs in the linked and otherwise it returns 0.

For example if the linked list contains these 8 elements:

1, 7, 8, 9, 13, 19, 21, 42

and contains is called with value of 9,

contains should return 1.

Testing

This main function:

• converts the command-line arguments to a linked list
• assigns a pointer to the first node in the linked list to head
• reads a single integer from standard input and assigns it to value
• calls list_contains(value, head)
• prints the result.

Do not change this main function. If you want to change it, you have misread the question.

Your list_contains function will be called directly in marking. The main function is only to let you test your list_contains function

Here is how you use main function allows you to test list_contains:

dcc list_contains.c -o list_contains
./list_contains 1 2 3 4
3
1
./list_contains 1 2 3 4
42
0
./list_contains 15 17 17 18
17
1
./list_contains 15 17 17 18
21
0
./list_contains
42
0

Assumptions/Restrictions/Clarifications.

contains should not change the linked list it is given. Your function should not change the next or data fields of list nodes.

contains should not use arrays.

contains should not call malloc.

contains should not call scanf (or getchar or fgets).

contains should not print anything. It should not call printf.

Do not change the supplied main function. It will not be tested or marked.

1511 style list_contains.c

When you think your program is working, you can use autotest to run some simple automated tests:

1511 autotest list_contains

When you are finished working on this exercise, you and your lab partner must both submit your work by running give:

give cs1511 lab08_list_contains list_contains.c

Note, even though this is a pair exercise, you both must run give from your own account before Friday 12 April 20:00 to obtain the marks for this lab exercise.