Computer Programming

Steve Wilhite, a software engineer, is credited with inventing the Graphics Interchange Format (GIF) in 1987. Despite the ongoing debate on how to pronounce it (spoiler alert: it's "jif," not "gif"), there's no denying that Wilhite's creation has become a staple of internet culture. So, give credit where credit's due, folks!

45

one

only one artificial variable to be added

import java.io.*;

class PrimeFactors

{

private boolean prime(int a)

{

boolean b=true;

for(int i=2;i<=(a/2);i++)

{

if(a%i==0)

b=false;

}

return b;

}

protected static void main()throws IOException

{

BufferedReader in=new BufferedReader(new InputStreamReader(System.in));

System.out.print("Enter the Number: ");

int a=Integer.parseInt(in.readLine());

PrimeFactors o=new PrimeFactors();

System.out.println("Prime Factors of "+a+" are::");

for(int i=1;i<=(a/2);i++)

{

if(a%i==0)

{

boolean b=o.prime(i);

if(b==true)

System.out.print(i+" ");

}

}

}}

d = 9.55 cm

5.625

I think so because my brother in law is computer scientist and he says that if you are good at mathematics so programming will be easy to learn for you.

32/100

Here is an example from Microsoft: Each customer can have many orders but each order belongs to a single customer. In relational database terminology, this is referred to as a one-to-many relationship.

Factor the coefficients.

2

2 x 5

3 x 5

Combine the factors, eliminating duplicates.

Select the higher powers of the variables.

The LCM is 30a8c8

One possible rule is:

Un = (219n5 - 3755n4 + 24075n3 - 70645n2 + 92166n - 36960)/120

for n = 1, 2, 3, etc

Lots, biology and programming are not a necessity

10

1st one 12to 1 2nd one 1 to 2

They are both different types of triangles one has 3 equal sides and the other has 2 equal sides.

I'll tell you when i look up the word algorithm

Distance Speed Time

Dijkstra doesn't support negative weight-age, Floyd support negative edges but no negative cycles. Dijkstra running time is v2 and Floyd has v3.Dijkstra is fast compared to Floyd, because only find the shortest path for single node. FloydSlow as compared to Dijkstra.

Well, actually people who are good at math are usually pretty good at programming. Programming involves one creating an "equation" you could call it, to meet requirements. You create code to meet program requirements. It's like creating an formula to solve a problem.

Pascal's Triangle in 1653. Which was also discovered 5 centuries earlier by Chinese mathematician Yang Hui.

The answer depends on syllabus for WHAT!

2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199

Usually a formula.

No.

eg 0.1 is non terminating in binary and so would only ever be an approximation, just like 0.3, 0.33, 0.3333333 are all approximations of 1/3 (which is non terminating when represented as a decimal).