logo Use CA10RAM to get 10%* Discount.
Order Nowlogo
(5/5)

In this homework, you will implement a single linked list to store a list of students. Every student has an ID, a name, and a major. You will create 2 classes: Student and Classroom. Student class should have all above attributes and also a “next” pointer.

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

In this homework, you will implement a single linked list to store a list of students. Every student has an ID, a name, and a major. You will create 2 classes: Student and Classroom. Student class should have all above attributes and also a “next” pointer.

 

Student

Type

Attribute

String

ID

String

name

String

major

Student*

next

Classroom class should have a head node as an attribute to keep the list of the students. Also, following member functions should be implemented in this class:

 

Classroom

Type

Attribute

Student*

head

 

Return Type

Function

 

constructor

void

addStudent(string    id,    string    name,    string

major)

void

removeStudent (string id)

void

print()

void

print(string id)

Student

at(int index)

int

getSize()

bool

isEmpty()

 

 

addStudent(…): Adds a new student to the list. The new student is placed based on the ALPHABETICAL ORDER of the names. You shouldn’t add the student directly to the end or front of the list. The new student has to be inserted to the correct position. For example, if you have following three students:

 

 

A new student, “David Taylor” will be placed in alphabetical order between the

second and third student.

removeStudent(…): This functions will remove a student using the given id number. If the given id number is not in the list, it will give an error.

print(): Print all students in (alphabetical) order. id, name, and the major should be printed for each student.

print(string id): Prints all information of a student for a given id

at(int index): Returns the student at given index

getSize(): returns the number of students in the list

isEmpty(): returns true if list is empty, returns false otherwise.

You will implement the Student and Classroom classes along with a main.cpp file. I expect you to have 3 files: Classroom.h, Classroom.cpp, and main.cpp. Student class definition will be in the Classroom.h file.

main.cpp includes following operations in the main function.

  1. Add following students to the list using addStudent(string id, string name, string major)

 

A25123

Izzie Cline

Mathematics

A23452

Bridget McCann

Computer Science

A45120

Isa Powell

History

A56009

Nick Miller

Computer Science

A65980

Alannah Wilks

Literature

A45018

Montana Gates

Biology

 

A86003

Janet Newman

Nursing

 

  1. Print the list of the students in alphabetical order using Print()
  2. Remove Janet Newman from the list using removeStudent (string id)
  3. Print Janet Newman information (you should give error message since Janet Newman is already removed)
  4. Print the list of the students in alphabetical order using Print()

Additional Resources:

In addition, I have provided an integer single linked list C++ class to help you to study for linked lists. If you study that code, you can see the following functions:

void pushBack(int newValue)

void insertAt(int newValue,int index) int at(int index)

int removeAt(int index) void print()

(5/5)
Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Um e HaniScience

686 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

621 Answers

Hire Me
expert
Husnain SaeedComputer science

537 Answers

Hire Me
expert
Atharva PatilComputer science

519 Answers

Hire Me
March
January
February
March
April
May
June
July
August
September
October
November
December
2025
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
SunMonTueWedThuFriSat
23
24
25
26
27
28
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
3
4
5
00:00
00:30
01:00
01:30
02:00
02:30
03:00
03:30
04:00
04:30
05:00
05:30
06:00
06:30
07:00
07:30
08:00
08:30
09:00
09:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00
22:30
23:00
23:30