Problem Solving with C++ (10th Edition)
Problem Solving with C++ (10th Edition)
10th Edition
ISBN: 9780134448282
Author: Walter Savitch, Kenrick Mock
Publisher: PEARSON
bartleby

Concept explainers

Question
Book Icon
Chapter 18, Problem 4P
Program Plan Intro

Student Enrollment

Program Plan:

  • Include required header file.
  • Include required “std” namespace.
  • Define main function.
    • Declare variable for student ID and course number.
    • Map the student ID to a vector of “string” using “map” and “vector” template class.
    • Create constant iterator in “map” template class.
    • Read the student ID from user.
    • Performs “while” loop. This loop will execute until the student is equal to “-1”.
      • Read course number from user.
      • Check condition. If the student ID in list is equal to student list end, then
        • Declare a “vector” variable to “courseList”.
        • Push the course number into course list using “push_back” function.
        • Insert the pair value into student list.
      • Otherwise
        • Declare a “vector” variable to “courseList”.
        • Find the student ID in student list and then store it in a variable “iterList”.
        • Push the course number into course list.
        • Erase the student ID from student list.
      • Read the student ID from user.
    • Display respective statement.
    • Display student ID and its corresponding course numbers.

Blurred answer
Students have asked these similar questions
I need help in server client project. It is around 1200 lines of code in both . I want to meet with the expert online because it is complicated. I want the server send a menu to the client and the client enters his choice and keep on this until the client chooses to exit . the problem is not in the connection itself as far as I know.I tried while loops but did not work. please help its emergent
I need help in my server client in C language
Exercise docID document text docID document text 1 hot chocolate cocoa beans 7 sweet sugar 2345 9 cocoa ghana africa 8 sugar cane brazil beans harvest ghana 9 sweet sugar beet cocoa butter butter truffles sweet chocolate 10 sweet cake icing 11 cake black forest Clustering by k-means, with preprocessing tokenization, term weighting TFIDF. Manhattan Distance. Number of cluster is 2. Centroid docID 2 and docID 9.
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
  • Text book image
    EBK JAVA PROGRAMMING
    Computer Science
    ISBN:9781337671385
    Author:FARRELL
    Publisher:CENGAGE LEARNING - CONSIGNMENT
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT