Create a Student variable on the heap. Fill in the name and ID and print itout. Then, free the memory used by the variable.dynamic.cpp#include #include #include "debug_new.h"using namespace std;12345struct Student{string name;long ID;};781011int main(int argc, char* argv[]){Student* sp =12131415cout <« "Name:16getline(cin,17cout << "ID:18cin >> ...;19cout << ... « ", ID:« endl;<< ...20sp;...21

The student is a structure variable, which consists of two data members' name of type string and ID…

Create a Student variable on the heap. Fill in the name and ID and print it out. Then, free the memory used by the variable. dynamic.cpp 1 #include #include #include "debug_new.h" using namespace std; 2 3 4 5 struct Student { string name; long ID; }; 7 8 9. 10 11 12 int main(int argc, char* argv[]) 13 { Student* sp = cout <« "Name: 14 15 16 getline(cin, ...); 17 cout <« "ID: 18 cin >> ...; 19 cout << ... « ", ID: « ... « endl; 20 sp; ... 21 }

Create a Student variable on the heap. Fill in the name and ID and print it out. Then, free the memory used by the variable. dynamic.cpp 1 #include #include #include "debug_new.h" using namespace std; 2 3 4 5 struct Student { string name; long ID; }; 7 8 9. 10 11 12 int main(int argc, char* argv[]) 13 { Student* sp = cout <« "Name: 14 15 16 getline(cin, ...); 17 cout <« "ID: 18 cin >> ...; 19 cout << ... « ", ID: « ... « endl; 20 sp; ... 21 }

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

Similar questions

use replit please Thank you
Java - This project will allow you to compare & contrast different 4 sorting techniques, the last of which will be up to you to select. You will implement the following: Bubble Sort (pair-wise) Bubble Sort (list-wise) [This is the selection sort] Merge Sort Your choice (candidates are the heap, quick, shell, cocktail, bucket, or radix sorts) [These will require independent research) General rules: Structures can be static or dynamic You are not allowed to use built in methods that are direct or indirect requirements for this project – You cannot use ANY built in sorting functions - I/O (System.in/out *) are ok. All compare/swap/move methods must be your own. (You can use string compares) Your program will be sorting names – you need at least 100 unique names (you can use the 50 given in project #3) – read them into the program in a random fashion (i.e. not in any kind of alpha order). *The more names you have, the easier it is to see trends in speed. All sorts will be from…
You will create two programs. The first one will use the data structure Stack and the other program will use the data structure Queue. Keep in mind that you should already know from your video and free textbook that Java uses a LinkedList integration for Queue. Stack Program Create a deck of cards using an array (Array size 15). Each card is an object. So you will have to create a Card class that has a value (1 - 10, Jack, Queen, King, Ace) and suit (clubs, diamonds, heart, spade). You will create a stack and randomly pick a card from the deck to put be pushed onto the stack. You will repeat this 5 times. Then you will take cards off the top of the stack (pop) and reveal the values of the cards in the output. As a challenge, you may have the user guess the value and suit of the card at the bottom of the stack. Queue Program There is a new concert coming to town. This concert is popular and has a long line. The line uses the data structure Queue. The people in the line are objects…
Create class Test in a file named Test.java. This class contains a main program that performs the following actions: Instantiate a doubly linked list. Insert strings “a”, “b”, and “c” at the head of the list using three Insert() operations. The state of the list is now [“c”, “b”, “a”]. Set the current element to the second-to-last element with a call to Tail() followed by a call to Previous()Then insert string “d”. The state of the list is now [“c”, “d”, “b”, “a”]. Set the current element to past-the-end with a call to Tail() followed by a call to Next(). Then insert string “e”. The state of the list is now [“c”, “d”, “b”, “a”, “e”] . Print the list with a call to Print() and verify that the state of the list is correct.