Your Perfect Assignment is Just a Click Away

We Write Custom Academic Papers

100% Original, Plagiarism Free, Customized to your instructions!

glass
pen
clip
papers
heaphones

Algorithms And Data Structures

Algorithms And Data Structures

Algorithms And Data Structures

Assessment 2: Linked-List Case Study 1 – Vaccination Centre

Linked Lists- Case study 1

In this assessment, students will analyse a case and develop linked structures by using pointers and finally write code.

 

Due in week 7 40% 1,2,3,4

Case study:

A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. The elements in a linked list are linked using pointers as shown in the below image:

Diagram  Description automatically generated

Each element in the link is called a node which is composed of two parts:

a. Data stored by the node

b. Link pointed to the next node in the linked list

 

In this assessment 2, you are required to develop a Linked List in visual studio called LinkedList.cpp which uses a Linked List to the order in which people arrive at a vaccination clinic.

1. Node in the linked list with appropriate data types: each node stores the person’ name and the person’s current position (index) in the Linked List and link to the next node in the Linked List. Every time a new person arrives, a new node is created and added to the linked list. The position (index) of new node is one more than that of the previous node.

2. Deletion − Deletes a node at the beginning of the linked list: method signature is void deleteFirst()

3. Insert Last − Adds a node at the end of the linked list: method signature is void insertLast(String newPersonName)

4. Delete Last − Deletes a node from the end of the linked list: method signature is void deleteLast()

5. Insert before − Adds a node before another node (according to the provided index in the method parameter) of the linked list: method signature is void insertAfter(int index)

6. Delete − Deletes a node from the linked list using the index: method signature is voide deleteAfter(int index)

7. Search – Search through the linked list to identify the first occurrence of node with match data against the target: method signature is int search(String PersonName)

8. Display − Displays the complete linked list in a forward manner: method signature is String display( )

 

The following reference sites can be of helpful to enhance your understanding of Linked List class structure based on Node and associated methods:

1. https://www.geeksforgeeks.org/data-structures/linked-list/

2. https://www.freecodecamp.org/news/data-structures-explained-with-examples-linked-list/

3. https://beginnersbook.com/2013/12/linkedlist-in-java-with-example/

 

 

Submission requirement: upload the LinkedList.cpp to Moodle by week 7.

 

Marking rubric

Marking criteria Lecturer expectation Marks
Declaration of node in Linked List Node contains correct data members with data types 10
Insertion of node at the front, or after another node using index or end of Linked List Insertion, insert last, insert after methods are correctly implemented with comments 35
Deletion of node at the front or using an index or at end of Linked List Deletion, delete last, delete are correctly implemented with comments 35
Search through the linked list to identify the first occurrence of node with matching key Search is correctly implemented with comments 10
Display the complete linked list from front node to the end node of their stored browsing URL Display is correctly implemented with comments 10

Order Solution Now

Our Service Charter

1. Professional & Expert Writers: On Time Writers only hire the best. Our writers are specially selected and recruited, after which they undergo further training to perfect their skills for specialization purposes. Moreover, our writers are holders of masters and Ph.D. degrees. They have impressive academic records, besides being native English speakers.

2. Top Quality Papers: Our customers are always guaranteed papers that exceed their expectations. All our writers have +5 years of experience. This implies that all papers are written by individuals who are experts in their fields. In addition, the quality team reviews all the papers before sending them to the customers.

3. Plagiarism-Free Papers: All papers provided by On Time Writers are written from scratch. Appropriate referencing and citation of key information are followed. Plagiarism checkers are used by the Quality assurance team and our editors just to double-check that there are no instances of plagiarism.

4. Timely Delivery: Time wasted is equivalent to a failed dedication and commitment. On Time Writers is known for timely delivery of any pending customer orders. Customers are well informed of the progress of their papers to ensure they keep track of what the writer is providing before the final draft is sent for grading.

5. Affordable Prices: Our prices are fairly structured to fit all groups. Any customer willing to place their assignments with us can do so at very affordable prices. In addition, our customers enjoy regular discounts and bonuses.

6. 24/7 Customer Support: At On Time Writers, we have put in place a team of experts who answer all customer inquiries promptly. The best part is the ever-availability of the team. Customers can make inquiries anytime.