Create an overloaded > (greater than) operator in the Student class. The operator willcompare the age of two student objects and return the object with the greater age.In main.cpp create a non member function named isFemale. This function will receiveas parameter a pointer to a student object. If the last two numbers of the student numberis valid numbers (Must be between 0 and 9) the function will return true. Otherwise thefunction will return false. How to do this part ?, I'm lostThe student.h file is below. 21:07 A O4G 44 195%回く:student.h#ifndef STUDENT_H-- -#define STUDENT_H#include using namespace std;class Student{public:Student ();string getName ()string get Surname () ;string get Email()string getAge () ;string getStudent_Number():void loadStudent (string lineFromFile);private :string Name;string Surname;string Email;string Age;string Student_Number;};#endif // STUDENT_HFilters Curtains MAP Packaging>Ethyelne Absorbers reduce ethylene & MAPpackaging increases shelf life* Keep It Fresh LLP

reate an overloaded > (greater than) operator in the Student class. The operator will compare the age of two student objects and return the object with the greater age. In main.cpp create a non member function named isFemale. This function will receive as parameter a pointer to a student object. If the last two numbers of the student number is valid numbers (Must be between 0 and 9) the function will return true. Otherwise the function will return false. How to do this part ?, I'm lost The student.h file is belo

reate an overloaded > (greater than) operator in the Student class. The operator will compare the age of two student objects and return the object with the greater age. In main.cpp create a non member function named isFemale. This function will receive as parameter a pointer to a student object. If the last two numbers of the student number is valid numbers (Must be between 0 and 9) the function will return true. Otherwise the function will return false. How to do this part ?, I'm lost The student.h file is belo

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter16: Searching, Sorting And Vector Type

Section: Chapter Questions

Problem 1TF

See similar textbooks

Similar questions

Not pseudocode Suppose the economies of the world use a set of currencies C1, . . . , Cn; think of these as dollars, pounds, Bitcoin, etc. Your bank allows you to trade each currency Ci for any other currency Cj, and finds some way to charge you for this service. Suppose that for each ordered pair of currencies (Ci, Cj ), the bank charges a flat fee of fij > 0 dollars to exchange Ci for Cj (regardless of the quantity of currency being exchanged). Describe an algorithm which, given a starting currency Cs, a target currency Ct, and a list of fees fij for all i, j ∈ {1, . . . , n}, computes the cheapest way (that is, incurring the least in fees) to exchange all of our currency in Cs into currency Ct. Also, justify the its runtime. [We are expecting a description of the algorithm, as well as a brief justification of its runtime.]
C++ Figure 6.9 #include <iostream>#include <cstdlib> // contains prototypes for functions srand and rand#include <ctime> // contains prototype for function timeusing namespace std; unsigned int rollDice(); // rolls dice, calculates and displays sum int main() {// scoped enumeration with constants that represent the game status enum class Status {CONTINUE, WON, LOST}; // all caps in constants // randomize random number generator using current timesrand(static_cast<unsigned int>(time(0))); unsigned int myPoint{0}; // point if no win or loss on first rollStatus gameStatus; // can be CONTINUE, WON or LOSTunsigned int sumOfDice{rollDice()}; // first roll of the dice // determine game status and point (if needed) based on first rollswitch (sumOfDice) {case 7: // win with 7 on first rollcase 11: // win with 11 on first roll gameStatus = Status::WON;break;case 2: // lose with 2 on first rollcase 3: // lose with 3 on first rollcase 12: // lose with 12 on first roll…
(python) 13. Identify and fix the errors in the following code. There are a total of 12 errors. define search_binary(xs, target): lb = 0 ub = len(xs)-1 while False: if lb == ub # If empty return -1 # Next probe should be in the middle of the list mid_index = (lb + ub)//2 // Find Middle # Fetch the item at that position item_at_mid == xs[mid_index] # How does the probed item compare to the target? if item_at_mid = target: return: mid_index # Found it! if item_at_mid < target: lb = mid_index + 1 # Use upper half if else: ub = mid_index - 1 # Use lower half list1 = [ -4, 33, -2, 0, 12, 3, -9, 34, 14, -7, 40 ) output("List:",list1) print("Sorted List:", list1.sort) print("Key is located at index " + float(search_binary(14, list1)))
#include <stdio.h>#include <conio.h> #define r 3#define c 4 int z[r][c] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12};int main (){ int a, b, d = 999; for (a = 0; a < r; ++a){ for (b = 0; b < d; ++b){ if(z[a][b])<d){ d = z[a][b]; printf("%d", d);} getch (0);}} return 1;} Using c language, produce the output.
#include <stdio.h>#include <stdlib.h>#include <unistd.h>#include <sys/types.h>#include <sys/wait.h> int main(){ int i, s; int a[] = {23,4,8,33,25,7,12,6,49,50,11,20,21,24,35}; pid_t pid; pid = fork(); if (pid == 0) { printf("I'm a child, I'll be printing the even numbers:\n"); for(i=0;i<(sizeof(a)/sizeof(int));i++) if(a[i]%2 == 0) printf("%d ",a[i]); } else { printf("I'm the parent, I'll be printing the odd numbers:\n"); if (pid > 0) pid = waitpid(pid, &s, 0); for(i=0;i<(sizeof(a)/sizeof(int));i++) if(a[i]%2 != 0) printf("%d ",a[i]); } return 0;} the output seem to have some error whereby it cannot output the number for the first if
1. (a) 1. (a) 1 A) Design an algorithm that inputs two lists of numbers, A, and B, of lengths n and m respectively, and finds out (and prints) how many common elements they contain. For example, if A contains 104, 195, 26, 503, 404, 793, 39, 995 and B contains 612, 27, 39, 321, 104 the algorithm will output 2 (because 39 and 104 are common to both lists). B) What is the efficiency of your algorithm in terms of m and n? Please use really simple worded pseudocode
1.Translate the symbols into words using the following representations:P: Dianne is a college freshman.Q: Dianne is a class officer.a.P v Q b. P ^ Q c. ~P ^ Q d. P v ~Q e. P ⇔ Q2.Translate the words into symbols using the following representationsP: Jasmine is a student.Q Jasmine is a Filipinaa.Jasmine is a student and she is a Filipina.b.Jasmine is a student and she not is a Filipina.c.Jasmine is not a student nor is she a Filipina.d.If Jasmine is a student, then she is a Filipina.e.If Jasmine is not a Filipina, then she is not a student.3.Given the Conditional Statement. “If the angles in a triangle measures 450 – 450 -900, then it is an isosceles right triangle. Construct a statement as to the following:a.Conjunction b. Disjunction c. Negation d. Biconditional
o print a task in a human-readable format, make sure that The name is written in all caps (i.e., capital letters), The priority is converted from an integer to its corresponding string status ("Low", "Lowest", "Medium", "High", "Highest") The deadline is converted to its written format (see Lab 7.19) The completed field is converted to a "Yes" or "No". Also, we want to print not just a single task, but a list of tasks, so we will print the index of a task on the same line as its name. We will also print a newline after printing a task to separate them in a list. Here is what the print should look like when a list with just 1 element gets printed: my_list = [{ 'name': 'get groceries', 'description': 'buy jam and peanut butter', 'priority': 2, 'deadline': '02/23/2022', 'completed': False }] print_formatted_tasks(my_list) The function call should print: 0: GET GROCERIES Description: buy jam and peanut butter Priority: Low Deadline: February 23, 2022 Completed: No <newline> def…
1,3 What is the complexity of the following Python code snippet in Big- O notation? Assume is a list of n unsorted numbers;data 2 is a list of n sorted numbers. def binary_search(data, value): n = len(data) left = 0 right = n - 1 while left <= right: middle = (left + right) // 2 if value < data[middle]: right = middle - 1 elif value > data[middle]: left = middle + 1 else: return middle return 'Value is not in the list' result = []for value in data1: result.append(binary_search(data2, value))
#include<iostream>#include<conio.h>#include<dos.h> #include <windows.h>#include <time.h> //#define SCREEN_WIDTH 90//#define SCREEN_HEIGHT 26#define WIN_WIDTH 70 #define T1POS 15#define T2POS 30#define T3POS 45#define DISKS 5 using namespace std; HANDLE console = GetStdHandle(STD_OUTPUT_HANDLE);COORD CursorPosition;int towers[3][DISKS];int towerTop[3] = {DISKS-1,-1,-1}; int tries = 0; int score = 0; void gotoxy(int x, int y){CursorPosition.X = x;CursorPosition.Y = y;SetConsoleCursorPosition(console, CursorPosition);}void setcursor(bool visible, DWORD size) {if(size == 0)size = 20; CONSOLE_CURSOR_INFO lpCursor; lpCursor.bVisible = visible;lpCursor.dwSize = size;SetConsoleCursorInfo(console,&lpCursor);}void updateScore(){gotoxy(WIN_WIDTH + 7, 5);cout<<"Tries: "<<tries<<endl;}void instructions(){system("cls");cout<<"Instructions";cout<<"\n----------------";cout<<"\n Shift Disks from Tower 1 to Tower 3. ";cout<<"\n…
dont write code. just write algorithm or related theory of the following question. Narrative 2: We need to have a generic module which reads in file and gives the output in the format which would facilitate other programs to do comparison like the one we saw above to carry out analysis and comparison. Response Required: Write a program that reads a given text, outputs the text as is, and also prints the number of lines and the number of times each letter appears in the text. An uppercase letter and a lowercase letter are treated as being the same; that is, they are tallied together. Since there are 26 letters, we use an array of 26 components to perform the letter count. We also need a variable to store the line count. The text is stored in a file, which we will call textin.txt. The output will be stored in a file, which we will call textout.txt Input: A file containing the text to be processed. Output: A file containing the text, number of lines, and the number of times a letter…
6.28 In Python, Write a program that replaces words in a sentence. The input begins with word replacement pairs (original and replacement). The next line of input is the sentence where any word on the original list is replaced. Ex: If the input is: automobile car manufacturer maker children kids The automobile manufacturer recommends car seats for children if the automobile doesn't already have one. the output is: The car maker recommends car seats for kids if the car doesn't already have one. You can assume the original words are unique.