Q2: Secret CoursesDan's recently announced that he's teaching n top-secret courses next semester.Instead of enrolling in them through ACORN, students need to email Dan toexpress their interests. These courses are numbered from 1 to n in some arbitraryorder.In particular, if a student named s is interested in taking a course c, they need tosend an email to Dan containing the message c s. Note that if a student isinterested in taking multiple courses, they need to send multiple emails, one percourse.Upon receiving a message c s, Dan looks at the list of students already enrolled incourse c. If there's already a student on the list whose name is too similar to s,Dan assumes s is the same student and ignores the message. Otherwise, heenrolls s in the course.Dan considers two names too similar if and only if they have the same length anddiffer in at most one letter (note that "a" and "A" are considered the same letter).For example, "Josh" and "Josh" are too similar. "Sam" and "CaM" are too similaras well. However, neither "Max" and "Cat" nor "Ann" and "Anne" are too similar.Dan has a lot of students and teaches a lot of courses. Consequently, it would takehim forever to process the messages sent by the students one-by-one manually.Instead, he's asking you to help him out by writing a program that takes in themessages as the input and outputs, for every course, the list of the studentsenrolled in that course in the order of their enrolments. InputThe first line of the input consists of two space-separated integers n and m,denoting the number of secret courses Dan is teaching next semester and thenumber of messages sent by the students, respectively.The m messages will be described in the following m lines in chronological order.The i-th line describes the i-th message and consists of an integer c_i followedby a string s_i. This indicates that a student named s_i wants to enrol in coursec_i.OutputYou should output exactly ŉ lines. The i-th line should contain the names of thestudents enrolled in the i-th course in the order of enrolment (note that the linewould be empty if there were no students enrolled in the course). These namesshould be separated by single spaces.

Answered: Dan has a lot of students and teaches a…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

Q2: Secret Courses
Dan's recently announced that he's teaching n top-secret courses next semester.
Instead of enrolling in them through ACORN, students need to email Dan to
express their interests. These courses are numbered from 1 to n in some arbitrary
order.
In particular, if a student named s is interested in taking a course c, they need to
send an email to Dan containing the message c s. Note that if a student is
interested in taking multiple courses, they need to send multiple emails, one per
course.
Upon receiving a message c s, Dan looks at the list of students already enrolled in
course c. If there's already a student on the list whose name is too similar to s,
Dan assumes s is the same student and ignores the message. Otherwise, he
enrolls s in the course.
Dan considers two names too similar if and only if they have the same length and
differ in at most one letter (note that "a" and "A" are considered the same letter).
For example, "Josh" and "Josh" are too similar. "Sam" and "CaM" are too similar
as well. However, neither "Max" and "Cat" nor "Ann" and "Anne" are too similar.
Dan has a lot of students and teaches a lot of courses. Consequently, it would take
him forever to process the messages sent by the students one-by-one manually.
Instead, he's asking you to help him out by writing a program that takes in the
messages as the input and outputs, for every course, the list of the students
enrolled in that course in the order of their enrolments.

Input
The first line of the input consists of two space-separated integers n and m,
denoting the number of secret courses Dan is teaching next semester and the
number of messages sent by the students, respectively.
The m messages will be described in the following m lines in chronological order.
The i-th line describes the i-th message and consists of an integer c_i followed
by a string s_i. This indicates that a student named s_i wants to enrol in course
c_i.
Output
You should output exactly ŉ lines. The i-th line should contain the names of the
students enrolled in the i-th course in the order of enrolment (note that the line
would be empty if there were no students enrolled in the course). These names
should be separated by single spaces.

Expert Solution

Step 1

Here I am going to write a c++ program to solve the given problem.

The idea is to keep the name of students in a 2d array corresponding to each course-id. When we encounter a new message for a course, we linearly traverse the already existing list of students in that course and if the new student is not tooSimilar to any other student in that course then we add him/her to that list otherwise skip that student.