Exercise L(60 pts) Implement the class Student as presented by the following UML. diagram: Student -name: String /could be formed of more than two words -id: int -gender: char -address: String +Student(---All Attributes--) (10 pts) +getters/setters (20 pts) +formatName(): void (20 pts) capitalize the first letter of every word in name *printDesrciption(): void (10 pts) Exsrcise 2. (40 pts) Write a driver class to test the Student class as follows: a Create a student object s by reading hisher name, id, gender and address from the user. (10 pts) b. Change its id with any other id. (6 pts) c. Display the name of s. (6 pts) d. Format hisher name and then display it. (6 pts) e. Print the description of s. (6 pts) f. Display either the word Male or the word Female according to the gender of s. (6 pts) Sample Run: Enter name: ali abdel Karim el masri Enter the atudent id: 1111 Enter M for male and r for female: m Enter address: Hamra ali abdel Karim el masri After formatting the namei Ali Abdel Karin El Manri Student (name Ali Abdel Karim El Masri, id 3333, gender M, address Hamra) The gender of a in: Male

Exercise L(60 pts) Implement the class Student as presented by the following UML. diagram: Student -name: String /could be formed of more than two words -id: int -gender: char -address: String +Student(---All Attributes--) (10 pts) +getters/setters (20 pts) +formatName(): void (20 pts) capitalize the first letter of every word in name *printDesrciption(): void (10 pts) Exsrcise 2. (40 pts) Write a driver class to test the Student class as follows: a Create a student object s by reading hisher name, id, gender and address from the user. (10 pts) b. Change its id with any other id. (6 pts) c. Display the name of s. (6 pts) d. Format hisher name and then display it. (6 pts) e. Print the description of s. (6 pts) f. Display either the word Male or the word Female according to the gender of s. (6 pts) Sample Run: Enter name: ali abdel Karim el masri Enter the atudent id: 1111 Enter M for male and r for female: m Enter address: Hamra ali abdel Karim el masri After formatting the namei Ali Abdel Karin El Manri Student (name Ali Abdel Karim El Masri, id 3333, gender M, address Hamra) The gender of a in: Male

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter13: Overloading And Templates

Section: Chapter Questions

Problem 20PE

See similar textbooks

Similar questions

Which one is NOT an example of software reuse? A I have an abstract class Game, I will define Chess, Backgammon, and Checkers as subclasses of class Game. B I have a LinkedList implementation, I will use it to implement a Set class through delegation. C I need to develop a structure that has recursive composition, I will make use of composite design pattern. D I have already written a code segment that scans a list and finds duplicates, I will copy and paste that code segment into another program that I am developing. E I have an implementation of List class which contains elements of type integer, I will use it to develop a list that contains elements of type Car.
Write a complete Program in Java to implement circular queue using array for the following tasks: 1. Method to insert the new element in the circular queue 2. Method to delete an element from the circular queue 3. Method to display all the elements of the circular queue 4. Create the test class to perform the operations on circular queue in the following sequence: a. Add a new element 10 b. Add a new element 20 c. Add a new element 30 d. Add a new element 40 e. Display all elements f. Delete from the circular queue g. Delete from the circular queue h. Add a new element 50 i. Add a new element 60 j. Add a new element 70 Please screenshot of the output
3. Consider a hospital information system using which patients can take appointment with a doctor on first come first serve basis and their appointments are maintained in a queue. a. Discuss by giving reasons on which of the following data structures is most suitable for implementing such appointment queue, when considering that there is no limit on how many patients a doctor can see in any given day. *One dimensional array Linked list b. Write and execute a java program to create an object of class appointment queue, and perform operations such as insert, remove, and display. Give your reflection on each of these operation
Practical:1. Write a Java code to illustrate the concept of Set, List and deque. Generate the correct output.2. Give a suitable example of Generic Classes and generate correct output.3. Write a Java code to implement the concept of vector and stack. Generate the correct output.
Write a Java program using OOP concept that perform the union and symmetric difference between two sets. Use class, object and method in code. A = { a, b, c, e, f }B = { d, e, f, g }
Complete the implementation of the class LinkedSortedList, and write a driver program to fully test it. (Ch. 12, Programming Problems 1, pg. 392 of Data Abstraction and Problem Solving with C++ (7th Edition) ) Name the program sortedlist.cpp. Make sure the following requirements are met. Program must compile and run. Must use the Sorted List ADT SortedListInterface.h For LinkSortedList pg. 376 has the code for insertSorted. You must complete the implementation. Image shown below: Therefore the LinkedSortedList is not based on a LinkedList but uses its own link-based implementation. Do not use throw on function declarations as it is obsolete. Driver program should: create a sorted list insert 21 random numbers (1-100) using the STL random library Display the numbers as they are inserted. Then remove the first number inserted. Last of all display the sorted list of 20 numbers. No user input for driver program. SortedListInterface.h: //Â Created by Frank M. Carrano and Timothy…
Draw an UML class diagram for the following code: import java.util.EmptyStackException; class Node { int data; Node next; public Node(int data) { this.data = data; this.next = null; } } class List { private Node head; private int size; public List() { head = null; size = 0; } public void add(int data) { Node newNode = new Node(data); if (head == null) { head = newNode; } else { Node current = head; while (current.next != null) { current = current.next; } current.next = newNode; } size++; } public int get(int index) { if (index < 0 || index >= size) { throw new IndexOutOfBoundsException("Index out of range"); } Node current = head; for (int i = 0; i < index; i++) { current = current.next; } return current.data; } public void…
In JAVA complete the reference-based implementation of the ADT List including a main method and verify methods such as a constructor, "create()", "add()", "get()", "remove()", "isEmpty()", "size()", "removeAll()" and exception handling by implementing a test program. Show that the ADT List works.
Complete the implementations of the abstract class LinkedList.java, which implements the List.java interface and the class LinkedOrderedList.java, which extends the abstract class LinkedList.java and implements theOrderedList.java interface. LinkedList methods to implement: removeFirst removeLast remove contains LinkedOrderedList method to implement: add Recommended order of development: add to empty list to end of list to front of list to middle of list contains removeFirst removeLast remove Write a test class that tests all of the methods you implemented. Note: You only need to test LinkedOrderedList, because all of the methods are implemented in that class or inherited from LinkedList. Although you are not required to submit the test class, you might be asked to do so if you are having difficulties getting your implementation to work. Submit the completed LinkedList.java and LinkedOrderedList.java. LinkedList.java code import java.util.NoSuchElementException;import…
Write an abstract data type for rational numbers (a numerator and a denominator). Include a constructor and methods for getting the numerator, getting the denominator, addition, subtraction, multiplication, division, equality testing, and display. Use Java or C++.
An Abstract Data Type (ADT) is a data type that contains just variables, without information about their values. ADTs have many benefits. By reducing the issue to its simplest parts, it becomes easier to solve.
Make Java Abstract CommissionEmployee class provide the setters and getters of your data members implement abstract method Override the toString and equals of Employee Note:Person and Employee class are already in this activity. No need to add those classes to your code. For example: Test Result CommissionEmployee c = new CommissionEmployee ("Yule Josef Ato","Cebu City",23,"Accenture",40000.0f, 550, 0.10f); System.out.println(c); System.out.println("\nEarnings: "+c.earnings()); Name: Yule Josef Ato Address: Cebu City Age: 23 Company name: Accenture Regular salary: 40000.0 Item sold: 550 Commission rate: 0.1 Earnings: 40055.0 CommissionEmployee c = new CommissionEmployee ("Yule Josef Ato","Cebu City",23,"Accenture",40000.0f, 550, 0.10f); CommissionEmployee c2 = new CommissionEmployee ("Yule Josef Ato","Cebu City",23,"Accenture",40000.0f, 550, 0.10f); c.display(); System.out.println(c.equals(c2)); Name : Yule Josef Ato Address : Cebu City Age : 23 Company Name:…