Starting from:
$30
CSE240- Homework 6 Solved
Introduction
The aim of this assignment is to make sure that you understand and are familiar with the concepts covered in the lectures, including enumeration type, linked list, pointer operations, memory leak, parameter passing mechanisms, and recursion. By the end of the assignment, you should have understood and exercised
● Enumeration type and its operations
● Pointer operations accessing structured data
● Linked list of structures, with complex manipulations of pointer and structure
● Memory management and leak prevention
● Parameter passing and return values of different types.
● Recursive program.
Reading: Chapter 2, Textbook Section 2.5.4 on linked list and Section 2.6 on parameter passing; Section 2.10 a case study on linked list operations; and sample code in lecture slides.
Preparation: Complete the multiple choice questions in the textbook exercise section. The answer keys can be found in the course Web site. These exercises can help you prepare for your weekly quiz and the exam. You are encouraged to read the other exercise questions and make sure you understand these questions in the textbook exercise section, which can help you better understand what materials are expected to understand after the lectures and homework on each chapter.
You are expected to do the majority of the assignment outside the class meetings. Should you need assistance, or have questions about the assignment, please contact the instructor or the TA during their office hours.
You are encouraged to ask and answer questions on the course discussion board. However, do not share your answers and code in the course discussion board.
Programming Assignment (50 points)
1. You are given a partially completed program hw06q1.c. The structure of this homework is similar to previous homework. In this homework, you should use linked list to do the same work in the previous homework.
You should follow the instructions given in the program to complete the functions so that the program executes properly. You will be completing a program that creates a linked list of books.
It is a menu-driven program where the user is given the following options:
a) Add a new book to the linked list. When adding a new book to the list, the user is prompted for book name, publication year, library name and number of copies of the book. The book should be added at the end of the linked list. If the name of the book to add already exists in the list, then you should not add the book to the list.
The library name is enum type.
b) Display the list of books.
c) Remove the book from the linked list. After removing the book, the linked list should not be broken.
d) Sort the linked list of books alphabetically by book name. The sorting should happen within the list. You should not create a new linked list of books having sorted books. You also need to implement a swap function which is to be used in the sort function.
Expected output of each menu option: (same as previous homework) addNode:
displayList:
deleteNode: (see displayList photo for list before deleting node)
sortList: (see displayList photo for unsorted list)
The aim of this assignment is to make sure that you understand and are familiar with the concepts covered in the lectures, including enumeration type, linked list, pointer operations, memory leak, parameter passing mechanisms, and recursion. By the end of the assignment, you should have understood and exercised
● Enumeration type and its operations
● Pointer operations accessing structured data
● Linked list of structures, with complex manipulations of pointer and structure
● Memory management and leak prevention
● Parameter passing and return values of different types.
● Recursive program.
Reading: Chapter 2, Textbook Section 2.5.4 on linked list and Section 2.6 on parameter passing; Section 2.10 a case study on linked list operations; and sample code in lecture slides.
Preparation: Complete the multiple choice questions in the textbook exercise section. The answer keys can be found in the course Web site. These exercises can help you prepare for your weekly quiz and the exam. You are encouraged to read the other exercise questions and make sure you understand these questions in the textbook exercise section, which can help you better understand what materials are expected to understand after the lectures and homework on each chapter.
You are expected to do the majority of the assignment outside the class meetings. Should you need assistance, or have questions about the assignment, please contact the instructor or the TA during their office hours.
You are encouraged to ask and answer questions on the course discussion board. However, do not share your answers and code in the course discussion board.
Programming Assignment (50 points)
1. You are given a partially completed program hw06q1.c. The structure of this homework is similar to previous homework. In this homework, you should use linked list to do the same work in the previous homework.
You should follow the instructions given in the program to complete the functions so that the program executes properly. You will be completing a program that creates a linked list of books.
It is a menu-driven program where the user is given the following options:
a) Add a new book to the linked list. When adding a new book to the list, the user is prompted for book name, publication year, library name and number of copies of the book. The book should be added at the end of the linked list. If the name of the book to add already exists in the list, then you should not add the book to the list.
The library name is enum type.
b) Display the list of books.
c) Remove the book from the linked list. After removing the book, the linked list should not be broken.
d) Sort the linked list of books alphabetically by book name. The sorting should happen within the list. You should not create a new linked list of books having sorted books. You also need to implement a swap function which is to be used in the sort function.
Expected output of each menu option: (same as previous homework) addNode:
displayList:
deleteNode: (see displayList photo for list before deleting node)
sortList: (see displayList photo for unsorted list)
1 file (4.2KB)
