# [Solved] CH-230-A-Assignment 7 Multiple Sources, Linked Lists, Function Pointers, Stacks

Click And Check all our Assignments

100/100 Trustscore on scamadviser.com

10 USD \$

Category: Tag:

# Problem 7.1 Multiple sources (

Modify your solution for Problem 6.8 such that you separate your source code into three files: struct declaration and function declarations in linked_list.h, function definitions in linked_list.c, and your main function in use_linked_list.c. Use exactly the provided names for your files.

You can assume that the input will be valid. To pass the testcases your output has to be identical with the provided ones.

 Testcase 7.1: inputb 2 Testcase 7.1: output3 2 42 4

b 3 a 4 p r p q

# Problem 7.2 A doubly linked list of characters

Create a data type that implements a doubly linked list of characters. Write a program that tests your double linked list with the testcase given below. An integer value 1 entered from the keyboard will add the following character to the list to the beginning of the list, while a 2 will remove all elements with the given character from the list, a 3 will print the current list, while a 4 will print the elements of the list backwards. A 5 will empty the list, free the memory used by the doubly linked list and quit the execution of the program.

You can assume that the input does not contain logical errors (i.e., if the command is 2, you can assume that a character will follow). However, a character to be deleted may not be currently in the list. In this case, the message “The element is not in the list!” should be printed on the standard output.

Use a switch-case statement to decide which action to take.

You can assume that the input will be valid regarding the structure. To pass the testcases your output has to be identical with the provided ones.

# Testcase 7.2: inputTestcase 7.2: output

1d a r

rx r x a d a r 1r a d a r ar a d a r

1The element is not in the list! d 3 1 a 1 x 1 r 1 x 3 2 x 3

4 2 b 5

# Problem 7.3 Makefile (

Continue with your solution for Problem 7.1 in the following manner: write and upload a makefile called “Makefile.txt” which has multiple targets and can be used to: 1) generate all object files corresponding to the previous source files, 2) generate executable code from the object files and 3) delete all generated object files and the executable.

Submit the three source files and the makefile called “Makefile.txt”.

You can assume that the input will be valid. To pass the testcases your output has to be identical with the provided ones.

## Problem 7.4 Simple function pointers

Write a program that reads a string and then repeatedly reads a command (one character) from the standard input.

If you press ’1’, then the string is printed uppercase on the standard output.

If you press ’2’, then the string is printed lowercase on the standard output.

If you press ’3’, then lowercase characters are printed uppercase and uppercase characters are printed lowercase on the standard output.

If you press ’4’, then the program should quit the execution.

Your main function (where you read the commands) or your other functions may not contain any if or switch statements for mapping the command to which function should be called. Your main function should contain an endless while loop.

Implement the solution using a function pointer array. The original string should not be changed. You can assume that the input will be valid. To pass the testcases your output has to be identical with the provided ones.

 Testcase 7.4: inputThis is a String1232 Testcase 7.4: outputTHIS IS A STRING this is a string tHIS IS A sTRING this is a string THIS IS A STRING

1

4

## Problem 7.5 Quicksort with function pointers

Write a program that sorts an array of n integers. After reading n and the values of the array from the standard input, the program reads a character and if this character is ’a’ then the sorting should be ascending, if the character is ’d’ then the sorting should be descending and if the character is ’e’ then the program should quit execution.

Your main function should contain an endless while loop for getting repeated input. Your program should use function pointers and for sorting you should use the function qsort from stdlib.h.

You can assume that the input will be valid. To pass the testcases your output has to be identical with the provided ones.

 Testcase 7.5: input52 Testcase 7.5: output5 4 3 2 11 2 3 4 5

4

1

5 3 d a e

## Problem 7.6 Bubblesort with function pointers

Write a program that reads an array of the following structure and sorts the data in ascending order by name or age using the bubblesort algorithm.

struct person { char name[30]; int age;

};

Your program should read the number of persons from the standard input followed by the array of data corresponding to the persons. You should print the lists of sorted persons in ascending order with respect to their name (alphabetical order) and with respect to their age. Within the sorting according to age, note that if multiple persons have the same age, then they should be sorted alphabetically with respect to their name. Within the sorting according to name, note that if multiple persons have the same name, then they should be sorted with respect to their age. Instead of writing two sorting functions use function pointers such that you can implement one bubblesort function able to sort according to different criteria.

You can assume that the input will be valid and that the names will not contain spaces. To pass the testcases your output has to be identical with the provided ones. The pseudocode of the bubblesort algorithm is the following:

repeat swapped = false for i = 1 to length(A) – 1 inclusive do:

/if this pair is out of order / if A[i-1] > A[i] then

/swap them and remember something changed / swap( A[i-1], A[i] ) swapped = true

end if

end for until not swapped

 Testcase 7.6: input3 anne 23 mary 18 bob 20 Testcase 7.6: output{anne, 23}; {bob, 20}; {mary, 18};{mary, 18}; {bob, 20}; {anne, 23}; Problem 7.7 A stack of integers

Implement a stack, which is able to hold maximum 12 integers using an array implementation.

You need to implement the functions … push(…), … pop(…), … empty(…) for emptying the stack, and … isEmpty(…) for checking if the stack is empty.

Your program should consist of stack.h (struct definition and function declarations), stack.c (function definitions) and teststack.c (main function) and should use the following struct:

struct stack {

unsigned int count;

int array[12]; // Container

};

# Input structure

There are several commands that manipulate the stack. These commands are:

• s followed by a number pushes the number into the stack,
• p pops a number on the top off the stack and prints it on the standard output,
• e empties the stack by popping one element after the other and printing them on the standard output,
• q quits the execution of the program.

# Output structure

If an element is popped off the stack then the element is printed. Stack underflow and overflow should be detected and an informational message (either “Stack Overflow” or “Stack Underflow” should be printed on the screen. In these cases no operation takes place.

You can assume that the input will be correct. To pass the testcases your output has to be identical with the provided ones.

 Testcase 7.7: inputs 5 s 7 p s 3 Testcase 7.7: outputPushing 5Pushing 7Popping 7Pushing 3Emptying Stack 3 5Popping Stack UnderflowQuit

e p

## Reviews

There are no reviews yet.

Only logged in customers who have purchased this product may leave a review.

Shopping Cart
[Solved] CH-230-A-Assignment 7 Multiple Sources, Linked Lists, Function Pointers, Stacks
10 USD \$