package chegg;import java.util.ArrayList; import java.util.List;.pdf
•
0 likes•2 views
package chegg; import java.util.ArrayList; import java.util.List; import java.util.ListIterator; import java.util.Scanner; import java.util.Set; import java.util.TreeMap; public class Vowles { public static void main(String args[]) { /* creating instance variable of List */ List letters = new ArrayList(); /* vowels instance variable for holding vowels */ List vowels = new ArrayList(); /* creating HashMap for storing vowels and count */ TreeMap map = new TreeMap(); /* Inserting vowels into treemap */ map.put(\"a\", 0); map.put(\"e\", 0); map.put(\"i\", 0); map.put(\"o\", 0); map.put(\"u\", 0); /* * creating instance variable of Scanner class for taking input from * console */ Scanner scanner = new Scanner(System.in); /* * prompt for user input */ System.out.println(\"Please enter the letters with comma seperated\"); String input = scanner.nextLine(); /* closing scanner object */ scanner.close(); String[] letter = input.split(\",\"); /* Inserting letters into List */ for (String values : letter) { letters.add(values); } /* ListIterator for iterating list */ ListIterator itr = letters.listIterator(); while (itr.hasNext()) { String val = itr.next(); /* checking if value is any vowels */ if (val.equals(\"a\") || val.equals(\"e\") || val.equals(\"i\") || val.equals(\"o\") || val.equals(\"u\")) { /* If vowels already exist in tree map */ if (map.containsKey(val)) { Integer value = map.get(val); map.put(val, ++value); vowels.add(val); } else { map.put(val, 1); vowels.add(val); } } } /* Removing all element from letters list */ letters.removeAll(letters); /* Getting size of vowels */ int listSize = vowels.size(); System.out.println(\"There are \" + listSize + \" vowels in the list:\"); /* Iterating treeMap */ Set keys = map.keySet(); for (String key : keys) { System.out.print(key + \"- \" + map.get(key) + \" \"); } } } /***************output******************/ Please enter the letters with comma seperated a,f,v,q,e,a,o,g,y,h,e,q,u There are 6 vowels in the list: a- 2 e- 2 i- 0 o- 1 u- 1 please rate the answer as best answer. Thanks Solution package chegg; import java.util.ArrayList; import java.util.List; import java.util.ListIterator; import java.util.Scanner; import java.util.Set; import java.util.TreeMap; public class Vowles { public static void main(String args[]) { /* creating instance variable of List */ List letters = new ArrayList(); /* vowels instance variable for holding vowels */ List vowels = new ArrayList(); /* creating HashMap for storing vowels and count */ TreeMap map = new TreeMap(); /* Inserting vowels into treemap */ map.put(\"a\", 0); map.put(\"e\", 0); map.put(\"i\", 0); map.put(\"o\", 0); map.put(\"u\", 0); /* * creating instance variable of Scanner class for taking input from * console */ Scanner scanner = new Scanner(System.in); /* * prompt for user input */ System.out.println(\"Please enter the letters with comma seperated\"); String input = scanner.nextLine(); /* closing scanner object */ scanner.close(); String[] letter = in.
Report
Share
Report
Share
Download to read offline
![package chegg;
import java.util.ArrayList;
import java.util.List;
import java.util.ListIterator;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeMap;
public class Vowles {
public static void main(String args[]) {
/* creating instance variable of List */
List letters = new ArrayList();
/* vowels instance variable for holding vowels */
List vowels = new ArrayList();
/* creating HashMap for storing vowels and count */
TreeMap map = new TreeMap();
/* Inserting vowels into treemap */
map.put("a", 0);
map.put("e", 0);
map.put("i", 0);
map.put("o", 0);
map.put("u", 0);
/*
* creating instance variable of Scanner class for taking input from
* console
*/
Scanner scanner = new Scanner(System.in);
/*
* prompt for user input
*/
System.out.println("Please enter the letters with comma seperated");
String input = scanner.nextLine();
/* closing scanner object */
scanner.close();
String[] letter = input.split(",");
/* Inserting letters into List */](https://image.slidesharecdn.com/packagecheggimportjava-230410042827-0bc6acb6/85/package-chegg-import-java-util-ArrayList-import-java-util-List-pdf-1-320.jpg)
Recommended
Vo.pdf
//*********************************************************
// VowelCount.java
//
// This program counts the number of vowels in a string
//*********************************************************
import java.util.Scanner;
public class VowelCount {
public static void main(String[] args) {
/*
* declare variables to store the number of each type of vowel
*/
int countA = 0, countE = 0, countI = 0, countO = 0, countU = 0;
Scanner scan = new Scanner(System.in);
// Get the string from the user (prompt and input)
System.out.println(\"Enter a string of characters:\");
String str = scan.nextLine();
// format for this part:
for (int i = 0; i < str.length(); i++) {
switch (str.charAt(i)) {
case \'a\':
case \'A\':
countA++;
break;
case \'e\':
case \'E\':
countE++;
break;
case \'i\':
case \'I\':
countI++;
break;
case \'o\':
case \'O\':
countO++;
break;
case \'u\':
case \'U\':
countU++;
break;
default:
break;
}
}
/*
* Remember: 1) condition should use method for getting string length 2)
* exp (in switch) should use method for returning a character
*/
// Output results
System.out.println(\"Number of each vowel in the string:\ a: \" + countA
+ \"\ e: \" + countE + \"\ i: \" + countI + \"\ o: \" + countO
+ \"\ u: \" + countU);
}
}
OUTPUT:
Enter a string of characters:
Hello! I am Finn from the land of Ooo.
Number of each vowel in the string:
a: 2
e: 2
i: 2
o: 6
u: 0
Solution
//*********************************************************
// VowelCount.java
//
// This program counts the number of vowels in a string
//*********************************************************
import java.util.Scanner;
public class VowelCount {
public static void main(String[] args) {
/*
* declare variables to store the number of each type of vowel
*/
int countA = 0, countE = 0, countI = 0, countO = 0, countU = 0;
Scanner scan = new Scanner(System.in);
// Get the string from the user (prompt and input)
System.out.println(\"Enter a string of characters:\");
String str = scan.nextLine();
// format for this part:
for (int i = 0; i < str.length(); i++) {
switch (str.charAt(i)) {
case \'a\':
case \'A\':
countA++;
break;
case \'e\':
case \'E\':
countE++;
break;
case \'i\':
case \'I\':
countI++;
break;
case \'o\':
case \'O\':
countO++;
break;
case \'u\':
case \'U\':
countU++;
break;
default:
break;
}
}
/*
* Remember: 1) condition should use method for getting string length 2)
* exp (in switch) should use method for returning a character
*/
// Output results
System.out.println(\"Number of each vowel in the string:\ a: \" + countA
+ \"\ e: \" + countE + \"\ i: \" + countI + \"\ o: \" + countO
+ \"\ u: \" + countU);
}
}
OUTPUT:
Enter a string of characters:
Hello! I am Finn from the land of Ooo.
Number of each vowel in the string:
a: 2
e: 2
i: 2
o: 6
u: 0.
ArrayOperations.java import java.util.Arrays; import java.util.pdf
ArrayOperations.java
import java.util.Arrays;
import java.util.Scanner;
public class ArrayOperations {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
double arr[] = input();
System.out.println(\"Input Array Elements: \");
printArray(arr);
getSquarRoot(arr);
System.out.println(\"After Square root method called:\");
printArray(arr);
replaceValue(arr);
System.out.println(\"After replace method called:\");
printArray(arr);
double arr1[] = copyArray(arr);
System.out.println(\"Original Array:\");
printArray(arr);
System.out.println(\"New Array:\");
printArray(arr1);
}
public static double[] input(){
double arr[] = new double[10];
Scanner scan = new Scanner(System.in);
for(int i=0; i 500)
arr[i] = 500;
}
}
public static double[] copyArray(double arr[]){
double arr1[] = new double[arr.length];
for(int i=0; i
Solution
ArrayOperations.java
import java.util.Arrays;
import java.util.Scanner;
public class ArrayOperations {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
double arr[] = input();
System.out.println(\"Input Array Elements: \");
printArray(arr);
getSquarRoot(arr);
System.out.println(\"After Square root method called:\");
printArray(arr);
replaceValue(arr);
System.out.println(\"After replace method called:\");
printArray(arr);
double arr1[] = copyArray(arr);
System.out.println(\"Original Array:\");
printArray(arr);
System.out.println(\"New Array:\");
printArray(arr1);
}
public static double[] input(){
double arr[] = new double[10];
Scanner scan = new Scanner(System.in);
for(int i=0; i 500)
arr[i] = 500;
}
}
public static double[] copyArray(double arr[]){
double arr1[] = new double[arr.length];
for(int i=0; i.
(JAVA NetBeans) Write a Java program able to perform selection sort-So.docx
(JAVA NetBeans) Write a Java program able to perform selection sort.
Solution
import java.util.Scanner;
/**
* @author
*
*/
public class SelectionSort {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
int arr[] = setArray();
System.out.println(\"\ Before Sorting:\");
printArray(arr);
arr = selectionSort(arr);
System.out.println(\"\ After Sorting:\");
printArray(arr);
}
/**
* reads and stores the data in the one-dimensional array
*/
/**
* @return
*/
public static int[] setArray() {
int arr[] = new int[12];
System.out.println(\"Enter 12 integers.\");
Scanner scanner = new Scanner(System.in);
for (int i = 0; i < arr.length; i++) {
arr[i] = scanner.nextInt();
}
return arr;
}
/**
* prints the data in the one-dimensional array
*/
public static void printArray(int[] arr) {
System.out.println();
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + \" \");
}
System.out.println();
}
/**
* method will sort the array in ascending order
*/
public static int[] selectionSort(int[] arr) {
for (int i = 0; i < arr.length - 1; i++) {
int index = i;
for (int j = i + 1; j < arr.length; j++)
if (arr[j] < arr[index])
index = j;
int smallerNumber = arr[index];
arr[index] = arr[i];
arr[i] = smallerNumber;
}
return arr;
}
}
OUTPUT:
Enter 12 integers.
4 23 65 34 84 37 12 17 24 36 82 51
Before Sorting:
4 23 65 34 84 37 12 17 24 36 82 51
After Sorting:
4 12 17 23 24 34 36 37 51 65 82 84
.
Modify HuffmanTree.java and HuffmanNode.java to allow the user to se.pdf
Modify HuffmanTree.java and HuffmanNode.java to allow the user to select the value of n 9 to
construct an n ary Huffman Tree. Once finished, verify the accuracy of your tree by running it
for the English Alphabet for n = 3, 4, 5, 6, 7, 8, 9. For each value of n, compute the average
codeword length. Write these in a table (n vs. ACW L(Cn)).
/ HuffmanTree.java
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.util.ArrayList;
import java.util.Scanner;
public class HuffmanTree {
public static void main(String[] args){
Scanner in = new Scanner(System.in);
System.out.print(\"Enter the file name: \");
String fileName = in.nextLine();
ArrayList nodes = new ArrayList<>();
ArrayList temp = new ArrayList<>();
try {
Scanner fin = new Scanner(new FileReader(fileName));
String symbol;
double prob;
while(fin.hasNext()){
symbol = fin.next();
prob = fin.nextDouble();
nodes.add(findInsertIndex(nodes, prob), new HuffmanNode(symbol, prob));
}
fin.close();
temp.addAll(nodes);
HuffmanNode root = createHuffmanTree(temp);
setCodeWords(root);
double avg = 0;
for (HuffmanNode node : nodes) {
System.out.println(node.getS() + \": \" + node.getC() + \": \" + node.getL());
avg += node.getL();
}
if(avg != 0)
avg /= nodes.size();
System.out.println(\"Average code length is: \" + avg);
} catch (FileNotFoundException e) {
e.printStackTrace();
}
}
private static HuffmanNode createHuffmanTree(ArrayList nodes){
HuffmanNode root = null;
if(nodes.size() > 0) {
HuffmanNode node0, node1, node;
while (nodes.size() > 1) {
node0 = nodes.get(0);
node1 = nodes.get(1);
node = new HuffmanNode(null, node0.getP() + node1.getP());
node.setLeft(node0);
node.setRight(node1);
nodes.remove(0);
nodes.remove(0);
nodes.add(findInsertIndex(nodes, node.getP()), node);
}
root = nodes.get(0);
}
return root;
}
private static void setCodeWords(HuffmanNode root){
if(root != null){
setCodeWords(root, \"\");
}
}
private static void setCodeWords(HuffmanNode root, String codeWord){
if(root.getS() != null){
root.setC(codeWord);
root.setL(codeWord.length());
}
else{
setCodeWords(root.getLeft(), codeWord + \"0\");
setCodeWords(root.getRight(), codeWord + \"1\");
}
}
private static int findInsertIndex(ArrayList nodes, double prob){
for(int i = 0; i < nodes.size(); ++i){
if(prob < nodes.get(i).getP()){
return i;
}
}
return nodes.size();
}
}
// HuffmanNode.java
public class HuffmanNode {
private String S;
private double P;
private String C;
private int L;
private HuffmanNode left, right;
public HuffmanNode(String s, double p) {
S = s;
P = p;
}
public String getS() {
return S;
}
public void setS(String s) {
S = s;
}
public double getP() {
return P;
}
public void setP(double p) {
P = p;
}
public String getC() {
return C;
}
public void setC(String c) {
C = c;
}
public int getL() {
return L;
}
public void setL(int l) {
L = l;
}
public HuffmanNode getLeft() {
return left;
}
public void setLeft(HuffmanNode left) {
this.left = left;
}
public HuffmanNode getRight() {
return right;
}
public void se.
import java.util.;public class FirstChars { public static vo.pdf
import java.util.*;
public class FirstChars {
public static void main(String args[]) {
/*Creation of ArrayList of type String */
ArrayList arrList = new ArrayList();
/*Add elements to ArrayList*/
arrList.add(\"Hello\");
arrList.add(\"World\");
arrList.add(\"goodbye\");
/* Displaying array list elements */
System.out.println(\"Element in Array List:\"+arrList);
// Calling
System.out.println(\"first letters of ArrayList:\"+f(arrList));
}
public static String f(ArrayList arrayList){
String s = \"\"; // empty string
for(int i=0;i
Solution
import java.util.*;
public class FirstChars {
public static void main(String args[]) {
/*Creation of ArrayList of type String */
ArrayList arrList = new ArrayList();
/*Add elements to ArrayList*/
arrList.add(\"Hello\");
arrList.add(\"World\");
arrList.add(\"goodbye\");
/* Displaying array list elements */
System.out.println(\"Element in Array List:\"+arrList);
// Calling
System.out.println(\"first letters of ArrayList:\"+f(arrList));
}
public static String f(ArrayList arrayList){
String s = \"\"; // empty string
for(int i=0;i.
Frequency .java Word frequency counter package frequ.pdf
Frequency .java
/**
* Word frequency counter
*/
package frequency;
import java.util.Iterator;
/**
*
* @author UMD CS
*/
public class Frequency implements Iterable{
private Node first;
private int N;
Frequency(){
N = 0;
first = null;
}
@Override
public Iterator iterator() {
return new ListIterator();
}
/**
*
* List iterator
*
*/
private class ListIterator implements Iterator{
private Node current;
private int index ;
ListIterator(){
current = first;
index = 0;
}
@Override
public boolean hasNext() {
return current != null;
}
public String next() {
if(!hasNext()){
return null;
}
String word = current.key;
int count = current.count;
String r = \"(\"+word + \",\" + Integer.toString(count)+\")\";
current = current.next;
return r;
}
@Override
public void remove() {
}
}
/**
*
* Node class
*
*/
private class Node {
private String key;
private int count;
private Node next;
Node(String item){
key = item;
count = 1;
next = null;
}
@Override
public String toString(){
return \"(\"+key +\",\"+count+\")\";
}
}
/*
* Inserts a word into the linked list. If the word exists, increment the
* count by q.
*/
public void insert(String word){
if(word.equals(\"\")){
return;
}
//TODO
/*
* implement here
*/
}
/**
*
* @param str input string
* This method splits a string into words and pass the words to insert method
*
*/
public void insertWords(String str){
String delims = \"[ .,?!\'\\\"()}{;/<>&=#-:\\\\ _]+\";
String[] words = str.split(delims);
for(String s: words){
s = s.toLowerCase();
insert(s);
}
}
/**
* prints the word frequency list
*/
public void print(){
Node c = first;
while(c != null){
System.out.print(\"(\"+c.key + \",\" + c.count+\")\");
c = c.next;
}
System.out.print(\"\ \");
}
}
--------------------------------------------------------------------------------------------------------------------
------------------------------------------------------
WordFrequency.java
package frequency;
import utils.In;
import utils.Stopwatch;
/**
*
* @author UMD CS
*/
public class WordFrequency {
/**
* @param input source
* @param
* This method receives input resource and return the word frequency string
* DO NOT CHANGE THIS METHOD.
*/
public static String freq(String inputSource, int maxLines){
In in;
// Frequency class can only count the frequency of strings. DO NOT CHANGE THIS.
Frequency freq = new Frequency();
int MAX = 100;
String inputSourceName = inputSource;
try {
in = new In(inputSourceName);
while (!in.isEmpty()) {
String s = in.readLine();
//System.out.println(s);
freq.insertWords(s);
}
}
catch (Exception e) {
e.printStackTrace();
}
StringBuilder strFrequency = new StringBuilder();
int cnt = 0;
for(String s: freq){
strFrequency.append(s);
strFrequency.append(\",\");
cnt++;
if(cnt >= maxLines){break;}
}
return strFrequency.toString();
}
/**
*
*/
public static void main(String[] args) {
In in;
Frequency freq = new Frequency();
int MAX = 100;
// String inputSourceName =
\"http://www.cs.umd.edu/class/summer2015/cmsc132/projects/P3_WordFrequency/test1.html\";
String .
package singlylinkedlist; public class Node { public String valu.pdf
package singlylinkedlist;
public class Node {
public String value;
public Node next;
public Node(String value) {
this.value = value;
}
@Override
public String toString() {
return value;
}
}
SingleyLinkedList.java :
package singlylinkedlist;
import java.io.*;
import java.util.*;
/**
* Defines the interface for a singly-linked list.
*
*/
public interface SinglyLinkedList {
/**
* @return Reference to the first node. If the list is empty, this method
* returns null.
*/
public Node getFirst();
/**
* @return Reference to the last node . If the list is empty, this method
* returns null.
*/
public Node getLast();
/**
* @return Number of nodes in the list
*/
public int size();
/**
* @return true if the list has no nodes; false otherwise
*/
public boolean isEmpty();
/**
* Removes all nodes in the list.
*/
public void clear();
/**
* Inserts a new node with the given value after cursor.
*
* @param cursor
* The node to insert after. Set this to null to insert value as
the
* new first Node.
* @param value
* The value to insert
* @return a reference to the newly inserted Node
*/
public Node insert(Node cursor, String value);
/**
* Inserts a new node with the given value at the "end" of the list.
*
* @param value
* @return a reference to the newly inserted Node
*/
public Node append(String value);
/**
* Removes the node after the specified Node (cursor) from the list.
*
* @param cursor
* A reference to the Node to remove.
*/
public void removeAfter(Node cursor);
/**
* Returns a reference to the first Node containing the key, starting from
the
* given Node.
*
* @param start
* @param key
* @return a reference to the first Node containing the key
*/
public Node find(Node start, String key);
/**
* Prints the values of all the items in a list
*/
public void printWholeList();
}
SinglyLinkedTester.java:
package sbccunittest;
import static java.lang.Math.*;
import static java.lang.System.*;
import static org.apache.commons.lang3.StringUtils.*;
import static org.junit.Assert.*;
import static sbcc.Core.*;
import java.io.*;
import java.lang.reflect.*;
import java.nio.file.*;
import java.util.*;
import java.util.stream.*;
import org.apache.commons.lang3.*;
import org.junit.*;
import org.w3c.dom.ranges.*;
import sbcc.*;
import singlylinkedlist.*;
/**
* 09/16/2021
*
* @author sstrenn
*
*/
public class SinglyLinkedListTester {
public static String newline = System.getProperty("line.separator");
public static int totalScore = 0;
public static int extraCredit = 0;
public static boolean isZeroScore = false;
public static String scorePreamble = "";
@BeforeClass
public static void beforeTesting() {
totalScore = 0;
extraCredit = 0;
}
@AfterClass
public static void afterTesting() {
if (isZeroScore) {
totalScore = 0;
extraCredit = 0;
}
println(scorePreamble + "Estimated score (w/o late penalties, etc.) is:
" + totalScore + " out of 25.");
// If the project follows the naming convention, save the results in a
folder on
// the desktop. (Alex Kohanim)
try {
String directory =
substri.
java question Fill the add statement areaProject is to wo.pdf
java question: \"Fill the add statement area\"
Project is to work with stacks.
package p2;
public class Coordinate {
public int x;
public int y;
public Coordinate( int x, int y ) {
this.x = x;
this.y = y;
}
public String toString() {
return \"(\" + this.x + \",\" + this.y + \")\";
}
@Override
public boolean equals( Object object ) {
if( object == null ) {
return false;
}
if( ! Coordinate.class.isAssignableFrom( object.getClass() )) {
return false;
}
final Coordinate other = (Coordinate) object;
return this.x == other.x && this.y == other.y;
}
}
package p2;
public class Coordinate {
public int x;
public int y;
public Coordinate( int x, int y ) {
this.x = x;
this.y = y;
}
public String toString() {
return \"(\" + this.x + \",\" + this.y + \")\";
}
@Override
public boolean equals( Object object ) {
if( object == null ) {
return false;
}
if( ! Coordinate.class.isAssignableFrom( object.getClass() )) {
return false;
}
final Coordinate other = (Coordinate) object;
return this.x == other.x && this.y == other.y;
}
}
package p2;
import java.util.Vector;
public class Maze {
private char[][] maze;
private int height;
private int width;
/**
* Create a new Maze of the specified height and width, initializing every
* location as empty, with a \' \'.
**/
public Maze( int width, int height ) {
// ADD STATEMENTS HERE
}
/**
* Mutator to allow us to set the specified Coordinate as blocked,
* marking it with a \'X\'
**/
public void setBlocked( Coordinate coord ) {
// ADD STATEMENTS HERE
}
/**
* Mutator to allow us to set the specified Coordinate as having been visited,
* marking it with a \'*\'
**/
public void setVisited( Coordinate coord ) {
// ADD STATEMENTS HERE
}
/**
* Mutator to allow us to set the specified Coordinate as part of the path solution,
* marking it with a \'.\'
**/
public void setPath( Coordinate coord ) {
// ADD STATEMENTS HERE
}
/**
* Returns the character at the locatio specified by the Coordinate
**/
public char at( Coordinate coord ) {
// ADD STATEMENTS HERE
}
/**
* Returns a Coordinate array containing all Coordinates that are clear around
* the specified coordinate.
**/
public Coordinate[] clearAround( Coordinate coord ) {
Vector vector = new Vector();
// ADD STATEMENTS HERE
// Look at each of the locations around the specified Coordinate, and add it
// to the vector if it is clear (i.e. a space)
return vector.toArray( new Coordinate[0] );
}
/**
* Returns a Coordinate that provides the entrance location in this maze.
**/
public Coordinate start() {
return new Coordinate( 0, 1 );
}
/**
* Returns a Coordinate that provides the exit location from this maze.
**/
public Coordinate end() {
// ADD STATEMENTS HERE
}
/**
* The toString() method is responsible for creating a String representation
* of the Maze. See the project specification for sample output. Note that
* the String representation adds numbers across the top and side of the Maze
* to show the Coordinates of each cell in the maze.
**/
public String toString() {
StringBuilder buffer =.
Recommended
Vo.pdf
//*********************************************************
// VowelCount.java
//
// This program counts the number of vowels in a string
//*********************************************************
import java.util.Scanner;
public class VowelCount {
public static void main(String[] args) {
/*
* declare variables to store the number of each type of vowel
*/
int countA = 0, countE = 0, countI = 0, countO = 0, countU = 0;
Scanner scan = new Scanner(System.in);
// Get the string from the user (prompt and input)
System.out.println(\"Enter a string of characters:\");
String str = scan.nextLine();
// format for this part:
for (int i = 0; i < str.length(); i++) {
switch (str.charAt(i)) {
case \'a\':
case \'A\':
countA++;
break;
case \'e\':
case \'E\':
countE++;
break;
case \'i\':
case \'I\':
countI++;
break;
case \'o\':
case \'O\':
countO++;
break;
case \'u\':
case \'U\':
countU++;
break;
default:
break;
}
}
/*
* Remember: 1) condition should use method for getting string length 2)
* exp (in switch) should use method for returning a character
*/
// Output results
System.out.println(\"Number of each vowel in the string:\ a: \" + countA
+ \"\ e: \" + countE + \"\ i: \" + countI + \"\ o: \" + countO
+ \"\ u: \" + countU);
}
}
OUTPUT:
Enter a string of characters:
Hello! I am Finn from the land of Ooo.
Number of each vowel in the string:
a: 2
e: 2
i: 2
o: 6
u: 0
Solution
//*********************************************************
// VowelCount.java
//
// This program counts the number of vowels in a string
//*********************************************************
import java.util.Scanner;
public class VowelCount {
public static void main(String[] args) {
/*
* declare variables to store the number of each type of vowel
*/
int countA = 0, countE = 0, countI = 0, countO = 0, countU = 0;
Scanner scan = new Scanner(System.in);
// Get the string from the user (prompt and input)
System.out.println(\"Enter a string of characters:\");
String str = scan.nextLine();
// format for this part:
for (int i = 0; i < str.length(); i++) {
switch (str.charAt(i)) {
case \'a\':
case \'A\':
countA++;
break;
case \'e\':
case \'E\':
countE++;
break;
case \'i\':
case \'I\':
countI++;
break;
case \'o\':
case \'O\':
countO++;
break;
case \'u\':
case \'U\':
countU++;
break;
default:
break;
}
}
/*
* Remember: 1) condition should use method for getting string length 2)
* exp (in switch) should use method for returning a character
*/
// Output results
System.out.println(\"Number of each vowel in the string:\ a: \" + countA
+ \"\ e: \" + countE + \"\ i: \" + countI + \"\ o: \" + countO
+ \"\ u: \" + countU);
}
}
OUTPUT:
Enter a string of characters:
Hello! I am Finn from the land of Ooo.
Number of each vowel in the string:
a: 2
e: 2
i: 2
o: 6
u: 0.
ArrayOperations.java import java.util.Arrays; import java.util.pdf
ArrayOperations.java
import java.util.Arrays;
import java.util.Scanner;
public class ArrayOperations {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
double arr[] = input();
System.out.println(\"Input Array Elements: \");
printArray(arr);
getSquarRoot(arr);
System.out.println(\"After Square root method called:\");
printArray(arr);
replaceValue(arr);
System.out.println(\"After replace method called:\");
printArray(arr);
double arr1[] = copyArray(arr);
System.out.println(\"Original Array:\");
printArray(arr);
System.out.println(\"New Array:\");
printArray(arr1);
}
public static double[] input(){
double arr[] = new double[10];
Scanner scan = new Scanner(System.in);
for(int i=0; i 500)
arr[i] = 500;
}
}
public static double[] copyArray(double arr[]){
double arr1[] = new double[arr.length];
for(int i=0; i
Solution
ArrayOperations.java
import java.util.Arrays;
import java.util.Scanner;
public class ArrayOperations {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
double arr[] = input();
System.out.println(\"Input Array Elements: \");
printArray(arr);
getSquarRoot(arr);
System.out.println(\"After Square root method called:\");
printArray(arr);
replaceValue(arr);
System.out.println(\"After replace method called:\");
printArray(arr);
double arr1[] = copyArray(arr);
System.out.println(\"Original Array:\");
printArray(arr);
System.out.println(\"New Array:\");
printArray(arr1);
}
public static double[] input(){
double arr[] = new double[10];
Scanner scan = new Scanner(System.in);
for(int i=0; i 500)
arr[i] = 500;
}
}
public static double[] copyArray(double arr[]){
double arr1[] = new double[arr.length];
for(int i=0; i.
(JAVA NetBeans) Write a Java program able to perform selection sort-So.docx
(JAVA NetBeans) Write a Java program able to perform selection sort.
Solution
import java.util.Scanner;
/**
* @author
*
*/
public class SelectionSort {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
int arr[] = setArray();
System.out.println(\"\ Before Sorting:\");
printArray(arr);
arr = selectionSort(arr);
System.out.println(\"\ After Sorting:\");
printArray(arr);
}
/**
* reads and stores the data in the one-dimensional array
*/
/**
* @return
*/
public static int[] setArray() {
int arr[] = new int[12];
System.out.println(\"Enter 12 integers.\");
Scanner scanner = new Scanner(System.in);
for (int i = 0; i < arr.length; i++) {
arr[i] = scanner.nextInt();
}
return arr;
}
/**
* prints the data in the one-dimensional array
*/
public static void printArray(int[] arr) {
System.out.println();
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + \" \");
}
System.out.println();
}
/**
* method will sort the array in ascending order
*/
public static int[] selectionSort(int[] arr) {
for (int i = 0; i < arr.length - 1; i++) {
int index = i;
for (int j = i + 1; j < arr.length; j++)
if (arr[j] < arr[index])
index = j;
int smallerNumber = arr[index];
arr[index] = arr[i];
arr[i] = smallerNumber;
}
return arr;
}
}
OUTPUT:
Enter 12 integers.
4 23 65 34 84 37 12 17 24 36 82 51
Before Sorting:
4 23 65 34 84 37 12 17 24 36 82 51
After Sorting:
4 12 17 23 24 34 36 37 51 65 82 84
.
Modify HuffmanTree.java and HuffmanNode.java to allow the user to se.pdf
Modify HuffmanTree.java and HuffmanNode.java to allow the user to select the value of n 9 to
construct an n ary Huffman Tree. Once finished, verify the accuracy of your tree by running it
for the English Alphabet for n = 3, 4, 5, 6, 7, 8, 9. For each value of n, compute the average
codeword length. Write these in a table (n vs. ACW L(Cn)).
/ HuffmanTree.java
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.util.ArrayList;
import java.util.Scanner;
public class HuffmanTree {
public static void main(String[] args){
Scanner in = new Scanner(System.in);
System.out.print(\"Enter the file name: \");
String fileName = in.nextLine();
ArrayList nodes = new ArrayList<>();
ArrayList temp = new ArrayList<>();
try {
Scanner fin = new Scanner(new FileReader(fileName));
String symbol;
double prob;
while(fin.hasNext()){
symbol = fin.next();
prob = fin.nextDouble();
nodes.add(findInsertIndex(nodes, prob), new HuffmanNode(symbol, prob));
}
fin.close();
temp.addAll(nodes);
HuffmanNode root = createHuffmanTree(temp);
setCodeWords(root);
double avg = 0;
for (HuffmanNode node : nodes) {
System.out.println(node.getS() + \": \" + node.getC() + \": \" + node.getL());
avg += node.getL();
}
if(avg != 0)
avg /= nodes.size();
System.out.println(\"Average code length is: \" + avg);
} catch (FileNotFoundException e) {
e.printStackTrace();
}
}
private static HuffmanNode createHuffmanTree(ArrayList nodes){
HuffmanNode root = null;
if(nodes.size() > 0) {
HuffmanNode node0, node1, node;
while (nodes.size() > 1) {
node0 = nodes.get(0);
node1 = nodes.get(1);
node = new HuffmanNode(null, node0.getP() + node1.getP());
node.setLeft(node0);
node.setRight(node1);
nodes.remove(0);
nodes.remove(0);
nodes.add(findInsertIndex(nodes, node.getP()), node);
}
root = nodes.get(0);
}
return root;
}
private static void setCodeWords(HuffmanNode root){
if(root != null){
setCodeWords(root, \"\");
}
}
private static void setCodeWords(HuffmanNode root, String codeWord){
if(root.getS() != null){
root.setC(codeWord);
root.setL(codeWord.length());
}
else{
setCodeWords(root.getLeft(), codeWord + \"0\");
setCodeWords(root.getRight(), codeWord + \"1\");
}
}
private static int findInsertIndex(ArrayList nodes, double prob){
for(int i = 0; i < nodes.size(); ++i){
if(prob < nodes.get(i).getP()){
return i;
}
}
return nodes.size();
}
}
// HuffmanNode.java
public class HuffmanNode {
private String S;
private double P;
private String C;
private int L;
private HuffmanNode left, right;
public HuffmanNode(String s, double p) {
S = s;
P = p;
}
public String getS() {
return S;
}
public void setS(String s) {
S = s;
}
public double getP() {
return P;
}
public void setP(double p) {
P = p;
}
public String getC() {
return C;
}
public void setC(String c) {
C = c;
}
public int getL() {
return L;
}
public void setL(int l) {
L = l;
}
public HuffmanNode getLeft() {
return left;
}
public void setLeft(HuffmanNode left) {
this.left = left;
}
public HuffmanNode getRight() {
return right;
}
public void se.
import java.util.;public class FirstChars { public static vo.pdf
import java.util.*;
public class FirstChars {
public static void main(String args[]) {
/*Creation of ArrayList of type String */
ArrayList arrList = new ArrayList();
/*Add elements to ArrayList*/
arrList.add(\"Hello\");
arrList.add(\"World\");
arrList.add(\"goodbye\");
/* Displaying array list elements */
System.out.println(\"Element in Array List:\"+arrList);
// Calling
System.out.println(\"first letters of ArrayList:\"+f(arrList));
}
public static String f(ArrayList arrayList){
String s = \"\"; // empty string
for(int i=0;i
Solution
import java.util.*;
public class FirstChars {
public static void main(String args[]) {
/*Creation of ArrayList of type String */
ArrayList arrList = new ArrayList();
/*Add elements to ArrayList*/
arrList.add(\"Hello\");
arrList.add(\"World\");
arrList.add(\"goodbye\");
/* Displaying array list elements */
System.out.println(\"Element in Array List:\"+arrList);
// Calling
System.out.println(\"first letters of ArrayList:\"+f(arrList));
}
public static String f(ArrayList arrayList){
String s = \"\"; // empty string
for(int i=0;i.
Frequency .java Word frequency counter package frequ.pdf
Frequency .java
/**
* Word frequency counter
*/
package frequency;
import java.util.Iterator;
/**
*
* @author UMD CS
*/
public class Frequency implements Iterable{
private Node first;
private int N;
Frequency(){
N = 0;
first = null;
}
@Override
public Iterator iterator() {
return new ListIterator();
}
/**
*
* List iterator
*
*/
private class ListIterator implements Iterator{
private Node current;
private int index ;
ListIterator(){
current = first;
index = 0;
}
@Override
public boolean hasNext() {
return current != null;
}
public String next() {
if(!hasNext()){
return null;
}
String word = current.key;
int count = current.count;
String r = \"(\"+word + \",\" + Integer.toString(count)+\")\";
current = current.next;
return r;
}
@Override
public void remove() {
}
}
/**
*
* Node class
*
*/
private class Node {
private String key;
private int count;
private Node next;
Node(String item){
key = item;
count = 1;
next = null;
}
@Override
public String toString(){
return \"(\"+key +\",\"+count+\")\";
}
}
/*
* Inserts a word into the linked list. If the word exists, increment the
* count by q.
*/
public void insert(String word){
if(word.equals(\"\")){
return;
}
//TODO
/*
* implement here
*/
}
/**
*
* @param str input string
* This method splits a string into words and pass the words to insert method
*
*/
public void insertWords(String str){
String delims = \"[ .,?!\'\\\"()}{;/<>&=#-:\\\\ _]+\";
String[] words = str.split(delims);
for(String s: words){
s = s.toLowerCase();
insert(s);
}
}
/**
* prints the word frequency list
*/
public void print(){
Node c = first;
while(c != null){
System.out.print(\"(\"+c.key + \",\" + c.count+\")\");
c = c.next;
}
System.out.print(\"\ \");
}
}
--------------------------------------------------------------------------------------------------------------------
------------------------------------------------------
WordFrequency.java
package frequency;
import utils.In;
import utils.Stopwatch;
/**
*
* @author UMD CS
*/
public class WordFrequency {
/**
* @param input source
* @param
* This method receives input resource and return the word frequency string
* DO NOT CHANGE THIS METHOD.
*/
public static String freq(String inputSource, int maxLines){
In in;
// Frequency class can only count the frequency of strings. DO NOT CHANGE THIS.
Frequency freq = new Frequency();
int MAX = 100;
String inputSourceName = inputSource;
try {
in = new In(inputSourceName);
while (!in.isEmpty()) {
String s = in.readLine();
//System.out.println(s);
freq.insertWords(s);
}
}
catch (Exception e) {
e.printStackTrace();
}
StringBuilder strFrequency = new StringBuilder();
int cnt = 0;
for(String s: freq){
strFrequency.append(s);
strFrequency.append(\",\");
cnt++;
if(cnt >= maxLines){break;}
}
return strFrequency.toString();
}
/**
*
*/
public static void main(String[] args) {
In in;
Frequency freq = new Frequency();
int MAX = 100;
// String inputSourceName =
\"http://www.cs.umd.edu/class/summer2015/cmsc132/projects/P3_WordFrequency/test1.html\";
String .
package singlylinkedlist; public class Node { public String valu.pdf
package singlylinkedlist;
public class Node {
public String value;
public Node next;
public Node(String value) {
this.value = value;
}
@Override
public String toString() {
return value;
}
}
SingleyLinkedList.java :
package singlylinkedlist;
import java.io.*;
import java.util.*;
/**
* Defines the interface for a singly-linked list.
*
*/
public interface SinglyLinkedList {
/**
* @return Reference to the first node. If the list is empty, this method
* returns null.
*/
public Node getFirst();
/**
* @return Reference to the last node . If the list is empty, this method
* returns null.
*/
public Node getLast();
/**
* @return Number of nodes in the list
*/
public int size();
/**
* @return true if the list has no nodes; false otherwise
*/
public boolean isEmpty();
/**
* Removes all nodes in the list.
*/
public void clear();
/**
* Inserts a new node with the given value after cursor.
*
* @param cursor
* The node to insert after. Set this to null to insert value as
the
* new first Node.
* @param value
* The value to insert
* @return a reference to the newly inserted Node
*/
public Node insert(Node cursor, String value);
/**
* Inserts a new node with the given value at the "end" of the list.
*
* @param value
* @return a reference to the newly inserted Node
*/
public Node append(String value);
/**
* Removes the node after the specified Node (cursor) from the list.
*
* @param cursor
* A reference to the Node to remove.
*/
public void removeAfter(Node cursor);
/**
* Returns a reference to the first Node containing the key, starting from
the
* given Node.
*
* @param start
* @param key
* @return a reference to the first Node containing the key
*/
public Node find(Node start, String key);
/**
* Prints the values of all the items in a list
*/
public void printWholeList();
}
SinglyLinkedTester.java:
package sbccunittest;
import static java.lang.Math.*;
import static java.lang.System.*;
import static org.apache.commons.lang3.StringUtils.*;
import static org.junit.Assert.*;
import static sbcc.Core.*;
import java.io.*;
import java.lang.reflect.*;
import java.nio.file.*;
import java.util.*;
import java.util.stream.*;
import org.apache.commons.lang3.*;
import org.junit.*;
import org.w3c.dom.ranges.*;
import sbcc.*;
import singlylinkedlist.*;
/**
* 09/16/2021
*
* @author sstrenn
*
*/
public class SinglyLinkedListTester {
public static String newline = System.getProperty("line.separator");
public static int totalScore = 0;
public static int extraCredit = 0;
public static boolean isZeroScore = false;
public static String scorePreamble = "";
@BeforeClass
public static void beforeTesting() {
totalScore = 0;
extraCredit = 0;
}
@AfterClass
public static void afterTesting() {
if (isZeroScore) {
totalScore = 0;
extraCredit = 0;
}
println(scorePreamble + "Estimated score (w/o late penalties, etc.) is:
" + totalScore + " out of 25.");
// If the project follows the naming convention, save the results in a
folder on
// the desktop. (Alex Kohanim)
try {
String directory =
substri.
java question Fill the add statement areaProject is to wo.pdf
java question: \"Fill the add statement area\"
Project is to work with stacks.
package p2;
public class Coordinate {
public int x;
public int y;
public Coordinate( int x, int y ) {
this.x = x;
this.y = y;
}
public String toString() {
return \"(\" + this.x + \",\" + this.y + \")\";
}
@Override
public boolean equals( Object object ) {
if( object == null ) {
return false;
}
if( ! Coordinate.class.isAssignableFrom( object.getClass() )) {
return false;
}
final Coordinate other = (Coordinate) object;
return this.x == other.x && this.y == other.y;
}
}
package p2;
public class Coordinate {
public int x;
public int y;
public Coordinate( int x, int y ) {
this.x = x;
this.y = y;
}
public String toString() {
return \"(\" + this.x + \",\" + this.y + \")\";
}
@Override
public boolean equals( Object object ) {
if( object == null ) {
return false;
}
if( ! Coordinate.class.isAssignableFrom( object.getClass() )) {
return false;
}
final Coordinate other = (Coordinate) object;
return this.x == other.x && this.y == other.y;
}
}
package p2;
import java.util.Vector;
public class Maze {
private char[][] maze;
private int height;
private int width;
/**
* Create a new Maze of the specified height and width, initializing every
* location as empty, with a \' \'.
**/
public Maze( int width, int height ) {
// ADD STATEMENTS HERE
}
/**
* Mutator to allow us to set the specified Coordinate as blocked,
* marking it with a \'X\'
**/
public void setBlocked( Coordinate coord ) {
// ADD STATEMENTS HERE
}
/**
* Mutator to allow us to set the specified Coordinate as having been visited,
* marking it with a \'*\'
**/
public void setVisited( Coordinate coord ) {
// ADD STATEMENTS HERE
}
/**
* Mutator to allow us to set the specified Coordinate as part of the path solution,
* marking it with a \'.\'
**/
public void setPath( Coordinate coord ) {
// ADD STATEMENTS HERE
}
/**
* Returns the character at the locatio specified by the Coordinate
**/
public char at( Coordinate coord ) {
// ADD STATEMENTS HERE
}
/**
* Returns a Coordinate array containing all Coordinates that are clear around
* the specified coordinate.
**/
public Coordinate[] clearAround( Coordinate coord ) {
Vector vector = new Vector();
// ADD STATEMENTS HERE
// Look at each of the locations around the specified Coordinate, and add it
// to the vector if it is clear (i.e. a space)
return vector.toArray( new Coordinate[0] );
}
/**
* Returns a Coordinate that provides the entrance location in this maze.
**/
public Coordinate start() {
return new Coordinate( 0, 1 );
}
/**
* Returns a Coordinate that provides the exit location from this maze.
**/
public Coordinate end() {
// ADD STATEMENTS HERE
}
/**
* The toString() method is responsible for creating a String representation
* of the Maze. See the project specification for sample output. Note that
* the String representation adds numbers across the top and side of the Maze
* to show the Coordinates of each cell in the maze.
**/
public String toString() {
StringBuilder buffer =.
Collection Core Concept
Collection, Collections Framework, Core Java, Corporate Java, Rays Technologies, SunilOS, Rays Indore, Rays Pune, Rays Delhi
MagicSquareTest.java import java.util.Scanner;public class Mag.pdf
MagicSquareTest.java
import java.util.Scanner;
public class MagicSquareTest {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scan = new Scanner(System.in);
System.out.println(\"Enter Number of rows:\");
int rows = scan.nextInt();
System.out.println(\"Enter Nummber of columns:\");
int cols = scan.nextInt();
int a[][] = new int[rows][cols];
System.out.println(\"Enter matrix elements;\");
for(int i=0; i
Solution
MagicSquareTest.java
import java.util.Scanner;
public class MagicSquareTest {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scan = new Scanner(System.in);
System.out.println(\"Enter Number of rows:\");
int rows = scan.nextInt();
System.out.println(\"Enter Nummber of columns:\");
int cols = scan.nextInt();
int a[][] = new int[rows][cols];
System.out.println(\"Enter matrix elements;\");
for(int i=0; i.
What is new in Java 8
Java 8 new features describes using practical examples. Included theoretical aspect as well as sample examples.
import java.util.Scanner;public class ArrayOperation { inp.pdf
import java.util.Scanner;
public class ArrayOperation {
/* input method implementation */
public static double[] input() {
Scanner sc = new Scanner(System.in);
System.out.println(\"Please enter the size of array\");
int n = sc.nextInt();
double number[] = new double[n];
/* Inserting element to array */
for (int i = 0; i < n; i++) {
number[i] = sc.nextDouble();
}
/* printing array by calling print method */
print(number);
return number;
}
public static void print(double number[]) {
/* Printing array */
for (int i = 0; i < number.length; i++) {
System.out.print(number[i] + \" \");
}
System.out.println();
}
/* sqrtnumber method implemantation */
public static void sqrtNumber(double number[]) {
/* Printing sqrt of numbers */
System.out.println(\"Square root of Number of an array\");
for (int i = 0; i < number.length; i++) {
double num = Math.sqrt(number[i]);
System.out.println(num);
}
}
public static void main(String args[]) {
/* Calling initaize array */
double number[] = input();
/* calling sqrtnumber */
sqrtNumber(number);
}
}
/***********output*****************/
Please enter the size of array
5
5
6
7
8
14
5.0 6.0 7.0 8.0 14.0
Square root of Number of an array
2.23606797749979
2.449489742783178
2.6457513110645907
2.8284271247461903
3.7416573867739413
Solution
import java.util.Scanner;
public class ArrayOperation {
/* input method implementation */
public static double[] input() {
Scanner sc = new Scanner(System.in);
System.out.println(\"Please enter the size of array\");
int n = sc.nextInt();
double number[] = new double[n];
/* Inserting element to array */
for (int i = 0; i < n; i++) {
number[i] = sc.nextDouble();
}
/* printing array by calling print method */
print(number);
return number;
}
public static void print(double number[]) {
/* Printing array */
for (int i = 0; i < number.length; i++) {
System.out.print(number[i] + \" \");
}
System.out.println();
}
/* sqrtnumber method implemantation */
public static void sqrtNumber(double number[]) {
/* Printing sqrt of numbers */
System.out.println(\"Square root of Number of an array\");
for (int i = 0; i < number.length; i++) {
double num = Math.sqrt(number[i]);
System.out.println(num);
}
}
public static void main(String args[]) {
/* Calling initaize array */
double number[] = input();
/* calling sqrtnumber */
sqrtNumber(number);
}
}
/***********output*****************/
Please enter the size of array
5
5
6
7
8
14
5.0 6.0 7.0 8.0 14.0
Square root of Number of an array
2.23606797749979
2.449489742783178
2.6457513110645907
2.8284271247461903
3.7416573867739413.
How do I fix this error - Exception in thread -main- java-lang-NullPoi.pdf
How do I fix this error "
Exception in thread "main" java.lang.NullPointerException: Cannot invoke "String.hashCode()"
because "action" is null
at AddressBook.main(AddressBook.java:25)"
import java.util.Scanner;
public class AddressBook {
public static void main(String[] args) {
Tablea addressBook = new Tablea();
Scanner scanner = new Scanner(System.in);
String name, address;
String action = null;
boolean moreEntries = true;
while (moreEntries) {
System.out.println("/nMenu");
System.out.println("n.Add Entry");
System.out.println("d. Delete Entry");
System.out.println("u. Update Entry");
System.out.println("l. Search");
System.out.println("a. View All");
System.out.println("q. Exit");
// Insert a new entry into the address book
switch (action) {
case "n":
System.out.print("Enter a name: ");
name = scanner.nextLine();
System.out.print("Enter an address: ");
address = scanner.nextLine();
addressBook.insert(name, address);
System.out.println("New Contact has been added,");
System.out.print("Add another entry? (y/n): ");
String answer = scanner.nextLine().toLowerCase();
moreEntries = answer.equals("y") || answer.equals("yes");
break;
// Delete an entry from the address book
case "d":
System.out.println("Enter a name to delete: ");
name = scanner.nextLine();
boolean deleted = addressBook.delete(name);
if (deleted) {
System.out.println("Address deleted");
} else {
System.out.println("Name not found");
}
break;
// Update an entry in the address book
case "u":
System.out.print("Enter a name to update: ");
name = scanner.nextLine();
System.out.print("Enter a new address: ");
address = scanner.nextLine();
boolean updated = addressBook.update(name, address);
if (updated) {
System.out.println("Address updated");
} else {
System.out.println("Name not found");
}
break;
// Lookup an entry in the address book
case "l":
System.out.print("Enter a name to look up: ");
name = scanner.nextLine();
String result = addressBook.lookUp(name);
if (result != null) {
System.out.println("Address: " + result);
} else {
System.out.println("Name not found");
}
break;
// Display all entries in the address book
case "a":
System.out.println("All entries:");
addressBook.displayAll();
break;
// Quit the program
case"q":
System.out.println("Quitting...");
}
}
}
}
Other files that go with it
public class Node {
private String name;
private String address;
private Node next;
Node() {
// add here ..
}
Node(String name, String address) {
// add here ..
this.name = name;
this.address = address;
this.next = null;
}
public String getKey() {
// add here ..
return this.name;
}
public void setKey(String name) {
// add here ..
this.name = name;
}
public String getValue() {
// add here ..
return this.address;
}
public void setValue(String address) {
// add here ..
this.address = address;
}
public Node getNext() {
// add here ..
return this.next;
}
public void setNext(Node next) {
// add here ..
this.next = next;
}
}
import java.util.Scanner;
public class Tablea {
private Node mark;
public Node.
Riboflavin is required in the conversion of carbo.pdf
Riboflavin is required in the conversion of carbohydrates, fat and protein into
energy required for cell functions.
Solution
Riboflavin is required in the conversion of carbohydrates, fat and protein into
energy required for cell functions..
PbS,Ag2O and CaSO4 are stable as they are insolub.pdf
PbS,Ag2O and CaSO4 are stable as they are insoluble in water .
Solution
PbS,Ag2O and CaSO4 are stable as they are insoluble in water ..
If multiple orbitals of the same energy are avail.pdf
If multiple orbitals of the same energy are available unoccupied orbitals will be
filled before occupied orbitals are reused
Solution
If multiple orbitals of the same energy are available unoccupied orbitals will be
filled before occupied orbitals are reused.
What is a Distributed System Compare it with a computer network sys.pdf
What is a Distributed System? Compare it with a computer network system.
It is a one of the model in the computer network system; these components communicate and
coordinate their actions by interchanging the messages. Process of sharing complex problems
over the network we can use the distributed systems.
Distributed Systems can be configured in Local Area Network like 10\'s of host systems.
The main principles of distributed systems are
Resource Sharing
Concurrency
Transparency
Fault Tolerance.
Coming to the point of comparison computer network just contains the hardware and its software
that will used transfer the data based on the individual working of the network. In case of
Distributed system connect one system to another system and provides data transfer the other
machines outside the systems without know the complete about machine to other systems.
In other main comparison is distributed system have not idea about the multiple processor
methodlgies.While in computer network, explicitly log onto one machine and submit
jobs remotely all files moves around the network . In the distributed system it is not happened.
While another main difference is distributed system is built on the top of the systems.
Solution
What is a Distributed System? Compare it with a computer network system.
It is a one of the model in the computer network system; these components communicate and
coordinate their actions by interchanging the messages. Process of sharing complex problems
over the network we can use the distributed systems.
Distributed Systems can be configured in Local Area Network like 10\'s of host systems.
The main principles of distributed systems are
Resource Sharing
Concurrency
Transparency
Fault Tolerance.
Coming to the point of comparison computer network just contains the hardware and its software
that will used transfer the data based on the individual working of the network. In case of
Distributed system connect one system to another system and provides data transfer the other
machines outside the systems without know the complete about machine to other systems.
In other main comparison is distributed system have not idea about the multiple processor
methodlgies.While in computer network, explicitly log onto one machine and submit
jobs remotely all files moves around the network . In the distributed system it is not happened.
While another main difference is distributed system is built on the top of the systems..
USES OF FINANCIAL STATEMENT ANALYSISFINANCIAL STATEMENT ANALYSIS .pdf
USES OF FINANCIAL STATEMENT ANALYSIS:
FINANCIAL STATEMENT ANALYSIS IS STUDIED AND REVIEWED FOR MAKING
BETTER ECONOMIC DECISIONS BY THE USERS. THE THREE MAIN FINANCIAL
STATEMENTS ARE 1.CASH FLOW STATEMENT 2.BALANCE SHEET 3. INCOME
STATEMENT.
THE USERS OF THE FINANCIAL INFORMATION ARE THE
INVESTORS,STAKEHOLDERS,PUBLIC,INVESTORS.
BY USING VARIOUS METHODS OF FINANCIAL ANALYSIS LIKE 1. RATIO ANALYSIS
2. DU PONY ANALYSIS 3. HORIZONTAL AND 4. VERTICAL ANALYSIS. BY
STUDYING THE HISTORICAL DATA. WITH A SET OF ASSUMPTIONS WE CAN
PREDICT THE FUTURE PERFORMANCE OF THE COMPANY, AND ALSO
INVESTIGATE THE CURRENT PERFORMANCE WHICH WILL HELP THEM MAKE A
BETTER INFORMED FINANCIAL DECISION.
THE BALANCE SHEET PROVIDES DATA ON THE ASSETS AND LIABILITIES, AND
THE OWNERS\'S EQUITY OF THE COMPANY. THE INCOME STATEMENT BEGINS
WITH GROSS INCOME ANS ENDS WITH NET PROFIT. IT SHOWS THE OPERATING
PROFIT, EBIT, PAT, EBITDA. THE CASH FLOW STATEMENT SHOWS THE CASH
FLOWS OF THE COMPANY COMING FROM VARIOUS ACTIVITIES LIKE
OPERATING,INVESTING AND FINANCING.
WHAT ARE SIC CODES AND HOW THEY ARE USEFUL?
THESE ARE 4 DIGIT CODES ASSIGNED TO EVERY BUSINESS. THEY CAN HELP TO
FIND THE EXACT COMPANY WE ARE SEARCHING FOR IN THE PARTICULAR
INDUSTRY, AND ALSO THE TARGET THE RESULTS TO PARTICULAR REGION OR
DEMOGRAPHIC.
THE WAY TO READ SIC CODE IS SIMPLE ONCE WE KNOW THE INDUSTRY THE
COMPANY IS OPERATING IN.
THE FIRST TWO DIGITS DETERMINES THE MAJOR INDUSTRY GROUP.
THE THIRD DIGIT DETERMINES THE INDUSTRY GROUP.
THE FOURTH DIGIT DETERMINES THE INDUSTRY ITSELF.
THESE CODES ARE USEFUL IN THE SENSE THAT, USING THESE CODES CAN
REDUCE THE TIME AND EFFORT IN DOING ENDLESS HOURS OF RESEARCH IN
FINDING WHAT BUSINESSES ARE IN CERTAIN AREAS . WITH THE HELP OF THESE
CODES ,WE CAN EASILY FIND INFORMATION ON THE BUSINESS WE ARE
RESEARCHING ON.
WHAT ARE THE PROBLEMS OF FINANCIAL STATEMENT ANALYSIS:
1. THERE IS A LACK OF A THEORTICAL BACKGROUND FOR THE ANALYSIS OF
RATIOS, ITS DIFFICULT TO INTERPRET THE RATIOS. THIS LEADS TO IMPROPER
UNDERSTANDING OF THE RATIOS TO DEEM THEM AS APPROPRIATE OR NOT.
2. THE WIDE RANGE OF PRODUCTS IN WHICH A COMPANY TRADES,MAKES IT
DIFFICULT TO MAKE COMPARISON BETWEEN FIRMS HENCE RELATIVE RATIO
ANALYSIS BECOMES DIFFICULT.
3. WINDOW DRESSING BY FIRMS: SOME FIRMS RESORT TO PRACTICES WHERE
THEY INFLATE THEIR SALES FIGURES, OR SHOW BETTER LIQUIDITY POSITIONS
AND BETTER TURN OVER OF INVENTORY. THESE MALPRACTICES PRESENTS A
ROSY PICTURE TO THE INVESTOR.
WHY DO WE SAY FINANCIAL STATEMENTS ANALYSIS IS MANAGEMENT BY
EXCEPTION:
MANAGEMENT BY EXCEPTION IS THE STUDY OF THE FINANCIALS OF THE
BUSINESS ONLY IF THERE IS A SIGNIFICANT DEVIATION OF THE BUDGETED
FROM THE EXPECTED,ONLY THOSE ISSUES ARE BROUGHT UNDER THE SCRUTINY
OF THE MANAGEMENT . IT SAVES TIMES,AND HELP THE MANAGERS
EFFECTIVELY MANAGE THEIR BUSINESS.
IN THE SAME WAY FINANCIAL STATEMENT ANALYSIS PROVIDES A SUMMARY OF
THE BUSINESS RESULTS IN THE FINANCIAL YEAR AND ONLY STUDIES THE CORE
FINANCIALS OF THE BUSINESS.IT DOES POINT OUT IN.
The movement of watersolvent across the osmotic gradient takes plac.pdf
The movement of water/solvent across the osmotic gradient takes place in the presence of a
semi-permeable membrane. It functionally depends upon the concentration of solute particles
present on the both sides of the solutions which are separated by the semi-permeable membrane.
In a cell where the concentration gradient is such that water tends to move inside the cell, the cell
must be hypertonic with respect to the surroundings. Movement of water takes place across this
concentration gradient from hypotonic to hypertonic solution (from surrounding to cell) until the
osmotic concentration is same on both sides. In a plant cell, this movement will stop as early as
the concentrations are same on both sides.
On the contrary, the animal cells maintain a discrete physiological concentration of each and
every ion inside the cell which is necessary for solute transport, intercellular communication,
action potential and maintenance of electrochemical gradient. For this purpose, the animal cells
have different kind of solute channel protien located in their membranes. Although osmotic
gradient does play a role in solvent transport but maintenance of solute concentration is of
primary importance and thus the general osmotic gradient is different in animal cells as
compared to plant cells. In animal cells, it is more complex and sophisticated in nature and
requires ATP for operation purpose.
Solution
The movement of water/solvent across the osmotic gradient takes place in the presence of a
semi-permeable membrane. It functionally depends upon the concentration of solute particles
present on the both sides of the solutions which are separated by the semi-permeable membrane.
In a cell where the concentration gradient is such that water tends to move inside the cell, the cell
must be hypertonic with respect to the surroundings. Movement of water takes place across this
concentration gradient from hypotonic to hypertonic solution (from surrounding to cell) until the
osmotic concentration is same on both sides. In a plant cell, this movement will stop as early as
the concentrations are same on both sides.
On the contrary, the animal cells maintain a discrete physiological concentration of each and
every ion inside the cell which is necessary for solute transport, intercellular communication,
action potential and maintenance of electrochemical gradient. For this purpose, the animal cells
have different kind of solute channel protien located in their membranes. Although osmotic
gradient does play a role in solvent transport but maintenance of solute concentration is of
primary importance and thus the general osmotic gradient is different in animal cells as
compared to plant cells. In animal cells, it is more complex and sophisticated in nature and
requires ATP for operation purpose..
These groups are closely related not only is SO(2) a subgroup of O(.pdf
These groups are closely related: not only is SO(2) a subgroup of O(2) because any two
reflections gives a rotation.Over the field R of real numbers, the orthogonal group O(n,?R) and
the special orthogonal group SO(n,?R) are often simply denoted by O(n) and SO(n) if no
confusion is possible. They form real compact Lie groups of dimension n(n ? 1)/2. O(n,?R) has
two connected components, with SO(n,?R) being the identity component, i.e., the connected
component containing the identity matrix.
SO(n,?R) is a subgroup of E+(n), which consists of direct isometries, i.e., isometries preserving
orientation; it contains those that leave the origin fixed
Solution
These groups are closely related: not only is SO(2) a subgroup of O(2) because any two
reflections gives a rotation.Over the field R of real numbers, the orthogonal group O(n,?R) and
the special orthogonal group SO(n,?R) are often simply denoted by O(n) and SO(n) if no
confusion is possible. They form real compact Lie groups of dimension n(n ? 1)/2. O(n,?R) has
two connected components, with SO(n,?R) being the identity component, i.e., the connected
component containing the identity matrix.
SO(n,?R) is a subgroup of E+(n), which consists of direct isometries, i.e., isometries preserving
orientation; it contains those that leave the origin fixed.
The probability of atom has zero quanta of energy is P=Number.pdf
The probability of atom has zero quanta of energy is
P=Number of favarable states/Total number of states = 1/4 = 0.25 =25%
Solution
The probability of atom has zero quanta of energy is
P=Number of favarable states/Total number of states = 1/4 = 0.25 =25%.
Copper turns green because it oxidizes. Coppe.pdf
Copper \"turns green\" because it oxidizes. Copper oxide is green in color. The
green layer that forms is called patina, and is actually a protective surface.
Solution
Copper \"turns green\" because it oxidizes. Copper oxide is green in color. The
green layer that forms is called patina, and is actually a protective surface..
CO2 and NO2 are acidic oxides as non-metal form a.pdf
CO2 and NO2 are acidic oxides as non-metal form acidic oxides. Al2O3 is an
amphoteric oxide as it is a lewis acid but forms Al(OH)3 (which is basic) in water. CaO is basic
oxide as metals form basic oxides
Solution
CO2 and NO2 are acidic oxides as non-metal form acidic oxides. Al2O3 is an
amphoteric oxide as it is a lewis acid but forms Al(OH)3 (which is basic) in water. CaO is basic
oxide as metals form basic oxides.
Ques-1 Development of tube feet of CRINOIDEADevelopment of tube f.pdf
Ques-1: Development of tube feet of CRINOIDEA
Development of tube feet is from the larval stage in Crinoidea (echinoderms) and these tube foot
useful for locomotion in adult species. Echinoderms are deuterostomes. Larval forms of
echinoderms possess bilateral symmetry and a mouth arises from opposite end of the blastopore
and alimentary canal forms connecting both during embryonic development (metamorphosis).
Larval form is ciliated & from which this tube foot is developed in adults with pentaradial
symmetry during metamorphosis. Adult echinoderms possess a water vascular system associated
with external tube feet as well as a calcareous endoskeleton along with ossicles interconnected
collagen fibres. Sea urchins often use tube feet along with spines for jerking movement and
peristaltic movement.
Adult echinoderms possess a water vascular system associated with external tube feet as well as
a calcareous endoskeleton along with ossicles interconnected collagen fibres. Sea urchins often
use tube feet along with spines for jerking movement and peristaltic movement. These are
appeared in sea stars, these openings are smaller, and yellow button like warts located on the
aboral surface of sea stars. This opening has other important parts, which perform meticulous
function in water vascular system, and these parts are tube feet, stone canal, ring and radial
canals.
Ques-2:
Spine structure of Ophiuroidea (echinoderm) are arranged in 5 rows i& connected to ligaments
with mutable collagenous substance. These spines are composed of dermal calcareous ossicles or
calcareous spicules
Solution
Ques-1: Development of tube feet of CRINOIDEA
Development of tube feet is from the larval stage in Crinoidea (echinoderms) and these tube foot
useful for locomotion in adult species. Echinoderms are deuterostomes. Larval forms of
echinoderms possess bilateral symmetry and a mouth arises from opposite end of the blastopore
and alimentary canal forms connecting both during embryonic development (metamorphosis).
Larval form is ciliated & from which this tube foot is developed in adults with pentaradial
symmetry during metamorphosis. Adult echinoderms possess a water vascular system associated
with external tube feet as well as a calcareous endoskeleton along with ossicles interconnected
collagen fibres. Sea urchins often use tube feet along with spines for jerking movement and
peristaltic movement.
Adult echinoderms possess a water vascular system associated with external tube feet as well as
a calcareous endoskeleton along with ossicles interconnected collagen fibres. Sea urchins often
use tube feet along with spines for jerking movement and peristaltic movement. These are
appeared in sea stars, these openings are smaller, and yellow button like warts located on the
aboral surface of sea stars. This opening has other important parts, which perform meticulous
function in water vascular system, and these parts are tube feet, stone canal, ring and radial
canals.
Ques-2:
Spi.
Program.csusing System; using System.Collections.Generic; usin.pdf
Program.cs
using System;
using System.Collections.Generic;
using System.Linq;
using System.Threading.Tasks;
using System.Windows.Forms;
namespace Population_Database
{
static class Program
{
static void Main()
{
Application.EnableVisualStyles();
Application.SetCompatibleTextRenderingDefault(false);
Application.Run(new Form1());
}
}
}
Form1.cs
using System;
using System.Collections.Generic;
using System.ComponentModel;
using System.Data;
using System.Drawing;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.Windows.Forms;
namespace Population_Database
{
public partial class Form1 : Form
{
public Form1()
{
InitializeComponent();
}
private void cityBindingNavigatorSaveItem_Click(object sender, EventArgs e)
{
this.Validate();
this.cityBindingSource.EndEdit();
this.tableAdapterManager.UpdateAll(this.cityDataSet);
}
private void Form1_Load(object sender, EventArgs e)
{
// TODO: This line of code loads data into the \'cityDataSet.City\' table. You can move,
or remove it, as needed.
this.cityTableAdapter.Fill(this.cityDataSet.City);
}
private void btnAscPopulation_Click(object sender, EventArgs e)
{
// Sort the table by population in ascending order
this.cityTableAdapter.FillByAscPopulation(this.cityDataSet.City);
}
private void btnDescPopulation_Click(object sender, EventArgs e)
{
// Sort the table by population in descending order
this.cityTableAdapter.FillByDescPopulation(this.cityDataSet.City);
}
private void btnName_Click(object sender, EventArgs e)
{
this.cityTableAdapter.FillByCity(this.cityDataSet.City);
}
private void btnTotal_Click(object sender, EventArgs e)
{
// Declare variable to hold total population.
double totalPopulation;
// Get the total population.
totalPopulation = (double)this.cityTableAdapter.TotalPopulation();
// Display the total population.
MessageBox.Show(\"Total Population: \" + totalPopulation.ToString(\"n0\"));
}
private void btnAverage_Click(object sender, EventArgs e)
{
// Declare variable to hold average population.
double averagePopulation;
// Get the average population.
averagePopulation = (double)this.cityTableAdapter.AveragePopulation();
// Display the average population.
MessageBox.Show(\"Average Population: \" + averagePopulation.ToString(\"n0\"));
}
private void btnMaxPopulation_Click(object sender, EventArgs e)
{
// Declare variable to hold highest population.
double maxPopulation;
// Get the highest population.
maxPopulation = (double)this.cityTableAdapter.MaxPopulation();
// Display the highest population.
MessageBox.Show(\"Highest Population: \" + maxPopulation.ToString(\"n0\"));
}
private void btnMinPopulation_Click(object sender, EventArgs e)
{
// Declare variable to hold lowest population.
double minPopulation;
// Get the lowest population.
minPopulation = (double)this.cityTableAdapter.MinPopulation();
// Display the lowest population.
MessageBox.Show(\"Lowest Population: \" + minPopulation.ToString(\"n0\"));
}
private void btnExit_Click(object sender, EventArgs e)
{
// Cl.
More Related Content
Similar to package chegg;import java.util.ArrayList; import java.util.List;.pdf
Collection Core Concept
Collection, Collections Framework, Core Java, Corporate Java, Rays Technologies, SunilOS, Rays Indore, Rays Pune, Rays Delhi
MagicSquareTest.java import java.util.Scanner;public class Mag.pdf
MagicSquareTest.java
import java.util.Scanner;
public class MagicSquareTest {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scan = new Scanner(System.in);
System.out.println(\"Enter Number of rows:\");
int rows = scan.nextInt();
System.out.println(\"Enter Nummber of columns:\");
int cols = scan.nextInt();
int a[][] = new int[rows][cols];
System.out.println(\"Enter matrix elements;\");
for(int i=0; i
Solution
MagicSquareTest.java
import java.util.Scanner;
public class MagicSquareTest {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scan = new Scanner(System.in);
System.out.println(\"Enter Number of rows:\");
int rows = scan.nextInt();
System.out.println(\"Enter Nummber of columns:\");
int cols = scan.nextInt();
int a[][] = new int[rows][cols];
System.out.println(\"Enter matrix elements;\");
for(int i=0; i.
What is new in Java 8
Java 8 new features describes using practical examples. Included theoretical aspect as well as sample examples.
import java.util.Scanner;public class ArrayOperation { inp.pdf
import java.util.Scanner;
public class ArrayOperation {
/* input method implementation */
public static double[] input() {
Scanner sc = new Scanner(System.in);
System.out.println(\"Please enter the size of array\");
int n = sc.nextInt();
double number[] = new double[n];
/* Inserting element to array */
for (int i = 0; i < n; i++) {
number[i] = sc.nextDouble();
}
/* printing array by calling print method */
print(number);
return number;
}
public static void print(double number[]) {
/* Printing array */
for (int i = 0; i < number.length; i++) {
System.out.print(number[i] + \" \");
}
System.out.println();
}
/* sqrtnumber method implemantation */
public static void sqrtNumber(double number[]) {
/* Printing sqrt of numbers */
System.out.println(\"Square root of Number of an array\");
for (int i = 0; i < number.length; i++) {
double num = Math.sqrt(number[i]);
System.out.println(num);
}
}
public static void main(String args[]) {
/* Calling initaize array */
double number[] = input();
/* calling sqrtnumber */
sqrtNumber(number);
}
}
/***********output*****************/
Please enter the size of array
5
5
6
7
8
14
5.0 6.0 7.0 8.0 14.0
Square root of Number of an array
2.23606797749979
2.449489742783178
2.6457513110645907
2.8284271247461903
3.7416573867739413
Solution
import java.util.Scanner;
public class ArrayOperation {
/* input method implementation */
public static double[] input() {
Scanner sc = new Scanner(System.in);
System.out.println(\"Please enter the size of array\");
int n = sc.nextInt();
double number[] = new double[n];
/* Inserting element to array */
for (int i = 0; i < n; i++) {
number[i] = sc.nextDouble();
}
/* printing array by calling print method */
print(number);
return number;
}
public static void print(double number[]) {
/* Printing array */
for (int i = 0; i < number.length; i++) {
System.out.print(number[i] + \" \");
}
System.out.println();
}
/* sqrtnumber method implemantation */
public static void sqrtNumber(double number[]) {
/* Printing sqrt of numbers */
System.out.println(\"Square root of Number of an array\");
for (int i = 0; i < number.length; i++) {
double num = Math.sqrt(number[i]);
System.out.println(num);
}
}
public static void main(String args[]) {
/* Calling initaize array */
double number[] = input();
/* calling sqrtnumber */
sqrtNumber(number);
}
}
/***********output*****************/
Please enter the size of array
5
5
6
7
8
14
5.0 6.0 7.0 8.0 14.0
Square root of Number of an array
2.23606797749979
2.449489742783178
2.6457513110645907
2.8284271247461903
3.7416573867739413.
How do I fix this error - Exception in thread -main- java-lang-NullPoi.pdf
How do I fix this error "
Exception in thread "main" java.lang.NullPointerException: Cannot invoke "String.hashCode()"
because "action" is null
at AddressBook.main(AddressBook.java:25)"
import java.util.Scanner;
public class AddressBook {
public static void main(String[] args) {
Tablea addressBook = new Tablea();
Scanner scanner = new Scanner(System.in);
String name, address;
String action = null;
boolean moreEntries = true;
while (moreEntries) {
System.out.println("/nMenu");
System.out.println("n.Add Entry");
System.out.println("d. Delete Entry");
System.out.println("u. Update Entry");
System.out.println("l. Search");
System.out.println("a. View All");
System.out.println("q. Exit");
// Insert a new entry into the address book
switch (action) {
case "n":
System.out.print("Enter a name: ");
name = scanner.nextLine();
System.out.print("Enter an address: ");
address = scanner.nextLine();
addressBook.insert(name, address);
System.out.println("New Contact has been added,");
System.out.print("Add another entry? (y/n): ");
String answer = scanner.nextLine().toLowerCase();
moreEntries = answer.equals("y") || answer.equals("yes");
break;
// Delete an entry from the address book
case "d":
System.out.println("Enter a name to delete: ");
name = scanner.nextLine();
boolean deleted = addressBook.delete(name);
if (deleted) {
System.out.println("Address deleted");
} else {
System.out.println("Name not found");
}
break;
// Update an entry in the address book
case "u":
System.out.print("Enter a name to update: ");
name = scanner.nextLine();
System.out.print("Enter a new address: ");
address = scanner.nextLine();
boolean updated = addressBook.update(name, address);
if (updated) {
System.out.println("Address updated");
} else {
System.out.println("Name not found");
}
break;
// Lookup an entry in the address book
case "l":
System.out.print("Enter a name to look up: ");
name = scanner.nextLine();
String result = addressBook.lookUp(name);
if (result != null) {
System.out.println("Address: " + result);
} else {
System.out.println("Name not found");
}
break;
// Display all entries in the address book
case "a":
System.out.println("All entries:");
addressBook.displayAll();
break;
// Quit the program
case"q":
System.out.println("Quitting...");
}
}
}
}
Other files that go with it
public class Node {
private String name;
private String address;
private Node next;
Node() {
// add here ..
}
Node(String name, String address) {
// add here ..
this.name = name;
this.address = address;
this.next = null;
}
public String getKey() {
// add here ..
return this.name;
}
public void setKey(String name) {
// add here ..
this.name = name;
}
public String getValue() {
// add here ..
return this.address;
}
public void setValue(String address) {
// add here ..
this.address = address;
}
public Node getNext() {
// add here ..
return this.next;
}
public void setNext(Node next) {
// add here ..
this.next = next;
}
}
import java.util.Scanner;
public class Tablea {
private Node mark;
public Node.
Similar to package chegg;import java.util.ArrayList; import java.util.List;.pdf (8)
MagicSquareTest.java import java.util.Scanner;public class Mag.pdf
MagicSquareTest.java import java.util.Scanner;public class Mag.pdf
import java.util.Scanner;public class ArrayOperation { inp.pdf
import java.util.Scanner;public class ArrayOperation { inp.pdf
How do I fix this error - Exception in thread -main- java-lang-NullPoi.pdf
How do I fix this error - Exception in thread -main- java-lang-NullPoi.pdf
More from anandf0099
Riboflavin is required in the conversion of carbo.pdf
Riboflavin is required in the conversion of carbohydrates, fat and protein into
energy required for cell functions.
Solution
Riboflavin is required in the conversion of carbohydrates, fat and protein into
energy required for cell functions..
PbS,Ag2O and CaSO4 are stable as they are insolub.pdf
PbS,Ag2O and CaSO4 are stable as they are insoluble in water .
Solution
PbS,Ag2O and CaSO4 are stable as they are insoluble in water ..
If multiple orbitals of the same energy are avail.pdf
If multiple orbitals of the same energy are available unoccupied orbitals will be
filled before occupied orbitals are reused
Solution
If multiple orbitals of the same energy are available unoccupied orbitals will be
filled before occupied orbitals are reused.
What is a Distributed System Compare it with a computer network sys.pdf
What is a Distributed System? Compare it with a computer network system.
It is a one of the model in the computer network system; these components communicate and
coordinate their actions by interchanging the messages. Process of sharing complex problems
over the network we can use the distributed systems.
Distributed Systems can be configured in Local Area Network like 10\'s of host systems.
The main principles of distributed systems are
Resource Sharing
Concurrency
Transparency
Fault Tolerance.
Coming to the point of comparison computer network just contains the hardware and its software
that will used transfer the data based on the individual working of the network. In case of
Distributed system connect one system to another system and provides data transfer the other
machines outside the systems without know the complete about machine to other systems.
In other main comparison is distributed system have not idea about the multiple processor
methodlgies.While in computer network, explicitly log onto one machine and submit
jobs remotely all files moves around the network . In the distributed system it is not happened.
While another main difference is distributed system is built on the top of the systems.
Solution
What is a Distributed System? Compare it with a computer network system.
It is a one of the model in the computer network system; these components communicate and
coordinate their actions by interchanging the messages. Process of sharing complex problems
over the network we can use the distributed systems.
Distributed Systems can be configured in Local Area Network like 10\'s of host systems.
The main principles of distributed systems are
Resource Sharing
Concurrency
Transparency
Fault Tolerance.
Coming to the point of comparison computer network just contains the hardware and its software
that will used transfer the data based on the individual working of the network. In case of
Distributed system connect one system to another system and provides data transfer the other
machines outside the systems without know the complete about machine to other systems.
In other main comparison is distributed system have not idea about the multiple processor
methodlgies.While in computer network, explicitly log onto one machine and submit
jobs remotely all files moves around the network . In the distributed system it is not happened.
While another main difference is distributed system is built on the top of the systems..
USES OF FINANCIAL STATEMENT ANALYSISFINANCIAL STATEMENT ANALYSIS .pdf
USES OF FINANCIAL STATEMENT ANALYSIS:
FINANCIAL STATEMENT ANALYSIS IS STUDIED AND REVIEWED FOR MAKING
BETTER ECONOMIC DECISIONS BY THE USERS. THE THREE MAIN FINANCIAL
STATEMENTS ARE 1.CASH FLOW STATEMENT 2.BALANCE SHEET 3. INCOME
STATEMENT.
THE USERS OF THE FINANCIAL INFORMATION ARE THE
INVESTORS,STAKEHOLDERS,PUBLIC,INVESTORS.
BY USING VARIOUS METHODS OF FINANCIAL ANALYSIS LIKE 1. RATIO ANALYSIS
2. DU PONY ANALYSIS 3. HORIZONTAL AND 4. VERTICAL ANALYSIS. BY
STUDYING THE HISTORICAL DATA. WITH A SET OF ASSUMPTIONS WE CAN
PREDICT THE FUTURE PERFORMANCE OF THE COMPANY, AND ALSO
INVESTIGATE THE CURRENT PERFORMANCE WHICH WILL HELP THEM MAKE A
BETTER INFORMED FINANCIAL DECISION.
THE BALANCE SHEET PROVIDES DATA ON THE ASSETS AND LIABILITIES, AND
THE OWNERS\'S EQUITY OF THE COMPANY. THE INCOME STATEMENT BEGINS
WITH GROSS INCOME ANS ENDS WITH NET PROFIT. IT SHOWS THE OPERATING
PROFIT, EBIT, PAT, EBITDA. THE CASH FLOW STATEMENT SHOWS THE CASH
FLOWS OF THE COMPANY COMING FROM VARIOUS ACTIVITIES LIKE
OPERATING,INVESTING AND FINANCING.
WHAT ARE SIC CODES AND HOW THEY ARE USEFUL?
THESE ARE 4 DIGIT CODES ASSIGNED TO EVERY BUSINESS. THEY CAN HELP TO
FIND THE EXACT COMPANY WE ARE SEARCHING FOR IN THE PARTICULAR
INDUSTRY, AND ALSO THE TARGET THE RESULTS TO PARTICULAR REGION OR
DEMOGRAPHIC.
THE WAY TO READ SIC CODE IS SIMPLE ONCE WE KNOW THE INDUSTRY THE
COMPANY IS OPERATING IN.
THE FIRST TWO DIGITS DETERMINES THE MAJOR INDUSTRY GROUP.
THE THIRD DIGIT DETERMINES THE INDUSTRY GROUP.
THE FOURTH DIGIT DETERMINES THE INDUSTRY ITSELF.
THESE CODES ARE USEFUL IN THE SENSE THAT, USING THESE CODES CAN
REDUCE THE TIME AND EFFORT IN DOING ENDLESS HOURS OF RESEARCH IN
FINDING WHAT BUSINESSES ARE IN CERTAIN AREAS . WITH THE HELP OF THESE
CODES ,WE CAN EASILY FIND INFORMATION ON THE BUSINESS WE ARE
RESEARCHING ON.
WHAT ARE THE PROBLEMS OF FINANCIAL STATEMENT ANALYSIS:
1. THERE IS A LACK OF A THEORTICAL BACKGROUND FOR THE ANALYSIS OF
RATIOS, ITS DIFFICULT TO INTERPRET THE RATIOS. THIS LEADS TO IMPROPER
UNDERSTANDING OF THE RATIOS TO DEEM THEM AS APPROPRIATE OR NOT.
2. THE WIDE RANGE OF PRODUCTS IN WHICH A COMPANY TRADES,MAKES IT
DIFFICULT TO MAKE COMPARISON BETWEEN FIRMS HENCE RELATIVE RATIO
ANALYSIS BECOMES DIFFICULT.
3. WINDOW DRESSING BY FIRMS: SOME FIRMS RESORT TO PRACTICES WHERE
THEY INFLATE THEIR SALES FIGURES, OR SHOW BETTER LIQUIDITY POSITIONS
AND BETTER TURN OVER OF INVENTORY. THESE MALPRACTICES PRESENTS A
ROSY PICTURE TO THE INVESTOR.
WHY DO WE SAY FINANCIAL STATEMENTS ANALYSIS IS MANAGEMENT BY
EXCEPTION:
MANAGEMENT BY EXCEPTION IS THE STUDY OF THE FINANCIALS OF THE
BUSINESS ONLY IF THERE IS A SIGNIFICANT DEVIATION OF THE BUDGETED
FROM THE EXPECTED,ONLY THOSE ISSUES ARE BROUGHT UNDER THE SCRUTINY
OF THE MANAGEMENT . IT SAVES TIMES,AND HELP THE MANAGERS
EFFECTIVELY MANAGE THEIR BUSINESS.
IN THE SAME WAY FINANCIAL STATEMENT ANALYSIS PROVIDES A SUMMARY OF
THE BUSINESS RESULTS IN THE FINANCIAL YEAR AND ONLY STUDIES THE CORE
FINANCIALS OF THE BUSINESS.IT DOES POINT OUT IN.
The movement of watersolvent across the osmotic gradient takes plac.pdf
The movement of water/solvent across the osmotic gradient takes place in the presence of a
semi-permeable membrane. It functionally depends upon the concentration of solute particles
present on the both sides of the solutions which are separated by the semi-permeable membrane.
In a cell where the concentration gradient is such that water tends to move inside the cell, the cell
must be hypertonic with respect to the surroundings. Movement of water takes place across this
concentration gradient from hypotonic to hypertonic solution (from surrounding to cell) until the
osmotic concentration is same on both sides. In a plant cell, this movement will stop as early as
the concentrations are same on both sides.
On the contrary, the animal cells maintain a discrete physiological concentration of each and
every ion inside the cell which is necessary for solute transport, intercellular communication,
action potential and maintenance of electrochemical gradient. For this purpose, the animal cells
have different kind of solute channel protien located in their membranes. Although osmotic
gradient does play a role in solvent transport but maintenance of solute concentration is of
primary importance and thus the general osmotic gradient is different in animal cells as
compared to plant cells. In animal cells, it is more complex and sophisticated in nature and
requires ATP for operation purpose.
Solution
The movement of water/solvent across the osmotic gradient takes place in the presence of a
semi-permeable membrane. It functionally depends upon the concentration of solute particles
present on the both sides of the solutions which are separated by the semi-permeable membrane.
In a cell where the concentration gradient is such that water tends to move inside the cell, the cell
must be hypertonic with respect to the surroundings. Movement of water takes place across this
concentration gradient from hypotonic to hypertonic solution (from surrounding to cell) until the
osmotic concentration is same on both sides. In a plant cell, this movement will stop as early as
the concentrations are same on both sides.
On the contrary, the animal cells maintain a discrete physiological concentration of each and
every ion inside the cell which is necessary for solute transport, intercellular communication,
action potential and maintenance of electrochemical gradient. For this purpose, the animal cells
have different kind of solute channel protien located in their membranes. Although osmotic
gradient does play a role in solvent transport but maintenance of solute concentration is of
primary importance and thus the general osmotic gradient is different in animal cells as
compared to plant cells. In animal cells, it is more complex and sophisticated in nature and
requires ATP for operation purpose..
These groups are closely related not only is SO(2) a subgroup of O(.pdf
These groups are closely related: not only is SO(2) a subgroup of O(2) because any two
reflections gives a rotation.Over the field R of real numbers, the orthogonal group O(n,?R) and
the special orthogonal group SO(n,?R) are often simply denoted by O(n) and SO(n) if no
confusion is possible. They form real compact Lie groups of dimension n(n ? 1)/2. O(n,?R) has
two connected components, with SO(n,?R) being the identity component, i.e., the connected
component containing the identity matrix.
SO(n,?R) is a subgroup of E+(n), which consists of direct isometries, i.e., isometries preserving
orientation; it contains those that leave the origin fixed
Solution
These groups are closely related: not only is SO(2) a subgroup of O(2) because any two
reflections gives a rotation.Over the field R of real numbers, the orthogonal group O(n,?R) and
the special orthogonal group SO(n,?R) are often simply denoted by O(n) and SO(n) if no
confusion is possible. They form real compact Lie groups of dimension n(n ? 1)/2. O(n,?R) has
two connected components, with SO(n,?R) being the identity component, i.e., the connected
component containing the identity matrix.
SO(n,?R) is a subgroup of E+(n), which consists of direct isometries, i.e., isometries preserving
orientation; it contains those that leave the origin fixed.
The probability of atom has zero quanta of energy is P=Number.pdf
The probability of atom has zero quanta of energy is
P=Number of favarable states/Total number of states = 1/4 = 0.25 =25%
Solution
The probability of atom has zero quanta of energy is
P=Number of favarable states/Total number of states = 1/4 = 0.25 =25%.
Copper turns green because it oxidizes. Coppe.pdf
Copper \"turns green\" because it oxidizes. Copper oxide is green in color. The
green layer that forms is called patina, and is actually a protective surface.
Solution
Copper \"turns green\" because it oxidizes. Copper oxide is green in color. The
green layer that forms is called patina, and is actually a protective surface..
CO2 and NO2 are acidic oxides as non-metal form a.pdf
CO2 and NO2 are acidic oxides as non-metal form acidic oxides. Al2O3 is an
amphoteric oxide as it is a lewis acid but forms Al(OH)3 (which is basic) in water. CaO is basic
oxide as metals form basic oxides
Solution
CO2 and NO2 are acidic oxides as non-metal form acidic oxides. Al2O3 is an
amphoteric oxide as it is a lewis acid but forms Al(OH)3 (which is basic) in water. CaO is basic
oxide as metals form basic oxides.
Ques-1 Development of tube feet of CRINOIDEADevelopment of tube f.pdf
Ques-1: Development of tube feet of CRINOIDEA
Development of tube feet is from the larval stage in Crinoidea (echinoderms) and these tube foot
useful for locomotion in adult species. Echinoderms are deuterostomes. Larval forms of
echinoderms possess bilateral symmetry and a mouth arises from opposite end of the blastopore
and alimentary canal forms connecting both during embryonic development (metamorphosis).
Larval form is ciliated & from which this tube foot is developed in adults with pentaradial
symmetry during metamorphosis. Adult echinoderms possess a water vascular system associated
with external tube feet as well as a calcareous endoskeleton along with ossicles interconnected
collagen fibres. Sea urchins often use tube feet along with spines for jerking movement and
peristaltic movement.
Adult echinoderms possess a water vascular system associated with external tube feet as well as
a calcareous endoskeleton along with ossicles interconnected collagen fibres. Sea urchins often
use tube feet along with spines for jerking movement and peristaltic movement. These are
appeared in sea stars, these openings are smaller, and yellow button like warts located on the
aboral surface of sea stars. This opening has other important parts, which perform meticulous
function in water vascular system, and these parts are tube feet, stone canal, ring and radial
canals.
Ques-2:
Spine structure of Ophiuroidea (echinoderm) are arranged in 5 rows i& connected to ligaments
with mutable collagenous substance. These spines are composed of dermal calcareous ossicles or
calcareous spicules
Solution
Ques-1: Development of tube feet of CRINOIDEA
Development of tube feet is from the larval stage in Crinoidea (echinoderms) and these tube foot
useful for locomotion in adult species. Echinoderms are deuterostomes. Larval forms of
echinoderms possess bilateral symmetry and a mouth arises from opposite end of the blastopore
and alimentary canal forms connecting both during embryonic development (metamorphosis).
Larval form is ciliated & from which this tube foot is developed in adults with pentaradial
symmetry during metamorphosis. Adult echinoderms possess a water vascular system associated
with external tube feet as well as a calcareous endoskeleton along with ossicles interconnected
collagen fibres. Sea urchins often use tube feet along with spines for jerking movement and
peristaltic movement.
Adult echinoderms possess a water vascular system associated with external tube feet as well as
a calcareous endoskeleton along with ossicles interconnected collagen fibres. Sea urchins often
use tube feet along with spines for jerking movement and peristaltic movement. These are
appeared in sea stars, these openings are smaller, and yellow button like warts located on the
aboral surface of sea stars. This opening has other important parts, which perform meticulous
function in water vascular system, and these parts are tube feet, stone canal, ring and radial
canals.
Ques-2:
Spi.
Program.csusing System; using System.Collections.Generic; usin.pdf
Program.cs
using System;
using System.Collections.Generic;
using System.Linq;
using System.Threading.Tasks;
using System.Windows.Forms;
namespace Population_Database
{
static class Program
{
static void Main()
{
Application.EnableVisualStyles();
Application.SetCompatibleTextRenderingDefault(false);
Application.Run(new Form1());
}
}
}
Form1.cs
using System;
using System.Collections.Generic;
using System.ComponentModel;
using System.Data;
using System.Drawing;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
using System.Windows.Forms;
namespace Population_Database
{
public partial class Form1 : Form
{
public Form1()
{
InitializeComponent();
}
private void cityBindingNavigatorSaveItem_Click(object sender, EventArgs e)
{
this.Validate();
this.cityBindingSource.EndEdit();
this.tableAdapterManager.UpdateAll(this.cityDataSet);
}
private void Form1_Load(object sender, EventArgs e)
{
// TODO: This line of code loads data into the \'cityDataSet.City\' table. You can move,
or remove it, as needed.
this.cityTableAdapter.Fill(this.cityDataSet.City);
}
private void btnAscPopulation_Click(object sender, EventArgs e)
{
// Sort the table by population in ascending order
this.cityTableAdapter.FillByAscPopulation(this.cityDataSet.City);
}
private void btnDescPopulation_Click(object sender, EventArgs e)
{
// Sort the table by population in descending order
this.cityTableAdapter.FillByDescPopulation(this.cityDataSet.City);
}
private void btnName_Click(object sender, EventArgs e)
{
this.cityTableAdapter.FillByCity(this.cityDataSet.City);
}
private void btnTotal_Click(object sender, EventArgs e)
{
// Declare variable to hold total population.
double totalPopulation;
// Get the total population.
totalPopulation = (double)this.cityTableAdapter.TotalPopulation();
// Display the total population.
MessageBox.Show(\"Total Population: \" + totalPopulation.ToString(\"n0\"));
}
private void btnAverage_Click(object sender, EventArgs e)
{
// Declare variable to hold average population.
double averagePopulation;
// Get the average population.
averagePopulation = (double)this.cityTableAdapter.AveragePopulation();
// Display the average population.
MessageBox.Show(\"Average Population: \" + averagePopulation.ToString(\"n0\"));
}
private void btnMaxPopulation_Click(object sender, EventArgs e)
{
// Declare variable to hold highest population.
double maxPopulation;
// Get the highest population.
maxPopulation = (double)this.cityTableAdapter.MaxPopulation();
// Display the highest population.
MessageBox.Show(\"Highest Population: \" + maxPopulation.ToString(\"n0\"));
}
private void btnMinPopulation_Click(object sender, EventArgs e)
{
// Declare variable to hold lowest population.
double minPopulation;
// Get the lowest population.
minPopulation = (double)this.cityTableAdapter.MinPopulation();
// Display the lowest population.
MessageBox.Show(\"Lowest Population: \" + minPopulation.ToString(\"n0\"));
}
private void btnExit_Click(object sender, EventArgs e)
{
// Cl.
L{e^{-t}} = int _0 to infinty [e^{st}e^{2-t} dt = int _0 to infinty.pdf
L{e^{-t}} = int _0 to infinty [e^{st}*e^{2-t} dt = int _0 to infinty [e^{st}*e^{2} *e^{-t}dt =
e^{2} int _0 to infinty [e^{(s-1)t} dt
L{e^{-t}} = e^2/(s+1)
Solution
L{e^{-t}} = int _0 to infinty [e^{st}*e^{2-t} dt = int _0 to infinty [e^{st}*e^{2} *e^{-t}dt =
e^{2} int _0 to infinty [e^{(s-1)t} dt
L{e^{-t}} = e^2/(s+1).
Issue of Equity or Debt are commonly used methods for business finan.pdf
Issue of Equity or Debt are commonly used methods for business financing.
Buyer\'s of the Comany\'s Debt instruments have no claim to ownership in the business. This
prevents dilution of the Company\'s ownership. The holder of the debt instrument is akin to a
lender being entitled to principal / face value / base value and interest payments on the said
amount at the specified rate. The holder of the debt instrument in the Company has no right to
the future profits of the Company. However, due to the fixed nature of the returns on these
instruments, risk borne by the holder is low. Hence, the Cost of Debt Capital is also lower than
Equity Capital.
Issue of New Equity dilutes the existing ownership interest of the Company. In most cases it also
increases the shareholder base (number of shareholders) of the Company. The major
disadvantage is the possibility of future loss of control and decision making power (if issued to
large investors). However, the Company is not obligated to make payments of interest regularly
as in the case of Debt Instruments. This in turn preserves the cash flow of the Company and
makes profits available for reinvestment into the business. Equity holders take on more risk; due
to the uncertainty of business success and growth leading to uncertainty of cash inflows. This is
further magnified under a complex capital structure where the Company may have several other
obligations to meet in the pecking order first, such as secured debt, convertible hybrid
instruments, etc. The Company may also have obligations to Government Departments. These
factors result in Equity holders demanding a higher rate of return, for absorbing this risk. Thus,
the Cost of Equity is higher than cost of Debt.
When new debt is issued at high finance costs, i.e. high rates of interest, the Company may face
additional turmoil during uncertain or difficult financial situations as it increase the risk of
insolvency. Where the Company is already highly leveraged (high debt to equity ratio) and new
debt is issued at a high rate, the Company may face slower growth rates because of the obligation
to service debt before pumping resources into high growth projects and endeavours. Further, the
cost of debt also determines the cash flow to equity.
However, the one of the biggest advantages of debt over equity is that interest cost is allowed as
a deduction for the computation of tax. This in turn lowers the tax liability. Thus, the actual cost
of debt is lower than stated cost by the amount of the tax saving benefit.
The management of the Company is required to provide regular information for the investors /
shareholders to monitor. Investors / Shareholders regularly seek comprehensive updates about
the business, financial and performance information, guidace for the future, etc. This is
especially true for newer investors that are still gaining comfort about the Company This is
largely avoided when Debt instruments are issued.
Raising equity finance is very d.
In probability we have two types of eventsIndependent Events who.pdf
In probability we have two types of events:
Independent: Events who\'s probability is not affected by the previous event(s).
Dependent: Events who\'s probability can be affected by preious event(s).
What we have in this case is a dependent event because when we don\'t replace the marble, it
changes the amount of total marbles inside the jar and thus the chances of drawing another
marble changes.
Because one event relys on the other we must find their probabilities separately at first. So what
we do is figure out the probability of pulling out a blue marble and then the probability of pulling
out another after not replacing the first. We will call these event 1 and 2.
Event 1: To find the probability of pulling out a blue marble we just divide the amount of blue
marbles we have by the total marbles in the jar:
18/45. We will keep it in this form because this is the standard way of representing chances in
stats classes.
Event 2: Now what we have left are 17 blue marbles and a total of 44 marbles so the chances of
drawing a blue marble now become:
17/45.
To combine these two chances we now multiply them together:
18/45*17/44. We will of course have to find a least common denominator but that\'s not hard and
I\'m sure you could do that part on your own.
Solution
In probability we have two types of events:
Independent: Events who\'s probability is not affected by the previous event(s).
Dependent: Events who\'s probability can be affected by preious event(s).
What we have in this case is a dependent event because when we don\'t replace the marble, it
changes the amount of total marbles inside the jar and thus the chances of drawing another
marble changes.
Because one event relys on the other we must find their probabilities separately at first. So what
we do is figure out the probability of pulling out a blue marble and then the probability of pulling
out another after not replacing the first. We will call these event 1 and 2.
Event 1: To find the probability of pulling out a blue marble we just divide the amount of blue
marbles we have by the total marbles in the jar:
18/45. We will keep it in this form because this is the standard way of representing chances in
stats classes.
Event 2: Now what we have left are 17 blue marbles and a total of 44 marbles so the chances of
drawing a blue marble now become:
17/45.
To combine these two chances we now multiply them together:
18/45*17/44. We will of course have to find a least common denominator but that\'s not hard and
I\'m sure you could do that part on your own..
i have written ths code as per your requirements with clear comments.pdf
i have written ths code as per your requirements with clear comments as shown below with
output
package com.sanfoundry.hardgraph;
import java.util.Scanner;
import java.util.Vector;
class Node1
{
int name; // node ID, started from 0 to n-1
Vector preds; // predecessors (String)
Vector neibs; // neighbors (String)
Vector backs; // backward edges -node is end vertex (Integer)
Vector fors; // forward edges -node is start vertex (Integer)
int pNode; // previous node on the augmenting path
int pEdge; // from which edge this node comes on the augmenting
// path
public Node1(int id)
{
name = id;
backs = new Vector();
fors = new Vector();
pNode1 = -1;
pEdge = -1;
}
}
class Edge
{
int name; // edge ID, started from 0 to n-1
int start; // start vertex of this edge
int end; // end vertex of this edge
int direct; // forwards (+1) or backwards (-1) on augmenting path
// if 0 then not part of augmenting path
int capacity; // capacity
int flow; // current flow
public Edge(int id)
{
name = id;
start = -1;
end = -1;
direct = 0; // default is neither
capacity = 0;
flow = 0;
}
public String toString()
{
return name + \": s=\" + start + \" e=\" + end + \" d=\" + direct;
}
}
public class LongestPathinDAG
{
int n; // number of nodes
int target; // destination node
int minLength; // the minimal length of each path
Node1[] v; // used to store Nodes
Edge[] e; // used to store Edges
int[] path; // used to store temporary path
int length = 0; // length of the path
int distance = 0; // distance of the path
int[] bestPath; // used to store temporary path
int bestLength = 0; // length of the longest path
int bestDistance = -1000000; // distance of the longest path
int[] visited; // used to mark a node as visited if set as
// 1
public LongestPathinDAG()
{
Scanner sc = new Scanner(System.in);
System.out.println(\"Enter the number of vertices: \");
n = sc.nextInt();
System.out.println(\"Enter the number of edges: \");
int m = sc.nextInt();
v = new Node1[n];
e = new Edge[m];
System.out.println(n + \" nodes and \" + m + \" edges.\");
for (int i = 0; i < n; i++)
v[i] = new Node1(i);
int i = 0;
while (i < e.length)
{
Edge edge = new Edge(i);
int sVal = sc.nextInt();
edge.start = sVal;// sc.nextInt();
int eVal = sc.nextInt();
edge.end = eVal;// sc.nextInt();
edge.capacity = sc.nextInt();
System.out.println(\" edge: \" + edge.start + \" - \" + edge.end
+ \" : \" + edge.capacity);
edge.flow = 0;
e[i] = edge;
v[sVal].fors.add(i);
v[eVal].backs.add(i);
i++;
if (i == m)
break;
}
visited = new int[v.length];
path = new int[v.length];
bestPath = new int[v.length];
sc.close();
}
/*
* this function looks for a longest path starting from being to end,
* using the backtrack depth-first search.
*/
public boolean findLongestPath(int begin, int end, int minLen)
{
/*
* compute a longest path from begin to end
*/
target = end;
bestDistance = -100000000;
minLength = minLen;
dfsLongestPath(begin);
if (bestDistance == -100000000)
return false;
else
return true;
}
private void dfsLongestPath(int curr.
Hi,Please fidn the Answer.Sorting,h is Header .pdf
Hi,
Please fidn the Answer.
//////////////////Sorting,h is Header file which contians all Function decalartion
#include
#include // std::cout
#include // std::shuffle
#include // std::array
#include // std::default_random_engine
#include
using namespace std;
class Sorting
{
private:
int num;
public:
Sorting::Sorting() {
};
///Buble Sort Input array and n Number of Elemnets
void BubbleSorting(int array[], int n);
void SelectionSorting(int array[], int n);
void ShuffleArray(int array[], int n);
void DisplayArray(int array[], int n);
void displayMenu();
int choice;
};
//////////////////////////Sorting.cpp is class fuction Which Implemnets the Function
#include \"Sorting.h\"
#include
using namespace std;
///Sorting the Array Using Bubble Sort...
void Sorting::BubbleSorting(int Array[],int n)
{
int temp = 0;
cout << \"\ ------------ BUBBLE SORT ------------ \ \ \";
for (int i = 1; iArray[j + 1])
{
temp = Array[j];
Array[j] = Array[j + 1];
Array[j + 1] = temp;
}
}
cout << \"\ ------------ RESULTS BUBBLE SORT ------------ \ \ \";
DisplayArray(Array, n);
}
//////SelectionSorting input Array and n is number of Elemnets//////////////////////
void Sorting::SelectionSorting(int Array[], int n)
{
int i, n, p, k, min, loc, temp;
for (p = 1; p <= n - 1; p++) // Loop for Pass
{
min = Array[p]; // Element Selection
loc = p;
for (k = p + 1; k <= n; k++) // Finding Min Value
{
if (min > Array[k])
{
min = Array[k];
loc = k;
}
}
temp = Array[p]; // Swap Selected Element and Min Value
Array[p] = Array[loc];
Array[loc] = temp;
}
cout << \"\ ------------ RESULTS SELECTION SORT ------------ \ \ \";
DisplayArray(Array, n);
}
//////SelectionSorting input Array and n is number of Elemnets//////////////////////
///exchange each element with a randomly chosen element. It\'s possible that an element will be
exchanged with itself, but there is no problem with that
void Sorting::ShuffleArray(int Array[], int n)
{
cout << \"\ ------------ ShuffleArray SORT ------------ \ \ \";
for (int i = 0; i
#include \"Sorting.h\"
using namespace std;
int main()
{
bool SelectionOn = true;
Sorting Sorting;
int choice;
int n = 10;
int *Arry;
while (SelectionOn != false) {
cout << \"*******************************\ \";
cout << \" 1 - Enter User Input Array of Elements.\ \";
cout << \" 2 - Display User Input.\ \";
cout << \" 3 - Shuffle User Input the Elements i.\ \";
cout << \" 4 - Bubble Sorting.\ \";
cout << \" 5 - Selection Sorting.\ \";
cout << \" 6 - Exit.\ \";
cout << \" 7 - Display Menu Again. \ \";
cout << \" Enter your choice and press return: \";
cin >> choice;
switch (choice)
{
case 1:
cout << \"Enter User Input Array of Elements\ \";
cout << \"Enter No. of Elements=\";
cin >> n;
Arry = new int[n];
cout << \"\ Enter Elements=\ \";
for (int i = 1; i <= n; i++)
{
cin >> Arry[i];
}
break;
case 2:
cout << \"DISPLAY OF ARRAY\ \";
if (Arry != NULL)
{
Sorting.DisplayArray(Arry, n);
}
else
{
cout << \"ENTER ELEMENTS TO ARRAY BY SELCTING CHOICE 1\ \";
}
break;
case 3:
cout << \"SHUFFLE OF A.
More from anandf0099 (20)
Riboflavin is required in the conversion of carbo.pdf
Riboflavin is required in the conversion of carbo.pdf
PbS,Ag2O and CaSO4 are stable as they are insolub.pdf
PbS,Ag2O and CaSO4 are stable as they are insolub.pdf
If multiple orbitals of the same energy are avail.pdf
If multiple orbitals of the same energy are avail.pdf
What is a Distributed System Compare it with a computer network sys.pdf
What is a Distributed System Compare it with a computer network sys.pdf
USES OF FINANCIAL STATEMENT ANALYSISFINANCIAL STATEMENT ANALYSIS .pdf
USES OF FINANCIAL STATEMENT ANALYSISFINANCIAL STATEMENT ANALYSIS .pdf
The movement of watersolvent across the osmotic gradient takes plac.pdf
The movement of watersolvent across the osmotic gradient takes plac.pdf
These groups are closely related not only is SO(2) a subgroup of O(.pdf
These groups are closely related not only is SO(2) a subgroup of O(.pdf
The probability of atom has zero quanta of energy is P=Number.pdf
The probability of atom has zero quanta of energy is P=Number.pdf
CO2 and NO2 are acidic oxides as non-metal form a.pdf
CO2 and NO2 are acidic oxides as non-metal form a.pdf
Ques-1 Development of tube feet of CRINOIDEADevelopment of tube f.pdf
Ques-1 Development of tube feet of CRINOIDEADevelopment of tube f.pdf
Program.csusing System; using System.Collections.Generic; usin.pdf
Program.csusing System; using System.Collections.Generic; usin.pdf
L{e^{-t}} = int _0 to infinty [e^{st}e^{2-t} dt = int _0 to infinty.pdf
L{e^{-t}} = int _0 to infinty [e^{st}e^{2-t} dt = int _0 to infinty.pdf
Issue of Equity or Debt are commonly used methods for business finan.pdf
Issue of Equity or Debt are commonly used methods for business finan.pdf
In probability we have two types of eventsIndependent Events who.pdf
In probability we have two types of eventsIndependent Events who.pdf
i have written ths code as per your requirements with clear comments.pdf
i have written ths code as per your requirements with clear comments.pdf
Hi,Please fidn the Answer.Sorting,h is Header .pdf
Hi,Please fidn the Answer.Sorting,h is Header .pdf
Recently uploaded
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.
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.
Thesis Statement for students diagnonsed withADHD.ppt
Presentation required for the master in Education.
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.
Unit 8 - Information and Communication Technology (Paper I).pdf
This slides describes the basic concepts of ICT, basics of Email, Emerging Technology and Digital Initiatives in Education. This presentations aligns with the UGC Paper I syllabus.
The approach at University of Liverpool.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
Polish students' mobility in the Czech Republic
Polish students mobility to the Czech Republic within eTwinning project "Medieval adventures with Marco Polo"
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.
Embracing GenAI - A Strategic Imperative
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.
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
678020731-Sumas-y-Restas-Para-Colorear.pdf
KKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKK
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/
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 Á...Nguyen Thanh Tu Collection
https://app.box.com/s/hqnndn05v4q5a4k4jd597rkdbda0fniiIntroduction to AI for Nonprofits with Tapp Network
Dive into the world of AI! Experts Jon Hill and Tareq Monaur will guide you through AI's role in enhancing nonprofit websites and basic marketing strategies, making it easy to understand and apply.
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.
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.
The Challenger.pdf DNHS Official Publication
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
Recently uploaded (20)
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
Unit 8 - Information and Communication Technology (Paper I).pdf
Unit 8 - Information and Communication Technology (Paper I).pdf
Digital Tools and AI for Teaching Learning and Research
Digital Tools and AI for Teaching Learning and Research
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI fund...
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
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 Á...
Introduction to AI for Nonprofits with Tapp Network
Introduction to AI for Nonprofits with Tapp Network
Overview on Edible Vaccine: Pros & Cons with Mechanism
Overview on Edible Vaccine: Pros & Cons with Mechanism
package chegg;import java.util.ArrayList; import java.util.List;.pdf
- 1. package chegg; import java.util.ArrayList; import java.util.List; import java.util.ListIterator; import java.util.Scanner; import java.util.Set; import java.util.TreeMap; public class Vowles { public static void main(String args[]) { /* creating instance variable of List */ List letters = new ArrayList(); /* vowels instance variable for holding vowels */ List vowels = new ArrayList(); /* creating HashMap for storing vowels and count */ TreeMap map = new TreeMap(); /* Inserting vowels into treemap */ map.put("a", 0); map.put("e", 0); map.put("i", 0); map.put("o", 0); map.put("u", 0); /* * creating instance variable of Scanner class for taking input from * console */ Scanner scanner = new Scanner(System.in); /* * prompt for user input */ System.out.println("Please enter the letters with comma seperated"); String input = scanner.nextLine(); /* closing scanner object */ scanner.close(); String[] letter = input.split(","); /* Inserting letters into List */
- 2. for (String values : letter) { letters.add(values); } /* ListIterator for iterating list */ ListIterator itr = letters.listIterator(); while (itr.hasNext()) { String val = itr.next(); /* checking if value is any vowels */ if (val.equals("a") || val.equals("e") || val.equals("i") || val.equals("o") || val.equals("u")) { /* If vowels already exist in tree map */ if (map.containsKey(val)) { Integer value = map.get(val); map.put(val, ++value); vowels.add(val); } else { map.put(val, 1); vowels.add(val); } } } /* Removing all element from letters list */ letters.removeAll(letters); /* Getting size of vowels */ int listSize = vowels.size(); System.out.println("There are " + listSize + " vowels in the list:"); /* Iterating treeMap */ Set keys = map.keySet(); for (String key : keys) { System.out.print(key + "- " + map.get(key) + " "); } } } /***************output******************/ Please enter the letters with comma seperated
- 3. a,f,v,q,e,a,o,g,y,h,e,q,u There are 6 vowels in the list: a- 2 e- 2 i- 0 o- 1 u- 1 please rate the answer as best answer. Thanks Solution package chegg; import java.util.ArrayList; import java.util.List; import java.util.ListIterator; import java.util.Scanner; import java.util.Set; import java.util.TreeMap; public class Vowles { public static void main(String args[]) { /* creating instance variable of List */ List letters = new ArrayList(); /* vowels instance variable for holding vowels */ List vowels = new ArrayList(); /* creating HashMap for storing vowels and count */ TreeMap map = new TreeMap(); /* Inserting vowels into treemap */ map.put("a", 0); map.put("e", 0); map.put("i", 0); map.put("o", 0); map.put("u", 0); /* * creating instance variable of Scanner class for taking input from * console */ Scanner scanner = new Scanner(System.in); /* * prompt for user input
- 4. */ System.out.println("Please enter the letters with comma seperated"); String input = scanner.nextLine(); /* closing scanner object */ scanner.close(); String[] letter = input.split(","); /* Inserting letters into List */ for (String values : letter) { letters.add(values); } /* ListIterator for iterating list */ ListIterator itr = letters.listIterator(); while (itr.hasNext()) { String val = itr.next(); /* checking if value is any vowels */ if (val.equals("a") || val.equals("e") || val.equals("i") || val.equals("o") || val.equals("u")) { /* If vowels already exist in tree map */ if (map.containsKey(val)) { Integer value = map.get(val); map.put(val, ++value); vowels.add(val); } else { map.put(val, 1); vowels.add(val); } } } /* Removing all element from letters list */ letters.removeAll(letters); /* Getting size of vowels */ int listSize = vowels.size(); System.out.println("There are " + listSize + " vowels in the list:"); /* Iterating treeMap */ Set keys = map.keySet(); for (String key : keys) {
- 5. System.out.print(key + "- " + map.get(key) + " "); } } } /***************output******************/ Please enter the letters with comma seperated a,f,v,q,e,a,o,g,y,h,e,q,u There are 6 vowels in the list: a- 2 e- 2 i- 0 o- 1 u- 1 please rate the answer as best answer. Thanks