Computer Programming

Bill Gates made Microsoft in 1970 after getting out of Harvard University. He made it with Paul Allen. There is a team who made it with him. Those people are : Steve Wood , Bob Wallace, Jim Lane, Bob O'Rear, Bob Greenberg, Marc McDonald, Gordon Letwin, Andrea Lewis, Marla Wood. Bill Gates and Paul Allen is one of them.

look man that would take alot >>>

Ill give you the way

===============================================================================

this answer i write it now on net !

i read about that befor in it uni where i study

i will chick out the answer and re write it

best wishes

2024

You can swap values a and b without a temporary as follows:

a=a^b

b=a^b

a=a^b

(^ is the bitwise XOR operator)

To show how this works, let's consider the values a=180 and b=204. In binary, 180 is 10110100 while 204 is 11001100. Thus:

a = 10110100

b = 11001100

a^b means that we look at the corresponding bits in each input value and output a 1 if one and only one of the two input bits is set. Thus the output (o) is:

a = 10110100

b = 11001100

o = 01111000

In the expression a=a^b, the output of a^b is assigned to a, thus the values of a and b now look like this:

a = 01111000

b = 11001100

We then repeat the operation, a^b, this time assigning the output to b:

a = 01111000

b = 11001100

o = 10110100

So now we have:

a = 01111000

b = 10110100

We repeat the operation one more time, assigning the output value to a:

a = 01111000

b = 10110100

0 = 11001100

So now we have:

a = 11001100

b = 10110100

The two values have now been swapped.

To write this in C, we can use shorthand expressions using the compound XOR-ASSIGN operator (^=):

a^=b

b^=a

a^=b

These individual expressions can then be combined into a single expression:

a^=b^=a^=b

Finally, to use this expression in a C function, we need to pass a and b by reference (using pointer variables):

void swap (int* a, int* b) {

(*a)^=(*b)^=(*a)^=(*b);

}

Note that a and b must be of an integral type (char, short, long, int, unsigned, etc). The example above only works on type int. If we wish to swap other types, or more complex types, we must treat those values as if they were an integral type. One way to achieve this is to treat those types as if they were an array of type char, supplying the length of the arrays through a separate argument:

void swap (char* a, char* b, size_t size) {

for (int i=0; i<size; ++i) {

a[i]^=b[i]^=a[i]^=b[i];

}

}

For example, to swap two doubles, we can use the following call:

int main (void) {

double a, b;

a = 3.14;

b = 1.1;

swap ((char*) &a, (char*) &b, sizeof (double));

assert (a==1.1);

assert (b==3.14);

return 0;

}

Note that a and b must of the same type.

Machine language is a first generation language.

A way of writing computer programs that are human readable (and understandable to programmers).

array,linklist,queue,stack,tree,graph etc...

A 32-bit system has a maximum 2^32 unique memory addresses, which is 4,294,967,296 addresses in total. Each address refers to a byte (the smallest unit of storage), thus this allows a maximum address space of 4 gigabytes. Each additional bit doubles the number of available addresses, thus a 64-bit system supports a maximum of 18,446,744,073,709,551,616 bytes, which is more memory than exists on the planet. Note that the length of a byte is system-defined.

The mouse uses infrared light to pick up signals of movement from the mouse and transfer them to movement on the screen. It is much more accurate and can be faster than the response on a standard ball mouse. If you pick up the mouse and it has a red light shining from the bottom it is an infrared mouse.

write an algorithm to compute the weekly average rainfall given the daily rainfall for four weeks

Mapped network drive. In Windows networks, an external resource has the form "\\MyServer\MyFolder\MySubFolder\MyFile.doc". The folder part, "\\MyServer\MyFolder\MySubFolder", can be assigned ("mapped") to a drive letter, for example, "M:"; in that case, you refer to the document as "M:\MyFile.doc".

Mapped network drive. In Windows networks, an external resource has the form "\\MyServer\MyFolder\MySubFolder\MyFile.doc". The folder part, "\\MyServer\MyFolder\MySubFolder", can be assigned ("mapped") to a drive letter, for example, "M:"; in that case, you refer to the document as "M:\MyFile.doc".

Mapped network drive. In Windows networks, an external resource has the form "\\MyServer\MyFolder\MySubFolder\MyFile.doc". The folder part, "\\MyServer\MyFolder\MySubFolder", can be assigned ("mapped") to a drive letter, for example, "M:"; in that case, you refer to the document as "M:\MyFile.doc".

Mapped network drive. In Windows networks, an external resource has the form "\\MyServer\MyFolder\MySubFolder\MyFile.doc". The folder part, "\\MyServer\MyFolder\MySubFolder", can be assigned ("mapped") to a drive letter, for example, "M:"; in that case, you refer to the document as "M:\MyFile.doc".

Yes, assembly language is definitely still used. Many I/O drivers and much of the bootstrap code that starts a computer must be written in assembly language as high level languages do not provide means for coding certain special purpose instructions needed for these operations. Also high level languages usually require that subroutine library codes be available, while assembly language does not. As these subroutine library codes usually cannot be loaded until the Operating System is up and running, assembly language must be used for much of the code that bootstraps the computer and loads the Operating System.

Solve simple intress usin fortran

the major limitation of binary search is that there is a need of sorted array to perform binary search operation.

if array is not sorted the output is either not correct or may be after a long number of steps and according to data structure the output should come in minimum number of steps.

Yes you can mix the ram, but the ram will default to the slowest of the set and only run at the slower speed.

A structure oriented language is one, which should the following structure as Documentation Section, Link section, Definition Section, Global declaration section and Functions(including Main functions) in an hierarchical order. This order cannot be interchanged, but structure oriented language like C can have these sections as optional. Correct me if am wrong, Neela.T

There are many types of format specifier.

Exp:%d (To show the integer)

%c(To show the character)

%f(Float are digits with decimal points to use it to show them)

%s(String to show the string)

They are not as they both have the same features it just provides a better understanding when using one diagram in conjunction with the other.

State machine diagram shows how state of some object or system could change, so transitions on the diagram are from one state to another state.

Activity diagram shows set of actions and how one action could lead to another.

In simple cases these diagrams might look like reverse of each other but in practice you need to select whether the diagram is about discrete number of states of some object or is it about organization of actions and activities possibly related to many different objects.

1801. Joseph Marie Jacquard's mechanical loom took input in the form of punch cards laced together to form a chain and produced an output in the form of woven cloth. By any definition, Jacquard's "machine code" was arguably the first programming language as we know it today. Whether we regard a loom as being a computer or not is immaterial when discussing programming languages.

1833. Charles Babbage's Analytical Engine used a similar principal (punch cards) and although the device was never built, the design included the machine code necessary to program it. There was an attempt to fund construction of a working model in 2010 which failed to materialise. However, in 1991, another of his designs, Difference Engine No. 2 which evolved from his work on the earlier Difference Engine and Analytical Engine, was built and proved his designs were sound. Babbage is posthumously known as the "father of the computer" and it can easily be argued that his "machine code" was the first computer programming language.

Of course we had analog computers long before Babbage. A slide-rule is a typical example. They were programmable in a sense, but whether we can call them programming languages is debatable.

answer is

0 10000011 00111000000000000000000

to get it first we have to convert 19.5 to binary

19 ->10011 ( 1* 2^4+1*2^3+1*2^2+1*2^1+1*2^0)

0.5-> 0.1 (2^-1=0.5)

10011+0.1=10011.1

The next step is to normalize this number so that only one non zero decimal place is in the number. To do this you must shift the decimal place4 positions to the left. The number4 becomes important so we note it. This process leaves us with the number 1.00111 which is the fraction that is represented in the last 23 bit places in the 32 bit binary. This is then padded with 0's to fill in the full 23 bits - leaving us with 00111000000000000000000.

so now we have first digit as 0 because this z a positive no and the last 23 digits.

We must now derive the middle 8 bits. To do this we take our exponent (4) and add 127 (the maximum number you can express with 8 bits (2^8-1 or the numbers 0 to 127)) which gives us 131. We then express this number as an 8 bit binary. This is 10000011 (or 1*2^7 + 1*2^1+ 1*2^0 or 128+2+1). Now we have the middle bits.

Taken as a whole our bit sequence will be:

0 10000011 00111000000000000000000

Yes, Python is strongly-typed.

You can test if any language is strongly-typed with a very simple example:

x = 1

y = "2"

z = x + y

The above will not compile in a strongly typed language because y is a string, not a number. That is, the language will not implicitly convert y to a number simply because you used it in a numeric expression. A weakly-linked language will perform the conversion behind the scenes.

Note that some strongly typed languages will permit the following:

value = 1

value = "one"

This is an example of dynamic typing; the same variable has explicitly changed type. This is not possible with statically typed languages. However, dynamic typing does not imply weak typing. Dynamic typing is explicit, weak typing is not.

The lexical analyzer function, named after rule declarations, recognizes tokens from the input stream and returns them to the parser.

The whole idea of Java - or one of the ideas, at any rate - is that it can be run anywhere. So, instead of compiling for a specific processor, the Java compiler compiles for a "generic processor", called the Java Virtual Machine. The code thus generated is called "bytecode". It can be interpreted (i.e., run) by a Java Virtual machine, these are available on different platforms.

The whole idea of Java - or one of the ideas, at any rate - is that it can be run anywhere. So, instead of compiling for a specific processor, the Java compiler compiles for a "generic processor", called the Java Virtual Machine. The code thus generated is called "bytecode". It can be interpreted (i.e., run) by a Java Virtual machine, these are available on different platforms.

The whole idea of Java - or one of the ideas, at any rate - is that it can be run anywhere. So, instead of compiling for a specific processor, the Java compiler compiles for a "generic processor", called the Java Virtual Machine. The code thus generated is called "bytecode". It can be interpreted (i.e., run) by a Java Virtual machine, these are available on different platforms.

The whole idea of Java - or one of the ideas, at any rate - is that it can be run anywhere. So, instead of compiling for a specific processor, the Java compiler compiles for a "generic processor", called the Java Virtual Machine. The code thus generated is called "bytecode". It can be interpreted (i.e., run) by a Java Virtual machine, these are available on different platforms.

You get two or three different steroids and rotate what days you take them. For example you might take 1CC of Winstrol on Tuesday and Thursday and take 1CC of Deca on sunday. When you stack it just means you are doing more than one cycle at a time.