Search & Filtering
Java | JSP | JSF
Write a program in Java to accept a string and display only those characters which are consecutives.
Sample Input : UNDERSTANDING COMPUTER APPLICATIONS
Sample Output : D,E
R,S
S,T are consecutive characters
Sample Input : UNDERSTANDING COMPUTER APPLICATIONS
Sample Output : D,E
R,S
S,T are consecutive characters
Java | JSP | JSF
Write a program that lets the user enter the loan amount and loan period in number of years and displays the monthly and total payments for each interest rate starting from 5% to 8%, with an increment of 1/8. Here is a sample run:
Loan Amount: 10000
Number of Years: 5
Interest Rate Monthly Payment Total Payment
5% 188.71 11322.74
5.125% 189.28 11357.13
5.25% 189.85 11391.59
...
7.875% 202.17 12129.97
8.0% 202.76 12165.83
Loan Amount: 10000
Number of Years: 5
Interest Rate Monthly Payment Total Payment
5% 188.71 11322.74
5.125% 189.28 11357.13
5.25% 189.85 11391.59
...
7.875% 202.17 12129.97
8.0% 202.76 12165.83
Java | JSP | JSF
Give the algorithm to decide if a list of integers can be divided into two smaller lists of
equal sum. For example,
[10, 20 , 30 , 5 , 40 , 50 , 40 , 15]
can be fairly divided into
[10, 20, 30, 5, 40] and [50, 40, 15]
However,
[4, 4, 8, 10,14] cannot be divided.
equal sum. For example,
[10, 20 , 30 , 5 , 40 , 50 , 40 , 15]
can be fairly divided into
[10, 20, 30, 5, 40] and [50, 40, 15]
However,
[4, 4, 8, 10,14] cannot be divided.
Java | JSP | JSF
When proving insertion-sort, the inner loop must be shifted all sorted elements bigger than the key by 1 place/location.
Give an appropriate loopinvariant for the inner loop and must prove that loop invariant is correct.
Give an appropriate loopinvariant for the inner loop and must prove that loop invariant is correct.
Java | JSP | JSF
Extend the Main method in such a way that repeatedly values could be read, till number 0 is given. Then the programme is finished. Before that the sum of all read in figures is still given, if all readable Values were integral numbers. In all other cases nothing is given.
Java | JSP | JSF
Hi I was just wondering if you give help with assignments that are about system design
Where it includes writing atomic use cases
Coding them and doing testing??
Where it includes writing atomic use cases
Coding them and doing testing??
Java | JSP | JSF
Write a program to calculate students average test scores and their grades.
Use three arrays: a one-dimensional array to store the student names, a (parallel) two- dimensional array to store the test score, and a parallel one-dimensional array to store grades. Your program must contain at least the following methods: a method to read and to store data into two arrays, a method to calculate the average test score and grade and a method to output the result. Have your program also output the class average.
Johnson 85 83 77 91 76
Aniston 80 90 95 93 48
Cooper 78 81 11 90 73
Gupta 92 23 30 69 87
Blair 23 45 96 38 59
Grade calculation to be computed as follows:
Marks Grade
85 - 100 A
75 - 84 B
65- 74 C
50 - 64 D
<50 F
Use three arrays: a one-dimensional array to store the student names, a (parallel) two- dimensional array to store the test score, and a parallel one-dimensional array to store grades. Your program must contain at least the following methods: a method to read and to store data into two arrays, a method to calculate the average test score and grade and a method to output the result. Have your program also output the class average.
Johnson 85 83 77 91 76
Aniston 80 90 95 93 48
Cooper 78 81 11 90 73
Gupta 92 23 30 69 87
Blair 23 45 96 38 59
Grade calculation to be computed as follows:
Marks Grade
85 - 100 A
75 - 84 B
65- 74 C
50 - 64 D
<50 F
Java | JSP | JSF
/*
** file: BasicDNS.java
** purpose: This interface defines the services required of
** any DNS.
*/
public interface BasicDNS {
// update(domain, ipa) adds (or replaces)
// the IPA for this domain to the DNS database.
public void update(String domain, String ipa);
// lookUp(ipa, domain) returns the IPA associated
// with this domain, or null if it is not found in
// the database (or not returnable for legal reasons,
// such as blacklisting).
// The first argument, ipa, is the IPA from which this
// request originated.
public String lookUp(String ipa, String domain);
}
• Implement a class that implements the interface, using the fastest suitable class from the
collections framework to store and look up domain IPAs.
• Implement a test program that exercises your DNS class. It should have a simple, interactive
console user interface.
Thanks
** file: BasicDNS.java
** purpose: This interface defines the services required of
** any DNS.
*/
public interface BasicDNS {
// update(domain, ipa) adds (or replaces)
// the IPA for this domain to the DNS database.
public void update(String domain, String ipa);
// lookUp(ipa, domain) returns the IPA associated
// with this domain, or null if it is not found in
// the database (or not returnable for legal reasons,
// such as blacklisting).
// The first argument, ipa, is the IPA from which this
// request originated.
public String lookUp(String ipa, String domain);
}
• Implement a class that implements the interface, using the fastest suitable class from the
collections framework to store and look up domain IPAs.
• Implement a test program that exercises your DNS class. It should have a simple, interactive
console user interface.
Thanks
Java | JSP | JSF
a = ((i * (i + 1)) / 2) + 5;
Write a program that asks the user to input an integer, i, and determines the largest consecutive pair of numbers whose product is divisible by 33 from the first i numbers in the series.
How can i multiple number by the previous number in the series?
Write a program that asks the user to input an integer, i, and determines the largest consecutive pair of numbers whose product is divisible by 33 from the first i numbers in the series.
How can i multiple number by the previous number in the series?
Java | JSP | JSF
I need to randomly split the data in a 2 dimensional array. The data is being read from a txt file. The data must be split 75% and 25%. After the split I need to calculate the euclidean distance.
