Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
In this project you will implement a doubly linked list with bare-bones functionality. There are two parts, the public interface, which I specify, and the rest of the implementation, where you are free to express yourself. The public interface Here is the public interface for the list. Do not change the function signatures (i.e., the type of function, the types of its arguments, and the order of the arguments) since testing will assume this interface. LIST *new_list (const char *value) This function • creates a new list, • initializes its single node to the string value, • updates the head and tail pointers in the list, and • returns a pointer to the list. void prepend (LIST +list, const char *value) This function adds a new node at the head of the list. It

In this project you will implement a doubly linked list with bare-bones functionality. There are two parts, the public interface, which I specify, and the rest of the implementation, where you are free to express yourself. The public interface Here is the public interface for the list. Do not change the function signatures (i.e., the type of function, the types of its arguments, and the order of the arguments) since testing will assume this interface. LIST *new_list (const char *value) This function • creates a new list, • initializes its single node to the string value, • updates the head and tail pointers in the list, and • returns a pointer to the list. void prepend (LIST +list, const char *value) This function adds a new node at the head of the list. It

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
Provide me complete and correct solution thanks 3
In this project you will implement a doubly linked list with bare-bones functionality. There are two parts, the public interface, which I specify, and the rest of the implementation, where you are free to express yourself. The public interface Here is the public interface for the list. Do not change the function signatures (i.e., the type of function, the types of its arguments, and the order of the arguments) since testing will assume this interface. LIST *new_list (const char *value) This function • creates a new list, • initializes its single node to the string value, • updates the head and tail pointers in the list, and • returns a pointer to the list. void prepend (LIST +list, const char *value) This function adds a new node at the head of the list. It • creates a new node that contains the string value, and • updates the head pointer in the list. void append (LIST +list, const char *value) This function adds a new node at the tail of the list. It • creates a new node that contains the string value, and • updates the tail pointer in the list. void delete_list (LIST +list) This function deletes a list and frees all its allocated memory. What to do Create your C functions in a file named list.c. Submit your file list.c and a corresponding Linux object file list.o to the autograder on Gradescope for grading. You do not need to submit list.h.
Transcribed Image Text:In this project you will implement a doubly linked list with bare-bones functionality. There are two parts, the public interface, which I specify, and the rest of the implementation, where you are free to express yourself. The public interface Here is the public interface for the list. Do not change the function signatures (i.e., the type of function, the types of its arguments, and the order of the arguments) since testing will assume this interface. LIST *new_list (const char *value) This function • creates a new list, • initializes its single node to the string value, • updates the head and tail pointers in the list, and • returns a pointer to the list. void prepend (LIST +list, const char *value) This function adds a new node at the head of the list. It • creates a new node that contains the string value, and • updates the head pointer in the list. void append (LIST +list, const char *value) This function adds a new node at the tail of the list. It • creates a new node that contains the string value, and • updates the tail pointer in the list. void delete_list (LIST +list) This function deletes a list and frees all its allocated memory. What to do Create your C functions in a file named list.c. Submit your file list.c and a corresponding Linux object file list.o to the autograder on Gradescope for grading. You do not need to submit list.h.
Expert Solution
steps

Step by step

Solved in 3 steps with 3 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS