Computer Science Assignment Help

Computer Science Assignment Help



For any help regarding Computer Assignment Help Visit : https://www.programminghomeworkhelp.com/ Email- support@programminghomeworkhelp.com or call us at-+1 678 648 4277 programminghomeworkhelp.com

Effective Programming In C Problem In this problem we will learn how to write code distributed over multiple files that is compiled together and linked into one application. Download the zipped folder provided in the file list.zip as a basis of your program and take a look at the existing code.

First notice the directory structure. The zipped folder contains an include/ directory, a Makefile which is much larger than the one we’ve been using in the past, a GRADER_INFO.txt file, and a src/ directory. In general, all of our header (.h) files will be found in include/ while all of our source (.c) files will be in src/ . This is visually represented in Figure 1 on the left. Now, let’s run make (just the command make , with nothing following that one word).

I-- GRADER INFO.txt I-- include I I-- list.h I \-- s096.h I-- list-test.x I-⇒ Makefile \-- src I-- list.c build I-- list.o I-- test.c Notice there have been three files created: for every .c file, there’s been a .o object file created. These files are linked \-- test.o

I-I-I I I-\--

GRADER INFO.txt include/ I-- list.h \-- s096.h Makefile src/ I-- list.c Figure 1: Project directory structure before and after \-- test.c

together into the

list-text.x program, which you can run. Some important points:

• All of the implementation code you will write should go in the list.c file.

• GRADER INFO.txt is a file for the grader (don’t edit!) containing the usual PROG: list, LANG: C • Important information for submitting your code: you should submit a zipped folder using the same directory structure as the provided zip file. We’ve added a section in the Makefile for your convenience: if you type make zip in the same folder as your project, a zip file containing all of your code and the required headers will be constructed in the project directory and you can upload that to the grader.

We are provided a header file describing the interface for the List data structure. Three functions have al ready been defined for you in list.c: the code to create an empty list with no items: List empty list(void); the code to destroy all the items in a list: void list clear( List *list ); and some code to print out a representation of a provided list: void list print( List list );.

Look in the file list.c to find the functionality required of the other functions, which you will write.

programminghomeworkhelp.com

#ifndef 6S096 LIST H #define 6S096 LIST H #include <stddef.h> typedef struct List node s List node; struct List s { size t length; List node *front; }; typedef struct List s List; // Code you are provided List empty list( void ); void list clear( List *list ); void list print( List list ); // Code you will write void list append( List *list, int value ); void list insert before( List *list, int insert, int before ); void list delete( List *list, int value ); void list apply( List *list, int (*function ptr)(int) ); int list reduce( List list, int (*function ptr)(int, int) ); #endif // 6S096 LIST H

Some questions to ask yourself for understanding: • How do you read the arguments to list apply and list reduce? Re-read How is this a valid header to include when we don’t ever define what the struct List node s really is?

• Why do we sometimes pass a pointer to a List struct and other times pass by value? When might we want to do it this way and when might we want to be more consistent?

Input Format Not applicable; your library will be compiled into a testing suite, your implemented functions will be called by the program, and the behavior checked for correctness. For example, here is a potential test:

programminghomeworkhelp.com

#include "list.h" #include <stdio.h> void test print list(void) { int N = 5; List list = empty list(); for( int i = 0; i < N; ++i ) { list append( &list, i ); } list print( list ); list clear( &list ); return 0; } Upon calling this function, the code outputs { 0 -> 1 -> 2 -> 3 -> 4 } You are strongly encouraged to write your own tests in test.cpp so that you can try out your imple mentation code before submitting it to the online grader.

Output Format Not applicable.

programminghomeworkhelp.com

Solution #include <"list.h"> #include <stdio.h> #include <stdlib.h> struct List_node_s { List_node *next; int value; }; List empty_list( void ) { return (List) { .length = 0, .front = NULL }; } List_node* create_node( int value ) { List_node *new_node = malloc( sizeof( List_node ) ); new_node->value = value; new_node->next = NULL; return new_node; } void list_append( List *list, int value ) { if( list->front == NULL ) { list->front = create_node( value ); programminghomeworkhelp.com

} else { List_node *p = list->front; for( size_t i = 1; i < list->length; ++i, p = p->next ); p->next = create_node( value ); } ++list->length; } void list_delete_from_front( List *list, int value ) { List_node *front = list->front; while( front != NULL && front->value == value ) { list->front = front->next; --list->length; free( front ); front = list->front; } } void list_delete( List *list, int value ) { list_delete_from_front( list, value ); if( list->front == NULL ) { return; } List_node *prev = list->front; List_node *p = list->front->next; while( p != NULL ) { if( p->value == value ) { prev->next = p->next; free( p ); --list->length; p = prev->next;

programminghomeworkhelp.com

} else { prev = p; p = prev->next; } } } void list_insert_before( List *list, int insert, int before ) { if( list->front != NULL && list->front->value == before ) { List_node *new_node = create_node( insert ); new_node->next = list->front; list->front = new_node; ++list->length; } else { List_node *prev = list->front; List_node *next = list->front->next; while( next != NULL ) { if( next->value == before ) { prev->next = create_node( insert ); prev->next->next = next; ++list->length; return; } programminghomeworkhelp.com

prev = next; next = next->next; } } } void list_apply( List list, int (function_ptr)( int) ) { for( List_node *p = list->front; p != NULL; p = p->next ) { p->value = (*function_ptr)( p->value ); } } int list_reduce( List list, int (function_ptr)(int, int) ) { if( list->front == NULL ) { return 0; } int result = list->front->value; for( List_node *p = list->front->next; p != NULL; p = p->next ) { result = (*function_ptr) ( result, p->value ); } return result;

} void list_print( List list ) { if( list.front == NULL ) { printf( "{}\n" ); } else { printf( "{ " );

programminghomeworkhelp.com

List_node *p = list.front; size_t length = list.length; while( p->next != NULL && length > 0 ) { printf( "%d -> ", p->value ); p = p->next; --length; } printf( "%d }\n", p->value );

}

if( length != 1 ) { printf( "Error: badly formed list.\n" ); exit( EXIT_FAILURE ); }

} void list_clear( List *list ) { List_node *front = list->front; size_t length = list->length; while( front != NULL && length > 0 ) { List_node *next = front->next; free( front ); front = next; --length; }

programminghomeworkhelp.com

if( length != 0 ) { printf( "Error: failed to clean up list properly.\n" ); exit( EXIT_FAILURE ); } } Below is the output using the test data: list: 1: OK [0.002 seconds] OK! 2: OK [0.004 seconds] OK! 3: OK [0.035 seconds] OK! 4: OK [2.175 seconds] OK! 5: OK [0.133 seconds] OK! 6: OK [0.305 seconds] OK! 7: OK [0.061 seconds] OK! 8: OK [0.213 seconds] OK! 9: OK [0.002 seconds] OK! 10: OK [1.054 seconds] OK!

programminghomeworkhelp.com