CS301- Data Structures Assignment No. 1 Fall 2011 - Solution soon
Tuesday, October 25, 2011 Posted In CS and IT Edit This
Assignment No. 01
SEMESTER FALL 2011
CS301- Data Structures
Total Marks: 20
Due Date: 01/11/2011
Uploading instructions
Your Submission must include:
1. A working Make File (Dev-C++ project File).
2. All the Source Code (.h and .cpp files) necessary to compile and run your program.
3. Place all the files in a folder then Zip this folder and Upload it on VU-LMS
Note: Use Dev-C++ IDE.
It is required to make a list of students registered in Data Structures course. To achieve this functionality, develop a C++ program and use linked list to store student ids and names.
Each node in the linked list will contain three items: student id, student name, pointer to next node.
When the program starts, it should display the following menu:
1- Enter student information
2- Search student by ID
3- Search student by Name
4- Delete student information
5- Print all students
6- Quit
Sample Run:
1- Enter student information
2- Search student by ID
3- Search student by Name
4- Delete student information
5- Print all students
6- Quit
Enter your choice: 1 (Suppose user entered 1)
(Now the details of Student will be entered)
Student ID: bc080400001 (Suppose user entered bc080400001)
Student Name: Ahmad (Suppose user entered Ahmad)
(If user enters an ID that is already in the list, a message should be displayed “Already in the list.”)
(Main menu will be displayed again)
1- Enter student information
2- Search student by ID
3- Search student by Name
4- Delete student information
5- Print all students
6- Quit
Enter your choice: 2 (Suppose user entered 2)
Student ID: bc080400001 (Suppose user entered bc080400001)
(Now the details of Student will be displayed)
Student ID: bc080400001
Student Name: Ahmad
(If user enters an ID that is not in the list, a message should be displayed “Record not found.”)
(Main menu will be displayed again)
1- Enter student information
2- Search student by ID
3- Search student by Name
4- Delete student information
5- Print all students
6- Quit
Enter your choice: 4 (Suppose user entered 4)
(Now it will ask to enter ID to be deleted)
Student ID: bc080400001 (Suppose user entered bc080400001)
(Student record with this ID will be deleted.)
(Main menu will be displayed again)
1- Enter student information
2- Search student by ID
3- Search student by Name
4- Delete student information
5- Print all students
6- Quit
Enter your choice: 5 (Suppose user entered 5)
(Now it will print all students’ information. Suppose there were three students in the list, so it will print: )
Student ID Student Name
------------- ---------------------
bc080400001 Ahmad
bc080200010 Ali
mc070400002 Hassan
(Main menu will be displayed again)
Lectures Covered: This assignment covers Lecture # 1-5
Deadline: Your assignment must be uploaded/submitted at or before 01-Nov-2011.
SEMESTER FALL 2011
CS301- Data Structures
Total Marks: 20
Due Date: 01/11/2011
Uploading instructions
Your Submission must include:
1. A working Make File (Dev-C++ project File).
2. All the Source Code (.h and .cpp files) necessary to compile and run your program.
3. Place all the files in a folder then Zip this folder and Upload it on VU-LMS
Note: Use Dev-C++ IDE.
It is required to make a list of students registered in Data Structures course. To achieve this functionality, develop a C++ program and use linked list to store student ids and names.
Each node in the linked list will contain three items: student id, student name, pointer to next node.
When the program starts, it should display the following menu:
1- Enter student information
2- Search student by ID
3- Search student by Name
4- Delete student information
5- Print all students
6- Quit
Sample Run:
1- Enter student information
2- Search student by ID
3- Search student by Name
4- Delete student information
5- Print all students
6- Quit
Enter your choice: 1 (Suppose user entered 1)
(Now the details of Student will be entered)
Student ID: bc080400001 (Suppose user entered bc080400001)
Student Name: Ahmad (Suppose user entered Ahmad)
(If user enters an ID that is already in the list, a message should be displayed “Already in the list.”)
(Main menu will be displayed again)
1- Enter student information
2- Search student by ID
3- Search student by Name
4- Delete student information
5- Print all students
6- Quit
Enter your choice: 2 (Suppose user entered 2)
Student ID: bc080400001 (Suppose user entered bc080400001)
(Now the details of Student will be displayed)
Student ID: bc080400001
Student Name: Ahmad
(If user enters an ID that is not in the list, a message should be displayed “Record not found.”)
(Main menu will be displayed again)
1- Enter student information
2- Search student by ID
3- Search student by Name
4- Delete student information
5- Print all students
6- Quit
Enter your choice: 4 (Suppose user entered 4)
(Now it will ask to enter ID to be deleted)
Student ID: bc080400001 (Suppose user entered bc080400001)
(Student record with this ID will be deleted.)
(Main menu will be displayed again)
1- Enter student information
2- Search student by ID
3- Search student by Name
4- Delete student information
5- Print all students
6- Quit
Enter your choice: 5 (Suppose user entered 5)
(Now it will print all students’ information. Suppose there were three students in the list, so it will print: )
Student ID Student Name
------------- ---------------------
bc080400001 Ahmad
bc080200010 Ali
mc070400002 Hassan
(Main menu will be displayed again)
Lectures Covered: This assignment covers Lecture # 1-5
Deadline: Your assignment must be uploaded/submitted at or before 01-Nov-2011.
