import java.util.;import acm.program.;public class FlightPla.pdf

•

0 likes•2 views

import java.util.*; import acm.program.*; public class FlightPlanner extends ConsoleProgram { /* Private instance variables */ private FlightDB flights; //creates a new database private ArrayList enteredCities = new ArrayList(); //keeps track of entered cities private String firstCity; //keeps track of the first city entered by the user public void init() { //passes the text file to the database to read and parse flights = new FlightDB(\"flights.txt\"); } public void run() { welcome(); askForFistCity(); askForMoreCities(); printFinalRoute(); } /* Welcomes the user */ private void welcome() { println(\"Welcome to Flight Planner\"); println(\"Here is a list of all the cities in our database\"); Iterator it = flights.getCities(); while(it.hasNext()) { println(\" \" + it.next()); } println(\"Let\'s plan a round-trip route!\"); } /* asks the user for the starting city and prints out * all the possible destination cities for that city */ private void askForFistCity() { while(true) { firstCity = readLine(\"Enter the starting city: \"); if(flights.ContainsKey(firstCity)) { enteredCities.add(firstCity); break; } else{ println(\"You can\'t get to that city by a direct flight.\"); println(\"Here is a list of all the cities in our database\"); Iterator it = flights.getCities(); while(it.hasNext()) { println(\" \" + it.next()); } } } println(\"From \" + firstCity + \" you can fly directly to:\"); Iterator it = flights.findRoute(firstCity); while(it.hasNext()) { println(\" \" + it.next()); } } /* asks the user for the cities he/she wants to fly to, * and prints out possible destination cities for each city * until the user enters the starting city */ private void askForMoreCities() { String city = firstCity; String lastCity = city; while(true) { city = readLine(\"Where do you want to go from \" + city + \"? \"); if(city.equals(firstCity)) { break; } if(flights.ContainsKey(city) == true) { lastCity = city; enteredCities.add(city); } else{ city = lastCity; println(\"You can\'t get to that city by a direct flight.\"); } println(\"From \" + city + \" you can fly directly to:\"); Iterator it = flights.findRoute(city); while(it.hasNext()) { println(\" \" + it.next()); } } } /* prints out the chosen route */ private void printFinalRoute() { println(\"The route you\'ve chosen is\"); String route = enteredCities.get(0); for(int i = 1; i \" + enteredCities.get(i); } route += \" -> \" + enteredCities.get(0); println(route); } } import acm.program.*; public class FlightPlanner extends ConsoleProgram { /* Private instance variables */ private FlightDB flights; //creates a new database private ArrayList enteredCities = new ArrayList(); //keeps track of entered cities private String firstCity; //keeps track of the first city entered by the user public void init() { //passes the text file to the database to read and parse flights = new FlightDB(\"flights.txt\"); } public void run() { welcome(); askForFistCity(); askForMoreCities(); printFinalRoute(); } /* Welcomes the use.

Education

while(true) {
firstCity = readLine("Enter the starting city: ");
if(flights.ContainsKey(firstCity)) {
enteredCities.add(firstCity);
break;
}
else{
println("You can't get to that city by a direct flight.");
println("Here is a list of all the cities in our database");
Iterator it = flights.getCities();
while(it.hasNext()) {
println(" " + it.next());
}
}
}
println("From " + firstCity + " you can fly directly to:");
Iterator it = flights.findRoute(firstCity);
while(it.hasNext()) {
println(" " + it.next());
}
}
/* asks the user for the cities he/she wants to fly to,
* and prints out possible destination cities for each city
* until the user enters the starting city */
private void askForMoreCities() {
String city = firstCity;
String lastCity = city;
while(true) {
city = readLine("Where do you want to go from " + city + "? ");
if(city.equals(firstCity)) {
break;
}
if(flights.ContainsKey(city) == true) {
lastCity = city;
enteredCities.add(city);

}
else{
city = lastCity;
println("You can't get to that city by a direct flight.");
}
println("From " + city + " you can fly directly to:");
Iterator it = flights.findRoute(city);
while(it.hasNext()) {
println(" " + it.next());
}
}
}
/* prints out the chosen route */
private void printFinalRoute() {
println("The route you've chosen is");
String route = enteredCities.get(0);
for(int i = 1; i " + enteredCities.get(i);
}
route += " -> " + enteredCities.get(0);
println(route);
}
}
import acm.program.*;
public class FlightPlanner extends ConsoleProgram {
/* Private instance variables */
private FlightDB flights; //creates a new database
private ArrayList enteredCities = new ArrayList(); //keeps track of entered cities
private String firstCity; //keeps track of the first city entered by the user
public void init() {
//passes the text file to the database to read and parse
flights = new FlightDB("flights.txt");

}
public void run() {
welcome();
askForFistCity();
askForMoreCities();
printFinalRoute();
}
/* Welcomes the user */
private void welcome() {
println("Welcome to Flight Planner");
println("Here is a list of all the cities in our database");
Iterator it = flights.getCities();
while(it.hasNext()) {
println(" " + it.next());
}
println("Let's plan a round-trip route!");
}
/* asks the user for the starting city and prints out
* all the possible destination cities for that city */
private void askForFistCity() {
while(true) {
firstCity = readLine("Enter the starting city: ");
if(flights.ContainsKey(firstCity)) {
enteredCities.add(firstCity);
break;
}
else{
println("You can't get to that city by a direct flight.");
println("Here is a list of all the cities in our
database");
Iterator it = flights.getCities();
while(it.hasNext()) {
println(" " + it.next());

}
}
}
println("From " + firstCity + " you can fly directly to:");
Iterator it = flights.findRoute(firstCity);
while(it.hasNext()) {
println(" " + it.next());
}
}
/* asks the user for the cities he/she wants to fly to,
* and prints out possible destination cities for each city
* until the user enters the starting city */
private void askForMoreCities() {
String city = firstCity;
String lastCity = city;
while(true) {
city = readLine("Where do you want to go from " + city + "?
");
if(city.equals(firstCity)) {
break;
}
if(flights.ContainsKey(city) == true) {
lastCity = city;
enteredCities.add(city);
}
else{
city = lastCity;
println("You can't get to that city by a direct flight.");
}
println("From " + city + " you can fly directly to:");
Iterator it = flights.findRoute(city);
while(it.hasNext()) {
println(" " + it.next());
}

}
}
/* prints out the chosen route */
private void printFinalRoute() {
println("The route you've chosen is");
String route = enteredCities.get(0);
for(int i = 1; i " + enteredCities.get(i);
}
route += " -> " + enteredCities.get(0);
println(route);
}
}
Solution
import java.util.*;
import acm.program.*;
public class FlightPlanner extends ConsoleProgram {
/* Private instance variables */
private FlightDB flights; //creates a new database
private ArrayList enteredCities = new ArrayList(); //keeps track of entered cities
private String firstCity; //keeps track of the first city entered by the user
public void init() {
//passes the text file to the database to read and parse
flights = new FlightDB("flights.txt");
}
public void run() {
welcome();
askForFistCity();
askForMoreCities();
printFinalRoute();

}
/* Welcomes the user */
private void welcome() {
println("Welcome to Flight Planner");
println("Here is a list of all the cities in our database");
Iterator it = flights.getCities();
while(it.hasNext()) {
println(" " + it.next());
}
println("Let's plan a round-trip route!");
}
/* asks the user for the starting city and prints out
* all the possible destination cities for that city */
private void askForFistCity() {
while(true) {
firstCity = readLine("Enter the starting city: ");
if(flights.ContainsKey(firstCity)) {
enteredCities.add(firstCity);
break;
}
else{
println("You can't get to that city by a direct flight.");
println("Here is a list of all the cities in our database");
Iterator it = flights.getCities();
while(it.hasNext()) {
println(" " + it.next());
}
}
}
println("From " + firstCity + " you can fly directly to:");
Iterator it = flights.findRoute(firstCity);
while(it.hasNext()) {
println(" " + it.next());
}

}
/* asks the user for the cities he/she wants to fly to,
* and prints out possible destination cities for each city
* until the user enters the starting city */
private void askForMoreCities() {
String city = firstCity;
String lastCity = city;
while(true) {
city = readLine("Where do you want to go from " + city + "? ");
if(city.equals(firstCity)) {
break;
}
if(flights.ContainsKey(city) == true) {
lastCity = city;
enteredCities.add(city);
}
else{
city = lastCity;
println("You can't get to that city by a direct flight.");
}
println("From " + city + " you can fly directly to:");
Iterator it = flights.findRoute(city);
while(it.hasNext()) {
println(" " + it.next());
}
}
}
/* prints out the chosen route */
private void printFinalRoute() {
println("The route you've chosen is");
String route = enteredCities.get(0);
for(int i = 1; i " + enteredCities.get(i);
}

route += " -> " + enteredCities.get(0);
println(route);
}
}
import acm.program.*;
public class FlightPlanner extends ConsoleProgram {
/* Private instance variables */
private FlightDB flights; //creates a new database
private ArrayList enteredCities = new ArrayList(); //keeps track of entered cities
private String firstCity; //keeps track of the first city entered by the user
public void init() {
//passes the text file to the database to read and parse
flights = new FlightDB("flights.txt");
}
public void run() {
welcome();
askForFistCity();
askForMoreCities();
printFinalRoute();
}
/* Welcomes the user */
private void welcome() {
println("Welcome to Flight Planner");
println("Here is a list of all the cities in our database");
Iterator it = flights.getCities();
while(it.hasNext()) {
println(" " + it.next());
}
println("Let's plan a round-trip route!");
}

/* asks the user for the starting city and prints out
* all the possible destination cities for that city */
private void askForFistCity() {
while(true) {
firstCity = readLine("Enter the starting city: ");
if(flights.ContainsKey(firstCity)) {
enteredCities.add(firstCity);
break;
}
else{
println("You can't get to that city by a direct flight.");
println("Here is a list of all the cities in our
database");
Iterator it = flights.getCities();
while(it.hasNext()) {
println(" " + it.next());
}
}
}
println("From " + firstCity + " you can fly directly to:");
Iterator it = flights.findRoute(firstCity);
while(it.hasNext()) {
println(" " + it.next());
}
}
/* asks the user for the cities he/she wants to fly to,
* and prints out possible destination cities for each city
* until the user enters the starting city */
private void askForMoreCities() {
String city = firstCity;
String lastCity = city;
while(true) {
city = readLine("Where do you want to go from " + city + "?
");
if(city.equals(firstCity)) {

break;
}
if(flights.ContainsKey(city) == true) {
lastCity = city;
enteredCities.add(city);
}
else{
city = lastCity;
println("You can't get to that city by a direct flight.");
}
println("From " + city + " you can fly directly to:");
Iterator it = flights.findRoute(city);
while(it.hasNext()) {
println(" " + it.next());
}
}
}
/* prints out the chosen route */
private void printFinalRoute() {
println("The route you've chosen is");
String route = enteredCities.get(0);
for(int i = 1; i " + enteredCities.get(i);
}
route += " -> " + enteredCities.get(0);
println(route);
}
}

Similar to import java.util.;import acm.program.;public class FlightPla.pdf

i have a runable code below that works with just guessing where the ships are. i need help editing this code to be able to have a player play against computer and taking turns playing battleship. BattleShipGame.java package battleship; import java.util.ArrayList; import java.util.Scanner; public class BattleshipGame { private Ocean ocean; private boolean[][] availableSpot; private Scanner sc; public BattleshipGame() { // define a new ocean and a new 2D array to store available coordinates ocean = new Ocean(); availableSpot = new boolean[10][10]; for (int i = 0; i < 10; i++) { for (int j = 0; j < 10; j++){ availableSpot[i][j] = true; } } } /** * prints the game menu and info * //param select */ public void print(int select){ String info; switch (select) { case 1: info = \"Welcome to the World of Battleship!\"; break; case 2: info = \"Enter coordinates to fire: \"; break; case 3: info = \"Shots fired: \"+ocean.getShotsFired()+\", Ships sunk: \"+ocean.getShipsSunk(); break; case 4: info = \"Congratulations! You win!\"; break; case 99: info = \"Invalid input. Please re-enter:\"; break; case 100: info = \"--------------------------------------------\"; break; case 101: info = \"\ ============================================\"; break; default: info = \"Error selection\"; break; } System.out.println(info); } /** * check if the input is valid * //param input * //return boolean */ public boolean checkValidInput(String input){ ArrayList numList = new ArrayList(); for (int i=0;i<10;i++){ numList.add(\"\"+i); } String[] coordinates = input.split(\" \"); //returns false if there are not 2 strings if (coordinates.length!=2){ return false; } //returns false if any of the strings is not a single digit number for (String str: coordinates){ if (numList.contains(str)==false){ return false; } } //returns false if the coordinates have already been shot at int row = Integer.parseInt(coordinates[0]); int column = Integer.parseInt(coordinates[1]); if (this.availableSpot[row][column]==false){ return false; } return true; } /** * get the coordinates to shoot at from the String input * //param input * //return int[] coordinates */ public int[] getCoordinates(String input){ int[] coordinates = new int[2]; String[] strList = input.split(\" \"); int row = Integer.parseInt(strList[0]); int column = Integer.parseInt(strList[1]); coordinates[0] = row; coordinates[1] = column; return coordinates; } /** * play the battleship game */ public void play(){ print(101); print(1); ocean.placeAllShipsRandomly(); boolean isGameOver = ocean.isGameOver(); sc = new Scanner(System.in); //print the ocean and start the game ocean.print(); print(3); while (!isGameOver){ print(2); String input = sc.nextLine(); //check if input is valid while (!checkValidInput(input)){ print(99); input = sc.nextLine(); } //get coordinates and fire int[] coordinates = getCoordinates(input); int row = coordinates[0]; int column = coordinates[1]; ocean.shootAt(row, column); availableSpot[row][column] = false; isGa.

i have a runable code below that works with just guessing where the .pdf

armcomputers

Can you please debug this? Thank you in advance! This program is supposed to use stacks and find the paths of an airplane. It should tell you whether or not the plane goes from the requested city to the requested destination. requestFile.txt contains the requests, flightFile.txt contains the flights and cityFile.txt contains the city\'s that the airline serves. My errors: my output is simply \"Hpair does not serve Los Angeles.\" Thats it and it stops. It should look something like (these are not real values of the file just an example): \"Request is to fly from cityA to CityB. Hpair flight from cityA to CityB. Request is to fly from cityC to cityD. Sorry, HPAir does not serve City D Request is to fly from cityE to CityF Sorry, HPAir does not fly from cityE to CityF\" **It said to use ispath.cpp but I got confused on how to implement it completely.\" isPath.cpp //***I did not include ispath.cpp in my program. Parts of it are in the map.h portion. main.cpp #include #include #include \"Map.h\" using namespace std; int main() { Map aMap; aMap.readFlights(); aMap.verifyRequestedFile(); } StackInterface.h #ifndef StackInterface_h #define StackInterface_h template class StackInterface { /** Checks if the stack is empty. @return True if the stack is empty or false if the stack is not.*/ virtual bool isEmpty() const = 0; /** Adds a new item to the stack @post newEntry is at the top of the stack @param newEntry is the object to be added to the stack @return True if successfully added, otherwise false. */ virtual bool push(const ItemType& newEntry) = 0; /** Removes item from stack @post The top item in the stack is removed @return True if the item was removed, false if it was not. */ virtual bool pop() = 0; /** Returns the top item in the stack @pre The stack is not empty @post The top item in the stack is returned @return The top of the stack */ virtual ItemType peek() const = 0; }; #endif /* StackInterface_h */ Node.h #ifndef node_h #define node_h template class Node { public: Node(); Node (const ItemType &anItem); Node(const ItemType &anItem, Node * nextNodePtr); void setItem(const ItemType &anItem); void setNext(Node * nextNodePtr); ItemType getItem() const; Node* getNext() const; private: ItemType item; Node* next; }; template Node::Node():next(nullptr){} template Node::Node(const ItemType &anItem):item(anItem), next(nullptr){} template Node::Node(const ItemType &anItem, Node * nextNodePtr):item(anItem), next(nextNodePtr) { } template void Node::setItem(const ItemType &anItem){ item = anItem; } template void Node::setNext(Node * nextNodePtr) { next = nextNodePtr; } template ItemType Node::getItem() const { return item; } template Node* Node::getNext()const{ return next; } #endif /* node_h */ LinkedStack.h #include #ifndef LinkedStack_h #define LinkedStack_h #include \"Node.h\" #include \"StackInterface.h\" template class LinkedStack:public StackInterface{ public: LinkedStack(); LinkedStack(const LinkedStack &aStack); //space matter?*********** virt.

Can you please debug this Thank you in advance! This program is sup.pdf

FashionBoutiquedelhi

The following code, is a one player battleship game in JAVA. Im trying to Enhance the game to be a two player game (were a player plays aggainst a computer opponent). With TWO boards displayed side by side. The player and the computer must take turns selecting the coordinates on their own boards. (the ships cannot be placed adjacent to each other). BattleShipGame.java package battleship; import java.util.ArrayList; import java.util.Scanner; public class BattleshipGame { private Ocean ocean; private boolean[][] availableSpot; private Scanner sc; public BattleshipGame() { // define a new ocean and a new 2D array to store available coordinates ocean = new Ocean(); availableSpot = new boolean[10][10]; for (int i = 0; i < 10; i++) { for (int j = 0; j < 10; j++){ availableSpot[i][j] = true; } } } /** * prints the game menu and info * //param select */ public void print(int select){ String info; switch (select) { case 1: info = \"Welcome to the World of Battleship!\"; break; case 2: info = \"Enter coordinates to fire: \"; break; case 3: info = \"Shots fired: \"+ocean.getShotsFired()+\", Ships sunk: \"+ocean.getShipsSunk(); break; case 4: info = \"Congratulations! You win!\"; break; case 99: info = \"Invalid input. Please re-enter:\"; break; case 100: info = \"--------------------------------------------\"; break; case 101: info = \"\ ============================================\"; break; default: info = \"Error selection\"; break; } System.out.println(info); } /** * check if the input is valid * //param input * //return boolean */ public boolean checkValidInput(String input){ ArrayList numList = new ArrayList(); for (int i=0;i<10;i++){ numList.add(\"\"+i); } String[] coordinates = input.split(\" \"); //returns false if there are not 2 strings if (coordinates.length!=2){ return false; } //returns false if any of the strings is not a single digit number for (String str: coordinates){ if (numList.contains(str)==false){ return false; } } //returns false if the coordinates have already been shot at int row = Integer.parseInt(coordinates[0]); int column = Integer.parseInt(coordinates[1]); if (this.availableSpot[row][column]==false){ return false; } return true; } /** * get the coordinates to shoot at from the String input * //param input * //return int[] coordinates */ public int[] getCoordinates(String input){ int[] coordinates = new int[2]; String[] strList = input.split(\" \"); int row = Integer.parseInt(strList[0]); int column = Integer.parseInt(strList[1]); coordinates[0] = row; coordinates[1] = column; return coordinates; } /** * play the battleship game */ public void play(){ print(101); print(1); ocean.placeAllShipsRandomly(); boolean isGameOver = ocean.isGameOver(); sc = new Scanner(System.in); //print the ocean and start the game ocean.print(); print(3); while (!isGameOver){ print(2); String input = sc.nextLine(); //check if input is valid while (!checkValidInput(input)){ print(99); input = sc.nextLine(); } //get coordinates and fire int[] coord.

The following code, is a one player battleship game in JAVA. Im tryi.pdf

fonecomp

Implementation of c string functions

mohamed sikander

Getting the following errors: Error 1 error C2436: \'{ctor}\' : member function or nested class in constructor initializer list on line 565 Error 2 error C2436: \'{ctor}\' : member function or nested class in constructor initializer list on line 761 I need this code to COMPILE and RUN, but I cannot get rid of this error. Please Help!! #include #include #include #include using namespace std; enum contactGroupType {// used in extPersonType FAMILY, FRIEND, BUSINESS, UNFILLED }; class addressType { private: string st_address; string city; string state; int zip; public: void print(string, string, string, int)const; void setStreet(string); string getStreet()const; void setCity(string); string getCity()const; void setState(string); string getState()const; void setZip(int); int getZip()const; void set(string, string, string, int);// set all address fields string get()const;// get address as one concatenated string addressType(); // ~addressType(); }; class personType { private: string firstName; string lastName; public: void print()const; void setName(string first, string last); string getFirstName()const; string getLastName()const; string get()const;// return First Last names concatenated personType & operator=(const personType &); personType(string, string); personType(); }; class dateType { private: int dMonth; int dDay; int dYear; public: void setDate(int month, int day, int year); int getDay()const; int getMonth()const; int getYear()const; void print()const; string get()const;// return string representation as DD/MM/YYYY dateType & operator=(const dateType & d); dateType(int, int, int); dateType(); }; class extPersonType :public personType { private: addressType address;// added members dateType birthday; contactGroupType group; string phone; public: // methods void setPhone(string); string getPhone()const; void setGroup(contactGroupType); contactGroupType getGroup()const; void setBirthday(int, int, int); dateType getBirthday()const; void print(); string get()const;// return string representation of ext person type extPersonType & operator=(const extPersonType & p); string groupToString(contactGroupType)const; contactGroupType stringToGroup(string)const; // constructors extPersonType(); extPersonType(string first, string last); }; // because we have no arrayListType, we are using our own // implementation with a small subset of functions class arrayListType { extPersonType array[500]; int size; public: arrayListType(); extPersonType & operator[](int i); void removeLast();// remove last element void add(const extPersonType &);// add new element int getSize()const;// get array size }; class addressBookType :public arrayListType { private: static const char FS = \'\\t\';// field separator in file (TAB char) int current;// current position string fileName;// filename fstream fileStream;// file as fstream /* filiters */ contactGroupType fltGroup; string fltFromLast, fltToLast; dateType fltFromDate, fltTiDate; /* flags for effective filters */ bool fl.

Getting the following errorsError 1 error C2436 {ctor} mem.pdf

herminaherman

package reservation; import java.util.*; //For Scanner Class import java.time.*; //For LocalDate import java.time.format.*; //For DateTimeFormatter public class Reservation { double perNight = 105.00, finalAmt; long noDays; int m, d, y; LocalDate std, end; //Sets the Arrival date inputed by the user void setArrivalDate(LocalDate arrivalDate) { std = arrivalDate; } //Sets the Departure date inputed by the user void setDepartureDate(LocalDate departureDate) { end = departureDate; } //Returns the Arrival date LocalDate getArrivalDate() { return std; } //Returns the Departure date LocalDate getDepartureDate() { return end; } //Formats the Arrival date as per the requirement given question String getArrivalDateFormatted() { String stdFormat; stdFormat = \"Arrival Date: \" + std.getMonth() + \" \" + String.valueOf(std.getDayOfMonth()) + \", \" + String.valueOf(std.getYear()); return stdFormat; } //Formats the Departure date as per the requirement given question String getDepartureDateFormatted() { String stdFormat; stdFormat = \"Departure Date: \" + end.getMonth() + \" \" + String.valueOf(end.getDayOfMonth()) + \", \" + String.valueOf(end.getYear()); return stdFormat; } //Returns the Price per night as per the format String getPricePerNightFormatted() { String pr = \"Price: $\" + String.valueOf(perNight) + \" per night\"; return pr; } //Returns the number of nights long getNumberOfNights() { //toEpochDay() returns number of days noDays = end.toEpochDay() - std.toEpochDay(); return noDays; } //Calculates final Amount to be paid double getTotalPrice() { finalAmt = (double)getNumberOfNights() * perNight; return finalAmt; } //Returns the Total amount to be paid as per the format given in the question String getTotalPriceFormatted() { String finA = \"Total price: $\" + String.valueOf(getTotalPrice()) + \" for \" + String.valueOf(getNumberOfNights()) + \" night\" ; return finA; } //Accepts the Arrival date and Departure date from console void accept() { //Creates object of LocaleDate LocalDate std1, end1; //Creates the Date Time Formater object and applies Format Style //SHORT in mm/dd/yy format DateTimeFormatter fmt = DateTimeFormatter.ofLocalizedDate(FormatStyle.SHORT); //Creates Scanner class object to accept data from console Scanner s = new Scanner(System.in); System.out.println(\"Enter starting date mm/dd/yyyy: \"); System.out.println(\"Enter the arrival month (1-12):\"); m = s.nextInt(); //Accept data in integer format System.out.println(\"Enter the arrival day (1-31):\") ; d = s.nextInt(); System.out.println(\"Enter the arrival year:\") ; y = s.nextInt(); //Initializes the LocalDate object for Arrival date std1 = LocalDate.of(y, m, d); //Sets the SHORT date format fmt.format(std1); //Assigns Arrival date to class data member setArrivalDate(std1); System.out.println(\"Enter ending date mm/dd/yyyy: \"); System.out.println(\"Enter the departure month (1-12):\"); m = s.nextInt(); //Accept data in integer format System.out.println(\"Enter the departur.

package reservation; import java.util.; For Scanner Class .pdf

anitasahani11

There are a number of errors in the following program. All errors are located in main() and structure definitions. Function declarations and definitions are correct! Locate all errors, fix them (as shown below), run the program and save its output as a comment at the end of the source file. Example: int num = 10; int *ptr; num = &ptr; // <== Error: Comment the line and write the correct line below // Write a short justification where appropriate // num = &ptr; // Error #1 ptr = &num; Name: */ #include <stdio.h> #include <string.h> #include <stdlib.h> #include <time.h> #define DUMMY_TRAILER '\177' // octal ASCII code of the // last character in the ASCII table #define NUM_CITIES 10 typedef struct { char name[12]; int temperature[5]; } CITY; // Stack and Queue Node typedef struct node NODE; struct node { CITY city; node *next; }; // Doubly Linked List Node typedef struct d_node D_NODE; struct d_node { CITY city; NODE *forw; NODE *back; }; // Stack Functions NODE *push(NODE *stack, const CITY *pStu); NODE *pop(NODE **stack); // Queue Functions void enqueue(NODE **queue, NODE **rear, const CITY *pStu); NODE *dequeue(NODE **queue, NODE **rear); // Doubly Linked List Functions D_NODE *init_list(void); int insert(D_NODE *list, const CITY *pStu); void traverse_forw(D_NODE *list); void traverse_back(D_NODE *list); // Other Functions void printCity(const CITY *pCity); int main (void) { CITY cList[NUM_CITIES] = { {"Cupertino", {88, 89, 87, 85, 89}}, {"Flagstaff", {81, 80, 88, 89, 89}}, {"Los Angeles", {87, 88, 89, 89, 90}}, {"Philadelphia", {96, 99, 99, 90, 95}}, {"Phoenix", {106, 109, 109, 100, 105}}, {"Portland", {89, 90, 85, 89, 90}}, {"Reno", {108, 105, 109, 100, 108}}, {"Salem", {85, 90, 85, 89, 90}}, {"Tucson", {107, 100, 109, 100, 108}}, {"Yreka", {101, 109, 100, 108, 109}} }; NODE *stack = NULL; NODE *top = NULL; NODE *queue = NULL, *rear = NULL; NODE *front; D_NODE *list; list = init_list(); // build stack and queue with data from an array of CITY structures srand((unsigned int)time(NULL)); int count = rand() % 10; for ( int n = 0; n < count; n++) { int i = rand() % NUM_CITIES; int duplicate = insert(list, &cList[i]); if(duplicate) { // already in the list! push(stack, &cList[i]); enqueue(&queue, &rear, cList[i]); } } // display list printf("\nLIST contents (forwards):\n"); traverse_forw(list); printf("\nLIST contents (backwards):\n"); traverse_back(list); // display stack if (top) { printf("\nSTACK contents from top to bottom:\n"); while ((top = pop(stack))) { printCity(top->city); } } else printf ("Empty Stack!\n"); // display queue if (front) { printf("\nQUEUE contents from front to rear:\n"); while ((front = dequeue( queue, rear))) { printCity(front->city); } } else printf ("Empty Queue!\n"); return 0; } /*************************************************** Displays the fileds of a CIS_CLASS structure Pre pCls - a pointer to a CIS_CLASS structure Post */ void printCity(const CITY *pCity) { printf("%-20s %3d\n", pCity->name, pCity->temperatur.

There are a number of errors in the following program- All errors are.docx

clarkjanyce

i have a code that runs, but it only lets the player to guess where the ships are(which is a one player game with one board). is there a way some one can help turn this game into a player vs computer game (with two boards one for player and one for computer) Please help me. BattleShipGame.java package battleship; import java.util.ArrayList; import java.util.Scanner; public class BattleshipGame { private Ocean ocean; private boolean[][] availableSpot; private Scanner sc; public BattleshipGame() { // define a new ocean and a new 2D array to store available coordinates ocean = new Ocean(); availableSpot = new boolean[10][10]; for (int i = 0; i < 10; i++) { for (int j = 0; j < 10; j++){ availableSpot[i][j] = true; } } } /** * prints the game menu and info * //param select */ public void print(int select){ String info; switch (select) { case 1: info = \"Welcome to the World of Battleship!\"; break; case 2: info = \"Enter coordinates to fire: \"; break; case 3: info = \"Shots fired: \"+ocean.getShotsFired()+\", Ships sunk: \"+ocean.getShipsSunk(); break; case 4: info = \"Congratulations! You win!\"; break; case 99: info = \"Invalid input. Please re-enter:\"; break; case 100: info = \"--------------------------------------------\"; break; case 101: info = \"\ ============================================\"; break; default: info = \"Error selection\"; break; } System.out.println(info); } /** * check if the input is valid * //param input * //return boolean */ public boolean checkValidInput(String input){ ArrayList numList = new ArrayList(); for (int i=0;i<10;i++){ numList.add(\"\"+i); } String[] coordinates = input.split(\" \"); //returns false if there are not 2 strings if (coordinates.length!=2){ return false; } //returns false if any of the strings is not a single digit number for (String str: coordinates){ if (numList.contains(str)==false){ return false; } } //returns false if the coordinates have already been shot at int row = Integer.parseInt(coordinates[0]); int column = Integer.parseInt(coordinates[1]); if (this.availableSpot[row][column]==false){ return false; } return true; } /** * get the coordinates to shoot at from the String input * //param input * //return int[] coordinates */ public int[] getCoordinates(String input){ int[] coordinates = new int[2]; String[] strList = input.split(\" \"); int row = Integer.parseInt(strList[0]); int column = Integer.parseInt(strList[1]); coordinates[0] = row; coordinates[1] = column; return coordinates; } /** * play the battleship game */ public void play(){ print(101); print(1); ocean.placeAllShipsRandomly(); boolean isGameOver = ocean.isGameOver(); sc = new Scanner(System.in); //print the ocean and start the game ocean.print(); print(3); while (!isGameOver){ print(2); String input = sc.nextLine(); //check if input is valid while (!checkValidInput(input)){ print(99); input = sc.nextLine(); } //get coordinates and fire int[] coordinates = getCoordinates(input); int row = coordinates[0]; int column = coord.

i have a code that runs, but it only lets the player to guess where .pdf

poblettesedanoree498

/* Task 2: Debugging a program with stacks, queues, and doubly-linked lists There are a number of errors in the following program. All errors are located in main() and structure definitions. Function declarations and definitions are correct! Locate all errors, fix them (as shown below), run the program and save its output as a comment at the end of the source file. Example: int num = 10; int *ptr; num = &ptr; // <== Error: Comment the line and write the correct line below // Write a short justification where appropriate // num = &ptr; // Error #1 ptr = # Name: */ #include #include #include #include #define DUMMY_TRAILER '\177' // octal ASCII code of the // last character in the ASCII table #define NUM_CITIES 10 typedef struct { char name[12]; int temperature[5]; } CITY; // Stack and Queue Node typedef struct node NODE; struct node { CITY city; node *next; }; // Doubly Linked List Node typedef struct d_node D_NODE; struct d_node { CITY city; NODE *forw; NODE *back; }; // Stack Functions NODE *push(NODE *stack, const CITY *pStu); NODE *pop(NODE **stack); // Queue Functions void enqueue(NODE **queue, NODE **rear, const CITY *pStu); NODE *dequeue(NODE **queue, NODE **rear); // Doubly Linked List Functions D_NODE *init_list(void); int insert(D_NODE *list, const CITY *pStu); void traverse_forw(D_NODE *list); void traverse_back(D_NODE *list); // Other Functions void printCity(const CITY *pCity); int main (void) { CITY cList[NUM_CITIES] = { {"Cupertino", {88, 89, 87, 85, 89}}, {"Flagstaff", {81, 80, 88, 89, 89}}, {"Los Angeles", {87, 88, 89, 89, 90}}, {"Philadelphia", {96, 99, 99, 90, 95}}, {"Phoenix", {106, 109, 109, 100, 105}}, {"Portland", {89, 90, 85, 89, 90}}, {"Reno", {108, 105, 109, 100, 108}}, {"Salem", {85, 90, 85, 89, 90}}, {"Tucson", {107, 100, 109, 100, 108}}, {"Yreka", {101, 109, 100, 108, 109}} }; NODE *stack = NULL; NODE *top = NULL; NODE *queue = NULL, *rear = NULL; NODE *front; D_NODE *list; list = init_list(); // build stack and queue with data from an array of CITY structures srand((unsigned int)time(NULL)); int count = rand() % 10; for ( int n = 0; n < count; n++) { int i = rand() % NUM_CITIES; int duplicate = insert(list, &cList[i]); if(duplicate) { // already in the list! push(stack, &cList[i]); enqueue(&queue, &rear, cList[i]); } } // display list printf("\nLIST contents (forwards):\n"); traverse_forw(list); printf("\nLIST contents (backwards):\n"); traverse_back(list); // display stack if (top) { printf("\nSTACK contents from top to bottom:\n"); while ((top = pop(stack))) { printCity(top->city); } } else printf ("Empty Stack!\n"); // display queue if (front) { printf("\nQUEUE contents from front to rear:\n"); while ((front = dequeue( queue, rear))) { printCity(front->city); } } else printf ("Empty Queue!\n"); return 0; } /*************************************************** Displays the fileds of a CIS_CLASS structure Pre pCls - a pointer to a CIS_CLASS structure Post */ void printCity(const CITY *pCity) { printf("%-20s %3d\n",.

-- Task 2- Debugging a program with stacks- queues- and doubly-linked.docx

Adamq0DJonese

I have compilation errors that I'm struggling with in my code, please can you help me fix the errors. I'm trying to make a road map, where each place is a vertex and each road between two places is an edge. Each edge stores a number indicating the length of the road. Assume that there is at most one road directly connecting two given places, so that there is at most one edge between two vertices. The map is loaded in via a text file that starts with a line that contains the number of vertices and the number of edges. After the line mentioned, there are two sections of content. The initial section holds details regarding the vertices, where each line represents a single vertex. The information stored for each vertex includes its name and the availability of charging stations, represented as an integer with 1 indicating availability and 0 indicating unavailability. The second section stores information about the edges, with each line corresponding to one edge. Each line contains three numbers: the first two are 0-based indices of its two incident vertices within the places array; the last number is the edge length. An example of the map input would look like this as a txt file: import java.util.*; import java.io.*; class Vertex { // Constructor: set name, chargingStation and index according to given values, // initilaize incidentRoads as empty array public Vertex(String placeName, boolean chargingStationAvailable, int idx) { name = placeName; incidentRoads = new ArrayList<Edge>(); index = idx; chargingStation = chargingStationAvailable; } public String getName() { return name; } public boolean hasChargingStation() { return chargingStation; } public ArrayList<Edge> getIncidentRoads() { return incidentRoads; } // Add a road to the array incidentRoads public void addIncidentRoad(Edge road) { incidentRoads.add(road); } public int getIndex() { return index; } private String name; // Name of the place private ArrayList<Edge> incidentRoads; // Incident edges private boolean chargingStation; // Availability of charging station private int index; // Index of this vertex in the vertex array of the map } class Edge { public Edge(int roadLength, Vertex firstPlace, Vertex secondPlace) { length = roadLength; incidentPlaces = new Vertex[] { firstPlace, secondPlace }; } public Vertex getFirstVertex() { return incidentPlaces[0]; } public Vertex getSecondVertex() { return incidentPlaces[1]; } public int getLength() { return length; } private int length; private Vertex[] incidentPlaces; } // A class that represents a sparse matrix public class RoadMap { // Default constructor public RoadMap() { places = new ArrayList<Vertex>(); roads = new ArrayList<Edge>(); } // Auxiliary function that prints out the command syntax public static void printCommandError() { System.err.println("ERROR: use one of the following commands"); System.err.println(" - Load a map and print information:"); System.err.println(" java RoadMap -i <MapFile>"); System.err.println(" - Load a map an.

I have compilation errors that I'm struggling with in my code- please.pdf

ColinjHJParsonsa

This is the Java code i have for a Battleship project i am working on, i am now wanting to convert this to a fully graphical Gui interface, but i just cant seem to get anywhere with it, so if i could get some help with this, i would apperciate it....(just a reminder its in JAVA) public class BattleshipGame { private Ocean ocean; private boolean[][] availableSpot; private Scanner sc; public BattleshipGame() { // define a new ocean and a new 2D array to store available coordinates ocean = new Ocean(); availableSpot = new boolean[10][10]; for (int i = 0; i < 10; i++) { for (int j = 0; j < 10; j++){ availableSpot[i][j] = true; } } } /** * prints the game menu and info * //param select */ public void print(int select){ String info; switch (select) { case 1: info = \"Welcome to the World of Battleship!\"; break; case 2: info = \"Enter coordinates to fire: \"; break; case 3: info = \"Shots fired: \"+ocean.getShotsFired()+\", Ships sunk: \"+ocean.getShipsSunk(); break; case 4: info = \"Congratulations! You win!\"; break; case 99: info = \"Invalid input. Please re-enter:\"; break; case 100: info = \"--------------------------------------------\"; break; case 101: info = \"\ ============================================\"; break; default: info = \"Error selection\"; break; } System.out.println(info); } /** * check if the input is valid * //param input * //return boolean */ public boolean checkValidInput(String input){ ArrayList numList = new ArrayList(); for (int i=0;i<10;i++){ numList.add(\"\"+i); } String[] coordinates = input.split(\" \"); //returns false if there are not 2 strings if (coordinates.length!=2){ return false; } //returns false if any of the strings is not a single digit number for (String str: coordinates){ if (numList.contains(str)==false){ return false; } } //returns false if the coordinates have already been shot at int row = Integer.parseInt(coordinates[0]); int column = Integer.parseInt(coordinates[1]); if (this.availableSpot[row][column]==false){ return false; } return true; } /** * get the coordinates to shoot at from the String input * //param input * //return int[] coordinates */ public int[] getCoordinates(String input){ int[] coordinates = new int[2]; String[] strList = input.split(\" \"); int row = Integer.parseInt(strList[0]); int column = Integer.parseInt(strList[1]); coordinates[0] = row; coordinates[1] = column; return coordinates; } /** * play the battleship game */ public void play(){ print(101); print(1); ocean.placeAllShipsRandomly(); boolean isGameOver = ocean.isGameOver(); sc = new Scanner(System.in); //print the ocean and start the game ocean.print(); print(3); while (!isGameOver){ print(2); String input = sc.nextLine(); //check if input is valid while (!checkValidInput(input)){ print(99); input = sc.nextLine(); } //get coordinates and fire int[] coordinates = getCoordinates(input); int row = coordinates[0]; int column = coordinates[1]; ocean.shootAt(row, column); availableSpot[row][column] = false; isGameOver = o.

This is the Java code i have for a Battleship project i am working o.pdf

calderoncasto9163

/* Program of sorting using shell sort */ #include #define MAX 20 main() { int arr[MAX], i,j,k,n,incr; printf(\"Enter the number of elements : \"); scanf(\"%d\",&n); for(i=0;i=1) { for(j=incr;j= 0 && k < arr[i]; i = i-incr) arr[i+incr]=arr[i]; arr[i+incr]=k; } printf(\"Increment=%d \ \",incr); for (i = 0; i < n; i++) printf(\"%d \", arr[i]); printf(\"\ \"); incr=incr-2; /*Decrease the increment*/ }/*End of while*/ printf(\"Sorted list is :\ \"); for (i = 0; i < n; i++) printf(\"%d \", arr[i]); printf(\"\ \"); }/*End of main()*/ redix sort /*Program of sorting using radix sort*/ # include # include struct node { int info ; struct node *link; }*start=NULL; main() { struct node *tmp,*q; int i,n,item; printf(\"Enter the number of elements in the list : \"); scanf(\"%d\", &n); for(i=0;iinfo=item; tmp->link=NULL; if(start==NULL) /* Inserting first element */ start=tmp; else { q=start; while(q->link!=NULL) q=q->link; q->link=tmp; } }/*End of for*/ printf(\"Unsorted list is :\ \"); display(); radix_sort(); printf(\"Sorted list is :\ \"); display (); }/*End of main()*/ display() { struct node *p=start; while( p !=NULL) { printf(\"%d \", p->info); p= p->link; } printf(\"\ \"); }/*End of display()*/ radix_sort() { int i,k,dig,maxdig,mindig,least_sig,most_sig; struct node *p, *rear[10], *front[10]; least_sig=1; most_sig=large_dig(start); for(k = least_sig; k <= most_sig ; k++) { printf(\"PASS %d : Examining %dth digit from right \",k,k); for(i = 0 ; i <= 9 ; i++) { rear[i] = NULL; front[i] = NULL ; } maxdig=0; mindig=9; p = start ; while( p != NULL) { /*Find kth digit in the number*/ dig = digit(p->info, k); if(dig>maxdig) maxdig=dig; if(diglink = p ; rear[dig] = p ; p=p->link;/*Go to next number in the list*/ }/*End while */ /* maxdig and mindig are the maximum amd minimum digits of the kth digits of all the numbers*/ printf(\"mindig=%d maxdig=%d\ \",mindig,maxdig); /*Join all the queues to form the new linked list*/ start=front[mindig]; for(i=mindig;ilink=front[i+1]; else rear[i+1]=rear[i]; } rear[maxdig]->link=NULL; printf(\"New list : \"); display(); }/* End for */ }/*End of radix_sort*/ /* This function finds number of digits in the largest element of the list */ int large_dig() { struct node *p=start ; int large = 0,ndig = 0 ; while(p != NULL) { if(p ->info > large) large = p->info; p = p->link ; } printf(\"Largest Element is %d , \",large); while(large != 0) { ndig++; large = large/10 ; } printf(\"Number of digits in it are %d\ \",ndig); return(ndig); } /*End of large_dig()*/ /*This function returns kth digit of a number*/ int digit(int number, int k) { int digit, i ; for(i = 1 ; i <=k ; i++) { digit = number % 10 ; number = number /10 ; } return(digit); }/*End of digit()*/ Solution /* Program of sorting using shell sort */ #include #define MAX 20 main() { int arr[MAX], i,j,k,n,incr; printf(\"Enter the number of elements : \"); scanf(\"%d\",&n); for(i=0;i=1) { for(j=incr;j= 0 && k < arr[i]; i = i-incr) arr[i+incr]=arr[i]; arr[i+incr]=k; } printf(\.

Program of sorting using shell sort #include stdio.h #de.pdf

anujmkt

week-3x

KITE www.kitecolleges.com

Edwards Manufacturing Company purchases two component parts from three different suppliers. The suppliers have limited capacity, and no one supplier can meet all the company’s needs. In addition, the suppliers charge different prices for the components. Component price data (in price per unit) are as follows: Each supplier has a limited capacity in terms of the total number of components it can supply. However, as long as Edwards provides sufficient advance orders, each supplier can devote its capacity to component 1, component 2, or any combination of the two components, if the total number of units ordered is within its capacity. Supplier capacities are as follows: If the Edwards production plan for the next period includes 1000 units of component 1 and 800 units of component 2, what purchases do you recommend? That is, how many units of each component should be ordered from each supplier? Round your answers to the nearest whole number. What is the total purchase cost for the components? Round your answer to the nearest dollar. $ ????SupplierComponent1231$11$10$132$10$11$11 Solution For component 1: supplier 2 have minimum cost and capacity 1050. So all the component 1 (1000) can be purchased from supplier 2. So, supplier 2 have 50 more capacity. Now, supplier 1 have minimum cost for component 2 and have capacity of 650. so, number of component 2 from supplier1 can be 650. Now, we need 150 more component 2. supplier 2 and 3 have same cost for component 2. supllier have only 50 capacity now and supplier have 850. So, 150 component 2 can be purchased from supplier 3. Let y be the number of components fromSupplier123TotalcostComponent 1010000100010000Component 265001508008150Total cost18150.

I have the following code and I need to know why I am receiving the .pdf

ezzi552

app.js /******************************************************************************* * Copyright (c) 2014 IBM Corp. * * All rights reserved. This program and the accompanying materials * are made available under the terms of the Eclipse Public License v1.0 * and Eclipse Distribution License v1.0 which accompany this distribution. * * The Eclipse Public License is available at * http://www.eclipse.org/legal/epl-v10.html * and the Eclipse Distribution License is available at * http://www.eclipse.org/org/documents/edl-v10.php. * * Contributors: * Bryan Boyd - Initial implementation *******************************************************************************/ var parseString = require('xml2js').parseString; var vincenty = require('node-vincenty'); var fs = require('fs'); var argv = require('optimist').argv; var mqtt = require('mqtt'); var http = require('http'); var settings = require('./config/settings'); var appInfo = JSON.parse(process.env.VCAP_APPLICATION || "{}"); var appHost = appInfo.host || "localhost"; console.log(argv); var deviceIndex = (appInfo && appInfo.instance_index) ? appInfo.instance_index : 0; var deviceId = settings.iot_deviceSet[deviceIndex].deviceId; var token = settings.iot_deviceSet[deviceIndex].token; var iot_server = settings.iot_deviceOrg + ".messaging.internetofthings.ibmcloud.com"; var iot_port = 1883; var iot_username = "use-token-auth"; var iot_password = token; var iot_clientid = "d:" + settings.iot_deviceOrg + ":" + settings.iot_deviceType + ":" + deviceId console.log(iot_server, iot_clientid, iot_username, iot_password); //var client = mqtt.createClient(1883, iot_server, { clientId: iot_clientid, username: iot_username, password: iot_password }); var options1 = { port: 1883, host: iot_server, clientId: iot_clientid, username: iot_username, password: iot_password, protocolId: 'MQIsdp', protocolVersion: 3 }; var client = mqtt.connect(options1); console.log(JSON.stringify(process.env)); var VEHICLE_COUNT = (argv.count ? argv.count : (process.env.VEHICLE_COUNT || 1)); var TELEMETRY_RATE = (argv.rate ? argv.rate : (process.env.TELEMETRY_RATE || 2)); console.log("Simulating " + VEHICLE_COUNT + " vehicles"); // subscribe var propertyTopic = "iot-2/cmd/setProperty/fmt/json"; // publish var telemetryTopic = "iot-2/evt/telemetry/fmt/json"; ////////////////// // MAP // ////////////////// var num_nodes = 0; var num_edges = 0; var map = { nodes: {}, edges: {} }; function Map(abbr, name, filename) { this.abbr = abbr; this.name = name; this.nodeCount = 0; this.edgeCount = 0; this.nodes = {}; this.edges = {}; this.loadFromFile(filename); } Map.prototype.loadFromFile = function(filename) { fs.readFile(filename, (function(map) { return function(err, data) { if (err) throw err; parseString(data, function(err, result) { console.log("parseString"); if (err) throw err; map.createMapFromJSON(result); setTimeout(mapLoaded, 5000); }); } })(this)); }.

app.js.docx

armitageclaire49

#include #include #include #include /*Structure for storing words received from each thread*/ struct return_val{ char wordlist[100][100]; int count[100]; } *arr; pthread_t *threads; int lines; /*Aggregates Frequency Sum of different threads*/ int aggregate(char *a) { int sum = 0; int i=0; while(1) { if(i==lines) break; int count = 0; while(1) { if(arr[i].count[count] == -1) { break; } if(strcmp(a,arr[i].wordlist[count]) == 0) { sum += arr[i].count[count]; arr[i].count[count] = 0; } count++; } i++; } return sum; } /*Function executed by each thread on separate line*/ void *word_count(void* num) { int *ln = num; unsigned int line_number = *ln; line_number++; char cmd_p1[9] = \"sed -n \'\\0\"; char cmd_p2[2]; sprintf(cmd_p2,\"%d\",line_number); char cmd_p3[14] = \"p\' \'file.txt\'\\0\"; char command[100]; command[0] = \'\\0\'; strcat(command,cmd_p1); strcat(command,cmd_p2); strcat(command,cmd_p3); //usleep(line_number); char cmd[100] = \" | tr [:space:] \'\\\ \' | grep -v \'^\\\\s*$\' | sort | uniq -c | sort\\0\"; strcat(command,cmd); FILE *in; in= popen(command, \"r\"); rewind(in); char buff[50]; int counter = 0; while(fgets(buff,sizeof(buff),in)) { char c=\' \'; int i = 0; int cnt = atoi(buff); arr[line_number-1].count[counter] = cnt; while(c!=\'\\0\') { c=buff[i]; buff[i]=buff[i+6]; i++; } int cnnt = 0; while(c!=\' \') { c = buff[cnnt]; cnnt++; } i=0; while(c!=\'\\0\') { c=buff[i]; buff[i]=buff[i+cnnt]; i++; } sprintf(arr[line_number-1].wordlist[counter],\"%s\",buff); counter++; } arr[line_number-1].count[counter] = -1; fclose(in); return NULL; } int main(void) { FILE *fp; fp = fopen(\"file.txt\",\"r\"); char a[200]; lines = 0; void *status = NULL; while(fgets(a,sizeof(a),fp) !=NULL) { lines++; } fclose(fp); arr = (struct return_val*) calloc(lines, sizeof(struct return_val) * lines); threads = malloc(sizeof(pthread_t)*lines); int i; for(i=0;i= 0) { if(arr[i].count[ctr] > 0) { strcpy(final[final_ctr],arr[i].wordlist[ctr]); final_cnt[final_ctr] = arr[i].count[ctr]; arr[i].count[ctr] = 0; int sum = aggregate(arr[i].wordlist[ctr]); final_cnt[final_ctr] += sum; printf(\"%d %s\",final_cnt[final_ctr],final[final_ctr]); } ctr++; final_ctr++; } i++; if(i==lines) { break; } } free(arr); return 0; } #include #include #include #include /*Structure for storing words received from each thread*/ struct return_val{ char wordlist[100][100]; int count[100]; } *arr; pthread_t *threads; int lines; /*Aggregates Frequency Sum of different threads*/ int aggregate(char *a) { int sum = 0; int i=0; while(1) { if(i==lines) break; int count = 0; while(1) { if(arr[i].count[count] == -1) { break; } if(strcmp(a,arr[i].wordlist[count]) == 0) { sum += arr[i].count[count]; arr[i].count[count] = 0; } count++; } i++; } return sum; } /*Function executed by each thread on separate line*/ void *word_count(void* num) { int *ln = num; unsigned int line_number = *ln; line_number++; char cmd_p1[9] = \"sed -n \'\\0\"; char cmd_p2[2]; sprintf(cmd_p2,\"%d\",line_number); char cmd_p3[14] .

#include stdio.h#include stdlib.h#include string.h#inclu.pdf

apleather

week-5x

KITE www.kitecolleges.com

I need to create a data type that implement the following interface ; myNumber() myNumber(int valueIn) void printDecimal() void printBinary() String toString() //returns a string stating both the decimal and binary value Solution import java.util.*; interface Myinterface { public void mynumber(); public void mynumber(int value); public void printDecimal(); public void printbinary(); public void tostring(); } class Sample implements Myinterface { public void mynumber() { int value=0; System.out.println(\"implementation of mynumber()\"); } public void mynumber(int value) { int a=value; System.out.println(\"implementation of mynumber(int value):\"+a); } public void printDecimal() { int x=10; System.out.println(\"Decimal number is:\"+x); } public void printbinary() { int x=10; int arr[] = new int[100]; int i=0; while(x>0) { arr[i]=x%2; i++; x=x/2; } int count=i-1; System.out.println(\"Binary value :\"); for(i=count;i>=0;i--) { System.out.println(arr[i]); } } public void tostring() { //toSting is used to return the string object value for the integer int x=10; int p=x; int arr[] = new int[100]; int i=0; while(x>0) { arr[i]=x%2; i++; x=x/2; } int count=i-1; System.out.println(\"deimal is: \"+Integer.toString(p)); //implementing toSting object for decimal System.out.println(\"Binary value :\"); for(i=count;i>=0;i--) { System.out.println(Integer.toString(arr[i])); } } public static void main(String args[]) { //defining objects for the interface and are called in the void main Myinterface obj = new Sample(); obj.mynumber(); obj.mynumber(3); obj.printDecimal(); obj.printbinary(); obj.tostring(); } } .

I need to create a data type that implement the following interface -.docx

mckerliejonelle

Quest 1 define a class batsman with the following specifications

rajkumari873

Swift Programming Language

Anıl Sözeri

Similar to import java.util.;import acm.program.;public class FlightPla.pdf (20)