I'm using livesql for my database class to try and do these

A medical clinic has doctors, along with patients assigned to one of the doctors.

Create 2 tables that include fields below with primary key chosen below. Use appropriate data types and simplified field names, eg: -

Doctor’s Table:
DKey ID          
Last name
First name
Home phone
Medical specialty
Monthly Salary

Patient’s Table:
PKey ID          
Last name
First name
Address (Use Address as column name)
Home Phone  
Age (in years)      
DoctorID Assigned
Medical History
Add 3 doctors and about 8 patients. Values will be provided in a text file to save time.

Create 3 select statements
List all doctors,
List all patients,
Using where clause, show which doctors have which patients. (Make sure your result indicates who is Doctor and who is Patient.

List the ID num, first and last name of doctors who has a salary that is greater than 16000.

Create the following aggregate select statements.
The monthly sum of all doctors’ salaries
The average age of the patients

Write a SQL statement to show the total number of rows in Patient table. Sort by last name.

Select the lastname, firstname, assigned doctor of patients where the patient’s medical history is Diabetic.

Write a SQL statement to change one of the patient’s name “Kasuma” who recently got married and which to use her married name “Chutaw.” Patient ID number is 103. (10pts)

Write a SQL statement to increase all Doctors salary by 20% and rename column as Salary Increase

List all the patients with high blood pressure and are older than 49 years old.

text file with values are:

Doctor Table


('AM01','Abrams','Miles','617-555-6032','MD', 20000);

('BR01','Boyers','Rita','603-555-2134','MD', 15000);

('DH01','Devon','Harley','781-555-7767','MD', 17000);



Patient Table


('101','Northfold','Liam','9 Old Mill Rd. Londonderry NH','603-555-7563', '45', 'BR01', 'Breat Cancer');

('102','Ocean','Arnold','2332 South St. Apt 3 Springfield MA','413-555-3212', '55','AM01', 'Diabetic');

('103','Kasuma','Sujata','132 Main St. 1 East Hartford CT','860-555-0703','64', 'DH01', 'High Blood Pressure');

('104','Goff','Ryan','164A South Bend Rd.Lowell MA','781-555-8423','50','DH01','Left Renal abnormality');

('105','McLean','Kyle','345 Lower Ave. Wolcott NY','585-555-5321', '60','BR01', 'Diabetic');

('106','Morontoia','Joseph','156 Scholar St. Johnston RI','401-555-4848', '52','DH01','High Blood Pressure');

('107','Marchand','Quinn','76 Cross Rd. Bath NH','603-555-0456', '40','AM01','Diabetic');

('108','Rulf','Uschi','32 Sheep Stop St. Edinboro PA','814-555-5521', '75','BR01', 'Low Blood Count');

i'm stuck at creating a second table "create table patient" and livesql keeps telling me im missing a parenthesis >_<

Below is my source code for file merging. when i run the code my merged file is blank and it never shows merging complete prompt. i dont see any errors or why my code would be causing this. i saved both files with male names and female names in the same location my source code is in as a rtf

#include
#include
#include
using namespace std;

int main()
{
ifstream inFile1;
ifstream inFile2;
ofstream outFile1;
int mClientNumber, fClientNumber;
string mClientName;
   string fClientName;
bool atLeastOneFileNotAtEnd = true;
bool inFile1Written = false;
bool inFile2Written = false;
  
cout << "File merge processing starting." << endl;
  
inFile1.open("MaleClients.rtf");
inFile2.open("FemaleClients.rtf");
outFile1.open("MergedClients.rtf");
  
inFile1 >> mClientNumber;
   inFile1 >> mClientName;
inFile2 >> fClientNumber;
   inFile2 >> fClientName;
  
   while (atLeastOneFileNotAtEnd == true)
{
   if(inFile1.eof())
{
   if(inFile2Written == false)
{
   outFile1 << fClientNumber << " " << fClientName << endl;
inFile2Written = true;
}
   }
else if(inFile2.eof())
{
if(inFile1Written == false)
{
outFile1 << mClientNumber << " " << mClientName << endl;
inFile1Written = true;
}
}
else if (mClientNumber < fClientNumber)
{
outFile1 << mClientNumber << " " << mClientName << endl;
inFile1Written = true;
}
else
{
outFile1 << fClientNumber << " " << fClientName << endl;
inFile2Written = true;
}
  
if ((!inFile1.eof()) && (inFile1Written == true))
{
   inFile1 >> mClientNumber >> mClientName;
inFile1Written = false;
}
  
if ((!inFile2.eof()) && (inFile2Written == true))
{
inFile2 >> fClientNumber >> fClientName;
inFile2Written = false;
}
  
if ((inFile1.eof()) && (inFile2.eof()))
{
   atLeastOneFileNotAtEnd = false;
   }
  
  
}
  
   inFile1.close();
inFile2.close();
outFile1.close();
  
cout << "Merging Complete." << endl;
  
   return 0;
}

Please write in C using linux or unix.

Write a program that will simulate non - preemptive process scheduling algorithm:

First Come – First Serve

Your program should input the information necessary for the calculation of average turnaround time including:

• Time required for a job execution;
• Arrival time;

The output of the program should include: starting and terminating time for each job, turnaround time for each job, average turnaround time.

Step 1: generate the input data (totally 10 jobs) and save it in the array of structure composing the arrival time, service time, termination time, turnaround time. The service time follows the uniform distribution in the range of [5, 25], and the arrival time is generated by uniform distribution in the range of [0,10] accumulated based on the previous arrival time.

Step 2: program FCFS algorithm.

Note: be careful about the situation that one job is finished while the next job is not arrived yet, so you have the idle time between them.

Step 3: output

print out one line for each job with arrival time, start time, service, termination time, turnaround time, finally average turnaround time in the last line.

identify a company that uses the internet of marketing, sales and promotion

You have been appointed as the Software Quality Assurance Manager for a
project that enables students to access their results on their android phones.

As the person responsible for the overall quality aspects, its your interest to
ensure that strong quality assurance practices are put in place to forestall any
software failure by the end-users.

i. It is important that you conduct requirements validation as part of your
quality assurance practices in this project. Could you explain in your own
words, what is requirements validation and its importance? What is the
impact if this process is not well conducted?

ii. Requirements review is one of the requirements validation techniques
in quality assurance. If you are going to make requirements review, which
method do you prefer to do the activity, formal or informal method?
Explain why you choose the method. Suggest and explain the types of
checks that should be done on the requirements in the software
requirement specification.

b. You are investigating systems requirements for a shipping company. Assume
that you have set up an interview with the manager of the shipping
department. Your objective is to determine how shipping works and what the
information requirements for the new system will be.

Make a list of questions—three (3) open ended and three (3) closed ended—
that you would use. Include four (4) questions or techniques you would use
to ensure you find out about the exceptions.

c. During interviews, why is it important to seek the opinions of the interviewee?

You are required to modify the attached simulation program. This program currently uses an array to implement the queue. You will modify the program so that it uses the STL queue instead.

#include <iostream>
using namespace std;
#include <math.h>
#include<fstream>
double time = 0;

int seed = 1;
/* External definitions for single-server queeing system. */

const int  Q_LIMIT = 100000;    /* Limit on queue length. */
const int  BUSY =     1;        /* Mnemonics for server's being busy */
const int  IDLE =     0; /* and idel. */
const double infinity = 1.0e+29;
const int max_int = 2147483647;

//Define generators



ifstream infile;
ofstream outfile;

int next_event_type, num_custs_delayed, num_delays_required,
    num_events, num_in_q, server_status;
double area_num_in_q, area_server_status, mean_interarrival,
      mean_service, clock, time_arrival[Q_LIMIT + 1],
          time_last_event, time_next_event[3], total_of_delays, arrivaltime, 
lambda;

double asum = 0; //accumulates arrival times
double ssum = 0; //accumulates service time
long int num_arrived = 0; //number of arrivals
long int num_serviced = 0; //number of customers serviced



//Function Prototypes

void initialize();
void timing();
void arrive();
void depart();
void report();
void update_time_avg_stats();
double arrival_time(double tau);   // generate time of next arrival
double service(double s);// : real;                { generate a service time }

//Main function
int main() /* Main function. */
{
        /* Open input and output files. */

        infile.open("mm1.in");
        outfile.open("mm1.out");

        /* Specify the number of events for the timimg function. */

        num_events = 2;

        /* Read input parameters. */
        cout << "please enter the mean interarrival time >>";
        cin >>mean_interarrival;
        cout << "please enter the mean service time >>";
        cin>>mean_service;
        cout << "please enter the number of customers>>";
    cin >> num_delays_required;


        lambda = 1 /mean_interarrival;

        /* Write report heading and input parameters. */

        outfile << "Single-server queueing system "<<endl<<endl;
        outfile << "Mean interarrival time" << mean_interarrival << "minutes "<<endl<<endl;
        outfile << "Mean service time "<< mean_service << " minutes" << endl<<endl;
        outfile << "Number of customers "<< num_delays_required <<endl<<endl;


        /* Initialize the simulation. */

        initialize();

        /* Run the simulation while more delays are still needed. */

        for(int i = 0; i < num_delays_required;i++)
        {

                /* Determine the next event. */

                timing();

                /* Update time-average statistical accumulators. */

                update_time_avg_stats();

                /* Invoke the appropriate event funtions. */

                switch (next_event_type)
                {
                        case 1:
                                arrive();
                                break;
                        case 2:
                                depart();
                                break;
                }
        }

        /* Invoke the report generator and eand the simulation. */

        report();

        infile.close();
        outfile.close();

        return 0;
}

void initialize() /* Initialization function. */
{
        /* Initialize the simulation clock. */

        time = 0.0;

        /* Initialize the state variables. */

        server_status       = IDLE;
        num_in_q            = 0;
        time_last_event     = 0.0;

        /* Initialize the statistical counters. */

        num_custs_delayed   = 0;
        total_of_delays     = 0.0;
        area_num_in_q       = 0.0;
        area_server_status  = 0.0;

        /* Initialize event list. Since no customers are present, the
           departure (service completion) event is eliminated from
           consideration. */

        time_next_event[1] = time + arrival_time(mean_interarrival);//schedule first arrival
        time_next_event[2] = infinity; //first event cannot be departure

}

void timing() /* Timing function. */
{
        int i;
        double min_time_next_event = infinity;
        next_event_type = 0;

        /* Determine the event type of the next event to occur. */

        for (i = 1; i<= num_events; ++i)
        {
                if (time_next_event[i] < min_time_next_event)
                {
                        min_time_next_event = time_next_event[i];
                        next_event_type     = i;
                }
        }

        /* Check to see whether the event list is empty. */

        if (next_event_type ==0)
        {

                /* The event list is empty, so stop the simulation. */

                outfile << endl <<"Event list empty at time "<< time;
                exit(1);
        }

        /* The event list is not empty, so advance the simulation clock. */

        time = min_time_next_event;
}

void arrive() /* Arrival event functin. */
{
        double delay;

        /* Schedule next arrival. */

        time_next_event[1] = time + 
arrival_time(mean_interarrival);//expon(mean_interarrival)

        /* Check to see whether server is busy. */

        if (server_status == BUSY)
        {

                /* Serer is busy, so increment number of customers in queue.
                    */

                ++num_in_q;

                /* Check to see  whether an overflow condition exists. */

                if (num_in_q > Q_LIMIT)
                {

                        /* The queue has overflowed, so stop the simulation. */

                        outfile<<endl<< "Overflow of the array time_arrival at";
                        outfile<<" time "<< time<< endl;
                        exit(2);
                }

                /* There is still room in the queue, so store the time of
                   arrival of the arriving customer at the (new) end of
                   time_arrival. */

                time_arrival[num_in_q] = time;
        }

        else {

                /* Server is idle, so arriving customer has a delay of zero.
                   (The following two statements are for program clarity and do
                   not affect the results of the simulaiton.) */

                delay            = 0.0;
                total_of_delays += delay;

                /* Increment the number of customers delayed, and make server
                   busy. */

                ++num_custs_delayed;
                server_status = BUSY;

                /* Schedule a departure (service completion). */

                time_next_event[2] = time + service(mean_service);
        }
}

void depart() /* Departure event function. */
{
        int   i;
        double delay;

        /* Check to see whether the queue is empty. */

        if (num_in_q == 0)
        {

                /* The queue is empty so make the server idle and eliminate the
                   departure (service completion) event form consideration. */

                server_status      = IDLE;
                time_next_event[2] = 1.0e+30;
        }

        else
        {

                /* The queue is nonempty, so decrement the number customers
                   in queue. */

                --num_in_q;

                /* Compute the delay of the customer who is beginning service
                   and update the total delay accumulator. */

                delay            = time - time_arrival[1];
                total_of_delays += delay;

                /* Increment the number of customers delayed, and schedule
                   departure. */

                ++num_custs_delayed;
                time_next_event[2] = time + service(mean_service);

                /* Move each customer in queue (if any) up one place. */

                for (i = 1; i <= num_in_q; ++i)
                        time_arrival[i] = time_arrival[i + 1];
        }
}

void report() /* Report generator function. */
{
        /* Compute and write estimates of desired measures of performance.
           */

        cout <<"number of customers delayed = "<<num_custs_delayed<<endl;
        outfile << endl<<endl<<"Average delay in queue "<< total_of_delays / 
num_custs_delayed
                    << "minutes " <<endl<<endl;
        outfile << "Average number in queue " << area_num_in_q / time<<endl<<endl;
        outfile << "Server utilization " << area_server_status / time << 
endl<<endl;
        outfile << "Time simulation ended " << time << endl;
        outfile << "Average arrival time = "<< asum/num_arrived<<endl;
        outfile << "Average service time = "<< ssum/num_serviced<<endl;
        outfile << "Total number of arrivals = " << num_arrived <<endl;
        outfile << "Total number serviced = " << num_serviced <<endl;

        outfile << endl<<endl<<"Theoretical results "<<endl<<endl<<endl;
        double rho = mean_service/mean_interarrival;

        outfile << "Average delay in queue " <<(rho * rho) / ( lambda * (1 - 
rho)) <<endl;
        outfile << "Average number in queue " <<(rho * rho) / ( 1 - rho) 
<<endl;
        outfile << "Server utilization "<<rho <<endl;
        outfile << "Average number in system" << rho / (1 - rho) 
<<endl;

        outfile << "The total wait time = " << (mean_service * mean_interarrival)/
                                               (mean_interarrival- mean_service) << endl;
        
}


void update_time_avg_stats() /* Update area accumulators for
                                                                     time-average statistics. */
{
        double time_since_last_event;

        /* Compute time since last event, and updat last-event-time
           marker. */

        time_since_last_event = time - time_last_event;
        time_last_event        = time;

        /* Update area under number-in-queue function. */
        area_num_in_q += num_in_q * time_since_last_event;
        
        /* Update area under server-busy indicator function. */
        
        area_server_status += server_status * time_since_last_event;
}



//Generates a random number between 0 and 1
double random()
{

  long int a = 16807;
  long int q = 127773;
  long int r = 2836;

  long int lo, hi, t ;

  hi = seed / q;
  lo = seed - q * hi;
  t = a * lo - r * hi;
  if (t > 0)
     seed = t;
  else
     seed = t + max_int;
  return (double)seed / max_int;
}//end; {random}
//Generates an exponentially distributed variable with mean mu

double exponential(double mu) // returns an exponentially distributed random deviate
{
        double u;
        double temp;
        u = random();
    temp = -mu * log(1 - u);
    return temp;
}

//generates an exponentially distributed service time with mean
//function service : real;                { generate a service time }
double service(double s)// : real;                { generate a service time }
{
        double stime;
        stime = exponential(s);
        ssum += stime;
        num_serviced ++;
        return stime;
}

//generates an exponentially distributed arrival time with mean "tau" }
double arrival_time(double tau)   // generate time of next arrival
{
        double atime;
        atime = exponential(tau);
    asum += atime;
        num_arrived ++;
    return atime;;  // get the next arrival time
}//arrival_time

Represent the decimal number +105.25 as a sign (S), mantissa (M), and exponent (E)

This is based on LinkedLists. Avneet Pandey, please do not answer this. Both your previous answers were wrong.

Please complete the methods max() and threshold(). I'd greatly appreciate it. There is a type mismatch in my first method and I dont know how to get around it. I've commented on the line with the type mismatch. Please write a correct method in the answer so I can compare it to my wrong method

public class Node {
   public T info;
public Node link;
public Node(T i, Node l) {
   info = i; link = l;
   }
}

class LinkedList> {
  
protected Node head = null;
public LinkedList add(T el) {
head = new Node(el, head);
return this;
}
public void print() {
for(Node node = head; node!=null; node=node.link) {
System.out.print(node.info+" ");
}
System.out.println("");
}
  
public T maxValue() { // Note: Recursive methods not allowed, using new key word not allowed, no iterators allowed
   if (head == null) {
   return null;
   }
   else {
   Node temp = head;
   if (temp.link == null) {
   return temp.info;
   }
   else {
   T max = temp.link; //type mismatch
   if (temp.info.compareTo(max) > 0)
   max = temp.info;
   return max;
   }
}
}
  
public void threshold(T thres) {//Note: Recursive methods not allowed, using new key word not allowed, no iterators allowed

}

public static void main(String args[]) {
  
LinkedList list = new LinkedList();
System.out.println(list.maxValue()); // should be null
list.add(20).add(30).add(10);
System.out.println(list.maxValue()); // should be 30
list.threshold(40);
list.print(); // should print out all elements
list.threshold(30);
list.print(); // should print out 10 20
list.threshold(10);
list.print(); // should print nothing
}
}

Instructions:

Using Unix programming language and regular expressions,

1. how many unique ip addresses were seen note: we only want to look at ipv4 addresses
2. which was most commnly seen ip address
on the piece of access.log file below

66.249.75.132 - - [18/Jun/2018:06:41:00 -0500] "GET /~rcoleman/Common/History/Images/?C=N;O=D HTTP/1.1" 200 1976 "-" "Mozilla/5.0 (compatible; Googlebot/2.1; +http://www.google.com/bot.html)"
5.255.250.23 - - [18/Jun/2018:06:41:23 -0500] "GET /~rcoleman/Common/CodeVault/Code/DesignPatterns/Images/DP16-Builder.jpg HTTP/1.1" 304 182 "-" "Mozilla/5.0 (compatible; YandexImages/3.0; +http://yandex.com/bots)"
5.255.250.23 - - [18/Jun/2018:06:41:28 -0500] "GET /~rcoleman/CS121/CourseInfo/Images/WinExp.jpg HTTP/1.1" 304 180 "-" "Mozilla/5.0 (compatible; YandexImages/3.0; +http://yandex.com/bots)"
148.108.96.32 - - [18/Jun/2018:06:41:43 -0500] "GET /~rcoleman/Common/Basics/Images/ASCII_Table.jpg HTTP/1.1" 200 144715 "https://www.bing.com/" "Mozilla/5.0 (Windows NT 6.1; WOW64; rv:52.0) Gecko/20100101 Firefox/52.0"
5.255.250.23 - - [18/Jun/2018:06:42:41 -0500] "GET /~delugach/Courses/H399-01/License%20Agreement%20for%20Acrobat HTTP/1.1" 200 12667 "-" "Mozilla/5.0 (compatible; YandexBot/3.0; +http://yandex.com/bots)"
5.255.250.23 - - [18/Jun/2018:06:42:59 -0500] "GET /~rcoleman/Common/CodeVault/Code/DesignPatterns/Images/DP03-Decorator.jpg HTTP/1.1" 304 182 "-" "Mozilla/5.0 (compatible; YandexImages/3.0; +http://yandex.com/bots)"
49.36.1.71 - - [18/Jun/2018:06:43:22 -0500] "GET /favicon.ico HTTP/1.1" 301 4121 "https://www.cs.uah.edu/~rcoleman/Common/C_Reference/C++%20For%20DUMMIES.pdf" "Mozilla/5.0 (Windows NT 6.3; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/69.0.3452.0 Safari/537.36"
148.253.182.198 - - [18/Jun/2018:06:44:00 -0500] "GET /~rcoleman/CS121/ClassTopics/Images/Operators02.jpg HTTP/1.1" 200 54617 "https://www.bing.com/" "Mozilla/5.0 (Windows NT 6.3; WOW64; Trident/7.0; rv:11.0) like Gecko"
49.36.1.71 - - [18/Jun/2018:06:43:21 -0500] "GET /~rcoleman/Common/C_Reference/C++%20For%20DUMMIES.pdf HTTP/1.1" 200 8103354 "https://www.google.co.in/" "Mozilla/5.0 (Windows NT 6.3; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/69.0.3452.0 Safari/537.36"
66.249.75.130 - - [18/Jun/2018:06:44:42 -0500] "GET /~rcoleman/Common/History/Images/Pic20_ABC.jpg HTTP/1.1" 304 181 "-" "Googlebot-Image/1.0"
179.7.54.141 - - [18/Jun/2018:06:44:53 -0500] "GET /~rcoleman/Common/C_Reference/C++%20For%20DUMMIES.pdf HTTP/1.1" 200 8085570 "-" "Dalvik/2.1.0 (Linux; U; Android 7.0; SM-J730GM Build/NRD90M)"
175.158.232.110 - - [18/Jun/2018:06:45:58 -0500] "GET /~rcoleman/CS121/ClassTopics/Images/CompSys10.jpg HTTP/1.1" 200 217846 "https://www.google.com.ph/" "Mozilla/5.0 (Windows NT 6.1; WOW64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/52.0.2743.116 Safari/537.36"
5.255.250.23 - - [18/Jun/2018:06:46:03 -0500] "GET /~rcoleman/Common/SoftwareEng/Images/UML_01.jpg HTTP/1.1" 304 181 "-" "Mozilla/5.0 (compatible; YandexImages/3.0; +http://yandex.com/bots)"
5.255.250.23 - - [18/Jun/2018:06:46:23 -0500] "GET /~dhardin/cs_100/Animations/frmMoveBall_GUI.frm HTTP/1.1" 200 2066 "-" "Mozilla/5.0 (compatible; YandexBot/3.0; +http://yandex.com/bots)"
216.244.66.197 - - [18/Jun/2018:06:47:14 -0500] "GET /robots.txt HTTP/1.1" 301 577 "-" "Mozilla/5.0 (compatible; DotBot/1.1; http://www.opensiteexplorer.org/dotbot, [email protected])"
157.55.39.241 - - [18/Jun/2018:06:47:37 -0500] "GET /~rcoleman/Common/Basics/Images/Pointers03.jpg HTTP/1.1" 200 76104 "-" "Mozilla/5.0 (compatible; bingbot/2.0; +http://www.bing.com/bingbot.htm)"
41.190.3.133 - - [18/Jun/2018:06:47:51 -0500] "GET /~rcoleman/Common/History/History.html HTTP/1.1" 200 9592 "http://www.google.com/url?sa=t&rct=j&q=&esrc=s&source=web&cd=14&ved=0ahUKEwjNw_ODkt3bAhWkB8AKHfbUCMwQFghnMA0&url=http%3A%2F%2Fwww.cs.uah.edu%2F~rcoleman%2FCommon%2FHistory%2FHistory.html&usg=AOvVaw1na6HxGz_OCQSHXgI3jn1L" "Mozilla/5.0 (Windows NT 6.1; rv:36.0) Gecko/20100101 Firefox/36.0"
41.190.3.133 - - [18/Jun/2018:06:47:52 -0500] "GET /~rcoleman/Common/History/Images/Pic02_RomanAbacus.jpg HTTP/1.1" 200 43539 "http://www.cs.uah.edu/~rcoleman/Common/History/History.html" "Mozilla/5.0 (Windows NT 6.1; rv:36.0) Gecko/20100101 Firefox/36.0"
41.190.3.133 - - [18/Jun/2018:06:47:52 -0500] "GET /~rcoleman/Common/History/Images/Pic01_AncientTimes.jpg HTTP/1.1" 200 40097 "http://www.cs.uah.edu/~rcoleman/Common/History/History.html" "Mozilla/5.0 (Windows NT 6.1; rv:36.0) Gecko/20100101 Firefox/36.0"
41.190.3.133 - - [18/Jun/2018:06:47:52 -0500] "GET /~rcoleman/Common/History/Images/Pic03_JohnNapier.jpg HTTP/1.1" 200 39131 "http://www.cs.uah.edu/~rcoleman/Common/History/History.html" "Mozilla/5.0 (Windows NT 6.1; rv:36.0) Gecko/20100101 Firefox/36.0"
41.190.3.133 - - [18/Jun/2018:06:47:52 -0500] "GET /~rcoleman/Common/History/Images/Pic06_WilliamOughtred.jpg HTTP/1.1" 200 49153 "http://www.cs.uah.edu/~rcoleman/Common/History/History.html" "Mozilla/5.0 (Windows NT 6.1; rv:36.0) Gecko/20100101 Firefox/36.0"
41.190.3.133 - - [18/Jun/2018:06:47:52 -0500] "GET /~rcoleman/Common/History/Images/Pic05_SlideRule.jpg HTTP/1.1" 200 71314 "http://www.cs.uah.edu/~rcoleman/Common/History/History.html" "Mozilla/5.0 (Windows NT 6.1; rv:36.0) Gecko/20100101 Firefox/36.0"
41.190.3.133 - - [18/Jun/2018:06:47:53 -0500] "GET /~rcoleman/Common/History/Images/Pic04_NapiersBones.jpg HTTP/1.1" 200 53637 "http://www.cs.uah.edu/~rcoleman/Common/History/History.html" "Mozilla/5.0 (Windows NT 6.1; rv:36.0) Gecko/20100101 Firefox/36.0"

Using Python,

Write an app for patients such as patients requiring surgery and patients who are pregnant and relevant functionalities.

Note : It's not a complex app. It is for my fundamental 2 class to understand the inheritance concept. Simpler the better.

ASM Programming instructions: For this week the student’s goal is to write an occurrence finding function that builds off of the past two weeks of assembly programming. The requirements for this function are as follows.

1. The user is allowed to type in 10 positive integers plus an occurrence value (meaning 11 inputs).
   1. The 10 integers should be handled in a loop where each value input by the user (as in week 1) is stored into memory in an array like structure (as in week 2).
   2. The input occurrence is also an integer which represents a value present (or not) in the input array.
2. Then, the program will loop through the array and find any matching with the input occurrence value.
3. When finding a matching, its index inside the array will be output and the number of occurrences found will be incremented by 1.
4. At the end of the loop, the program will print out the number of occurrences found.

The C++ code for this program is as such:

int main()

{            

                            int x[10], occur, count = 0;

                               cout << "Type in array numbers:" << endl;

for (int i=0; i<10; i++) // reading in integers

                              {

cin >> x[i];       

}

cout << "Type in occurrence value:" << endl;

                                cin >> occur;

                                // Finding and printing out occurrence indexes in the array

                                 cout << "Occurrences indices are:" << endl;

for (int i=0; i<10; i++)

{

     If (x[i] == occur)

                                     {       

cout << i << endl;

                                                count ++;            

                                  }

}

cout << "Number of occurrences found:" << endl;

                                cout << count;

return 0;

}

Done in c++

1. Read this file one time to determine how many records it contains. Be sure to check for a successful file open here.
2. Close the file.
3. Allocate memory dynamically to store the data from step 1. This dynamically allocated memory should be for an array of strings. The array size should be exactly the number of records from step 1.
4. Reopen the file and read it a second time, storing each record into the array of strings from step 3.
5. Print the first and last element in the array.
6. Release the allocated memory.
7. Your program output should look like this:

The file that you should read:

four score and seven years ago our fathers brought forth on this continent a new
nation conceived in liberty and dedicated to the proposition that all men are
created equal
now we are engaged in a great civil war testing whether that nation or any nation
so conceived and so dedicated can long endure we are met on a great battlefield of
that war we have come to dedicate a portion of that field as a final resting place
for those who here gave their lives that that nation might live it is altogether fitting
and proper that we should do this
but in a larger sense we can not dedicate we can not consecrate we can not
hallow this ground the brave men living and dead who struggled here have
consecrated it far above our poor power to add or detract the world will little
note nor long remember what we say here but it can never forget what they did
here it is for us the living rather to be dedicated here to the unfinished work which
they who fought here have thus far so nobly advanced it is rather for us to be here
dedicated to the great task remaining before us that from these honored dead we
take increased devotion to that cause for which they gave the last full measure of
devotion that we here highly resolve that these dead shall not have died in vain
that this nation under god shall have a new birth of freedom and that
government of the people by the people for the people shall not perish from the
earth

NOT a direct goal of the structured programming movement of the 60s?

A : to facilitate the creation of concurrent programs

B : to improve program readability

C : to make it easier to maintain code

D : to reduce software costs

In C++,

The following program reads one character from the keyboard and will display the character in uppercase if it is lowercase and does the opposite when the character is in uppercase. If the character is a digit, it displays a message with the digit.

Modify the program below such that if one of the whitespaces is entered, it displays a message and tells what the character was.

// This program reads one character from the keyboard and will
// convert it to uppercase. If it is lowercase, convert it to uppercase.

// If it is a digit display a message with the digit.

#include<iostream>
#include<cctype>
using namespace std;

int main( )
{
    char c;

    cout << "Enter a character \n";
    cin >> c;

     if(isalpha(c))
    { //check to see if it is a letter of alphabet
        if( isupper(c) ) //check to see if it is uppercase
        {
            cout << "Your character " << c << " is in uppercase.";
c = tolower(c);
            cout << "Its lowercase case is " << c << endl;
        }
        else
       {

cout << "Your character " << c << " is in lowercase.";
            c = toupper(c);
            cout << "Its uppercase is " << c << endl;
        }
     }
     else
     {
            cout << "Your character " << c << " is a digit.\n";
     }

     return 0;
}

How to write a C++ program that lets the user enter a string and checks if it is an accepted polynomial. Accepted polynomials need to have one term per degree, no parentheses, spaces ignored.