Can some one redo this code without the try-catch and an alternative.pdf
•
0 likes•2 views
Can some one redo this code without the try-catch and an alternative to using Entry when printing the treemap package part2; import java.io.*; import java.util.Map.Entry; import java.util.*; public class frequencyOfWords { public static void main(String[] args) { long totalTime = 0; long startTime = System.nanoTime(); TreeMap map = new TreeMap<>(); for(int i=1; i <= 77; i++){ startTime = System.nanoTime(); Scanner sc = new Scanner(System.in); File file = new File("c:/Users/tvazq/IdeaProjects/hw2/resources/" + i +".okpuncs"); Scanner reader; String line = ""; try { reader = new Scanner(file); while(reader.hasNextLine()){ line = reader.nextLine(); String words[] = line.split(" "); for(String s : words){ if(map.containsKey(s)){ map.put(s, map.get(s)+1); }else{ map.put(s, 1); } } } } catch (FileNotFoundException e) { System.out.println("file not found"); } sc.close(); totalTime+= (System.nanoTime()-startTime); } System.out.printf("%-20s%-20s\n","Word","Frequency"); for(Entry entry : map.entrySet()) //printing map System.out.printf("%-20s%-20d\n",entry.getKey(),entry.getValue()); System.out.println("Total time took : " + totalTime); } }.
Report
Share
Report
Share
Download to read offline
![Can some one redo this code without the try-catch and an alternative to using Entry when
printing the treemap
package part2;
import java.io.*;
import java.util.Map.Entry;
import java.util.*;
public class frequencyOfWords {
public static void main(String[] args) {
long totalTime = 0;
long startTime = System.nanoTime();
TreeMap map = new TreeMap<>();
for(int i=1; i <= 77; i++){
startTime = System.nanoTime();
Scanner sc = new Scanner(System.in);
File file = new File("c:/Users/tvazq/IdeaProjects/hw2/resources/" + i +".okpuncs");
Scanner reader;
String line = "";
try {
reader = new Scanner(file);
while(reader.hasNextLine()){
line = reader.nextLine();
String words[] = line.split(" ");
for(String s : words){
if(map.containsKey(s)){
map.put(s, map.get(s)+1);
}else{
map.put(s, 1);
}
}
}
} catch (FileNotFoundException e) {
System.out.println("file not found");](https://image.slidesharecdn.com/cansomeoneredothiscodewithoutthetry-catchandanalternative-231008012701-ca675a18/85/Can-some-one-redo-this-code-without-the-try-catch-and-an-alternative-pdf-1-320.jpg)
Recommended
Hadoop Installation_13_09_2022(1).docx
dfsgjdfgjfgsdg wetwe twe wet ewt we tqew teqw twet qw te tew twe tew wetew wetewtewtewtewtewtewtewtetwetewtwetwetewt wetewtewtwetwetwetewtewtewtewtewtewtewtewrtetwertewtewrtwtwetewtewtewtewtewtewtewtewtewtwetwtwetewtwetewtwttt tew twetwetewtewtewtewtewtewtewtewtewtewtewtew ewt ewtwetwerqytrwyrey w yqwreytrreyeryryeyyyreyrrreyhjsdjhdsjhsjsjsjshshsh asdb dfsgjdfgjfgsdg wetwe twe wet ewt we tqew teqw twet qw te tew twe tew wetew wetewtewtewtewtewtewtewtetwetewtwetwetewt wetewtewtwetwetwetewtewtewtewtewtewtewtewrtetwertewtewrtwtwetewtewtewtewtewtewtewtewtewtwetwtwetewtwetewtwttt tew twetwetewtewtewtewtewtewtewtewtewtewtewtew ewt ewtwetwerqytrwyrey w yqwreytrreyeryryeyyyreyrrreyhjsdjhdsjhsjsjsjshshsh asdb
Jersey Guice AOP
Poche chiacchiere e tanto codice per cercare rendere la nostra vita di
sviluppatori più divertente.
Parleremo di JAX-RS, le annotazioni, l'MVC che mette a disposizione e
l'integrazione di Jersey con Guice.
Useremo AOP per gestire log, transazioni e con l'aiuto di Infinispan
limiteremo le chamate concorrenti sul nostro cluster.
OracleCode One 2018: Java 5, 6, 7, 8, 9, 10, 11: What Did You Miss?
Those are the slides for my presentation at OracleCode One 2018.
Java is moving faster and faster. A lot of features are not as known as they should be.
Let's review together the ones I think you've missed in old versions.
Then I will kickstart you on 9, 10 and 11 features that you never had time to look at.
Recommended
Hadoop Installation_13_09_2022(1).docx
dfsgjdfgjfgsdg wetwe twe wet ewt we tqew teqw twet qw te tew twe tew wetew wetewtewtewtewtewtewtewtetwetewtwetwetewt wetewtewtwetwetwetewtewtewtewtewtewtewtewrtetwertewtewrtwtwetewtewtewtewtewtewtewtewtewtwetwtwetewtwetewtwttt tew twetwetewtewtewtewtewtewtewtewtewtewtewtew ewt ewtwetwerqytrwyrey w yqwreytrreyeryryeyyyreyrrreyhjsdjhdsjhsjsjsjshshsh asdb dfsgjdfgjfgsdg wetwe twe wet ewt we tqew teqw twet qw te tew twe tew wetew wetewtewtewtewtewtewtewtetwetewtwetwetewt wetewtewtwetwetwetewtewtewtewtewtewtewtewrtetwertewtewrtwtwetewtewtewtewtewtewtewtewtewtwetwtwetewtwetewtwttt tew twetwetewtewtewtewtewtewtewtewtewtewtewtew ewt ewtwetwerqytrwyrey w yqwreytrreyeryryeyyyreyrrreyhjsdjhdsjhsjsjsjshshsh asdb
Jersey Guice AOP
Poche chiacchiere e tanto codice per cercare rendere la nostra vita di
sviluppatori più divertente.
Parleremo di JAX-RS, le annotazioni, l'MVC che mette a disposizione e
l'integrazione di Jersey con Guice.
Useremo AOP per gestire log, transazioni e con l'aiuto di Infinispan
limiteremo le chamate concorrenti sul nostro cluster.
OracleCode One 2018: Java 5, 6, 7, 8, 9, 10, 11: What Did You Miss?
Those are the slides for my presentation at OracleCode One 2018.
Java is moving faster and faster. A lot of features are not as known as they should be.
Let's review together the ones I think you've missed in old versions.
Then I will kickstart you on 9, 10 and 11 features that you never had time to look at.
От Java Threads к лямбдам, Андрей Родионов
Один из основных мотивов добавления в Java 8 лямбда-выражений — упростить написание многопоточных программ. На примере несложной вычислительной задачи я покажу эволюцию средств Java для многопоточности. Начнём с Java Threads, а закончим лямбда-выражениями и Stream API. Ну и в результате посмотрим, что и как вышло.
please help finish sorting methods- import java-util-Arrays- import ja.pdf
please help finish sorting methods:
import java.util.Arrays;
import java.io.PrintWriter;
import java.io.File;
import java.util.Scanner;
public class SortTimes
{
/* convert nanos to seconds */
static final double ONE_BILLION = 1_000_000_000.;
/* sizes of input range should range up to 512k elements */
static int[] sizes = new int[32];
public static void main(String[] args) throws Exception
{
int sIdx = 0;
long startTime;
long endTime;
double time;
int size = 128*1024/sizes.length;
/* let's make size smaller, comment out this next line and see what happens */
size = 16*1024/sizes.length;
for( int i=0; i<sizes.length; i++ ) {
sizes[i] = (i+1)*size;
}
Scanner inp = new Scanner(System.in);
System.out.print("What is your last name? ");
String lastName = inp.next();
PrintWriter pw = new PrintWriter(new File(lastName + "_sortTimes.csv"));
pw.println( "Size, BubbleSort, MergeSort, QuickSort, JavaSort, BubbleSort (Sorted Array),
MergeSort (Sorted Array), QuickSort (Sorted Array), JavaSort (Sorted Array)" );
while( sIdx < sizes.length )
{
int[] A = new int[sizes[sIdx]];
int[] B = new int[sizes[sIdx]];
int[] C = new int[sizes[sIdx]];
int[] D = new int[sizes[sIdx]];
int[] E = new int[sizes[sIdx]];
for( int i=0; i<A.length; i++ )
{
A[i] = (int)(Math.random()*sizes[sIdx]*2);
B[i] = A[i];
C[i] = A[i];
D[i] = A[i];
E[i] = 1000; // Array E is used for testing algo on array that is already sorted.
}
System.out.println();
System.out.println("--------------------------------------------------");
System.out.println("Initial Values: ");
printArray(A);
pw.print(A.length + ", ");
System.out.println( "Starting bubble sort ---------------- Size = " + B.length);
startTime = System.nanoTime();
bubbleSort(A);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "Bubble sort finished - time = " + time + " seconds" );
pw.print(time + ", ");
printArray(A);
System.out.println();
System.out.println( "Starting merge sort ---------------- Size = " + C.length);
startTime = System.nanoTime();
mergeSort(B);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "Merge sort finished - time = " + time + " seconds.");
pw.print(time + ", ");
printArray(B);
System.out.println();
System.out.println( "Starting quick sort ---------------- Size = " + D.length);
startTime = System.nanoTime();
quickSort(C);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "quickSort finished - time = " + time + " seconds." );
pw.print(time + ", ");
printArray(C);
System.out.println();
System.out.println( "Starting java's Array sort ---------------- Size = " + D.length);
startTime = System.nanoTime();
javaSort(D);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "Java's Array sort finished - time = " + time + " seconds." );
pw.print(time + ", ");
printArray(D);
System.out.println();
System.out.println( "Starting bubble sort on sorted array -------.
От Java Threads к лямбдам, Андрей Родионов
Один из основных мотивов добавления в Java 8 лямбда-выражений — упростить написание многопоточных программ. На примере несложной вычислительной задачи я покажу эволюцию средств Java для многопоточности. Начнём с Java Threads, а закончим лямбда-выражениями и Stream API. Ну и в результате посмотрим, что и как вышло.
import java-util-Arrays- import java-io-PrintWriter- import java-io-Fi.pdf
import java.util.Arrays;
import java.io.PrintWriter;
import java.io.File;
import java.util.Scanner;
public class SortTimes
{
/* convert nanos to seconds */
static final double ONE_BILLION = 1_000_000_000.;
/* sizes of input range should range up to 512k elements */
static int[] sizes = new int[32];
public static void main(String[] args) throws Exception
{
int sIdx = 0;
long startTime;
long endTime;
double time;
int size = 128*1024/sizes.length;
/* let's make size smaller, comment out this next line and see what happens */
size = 16*1024/sizes.length;
for( int i=0; i<sizes.length; i++ ) {
sizes[i] = (i+1)*size;
}
Scanner inp = new Scanner(System.in);
System.out.print("What is your last name? ");
String lastName = inp.next();
PrintWriter pw = new PrintWriter(new File(lastName + "_sortTimes.csv"));
pw.println( "Size, BubbleSort, MergeSort, QuickSort, JavaSort, BubbleSort (Sorted Array),
MergeSort (Sorted Array), QuickSort (Sorted Array), JavaSort (Sorted Array)" );
while( sIdx < sizes.length )
{
int[] A = new int[sizes[sIdx]];
int[] B = new int[sizes[sIdx]];
int[] C = new int[sizes[sIdx]];
int[] D = new int[sizes[sIdx]];
int[] E = new int[sizes[sIdx]];
for( int i=0; i<A.length; i++ )
{
A[i] = (int)(Math.random()*sizes[sIdx]*2);
B[i] = A[i];
C[i] = A[i];
D[i] = A[i];
E[i] = 1000; // Array E is used for testing algo on array that is already sorted.
}
System.out.println();
System.out.println("--------------------------------------------------");
System.out.println("Initial Values: ");
printArray(A);
pw.print(A.length + ", ");
System.out.println( "Starting bubble sort ---------------- Size = " + B.length);
startTime = System.nanoTime();
bubbleSort(A);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "Bubble sort finished - time = " + time + " seconds" );
pw.print(time + ", ");
printArray(A);
System.out.println();
System.out.println( "Starting merge sort ---------------- Size = " + C.length);
startTime = System.nanoTime();
mergeSort(B);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "Merge sort finished - time = " + time + " seconds.");
pw.print(time + ", ");
printArray(B);
System.out.println();
System.out.println( "Starting quick sort ---------------- Size = " + D.length);
startTime = System.nanoTime();
quickSort(C);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "quickSort finished - time = " + time + " seconds." );
pw.print(time + ", ");
printArray(C);
System.out.println();
System.out.println( "Starting java's Array sort ---------------- Size = " + D.length);
startTime = System.nanoTime();
javaSort(D);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "Java's Array sort finished - time = " + time + " seconds." );
pw.print(time + ", ");
printArray(D);
System.out.println();
System.out.println( "Starting bubble sort on sorted array ---------------- Size = " + B.length);
star.
Comments added... import java.io.File; import java.io.FileNotF.pdf
Comments added...
import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;
/**
*
* @author prmsh
*/
public class SaveMatrix {
public static void main(String args[]) {
//declaring matrix..
String[][] data = new String[4][4];
int row = 0;
// opening and reading file
File file = new File(\"matrix.txt\");
try {
Scanner sc = new Scanner(file);
while (sc.hasNextLine()) {
String line = sc.nextLine();
//splitting each row by spaces
String[] lineArray = line.split(\" \");
//storing into array
for(int i=0; i
Solution
Comments added...
import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;
/**
*
* @author prmsh
*/
public class SaveMatrix {
public static void main(String args[]) {
//declaring matrix..
String[][] data = new String[4][4];
int row = 0;
// opening and reading file
File file = new File(\"matrix.txt\");
try {
Scanner sc = new Scanner(file);
while (sc.hasNextLine()) {
String line = sc.nextLine();
//splitting each row by spaces
String[] lineArray = line.split(\" \");
//storing into array
for(int i=0; i.
Create & Execute First Hadoop MapReduce Project in.pptx
Create & Execute First Hadoop MapReduce Project in Eclipse
Basic java, java collection Framework and Date Time API
Basic java, java collection Framework and Date Time API
JAVA Question : Programming Assignment
Looking for Java assignment assistance? Discover Coding Assignment Help, your ultimate destination for expert guidance! 🌟 Our skilled Java programmers are here to provide tailored solutions that will help you conquer any coding task. Follow us on Pinterest for valuable resources, tips, and inspiration to enhance your Java skills and achieve academic success!
Visit : https://www.codingassignmenthelp.com/
Program Assignment Process ManagementObjective This program a.docx
Program Assignment : Process Management
Objective: This program assignment is given to the Operating Systems course to allow the students to figure out how a single process (parent process) creates a child process and how they work on Unix/Linux(/Mac OS X/Windows) environment. Additionally, student should combine the code for describing inter-process communication into this assignment. Both parent and child processes interact with each other through shared memory-based communication scheme or message passing scheme.
Environment: Unix/Linux environment (VM Linux or Triton Server, or Mac OS X), Windows platform
Language: C or C++, Java
Requirements:
i. You have wide range of choices for this assignment. First, design your program to explain the basic concept of the process management in Unix Kernel. This main idea will be evolved to show your understanding on inter-process communication, file processing, etc.
ii. Refer to the following system calls:
- fork(), getpid(), family of exec(), wait(), sleep() system calls for process management
- shmget(), shmat(), shmdt(), shmctl() for shared memory support or
- msgget(), msgsnd(), msgrcv(), msgctl(), etc. for message passing support
iii. The program should present that two different processes, both parent and child, execute as they are supposed to.
iv. The output should contain the screen capture of the execution procedure of the program.
v. Interaction between parent and child processes can be provided through inter-process communication schemes, such as shared-memory or message passing schemes.
vi. Result should be organized as a document which explains the overview of your program, code, execution results, and the conclusion including justification of your program, lessons you've learned, comments, etc.
Note:
i. In addition, please try to understand how the local and global variables work across the processes
ii. read() or write () functions are used to understand how they work on the different processes.
iii. For extra credit, you can also incorporate advanced features, like socket or thread functions, into your code.
Examples:
1. Process Creation and IPC with Shared Memory Scheme
=============================================================
#include <stdio.h>
#include <sys/shm.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <unistd.h>
int main(){
pid_t pid;
int segment_id; //allocate the memory
char *shared_memory; //pointer to memory
const int size = 4096;
segment_id = shmget(IPC_PRIVATE, size, S_IRUSR | S_IWUSR);
shared_memory = (char *) shmat(segment_id, NULL, 0);
pid = fork();
if(pid < 0) { //error
fprintf(stderr, "Fork failed");
return 1;
}
else if(pid == 0){ //child process
char *child_shared_memory;
child_shared_memory = (char *) shmat(segment_id,NULL,0); //attach mem
sprintf(child_shared_memory, "Hello parent process!"); //write to the shared mem
shmdt(child_shared_memory);
}
else ...
Business management 1. True or False Diversification is when compa.pdf
Business management 1. True or False: Diversification is when companies operate several
businesses to spread their risk and/or enter new markets. 2. True or False: Focus-Differentiation
Strategy is a strategy focuses on products or services that are of unique and superior value
compared with those of competitors while targeting a narrow market. 3. True or False: Growth
strategy, stability strategy and defensive strategy are three types of corporate strategies. 4. True
or False: Conceptual decision makers are decision makers who rely on intuition and have a long-
term perspective. 5. True or False: Generalizing from a small sample or a single event is called
representative bias. 6. True or False: Group think is a cohesive group's blind unwillingness to
consider alternatives. 7. True or False: Data analytics is the process of examining data sets in
order to draw conclusions about the information they contain. 8. True or False: Observable
artifacts, espoused values, and basic assumptions are three levels of organizational culture. 9.
True or False: Culture powerfully shapes an organization's long-term success by enhancing its
systems and influencing its important outcomes at various levels. 10. True or False: A simple
struct has authority centralized in a single person, also known as a flat hierarchy..
Complete in JavaCardApp.javapublic class CardApp { private.pdf
Complete in Java
CardApp.java
public class CardApp {
private LinkedList list;
/**
* User interface prompts user, reads and writes files.
*/
public static void main(String[] args) {
}
/**
* Default constructor to initialize the deck
*/
public CardApp() {
}
/**
* Inserts a new Card into the deck
* @param card a playing Card
*/
public void addCard(Card card) {
}
/**
* Shuffles cards following this algorithm:
* First swaps first and last card
* Next, swaps every even card with the card 3
* nodes away from that card. Stops when it
* reaches the 3rd to last node
* Then, swaps ALL cards with the card that is
* 2 nodes away from it, starting at the 2nd card
* and stopping stopping at the 3rd to last node
*/
public void shuffle() {
}
/**
* Implements the bubble sort algorithm
* to sort cardList into sorted order, first by suit
* (alphabetical order)
* then by rank from 2 to A
*/
public void sort() {
}
/**
* Returns the deck of cards with each card separated
* by a blank space and a new line character at the end.
* @return The deck of cards as a string.
*/
@Override public String toString() {
return "";
}
}
Card.java
public class Card implements Comparable{
private String rank;
private String suit;
/**
* Constructor for the Card class
* @param rank the rank of card from 2 to A
* @param suit the suit of card C, D, H, or S
*/
public Card(String rank, String suit) {
}
/**
* Returns the card's rank
* @return rank a rank from 2 (low) to A (high)
*/
public String getRank() {
return "";
}
/**
* Returns the card's suit
* @return C, D, H, or S
*/
public String getSuit() {
return "";
}
/**
* Updates the card's rank
* @param rank a new rank
*/
public void setRank(String rank) {
}
/**
* Updates the card's suit
* @param suit the new suit
*/
public void setSuit(String suit) {
}
/**
* Concatenates rank and suit
* @return card rank and suit
*/
@Override public String toString() {
return "";
}
/**
* Overrides the equals method for Card
* Compares rank and suit and
* follows the equals formula given in
* Lesson 4 and also in Joshua Block's text
* @param obj another Object to compare for
* equality
* @return whether obj is a Card and, if so,
* of equal rank and suit
*/
@Override public boolean equals(Object obj) {
return false;
}
/**
* Orders two cards first by suit (alphabetically)
* Next by rank. "A" is considered the high card
* Order goes 2, 3, 4, 5, 6, 7, 8, 9, 10, J, Q, K, A
* @param card another Card to compare to this Card
* @return a negative number if this comes before c
* and a positive number if c comes before this
* and 0 if this and c are equal according to the above
* equals method
*/
@Override public int compareTo(Card card) {
return -1;
}
}
}
LinkedList.Java
import java.util.NoSuchElementException;
public class LinkedList {
private class Node {
private T data;
private Node next;
private Node prev;
public Node(T data) {
this.data = data;
this.next = null;
this.prev = null;
}
}
private int length;
private Node first;
private Node last;
private Node iterato.
More Related Content
Similar to Can some one redo this code without the try-catch and an alternative.pdf
От Java Threads к лямбдам, Андрей Родионов
Один из основных мотивов добавления в Java 8 лямбда-выражений — упростить написание многопоточных программ. На примере несложной вычислительной задачи я покажу эволюцию средств Java для многопоточности. Начнём с Java Threads, а закончим лямбда-выражениями и Stream API. Ну и в результате посмотрим, что и как вышло.
please help finish sorting methods- import java-util-Arrays- import ja.pdf
please help finish sorting methods:
import java.util.Arrays;
import java.io.PrintWriter;
import java.io.File;
import java.util.Scanner;
public class SortTimes
{
/* convert nanos to seconds */
static final double ONE_BILLION = 1_000_000_000.;
/* sizes of input range should range up to 512k elements */
static int[] sizes = new int[32];
public static void main(String[] args) throws Exception
{
int sIdx = 0;
long startTime;
long endTime;
double time;
int size = 128*1024/sizes.length;
/* let's make size smaller, comment out this next line and see what happens */
size = 16*1024/sizes.length;
for( int i=0; i<sizes.length; i++ ) {
sizes[i] = (i+1)*size;
}
Scanner inp = new Scanner(System.in);
System.out.print("What is your last name? ");
String lastName = inp.next();
PrintWriter pw = new PrintWriter(new File(lastName + "_sortTimes.csv"));
pw.println( "Size, BubbleSort, MergeSort, QuickSort, JavaSort, BubbleSort (Sorted Array),
MergeSort (Sorted Array), QuickSort (Sorted Array), JavaSort (Sorted Array)" );
while( sIdx < sizes.length )
{
int[] A = new int[sizes[sIdx]];
int[] B = new int[sizes[sIdx]];
int[] C = new int[sizes[sIdx]];
int[] D = new int[sizes[sIdx]];
int[] E = new int[sizes[sIdx]];
for( int i=0; i<A.length; i++ )
{
A[i] = (int)(Math.random()*sizes[sIdx]*2);
B[i] = A[i];
C[i] = A[i];
D[i] = A[i];
E[i] = 1000; // Array E is used for testing algo on array that is already sorted.
}
System.out.println();
System.out.println("--------------------------------------------------");
System.out.println("Initial Values: ");
printArray(A);
pw.print(A.length + ", ");
System.out.println( "Starting bubble sort ---------------- Size = " + B.length);
startTime = System.nanoTime();
bubbleSort(A);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "Bubble sort finished - time = " + time + " seconds" );
pw.print(time + ", ");
printArray(A);
System.out.println();
System.out.println( "Starting merge sort ---------------- Size = " + C.length);
startTime = System.nanoTime();
mergeSort(B);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "Merge sort finished - time = " + time + " seconds.");
pw.print(time + ", ");
printArray(B);
System.out.println();
System.out.println( "Starting quick sort ---------------- Size = " + D.length);
startTime = System.nanoTime();
quickSort(C);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "quickSort finished - time = " + time + " seconds." );
pw.print(time + ", ");
printArray(C);
System.out.println();
System.out.println( "Starting java's Array sort ---------------- Size = " + D.length);
startTime = System.nanoTime();
javaSort(D);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "Java's Array sort finished - time = " + time + " seconds." );
pw.print(time + ", ");
printArray(D);
System.out.println();
System.out.println( "Starting bubble sort on sorted array -------.
От Java Threads к лямбдам, Андрей Родионов
Один из основных мотивов добавления в Java 8 лямбда-выражений — упростить написание многопоточных программ. На примере несложной вычислительной задачи я покажу эволюцию средств Java для многопоточности. Начнём с Java Threads, а закончим лямбда-выражениями и Stream API. Ну и в результате посмотрим, что и как вышло.
import java-util-Arrays- import java-io-PrintWriter- import java-io-Fi.pdf
import java.util.Arrays;
import java.io.PrintWriter;
import java.io.File;
import java.util.Scanner;
public class SortTimes
{
/* convert nanos to seconds */
static final double ONE_BILLION = 1_000_000_000.;
/* sizes of input range should range up to 512k elements */
static int[] sizes = new int[32];
public static void main(String[] args) throws Exception
{
int sIdx = 0;
long startTime;
long endTime;
double time;
int size = 128*1024/sizes.length;
/* let's make size smaller, comment out this next line and see what happens */
size = 16*1024/sizes.length;
for( int i=0; i<sizes.length; i++ ) {
sizes[i] = (i+1)*size;
}
Scanner inp = new Scanner(System.in);
System.out.print("What is your last name? ");
String lastName = inp.next();
PrintWriter pw = new PrintWriter(new File(lastName + "_sortTimes.csv"));
pw.println( "Size, BubbleSort, MergeSort, QuickSort, JavaSort, BubbleSort (Sorted Array),
MergeSort (Sorted Array), QuickSort (Sorted Array), JavaSort (Sorted Array)" );
while( sIdx < sizes.length )
{
int[] A = new int[sizes[sIdx]];
int[] B = new int[sizes[sIdx]];
int[] C = new int[sizes[sIdx]];
int[] D = new int[sizes[sIdx]];
int[] E = new int[sizes[sIdx]];
for( int i=0; i<A.length; i++ )
{
A[i] = (int)(Math.random()*sizes[sIdx]*2);
B[i] = A[i];
C[i] = A[i];
D[i] = A[i];
E[i] = 1000; // Array E is used for testing algo on array that is already sorted.
}
System.out.println();
System.out.println("--------------------------------------------------");
System.out.println("Initial Values: ");
printArray(A);
pw.print(A.length + ", ");
System.out.println( "Starting bubble sort ---------------- Size = " + B.length);
startTime = System.nanoTime();
bubbleSort(A);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "Bubble sort finished - time = " + time + " seconds" );
pw.print(time + ", ");
printArray(A);
System.out.println();
System.out.println( "Starting merge sort ---------------- Size = " + C.length);
startTime = System.nanoTime();
mergeSort(B);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "Merge sort finished - time = " + time + " seconds.");
pw.print(time + ", ");
printArray(B);
System.out.println();
System.out.println( "Starting quick sort ---------------- Size = " + D.length);
startTime = System.nanoTime();
quickSort(C);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "quickSort finished - time = " + time + " seconds." );
pw.print(time + ", ");
printArray(C);
System.out.println();
System.out.println( "Starting java's Array sort ---------------- Size = " + D.length);
startTime = System.nanoTime();
javaSort(D);
endTime = System.nanoTime();
time = (endTime - startTime) / ONE_BILLION;
System.out.println( "Java's Array sort finished - time = " + time + " seconds." );
pw.print(time + ", ");
printArray(D);
System.out.println();
System.out.println( "Starting bubble sort on sorted array ---------------- Size = " + B.length);
star.
Comments added... import java.io.File; import java.io.FileNotF.pdf
Comments added...
import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;
/**
*
* @author prmsh
*/
public class SaveMatrix {
public static void main(String args[]) {
//declaring matrix..
String[][] data = new String[4][4];
int row = 0;
// opening and reading file
File file = new File(\"matrix.txt\");
try {
Scanner sc = new Scanner(file);
while (sc.hasNextLine()) {
String line = sc.nextLine();
//splitting each row by spaces
String[] lineArray = line.split(\" \");
//storing into array
for(int i=0; i
Solution
Comments added...
import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;
/**
*
* @author prmsh
*/
public class SaveMatrix {
public static void main(String args[]) {
//declaring matrix..
String[][] data = new String[4][4];
int row = 0;
// opening and reading file
File file = new File(\"matrix.txt\");
try {
Scanner sc = new Scanner(file);
while (sc.hasNextLine()) {
String line = sc.nextLine();
//splitting each row by spaces
String[] lineArray = line.split(\" \");
//storing into array
for(int i=0; i.
Create & Execute First Hadoop MapReduce Project in.pptx
Create & Execute First Hadoop MapReduce Project in Eclipse
Basic java, java collection Framework and Date Time API
Basic java, java collection Framework and Date Time API
JAVA Question : Programming Assignment
Looking for Java assignment assistance? Discover Coding Assignment Help, your ultimate destination for expert guidance! 🌟 Our skilled Java programmers are here to provide tailored solutions that will help you conquer any coding task. Follow us on Pinterest for valuable resources, tips, and inspiration to enhance your Java skills and achieve academic success!
Visit : https://www.codingassignmenthelp.com/
Program Assignment Process ManagementObjective This program a.docx
Program Assignment : Process Management
Objective: This program assignment is given to the Operating Systems course to allow the students to figure out how a single process (parent process) creates a child process and how they work on Unix/Linux(/Mac OS X/Windows) environment. Additionally, student should combine the code for describing inter-process communication into this assignment. Both parent and child processes interact with each other through shared memory-based communication scheme or message passing scheme.
Environment: Unix/Linux environment (VM Linux or Triton Server, or Mac OS X), Windows platform
Language: C or C++, Java
Requirements:
i. You have wide range of choices for this assignment. First, design your program to explain the basic concept of the process management in Unix Kernel. This main idea will be evolved to show your understanding on inter-process communication, file processing, etc.
ii. Refer to the following system calls:
- fork(), getpid(), family of exec(), wait(), sleep() system calls for process management
- shmget(), shmat(), shmdt(), shmctl() for shared memory support or
- msgget(), msgsnd(), msgrcv(), msgctl(), etc. for message passing support
iii. The program should present that two different processes, both parent and child, execute as they are supposed to.
iv. The output should contain the screen capture of the execution procedure of the program.
v. Interaction between parent and child processes can be provided through inter-process communication schemes, such as shared-memory or message passing schemes.
vi. Result should be organized as a document which explains the overview of your program, code, execution results, and the conclusion including justification of your program, lessons you've learned, comments, etc.
Note:
i. In addition, please try to understand how the local and global variables work across the processes
ii. read() or write () functions are used to understand how they work on the different processes.
iii. For extra credit, you can also incorporate advanced features, like socket or thread functions, into your code.
Examples:
1. Process Creation and IPC with Shared Memory Scheme
=============================================================
#include <stdio.h>
#include <sys/shm.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <unistd.h>
int main(){
pid_t pid;
int segment_id; //allocate the memory
char *shared_memory; //pointer to memory
const int size = 4096;
segment_id = shmget(IPC_PRIVATE, size, S_IRUSR | S_IWUSR);
shared_memory = (char *) shmat(segment_id, NULL, 0);
pid = fork();
if(pid < 0) { //error
fprintf(stderr, "Fork failed");
return 1;
}
else if(pid == 0){ //child process
char *child_shared_memory;
child_shared_memory = (char *) shmat(segment_id,NULL,0); //attach mem
sprintf(child_shared_memory, "Hello parent process!"); //write to the shared mem
shmdt(child_shared_memory);
}
else ...
Similar to Can some one redo this code without the try-catch and an alternative.pdf (20)
Apache Flink Training: DataStream API Part 2 Advanced
Apache Flink Training: DataStream API Part 2 Advanced
please help finish sorting methods- import java-util-Arrays- import ja.pdf
please help finish sorting methods- import java-util-Arrays- import ja.pdf
import java-util-Arrays- import java-io-PrintWriter- import java-io-Fi.pdf
import java-util-Arrays- import java-io-PrintWriter- import java-io-Fi.pdf
Comments added... import java.io.File; import java.io.FileNotF.pdf
Comments added... import java.io.File; import java.io.FileNotF.pdf
Create & Execute First Hadoop MapReduce Project in.pptx
Create & Execute First Hadoop MapReduce Project in.pptx
Basic java, java collection Framework and Date Time API
Basic java, java collection Framework and Date Time API
Program Assignment Process ManagementObjective This program a.docx
Program Assignment Process ManagementObjective This program a.docx
More from MAYANKBANSAL1981
Business management 1. True or False Diversification is when compa.pdf
Business management 1. True or False: Diversification is when companies operate several
businesses to spread their risk and/or enter new markets. 2. True or False: Focus-Differentiation
Strategy is a strategy focuses on products or services that are of unique and superior value
compared with those of competitors while targeting a narrow market. 3. True or False: Growth
strategy, stability strategy and defensive strategy are three types of corporate strategies. 4. True
or False: Conceptual decision makers are decision makers who rely on intuition and have a long-
term perspective. 5. True or False: Generalizing from a small sample or a single event is called
representative bias. 6. True or False: Group think is a cohesive group's blind unwillingness to
consider alternatives. 7. True or False: Data analytics is the process of examining data sets in
order to draw conclusions about the information they contain. 8. True or False: Observable
artifacts, espoused values, and basic assumptions are three levels of organizational culture. 9.
True or False: Culture powerfully shapes an organization's long-term success by enhancing its
systems and influencing its important outcomes at various levels. 10. True or False: A simple
struct has authority centralized in a single person, also known as a flat hierarchy..
Complete in JavaCardApp.javapublic class CardApp { private.pdf
Complete in Java
CardApp.java
public class CardApp {
private LinkedList list;
/**
* User interface prompts user, reads and writes files.
*/
public static void main(String[] args) {
}
/**
* Default constructor to initialize the deck
*/
public CardApp() {
}
/**
* Inserts a new Card into the deck
* @param card a playing Card
*/
public void addCard(Card card) {
}
/**
* Shuffles cards following this algorithm:
* First swaps first and last card
* Next, swaps every even card with the card 3
* nodes away from that card. Stops when it
* reaches the 3rd to last node
* Then, swaps ALL cards with the card that is
* 2 nodes away from it, starting at the 2nd card
* and stopping stopping at the 3rd to last node
*/
public void shuffle() {
}
/**
* Implements the bubble sort algorithm
* to sort cardList into sorted order, first by suit
* (alphabetical order)
* then by rank from 2 to A
*/
public void sort() {
}
/**
* Returns the deck of cards with each card separated
* by a blank space and a new line character at the end.
* @return The deck of cards as a string.
*/
@Override public String toString() {
return "";
}
}
Card.java
public class Card implements Comparable{
private String rank;
private String suit;
/**
* Constructor for the Card class
* @param rank the rank of card from 2 to A
* @param suit the suit of card C, D, H, or S
*/
public Card(String rank, String suit) {
}
/**
* Returns the card's rank
* @return rank a rank from 2 (low) to A (high)
*/
public String getRank() {
return "";
}
/**
* Returns the card's suit
* @return C, D, H, or S
*/
public String getSuit() {
return "";
}
/**
* Updates the card's rank
* @param rank a new rank
*/
public void setRank(String rank) {
}
/**
* Updates the card's suit
* @param suit the new suit
*/
public void setSuit(String suit) {
}
/**
* Concatenates rank and suit
* @return card rank and suit
*/
@Override public String toString() {
return "";
}
/**
* Overrides the equals method for Card
* Compares rank and suit and
* follows the equals formula given in
* Lesson 4 and also in Joshua Block's text
* @param obj another Object to compare for
* equality
* @return whether obj is a Card and, if so,
* of equal rank and suit
*/
@Override public boolean equals(Object obj) {
return false;
}
/**
* Orders two cards first by suit (alphabetically)
* Next by rank. "A" is considered the high card
* Order goes 2, 3, 4, 5, 6, 7, 8, 9, 10, J, Q, K, A
* @param card another Card to compare to this Card
* @return a negative number if this comes before c
* and a positive number if c comes before this
* and 0 if this and c are equal according to the above
* equals method
*/
@Override public int compareTo(Card card) {
return -1;
}
}
}
LinkedList.Java
import java.util.NoSuchElementException;
public class LinkedList {
private class Node {
private T data;
private Node next;
private Node prev;
public Node(T data) {
this.data = data;
this.next = null;
this.prev = null;
}
}
private int length;
private Node first;
private Node last;
private Node iterato.
Change to oop formatimport java.util.Scanner;import java.io.;.pdf
Change to oop format
import java.util.Scanner;
import java.io.*;
import java.text.DecimalFormat;
public class Amortization {
/* call values in, set balance and principle. set month to increment until reaching number
provided. use \t to space out result well.
Use PritWriter output instead of System.output to make the notepad file.*/
public static void createReport(String filename, double loan, double interestRate, int years)
throws IOException {
PrintWriter output = new PrintWriter(new FileWriter(filename));
double monthlyPayment = calcPayment(loan, interestRate, years);
int numberOfPayments = getNumberOfPayments(years);
double balance = loan;
output.println("{Monthly Payment}: " + monthlyPayment);
output.println("{Month} \t {Interest} \t {Principal} \t {Balance}");
for (int month = 1; month <= numberOfPayments; month++) {
double interest = balance * (interestRate / 12);
double principal = monthlyPayment - interest;
balance -= principal;
output.printf("%d \t \t %.2f \t \t %.2f \t \t %.2f \\\n", month, interest, principal, balance);
}
output.close();
}
public static void main(String[] args) {
Scanner keyboard = new Scanner(System.in);
DecimalFormat df = new DecimalFormat("#.##");
do {
/* Data members */
double loan;
int years;
double interestRate;
/* Get amount, interest rate, and years from the user */
System.out.println("Enter the loan amount: ");
loan = keyboard.nextDouble();
System.out.println("Enter the annual interest rate: ");
interestRate = keyboard.nextDouble() / 100.0;
System.out.println("Enter the years of the loan: ");
years = keyboard.nextInt();
double payment = calcPayment(loan, interestRate, years);
if (payment < 0) {
System.out.println("Invalid input values.");
} else {
System.out.println("Monthly Payment: " + df.format(payment));
int numberOfPayments = getNumberOfPayments(years);
System.out.println("Total Number of Payments: " + numberOfPayments);
try {
createReport("LoanAmortization.txt", loan, interestRate, years);
System.out.println("Report created successfully.");
} catch (IOException e)
{
System.out.println("Error creating report: " + e.getMessage());
}
}
System.out.println("Would you like to run another report? Enter Y for yes or N for no: ");
} while (keyboard.next().equalsIgnoreCase("Y"));
keyboard.close();
}
public static double calcPayment(double loan, double interestRate, int years) {
double term = Math.pow(1 + (interestRate / 12), years * 12);
double payment = (loan * (interestRate / 12) * term) / (term - 1);
return payment;
}
public static int getNumberOfPayments(int years) {
return years * 12; // Assuming monthly payments for the given number of years
}
public static void createReport(String filename) throws IOException {
// Sample implementation to save data to a file
PrintWriter out = new PrintWriter(new FileWriter(filename, true));
out.println("Sample Data");
out.close();
}
}.
Case Project 2-1 Advance PreparationsThe IT managers from Chicago.pdf
Case Project 2-1: Advance Preparations
The IT managers from Chicago and Toronto have decided the first step is to form a transition
committee to plan and track the progress of the server upgrades. The committee consists of both
IT managers (from each location), two department heads from each location, the chief financial
officer, the director of operations, a senior applications programmer, and a senior systems
programmer.
During the kickoff meeting, you briefly mention a few advance preparation steps the committee
needs to know about. In response, the committee asks you to create a full report or slide
presentation of the steps that need to be considered in advance for Windows Server 2016
installations. In your report or slide show, present all of the steps appropriate to Gym Masters'
situation
Case Project 2-2: Server Roles
The committee has recently been discussing the functions of each server. They are not familiar
with server roles, but they do know how specific servers are used. Some of the server functions
they mention include:
Providing a website
Supporting mobile devices for accessing the server over the network
Offering shared files on large scale
Managing Active Directory functions for the domain
Offering VPNs
Coordinating printing
Providing web-based applications to internal users
Create a short report for the committee that translates each of these functions into server roles
offered through Windows Server 2016. Also, suggest some other roles that are likely necessary
on the company's networks (Hint: Consider managing IP address assignments and translating
computer names and IP addresses). Include a short explanation of each server role you mention..
Banks are singled out for special attention in the financial sys.pdf
Banks are singled out for special attention in the financial system because
Banks are singled out for special attention in the financial system because
Banks are singled out for special attention in the financial system because Financial Analyses -
Provide answers based on both qualitative and quantitative analyses to the following questions:
1. Is the solar industry an attractive industry? Why or why not? Be specific. Students will also
discuss what Porter's Five Forces reveal about the solar industry. 2. From 2007-2011, First Solar
was consistently more profitable than its major competitors: SunPower, Suntech, and Yingli.
What are the sources of First Solar's competitive advantage? Are they sustainable? Where you
can, be quantitative. 3. Looking forward, what are the biggest threats to First Solar's strategy?
What recommendations would you make to Tymen de Jong to guide First Solar?.
ASSETS LIABILITIES Cash $10,000 Accounts payable $12,000 Accounts re.pdf
ASSETS LIABILITIES Cash $10,000 Accounts payable $12,000 Accounts receivable 100,000
Notes payable 50,000 Inventory Total current liabilities Total current assets $220,000 Long-term
debt Gross PP&E 500,000 Total Liabilities $190,000 Less accumulated depreciation Net PP&E
$375,000 EQUITY Total Assets Common stock ($1 par; 100,000 shares) Paid-in capital
Retained earnings 150,000 Total stockholders equity Total Liabilities and Equity Reminder:
A=L+E
ASSETSLIABILITIESCash$10,000 Accounts payable$12,000 Accounts
receivable100,000Notes payable50,000InventoryTotal current liabilitiesTotal current
assets$220,000 Long-term debtGross PP&E500,000Total Liabilities$190,000 Less accumulated
depreciationNet PP&E$375,000 EQUITYTotal AssetsCommon stock ($1 par; 100,000
shares)Paid-in capitalRetained earnings150,000Total stockholders equityTotal Liabilities and
EquityReminder: A=L+E.
A. Monitoring Internet Endpoints and Bandwidth Consumption1. NetFl.pdf
A. Monitoring Internet Endpoints and Bandwidth Consumption
1. NetFlow/Slow: NetFlow and Slow are protocols used for monitoring network traffic. Network
devices like routers and switches can be configured to export flow data to a collector. This data
includes information such as source and destination IP addresses, ports, and the volume of data
transferred. By analyzing this data, we can gain insights into which clients are communicating
with which servers and the amount of bandwidth they are using.
2. Packet Sniffers: Packet sniffers like Wireshark capture and analyze individual network
packets. They provide a detailed view of network traffic, including the actual data payload.
While this approach is thorough, it can be resource-intensive, and storing all packets may require
significant storage capacity.
3. Proxy Servers: Deploying a proxy server can help monitor internet usage by clients. Proxy
servers act as intermediaries between clients and servers, logging all requests and responses. This
provides detailed logs of web traffic, including URLs visited, data transferred, and user activity.
4. Intrusion Detection/Prevention Systems (IDS/IPS): IDS/PS systems are designed to monitor
network traffic for suspicious or unauthorized activity. They use predefined rules or anomaly
detection algorithms to identify potentially malicious behavior. When such behavior is detected,
these systems generate logs and alerts for further investigation.
If we lack the resources to capture and store all network packets, we can consider using sampling
techniques to capture a representative subset of traffic or filtering criteria to focus on specific
types of traffic. For instance, you might prioritize capturing and storing packets for traffic to and
from critical servers or for specific applications critical to our organization's operations.
B. Identifying the Local Host in a Data Exfiltration Event
Identifying the local host involved in data exfiltration from external server logs can be done as
follows:
1. Identify the External IP Address: Look in the web server logs to find the external IP address
associated with the data exfiltration.
This IP address typically corresponds to our company's router or firewall through which the data
left our network.
2. Analyze High-Level TCP Port Number: Examine the high-level TCP port number in the logs.
Some services or applications use specific ports. This can help us narrow down the scope of
potential local hosts.
3. Check Firewall or Network Device Logs: Access logs on our company's router/firewall or
other network devices responsible for outgoing traffic. Look for outbound connections
originating from the internal IP address linked to the external IP address identified in the web
server logs.
4. Cross-reference with Internal Logs: If your internal network has logs, such as firewall logs or
proxy server logs, cross-reference the external IP address and port number with these logs. This
will enable us to identify the local ho.
About your clientName Samantha BensonAge 54Marital status .pdf
About your client:
Name: Samantha Benson
Age: 54
Marital status: Married 2 adult children with former spouse, 1 minor child with current spouse
Health: Great health (an active tri-athlete) but a family history of heart disease
Occupation: Senior Director for Lion Industries, a $3 Billion Industrial Materials Firm
Income: $270,000 salary per year + bonus/stock options up to $1.5M
Total assets: $2.2M (not including value of home)
Total debt: $750,000 (which mostly is a mortgage on her primary residence of $600k)
Dependents: Minor child is age 17
Other notes: It is important to Samantha to provide for all 3 of her children in the event of her
early death. The adult children are struggling to find their way in life and
Samantha feels they have not yet established a secure future for their own
families. Samanthas former husband has very little assets. Her curent husband is
an Executive Director at a BioTech company, but he and Samantha like to keep
their finance separate as they feel they have each accumulated on their own
prior to their relationship
3) Samantha has her home and auto coverage through Acme Insurance, a company she went with
because of a referral from a co-worker. As you review Samanthas home and auto coverage,
what might you be looking for to ensure she has adequate coverage?.
About your clientName Samantha Benson Age 54 Marital status Ma.pdf
About your client:
Name: Samantha Benson Age: 54 Marital status: Married 2 adult children with former spouse, 1
minor child with current spouse Health: Great health (an active tri-athlete) but a family history of
heart disease Occupation: Senior Director for Lion Industries, a $3 Billion Industrial Materials
Firm Income: $270,000 salary per year + bonus/stock options up to $1.5M Total assets: $2.2M
(not including value of home) Total debt: $750,000 (which mostly is a mortgage on her primary
residence of $600k) Dependents: Minor child is age 17 Other notes: It is important to Samantha
to provide for all 3 of her children in the event of her early death. The adult children are
struggling to find their way in life and Samantha feels they have not yet established a secure
future for their own families. Samanthas former husband has very little assets. Her current
husband is an Executive Director at a BioTech company, but he and Samantha like to keep their
finance separate as they feel they have each accumulated on their own prior to their relationship
5)Consider other financial planning topics you may have been exposed to in your coursework
thus
far, such as Investment Planning, or Estate Planning. Identify any other concepts that you may
wish to cover with Samantha as it relates to the given information..
a) Complete both insert and delete methods. If it works correctly 10.pdf
a) Complete both insert and delete methods. If it works correctly 100 points each.
b) Do not call the search method in delete method.
c) Make sure to write your name in main method.
d) DO NOT MODIFY PROCESS METHOD.
3- Create a proper input file with respect to process method to test all cases in both
insert and delete methods.
4- Compile and execute your program at the command prompt. Check your output, if it
is correct
//xxxxxH5.java is linked list implementation of lstinterface.
//Eliminate count form both insert and delete methods
// If works correctly, 200 points
import java.util.*;
import java.io.*;
//lstinterface is an interface
public class xxxxxH5 implements lstinterface {
// xxxxxH5 class variables
//head is a pointer to beginning of linked list
private node head = null;
//use prt for System.out to save typing
PrintStream prt = System.out;
// class node
private class node{
// class node variables
int data;
node rlink; //right link
// class node constructor
node(int x){
data = x;
rlink = null;
} // end class node constructor
}// class node
// insert x at position p,
// if successful return 1 otherwise return 0
public int insert(int x, int p){
prt.printf("\n\t\tInsert %5d at position %2d:", x, p);
// complete this method
return 0; // successful insertion
} // end insert
// delete x at position p
// if successful return 1 otherwise return 0
public int delete(int p){
prt.printf("\n\t\tDelete element at position %2d:", p);
// complete this method
return 0; // successful insertion
} // end delete
// sequential serach for x in the list
// if successful return its position otherwise return 0;
public int search(int x){
// Local variables
node cur;
prt.printf("\n\t\tSearch for %5d:", x);
// Complete the rest of the method
int pos = 0;
for (cur = head; cur != null ; cur = cur.rlink){
pos ++;
if (cur.data == x){
prt.printf(" Found at position %2d, ", pos);
return pos;
} // end if
} // end for
prt.printf(" Not Found.");
return 0; // x is not found.
} // end search
// print list elements formatted
public void printlst() {
// Local variables
node cur;
prt.printf("\n\tList contents: ");
for (cur = head; cur != null ; cur = cur.rlink)
prt.printf("%5d,", cur.data);
// end for
} // end printlst
// insert delete and search in the list
private void process(String fn){
// Local variables
int j, ins, del, srch, k, p;
int x;
prt.printf("\tLinked List implementation of int list without"+
//\n\tusing count, gets input file name from method argument, then
reads:"+
"\n\tinteger No. of elements to insert(ins)"+
" followed by elements to insert and their positions,"+
"\n\tinteger No. of elements to search(srch) followed by element to
search"+
"\n\tinteger No. of elements to delete(del) followed by position of"+
"elements to delete" +
"\n\t\tTo compile: javac xxxxxH5.java" +
"\n\t\tTo execute: java xxxxxH5 inputfilename");
try{
// open input file
Scanner inf = new Scanner(new File(fn));
//read no. of elements to insert
ins = inf.nextInt();
prt.printf("\n\tInsert %.
About your client Name Samantha Benson Age 54 Marital status Ma.pdf
About your client
Name: Samantha Benson Age: 54 Marital status: Married 2 adult children with former spouse, 1
minor child with current spouse Health: Great health (an active tri-athlete) but a family history of
heart disease Occupation: Senior Director for Lion Industries, a $3 Billion Industrial Materials
Firm Income: $270,000 salary per year + bonus/stock options up to $1.5M Total assets: $2.2M
(not including value of home) Total debt: $750,000 (which mostly is a mortgage on her primary
residence of $600k) Dependents: Minor child is age 17 Other notes: It is important to Samantha
to provide for all 3 of her children in the event of her early death. The adult children are
struggling to find their way in life and Samantha feels they have not yet established a secure
future for their own families. Samanthas former husband has very little assets. Her current
husband is an Executive Director at a BioTech company, but he and Samantha like to keep their
finance separate as they feel they have each accumulated on their own prior to their relationship
2)Samantha has a small life insurance policy through her employer that self-cancels if she leaves
the company. She has never considered adding additional coverage. What type(s) might you
recommend and why?.
About your client Name Samantha BensonAge 54Marital status.pdf
About your client:
Name: Samantha Benson
Age: 54
Marital status: Married 2 adult children with former spouse, 1 minor child with current spouse
Health: Great health (an active tri-athlete) but a family history of heart disease
Occupation: Senior Director for Lion Industries, a $3 Billion Industrial Materials Firm
Income: $270,000 salary per year + bonus/stock options up to $1.5M
Total assets: $2.2M (not including value of home)
Total debt: $750,000 (which mostly is a mortgage on her primary residence of $600k)
Dependents: Minor child is age 17
Other notes: It is important to Samantha to provide for all 3 of her children in the event of her
early death. The adult children are struggling to find their way in life and
Samantha feels they have not yet established a secure future for their own
families. Samanthas former husband has very little assets. Her current husband is
an Executive Director at a BioTech company, but he and Samantha like to keep
their finance separate as they feel they have each accumulated on their own
prior to their relationship.
Answer the following prompts 1The InstantRide Management team foun.pdf
Answer the following prompts
1The InstantRide Management team founded a new team for car maintenance. The new team is
responsible for the small maintenance operations for the cars in the InstantRide system. The
main idea is to take actions faster and minimize the time spent for the maintenance. Therefore,
the Car Maintenance team wants to store MAINTENANCE_TYPE_ID (char(5)) and a
MAINTENANCE_TYPE_DESCRIPTION (varchar(30)) in the database. Using
MAINTENANCE_TYPE_ID as the PRIMARY KEY, create a new table,
MAINTENANCE_TYPES, and send the table description with the column names and types to
the Car Maintenance team.
2The Car Maintenance team also wants to store the actual maintenance operations in the
database. The team wants to start with a table to store CAR_ID (CHAR(5)),
MAINTENANCE_TYPE_ID (CHAR(5)) and MAINTENANCE_DUE (DATE) date for the
operation. Create a new table named MAINTENANCES. The PRIMARY_KEY should be the
combination of the three fields. The CAR_ID and MAINTENANCE_TYPE_ID should be
foreign keys to their original tables. Cascade update and cascade delete the foreign keys.
3The Driver Relationship team wants to create some workshops and increase communication
with the active drivers in InstantRide. Therefore, they requested a new database table to store the
driver details of the drivers that have had at least one ride in the system. Create a new table,
ACTIVE_DRIVERS, from the DRIVERS and TRAVELS tables which contains the following
fields:
4The Driver Relationship team wants to have quick search options for the active drivers. The
team specifically mentioned that they are using first name, last name and driving license ID to
search the drivers. Create an index called NameSearch on the ACTIVE_DRIVERS table created
in task 3.
5The Driver Relationship team requested to ensure that there will be no duplicates in the active
drivers tables in terms of first name, last name and driving license ID. You need to create a
constraint in the ACTIVE_DRIVERS table, called DuplicateCheck, to ensure the first name, last
name, and the driving license ID are unique.
6The Car Maintenance team considered that the available maintenance tasks should also have the
price information in the database. Alter the MAINTENANCE_TYPES table to include a new
column named MAINTENANCE_PRICE of type DECIMAL(5,2)..
Advanced level school Python programming. Need helps. Thank.pdf
Advanced level school Python programming. Need helps. Thanks in advance. The file MRT .
TXT contains the names of 116 MRT stations in Singapore. The task is to read the names from
the file, store it in a suitable data structure, sort the names and perform a binary search operation.
Task 1.1 Write program code to: - read the names from the file and store them in a suitable data
structure - sort the names into ascending order using quick sort - write the sorted names in a new
SORTED_MRT.TXT file where the next name is on new line Task 1.2 Write program code to:
read the names from the SORTED_MRT.TXT file and store them in a suitable data structure
display the names - search for a name using binary search and return True if the name is in the
file, and False otherwise Task 1.3 Design test data for your program written in Task 1.2, provide
evidence of testing that includes: - search for a name that is contained in the file - search for a
name that is not contained in the file
Yio Chu Kang Ang Mo Kio Lentor Mayflower Teck Ghee Tanah Merah Bedok Kembangan
Kaki Bukit Bedok North Bedok Reservoir Sungei Bedok Marine Terrace Siglap Bayshore Bedok
South Bishan Marymount Bright Hill Upper Thomson Bukit Batok Bukit Gombak Bukit Panjang
Cashew Hillview Hume Outram Park Tiong Bahru Redhill HarbourFront Labrador Park Telok
Blangah Keppel Cantonment Havelock Farrer Road Holland Village Beauty World
Sixth Avenue Tan Kah Kee Changi Airport Choa Chu Kang Clementi City Hall Raffles Place
Marina Bay Bugis Tanjong Pagar Esplanade Promenade Bayfront Downtown Eunos Paya Lebar
Aljunied Mountbatten Dakota MacPherson Kovan Hougang Tai Seng Jurong East Chinese
Garden Lakeside Boon Lay Pioneer Kallang Lavender Little India Boon Keng Stadium Dhoby
Ghaut Bras Basah Bencoolen Fort Canning Newton Novena Stevens Orchard Somerset
Chinatown Telok Ayer Pasir Ris Joo Koon Punggol
Buona Vista Dover Kent Ridge Rochor Sembawang Canberra Buangkok Sengkang Serangoon
Bartley Lorong Chuan Clarke Quay Kranji Tampines Simei Expo Botanic Gardens Braddell Toa
Payoh Potong Pasir Woodleigh Caldecott Tai Seng Marsiling Woodlands Admiralty Yishun.
More from MAYANKBANSAL1981 (14)
Business management 1. True or False Diversification is when compa.pdf
Business management 1. True or False Diversification is when compa.pdf
Complete in JavaCardApp.javapublic class CardApp { private.pdf
Complete in JavaCardApp.javapublic class CardApp { private.pdf
Change to oop formatimport java.util.Scanner;import java.io.;.pdf
Change to oop formatimport java.util.Scanner;import java.io.;.pdf
Case Project 2-1 Advance PreparationsThe IT managers from Chicago.pdf
Case Project 2-1 Advance PreparationsThe IT managers from Chicago.pdf
Banks are singled out for special attention in the financial sys.pdf
Banks are singled out for special attention in the financial sys.pdf
ASSETS LIABILITIES Cash $10,000 Accounts payable $12,000 Accounts re.pdf
ASSETS LIABILITIES Cash $10,000 Accounts payable $12,000 Accounts re.pdf
A. Monitoring Internet Endpoints and Bandwidth Consumption1. NetFl.pdf
A. Monitoring Internet Endpoints and Bandwidth Consumption1. NetFl.pdf
About your clientName Samantha BensonAge 54Marital status .pdf
About your clientName Samantha BensonAge 54Marital status .pdf
About your clientName Samantha Benson Age 54 Marital status Ma.pdf
About your clientName Samantha Benson Age 54 Marital status Ma.pdf
a) Complete both insert and delete methods. If it works correctly 10.pdf
a) Complete both insert and delete methods. If it works correctly 10.pdf
About your client Name Samantha Benson Age 54 Marital status Ma.pdf
About your client Name Samantha Benson Age 54 Marital status Ma.pdf
About your client Name Samantha BensonAge 54Marital status.pdf
About your client Name Samantha BensonAge 54Marital status.pdf
Answer the following prompts 1The InstantRide Management team foun.pdf
Answer the following prompts 1The InstantRide Management team foun.pdf
Advanced level school Python programming. Need helps. Thank.pdf
Advanced level school Python programming. Need helps. Thank.pdf
Recently uploaded
"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
Overview on Edible Vaccine: Pros & Cons with Mechanism
This ppt include the description of the edible vaccine i.e. a new concept over the traditional vaccine administered by injection.
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.
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
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Event Link:-
https://meetups.mulesoft.com/events/details/mulesoft-mysore-presents-exploring-gemini-ai-and-integration-with-mulesoft/
Agenda
● Java 17 Upgrade Overview
● Why and by when do customers need to upgrade to Java 17?
● Is there any immediate impact to upgrading to Mule Runtime 4.6 and beyond?
● Which MuleSoft products are in scope?
For Upcoming Meetups Join Mysore Meetup Group - https://meetups.mulesoft.com/mysore/
YouTube:- youtube.com/@mulesoftmysore
Mysore WhatsApp group:- https://chat.whatsapp.com/EhqtHtCC75vCAX7gaO842N
Speaker:-
Shubham Chaurasia - https://www.linkedin.com/in/shubhamchaurasia1/
Priya Shaw - https://www.linkedin.com/in/priya-shaw
Organizers:-
Shubham Chaurasia - https://www.linkedin.com/in/shubhamchaurasia1/
Giridhar Meka - https://www.linkedin.com/in/giridharmeka
Priya Shaw - https://www.linkedin.com/in/priya-shaw
Shyam Raj Prasad-
https://www.linkedin.com/in/shyam-raj-prasad/
Polish students' mobility in the Czech Republic
Polish students mobility to the Czech Republic within eTwinning project "Medieval adventures with Marco Polo"
Supporting (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.
Digital Tools and AI for Teaching Learning and Research
This Presentation in details discusses on Digital Tools and AI for Teaching Learning and Research
Unit 2- Research Aptitude (UGC NET Paper I).pdf
This slide describes the research aptitude of unit 2 in the UGC NET paper I.
A Strategic Approach: GenAI in Education
Artificial Intelligence (AI) technologies such as Generative AI, Image Generators and Large Language Models have had a dramatic impact on teaching, learning and assessment over the past 18 months. The most immediate threat AI posed was to Academic Integrity with Higher Education Institutes (HEIs) focusing their efforts on combating the use of GenAI in assessment. Guidelines were developed for staff and students, policies put in place too. Innovative educators have forged paths in the use of Generative AI for teaching, learning and assessments leading to pockets of transformation springing up across HEIs, often with little or no top-down guidance, support or direction.
This Gasta posits a strategic approach to integrating AI into HEIs to prepare staff, students and the curriculum for an evolving world and workplace. We will highlight the advantages of working with these technologies beyond the realm of teaching, learning and assessment by considering prompt engineering skills, industry impact, curriculum changes, and the need for staff upskilling. In contrast, not engaging strategically with Generative AI poses risks, including falling behind peers, missed opportunities and failing to ensure our graduates remain employable. The rapid evolution of AI technologies necessitates a proactive and strategic approach if we are to remain relevant.
Biological Screening of Herbal Drugs in detailed.
Biological screening of herbal drugs: Introduction and Need for
Phyto-Pharmacological Screening, New Strategies for evaluating
Natural Products, In vitro evaluation techniques for Antioxidants, Antimicrobial and Anticancer drugs. In vivo evaluation techniques
for Anti-inflammatory, Antiulcer, Anticancer, Wound healing, Antidiabetic, Hepatoprotective, Cardio protective, Diuretics and
Antifertility, Toxicity studies as per OECD guidelines
The Roman Empire A Historical Colossus.pdf
The Roman Empire, a vast and enduring power, stands as one of history's most remarkable civilizations, leaving an indelible imprint on the world. It emerged from the Roman Republic, transitioning into an imperial powerhouse under the leadership of Augustus Caesar in 27 BCE. This transformation marked the beginning of an era defined by unprecedented territorial expansion, architectural marvels, and profound cultural influence.
The empire's roots lie in the city of Rome, founded, according to legend, by Romulus in 753 BCE. Over centuries, Rome evolved from a small settlement to a formidable republic, characterized by a complex political system with elected officials and checks on power. However, internal strife, class conflicts, and military ambitions paved the way for the end of the Republic. Julius Caesar’s dictatorship and subsequent assassination in 44 BCE created a power vacuum, leading to a civil war. Octavian, later Augustus, emerged victorious, heralding the Roman Empire’s birth.
Under Augustus, the empire experienced the Pax Romana, a 200-year period of relative peace and stability. Augustus reformed the military, established efficient administrative systems, and initiated grand construction projects. The empire's borders expanded, encompassing territories from Britain to Egypt and from Spain to the Euphrates. Roman legions, renowned for their discipline and engineering prowess, secured and maintained these vast territories, building roads, fortifications, and cities that facilitated control and integration.
The Roman Empire’s society was hierarchical, with a rigid class system. At the top were the patricians, wealthy elites who held significant political power. Below them were the plebeians, free citizens with limited political influence, and the vast numbers of slaves who formed the backbone of the economy. The family unit was central, governed by the paterfamilias, the male head who held absolute authority.
Culturally, the Romans were eclectic, absorbing and adapting elements from the civilizations they encountered, particularly the Greeks. Roman art, literature, and philosophy reflected this synthesis, creating a rich cultural tapestry. Latin, the Roman language, became the lingua franca of the Western world, influencing numerous modern languages.
Roman architecture and engineering achievements were monumental. They perfected the arch, vault, and dome, constructing enduring structures like the Colosseum, Pantheon, and aqueducts. These engineering marvels not only showcased Roman ingenuity but also served practical purposes, from public entertainment to water supply.
The geography of Taylor Swift - some ideas
Geographical themes connected with Taylor Swift's ERAS tour - coming to the UK in June 2024
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
Recently uploaded (20)
"Protectable subject matters, Protection in biotechnology, Protection of othe...
"Protectable subject matters, Protection in biotechnology, Protection of othe...
Overview on Edible Vaccine: Pros & Cons with Mechanism
Overview on Edible Vaccine: Pros & Cons with Mechanism
1.4 modern child centered education - mahatma gandhi-2.pptx
1.4 modern child centered education - mahatma gandhi-2.pptx
The French Revolution Class 9 Study Material pdf free download
The French Revolution Class 9 Study Material pdf free download
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Mule 4.6 & Java 17 Upgrade | MuleSoft Mysore Meetup #46
Digital Tools and AI for Teaching Learning and Research
Digital Tools and AI for Teaching Learning and Research
Adversarial Attention Modeling for Multi-dimensional Emotion Regression.pdf
Adversarial Attention Modeling for Multi-dimensional Emotion Regression.pdf
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI fund...
Can some one redo this code without the try-catch and an alternative.pdf
- 1. Can some one redo this code without the try-catch and an alternative to using Entry when printing the treemap package part2; import java.io.*; import java.util.Map.Entry; import java.util.*; public class frequencyOfWords { public static void main(String[] args) { long totalTime = 0; long startTime = System.nanoTime(); TreeMap map = new TreeMap<>(); for(int i=1; i <= 77; i++){ startTime = System.nanoTime(); Scanner sc = new Scanner(System.in); File file = new File("c:/Users/tvazq/IdeaProjects/hw2/resources/" + i +".okpuncs"); Scanner reader; String line = ""; try { reader = new Scanner(file); while(reader.hasNextLine()){ line = reader.nextLine(); String words[] = line.split(" "); for(String s : words){ if(map.containsKey(s)){ map.put(s, map.get(s)+1); }else{ map.put(s, 1); } } } } catch (FileNotFoundException e) { System.out.println("file not found");
- 2. } sc.close(); totalTime+= (System.nanoTime()-startTime); } System.out.printf("%-20s%-20sn","Word","Frequency"); for(Entry entry : map.entrySet()) //printing map System.out.printf("%-20s%-20dn",entry.getKey(),entry.getValue()); System.out.println("Total time took : " + totalTime); } }