Data Structures and Algorithms Assignment 2: Linked List Implementation in C++, Exercises of Data Structures and Algorithms

Data Structure Assignments 2 for Feb 2017

Typology: Exercises

2016/2017

Uploaded on 12/30/2017

arshad-jamal
arshad-jamal 🇲🇾

3 documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CCS20503
DATA STRUCTURE AND ALOGORITHM
ASSIGNMENT 2
FEBRUARY 2017
Due date: 21st March 2017, during class only (assignment hardcopy)
Weighting: Part of 10% of overall assessment.
Environment: You are required to do this assignment in C++ environment.
Assessment
Your assignment will be assessed for the following:
Correctness of the programs
Sample test data/results/output or discussion of results
No plagiarism
Submission
You are required to submit documentation in the form of printed copy of your
codes and sample test data. Your submission should bind together with a
BLACK tape with the assignment cover given at the end of this assignment
question. Use PURPLE colour paper as your Assignment 2 cover.
Warning
1. Plagiarism or late submission will get 0 mark.
pf3

Partial preview of the text

Download Data Structures and Algorithms Assignment 2: Linked List Implementation in C++ and more Exercises Data Structures and Algorithms in PDF only on Docsity!

CCS

DATA STRUCTURE AND ALOGORITHM

ASSIGNMENT 2

FEBRUARY 2017

Due date: 21 st^ March 2017, during class only (assignment hardcopy) Weighting: Part of 10% of overall assessment. Environment: You are required to do this assignment in C++ environment.

Assessment Your assignment will be assessed for the following: Correctness of the programs Sample test data/results/output or discussion of results No plagiarism

Submission

You are required to submit documentation in the form of printed copy of your codes and sample test data. Your submission should bind together with a BLACK tape with the assignment cover given at the end of this assignment question. Use PURPLE colour paper as your Assignment 2 cover.

Warning

1. Plagiarism or late submission will get 0 mark.

ASSIGNMENT QUESTION:

Refer to the sample program given in the Chapter 4 – Link Lists

[Uploaded in the EKLAS] for the singly linked list implementation.

Modify the program and implement the following:

Your program should display a menu as follows:

Welcome to Linked List Program

Press [1] to create a linked list. Press [2] to insert an item in the linked list. Press [3] to delete an item from the linked list. Press [4] to display the linked list. Press [0] to exit.

Enter your choice:

In case option [2] or [3] is chosen another submenu open as follows:

If Option [2] is selected the following submenu should appear:

Welcome to the insertion menu: Press [21] for insertion in the ordered linked list. Press [22] to insert at the given location in the linked list. Press [23] to insert after a value (key) in the linked list. Press [00] to return to the main menu.

Enter your choice:

If Option [3] is selected the following submenu should appear:

Welcome to the deletion menu: Press [31] for deletion from the ordered linked list. Press [32] to delete from a given location in the linked list. Press [00] to return to the main menu.

Enter your choice:

Display appropriate messages in the program wherever necessary.

END OF ASSIGNMENT 2