package lab7; import java.util.Scanner; Sammy Student, Program.pdf
•
0 likes•5 views
package lab7; import java.util.Scanner; //Sammy Student, Programmer public class Maze { static Scanner sc = new Scanner(System.in); // maze movements static char myMove = \'\\0\'; // cell position static int currentCell = 0; static int score = 0; static boolean advance = true; static boolean checkThis = false; public static void main(String args[]) { // the local variables declared and initialized char answer = \'Y\'; displayMenu(); while(answer == \'Y\' || answer == \'y\') { displayMovement(); makeYourMove(); checkThis = checkYourMove(); mazeStatus(); System.out.println(\"move again(Y or N)?\"); answer = sc.next().charAt(0); } System.out.println(\"***************************\"); }// end main() method static void displayMenu() { System.out.println(\"\"); System.out.println(\"***************************\"); System.out.println(\"----The Maze Strategy---\"); System.out.println(\"\"); }// end method static void displayMovement() { if(currentCell == 0) { System.out.println(\"You have entered the maze!!\"); System.out.println(\"There is no turning back!!\"); currentCell = 1; mazeStatus(); advance = true; } System.out.println(\"make your move (W, A, S, D)\"); System.out.println(\"W = up, A = left, S = down, D = right)\"); }// end method static void makeYourMove() { myMove = sc.next().charAt(0); switch(myMove) { case \'W\': { MoveUp(); break; } case \'A\': { MoveLeft(); break; } case \'S\': { MoveDown(); break; } case \'D\': { MoveRight(); break; } } // end program menu }// end method static boolean checkYourMove() { if(currentCell == 1 && advance == true) { if (myMove == \'W\') { advance = false; System.out.println(\"try again\"); return advance; } if (myMove == \'A\') { advance = false; System.out.println(\"SORRY, there is no return\"); return advance; } if (myMove == \'D\') { currentCell = 2; advance = true; System.out.println(\"continue through the maze\"); return advance; } if (myMove == \'S\') { advance = false; System.out.println(\"continue through the maze\"); return advance; } } if(currentCell == 2 && advance == true) { if (myMove == \'W\') { advance = false; System.out.println(\"try again\"); return advance; } if (myMove == \'A\') { advance = false; System.out.println(\"SORRY, there is no return\"); return advance; } if (myMove == \'D\') { advance = false; System.out.println(\"continue through the maze\"); return advance; } if (myMove == \'S\') { currentCell = 5; advance = true; System.out.println(\"continue through the maze\"); return advance; } } return advance; // end program menu }// end method static void MoveLeft() { System.out.println(\"you moved to the left\"); }//end method static void MoveRight() { System.out.println(\"you moved to the right\"); }//end method static void MoveUp() { System.out.println(\"you moved up (forward)\"); }//end method static void MoveDown() { System.out.println(\"you moved down (downward)\"); }//end method static void mazeStatus() { System.out.println(\"current position: cell \" + currentCell); }//end meth.
Report
Share
Report
Share
Download to read offline
![package lab7;
import java.util.Scanner;
//Sammy Student, Programmer
public class Maze
{
static Scanner sc = new Scanner(System.in);
// maze movements
static char myMove = '0';
// cell position
static int currentCell = 0;
static int score = 0;
static boolean advance = true;
static boolean checkThis = false;
public static void main(String args[])
{
// the local variables declared and initialized
char answer = 'Y';
displayMenu();
while(answer == 'Y' || answer == 'y')
{
displayMovement();
makeYourMove();
checkThis = checkYourMove();
mazeStatus();
System.out.println("move again(Y or N)?");
answer = sc.next().charAt(0);
}
System.out.println("***************************");
}// end main() method
static void displayMenu()
{](https://image.slidesharecdn.com/packagelab7importjava-230707090226-5090d4d9/85/package-lab7-import-java-util-Scanner-Sammy-Student-Program-pdf-1-320.jpg)
Recommended
JAVA...With N.E.T_B.E.A.N.S___________________________________.pdf
JAVA...W\'i\'t\'h
N.E.T_B.E.A.N.S_______________________________________________________________
_____________________________________________________________________________
_____________________________________________________________________________
____________________________________________________
***********Product*********************
package rooster.nest;
import java.text.NumberFormat;
public class Product {
private long id;
private String code;
private String description;
private double price;
public long getId() {
return id;
}
public void setId(long id) {
this.id = id;
}
public String getCode() {
return code;
}
public void setCode(String code) {
this.code = code;
}
public String getDescription() {
return description;
}
public void setDescription(String name) {
this.description = name;
}
public double getPrice() {
return price;
}
public void setPrice(double price) {
this.price = price;
}
public String getPriceFormatted() {
NumberFormat currencyFormatter =
NumberFormat.getCurrencyInstance();
return currencyFormatter.format(getPrice());
}
}
********DBException************
package crows.foot;
/*
* This is just a wrapper class so we can throw a common exception for
* the UI to catch without tightly coupling the UI to the database layer.
*/
public class DBException extends Exception {
DBException() {}
DBException(Exception e) {
super(e);
}
}
*******DBUtil************
package crows.foot;
import java.sql.Connection;
import java.sql.DriverManager;
import java.sql.SQLException;
public class DBUtil {
private static Connection connection;
private DBUtil() {}
public static synchronized Connection getConnection() throws DBException {
if (connection != null) {
return connection;
}
else {
try {
// set the db url, username, and password
String url = \"jdbc:mysql://localhost:3306/mma\";
String username = \"mma_user\";
String password = \"sesame\";
// get and return connection
connection = DriverManager.getConnection(
url, username, password);
return connection;
} catch (SQLException e) {
throw new DBException(e);
}
}
}
public static synchronized void closeConnection() throws DBException {
if (connection != null) {
try {
connection.close();
} catch (SQLException e) {
throw new DBException(e);
} finally {
connection = null;
}
}
}
}
*************ProductDB**************
package crows.foot;
import java.sql.Connection;
import java.sql.PreparedStatement;
import java.sql.ResultSet;
import java.sql.SQLException;
import java.util.ArrayList;
import java.util.List;
import rooster.nest.Product;
public class ProductDB {
private static Product getProductFromRow(ResultSet rs) throws SQLException {
int productID = rs.getInt(1);
String code = rs.getString(2);
String description = rs.getString(3);
double price = rs.getDouble(4);
String note = rs.getString(5);
Product p = new Product();
p.setId(productID);
p.setCode(code);
p.setDescription(description);
p.setPrice(price);
return p;
}
public static List getAll() throws DBException {
String sql = \"SELECT * FROM Product.
WAP to implement inheritance and overloading methods in java
WAP to implement inheritance and overloading methods
Implement threads and a GUI interface using advanced Java Swing clas.pdf
Implement threads and a GUI interface using advanced Java Swing classes.
Required data structure - the advanced data structure uses implementation of a multi-tree with
the following levels: Cave - level 0 Party - Level 1 Creature - Level 2 Artifacts - Level 3
Treasures - Level 3 Jobs
Use the Swing class JTree effectively to display the contents of the data file. Implement a JTable
to also show the contents of the data file.
Threads: Implement a thread for each job representing a task that creature will perform. Use the
synchronize directive to avoid race conditions and insure that a creature is performing only one
job at a time. The thread for each job should be started as the job is read in from the data file.
Only one job should be progressing for each creature at any moment. Use delays to show the
creature doing the task.
Use a JProgressBar for each creature to show the creature performing the task. Use JButton\'s on
the Job panel to allow the task to be suspended and cancelled. The GUI elements should be
distinct from the other classes in the program.
Solution
Please find the code below for the above problem :
import java.util.ArrayList;
import java.util.Scanner;
import java.util.HashMap;
import java.util.Random;
import java.io.File;
import java.io.FileNotFoundException;
import javax.swing.JProgressBar;
import javax.swing.JFrame;
import javax.swing.JLabel;
import javax.swing.JPanel;
import javax.swing.JButton;
import javax.swing.JTextArea;
import javax.swing.JScrollPane;
import javax.swing.SwingConstants;
import java.awt.GridLayout;
import java.awt.BorderLayout;
import java.awt.Color;
import java.awt.Font;
import java.awt.event.ActionListener;
import java.awt.event.ActionEvent;
public class Cave2 {
ArrayList parties = new ArrayList (); // the parties
ArrayList loners = new ArrayList (); // creatures not in parties
ArrayList drops = new ArrayList (); // Treasures not carried
ArrayList magics = new ArrayList (); // Artifacts not carried
ArrayList jobs = new ArrayList (); // Jobs to be performed
JFrame jf = new JFrame ();
JPanel jrun = new JPanel ();
JTextArea jta = new JTextArea (10, 10);
// hashmap of everything by index
HashMap hmElements = new HashMap ();
public Cave2 () {
Scanner sf = null;
String fileName = \"dataC.txt\";
try {
// sf = new Scanner (new File (fileName));
// getResourceAsStream is the way to access a data file in a jar package file
// this works in general, so leave it here as is.
sf = new Scanner (getClass().getResourceAsStream (fileName));
}
catch (Exception e) {
System.out.println (e + \"\ File bummer: \" + fileName);
} // end open file try/catch block
if (sf == null)
return;
readFile (sf);
jta.setText (toString ());
jf.setTitle (\"Cave2\");
jf.add (jrun, BorderLayout.PAGE_END);
jrun.setLayout (new GridLayout (0, 5, 2, 5));
jf.add (new JScrollPane (jta), BorderLayout.CENTER);
jta.setFont (new Font (\"Monospaced\", 0, 12));
jf.pack ();
jf.setVisible (true);
jf.setLocationRelativeTo (null);
} // end no-parameter constru.
Menu Driven programs in Java
Menu Driven programs in Java, infinte loop, do while loop, calculator program in java
TASK #1In the domain class you will create a loop that will prompt.pdf
TASK #1
In the domain class you will create a loop that will prompt the user to enter a value of 1, 2, or 3,
which will in turn, be translated to a floor number in the game. Make sure the user only picks a
selection you are expecting (1, 2, or 3) with a while-loop. Then you will create a switch or if-else
statement. If you are more comfortable with if-else then do switch, or if you are more
comfortable with switch then do if-else. Based on the number the user chooses you will set the
floor variable to the appropriate value. When they select 1 floor should be set to 3, when they
select 2 floor should be set to 6, and when they select 3 floor should be set to 10.
TASK #2
In the domain class you will create a constructor with 6 parameters, representing all the data
loaded from the input file that was saved from a previous adventure. This constructor receives 6
parameters: aName, anAttack, aDefense, aHealth, aCurrentFloor, & aMaxFloor.
TASK #3
In the domain class you will create a save method that will allow the user to save their progress
using a PrintWriter object. This file will overwrite whatever was there before, so no need to use
FileWriter, only PrintWriter. There are 6 attributes that you need to write to the file:
name, attack, defense, health, currentFloor, & maxFloor
public void saveFile()
{
String filename = “game.txt”;
PrintWriter pw = new PrintWriter(filename);
pw.println(name);
pw.println(attack);
pw.println(defense);
pw.println(health);
pw.println(currentFloor);
pw.println(maxFloor);
pw.close();
}
TASK #4
In the driver class you will create a load method that will allow the user to pick up from where
they left off. You will do this using a File object and a Scanner object. Remember to use the File
and Scanner classes, and to close the file object after you’re done. There are 6 attributes you will
need to load from the file to successfully continue an Adventure:
name, attack, defense, health, currentFloor, & maxFloor
After you read the record from the file, and store the data in these 6 variables, you can create a
new Adventure object called JavaQuest with those 6 variables. Remember JavaQuest is a global
variable defined at the beginning of the driver class. Then, within the load method, invoke the
startAdventure() method for the newly created Adventure object.
public static void load()
{
String filename = “load.txt”;
File myFile = new File(filename);
Scanner myScan = new Scanner(myFile);
String name;
int attack, defense, health, currentFloor, maxFloor;
name = myScan.nextLine();
attack = myScan.nextInt();
myScan.nextLine();
defense = myScan.nextInt();
myScan.nextLine();
…
javaQuest = new Adventure(name, attack, defense, health, currentFloor, maxFloor);
}
javaQuest.startAdventure();
The Files
package Adventure;
import java.io.BufferedWriter;
import java.io.File;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Random;
import java.util.Scanner;
public class Adventure
{
int health, defense, attack;
String mons.
import java.util.ArrayList; import java.util.List; import java.u.pdf
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class Demo {
static Scanner scanner=new Scanner(System.in);
public static void main(String[] args) {
ListnameList=createListOfNames();
try {
// Declare variable for user\'s option
int menuOption = 0;
do {
// Setting menuOption equal to return value from showMenu() function;
menuOption = showMenu();
// switch case as per the user option
switch (menuOption) {
case 1:
int correctAnswer=hardProblem(nameList);
System.out.println(\"Correct Answer :\"+correctAnswer);
break;
case 2:
int correctAnswerEasy=easyProblem(nameList);
System.out.println(\"Correct Answer :\"+correctAnswerEasy);
break;
case 3:
System.out.println(\"Quitting Program..\");
break;
default:
System.out.println(\"Sorry, Please enter valid Option\");
}// End of switch statement
} while (menuOption != 3);
} catch (Exception ex) {
// Error Message
System.out.println(\"Sorry problem occured within Program\");
// flushing scanner
scanner.next();
} finally {
// Ensuring that scanner will always be closed and cleaning up
// resources
scanner.close();
}
}// End of main Method
/**
* Method that prints menu to screen and gets returns user\'s option from menu
* @return Returns user Option
*/
public static int showMenu() {
// Declaring var for user option and defaulting to 0
int option = 0;
// Printing menu to screen
System.out.println(\"Menu:\");
System.out.println(\"1.Hard Problem\");
System.out.println(\"2.Easy Problem\");
System.out.println(\"3. Quit\");
// Getting user option from above menu
System.out.println(\"Enter Option from above...\");
option = scanner.nextInt();
return option;
}
public static ListcreateListOfNames(){
ListnameList=new ArrayList();
System.out.println(\"Enter the number of children to enter\");
int num=scanner.nextInt();
for(int i=0;inameList){
int correctAnswers=0;
int day=0;
for(String name:nameList){
boolean correct=false;
int index=day%nameList.size();
String childForDishDuty=nameList.get(index);
System.out.println(\"Please enter the child name\");
String userInput=scanner.next();
if(childForDishDuty.equalsIgnoreCase(userInput)){
correct=true;
}
if(correct){
correctAnswers++;
}
day++;
}
return correctAnswers;
}
public static int easyProblem(ListnameList){
int correctAnswers=0;
int day=0;
for(String name:nameList){
boolean correct=false;
int index=day%nameList.size();
String childForDishDuty=\"Day \"+day+\":\"+nameList.get(index)+\" must do the
dishes\";
System.out.println(childForDishDuty);
System.out.println(\"Please enter the child name\");
String userInput=scanner.next();
if(nameList.get(index).equalsIgnoreCase(userInput)){
correct=true;
}
if(correct){
correctAnswers++;
}
day++;
}
return correctAnswers;
}
}
Solution
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class Demo {
static Scanner scanner=new Scanner(System.in);
public static void main(String[] args) {
ListnameList=createListOfNames();
try {
// Declare variable for user\'s option
int .
Java.lang.object
Java Universal super class java.lang.Object is discussed comprehensively with code snippets.
Also covers:
a) Why we need inheritance and dynamic method dispatch
b) Need of a universal parent
c) Delegation and proxies
d) toString(), clone(), equals(), notify()
Recommended
JAVA...With N.E.T_B.E.A.N.S___________________________________.pdf
JAVA...W\'i\'t\'h
N.E.T_B.E.A.N.S_______________________________________________________________
_____________________________________________________________________________
_____________________________________________________________________________
____________________________________________________
***********Product*********************
package rooster.nest;
import java.text.NumberFormat;
public class Product {
private long id;
private String code;
private String description;
private double price;
public long getId() {
return id;
}
public void setId(long id) {
this.id = id;
}
public String getCode() {
return code;
}
public void setCode(String code) {
this.code = code;
}
public String getDescription() {
return description;
}
public void setDescription(String name) {
this.description = name;
}
public double getPrice() {
return price;
}
public void setPrice(double price) {
this.price = price;
}
public String getPriceFormatted() {
NumberFormat currencyFormatter =
NumberFormat.getCurrencyInstance();
return currencyFormatter.format(getPrice());
}
}
********DBException************
package crows.foot;
/*
* This is just a wrapper class so we can throw a common exception for
* the UI to catch without tightly coupling the UI to the database layer.
*/
public class DBException extends Exception {
DBException() {}
DBException(Exception e) {
super(e);
}
}
*******DBUtil************
package crows.foot;
import java.sql.Connection;
import java.sql.DriverManager;
import java.sql.SQLException;
public class DBUtil {
private static Connection connection;
private DBUtil() {}
public static synchronized Connection getConnection() throws DBException {
if (connection != null) {
return connection;
}
else {
try {
// set the db url, username, and password
String url = \"jdbc:mysql://localhost:3306/mma\";
String username = \"mma_user\";
String password = \"sesame\";
// get and return connection
connection = DriverManager.getConnection(
url, username, password);
return connection;
} catch (SQLException e) {
throw new DBException(e);
}
}
}
public static synchronized void closeConnection() throws DBException {
if (connection != null) {
try {
connection.close();
} catch (SQLException e) {
throw new DBException(e);
} finally {
connection = null;
}
}
}
}
*************ProductDB**************
package crows.foot;
import java.sql.Connection;
import java.sql.PreparedStatement;
import java.sql.ResultSet;
import java.sql.SQLException;
import java.util.ArrayList;
import java.util.List;
import rooster.nest.Product;
public class ProductDB {
private static Product getProductFromRow(ResultSet rs) throws SQLException {
int productID = rs.getInt(1);
String code = rs.getString(2);
String description = rs.getString(3);
double price = rs.getDouble(4);
String note = rs.getString(5);
Product p = new Product();
p.setId(productID);
p.setCode(code);
p.setDescription(description);
p.setPrice(price);
return p;
}
public static List getAll() throws DBException {
String sql = \"SELECT * FROM Product.
WAP to implement inheritance and overloading methods in java
WAP to implement inheritance and overloading methods
Implement threads and a GUI interface using advanced Java Swing clas.pdf
Implement threads and a GUI interface using advanced Java Swing classes.
Required data structure - the advanced data structure uses implementation of a multi-tree with
the following levels: Cave - level 0 Party - Level 1 Creature - Level 2 Artifacts - Level 3
Treasures - Level 3 Jobs
Use the Swing class JTree effectively to display the contents of the data file. Implement a JTable
to also show the contents of the data file.
Threads: Implement a thread for each job representing a task that creature will perform. Use the
synchronize directive to avoid race conditions and insure that a creature is performing only one
job at a time. The thread for each job should be started as the job is read in from the data file.
Only one job should be progressing for each creature at any moment. Use delays to show the
creature doing the task.
Use a JProgressBar for each creature to show the creature performing the task. Use JButton\'s on
the Job panel to allow the task to be suspended and cancelled. The GUI elements should be
distinct from the other classes in the program.
Solution
Please find the code below for the above problem :
import java.util.ArrayList;
import java.util.Scanner;
import java.util.HashMap;
import java.util.Random;
import java.io.File;
import java.io.FileNotFoundException;
import javax.swing.JProgressBar;
import javax.swing.JFrame;
import javax.swing.JLabel;
import javax.swing.JPanel;
import javax.swing.JButton;
import javax.swing.JTextArea;
import javax.swing.JScrollPane;
import javax.swing.SwingConstants;
import java.awt.GridLayout;
import java.awt.BorderLayout;
import java.awt.Color;
import java.awt.Font;
import java.awt.event.ActionListener;
import java.awt.event.ActionEvent;
public class Cave2 {
ArrayList parties = new ArrayList (); // the parties
ArrayList loners = new ArrayList (); // creatures not in parties
ArrayList drops = new ArrayList (); // Treasures not carried
ArrayList magics = new ArrayList (); // Artifacts not carried
ArrayList jobs = new ArrayList (); // Jobs to be performed
JFrame jf = new JFrame ();
JPanel jrun = new JPanel ();
JTextArea jta = new JTextArea (10, 10);
// hashmap of everything by index
HashMap hmElements = new HashMap ();
public Cave2 () {
Scanner sf = null;
String fileName = \"dataC.txt\";
try {
// sf = new Scanner (new File (fileName));
// getResourceAsStream is the way to access a data file in a jar package file
// this works in general, so leave it here as is.
sf = new Scanner (getClass().getResourceAsStream (fileName));
}
catch (Exception e) {
System.out.println (e + \"\ File bummer: \" + fileName);
} // end open file try/catch block
if (sf == null)
return;
readFile (sf);
jta.setText (toString ());
jf.setTitle (\"Cave2\");
jf.add (jrun, BorderLayout.PAGE_END);
jrun.setLayout (new GridLayout (0, 5, 2, 5));
jf.add (new JScrollPane (jta), BorderLayout.CENTER);
jta.setFont (new Font (\"Monospaced\", 0, 12));
jf.pack ();
jf.setVisible (true);
jf.setLocationRelativeTo (null);
} // end no-parameter constru.
Menu Driven programs in Java
Menu Driven programs in Java, infinte loop, do while loop, calculator program in java
TASK #1In the domain class you will create a loop that will prompt.pdf
TASK #1
In the domain class you will create a loop that will prompt the user to enter a value of 1, 2, or 3,
which will in turn, be translated to a floor number in the game. Make sure the user only picks a
selection you are expecting (1, 2, or 3) with a while-loop. Then you will create a switch or if-else
statement. If you are more comfortable with if-else then do switch, or if you are more
comfortable with switch then do if-else. Based on the number the user chooses you will set the
floor variable to the appropriate value. When they select 1 floor should be set to 3, when they
select 2 floor should be set to 6, and when they select 3 floor should be set to 10.
TASK #2
In the domain class you will create a constructor with 6 parameters, representing all the data
loaded from the input file that was saved from a previous adventure. This constructor receives 6
parameters: aName, anAttack, aDefense, aHealth, aCurrentFloor, & aMaxFloor.
TASK #3
In the domain class you will create a save method that will allow the user to save their progress
using a PrintWriter object. This file will overwrite whatever was there before, so no need to use
FileWriter, only PrintWriter. There are 6 attributes that you need to write to the file:
name, attack, defense, health, currentFloor, & maxFloor
public void saveFile()
{
String filename = “game.txt”;
PrintWriter pw = new PrintWriter(filename);
pw.println(name);
pw.println(attack);
pw.println(defense);
pw.println(health);
pw.println(currentFloor);
pw.println(maxFloor);
pw.close();
}
TASK #4
In the driver class you will create a load method that will allow the user to pick up from where
they left off. You will do this using a File object and a Scanner object. Remember to use the File
and Scanner classes, and to close the file object after you’re done. There are 6 attributes you will
need to load from the file to successfully continue an Adventure:
name, attack, defense, health, currentFloor, & maxFloor
After you read the record from the file, and store the data in these 6 variables, you can create a
new Adventure object called JavaQuest with those 6 variables. Remember JavaQuest is a global
variable defined at the beginning of the driver class. Then, within the load method, invoke the
startAdventure() method for the newly created Adventure object.
public static void load()
{
String filename = “load.txt”;
File myFile = new File(filename);
Scanner myScan = new Scanner(myFile);
String name;
int attack, defense, health, currentFloor, maxFloor;
name = myScan.nextLine();
attack = myScan.nextInt();
myScan.nextLine();
defense = myScan.nextInt();
myScan.nextLine();
…
javaQuest = new Adventure(name, attack, defense, health, currentFloor, maxFloor);
}
javaQuest.startAdventure();
The Files
package Adventure;
import java.io.BufferedWriter;
import java.io.File;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Random;
import java.util.Scanner;
public class Adventure
{
int health, defense, attack;
String mons.
import java.util.ArrayList; import java.util.List; import java.u.pdf
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class Demo {
static Scanner scanner=new Scanner(System.in);
public static void main(String[] args) {
ListnameList=createListOfNames();
try {
// Declare variable for user\'s option
int menuOption = 0;
do {
// Setting menuOption equal to return value from showMenu() function;
menuOption = showMenu();
// switch case as per the user option
switch (menuOption) {
case 1:
int correctAnswer=hardProblem(nameList);
System.out.println(\"Correct Answer :\"+correctAnswer);
break;
case 2:
int correctAnswerEasy=easyProblem(nameList);
System.out.println(\"Correct Answer :\"+correctAnswerEasy);
break;
case 3:
System.out.println(\"Quitting Program..\");
break;
default:
System.out.println(\"Sorry, Please enter valid Option\");
}// End of switch statement
} while (menuOption != 3);
} catch (Exception ex) {
// Error Message
System.out.println(\"Sorry problem occured within Program\");
// flushing scanner
scanner.next();
} finally {
// Ensuring that scanner will always be closed and cleaning up
// resources
scanner.close();
}
}// End of main Method
/**
* Method that prints menu to screen and gets returns user\'s option from menu
* @return Returns user Option
*/
public static int showMenu() {
// Declaring var for user option and defaulting to 0
int option = 0;
// Printing menu to screen
System.out.println(\"Menu:\");
System.out.println(\"1.Hard Problem\");
System.out.println(\"2.Easy Problem\");
System.out.println(\"3. Quit\");
// Getting user option from above menu
System.out.println(\"Enter Option from above...\");
option = scanner.nextInt();
return option;
}
public static ListcreateListOfNames(){
ListnameList=new ArrayList();
System.out.println(\"Enter the number of children to enter\");
int num=scanner.nextInt();
for(int i=0;inameList){
int correctAnswers=0;
int day=0;
for(String name:nameList){
boolean correct=false;
int index=day%nameList.size();
String childForDishDuty=nameList.get(index);
System.out.println(\"Please enter the child name\");
String userInput=scanner.next();
if(childForDishDuty.equalsIgnoreCase(userInput)){
correct=true;
}
if(correct){
correctAnswers++;
}
day++;
}
return correctAnswers;
}
public static int easyProblem(ListnameList){
int correctAnswers=0;
int day=0;
for(String name:nameList){
boolean correct=false;
int index=day%nameList.size();
String childForDishDuty=\"Day \"+day+\":\"+nameList.get(index)+\" must do the
dishes\";
System.out.println(childForDishDuty);
System.out.println(\"Please enter the child name\");
String userInput=scanner.next();
if(nameList.get(index).equalsIgnoreCase(userInput)){
correct=true;
}
if(correct){
correctAnswers++;
}
day++;
}
return correctAnswers;
}
}
Solution
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
public class Demo {
static Scanner scanner=new Scanner(System.in);
public static void main(String[] args) {
ListnameList=createListOfNames();
try {
// Declare variable for user\'s option
int .
Java.lang.object
Java Universal super class java.lang.Object is discussed comprehensively with code snippets.
Also covers:
a) Why we need inheritance and dynamic method dispatch
b) Need of a universal parent
c) Delegation and proxies
d) toString(), clone(), equals(), notify()
Dat testing - An introduction to Java and Android Testing
Testing is a part of software engineering process. You wouldn't promote a code you haven't tested to production, so why don't you use automated testing and actually reduce costs and increase the efficiency?
You can also learn how doing testing can put pressure on your code to improve your architecture.
A Case for "Piggyback" Runtime Monitoring
A runtime monitor enforcing a constraint on sequences of method calls on an object must keep track of the state of the sequence by updating an appropriate state machine. The present paper stems from the observation that an object's member fields must already contain an encoding of that state machine, and that a monitor essentially duplicates operations that the object performs internally. Rather than maintain a state machine in parallel, the paper puts forward the concept of "piggyback" runtime monitoring, where the monitor relies as much as possible on the object's own state variables to perform its task. Experiments on real-world benchmarks show that this approach greatly simplifies the monitoring process and drastically reduces the incurred runtime overhead compared to classical solutions.
(C++) Change the following program so that it uses a dynamic array i.pdf
(C++) Change the following program so that it uses a dynamic array instead of a static one. Test
it with sequence_exam2.cpp.
sequence1.cpp
#include \"sequence1.h\"
#include
#include
namespace sequencelab
{
sequence::sequence()
{
used = 0;
current_index = 0;
}
void sequence::start()
{
if (used > 0)
{
current_index = 0;
}
else
{
current_index = used;
}
}
void sequence::advance()
{
if (is_item())
{
current_index++;
}
else
{
std::cout << \"Nothing here!\" << std::endl;
}
}
void sequence::insert(const value_type& figure)
{
if (size() < CAPACITY)
{
if (!is_item())
{
start();
}
for (size_t i = used; i > current_index; i--)
{
data[i] = data[i-1];
}
data[current_index] = figure;
used++;
}
else
{
std::cout << \"Did not insert, size is larger/equal to the capacity.\" << std::endl;
}
}
void sequence::attach(const value_type& figure)
{
if (size() < CAPACITY)
{
if (is_item())
{
for (size_t i = used; i > current_index + 1; i--)
{
data[i] = data[i-1];
}
data[current_index + 1] = figure;
current_index++;
used++;
}
else
{
data[used] = figure;
current_index = used;
used++;
}
}
else
{
std::cout << \"Did not attach, size is larger/equal to the capacity.\" << std::endl;
}
}
void sequence::remove_current()
{
if (is_item())
{
for (size_t i = current_index; i < used; i++)
{
data[i] = data[i+1];
}
used--;
}
else
{
std::cout << \"Nothing here!\" << std::endl;
}
}
sequence::size_type sequence::size() const
{
return used;
}
bool sequence::is_item() const
{
return ((current_index >= 0) && (current_index < used) && (used != 0));
}
sequence::value_type sequence::current() const
{
if (is_item())
{
return data[current_index];
}
else
{
std::cout << \"Nothing here!\" << std::endl;
}
}
}
----------------------------------------------------------------------------------
sequence1.h
#ifndef MAIN_SAVITCH_SEQUENCE_H
#define MAIN_SAVITCH_SEQUENCE_H
#include
namespace sequencelab
{
class sequence
{
public:
typedef double value_type;
typedef std::size_t size_type;
static const size_type CAPACITY = 30;
sequence( );
void insert(const value_type& figure);
void attach(const value_type& figure);
void start( );
void advance( );
void remove_current( );
value_type current( ) const;
size_type size( ) const;
bool is_item( ) const;
private:
value_type data[CAPACITY];
size_type used;
size_type current_index;
};
}
#endif
------------------------------------------------------------------------------------
sequence_exam2.cpp
#include // Provides cout.
#include // Provides memcpy.
#include // Provides size_t.
#include \"sequence2.h\" // Provides the Sequence class with double items.
using namespace std;
using namespace main_savitch_4;
// Descriptions and points for each of the tests:
const size_t MANY_TESTS = 7;
const int POINTS[MANY_TESTS+1] = {
21, // Total points for all tests.
4, // Test 1 points
4, // Test 2 points
4, // Test 3 points
2, // Test 4 points
2, // Test 5 points
2, // Test 6 points
3 // Test 7 points
};
const char DESCRIPTION[MANY_TESTS+1][256] = {
\"tests for sequence class with a dy.
I Have the following Java program in which converts Date to Words an.pdf
I Have the following Java program in which converts Date to Words and the only thing I have to
do now is add a boolean for a leap year. ( I am using Apache NetBeans) please explain where the
boolean goes.
Like this:
I need the code working with the boolean added, Thank you!!!
package a1_demo;
import java.util.Scanner;
public class MainApp {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.print("Welcome to the Date to Words Converter!\n\n");
while ( true ) {
// get user input
String str_MM_DD_YYYY = Validator.getString(
Validator.sc,
"Enter date in MM/DD/YYYY format: "
);
// convert text to ints:
// "11/22/3333" - > int, int int
String[] dateComponents = str_MM_DD_YYYY.split( "/" );
if ( dateComponents.length != 3 ) {
System.out.println("\t\t Bad input, please retry...");
continue;
}
int month = 0;
int day = 0;
int year = 0;
try {
month = Integer.parseInt(dateComponents[ 0 ]);
day = Integer.parseInt(dateComponents[ 1 ]);
year = Integer.parseInt(dateComponents[ 2 ]);
} catch ( java.lang.NumberFormatException ex ) {
System.out.println("\t\t numeric values are expected, please retry...");
continue;
}
Date2TextConverter converter = new Date2TextConverter( month, day, year );
System.out.print( converter.month2text() );
System.out.print( " " );
System.out.print( converter.day2text() );
System.out.print( " " );
System.out.print( converter.year2text() );
System.out.println();
}// endless while loop
}//main
}//class MainApp
package a1_demo;
public class Date2TextConverter {
//---------------------------------------
// data
//---------------------------------------
int month = 0;
int day = 0;
int year = 0;
//---------------------------------------
// constructors
//---------------------------------------
public Date2TextConverter(int month, int day, int year )
{
this.month = month;
this.day = day;
this.year = year;
}//Date2TextConverter
//---------------------------------------
// operations
//---------------------------------------
public String month2text()
{
switch( month )
{
case 1: return "Jan";
case 2: return "Feb";
case 3: return "Mar";
case 4: return"April";
case 5: return"May";
case 6: return"June";
case 7: return"July";
case 8: return"Aug";
case 9: return"Sep";
case 10: return"Oct";
case 11: return"Nov";
case 12: return"Dec";
//...
default:
return "Invalid Month";
}
}//month2text
public String day2text()
{
//return Integer.toString( day );
return number2words (day);
}//day2text
public String year2text()
{
int century = year / 100;
int yearInCentury = year % 100;
String centuryText = number2words( century );
String yearText = number2words( yearInCentury );
if ( yearInCentury < 10 ) {
return centuryText + " zero " + yearText;
} else {
return centuryText + " " + yearText;
}
}//year2text
private String number2words( int number ) {
// convert to text a number 0 through 99
if ( number < 20 ) {
// 0, 1, 2, 3, ..., 19
return zero2nineteen[ number ];
} else if ( number % 10 == 0 ) {
// 20, 30, 40, ... 90
return .
When RV Meets CEP (RV 2016 Tutorial)
This presentation is an introduction to Complex Event Processing (CEP) intended for an practicioners of Runtime Verification. It first describes typical CEP problems, popular tools and their query languages. It then presents BeepBeep 3, an event stream processor that attempts to bridge the gap between RV and CEP. Thanks to BeepBeep’s generic architecture and flexible input language, queries and properties from both fields can be efficiently processed.
Objectives In this lab you will review passing arrays to methods and.pdf
Objectives In this lab you will review passing arrays to methods and partially filled arrays.
Requirements 1. Fill an array with data from an input file sampledata-io.txt (Attached) a.
Assume no more than 100 data items, terminated by -1 for sentinel b. Note that the sample data
file has other information after the sentinel; it should cause no problem c. Read and store data d.
Print the number of data stored in the array e. Add a method to reverse the array. Pass the
original array as the argument and return the reversed array. 2. Testing a. Invoke the reverse
method, print out the reversed array. 3. Inserting into the partially filled array a. Add a method to
insert a user inputted value into a specific location. b. Remember to check parameters for
validity. Also remember to check whether the array is full or not. c. Invoke the insert method,
prompt to user whether the insertion is successful or not. 4. Removing from the partially filled
array a. Add a method to remove the element at the specific location in the partially filled array.
b. Invoke the remove method, prompt to user whether the remove is successful or not. If the
remove is successful, print out the value of the element just removed. There are several
important points that are general requirements for labs in this course: Include a comment at the
beginning of each source file you submit that includes your name and the lab date. Names for
variables and other program components should be chosen to help convey the meaning of the
variable. Turn in an archive of the entire Eclipse project for each lab. Do not attempt to turn in
individual files, some course management systems mangle such files.
Solution
package myProject;
import java.util.*;
import java.io.File;
//Create a class Array Operation
public class ArrayOperation
{
//Initializes the counter to zero
int counter = 0;
//Method to read data from file
void readData(int numberArray[])
{
//File object created
File file = new File(\"D:/TODAY/src/myProject/data.txt\");
//Handles exception
try
{
//Scanner object created
Scanner scanner = new Scanner(file);
//Checks for the data availability
while(scanner.hasNextInt())
{
//Reads a number from the file
int no = scanner.nextInt();
//Checks if the number is -1 then stop reading
if(no == -1)
break;
//Stores the number in the array
numberArray[counter++] = no;
}//End of while
}//End of try
//Catch block
catch(Exception e)
{
e.printStackTrace();
}//End of catch
//Displays number of elements present in the array
System.out.println(\"Numbers of data stored in array = \" + counter);
}//End of method
//Method to display the array in reverse order
void displayReverse(int numberArray[])
{
System.out.println(\"Numbers in reverse order: \");
//Loops from end to beginning and displays the elements in reverse order
for(int i = counter - 1; i >= 0 ; i--)
System.out.print(numberArray[i] + \" \");
}
//Displays the contents of the array
void displayArray(int numberArray[])
{
//Loops from beginning to end a.
Implement a queue using a linkedlist (java)SolutionLinkedQueue.pdf
Implement a queue using a linkedlist (java)
Solution
LinkedQueueImplement.java
import java.util.*;
class Node
{
protected int data;
protected Node link;
public Node()
{
link = null;
data = 0;
}
public Node(int d,Node n)
{
data = d;
link = n;
}
public void setLink(Node n)
{
link = n;
}
public void setData(int d)
{
data = d;
}
public Node getLink()
{
return link;
}
public int getData()
{
return data;
}
}
class linkedQueue
{
protected Node front, rear;
public int size;
public linkedQueue()
{
front = null;
rear = null;
size = 0;
}
public boolean isEmpty()
{
return front == null;
}
public int getSize()
{
return size;
}
/* Function to insert an element to the queue */
public void insert(int data)
{
Node nptr = new Node(data, null);
if (rear == null)
{
front = nptr;
rear = nptr;
}
else
{
rear.setLink(nptr);
rear = rear.getLink();
}
size++ ;
}
/* Function to remove front element from the queue */
public int remove()
{
if (isEmpty() )
throw new NoSuchElementException(\"Underflow Exception\");
Node ptr = front;
front = ptr.getLink();
if (front == null)
rear = null;
size-- ;
return ptr.getData();
}
/* Function to check the front element of the queue */
public int peek()
{
if (isEmpty() )
throw new NoSuchElementException(\"Underflow Exception\");
return front.getData();
}
/* Function to display the status of the queue */
public void display()
{
System.out.print(\"\ Queue = \");
if (size == 0)
{
System.out.print(\"Empty\ \");
return ;
}
Node ptr = front;
while (ptr != rear.getLink() )
{
System.out.print(ptr.getData()+\" \");
ptr = ptr.getLink();
}
System.out.println();
}
}
/* Class LinkedQueueImplement */
public class LinkedQueueImplement
{
public static void main(String[] args)
{
Scanner scan = new Scanner(System.in);
/* Creating object of class linkedQueue */
linkedQueue lq = new linkedQueue();
/* Perform Queue Operations */
System.out.println(\"Linked Queue Test\ \");
char ch;
do
{
System.out.println(\"\ Queue Operations\");
System.out.println(\"1. insert\");
System.out.println(\"2. remove\");
System.out.println(\"3. peek\");
System.out.println(\"4. check empty\");
System.out.println(\"5. size\");
int choice = scan.nextInt();
switch (choice)
{
case 1 :
System.out.println(\"Enter integer element to insert\");
lq.insert( scan.nextInt() );
break;
case 2 :
try
{
System.out.println(\"Removed Element = \"+ lq.remove());
}
catch (Exception e)
{
System.out.println(\"Error : \" + e.getMessage());
}
break;
case 3 :
try
{
System.out.println(\"Peek Element = \"+ lq.peek());
}
catch (Exception e)
{
System.out.println(\"Error : \" + e.getMessage());
}
break;
case 4 :
System.out.println(\"Empty status = \"+ lq.isEmpty());
break;
case 5 :
System.out.println(\"Size = \"+ lq.getSize());
break;
default :
System.out.println(\"Wrong Entry \ \");
break;
}
/* display queue */
lq.display();
System.out.println(\"\ Do you want to continue (Type y or n) \ \");
ch = scan.next().charAt(0);
} while (ch == \'Y\'|| ch == \'y\');
}
}
Output :
Linked Queue Test
Queue Operations
1. inse.
Java questionI am having issues returning the score sort in numeri.pdf
Java question
I am having issues returning the score sort in numerical order for more than 2 entries. I had to
develop an enhancement which allowed the application to sort the list by score. The easiest
solution is probably to create a second student class (perhaps called StudentScore) that
implements the IComparable interface to sort by score rather than by name
StudentSortApp
import java.util.*;
public class StudentSortApp
{
public static void main(String[] args)
{
System.out.println(\"Welcome to the Student Scores Application.\"+\"\ \");
Scanner sc = new Scanner(System.in);
System.out.print(\"Enter number of students to enter: \");
int numberofStudents = sc.nextInt();
//arrays storing student name and score
Student[] students = new Student[numberofStudents];
StudentScore [] studentScores = new StudentScore [numberofStudents];
int t = 0;
for (int i = 0; i < numberofStudents; i++)
{
System.out.println(\"\");
String studentLastName = Validator.lastName(sc, \"Student \" + (i+1) + \" Last name: \");
String studentFirstName = Validator.lastName(sc, \"Student \" + (i+1) + \" First name: \");
int studentScore = Validator.validScore(sc, \"Student \" + (i+1) + \" score : \");
students [t] = new Student(studentFirstName, studentLastName , studentScore);
studentScores [t] = new StudentScore(studentFirstName, studentLastName , studentScore);
t = t + 1;
}
//output
System.out.println(\"\");
System.out.println(\"Last Name Sort\");
Arrays.sort(students, 0, numberofStudents);
for(Student i: students)
System.out.println(i.getlastName()+\", \"+i.getfirstName()+\": \"+i.getScore());
System.out.println();
System.out.println(\"Score Sort\");
Arrays.sort(studentScores, 0, numberofStudents);
for(StudentScore i: studentScores)
System.out.println(i.getlastName()+\", \"+i.getfirstName()+\": \"+i.getScore());
}
}
Validator Class
import java.util.Scanner;
public class Validator
{
public static int validScore(Scanner sc, String prompt)
{
int studentScore = 0;
boolean isValid = false;
while (isValid == false)
{
System.out.print (prompt);
studentScore = sc.nextInt();
if (studentScore > 100 || studentScore < 0)
{
System.out.println(\"Error! You have to enter a score between 0 and 100\");
}
else
{
isValid = true;
}
}
return studentScore;
}
public static String lastName(Scanner sc, String prompt)
{
Scanner input = new Scanner(System.in);
String StudentName = \"\";
boolean isvalid = false;
while (isvalid == false)
{
System.out.print (prompt);
StudentName = input.nextLine();
if (StudentName == null || StudentName.equals(\"\"))
{
System.out.println(\"Error! You have to enter a name.\");
}
else
{
isvalid = true;
}
}
return StudentName;
}
}
Student Class
public class Student implements Comparable
{
private String firstName = \"\";
private String lastName = \"\";
private int score = 0;
// Student Class constructor
public Student(String firstName, String lastName, int score)
{
this.firstName = firstName;
this.lastName = lastName;
this.score = score;
}
@Override
public int compareTo.
java compilerCompiler1.javajava compilerCompiler1.javaimport.docx
java compiler/Compiler1.javajava compiler/Compiler1.java
import org.antlr.runtime.ANTLRStringStream;
import org.antlr.runtime.CharStream;
import org.antlr.runtime.CommonTokenStream;
import org.antlr.runtime.RecognitionException;
import org.antlr.runtime.TokenStream;
publicclassTest1{
publicstaticvoid main(String[] args)throwsRecognitionException{
CharStream stream =
newANTLRStringStream("program XLSample1 =\r\n"+
"/*\r\n"+
" constant one : Integer := 1;\r\n"+
" constant two : Integer := 2 * 3;\r\n"+
" var x, y, z : Integer := 42;\r\n"+
"*/\r\n"+
"\r\n"+
" procedure foo() =\r\n"+
" var x : Integer := 2;\r\n"+
" begin\r\n"+
" end foo.\r\n"+
" procedure fee(y : Integer) =\r\n"+
" var x : Integer := 2;\r\n"+
" begin\r\n"+
" end fee.\r\n"+
" function fie(y : Integer) : Integer =\r\n"+
" var x : Integer := 2;\r\n"+
" begin\r\n"+
" return y;\r\n"+
" end fie.\r\n"+
"begin\r\n"+
"end XLSample1.");
SampleLexer lexer =newSampleLexer(stream);
TokenStream tokenStream =newCommonTokenStream(lexer);
SampleParser parser =newSampleParser(tokenStream);
parser.program();
System.out.println("ok");
}
}
java compiler/Compiler2.javajava compiler/Compiler2.java
import org.antlr.runtime.ANTLRStringStream;
import org.antlr.runtime.CharStream;
import org.antlr.runtime.CommonTokenStream;
import org.antlr.runtime.RecognitionException;
import org.antlr.runtime.TokenStream;
publicclassTest2{
publicstaticvoid main(String[] args)throwsRecognitionException{
CharStream stream =
newANTLRStringStream("3 * (2 + 4) * 3");
Sample2Lexer lexer =newSample2Lexer(stream);
TokenStream tokenStream =newCommonTokenStream(lexer);
Sample2Parser parser =newSample2Parser(tokenStream);
int result = parser.evaluator();
System.out.println("ok - result is "+ result);
}
}
java compiler/src1.g4
grammar scr1;
options {
language = Java;
}
@header {
package a.b.c;
}
@lexer::header {
package a.b.c;
}
program
: 'program' IDENT '='
(constant | variable | function | procedure | typeDecl)*
'begin'
statement*
'end' IDENT '.'
;
constant
: 'constant' IDENT ':' type ':=' expression ';'
;
variable
: 'var' IDENT (',' IDENT)* ':' type (':=' expression)? ';'
;
type
: 'Integer'
| 'Boolean'
| 'String'
| 'Char'
| IDENT
| typeSpec
;
typeDecl
: 'type' IDENT '=' typeSpec ';'
;
typeSpec
: arrayType
| recordType
| enumType
;
arrayType
: 'array' '[' INTEGER '..' INTEGER ']' 'of' type
;
recordType
: 'record' field* 'end' 'record'
;
field
: IDENT ':' type ';'
;
enumType
: '<' IDENT (',' IDENT)* '>'
;
statement
: assignmentStatement
| ifStatement
| loopStatement
| whileStatement
| procedureCallStatement
;
procedureCallStatement
: IDENT '(' actualParameters? ')' ';'
;
actualParameters
: expression (',' expression)*
;
ifStatement
: 'if' expression 'then' statement+
('elsif' expression 'then' stateme ...
1 Part I written exercises.1. Using the Red-Black Tre.docx
1
Part I: written exercises.
1. Using the Red-Black Tree applet, you input the following numbers into the Red-Black tree, keep all red-black rules ( see the red-black rule on the bottom of the exercise ) either using color changes or rotation. The result graph should be height balance and red-black correct.
You need to follow the rules, randomly color change and rotation will result in zero credit even the result could be red-black correct.
Attach your results of screen shots for every question.
a. Insert 50, 70, 20, 90
b. Insert 50, 70, 20, 90, 99
c. Insert 50, 70, 20, 90, 80
d. Insert 50, 70, 20, 80, 60, 90, 75, 95
e. Insert 50, 70, 20, 90, 60, 55, 65, 68
Red-Black Rules
When inserting (or deleting) a new node, certain rules, which we call the red-black rules, must be followed. If they’re followed, the tree will be balanced. Let’s lookbriefly at these rules:
1. Every node is either red or black.
2. The root is always black.
3. If a node is red, its children must be black (although the converse isn’t necessarily true).
4. Every path from the root to a leaf, or to a null child, must contain the same
number of black nodes.
2. Given input {4371, 1323, 6173, 4199, 4344, 9679, 1989} and a hash function h(x) = x %10 (table size is 10), showing the resulting
a. Separate chaining hash table
b. Open addressing hash table using linear probing.
c. Open addressing hash table using quadratic probing.
d. Open addressing hash table with second hash function h2(x) = 7- (x %7)
3. Draw the figures to show steps how to convert the binary tree to a heap using the Heapify algorithm.
(
4
5
2
6
7
3
1
)
4. Using the diagrams (see the attached example of heap sort) to trace the action of heapsort on the list of 1, 7, 2, 6, 3, 5, 4, give every state of your tree such as finishing a heapify or removing the root.
Part II: programming exercise
Implement the PriorityQ class in the priorityQ.java program (Listing 4.6) using
a heap instead of an array. You should be able to use the Heap class in the
heap.java program (Listing 12.1) without modification. Make it a descending
queue (largest item is removed).
Listing 4.6
The priorityQ.java Program
// priorityQ.java
// demonstrates priority queue
// to run this program: C>java PriorityQApp
////////////////////////////////////////////////////////////////
class PriorityQ
{
// array in sorted order, from max at 0 to min at size-1
private int maxSize;
private long[] queArray;
private int nItems;
//-------------------------------------------------------------
public PriorityQ(int s) // constructor
{
maxSize = s;
queArray = new long[maxSize];
nItems = 0;
}
//-------------------------------------------------------------
public void insert(long item) // insert item
{
int j;
if(nItems==0) // if no items,
queArray[nItems++] = item; // insert at 0
else // if items,
{
for(j=nItems-1; j>=0; j--) // start at end,
{
if( item > queArray[j] ) // if new item larger,
queArray[j+1] = queArray[ ...
Im getting List Full when I try to add 2nd student.Driver..pdf
I\'m getting \'List Full\' when I try to add 2nd student.
//Driver.java
import java.util.Scanner;
public class Driver {
public static void main(String[] args) {
new Driver();
}
public Driver() {
Scanner input = new Scanner(System.in);
Student[] newStudent = new Student[3];
System.out.println(\"Select option below\");
System.out.println(\"\");
while(true) {
System.out.println(\"1: Add Student\");
System.out.println(\"2: Display Student\");
System.out.println(\"3: Exit\");
int userChoice = input.nextInt();
switch(userChoice) {
case 1:
addStudent(newStudent);
break;
case 2:
displayStudent(newStudent);
break;
case 3:
System.out.println(\"Exit\");
System.exit(3);
}
}
}
//Student[] newStudent = new Student[3];
//Flower[] flowerPack = new Flower[25];
private void addStudent(Student[] newStudent) {
Scanner input = new Scanner(System.in);
String FirstName, LastName;
double GPA;
System.out.print(\"Enter First Name: \");
FirstName = input.nextLine();
System.out.print(\"Enter Last Name: \");
LastName = input.nextLine();
System.out.print(\"Enter GPA: \");
GPA = input.nextDouble();
for(int i = 0; i < 3; i++) {
if(newStudent[i] == null) {
newStudent[i] = new Student(FirstName, LastName, GPA);
break;
} else if(newStudent[i] != null) {
System.out.println(\"List Full\");
break;
}
}
}
private void displayStudent(Student[] newStudent) {
int x = 0;
for(int i = 0; i < 3; i++) {
if(newStudent[i] != null)
System.out.println(newStudent[i].toString());
else
x++;
}
if(newStudent == null)
System.out.println(\"no record\");
}
}
//Student.java
import java.util.Scanner;
public class Student {
private String FirstName;
private String LastName;
private double GPA;
public Student(String FirstName, String LastName, double GPA) {
this.FirstName = FirstName;
this.LastName = LastName;
this.GPA = GPA;
}
public Student() {
}
public String getFirstName() {
return FirstName;
}
public void setFirstName(String FirstName) {
FirstName = FirstName;
}
public String getLastName() {
return LastName;
}
public void setLastName(String LastName) {
LastName = LastName;
}
public double getGPA() {
return GPA;
}
public void setGPA(double GPA) {
GPA = GPA;
}
public String toString() {
return \"First Name: \" + FirstName + \"\ Last Name: \" + LastName
+ \"\ GPA: \" + GPA;
}
}
Solution
Note
This application will adds only 3 students data.And Dislpay those 3 students data.
I just modified some code which rectifies your problem.Thank You
___________________
Driver.java
import java.util.Scanner;
public class Driver {
public static void main(String[] args) {
new Driver();
}
public Driver() {
Scanner input = new Scanner(System.in);
Student[] newStudent = new Student[3];
System.out.println(\"Select option below\");
System.out.println(\"\");
while(true) {
System.out.println(\"1: Add Student\");
System.out.println(\"2: Display Student\");
System.out.println(\"3: Exit\");
int userChoice = input.nextInt();
switch(userChoice) {
case 1:
addStudent(newStudent);
break;
case 2:
displayStudent(newStudent);
break;
case.
srcArtifact.javasrcArtifact.javaclassArtifactextendsCave{pub.docx
src/Artifact.javasrc/Artifact.javaclassArtifactextendsCave{
publicint creatureIndex =0;
publicArtifact(int index,String type,int creatureIndex){
super(type, index);
this.creatureIndex = creatureIndex;
}
@Override
publicString toString(){
// Return neater output of the class data
return"[Artifact]: \n\tOwner Index = "
+Integer.toString(this.creatureIndex)
+" \n\tArtifact Type = "+this.type;
}
}
src/Cave.javasrc/Cave.javapublicclassCave{
publicint index =0;
publicString type =null;
publicString name =null;
/***
* Constructor
* @param index
*/
publicCave(int index){
this.index = index;
}
publicCave(int index,String type,String name){
this.index = index;
this.type = type;
this.name = name;
}
publicCave(int index,String name){
this.index = index;
this.name = name;
}
publicCave(String type,int index){
this.index = index;
this.type = type;
}
}
src/Creature.javasrc/Creature.javaimport java.awt.BorderLayout;
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;
import java.util.ArrayList;
import javax.swing.JButton;
import javax.swing.JFrame;
import javax.swing.JLabel;
import javax.swing.JOptionPane;
import javax.swing.JPanel;
import javax.swing.JProgressBar;
classCreatureextendsCaveimplementsActionListener,Runnable{
publicint partyIndex =0;
publicint empathyValue;
publicint fearValue;
publicdouble carryingCapacity;
publicint age;
publicint weight;
publicdouble height;
publicArrayList<Treasure> treasures =newArrayList<Treasure>();
publicArrayList<Artifact> artifacts =newArrayList<Artifact>();
publicArrayList<Jobs> jobs =newArrayList<Jobs>();
publiclong jobTime =0;
publicJobs currentJob =null;
publicvolatileboolean runJob =false;
publicvolatileboolean cancelJob =false;
JButton cancelButton =newJButton("Cancel Job");
JButton startButton =newJButton("Start Job");
publicCreature(int index,String type,String name,int partyIndex,
int empathyValue,int fearValue,double carryingCapacity){
super(index, type, name);
this.partyIndex = partyIndex;
this.empathyValue = empathyValue;
this.fearValue = fearValue;
this.carryingCapacity = carryingCapacity;
}
publicCreature(int index,String type,String name,int partyIndex,
int empathyValue,int fearValue,double carryingCapacity,int age,
int weight,double height){
super(index, type, name);
this.partyIndex = partyIndex;
this.empathyValue = empathyValue;
this.fearValue = fearValue;
this.carryingCapacity = carryingCapacity;
this.age = age;
this.weight = weight;
this.height = height;
}
publicvoid addTreature(Treasure t){
if(t !=null&& t instanceofTreasure&& t.creatureIndex !=0){
this.treasures.add(t);
}
}
publicvoid addArtifact(Artifact a){
if(a !=null&& a instanceofArtifact&& a.creatureIndex !=0){
this.artifacts.add(a);
}
}
@Override
publicString toString(){
String output ="";
output +="[Creature]: \n\tType = "+this.type +" \n\tName = "
+this.name +" \n\tParty Index = "
+Integer.toString(this.partyIndex)+" \n\tEmpathy Value = "
+Integer.toString(this.empathyV.
All fungi have tiny tube-like structures call hyphae. One is labeled .pdf
All fungi have tiny tube-like structures call hyphae. One is labeled within the collection. What
do you think these structures do for the fungi?
Solution
Answer:
Hyphae is a long, branching, filamentous structure of a fungus, it contain the cytoplasm or cell
sap, including the nuclei containing genetic material.
-absorb nutrients from the environment and transport them to other parts of the thallus
- hyphae represents the vegetative stage of fungi..
15. Let’s say you are systems administrator for a hospital’s network.pdf
15. Let’s say you are systems administrator for a hospital’s network. Keep in mind that as system
administrator, your job is to provide the correct level of accessibility to authorized users while
denying access to those who lack authorization. What are the top five policies that you would
implement? How would you enforce compliance with these policies? How would you educate
your users to convince them to adhere to your policies?
Solution
The policies that system administrator use to provide the correct level of accessibility to
authorized users while denying access to unauthorized users are-
1. Using antivirus software and running them regularly to protect systems from attack by
malicious softwares.
2. Using firewalls to maintain access control based on sender\'s and reciever\'s ip addresses.
3. By providing Login system policy to ensure authorized access to system by individuals (using
login ID and passwords).
4. Using high level encryption techniques to secure access of information on transit between two
users.
5. By monitoring network communication.
These policies can be enforced by system administrator by using distributed operating system.
Because DO/S works on the property of global control of all assets.
Users can be provided with individual login and password as unauthorized access may lead to
breach in security of hospital\'s information. As security breach in Hospital\'s information may
lead to adverse effects like- breach in information of patients, their diseases, medicines
prescribed and many more..
What would the predicted result be if Griffith injected mice with a .pdf
What would the predicted result be if Griffith injected mice with a mixture of heat-killed R
bacteria and living S bacteria?
a. All mice would live, but only if DNAse was added to the mixture prior to injection
b. All mice would die.
c. All mice would live.
d. All mice would die, but only if DNAse was added to the mixture prior to injection.
Solution
Griffith’s Experiment-A Quick Review: Fredrick Griffith, an English physician, first reported
transformation of one strain of Streptococcus pneumoniae into other strain in 1928. The bacteria
cause pneumonia. A strain of this bacterium produces capsule and gives a smooth, shiny colony
on culture media, thus called S-strain (smooth strain). The S-strain exhibits pathogenicity in
laboratory mice. Another strain without capsule produces rough and coarse colony on culture
medium, thus called R-strain (rough strain). The R-strain is avirulent (non-pathogenic).
Mice injected with
Outcome
1
Live S-strain (virulent)
Pneumonia mice dead
2
Live R-strain (avirulent)
No pneumonia mice alive
3
Heat killed S-strain + live R-strain
Pneumonia mice dead
When injected with live S-strain bacteria, mice developed pneumonia and died. When injected
with live R-strain bacteria, mice did not develop pneumonia and survived. When heat killed S-
strain injected to mice, they remain unaffected. However, when heat killed S-strain bacteria
mixed with live R-strain injected to mice, they developed pneumonia and died. He was also able
to isolate and culture S-strain bacteria from affected mice. Since heat killed bacteria could have
no way been revived, he concluded that some molecules from heat killed S-strain had
transformed the R-strain into S-train.
Now,
The Current Perspective: Presence of living S-strain causes pneumonia development in mice
killing them at last. It is noteworthy that transformation of R-strain into S-strain occurs only
when there is alive R-strain and fragments of DNA from heat-killed S-strain.
Option A: Incorrect. DNAse is a large protein incapable of entering into bacterial cytoplasm
through bacterial membrane of living S-strain. So, this treatment further cleaves DNA fragments
of heat killed R-strain BUT leaves the S-strain unaffected. So, injecting the mixture to mice kills
them as live S-strain causes pneumonia.
Option B: Correct. Presence of living S-strain causes pneumonia development in mice killing
them at last.
Option C: Incorrect. All mice die because S-strain cause pneumonia to them.
Option D: Incorrect. All mice would die, BUT NOT because of addition of DNAse to the
mixture. As mentioned in option A explanation, DNAse does not penetrate into live S-strain,
thus leave them unaffected. Therefore, mice die irrespective of DNAse treatment.
Mice injected with
Outcome
1
Live S-strain (virulent)
Pneumonia mice dead
2
Live R-strain (avirulent)
No pneumonia mice alive
3
Heat killed S-strain + live R-strain
Pneumonia mice dead.
Write a function called myfind that will search for a key in a vecto.pdf
Write a function called myfind that will search for a key in a vector and return the indices of all
occurrences of the key, like the built-in find function. It will receive two arguments— the vector
and the key—and will return a vector of indices or the empty vector [ ] if the key is not found.
The function will be invoked as follows:
idx = myfind(vec, key);
Following is an example of correct function behavior:
>> vec = randi([5, 10], 1, 10)
vec = 5 10 10 7 9 5 7 10 9 10
>> key = 10;
>> idx = myfind(vec, key)
idx = 2 3 8 10
>> key = 2;
>> idx = myfind(vec, key)
idx = Empty matrix: 1-by-0
Do not use the in-built find function.
Solution
% matlab code find all index of key in vector
function idx = myfind(vec, key)
index = 1;
for i=1:length(vec)
if vec(i) == key
idx(index) = i;
index = index + 1;
end
end
end
vec = randi([5, 10], 1, 10);
disp(\"Vector: \");
disp(vec);
key = 10;
fprintf(\"\ Key: %d\ \",key);
idx = myfind(vec, key);
disp(\"\ Index: \");
disp(idx);
%{
sample output:
Vector:
10 10 8 10 5 10 5 8 9 5
Key: 10
Index:
1 2 4 6
%}.
More Related Content
Similar to package lab7; import java.util.Scanner; Sammy Student, Program.pdf
Dat testing - An introduction to Java and Android Testing
Testing is a part of software engineering process. You wouldn't promote a code you haven't tested to production, so why don't you use automated testing and actually reduce costs and increase the efficiency?
You can also learn how doing testing can put pressure on your code to improve your architecture.
A Case for "Piggyback" Runtime Monitoring
A runtime monitor enforcing a constraint on sequences of method calls on an object must keep track of the state of the sequence by updating an appropriate state machine. The present paper stems from the observation that an object's member fields must already contain an encoding of that state machine, and that a monitor essentially duplicates operations that the object performs internally. Rather than maintain a state machine in parallel, the paper puts forward the concept of "piggyback" runtime monitoring, where the monitor relies as much as possible on the object's own state variables to perform its task. Experiments on real-world benchmarks show that this approach greatly simplifies the monitoring process and drastically reduces the incurred runtime overhead compared to classical solutions.
(C++) Change the following program so that it uses a dynamic array i.pdf
(C++) Change the following program so that it uses a dynamic array instead of a static one. Test
it with sequence_exam2.cpp.
sequence1.cpp
#include \"sequence1.h\"
#include
#include
namespace sequencelab
{
sequence::sequence()
{
used = 0;
current_index = 0;
}
void sequence::start()
{
if (used > 0)
{
current_index = 0;
}
else
{
current_index = used;
}
}
void sequence::advance()
{
if (is_item())
{
current_index++;
}
else
{
std::cout << \"Nothing here!\" << std::endl;
}
}
void sequence::insert(const value_type& figure)
{
if (size() < CAPACITY)
{
if (!is_item())
{
start();
}
for (size_t i = used; i > current_index; i--)
{
data[i] = data[i-1];
}
data[current_index] = figure;
used++;
}
else
{
std::cout << \"Did not insert, size is larger/equal to the capacity.\" << std::endl;
}
}
void sequence::attach(const value_type& figure)
{
if (size() < CAPACITY)
{
if (is_item())
{
for (size_t i = used; i > current_index + 1; i--)
{
data[i] = data[i-1];
}
data[current_index + 1] = figure;
current_index++;
used++;
}
else
{
data[used] = figure;
current_index = used;
used++;
}
}
else
{
std::cout << \"Did not attach, size is larger/equal to the capacity.\" << std::endl;
}
}
void sequence::remove_current()
{
if (is_item())
{
for (size_t i = current_index; i < used; i++)
{
data[i] = data[i+1];
}
used--;
}
else
{
std::cout << \"Nothing here!\" << std::endl;
}
}
sequence::size_type sequence::size() const
{
return used;
}
bool sequence::is_item() const
{
return ((current_index >= 0) && (current_index < used) && (used != 0));
}
sequence::value_type sequence::current() const
{
if (is_item())
{
return data[current_index];
}
else
{
std::cout << \"Nothing here!\" << std::endl;
}
}
}
----------------------------------------------------------------------------------
sequence1.h
#ifndef MAIN_SAVITCH_SEQUENCE_H
#define MAIN_SAVITCH_SEQUENCE_H
#include
namespace sequencelab
{
class sequence
{
public:
typedef double value_type;
typedef std::size_t size_type;
static const size_type CAPACITY = 30;
sequence( );
void insert(const value_type& figure);
void attach(const value_type& figure);
void start( );
void advance( );
void remove_current( );
value_type current( ) const;
size_type size( ) const;
bool is_item( ) const;
private:
value_type data[CAPACITY];
size_type used;
size_type current_index;
};
}
#endif
------------------------------------------------------------------------------------
sequence_exam2.cpp
#include // Provides cout.
#include // Provides memcpy.
#include // Provides size_t.
#include \"sequence2.h\" // Provides the Sequence class with double items.
using namespace std;
using namespace main_savitch_4;
// Descriptions and points for each of the tests:
const size_t MANY_TESTS = 7;
const int POINTS[MANY_TESTS+1] = {
21, // Total points for all tests.
4, // Test 1 points
4, // Test 2 points
4, // Test 3 points
2, // Test 4 points
2, // Test 5 points
2, // Test 6 points
3 // Test 7 points
};
const char DESCRIPTION[MANY_TESTS+1][256] = {
\"tests for sequence class with a dy.
I Have the following Java program in which converts Date to Words an.pdf
I Have the following Java program in which converts Date to Words and the only thing I have to
do now is add a boolean for a leap year. ( I am using Apache NetBeans) please explain where the
boolean goes.
Like this:
I need the code working with the boolean added, Thank you!!!
package a1_demo;
import java.util.Scanner;
public class MainApp {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.print("Welcome to the Date to Words Converter!\n\n");
while ( true ) {
// get user input
String str_MM_DD_YYYY = Validator.getString(
Validator.sc,
"Enter date in MM/DD/YYYY format: "
);
// convert text to ints:
// "11/22/3333" - > int, int int
String[] dateComponents = str_MM_DD_YYYY.split( "/" );
if ( dateComponents.length != 3 ) {
System.out.println("\t\t Bad input, please retry...");
continue;
}
int month = 0;
int day = 0;
int year = 0;
try {
month = Integer.parseInt(dateComponents[ 0 ]);
day = Integer.parseInt(dateComponents[ 1 ]);
year = Integer.parseInt(dateComponents[ 2 ]);
} catch ( java.lang.NumberFormatException ex ) {
System.out.println("\t\t numeric values are expected, please retry...");
continue;
}
Date2TextConverter converter = new Date2TextConverter( month, day, year );
System.out.print( converter.month2text() );
System.out.print( " " );
System.out.print( converter.day2text() );
System.out.print( " " );
System.out.print( converter.year2text() );
System.out.println();
}// endless while loop
}//main
}//class MainApp
package a1_demo;
public class Date2TextConverter {
//---------------------------------------
// data
//---------------------------------------
int month = 0;
int day = 0;
int year = 0;
//---------------------------------------
// constructors
//---------------------------------------
public Date2TextConverter(int month, int day, int year )
{
this.month = month;
this.day = day;
this.year = year;
}//Date2TextConverter
//---------------------------------------
// operations
//---------------------------------------
public String month2text()
{
switch( month )
{
case 1: return "Jan";
case 2: return "Feb";
case 3: return "Mar";
case 4: return"April";
case 5: return"May";
case 6: return"June";
case 7: return"July";
case 8: return"Aug";
case 9: return"Sep";
case 10: return"Oct";
case 11: return"Nov";
case 12: return"Dec";
//...
default:
return "Invalid Month";
}
}//month2text
public String day2text()
{
//return Integer.toString( day );
return number2words (day);
}//day2text
public String year2text()
{
int century = year / 100;
int yearInCentury = year % 100;
String centuryText = number2words( century );
String yearText = number2words( yearInCentury );
if ( yearInCentury < 10 ) {
return centuryText + " zero " + yearText;
} else {
return centuryText + " " + yearText;
}
}//year2text
private String number2words( int number ) {
// convert to text a number 0 through 99
if ( number < 20 ) {
// 0, 1, 2, 3, ..., 19
return zero2nineteen[ number ];
} else if ( number % 10 == 0 ) {
// 20, 30, 40, ... 90
return .
When RV Meets CEP (RV 2016 Tutorial)
This presentation is an introduction to Complex Event Processing (CEP) intended for an practicioners of Runtime Verification. It first describes typical CEP problems, popular tools and their query languages. It then presents BeepBeep 3, an event stream processor that attempts to bridge the gap between RV and CEP. Thanks to BeepBeep’s generic architecture and flexible input language, queries and properties from both fields can be efficiently processed.
Objectives In this lab you will review passing arrays to methods and.pdf
Objectives In this lab you will review passing arrays to methods and partially filled arrays.
Requirements 1. Fill an array with data from an input file sampledata-io.txt (Attached) a.
Assume no more than 100 data items, terminated by -1 for sentinel b. Note that the sample data
file has other information after the sentinel; it should cause no problem c. Read and store data d.
Print the number of data stored in the array e. Add a method to reverse the array. Pass the
original array as the argument and return the reversed array. 2. Testing a. Invoke the reverse
method, print out the reversed array. 3. Inserting into the partially filled array a. Add a method to
insert a user inputted value into a specific location. b. Remember to check parameters for
validity. Also remember to check whether the array is full or not. c. Invoke the insert method,
prompt to user whether the insertion is successful or not. 4. Removing from the partially filled
array a. Add a method to remove the element at the specific location in the partially filled array.
b. Invoke the remove method, prompt to user whether the remove is successful or not. If the
remove is successful, print out the value of the element just removed. There are several
important points that are general requirements for labs in this course: Include a comment at the
beginning of each source file you submit that includes your name and the lab date. Names for
variables and other program components should be chosen to help convey the meaning of the
variable. Turn in an archive of the entire Eclipse project for each lab. Do not attempt to turn in
individual files, some course management systems mangle such files.
Solution
package myProject;
import java.util.*;
import java.io.File;
//Create a class Array Operation
public class ArrayOperation
{
//Initializes the counter to zero
int counter = 0;
//Method to read data from file
void readData(int numberArray[])
{
//File object created
File file = new File(\"D:/TODAY/src/myProject/data.txt\");
//Handles exception
try
{
//Scanner object created
Scanner scanner = new Scanner(file);
//Checks for the data availability
while(scanner.hasNextInt())
{
//Reads a number from the file
int no = scanner.nextInt();
//Checks if the number is -1 then stop reading
if(no == -1)
break;
//Stores the number in the array
numberArray[counter++] = no;
}//End of while
}//End of try
//Catch block
catch(Exception e)
{
e.printStackTrace();
}//End of catch
//Displays number of elements present in the array
System.out.println(\"Numbers of data stored in array = \" + counter);
}//End of method
//Method to display the array in reverse order
void displayReverse(int numberArray[])
{
System.out.println(\"Numbers in reverse order: \");
//Loops from end to beginning and displays the elements in reverse order
for(int i = counter - 1; i >= 0 ; i--)
System.out.print(numberArray[i] + \" \");
}
//Displays the contents of the array
void displayArray(int numberArray[])
{
//Loops from beginning to end a.
Implement a queue using a linkedlist (java)SolutionLinkedQueue.pdf
Implement a queue using a linkedlist (java)
Solution
LinkedQueueImplement.java
import java.util.*;
class Node
{
protected int data;
protected Node link;
public Node()
{
link = null;
data = 0;
}
public Node(int d,Node n)
{
data = d;
link = n;
}
public void setLink(Node n)
{
link = n;
}
public void setData(int d)
{
data = d;
}
public Node getLink()
{
return link;
}
public int getData()
{
return data;
}
}
class linkedQueue
{
protected Node front, rear;
public int size;
public linkedQueue()
{
front = null;
rear = null;
size = 0;
}
public boolean isEmpty()
{
return front == null;
}
public int getSize()
{
return size;
}
/* Function to insert an element to the queue */
public void insert(int data)
{
Node nptr = new Node(data, null);
if (rear == null)
{
front = nptr;
rear = nptr;
}
else
{
rear.setLink(nptr);
rear = rear.getLink();
}
size++ ;
}
/* Function to remove front element from the queue */
public int remove()
{
if (isEmpty() )
throw new NoSuchElementException(\"Underflow Exception\");
Node ptr = front;
front = ptr.getLink();
if (front == null)
rear = null;
size-- ;
return ptr.getData();
}
/* Function to check the front element of the queue */
public int peek()
{
if (isEmpty() )
throw new NoSuchElementException(\"Underflow Exception\");
return front.getData();
}
/* Function to display the status of the queue */
public void display()
{
System.out.print(\"\ Queue = \");
if (size == 0)
{
System.out.print(\"Empty\ \");
return ;
}
Node ptr = front;
while (ptr != rear.getLink() )
{
System.out.print(ptr.getData()+\" \");
ptr = ptr.getLink();
}
System.out.println();
}
}
/* Class LinkedQueueImplement */
public class LinkedQueueImplement
{
public static void main(String[] args)
{
Scanner scan = new Scanner(System.in);
/* Creating object of class linkedQueue */
linkedQueue lq = new linkedQueue();
/* Perform Queue Operations */
System.out.println(\"Linked Queue Test\ \");
char ch;
do
{
System.out.println(\"\ Queue Operations\");
System.out.println(\"1. insert\");
System.out.println(\"2. remove\");
System.out.println(\"3. peek\");
System.out.println(\"4. check empty\");
System.out.println(\"5. size\");
int choice = scan.nextInt();
switch (choice)
{
case 1 :
System.out.println(\"Enter integer element to insert\");
lq.insert( scan.nextInt() );
break;
case 2 :
try
{
System.out.println(\"Removed Element = \"+ lq.remove());
}
catch (Exception e)
{
System.out.println(\"Error : \" + e.getMessage());
}
break;
case 3 :
try
{
System.out.println(\"Peek Element = \"+ lq.peek());
}
catch (Exception e)
{
System.out.println(\"Error : \" + e.getMessage());
}
break;
case 4 :
System.out.println(\"Empty status = \"+ lq.isEmpty());
break;
case 5 :
System.out.println(\"Size = \"+ lq.getSize());
break;
default :
System.out.println(\"Wrong Entry \ \");
break;
}
/* display queue */
lq.display();
System.out.println(\"\ Do you want to continue (Type y or n) \ \");
ch = scan.next().charAt(0);
} while (ch == \'Y\'|| ch == \'y\');
}
}
Output :
Linked Queue Test
Queue Operations
1. inse.
Java questionI am having issues returning the score sort in numeri.pdf
Java question
I am having issues returning the score sort in numerical order for more than 2 entries. I had to
develop an enhancement which allowed the application to sort the list by score. The easiest
solution is probably to create a second student class (perhaps called StudentScore) that
implements the IComparable interface to sort by score rather than by name
StudentSortApp
import java.util.*;
public class StudentSortApp
{
public static void main(String[] args)
{
System.out.println(\"Welcome to the Student Scores Application.\"+\"\ \");
Scanner sc = new Scanner(System.in);
System.out.print(\"Enter number of students to enter: \");
int numberofStudents = sc.nextInt();
//arrays storing student name and score
Student[] students = new Student[numberofStudents];
StudentScore [] studentScores = new StudentScore [numberofStudents];
int t = 0;
for (int i = 0; i < numberofStudents; i++)
{
System.out.println(\"\");
String studentLastName = Validator.lastName(sc, \"Student \" + (i+1) + \" Last name: \");
String studentFirstName = Validator.lastName(sc, \"Student \" + (i+1) + \" First name: \");
int studentScore = Validator.validScore(sc, \"Student \" + (i+1) + \" score : \");
students [t] = new Student(studentFirstName, studentLastName , studentScore);
studentScores [t] = new StudentScore(studentFirstName, studentLastName , studentScore);
t = t + 1;
}
//output
System.out.println(\"\");
System.out.println(\"Last Name Sort\");
Arrays.sort(students, 0, numberofStudents);
for(Student i: students)
System.out.println(i.getlastName()+\", \"+i.getfirstName()+\": \"+i.getScore());
System.out.println();
System.out.println(\"Score Sort\");
Arrays.sort(studentScores, 0, numberofStudents);
for(StudentScore i: studentScores)
System.out.println(i.getlastName()+\", \"+i.getfirstName()+\": \"+i.getScore());
}
}
Validator Class
import java.util.Scanner;
public class Validator
{
public static int validScore(Scanner sc, String prompt)
{
int studentScore = 0;
boolean isValid = false;
while (isValid == false)
{
System.out.print (prompt);
studentScore = sc.nextInt();
if (studentScore > 100 || studentScore < 0)
{
System.out.println(\"Error! You have to enter a score between 0 and 100\");
}
else
{
isValid = true;
}
}
return studentScore;
}
public static String lastName(Scanner sc, String prompt)
{
Scanner input = new Scanner(System.in);
String StudentName = \"\";
boolean isvalid = false;
while (isvalid == false)
{
System.out.print (prompt);
StudentName = input.nextLine();
if (StudentName == null || StudentName.equals(\"\"))
{
System.out.println(\"Error! You have to enter a name.\");
}
else
{
isvalid = true;
}
}
return StudentName;
}
}
Student Class
public class Student implements Comparable
{
private String firstName = \"\";
private String lastName = \"\";
private int score = 0;
// Student Class constructor
public Student(String firstName, String lastName, int score)
{
this.firstName = firstName;
this.lastName = lastName;
this.score = score;
}
@Override
public int compareTo.
java compilerCompiler1.javajava compilerCompiler1.javaimport.docx
java compiler/Compiler1.javajava compiler/Compiler1.java
import org.antlr.runtime.ANTLRStringStream;
import org.antlr.runtime.CharStream;
import org.antlr.runtime.CommonTokenStream;
import org.antlr.runtime.RecognitionException;
import org.antlr.runtime.TokenStream;
publicclassTest1{
publicstaticvoid main(String[] args)throwsRecognitionException{
CharStream stream =
newANTLRStringStream("program XLSample1 =\r\n"+
"/*\r\n"+
" constant one : Integer := 1;\r\n"+
" constant two : Integer := 2 * 3;\r\n"+
" var x, y, z : Integer := 42;\r\n"+
"*/\r\n"+
"\r\n"+
" procedure foo() =\r\n"+
" var x : Integer := 2;\r\n"+
" begin\r\n"+
" end foo.\r\n"+
" procedure fee(y : Integer) =\r\n"+
" var x : Integer := 2;\r\n"+
" begin\r\n"+
" end fee.\r\n"+
" function fie(y : Integer) : Integer =\r\n"+
" var x : Integer := 2;\r\n"+
" begin\r\n"+
" return y;\r\n"+
" end fie.\r\n"+
"begin\r\n"+
"end XLSample1.");
SampleLexer lexer =newSampleLexer(stream);
TokenStream tokenStream =newCommonTokenStream(lexer);
SampleParser parser =newSampleParser(tokenStream);
parser.program();
System.out.println("ok");
}
}
java compiler/Compiler2.javajava compiler/Compiler2.java
import org.antlr.runtime.ANTLRStringStream;
import org.antlr.runtime.CharStream;
import org.antlr.runtime.CommonTokenStream;
import org.antlr.runtime.RecognitionException;
import org.antlr.runtime.TokenStream;
publicclassTest2{
publicstaticvoid main(String[] args)throwsRecognitionException{
CharStream stream =
newANTLRStringStream("3 * (2 + 4) * 3");
Sample2Lexer lexer =newSample2Lexer(stream);
TokenStream tokenStream =newCommonTokenStream(lexer);
Sample2Parser parser =newSample2Parser(tokenStream);
int result = parser.evaluator();
System.out.println("ok - result is "+ result);
}
}
java compiler/src1.g4
grammar scr1;
options {
language = Java;
}
@header {
package a.b.c;
}
@lexer::header {
package a.b.c;
}
program
: 'program' IDENT '='
(constant | variable | function | procedure | typeDecl)*
'begin'
statement*
'end' IDENT '.'
;
constant
: 'constant' IDENT ':' type ':=' expression ';'
;
variable
: 'var' IDENT (',' IDENT)* ':' type (':=' expression)? ';'
;
type
: 'Integer'
| 'Boolean'
| 'String'
| 'Char'
| IDENT
| typeSpec
;
typeDecl
: 'type' IDENT '=' typeSpec ';'
;
typeSpec
: arrayType
| recordType
| enumType
;
arrayType
: 'array' '[' INTEGER '..' INTEGER ']' 'of' type
;
recordType
: 'record' field* 'end' 'record'
;
field
: IDENT ':' type ';'
;
enumType
: '<' IDENT (',' IDENT)* '>'
;
statement
: assignmentStatement
| ifStatement
| loopStatement
| whileStatement
| procedureCallStatement
;
procedureCallStatement
: IDENT '(' actualParameters? ')' ';'
;
actualParameters
: expression (',' expression)*
;
ifStatement
: 'if' expression 'then' statement+
('elsif' expression 'then' stateme ...
1 Part I written exercises.1. Using the Red-Black Tre.docx
1
Part I: written exercises.
1. Using the Red-Black Tree applet, you input the following numbers into the Red-Black tree, keep all red-black rules ( see the red-black rule on the bottom of the exercise ) either using color changes or rotation. The result graph should be height balance and red-black correct.
You need to follow the rules, randomly color change and rotation will result in zero credit even the result could be red-black correct.
Attach your results of screen shots for every question.
a. Insert 50, 70, 20, 90
b. Insert 50, 70, 20, 90, 99
c. Insert 50, 70, 20, 90, 80
d. Insert 50, 70, 20, 80, 60, 90, 75, 95
e. Insert 50, 70, 20, 90, 60, 55, 65, 68
Red-Black Rules
When inserting (or deleting) a new node, certain rules, which we call the red-black rules, must be followed. If they’re followed, the tree will be balanced. Let’s lookbriefly at these rules:
1. Every node is either red or black.
2. The root is always black.
3. If a node is red, its children must be black (although the converse isn’t necessarily true).
4. Every path from the root to a leaf, or to a null child, must contain the same
number of black nodes.
2. Given input {4371, 1323, 6173, 4199, 4344, 9679, 1989} and a hash function h(x) = x %10 (table size is 10), showing the resulting
a. Separate chaining hash table
b. Open addressing hash table using linear probing.
c. Open addressing hash table using quadratic probing.
d. Open addressing hash table with second hash function h2(x) = 7- (x %7)
3. Draw the figures to show steps how to convert the binary tree to a heap using the Heapify algorithm.
(
4
5
2
6
7
3
1
)
4. Using the diagrams (see the attached example of heap sort) to trace the action of heapsort on the list of 1, 7, 2, 6, 3, 5, 4, give every state of your tree such as finishing a heapify or removing the root.
Part II: programming exercise
Implement the PriorityQ class in the priorityQ.java program (Listing 4.6) using
a heap instead of an array. You should be able to use the Heap class in the
heap.java program (Listing 12.1) without modification. Make it a descending
queue (largest item is removed).
Listing 4.6
The priorityQ.java Program
// priorityQ.java
// demonstrates priority queue
// to run this program: C>java PriorityQApp
////////////////////////////////////////////////////////////////
class PriorityQ
{
// array in sorted order, from max at 0 to min at size-1
private int maxSize;
private long[] queArray;
private int nItems;
//-------------------------------------------------------------
public PriorityQ(int s) // constructor
{
maxSize = s;
queArray = new long[maxSize];
nItems = 0;
}
//-------------------------------------------------------------
public void insert(long item) // insert item
{
int j;
if(nItems==0) // if no items,
queArray[nItems++] = item; // insert at 0
else // if items,
{
for(j=nItems-1; j>=0; j--) // start at end,
{
if( item > queArray[j] ) // if new item larger,
queArray[j+1] = queArray[ ...
Im getting List Full when I try to add 2nd student.Driver..pdf
I\'m getting \'List Full\' when I try to add 2nd student.
//Driver.java
import java.util.Scanner;
public class Driver {
public static void main(String[] args) {
new Driver();
}
public Driver() {
Scanner input = new Scanner(System.in);
Student[] newStudent = new Student[3];
System.out.println(\"Select option below\");
System.out.println(\"\");
while(true) {
System.out.println(\"1: Add Student\");
System.out.println(\"2: Display Student\");
System.out.println(\"3: Exit\");
int userChoice = input.nextInt();
switch(userChoice) {
case 1:
addStudent(newStudent);
break;
case 2:
displayStudent(newStudent);
break;
case 3:
System.out.println(\"Exit\");
System.exit(3);
}
}
}
//Student[] newStudent = new Student[3];
//Flower[] flowerPack = new Flower[25];
private void addStudent(Student[] newStudent) {
Scanner input = new Scanner(System.in);
String FirstName, LastName;
double GPA;
System.out.print(\"Enter First Name: \");
FirstName = input.nextLine();
System.out.print(\"Enter Last Name: \");
LastName = input.nextLine();
System.out.print(\"Enter GPA: \");
GPA = input.nextDouble();
for(int i = 0; i < 3; i++) {
if(newStudent[i] == null) {
newStudent[i] = new Student(FirstName, LastName, GPA);
break;
} else if(newStudent[i] != null) {
System.out.println(\"List Full\");
break;
}
}
}
private void displayStudent(Student[] newStudent) {
int x = 0;
for(int i = 0; i < 3; i++) {
if(newStudent[i] != null)
System.out.println(newStudent[i].toString());
else
x++;
}
if(newStudent == null)
System.out.println(\"no record\");
}
}
//Student.java
import java.util.Scanner;
public class Student {
private String FirstName;
private String LastName;
private double GPA;
public Student(String FirstName, String LastName, double GPA) {
this.FirstName = FirstName;
this.LastName = LastName;
this.GPA = GPA;
}
public Student() {
}
public String getFirstName() {
return FirstName;
}
public void setFirstName(String FirstName) {
FirstName = FirstName;
}
public String getLastName() {
return LastName;
}
public void setLastName(String LastName) {
LastName = LastName;
}
public double getGPA() {
return GPA;
}
public void setGPA(double GPA) {
GPA = GPA;
}
public String toString() {
return \"First Name: \" + FirstName + \"\ Last Name: \" + LastName
+ \"\ GPA: \" + GPA;
}
}
Solution
Note
This application will adds only 3 students data.And Dislpay those 3 students data.
I just modified some code which rectifies your problem.Thank You
___________________
Driver.java
import java.util.Scanner;
public class Driver {
public static void main(String[] args) {
new Driver();
}
public Driver() {
Scanner input = new Scanner(System.in);
Student[] newStudent = new Student[3];
System.out.println(\"Select option below\");
System.out.println(\"\");
while(true) {
System.out.println(\"1: Add Student\");
System.out.println(\"2: Display Student\");
System.out.println(\"3: Exit\");
int userChoice = input.nextInt();
switch(userChoice) {
case 1:
addStudent(newStudent);
break;
case 2:
displayStudent(newStudent);
break;
case.
srcArtifact.javasrcArtifact.javaclassArtifactextendsCave{pub.docx
src/Artifact.javasrc/Artifact.javaclassArtifactextendsCave{
publicint creatureIndex =0;
publicArtifact(int index,String type,int creatureIndex){
super(type, index);
this.creatureIndex = creatureIndex;
}
@Override
publicString toString(){
// Return neater output of the class data
return"[Artifact]: \n\tOwner Index = "
+Integer.toString(this.creatureIndex)
+" \n\tArtifact Type = "+this.type;
}
}
src/Cave.javasrc/Cave.javapublicclassCave{
publicint index =0;
publicString type =null;
publicString name =null;
/***
* Constructor
* @param index
*/
publicCave(int index){
this.index = index;
}
publicCave(int index,String type,String name){
this.index = index;
this.type = type;
this.name = name;
}
publicCave(int index,String name){
this.index = index;
this.name = name;
}
publicCave(String type,int index){
this.index = index;
this.type = type;
}
}
src/Creature.javasrc/Creature.javaimport java.awt.BorderLayout;
import java.awt.event.ActionEvent;
import java.awt.event.ActionListener;
import java.util.ArrayList;
import javax.swing.JButton;
import javax.swing.JFrame;
import javax.swing.JLabel;
import javax.swing.JOptionPane;
import javax.swing.JPanel;
import javax.swing.JProgressBar;
classCreatureextendsCaveimplementsActionListener,Runnable{
publicint partyIndex =0;
publicint empathyValue;
publicint fearValue;
publicdouble carryingCapacity;
publicint age;
publicint weight;
publicdouble height;
publicArrayList<Treasure> treasures =newArrayList<Treasure>();
publicArrayList<Artifact> artifacts =newArrayList<Artifact>();
publicArrayList<Jobs> jobs =newArrayList<Jobs>();
publiclong jobTime =0;
publicJobs currentJob =null;
publicvolatileboolean runJob =false;
publicvolatileboolean cancelJob =false;
JButton cancelButton =newJButton("Cancel Job");
JButton startButton =newJButton("Start Job");
publicCreature(int index,String type,String name,int partyIndex,
int empathyValue,int fearValue,double carryingCapacity){
super(index, type, name);
this.partyIndex = partyIndex;
this.empathyValue = empathyValue;
this.fearValue = fearValue;
this.carryingCapacity = carryingCapacity;
}
publicCreature(int index,String type,String name,int partyIndex,
int empathyValue,int fearValue,double carryingCapacity,int age,
int weight,double height){
super(index, type, name);
this.partyIndex = partyIndex;
this.empathyValue = empathyValue;
this.fearValue = fearValue;
this.carryingCapacity = carryingCapacity;
this.age = age;
this.weight = weight;
this.height = height;
}
publicvoid addTreature(Treasure t){
if(t !=null&& t instanceofTreasure&& t.creatureIndex !=0){
this.treasures.add(t);
}
}
publicvoid addArtifact(Artifact a){
if(a !=null&& a instanceofArtifact&& a.creatureIndex !=0){
this.artifacts.add(a);
}
}
@Override
publicString toString(){
String output ="";
output +="[Creature]: \n\tType = "+this.type +" \n\tName = "
+this.name +" \n\tParty Index = "
+Integer.toString(this.partyIndex)+" \n\tEmpathy Value = "
+Integer.toString(this.empathyV.
Similar to package lab7; import java.util.Scanner; Sammy Student, Program.pdf (18)
Dat testing - An introduction to Java and Android Testing
Dat testing - An introduction to Java and Android Testing
(C++) Change the following program so that it uses a dynamic array i.pdf
(C++) Change the following program so that it uses a dynamic array i.pdf
I Have the following Java program in which converts Date to Words an.pdf
I Have the following Java program in which converts Date to Words an.pdf
Objectives In this lab you will review passing arrays to methods and.pdf
Objectives In this lab you will review passing arrays to methods and.pdf
Implement a queue using a linkedlist (java)SolutionLinkedQueue.pdf
Implement a queue using a linkedlist (java)SolutionLinkedQueue.pdf
Java questionI am having issues returning the score sort in numeri.pdf
Java questionI am having issues returning the score sort in numeri.pdf
java compilerCompiler1.javajava compilerCompiler1.javaimport.docx
java compilerCompiler1.javajava compilerCompiler1.javaimport.docx
1 Part I written exercises.1. Using the Red-Black Tre.docx
1 Part I written exercises.1. Using the Red-Black Tre.docx
Im getting List Full when I try to add 2nd student.Driver..pdf
Im getting List Full when I try to add 2nd student.Driver..pdf
srcArtifact.javasrcArtifact.javaclassArtifactextendsCave{pub.docx
srcArtifact.javasrcArtifact.javaclassArtifactextendsCave{pub.docx
More from infoeyecare
All fungi have tiny tube-like structures call hyphae. One is labeled .pdf
All fungi have tiny tube-like structures call hyphae. One is labeled within the collection. What
do you think these structures do for the fungi?
Solution
Answer:
Hyphae is a long, branching, filamentous structure of a fungus, it contain the cytoplasm or cell
sap, including the nuclei containing genetic material.
-absorb nutrients from the environment and transport them to other parts of the thallus
- hyphae represents the vegetative stage of fungi..
15. Let’s say you are systems administrator for a hospital’s network.pdf
15. Let’s say you are systems administrator for a hospital’s network. Keep in mind that as system
administrator, your job is to provide the correct level of accessibility to authorized users while
denying access to those who lack authorization. What are the top five policies that you would
implement? How would you enforce compliance with these policies? How would you educate
your users to convince them to adhere to your policies?
Solution
The policies that system administrator use to provide the correct level of accessibility to
authorized users while denying access to unauthorized users are-
1. Using antivirus software and running them regularly to protect systems from attack by
malicious softwares.
2. Using firewalls to maintain access control based on sender\'s and reciever\'s ip addresses.
3. By providing Login system policy to ensure authorized access to system by individuals (using
login ID and passwords).
4. Using high level encryption techniques to secure access of information on transit between two
users.
5. By monitoring network communication.
These policies can be enforced by system administrator by using distributed operating system.
Because DO/S works on the property of global control of all assets.
Users can be provided with individual login and password as unauthorized access may lead to
breach in security of hospital\'s information. As security breach in Hospital\'s information may
lead to adverse effects like- breach in information of patients, their diseases, medicines
prescribed and many more..
What would the predicted result be if Griffith injected mice with a .pdf
What would the predicted result be if Griffith injected mice with a mixture of heat-killed R
bacteria and living S bacteria?
a. All mice would live, but only if DNAse was added to the mixture prior to injection
b. All mice would die.
c. All mice would live.
d. All mice would die, but only if DNAse was added to the mixture prior to injection.
Solution
Griffith’s Experiment-A Quick Review: Fredrick Griffith, an English physician, first reported
transformation of one strain of Streptococcus pneumoniae into other strain in 1928. The bacteria
cause pneumonia. A strain of this bacterium produces capsule and gives a smooth, shiny colony
on culture media, thus called S-strain (smooth strain). The S-strain exhibits pathogenicity in
laboratory mice. Another strain without capsule produces rough and coarse colony on culture
medium, thus called R-strain (rough strain). The R-strain is avirulent (non-pathogenic).
Mice injected with
Outcome
1
Live S-strain (virulent)
Pneumonia mice dead
2
Live R-strain (avirulent)
No pneumonia mice alive
3
Heat killed S-strain + live R-strain
Pneumonia mice dead
When injected with live S-strain bacteria, mice developed pneumonia and died. When injected
with live R-strain bacteria, mice did not develop pneumonia and survived. When heat killed S-
strain injected to mice, they remain unaffected. However, when heat killed S-strain bacteria
mixed with live R-strain injected to mice, they developed pneumonia and died. He was also able
to isolate and culture S-strain bacteria from affected mice. Since heat killed bacteria could have
no way been revived, he concluded that some molecules from heat killed S-strain had
transformed the R-strain into S-train.
Now,
The Current Perspective: Presence of living S-strain causes pneumonia development in mice
killing them at last. It is noteworthy that transformation of R-strain into S-strain occurs only
when there is alive R-strain and fragments of DNA from heat-killed S-strain.
Option A: Incorrect. DNAse is a large protein incapable of entering into bacterial cytoplasm
through bacterial membrane of living S-strain. So, this treatment further cleaves DNA fragments
of heat killed R-strain BUT leaves the S-strain unaffected. So, injecting the mixture to mice kills
them as live S-strain causes pneumonia.
Option B: Correct. Presence of living S-strain causes pneumonia development in mice killing
them at last.
Option C: Incorrect. All mice die because S-strain cause pneumonia to them.
Option D: Incorrect. All mice would die, BUT NOT because of addition of DNAse to the
mixture. As mentioned in option A explanation, DNAse does not penetrate into live S-strain,
thus leave them unaffected. Therefore, mice die irrespective of DNAse treatment.
Mice injected with
Outcome
1
Live S-strain (virulent)
Pneumonia mice dead
2
Live R-strain (avirulent)
No pneumonia mice alive
3
Heat killed S-strain + live R-strain
Pneumonia mice dead.
Write a function called myfind that will search for a key in a vecto.pdf
Write a function called myfind that will search for a key in a vector and return the indices of all
occurrences of the key, like the built-in find function. It will receive two arguments— the vector
and the key—and will return a vector of indices or the empty vector [ ] if the key is not found.
The function will be invoked as follows:
idx = myfind(vec, key);
Following is an example of correct function behavior:
>> vec = randi([5, 10], 1, 10)
vec = 5 10 10 7 9 5 7 10 9 10
>> key = 10;
>> idx = myfind(vec, key)
idx = 2 3 8 10
>> key = 2;
>> idx = myfind(vec, key)
idx = Empty matrix: 1-by-0
Do not use the in-built find function.
Solution
% matlab code find all index of key in vector
function idx = myfind(vec, key)
index = 1;
for i=1:length(vec)
if vec(i) == key
idx(index) = i;
index = index + 1;
end
end
end
vec = randi([5, 10], 1, 10);
disp(\"Vector: \");
disp(vec);
key = 10;
fprintf(\"\ Key: %d\ \",key);
idx = myfind(vec, key);
disp(\"\ Index: \");
disp(idx);
%{
sample output:
Vector:
10 10 8 10 5 10 5 8 9 5
Key: 10
Index:
1 2 4 6
%}.
wright Mills proposed that sociologists could explain individual beha.pdf
wright Mills proposed that sociologists could explain individual behavior by focusing
on_______ Common sense instinct external influence inherited ability
Solution
1. C.Write Mills get better understood that how personal troubles are linked to public issues.
2. In order to understand one\'s individual behaviour better to understand their personal lives.
3. In order to understand one\'s individual behavour must understand that there is link or
connection between public and private.
4. To understand link between personal and public one must use critical thinking skills such as
sociological imagination.
5. From the above imformation it is need to foccus on common sense and external influence to
understand individual behavior of a person..
Why are General, Special Revenue, and other governmental (expendable).pdf
Why are General, Special Revenue, and other governmental (expendable) funds typically
controlled by fixed budgets integrated within the account structure, whereas Enterprise and other
proprietary (nonexpendable) funds may be subject to less formal control through flexible budgets
not integrated within the account structure? b.
Solution
Governmental or expendable funds involves General, Special Revenue, etc. The fiscal
management of expendable or governmental funds involves allocating fixed amounts of financial
resources among competing demands with the help of budgetary process. Formal appropriations
that are made in fixed dollar amounts may not be exceeded legally. There is integration of
Appropriations and Encumbrances within the ledgers. This is done to enhance expenditure
control by continually making available in the accounts data on the appropriations, actual
expenditures to date, and encumbrances outstanding, both in detail and in total. Like
Appropriations and Encumbrances, Estimated Revenues accounts are integrated within the
ledgers to continually make available data on both estimated and actual revenues to date, in
detail and in total. This helps in enhancing revenue management.
Proprietary or nonexpendable funds involves Enterprise, etc. These funds are established to
account for business-type activities. Here, those business-type activities are accounted in which
additional revenues are generated as goods or services are provided. Thus, both the resources
available to finance expenses. These finance expenses vary directly with the demands for the
goods or services involved. It can be said that flexible budgeting is more suitable in this
situation. Activities may not be subjected to formal appropriations control so there may be no
need to integrate budgetary accounts. There is automatic re-appropriation for the activity as the
revenues are received..
Which functions of a cell membrane would be compromised if the membr.pdf
Which functions of a cell membrane would be compromised if the membrane consisted of a
phospholipid bilayer without proteins? What about a membrane without phospholipids?
Solution
Without the membrane proteins, cell to cell interaction and transport of molecules across the
membrane are not possible. The membrane receptor proteins help cell communication with the
use of hormones, neurotransmitters, and other signalling molecules. Transport proteins through
facilitated diffusion transport of molecules across the membrane. Structural proteins help to give
the cell support and shape..
What is the state of water at 200 kPa and 250oCQuestion 7 options.pdf
What is the state of water at 200 kPa and 250oC?
Question 7 options:
Saturated vapor
Superheated vapor
Compressed liquid
Saturated liquid
Saturated mixturA)
Saturated vaporB)
Superheated vaporC)
Compressed liquidD)
Saturated liquidE)
Saturated mixtur
Solution
at 200 kPa
saturation temperature is 120.21 C
but the temperature is 250 C
so, it is a superheated vapour.
What is ransomware How can these cyber-attacks result in data loss.pdf
What is ransomware? How can these cyber-attacks result in data loss? In your experience, do
you believe ransomware attacks should be treated as a cybercrime? What are the possible
consequences of ransomware? Be sure to cite examples from credible sources to support your
answers.
Solution
Ransomware is a virus or malware of the computer which installs secretly on computer without
user authorization and encrypts the data that is present on the victims computer and in order to
decrypt that message it asks for payment for decryption. Yes this ransomware cyber attacks
result in data loss because the attacker demands the victim for money in order to give the decrypt
key whether if he has not paid the decrypt key will be lost and the data is also lost forever and
results in data loss.This ransomware is a cybercrime because so much of data is lost and they are
thefting the data and demands money from the victims in order to give the data it is like
kidnapping the data. The possible consequences of ransomware malware are dataloss and
datatheft. This malware are sent through the Email attachments and messages in social media
and whenever we click that it installs without authorization..
What are the 3 ways a Java method must match with its definition and.pdf
What are the 3 ways a Java method must match with its definition and call?
Solution
The three ways are:
1. Name of the method must be exactly same in definition and call.
2. The number of variables mentioned in the function definition must be same as function call.
2.The type of variables mentioned in the function definition must be same as function call..
Using the Internet, compare and contrast two commercially available .pdf
Using the Internet, compare and contrast two commercially available Vulnerability Assessment
solutions.
What are the differences between the two? How are they similar?
Make a purchasing recommendation and defend your suggestion. Be detailed and specific.
(Ensure you provide links to each product offering.)
Solution
An interruption detection system is a software application that monitors network behavior for
cruel activities or policy violation and produce information to a running station. A few systems
may attempt to prevent an intrusion attempt monitoring system. IDPSes have turn into a
necessary addition to the security communications of almost every organization.
IDPSes normally record information related to pragmatic events notify safety administrator of
significant observed events and create reports. A lot of IDPSes can also react to a detected threat
by attempt to stop it from succeeding.
WAFs are intended to protect web applications from web based attacks that IPSs cannot put off.
In the same regard as an IPS, WAFs can be network based. They sit in order and monitor traffic
to and from web applications.
WAFs are normally deployed in some sort of proxy manner just in front of the web application.
CONCLUSION:
Web Applications Firewalls are a particular type of product used to detect attacks next to web
applications in extra depth than an Intrusion anticipation System. WAFs can be used in our
environment to provide better protection to web applications..
uetator Periodic Table Question 6 of 30 Incorrect Incorrect DA Saplin.pdf
uetator Periodic Table Question 6 of 30 Incorrect Incorrect DA Sapling Learning sponsible
syndrome is anX-inked, recessive condition caused by mutation of the HPRT1 muscle
movements, The syndrome is characterized byjuvenile-onset gout, in and behavioral disorders. A
mother and father have a young daughter who was diagnosed with Lesch-Nyhan syndrome. No
one in the with family was ever diagnosed the The maternal grandfather was diagnosed
syndrome, but neither one of her parents was diagnosed with condition. Select all the
descriptions that could explain how their daughter inherited Lesch-Nyhan syndrome. The
daughter could not have Nyhan because her maternal grandparents did not have disease. The girl
must have acquired the disease through a random mutation. The daughter inherited two
xchromosomes with the of the mothers X mutation. Nondisjunction chromosome chromosomes
occurred during meiosis, and the daughter inherited from her father. The father did not contribute
a sex chromosome to his daughter due to nondisjunction of the sex chromosomes. The daughter
is xo and her only X chromosome came from her mother, who was a O The d from her father,
who was a carrier. camies the Lesch-Nyhan mutation and was Her inherited There is a hint
available! bottom divider bar. Click on the divider bar again to hide the hint. Previous ® Give
Up & View solution Check Answer 0 Next HExi Hint
Solution
1) the hint here is that the mother\'s maternal was diagnosed with Lesch-Nyhan syndrome. Since
it is an X-chromosome related disease, it is very rare to have females affected by it. If a girl has
LNS, she must have inherited two effected X chromosomes from each parent. Also, one third of
cases arise from new mutations even when there is no family history of any. So the first two
points are the possible reasons for the girls to have LNS..
The starship Epidemiology Team has cone many missions exploring the u.pdf
The starship Epidemiology Team has cone many missions exploring the universe. The captain
has noticed that many of the crew members who worked in the weapons bay returned home with
low back pain (LBP). It is important to note that people who worked in the Weapon\'s Bay only
worked in that area of the ship and are the only people who are required to lift heavy equipment.
After their last voyage, the captain decided to sample the crew members who had L8P and ones
who didn\'t. Note that the captain only recorded male crew members that were of the same age.
Based on the captain\'s recordings below, was working in the weapons bay area associated with
LBP? What are some possible interventions the captain could use to reduce the occurrence of
LBP on his ship?
Solution
a) Based on the captains recordings, working in weapons bay is not associated with LBP.
b) Captain can shift the persons with LBP to other areas of ship which does not have any
equipment lifting.
Captain would suggest the person\'s with LBP to go for a medical checkup..
Question 3)Perform a regression analysis using compa as the depend.pdf
Question 3)
Perform a regression analysis using compa as the dependent variable and the same independent
variables as used in question 2. (Question #2 found below the table). Show the result, and
interpret your findings by answering the same questions.
Note: be sure to include the appropriate hypothesis statements.
A ) Regression hypotheses
Ho:
Ha:
Coefficient hyhpotheses (one to stand for all the separate variables)
Ho:
Ha:
B )Interpretation:
For the Regression as a whole:
What is the value of the F statistic:
What is the p-value associated with this value:
Is the p-value < 0.05?
Do you reject or not reject the null hypothesis:
What does this decision mean for our equal pay question (Do M and F get paid equaly?):
C )For each of the coefficients: Intercept, Midpoint, Age, Perf. rating, Service, Gender, Degree
What is the coefficient\'s p-value for each of the variables:
Is the p-value < 0.05?
Do you reject or not reject each null hypothesis:
What are the coefficients for the significant variables?
Using only the significant variables, what is the equation? Compa =
Is gender a significant factor in compa:
If so, who gets paid more with all other things being equal?
How do we know?
ID
Salary
Compa
Midpoint
Age
Performance Rating
Service
Gender
Raise
Degree
Gender1
Gr
1
66.1
1.159
57
34
85
8
0
5.7
0
M
E
2
25.9
0.834
31
52
80
7
0
3.9
0
M
B
3
35.2
1.135
31
30
75
5
1
3.6
1
F
B
4
55.3
0.971
57
42
100
16
0
5.5
1
M
E
5
49.6
1.033
48
36
90
16
0
5.7
1
M
D
6
78.3
1.168
67
36
70
12
0
4.5
1
M
F
7
42.3
1.058
40
32
100
8
1
5.7
1
F
C
8
22.8
0.990
23
32
90
9
1
5.8
1
F
A
9
78
1.164
67
49
100
10
0
4
1
M
F
10
23.3
1.014
23
30
80
7
1
4.7
1
F
A
11
23.6
1.025
23
41
100
19
1
4.8
1
F
A
12
60.8
1.067
57
52
95
22
0
4.5
0
M
E
13
40.6
1.014
40
30
100
2
1
4.7
0
F
C
14
21.7
0.943
23
32
90
12
1
6
1
F
A
15
21.8
0.949
23
32
80
8
1
4.9
1
F
A
16
37.4
0.934
40
44
90
4
0
5.7
0
M
C
17
57
1.000
57
27
55
3
1
3
1
F
E
18
33.5
1.081
31
31
80
11
1
5.6
0
F
B
19
23
1.000
23
32
85
1
0
4.6
1
M
A
20
36
1.162
31
44
70
16
1
4.8
0
F
B
21
76
1.135
67
43
95
13
0
6.3
1
M
F
22
43.7
0.911
48
48
65
6
1
3.8
1
F
D
23
25.3
1.098
23
36
65
6
1
3.3
0
F
A
24
48.9
1.019
48
30
75
9
1
3.8
0
F
D
25
25.8
1.122
23
41
70
4
0
4
0
M
A
26
23.3
1.013
23
22
95
2
1
6.2
0
F
A
27
42.3
1.057
40
35
80
7
0
3.9
1
M
C
28
75.2
1.122
67
44
95
9
1
4.4
0
F
F
29
80.9
1.208
67
52
95
5
0
5.4
0
M
F
30
49
1.020
48
45
90
18
0
4.3
0
M
D
31
24.2
1.054
23
29
60
4
1
3.9
1
F
A
32
27.5
0.886
31
25
95
4
0
5.6
0
M
B
33
63.6
1.115
57
35
90
9
0
5.5
1
M
E
34
28.6
0.922
31
26
80
2
0
4.9
1
M
B
35
22.4
0.976
23
23
90
4
1
5.3
0
F
A
36
23.6
1.026
23
27
75
3
1
4.3
0
F
A
37
24.3
1.057
23
22
95
2
1
6.2
0
F
A
38
63
1.105
57
45
95
11
0
4.5
0
M
E
39
34.8
1.123
31
27
90
6
1
5.5
0
F
B
40
24.3
1.057
23
24
90
2
0
6.3
0
M
A
41
42.8
1.071
40
25
80
5
0
4.3
0
M
C
42
23
0.998
23
32
100
8
1
5.7
1
F
A
43
75.4
1.125
67
42
95
20
1
5.5
0
F
F
44
60.7
1.065
57
45
90
16
0
5.2
1
M
E
45
57.9
1.206
48
36
95
8
1
5.2
1
F
D
46
62.2
1.091
57
39
75
20
0
3.9
1
M
E
47
62.2
1.091
57
37
.
Problems in PYTHON3.5 1. Define a function sumOfDigits that has one .pdf
Problems in PYTHON3.5 1. Define a function sumOfDigits that has one parameter of type
string. The function should return the sum of the digits in the string. Do not treat multiple digit
string as one number – “2014” should be treated as 4 different digits of 2, 0, 1, 4. The function
should return 17 for the string “Today’s date is 09/01/2014”. Then write a main program that
asks a user to enter a sentence and then displays the sum of digits that are in the sentence by
using the function, sumOfDigits. The function sumOfDigits should only do what’s asked to do. It
should not do any additional tasks such as print or input!!!
Solution
Before implementing the function, we need to check whether the integer comes into the string or
not.
To do that there is an in-built function in Python, isdigit() which checks whether the input is the
integer
or some other character.
def sumOfDigits(input_str):
summation = 0
for number in list(input_str):
if number.isdigit():
summation += int(number)
return summation
Hence, this will loop through the entire string and check for each of them whether it is integer or
some other character.For all the integer it is summing up the values and returning it at the end of
the function definition..
Only a very small percentage of organisms actually fossilize. Based o.pdf
Only a very small percentage of organisms actually fossilize. Based on the information in the
table below, rank the likely abundance of fossils of organisms A-E. Rank the fossils of
organisms A-E from most common to least common. If two fossils have the same commonness,
overlap them.
Solution
Answer:
Ranking based on the abundance of fossils of organisms, A-E:
1. Organism E is most likely to fossilize
This organism has a hard shell and lives with sediments near the shore and has a large population
with long existence.
2. Organism A
It has the larger population and longer existence time. This can lead to A having a better chance
at fossilizing than B.
3. Organism B
Organism B has a small population with a short existence time.
4. Organism C
It lives with no sediment, has a large population with a long existence thus leaving it more
susceptible to becoming fossilize than D.
5. Organism D (being the least common fossil)
It has a soft body, lives with no sediment deposits, has a short life and a small population..
Odin and Zeus travel to the outermost reaches of our galaxy using wa.pdf
Odin and Zeus travel to the outermost reaches of our galaxy using warp drive spaceship
searching for other forms of life. They make contact with highly advanced civilization on planet
X329. However, while trying to land at a guided landing site, they are exposed to high energy
gamma rays which produces defects in their classical complement and some cytokine genes, and
obliterates monocyte mactrophages, and granulocytes. Their mission mandates staying with their
friends for three days and then journey back to earth. The trip back to Earth will take between 6-
7 days. Will Odin and Zeus survive meeting their new friends on planet X329? If so what
immune mechanisms will help their survival?
Solution
In the present case, Odin and Zeus are exposed to high energy gamma radiations. Gamma rays
are highly penetrating, and can cause genetic damage leading to detrimental effects. Its ionizing
energy breaks up bonds of genetci material. In the case presented here, gamma rays have caused
defects in classical complement system and also the cytokine genes. Classical complement is the
term given group of more than 30 serum proteins that enhance the ability to produce antibodies
and phagocytic cells, that are critically important in our defense against infections. Similarly,
cytokines which include chemokines, interferons, interleukins, lymphokines and TNFs etc are
small proteins involved in autocrine signalling, paracrine signalling and endocrine signalling,
acting as immunomodulating agents.Thus defects produced by gammma radiations in phagocytic
cells, classical complement, cytokines, cytokine receptors or in molecules that mediate effector
responses might lead to various immunodeficiency diseases. Also, the individuals have suffered
from obliteration of monocyte, macrophages, and granulocytes due to gamma rays exposure.
Thus they have practically no defence against (no cells to eat up) cellular debris, foreign
substances, microbes, cancer cells.
In such cases of severe exposure and damage, immediate medical aid is required. Delay of 6-7
days (as per the given mission mandate) could be fatal for the individuals exposed, especially in
case of acute exposure to ioninzing radiations. Odin and Zeus may not survive for meeting their
new friends on planet X329 without emergency medical help, change of clothes and
radioprotecive drugs..
Many new species of desert have arisen from a population which was .pdf
Many new species of desert have arisen from a population which was introduced into the
American southwest. This example best describes: allopatric speciation. sympatric speciation.
microevolution. adaptive radiation. the effect of climatic change. What is the only source of all
new ? genetic drift gene flew genetic polymorphism mutation natural selection Extensive
data from hospitals have shown that born with intermediate weights are the ones most likely to
survive. This is a classic example of which type of selection? stabilizing selection directional
selection no selection disruptive selection natural selection What are considered to be the two
most important factors that have been involved in past mass ? glaciers and earthquakes disease
and parasites plate tectonics and climatic factors fire and weather events environmental and
biological factors Which was a possible source of high energy no early. Earth that likely
contributed to the origin of
Solution
11. Adaptive radiation: Adaptive radiation is when a species diversify to many different species
from one ancestral species when there is a change in the environment. Change in environment
would be when they are exposed to a different environment like in this case, to a new land.
Change in the environment presents new challenges and advantages in term of resources,
climate, predators etc. Such changes force a species to evolve to adapt.
12. Mutation: Mutation is change in the genetic code which can occur due to many reasons
which change the basic DNA code as compared to what the parent cell has. Mutation can give
the cell new characteristics or even hamper basic functions of a cell or an organism. Hence,
mutation is the only source of change in alleles
Genetic drift can happen only with mutation. Gene flow is basically the inheritance of genes
from the parents to offspring. Genetic polymorphism does not guarantee change in phenotype,
hence not change in alleles. Natural selection is basically survival of the fittest.
13. Stabilizing selection : It is when for a particular trait, the genetic diversity decreases and the
population mean stabilizes. It is assumed to be the most common type of natural selection. When
it comes to phenotypes it supports the intermediate variations.
Human babies who are underweight are susceptible to diseases and lose heat more quickly and
have high mortality rate and similarly for the babies with more than normal weight, which are
difficult to deliver..
List and analyze some of the most salient social factors of group un.pdf
List and analyze some of the most salient social factors of group unrest AND deviance in cities.
Solution
Some of the important social factors form group unrest are listed below.
1. Social inequality
2. Corruption
3. Inflation
4. Government apathy
If the people of the group feels that all members of the group are not being treated equal, sense of
inferiority arises and the member of the group starts feeling harassed. If the same amount of
resources are not available to all for exploitation, there will always be group unrest. When people
are not treated equal among different sections of the society unrest happens. They can be
harassed on the basis of colour, caste, ethnicity and creed.
Corrpution is also an important factor for group unrest. When there is corruption in the society
people of the group feels being cheated. There is impression that they are paying more than what
they should have been. The exploited lots will cause social unrest and raise awareness.
Inflation affects whole section of the society and all members of the group in a society. The rise
in the expenditure on the same amount of commodities bought in a month will provoke the
buyers to take action, sometimes result in social unrest. Usually when the authority is unable to
control inflation and when there is apathy of the authorities towards the members of the group,
the social unrest happens..
J. A. Moore investigated the inheritance of spotting patterns in leop.pdf
J. A. Moore investigated the inheritance of spotting patterns in leopard frogs (J. A. Moore. 1943.
Journal of Heredity 34:3-7). The pipiens phenotype had the normal spots that give leopard frogs
their name. In contrast, the burnsi phenotype lacked spots on its back. Moore earned out the
following crosses, producing the progeny indicated. Parent phenotypes Progeny phenotypes
burnsi X burnsi 42 burnsi, 8 pipiens burnsi X pipiens 25 burnsi, 34 pipiens burnsi X pipiens 194
bumsi, 208 pipiens On the basis of these results, what is the most likely mode of inheritance of
the burnsi phenotype? Give the most likely genotypes of the parent in each cross. Use a chi-
square test to evaluate the fit of the observed numbers of progeny to the number expected on the
basis of your proposed genotypes for each of the three matings shown.
Solution
a. On the basis of the above crosses, the mode of inheritance of burnsi phenotype is
DOMINANT PHENOTYPE.
b. The Genotypes of the parents
Burnsi X Burnsi = Bb X Bb
Burnsi X pipiens = Bb X bb
Burnsi X pipiens = Bb X bb
C.
1.
Null hypothesis: The observed values are not deviating from 3:1 ratio.
Chisquare test:
Category
Burnsi
pipiens
Total
Observed values
42
8
50
Exptected Ratio
3
1
4
Exprected Values
37.5
12.5
Deviation
4.5
-4.5
D^2
20.25
20.25
D^2/E
0.54
1.62
2.16
X^2
2.16
Degrees of freedom
-
1
Inference: The calculated chisquare values is less than the table i.e. 3.84 at 1 DF and 0.05
probability, hence null hypothesis accepted.
2.
Null hypothesis: The observed values are not deviating from 1:1 ratio.
Chisquare test:
Category
Burnsi
pipiens
Total
Observed values
28
34
62
Exptected Ratio
1
1
2
Exprected Values
31
31
Deviation
-3
3
D^2
9
9
D^2/E
0.290323
0.290323
0.580645
X^2
0.580645
Degrees of freedom
-
1
Inference: The calculated chisquare values is less than the table i.e. 3.84 at 1 DF and 0.05
probability, hence null hypothesis accepted.
3.
Null hypothesis: The observed values are not deviating from 1:1 ratio.
Chisquare test:
Category
Burnsi
pipiens
Total
Observed values
194
208
402
Exptected Ratio
1
1
2
Exprected Values
201
201
Deviation
-7
7
D^2
49
49
D^2/E
0.243781
0.243781
0.487562
X^2
0.487562
Degrees of freedom
-
1
Inference: The calculated chisquare values is less than the table i.e. 3.84 at 1 DF and 0.05
probability, hence null hypothesis accepted.
Category
Burnsi
pipiens
Total
Observed values
42
8
50
Exptected Ratio
3
1
4
Exprected Values
37.5
12.5
Deviation
4.5
-4.5
D^2
20.25
20.25
D^2/E
0.54
1.62
2.16
X^2
2.16
Degrees of freedom
-
1.
More from infoeyecare (20)
All fungi have tiny tube-like structures call hyphae. One is labeled .pdf
All fungi have tiny tube-like structures call hyphae. One is labeled .pdf
15. Let’s say you are systems administrator for a hospital’s network.pdf
15. Let’s say you are systems administrator for a hospital’s network.pdf
What would the predicted result be if Griffith injected mice with a .pdf
What would the predicted result be if Griffith injected mice with a .pdf
Write a function called myfind that will search for a key in a vecto.pdf
Write a function called myfind that will search for a key in a vecto.pdf
wright Mills proposed that sociologists could explain individual beha.pdf
wright Mills proposed that sociologists could explain individual beha.pdf
Why are General, Special Revenue, and other governmental (expendable).pdf
Why are General, Special Revenue, and other governmental (expendable).pdf
Which functions of a cell membrane would be compromised if the membr.pdf
Which functions of a cell membrane would be compromised if the membr.pdf
What is the state of water at 200 kPa and 250oCQuestion 7 options.pdf
What is the state of water at 200 kPa and 250oCQuestion 7 options.pdf
What is ransomware How can these cyber-attacks result in data loss.pdf
What is ransomware How can these cyber-attacks result in data loss.pdf
What are the 3 ways a Java method must match with its definition and.pdf
What are the 3 ways a Java method must match with its definition and.pdf
Using the Internet, compare and contrast two commercially available .pdf
Using the Internet, compare and contrast two commercially available .pdf
uetator Periodic Table Question 6 of 30 Incorrect Incorrect DA Saplin.pdf
uetator Periodic Table Question 6 of 30 Incorrect Incorrect DA Saplin.pdf
The starship Epidemiology Team has cone many missions exploring the u.pdf
The starship Epidemiology Team has cone many missions exploring the u.pdf
Question 3)Perform a regression analysis using compa as the depend.pdf
Question 3)Perform a regression analysis using compa as the depend.pdf
Problems in PYTHON3.5 1. Define a function sumOfDigits that has one .pdf
Problems in PYTHON3.5 1. Define a function sumOfDigits that has one .pdf
Only a very small percentage of organisms actually fossilize. Based o.pdf
Only a very small percentage of organisms actually fossilize. Based o.pdf
Odin and Zeus travel to the outermost reaches of our galaxy using wa.pdf
Odin and Zeus travel to the outermost reaches of our galaxy using wa.pdf
Many new species of desert have arisen from a population which was .pdf
Many new species of desert have arisen from a population which was .pdf
List and analyze some of the most salient social factors of group un.pdf
List and analyze some of the most salient social factors of group un.pdf
J. A. Moore investigated the inheritance of spotting patterns in leop.pdf
J. A. Moore investigated the inheritance of spotting patterns in leop.pdf
Recently uploaded
Unit 2- Research Aptitude (UGC NET Paper I).pdf
This slide describes the research aptitude of unit 2 in the UGC NET paper I.
Chapter -12, Antibiotics (One Page Notes).pdf
This is a notes for the D.Pharm students and related to the antibiotic drugs.
CACJapan - GROUP Presentation 1- Wk 4.pdf
Macroeconomics- Movie Location
This will be used as part of your Personal Professional Portfolio once graded.
Objective:
Prepare a presentation or a paper using research, basic comparative analysis, data organization and application of economic information. You will make an informed assessment of an economic climate outside of the United States to accomplish an entertainment industry objective.
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH ANSWERS.
A Survey of Techniques for Maximizing LLM Performance.pptx
A Survey of Techniques for Maximizing LLM Performance
special B.ed 2nd year old paper_20240531.pdf
Instagram:-
https://instagram.com/special_education_needs_01?igshid=YmMyMTA2M2Y=
WhatsApp:-
https://chat.whatsapp.com/JVakNIYlSV94x7bwunO3Dc
YouTube:-
https://youtube.com/@special_education_needs
Teligram :- https://t.me/special_education_needs
Slide Shere :-
https://www.slideshare.net/shabnambano20?utm_campaign=profiletracking&utm_medium=sssite&utm_source=ssslideview
The French Revolution Class 9 Study Material pdf free download
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
Natural birth techniques - Mrs.Akanksha Trivedi Rama University
Natural birth techniques - Mrs.Akanksha Trivedi Rama UniversityAkanksha trivedi rama nursing college kanpur.
Natural birth techniques are various type such as/ water birth , alexender method, hypnosis, bradley method, lamaze method etcBÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...Nguyen Thanh Tu Collection
https://app.box.com/s/hqnndn05v4q5a4k4jd597rkdbda0fniiSupporting (UKRI) OA monographs at Salford.pptx
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
"Protectable subject matters, Protection in biotechnology, Protection of othe...
Protectable subject matters, Protection in biotechnology, Protection of other biological materials, Ownership and period of protection
Normal Labour/ Stages of Labour/ Mechanism of Labour
Normal labor is also termed spontaneous labor, defined as the natural physiological process through which the fetus, placenta, and membranes are expelled from the uterus through the birth canal at term (37 to 42 weeks
1.4 modern child centered education - mahatma gandhi-2.pptx
Child centred education is an educational approach that priorities the interest, needs and abilities of the child in the learning process.
Thesis Statement for students diagnonsed withADHD.ppt
Presentation required for the master in Education.
Acetabularia Information For Class 9 .docx
Acetabularia acetabulum is a single-celled green alga that in its vegetative state is morphologically differentiated into a basal rhizoid and an axially elongated stalk, which bears whorls of branching hairs. The single diploid nucleus resides in the rhizoid.
Recently uploaded (20)
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
TESDA TM1 REVIEWER FOR NATIONAL ASSESSMENT WRITTEN AND ORAL QUESTIONS WITH A...
Pride Month Slides 2024 David Douglas School District
Pride Month Slides 2024 David Douglas School District
A Survey of Techniques for Maximizing LLM Performance.pptx
A Survey of Techniques for Maximizing LLM Performance.pptx
The French Revolution Class 9 Study Material pdf free download
The French Revolution Class 9 Study Material pdf free download
Natural birth techniques - Mrs.Akanksha Trivedi Rama University
Natural birth techniques - Mrs.Akanksha Trivedi Rama University
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...
BÀI TẬP BỔ TRỢ TIẾNG ANH GLOBAL SUCCESS LỚP 3 - CẢ NĂM (CÓ FILE NGHE VÀ ĐÁP Á...
"Protectable subject matters, Protection in biotechnology, Protection of othe...
"Protectable subject matters, Protection in biotechnology, Protection of othe...
Normal Labour/ Stages of Labour/ Mechanism of Labour
Normal Labour/ Stages of Labour/ Mechanism of Labour
1.4 modern child centered education - mahatma gandhi-2.pptx
1.4 modern child centered education - mahatma gandhi-2.pptx
Thesis Statement for students diagnonsed withADHD.ppt
Thesis Statement for students diagnonsed withADHD.ppt
package lab7; import java.util.Scanner; Sammy Student, Program.pdf
- 1. package lab7; import java.util.Scanner; //Sammy Student, Programmer public class Maze { static Scanner sc = new Scanner(System.in); // maze movements static char myMove = '0'; // cell position static int currentCell = 0; static int score = 0; static boolean advance = true; static boolean checkThis = false; public static void main(String args[]) { // the local variables declared and initialized char answer = 'Y'; displayMenu(); while(answer == 'Y' || answer == 'y') { displayMovement(); makeYourMove(); checkThis = checkYourMove(); mazeStatus(); System.out.println("move again(Y or N)?"); answer = sc.next().charAt(0); } System.out.println("***************************"); }// end main() method static void displayMenu() {
- 2. System.out.println(""); System.out.println("***************************"); System.out.println("----The Maze Strategy---"); System.out.println(""); }// end method static void displayMovement() { if(currentCell == 0) { System.out.println("You have entered the maze!!"); System.out.println("There is no turning back!!"); currentCell = 1; mazeStatus(); advance = true; } System.out.println("make your move (W, A, S, D)"); System.out.println("W = up, A = left, S = down, D = right)"); }// end method static void makeYourMove() { myMove = sc.next().charAt(0); switch(myMove) { case 'W': { MoveUp(); break; } case 'A': { MoveLeft(); break; } case 'S': { MoveDown(); break; } case 'D': { MoveRight(); break; } } // end program menu }// end method static boolean checkYourMove() { if(currentCell == 1 && advance == true) {
- 3. if (myMove == 'W') { advance = false; System.out.println("try again"); return advance; } if (myMove == 'A') { advance = false; System.out.println("SORRY, there is no return"); return advance; } if (myMove == 'D') { currentCell = 2; advance = true; System.out.println("continue through the maze"); return advance; } if (myMove == 'S') { advance = false; System.out.println("continue through the maze"); return advance; } } if(currentCell == 2 && advance == true) { if (myMove == 'W') { advance = false; System.out.println("try again"); return advance; } if (myMove == 'A')
- 4. { advance = false; System.out.println("SORRY, there is no return"); return advance; } if (myMove == 'D') { advance = false; System.out.println("continue through the maze"); return advance; } if (myMove == 'S') { currentCell = 5; advance = true; System.out.println("continue through the maze"); return advance; } } return advance; // end program menu }// end method static void MoveLeft() { System.out.println("you moved to the left"); }//end method static void MoveRight() { System.out.println("you moved to the right"); }//end method static void MoveUp() { System.out.println("you moved up (forward)");
- 5. }//end method static void MoveDown() { System.out.println("you moved down (downward)"); }//end method static void mazeStatus() { System.out.println("current position: cell " + currentCell); }//end method }// end class Modifythe above code like this: Supplement the checkYourMove() method by including the remaining if statements that allow the maze participant to escape the maze. 1. if(currentCell== 5 &&advance==true) { . . . } if(currentCell== 6 &&advance==true) { . . . } if(currentCell== 9 &&advance==true) { . . . } 2. utilize the score variable to assign a score to each move. Also for extra credit you can track the number of moves that the user makes in their escape of the maze. Solution Please follow the code and comments for description : CODE : import java.util.Scanner; //Sammy Student, Programmer
- 6. public class Maze { // class that runs the code static Scanner sc = new Scanner(System.in); // maze movements static char myMove = '0'; // cell position static int currentCell = 0; static int score = 0; static boolean advance = true; static boolean checkThis = false; public static void main(String args[]) { // the local variables declared and initialized char answer = 'Y'; displayMenu(); while (answer == 'Y' || answer == 'y') { displayMovement(); makeYourMove(); checkThis = checkYourMove(); mazeStatus(); System.out.println("move again(Y or N)?"); answer = sc.next().charAt(0); } System.out.println("***************************"); System.out.println("Total Moves Done : "+score); }// end main() method static void displayMenu() { System.out.println(""); System.out.println("***************************"); System.out.println("----The Maze Strategy---"); System.out.println(""); }// end method static void displayMovement() { if (currentCell == 0) { System.out.println("You have entered the maze!!"); System.out.println("There is no turning back!!"); currentCell = 1; mazeStatus();
- 7. advance = true; } System.out.println("make your move (W, A, S, D)"); System.out.println("(W = up, A = left, S = down, D = right)"); }// end method static void makeYourMove() { myMove = sc.next().charAt(0); score++; switch (myMove) { case 'W': { MoveUp(); break; } case 'A': { MoveLeft(); break; } case 'S': { MoveDown(); break; } case 'D': { MoveRight(); break; } } // end program menu }// end method static boolean checkYourMove() { if (currentCell == 1 && advance == true) { if (myMove == 'W') { advance = false; System.out.println("try again"); return advance; } if (myMove == 'A') {
- 8. advance = false; System.out.println("SORRY, there is no return"); return advance; } if (myMove == 'D') { currentCell = 2; advance = true; System.out.println("continue through the maze"); return advance; } if (myMove == 'S') { advance = false; System.out.println("continue through the maze"); return advance; } } if (currentCell == 2 && advance == true) { if (myMove == 'W') { advance = false; System.out.println("try again"); return advance; } if (myMove == 'A') { advance = false; System.out.println("SORRY, there is no return"); return advance; } if (myMove == 'D') { advance = false; System.out.println("continue through the maze"); return advance; } if (myMove == 'S') { currentCell = 5; advance = true; System.out.println("continue through the maze");
- 9. return advance; } } if (currentCell == 5 && advance == true) { if (myMove == 'W') { advance = false; System.out.println("try again"); return advance; } if (myMove == 'A') { advance = false; System.out.println("SORRY, there is no return"); return advance; } if (myMove == 'D') { currentCell = 6; advance = true; System.out.println("continue through the maze"); return advance; } if (myMove == 'S') { advance = false; System.out.println("continue through the maze"); return advance; } } if (currentCell == 6 && advance == true) { if (myMove == 'W') { advance = false; System.out.println("try again"); return advance; } if (myMove == 'A') { advance = false;
- 10. System.out.println("SORRY, there is no return"); return advance; } if (myMove == 'D') { currentCell = 9; advance = true; System.out.println("continue through the maze"); return advance; } if (myMove == 'S') { advance = false; System.out.println("continue through the maze"); return advance; } } if (currentCell == 9 && advance == true) { if (myMove == 'W') { advance = false; System.out.println("try again"); return advance; } if (myMove == 'A') { advance = false; System.out.println("SORRY, there is no return"); return advance; } if (myMove == 'D') { currentCell = 9; advance = false; System.out.println("Escaped Through the Maze.!"); return advance; } if (myMove == 'S') { advance = false; System.out.println("continue through the maze");
- 11. return advance; } } return advance; // end program menu }// end method static void MoveLeft() { System.out.println("you moved to the left"); }//end method static void MoveRight() { System.out.println("you moved to the right"); }//end method static void MoveUp() { System.out.println("you moved up (forward)"); }//end method static void MoveDown() { System.out.println("you moved down (downward)"); }//end method static void mazeStatus() { System.out.println("current position: cell " + currentCell); }//end method }// end class OUTPUT : *************************** ----The Maze Strategy--- You have entered the maze!! There is no turning back!! current position: cell 1 make your move (W, A, S, D) (W = up, A = left, S = down, D = right) D you moved to the right continue through the maze current position: cell 2
- 12. move again(Y or N)? Y make your move (W, A, S, D) (W = up, A = left, S = down, D = right) S you moved down (downward) continue through the maze current position: cell 5 move again(Y or N)? Y make your move (W, A, S, D) (W = up, A = left, S = down, D = right) D you moved to the right continue through the maze current position: cell 6 move again(Y or N)? Y make your move (W, A, S, D) (W = up, A = left, S = down, D = right) D you moved to the right continue through the maze current position: cell 9 move again(Y or N)? Y make your move (W, A, S, D) (W = up, A = left, S = down, D = right) D you moved to the right Escaped Through the Maze.! current position: cell 9 move again(Y or N)? N *************************** Total Moves Done : 5
- 13. Hope this is helpful.