Graduate Archives - Page 10 of 16 - Swift Essay Writers

Category: Graduate

May 17th, 2020

Civil Engineering, Graduate

Comments Off

Optimization

Problem 1 (50 points)

For a certain civil engineering system, we have two types of resources: Labor, and equipment We refer to these resources by the index j. Likewise each resource can be assigned to two types of activities: Maintenance and operations. We refer to these activities by the index i. Furthermore, the variables xij represent the amount of hours used by the resource j (labor/equipment) performing activity i (maintenance/ operations).

Maintenance. Maintaining the system involves the use of equipment and labor.

The part of the labor that goes into maintenance has a cost of $2/hour; and the part of equipment use that goes into maintenance has a cost of $4/hour.

The total labor and equipment costs for maintenance should not exceed the maximum maintenance budget of $21 million

Operations. Operating the system involves the use of equipment and labor.

The part of labor that goes into operations has a cost of $5/hour; and the part of equipment use that goes into operations has a cost of $3/hour.

The total labor and equipment costs for operations should not exceed and maximum operations budget of $18 million

From past records of similar systems, it has been found that the performance of the system, Z, depends on the amount of effort put in maintenance and operations. Specifically, each hour of labor represents $3 million of profit for the company and each hour of equipment represents $2 million of profit for the company (it does not matter whether these hours where used for maintenance or operation). As a manager in the agency, you seek to maximize Z under the given budgetary constraints.

Write the complete optimizations problem mathematically (the objective function and all constraints).

Remember that xij should be non-negative.

Using software for solution:

Solve the problem using Excel SOLVER and attach a copy of your output, clearly highlighting the optimal solution using any highlighter.

Problem 2 (50 points)

For construction of a civil engineering facility, a contractor has found natural reserves of sand and gravel at Bloomingdale and Valley Springs where he may purchase such material. The unit cost including delivery from Bloomingdale and Valley Springs is $5 and $7, respectively. After the material is brought to the site it is mixed thoroughly and uniformly, and contract specification state that the mix should contain a minimum of 30% sand.

A total volume of 100,000 m3 of mixed material is needed for the project. The Bloomingdale Pit contains 25% sand and the Valley Springs Pit contains 50% sand.

As the new young construction engineer on the project, you are asked to determine how much material should be taken from each pit in order to minimize the cost of material.

(a) Define the decision variables
(b) Write the constraints in mathematical form
(c) Write the objective function in mathematical form
(d) Find the optimum solution using the graphical method (how much material should the contractor take from each pit in order to minimize the overall cost of the material?)
(e) If you had not been hired, the contractor would have used 60,000 m3 from Bloomingdale and 40,000 m3 from Valley Springs. How much did you save the company by giving them the experts advice as your answer to Question (d)?
(f) Solve part (d) using Excel Solver and attach a printout of the program output to your homework submission. Mark clearly the optimal solution in the output using a highlighter.

May 17th, 2020

BankingSystem, Graduate

Comments Off

Lab4

Here is the Lab 4. That is the continuation of Lab 3 that you worked on last time. I made some updates and small changes on Lab 3 that you did to make it perfect. I have attached the zip of that perfect version of Lab 3 so that you can use it to make Lab 4

May 17th, 2020

Graduate, Software Engineering

Comments Off

MATLAB Biomedical Signal Analysis Project

Need to create code for project description. Part A and B is done. You need to create the code and statistics as described in Part B document. Pan Tompkins Algorithm zip file is attached.
https://physionet.org/content/mitdb/1.0.0/
https://archive.physionet.org/cgi-bin/atm/ATM

May 17th, 2020

Graduate, Logistics

Comments Off

IMPLEMENTATION OF THE BLOCKCHAIN TECHNOLOGY AMONG THE SUPPLY CHAIN ECOSYSTEM IN THE FOOD INDUSTRY.

Task: The Postgraduate Major Project consists of a 10,000 words dissertation. Students are encouraged to build on the work submitted to the Research Methods module, and re-read previous feedback to take action and discuss with their supervisor. Introduction (10 marks) Is the abstract adequate? Is there a clear purpose and rationale for the study? Is there a clear set of objectives / research questions? Use of Literature & Sources (20 marks) Was the range suitable and adequate? Has a critical review of the literature been adopted? Research Design & Methodology (20 marks) Was research design and methodology discussed? Was the approach appropriate? Results, Analysis & Interpretation of Data (30 marks) Has the data been accurately presented and analysed or are findings merely a description? Has appropriate theory been applied? Has the student attempted to interpret their findings? Conclusion & Recommendations (10 marks) Are conclusions reasoned? Do they correspond with the objectives of the research? Presentation (10 marks) Is the structure and the language clear? Is Harvard Referencing applied? Are tables and diagrams used effectively? All needed files will be uploaded after hiring

May 16th, 2020

Graduate, Mechanical Engineering

Comments Off

vehicle dynamics- modeling with matlab simulink

A bump profile has been provided, which provides a vertical displacement over time for one wheel, based on the profile shown. It is suggested that you use a quarter-car model initially, in order to familiarise yourself with this system before proceeding to the half-car model.
2. Create a half-car model in Simscape Multibody with the given parameters, using joints which appropriately allow motion. .
3. Identify a location on the car body where the drivers head is likely to be and use this as a point from which to measure driver acceleration and displacement (use a transform and a transform sensor).
4. model output:
Driver displacement (absolute and relative to car), driver upward acceleration (absolute),
Tyre displacement (compression)
Force at suspension mounting (top)
5. Evaluate the sensitivity of the response, in terms of acceleration and displacement experienced by the driver, to TWO OF THE LISTED PARAMETERS AS ALLOCATED TO YOU over the required range of speeds.
6. Investigate the sensitivity of the model to change of solution algorithm (use a single instance from your models above (i.e. one velocity, one set of parameters) and run with a range of algorithms. Consider the effect of step-size also. Be sure to look at acceleration as well as position in your analysis.
7. Develop a set of lagrangian dynamics equations for the quarter-car model, subjected to a vertical force applied to the body, and solve these using one of the matlab solvers such as ode45, comparing your results with your simscape multibody quarter-car model for one set of parameters.
8. The following will attract extra credit:
a. Implement a separate body to represent the driver on a suitably sprung seat and compare the effect on this separate driver with your earlier results for each scenario.
b. Car dampers often have a different damping constant for the bump and return. Find a way to implement this logic.

May 16th, 2020

Graduate, Websites, web programming

Comments Off

Javascript

This week’s exercise is to design a program for node.js that calculates paychecks for a small business. The program must read the two files “wages.csv” and “hours.csv” which are 2 column CSV files, an employee name and a number. In the case of “wages.csv” the number represents the hourly wage. In the case of “hours.csv” the number represents the number of hours worked in the last pay period. Some names in “wages.csv” may not be present in “hours.csv” (in case the employee has not worked). The program must produce the file “report.txt” with a line for each employee indicating the amount of the paycheck of this employee. Here are examples of “wages.csv”, “hours.csv” and “rapport.txt” files:

“wages.csv” file

Jean Dubuc, 25
Anne Gadbois, 20
Julie Tremblay, 40
Paul Tremblay, 20
Marie Valois, 15

“hours.csv” file

Jean Dubuc, 70
Julie Tremblay, 60
Marie Valois, 80

File “rapport.txt”

Jean Dubuc: pay $ 1,750
Anne Gadbois: pay $ 0
Julie Tremblay: pay $ 2,400
Paul Tremblay: pay $ 0
Marie Valois: pay $ 1,200
Your program must use the read CSV function seen in class. Note that the program should start with a comment that gives your name, followed by the following definitions for the readFile and writeFile functions, needed in the node.js environment:

var fs = require (“fs”);
var assert = require (“assert”);

var readFile = function (path) {
return fs.readFileSync (path) .toString ();
};
var writeFile = function (path, text) {
fs.writeFileSync (path, text);
};
Write a testCheques unit test function that tests your functions. As usual, in addition to doing the requested processing correctly, your code must be correctly indented, it must contain explanatory comments and significant identifiers.

I suggest you use emacs to develop your code.

May 15th, 2020

Graduate, Not set

Comments Off

Handheld Solitaire

Handheld Solitaire requires no table, has simple rules, and is easily learned and played. It is played with a traditional 52 card deck of 4 suits (hearts, clubs, diamonds, and spades) and 13 ranks from ace (1) to king (13). Jokers are not included. The deck (face down) is held in one hand, while the actual hand of cards to be played is placed face up on top of the deck. This leaves the other hand free for dealing and discarding. The rules of play are as follows:
    Shuffle the deck, then hold it face-down in one hand.
    While the deck is not empty:
    Deal a single card from the top of the deck into the top of the playing hand
    While a match occurs in the playing hand between the top card and the card 3 back from it, either in rank or suit, collapse the hand using the following rules:
    If the ranks match, all 4 top cards of the hand are discarded. For example, if the cards are: 2S 6S 9C 2H , we would be comparing the last card dealt, 2S, to the card which is three back from it, 2H. Because the values match, we would discard all four cards.
    If the suits match, only the middle 2 (of the top 4) cards of the hand are discarded. For example, if the cards are: JH 3S 5C 7H , we would be comparing the last card dealt, JH, to the card which is three back from it, 7H. Because the suits match, we would discard the middle to cared (3S and 3C) and be left with JH 7H .
    The final score is the number of cards left in the hand at the end of the game.
There are several requirements in designing this project.
    A single card should be represented by a Card class. A card should be represented by a value (int) and a suit (char), and must include a pointer to a Card named nextCard as one of the private data members. Implement appropriate getter and setter functions and two constructors (one for default values and one with explicit parameters). It should also have a print() function described by the following bullet. Use Card.h and Card.cpp files to develop the class.
o    The print function should print the value and suit of the card in two characters. Thus, print the numerical value. However, if the value is 1, print A (for [A]ce); if it is 10, print T (for [T]en); if it is 11, print J (for [J]ack); if it is 12, print Q (for [Q]ueen); if it is 13, print K (for [K]ing). Follow this by the character representing the suit ([S]pades, [C]lubs, [H]earts, [D]iamonds), The following give some examples of a card, followed by how it should be printed:
    Ace of Hearts would be printed as: AH
    10 of Diamonds would be printed as: TD
    5 of Clubs would be printed as: 5C
    A deck and a playing hand of cards should each be represented by a CardLL class containing two private data members: a length variable to store the number of items in the CardLL object and a Card pointer named top. This will be a pointer to a linked list of Card objects (Cards will be the nodes of the linked list). Implement the class using CardLL.h and CardLL.cpp files. The functions to implement for this class are as follows.
o    CardLL (default constructor). The function sets the list pointer to be NULL and the length to be zero.
o    ~CardLL (destructor). Deletes each item from the list, one by one.
o    insertAtTop(suit, value). The function inserts a given card at the top of the list.
o    getCardAt(pos). This function will return a Card pointer which points to the card at the given position. If the position doesnt exist in the list, just return NULL.
o    removeCardAt(pos). This function will remove the card at the given position, returning true if successful. If the position outside the bounds of the list, return false.
o    getLength(). Returns the length of the list.
o    isEmpty(). Returns true if the list is empty; false otherwise.
o    print(). Prints the word top: followed by each card in the linked list, all on one line. (Utilize the Card print() function to aid with printing each individual card.
o    shuffle(). This will randomly shuffle a list of cards using the Fisher-Yates shuffle algorithm as follows (implement this function last):
    Use a while loop to walk through each Card in the list. Also within the loop:
    Get a random number between 0 and length 1
    Use getCardAt to get the card at that position
    Swap the card at the walk position with the card at the position random position. Just swap the suit and the value, not the nextCard pointer!
    Notes about random numbers:
    include the cstdlib and ctime files.
    place the following line as the first line of main():
    srand(time(NULL));
    In your CardLL classs shuffle() function, use rand() (with the modulus operator) to generate a random number in the appropriate range. Click here for an example of using rand()or consult page 274-275 of your textbook.
If there are additional class member functions that you would like to implement to ease the programming, you are allowed to do so. However, they should be clearly documented where necessary and should follow a structured object-oriented design approach.
Game play should be simulated in a client file called HHSolitaire.cpp. Follow the directions on the first page for the way the game is played. Represent the Deck and the Hand (playing hand) using a CardLL object for each. Use comments and functions to aid in the readability of your code. One function in particular to implement is populateDeck, which handles creating a new complete deck of 52 playing cards as follows (wrapped onto two lines below):
AD 2D 3D 4D 5D 6D 7D 8D 9D TD JD QD KD AC 2C 3C 4C 5C 6C 7C 8C 9C TC JC QC KC AH 2H 3H 4H 5H 6H 7H 8H 9H TH JH QH KH AS 2S 3S 4S 5S 6S 7S 8S 9S TS JS QS KS
Hint: To create the deck, use a nested for loop (one for the values [1-13] and one for the suits [D, C, H, S]) to generate the suits and values for the cards as you insert them into the deck.
    *Game play in this game, by its very nature, is deterministic. Thus, the entire game play can be printed to the output all at once. To give the program more of a game feel, though, you can use getchar() before each call to Hand.print() in main() to force the user to press the Enter key between each new card being played. Include stdio.h library in order to use this. This part should be saved until the very end of all testing!
Start early. I cannot emphasize this enough. This project will once again challenge your logical and critical thinking skills. Think of the design (structure, flow, logic sequence) of the program before implementing it. Learn from the previous projects. I will briefly reiterate the approach you should take below:
    Write down/draw out, on paper, how the overall design of the program should look. Getting your thoughts down on paper will help you organize/refine your approach and get a better grasp of how the individual components should fit together.
    Implement your program as empty function stubs at first and develop incrementally, testing one piece at a time before moving on. Building your program slowly from the ground up will allow you to foresee and prevent potential problems later on in development.
    Test many different input cases as you are developing your program and even once you feel that the program is complete. A good strategy is to try to break your program with a variety of different test casesit is much better for you to find a software mistake and fix it early than to have the final product fail the end user(s) because you didnt test adequately.
Testing: Test the program in steps. Build the Card and CardLL classes and verify that adding and deleting cards from the list works as you expect. Then start adding in individual elements of game play, incrementally. You will likely get segmentation faults as you develop this program. These are frustrating. However, these are a lot easier to debug if you test your program little by little.
Submission: This project is worth 110 points and is due on Friday, March 27th before noon. Submission must include:
    An electronic turn-in through Canvas. The entire Visual Studio solution folder must be zipped in order to do this. To create a zipped folder, right-click the folder and select Send to -> Compressed (zipped) folder. Rename this folder Project3_firstname_lastname where firstname and lastname are replaced with your first and last name, respectively. Upload this zipped folder to the Project 2 assignment page. Make sure that the following files are included in your project:
    HHSolitaire.cpp
    CardLL.cpp
    CardLL.h
    Card.cpp
    Card.h
    A paper printout of your code, along with console outputs from at least 3 separate program runs.
Grading: The program will be graded along the following dimensions. Note that the values in brackets are percentages of the project grade. Point distributions will be weighted accordingly.
    [20] Card implementation
    [35] CardLL implementation
    [35] HHSolitaire implementation
    [20] Overall quality of program design, code structure/readability, and user interaction
For the final bullet, ensure that the program files contain header comments, formatted as required by the CSCI documentation guidelines. Documentation (commenting) is used to illustrate major sections or unclear sections of code as well. Program design should clearly convey intent, especially focusing on proper use of variable names, whitespace, alignment and indentation

Make sure that the file names are correct, that your program contains no syntax errors, and that all of the code compiles. Programs that do not compile will receive an automatic 20 point deduction (20% of the project grade). This will be in addition to any deductions on the items listed above.

If you are unable to decipher a compiler error in your program, its better to comment out that section of code so that the program compiles without error. This way I can see that it was at least attempted and you may receive partial points for that section of code. In addition to the commented out section, write a detailed explanation of what you think the error may be, and the steps you tried in order to fix the error.

Academic Honesty: I expect you to maintain a high ethical standard when developing your programs. Students are bound by the academic honesty policies of the department, college, and university. Direct collaboration with others on this project is not permitted, and helping generate specific lines or chunks of code is strictly prohibited. General design strategies of the software program may be discussed at a high level.

Output: You may use the following as a guide to what your output should look like.

Top: 8C
Top: 9C 8C
Top: 4H 9C 8C
Top: 2S 4H 9C 8C
Top: TS 2S 4H 9C 8C
Top: 7H TS 2S 4H 9C 8C
Suit Match! Removing: TS 2S

Top: 7H 4H 9C 8C
Top: 7S 7H 4H 9C 8C
Top: KH 7S 7H 4H 9C 8C
Suit Match! Removing: 7S 7H

Top: KH 4H 9C 8C
Top: 9H KH 4H 9C 8C
Number Match! Removing: 9H KH 4H 9C

Top: 8C
Top: 8D 8C
Top: 3C 8D 8C
Top: QD 3C 8D 8C
Top: 4D QD 3C 8D 8C
Suit Match! Removing: QD 3C

Top: 4D 8D 8C
Top: 6C 4D 8D 8C
Suit Match! Removing: 4D 8D

Top: 6C 8C
Top: 2D 6C 8C
Top: AS 2D 6C 8C
Top: 9D AS 2D 6C 8C
Top: JS 9D AS 2D 6C 8C
Top: AD JS 9D AS 2D 6C 8C
Number Match! Removing: AD JS 9D AS

Top: 2D 6C 8C
Top: JC 2D 6C 8C
Suit Match! Removing: 2D 6C
Top: JC 8C
Top: AC JC 8C
Top: 4C AC JC 8C
Suit Match! Removing: AC JC

Top: 4C 8C
Top: TH 4C 8C
Top: 6H TH 4C 8C
Top: 5D 6H TH 4C 8C
Top: JH 5D 6H TH 4C 8C
Suit Match! Removing: 5D 6H

Top: JH TH 4C 8C
Top: 7C JH TH 4C 8C
Suit Match! Removing: JH TH

Top: 7C 4C 8C
Top: 4S 7C 4C 8C
Top: AH 4S 7C 4C 8C
Top: KC AH 4S 7C 4C 8C
Suit Match! Removing: AH 4S

Top: KC 7C 4C 8C
Suit Match! Removing: 7C 4C

Top: KC 8C
Top: 5H KC 8C
Top: 2H 5H KC 8C
Top: QC 2H 5H KC 8C
Suit Match! Removing: 2H 5H

Top: QC KC 8C
Top: TD QC KC 8C
Top: 3S TD QC KC 8C
Top: 5C 3S TD QC KC 8C
Suit Match! Removing: 3S TD

Top: 5C QC KC 8C
Suit Match! Removing: QC KC

Top: 5C 8C
Top: 8H 5C 8C
Top: KS 8H 5C 8C
Top: 2C KS 8H 5C 8C
Suit Match! Removing: KS 8H

Top: 2C 5C 8C
Top: 6D 2C 5C 8C
Top: 3H 6D 2C 5C 8C
Top: KD 3H 6D 2C 5C 8C
Top: 3D KD 3H 6D 2C 5C 8C
Suit Match! Removing: KD 3H

Top: 3D 6D 2C 5C 8C
Top: 7D 3D 6D 2C 5C 8C
Top: JD 7D 3D 6D 2C 5C 8C
Suit Match! Removing: 7D 3D

Top: JD 6D 2C 5C 8C
Top: TC JD 6D 2C 5C 8C
Suit Match! Removing: JD 6D

Top: TC 2C 5C 8C
Suit Match! Removing: 2C 5C

Top: TC 8C
Top: 5S TC 8C
Top: QH 5S TC 8C
Top: 8S QH 5S TC 8C
Top: 9S 8S QH 5S TC 8C
Suit Match! Removing: 8S QH

Top: 9S 5S TC 8C
Top: QS 9S 5S TC 8C
Top: 6S QS 9S 5S TC 8C
Suit Match! Removing: QS 9S

Top: 6S 5S TC 8C

Deck Empty! Printing leftover hand:

Top: 6S 5S TC 8C

May 15th, 2020

Computer science and IT assignments, Graduate

Comments Off

Handheld Solitaire

Handheld Solitaire
Handheld Solitaire requires no table, has simple rules, and is easily learned and played. It is played with a traditional 52 card deck of 4 suits (hearts, clubs, diamonds, and spades) and 13 ranks from ace (1) to king (13). Jokers are not included. The deck (face down) is held in one hand, while the actual hand of cards to be played is placed face up on top of the deck. This leaves the other hand free for dealing and discarding. The rules of play are as follows:
    Shuffle the deck, then hold it face-down in one hand.
    While the deck is not empty:
    Deal a single card from the top of the deck into the top of the playing hand
    While a match occurs in the playing hand between the top card and the card 3 back from it, either in rank or suit, collapse the hand using the following rules:
    If the ranks match, all 4 top cards of the hand are discarded. For example, if the cards are: 2S 6S 9C 2H , we would be comparing the last card dealt, 2S, to the card which is three back from it, 2H. Because the values match, we would discard all four cards.
    If the suits match, only the middle 2 (of the top 4) cards of the hand are discarded. For example, if the cards are: JH 3S 5C 7H , we would be comparing the last card dealt, JH, to the card which is three back from it, 7H. Because the suits match, we would discard the middle to cared (3S and 3C) and be left with JH 7H .
    The final score is the number of cards left in the hand at the end of the game.
There are several requirements in designing this project.
    A single card should be represented by a Card class. A card should be represented by a value (int) and a suit (char), and must include a pointer to a Card named nextCard as one of the private data members. Implement appropriate getter and setter functions and two constructors (one for default values and one with explicit parameters). It should also have a print() function described by the following bullet. Use Card.h and Card.cpp files to develop the class.
o    The print function should print the value and suit of the card in two characters. Thus, print the numerical value. However, if the value is 1, print A (for [A]ce); if it is 10, print T (for [T]en); if it is 11, print J (for [J]ack); if it is 12, print Q (for [Q]ueen); if it is 13, print K (for [K]ing). Follow this by the character representing the suit ([S]pades, [C]lubs, [H]earts, [D]iamonds), The following give some examples of a card, followed by how it should be printed:
    Ace of Hearts would be printed as: AH
    10 of Diamonds would be printed as: TD
    5 of Clubs would be printed as: 5C
    A deck and a playing hand of cards should each be represented by a CardLL class containing two private data members: a length variable to store the number of items in the CardLL object and a Card pointer named top. This will be a pointer to a linked list of Card objects (Cards will be the nodes of the linked list). Implement the class using CardLL.h and CardLL.cpp files. The functions to implement for this class are as follows.
o    CardLL (default constructor). The function sets the list pointer to be NULL and the length to be zero.
o    ~CardLL (destructor). Deletes each item from the list, one by one.
o    insertAtTop(suit, value). The function inserts a given card at the top of the list.
o    getCardAt(pos). This function will return a Card pointer which points to the card at the given position. If the position doesnt exist in the list, just return NULL.
o    removeCardAt(pos). This function will remove the card at the given position, returning true if successful. If the position outside the bounds of the list, return false.
o    getLength(). Returns the length of the list.
o    isEmpty(). Returns true if the list is empty; false otherwise.
o    print(). Prints the word top: followed by each card in the linked list, all on one line. (Utilize the Card print() function to aid with printing each individual card.
o    shuffle(). This will randomly shuffle a list of cards using the Fisher-Yates shuffle algorithm as follows (implement this function last):
    Use a while loop to walk through each Card in the list. Also within the loop:
    Get a random number between 0 and length 1
    Use getCardAt to get the card at that position
    Swap the card at the walk position with the card at the position random position. Just swap the suit and the value, not the nextCard pointer!
    Notes about random numbers:
    include the cstdlib and ctime files.
    place the following line as the first line of main():
    srand(time(NULL));
    In your CardLL classs shuffle() function, use rand() (with the modulus operator) to generate a random number in the appropriate range. Click here for an example of using rand()or consult page 274-275 of your textbook.
If there are additional class member functions that you would like to implement to ease the programming, you are allowed to do so. However, they should be clearly documented where necessary and should follow a structured object-oriented design approach.
Game play should be simulated in a client file called HHSolitaire.cpp. Follow the directions on the first page for the way the game is played. Represent the Deck and the Hand (playing hand) using a CardLL object for each. Use comments and functions to aid in the readability of your code. One function in particular to implement is populateDeck, which handles creating a new complete deck of 52 playing cards as follows (wrapped onto two lines below):
AD 2D 3D 4D 5D 6D 7D 8D 9D TD JD QD KD AC 2C 3C 4C 5C 6C 7C 8C 9C TC JC QC KC AH 2H 3H 4H 5H 6H 7H 8H 9H TH JH QH KH AS 2S 3S 4S 5S 6S 7S 8S 9S TS JS QS KS
Hint: To create the deck, use a nested for loop (one for the values [1-13] and one for the suits [D, C, H, S]) to generate the suits and values for the cards as you insert them into the deck.
    *Game play in this game, by its very nature, is deterministic. Thus, the entire game play can be printed to the output all at once. To give the program more of a game feel, though, you can use getchar() before each call to Hand.print() in main() to force the user to press the Enter key between each new card being played. Include stdio.h library in order to use this. This part should be saved until the very end of all testing!
Start early. I cannot emphasize this enough. This project will once again challenge your logical and critical thinking skills. Think of the design (structure, flow, logic sequence) of the program before implementing it. Learn from the previous projects. I will briefly reiterate the approach you should take below:
    Write down/draw out, on paper, how the overall design of the program should look. Getting your thoughts down on paper will help you organize/refine your approach and get a better grasp of how the individual components should fit together.
    Implement your program as empty function stubs at first and develop incrementally, testing one piece at a time before moving on. Building your program slowly from the ground up will allow you to foresee and prevent potential problems later on in development.
    Test many different input cases as you are developing your program and even once you feel that the program is complete. A good strategy is to try to break your program with a variety of different test casesit is much better for you to find a software mistake and fix it early than to have the final product fail the end user(s) because you didnt test adequately.
Testing: Test the program in steps. Build the Card and CardLL classes and verify that adding and deleting cards from the list works as you expect. Then start adding in individual elements of game play, incrementally. You will likely get segmentation faults as you develop this program. These are frustrating. However, these are a lot easier to debug if you test your program little by little.
Submission: This project is worth 110 points and is due on Friday, March 27th before noon. Submission must include:
    An electronic turn-in through Canvas. The entire Visual Studio solution folder must be zipped in order to do this. To create a zipped folder, right-click the folder and select Send to -> Compressed (zipped) folder. Rename this folder Project3_firstname_lastname where firstname and lastname are replaced with your first and last name, respectively. Upload this zipped folder to the Project 2 assignment page. Make sure that the following files are included in your project:
    HHSolitaire.cpp
    CardLL.cpp
    CardLL.h
    Card.cpp
    Card.h
    A paper printout of your code, along with console outputs from at least 3 separate program runs.
Grading: The program will be graded along the following dimensions. Note that the values in brackets are percentages of the project grade. Point distributions will be weighted accordingly.
    [20] Card implementation
    [35] CardLL implementation
    [35] HHSolitaire implementation
    [20] Overall quality of program design, code structure/readability, and user interaction
For the final bullet, ensure that the program files contain header comments, formatted as required by the CSCI documentation guidelines. Documentation (commenting) is used to illustrate major sections or unclear sections of code as well. Program design should clearly convey intent, especially focusing on proper use of variable names, whitespace, alignment and indentation

Output: You may use the following as a guide to what your output should look like.

Top: 8C
Top: 9C 8C
Top: 4H 9C 8C
Top: 2S 4H 9C 8C
Top: TS 2S 4H 9C 8C
Top: 7H TS 2S 4H 9C 8C
Suit Match! Removing: TS 2S

Top: 7H 4H 9C 8C
Top: 7S 7H 4H 9C 8C
Top: KH 7S 7H 4H 9C 8C
Suit Match! Removing: 7S 7H

Top: KH 4H 9C 8C
Top: 9H KH 4H 9C 8C
Number Match! Removing: 9H KH 4H 9C

Top: 8C
Top: 8D 8C
Top: 3C 8D 8C
Top: QD 3C 8D 8C
Top: 4D QD 3C 8D 8C
Suit Match! Removing: QD 3C

Top: 4D 8D 8C
Top: 6C 4D 8D 8C
Suit Match! Removing: 4D 8D

Top: 6C 8C
Top: 2D 6C 8C
Top: AS 2D 6C 8C
Top: 9D AS 2D 6C 8C
Top: JS 9D AS 2D 6C 8C
Top: AD JS 9D AS 2D 6C 8C
Number Match! Removing: AD JS 9D AS

Top: 2D 6C 8C
Top: JC 2D 6C 8C
Suit Match! Removing: 2D 6C
Top: JC 8C
Top: AC JC 8C
Top: 4C AC JC 8C
Suit Match! Removing: AC JC

Top: 4C 8C
Top: TH 4C 8C
Top: 6H TH 4C 8C
Top: 5D 6H TH 4C 8C
Top: JH 5D 6H TH 4C 8C
Suit Match! Removing: 5D 6H

Top: JH TH 4C 8C
Top: 7C JH TH 4C 8C
Suit Match! Removing: JH TH

Top: 7C 4C 8C
Top: 4S 7C 4C 8C
Top: AH 4S 7C 4C 8C
Top: KC AH 4S 7C 4C 8C
Suit Match! Removing: AH 4S

Top: KC 7C 4C 8C
Suit Match! Removing: 7C 4C

Top: KC 8C
Top: 5H KC 8C
Top: 2H 5H KC 8C
Top: QC 2H 5H KC 8C
Suit Match! Removing: 2H 5H

Top: QC KC 8C
Top: TD QC KC 8C
Top: 3S TD QC KC 8C
Top: 5C 3S TD QC KC 8C
Suit Match! Removing: 3S TD

Top: 5C QC KC 8C
Suit Match! Removing: QC KC

Top: 5C 8C
Top: 8H 5C 8C
Top: KS 8H 5C 8C
Top: 2C KS 8H 5C 8C
Suit Match! Removing: KS 8H

Top: 2C 5C 8C
Top: 6D 2C 5C 8C
Top: 3H 6D 2C 5C 8C
Top: KD 3H 6D 2C 5C 8C
Top: 3D KD 3H 6D 2C 5C 8C
Suit Match! Removing: KD 3H

Top: 3D 6D 2C 5C 8C
Top: 7D 3D 6D 2C 5C 8C
Top: JD 7D 3D 6D 2C 5C 8C
Suit Match! Removing: 7D 3D

Top: JD 6D 2C 5C 8C
Top: TC JD 6D 2C 5C 8C
Suit Match! Removing: JD 6D

Top: TC 2C 5C 8C
Suit Match! Removing: 2C 5C

Top: TC 8C
Top: 5S TC 8C
Top: QH 5S TC 8C
Top: 8S QH 5S TC 8C
Top: 9S 8S QH 5S TC 8C
Suit Match! Removing: 8S QH

Top: 9S 5S TC 8C
Top: QS 9S 5S TC 8C
Top: 6S QS 9S 5S TC 8C
Suit Match! Removing: QS 9S

Top: 6S 5S TC 8C

Deck Empty! Printing leftover hand:

Top: 6S 5S TC 8C

May 15th, 2020

Graduate, Websites, web programming

Comments Off

HTML5/CSS/Bootstrap Assignment

Hello,

I’m trying to teach myself how to code during my down time and have come into a roadblock regarding Bootstrap development. I struggle with the .navbar and creating .jumbotron or box-model. Looking for developer to help inform on how to create final result (attached images below).

May 15th, 2020

Graduate, Websites, web programming

Comments Off

PHP JavaScript – SQL – Social Network Analyser – Modifications

Hello, I need some modifications on some code, the code is a social network analyzer fully functional, for facebook, youtube, twitter and instagram, I need some small rearrangements on the APIs and also 4 new directory pages, at the moment I just have Instagram directory, also I need to add some new features to the APIs like show country, and audiences from YouTube.
The social profile tracking script is an already existing script on CodeCanyon – “phpAnalyzer”.
– Create plugin TikTok (like https://cloutmeter.com/)
– Create Directory for Tiktok
– Create Directory for Youtube
– Create Directory for Facebook
– Create Directory for Twitter

Add features: (when possible by the APIs)
– Add audience analysis (gender ,age, location)
o General
o By Publication
– Add Category
– Add Country (location of the account)

Add non API Editable Fields to accounts:
– Manual Country (ability to add more than one Country)
– Manual Category (ability to add more than one Category)
– Average Cost
– Email
Make all the fields searchable on the directories

Title page	--- FREE
Bibliography	--- FREE
Formatting	--- FREE
Proofreading	--- FREE
Turnitin report	--- FREE
Revisions	--- FREE

WE GUARANTEE

YOU WILL GET

Unmatched Quality

Category: Graduate

Optimization

Lab4

MATLAB Biomedical Signal Analysis Project

IMPLEMENTATION OF THE BLOCKCHAIN TECHNOLOGY AMONG THE SUPPLY CHAIN ECOSYSTEM IN THE FOOD INDUSTRY.

vehicle dynamics- modeling with matlab simulink

Javascript

Handheld Solitaire

Handheld Solitaire

HTML5/CSS/Bootstrap Assignment

PHP JavaScript – SQL – Social Network Analyser – Modifications

Price includes

WE COVER

We Accept