answersLogoWhite

0

📱

Computer Programming

A category for questions about computer programming and programming languages.

10,506 Questions

What is the definitnion of a isoscelies triangle?

Isosceles triangle- a triangle where two of the sides are the same length.

Is it true that if you are good at mathematics and you enjoy mathematics you can do programming?

Let me respond to this in two parts:

1. First of all, I think it's generally true that mathematical knowledge and skill is related to the ability to write and test code successfully. The mathematics that many or most programmers need includes graph theory, linear algebra, set theory, algorithm theory, and various other areas of mathematics and computer science that some people might not include in the term 'mathematics'.


2. Being a successful programmer also involves mastering a lot of other skills, especially in communication.


I worked in computing and software for decades myself. I've added a URL which outlines some of the other stuff that's involved in the occupation.

Program to find area of sphere?

Surface area of a sphere = 4*pi*radius2 square units

What are the in-line functions in cc?

In-line functions differ from normal functions by the way they are dealt with by the compiler.

Normally, a function (or its code, more exactly) is stored once within the executable program. A call to this function then results in putting the parameters onto the stack and jumping to the start address of the function. When the function is finished, the stack is freed from the parameters and the program continues right after the point from where it has jumped to the function.

For an in-line function, its code is stored at any place where it is called. This saves us from the administrative overhead (putting parameters etc. onto the stack and cleaning up at the end) and, thus, reduced computing time. On the other side it enlarges the eecutable.<br>

This leads to some restrictions to inline-functions.

Can 7985 be a hexadecimal number?

Yes it could be.

It would be interpreted as 7 x (16 x 16 x16) + 9 x (16 x 16) + 8 x 16 +5

What is the common factor of 30 and 60?

30

Any time the smaller number goes directly into the larger, the smaller is the GCF (HCF) and the larger is the LCM/LCD.

Program for printing prime numbers in vb?

Option Explicit

Dim i,j,var,Flag,n

var=""

n=cint(InputBox("Enter nth Number to check Prime Numbers"))

i = 3

While i <= n

Flag = True

j = 2

While j <= i\2 And Flag

Flag = i Mod j > 0

j = j + 1

Wend

If Flag Then

var = var&" "&i

End If

i = i + 2

Wend

MsgBox("Prime numbers within n numbers "&n&"= : 1" & var)

How can you find the word length of your computer?

Since the term "word" is loosely defined there is no guaranteed method of determining the length of a "word" on a given architecture. This being said, typically the word size of a given architecture is the size in bits of the system's general purpose registers, equivalent to the bit-width of the data bus connected.

So given the above the easiest way to determine the word length is to look up the specifications of the processor, but without this information the word length can be determined by loading up your favorite debugger, dumping the registers, and counting the number of bits in the gen. purpose regs.

Who uses data bases?

schools,doctors surgery's, shops, library, police station etcetera...etcetera

hope this helps xx

Xvampirediariesx

How much is the Circumference of a circle if the diameter is 25.8?

c = Pi * d

Pi is approximately 3.1415926

d is 25.8

c = 25.8 * 3.1415926

== circumference is approximately 81.05308908

What is the algorithm for finding the prime number 1 and 100?

Neither 1 nor 100 are prime numbers. To be prime, a number must have exactly two factors; itself and 1. Neither 1 nor 100 fall into this category of numbers.

The number 1 is neither prime nor composite because it has only one factor; itself. If 1 were to be regarded as being prime, then the Fundamental Theorem of Arithmetic would not hold. That is; every whole number greater than one can be expressed uniquely (except for their order) as the product of prime numbers. But if 1 were prime then the uniqueness aspect would fail because n = 1*n = 1*1*n = 1*1*1*n and so on. 1 is therefore a special class of number that is neither prime or composite, we simply refer to it as a unit.

The number 100 is a composite number because it has many factors besides itself and one; 1, 2, 4, 5, 10, 20, 25, 50 and 100 are all factors of 100.

Any algorithm that regards either the unit 1 or the composite 100 as being a prime number is clearly not a valid algorithm.