Computer Programming

Purpose, audience, genre, and organization

the program written in high level language is called "source program"

Data hiding is one of the important aspects of a class. Data hiding means to hide the members of the class and providing the access to only some of them. we can make the members of the class private or public. in private,the outside world cannot access those members which been made private.and rest we can make public.only the public members are accessed by the out side world and all the private members can be accessed using only the public members.in this way a class provides security to its data members.

An algorithm is a stepwise sequence of operations that can be performed to solve a problem. The operations are expected to be 'simple', so they can be performed mechanically.

A simple example algorithm is "how to find the largest number in a list of numbers":
- look at the first number and write it down as the largest-so-far
- for each remaining number in the list:
- - replace largest-so-far with this number if this number is larger
- when you have compared all the numbers, largest-so-far is the largest number in the list

A less trivial algorithm is the one people learn in school for multiplying multi-digit numbers, called "long multiplication" or "grade-school multiplication". It becomes rather long if you write down all the steps (as you would need to for an algorithmic description), but it involves multiplying each digit in the first number with each digit in the second number and summing the partial results.
Here the simple operation is multiplying two single digits, which you are expected to know how to do, and by using the algorithm you can extend the knowledge of how to multiply single digits to multiply numbers with any number of digits.

See related links.

Multimedia is defined as the combination of different media elements such as text, pictures, sound and movie etc...

In interactive multimedia, the user or operator is able to interact with the computer directly. (Eg: computer games, interactive websites, multimedia presentations or interactive Cd's etc..)

Computers only understand machine code. Low-level Assembler language and all high-level languages must be assembled or compiled to machine code in order to execute. However, the computer itself can be programmed (with a machine-code program) to generate the required machine code from either a low-level or high-level input. Low-level Assembler is an almost one-to-one translation of symbols and mnemonics to machine code whereas high-level languages often compile to object code which is then linked to produce machine code.

Interpreted high-level languages are not compiled to machine code but are interpreted by another program, an interpreter, which translates each line of high-level code into the required machine code at runtime. Java, for instance, compiles to byte code suitable for the Java virtual machine. The JVM is a machine code program that interprets the byte code to produce machine-specific machine code. As a result of this interpretation, Java programs are much slower than machine-coded implementations of the same program.

cls

input "enter a string=";s$

l=len(s$)

for i = l to 1 step-1

c$=mid$(s$,i,l)

next i

r$=c$+r$

if r$=c$ then

print "no. is palindrome"

else

print "no. is not palindrome"

endif

end

The very first calculating "machine" was human hands and fingers.

The abacus was next in about 300 BC.

1.robust

2.correct

3.optimal

4.error free

5.reliable

the microprocessor, also called the processor or the central processing unit (CPU)

No, a thread can't create aprocess, because the environment of the thread is a part of a process which created this thread.

There is no single book that is best for programming. There are many programming languages and each will have one or more recommended books associated with it. For instance, C++ programmers will typically own "The C++ Programming Language" and "Programming: Principles and Practice Using C++", amongst many others. Programmers will also own text books related to more specific type of programming, such as multimedia/games programming, financial programming, scientific programming, and so on. In short, you cannot rely on just one book to teach you everything you need to know.

It is the source code on Unix Level 6.

short int

int

long int

double

float

char

these are all datatypes

There are many situations when writing a computer program that requires one to make use of libraries provided by other people. Suppose that you have created a program to do matrix multiplication, and one of your functions inside this program is called multMatrix(a, b). Now suppose you are using a library provided by someone else (not necessarily for matrices), and quite by coincidence their library also contains a function called multMatrix(a, b) -- thus both of these functions have exactly the same signature. Which one should be used? Old-school programmers and librarians used to go through a lot of effort to try and establish function names that would be unique -- however, this did not always solve the problem. The use of name-spaces provides an adequate mechanism for avoiding these "name clashes". Functions (or methods) are now grouped into namespaces, and we are assured (to a certain point) that namespaces should be unique (for example if you use the name of the company you are working for as a namespace), now even if two functions have the same signature they should be located within different namespaces, allowing you to avoid name-clashes.

A CLI (command line interface) is a user interface to a computer's operating system or an application in which the user responds to a visual prompt by typing in a command on a specified line...

No.

A bot can be written in a server-side language like php, asp, etc.

Queues are a first in first out structure (FIFO). This means all extractions occur at the head of the list and all insertions occur at the tail. This requires that you maintain pointers to the head and tail node to allow constant time insertion and extraction of nodes. The nodes themselves are singly linked, each pointing to the next node. The tail node always points to NULL until a new node is insert, which the tail points to. The new node then becomes the tail. When extracting a head node, its next node (which may be NULL if it is also the last node) becomes the new head of the list. If the head is NULL, the tail is also set to NULL.

http://powderurmonkey.com/forums/showthread.php?p=3#post3

Bubble sort is a stable, in-place sort with a best, worst and average case of O(n!) for n elements, thus making it highly inefficient and entirely unsuitable for sorting large amounts of data. For this reason bubblesort is often cited as an example of how not to write an algorithm.

The algorithm starts by accepting a zero-based array with n elements (0 to n-1). While n is greater than 1, the algorithm iterates an outer loop. On each iteration of the outer loop, an inner loop traverses from element index 1 to n-1. On each iteration of the inner loop, the element at the current index is compared with the element at the previous index. If they are out of order, the two elements are swapped. When the inner loop has finished, n is decremented. At this point element n is now its correct place and is ignored on the next iteration of the outer loop. When n is not greater than 1, all the elements are sorted and the outer loop terminates.

In other words, the algorithm locates the largest value in the range 0 to n-1 and places it at index n-1 (bubbling it up the list with each swap). After decrementing n, everything from element n up is sorted and everything below n is unsorted, thus creating two subarrays split at n. On each pass, the sorted subarray gains a new element and the unsorted subarray loses an element. When there is only one element in the unsorted subarray, the entire array is sorted.

The inefficiency of the algorithm is that it takes no account of elements at the end of the unsorted subarray that may already be in their correct position. The algorithm can be improved with the observation that the position of the last swap at the end of the inner loop means that everything from that point forwards is already sorted and don't need to be compared on the next pass. So rather than reducing the unsorted subarray by just one element, the subarray can be reduce by one or more elements. To achieve this we initialise a temporary variable with the value zero at the start of the outer loop, and whenever a swap occurs in the inner loop we assign the current index to the temporary variable. When the inner loop ends, the temporary variable indicates where the last swap occured and we can assign that value to n, which may reduce n by one or more elements on each pass. The only other change we need to make is that the outer loop now terminates when n is zero (the initial value of the temporary variable), which means no swaps occured on the last iteration of the inner loop, so everything must be sorted.

Even with this optimisation the worst case is still O(n!) if the list is completely reversed. However, for an already-sorted list the best case becomes O(n). Since these two extremes are isolated cases, the average case is somewhere in between, around O(n!/2), which is still highly inefficient and unsuitable for large amounts of data.

The following is an implemention of an optimal bubble sort in C++:

template<typename _Ty>

void bubble (std::vector<_Ty>& A)

{

unsigned size = A.size();

while (size)

{

unsigned temp = 0; // records last swap position

for (unsigned index=1; index<size; ++index)

{

if (A[index]<A[index-1])

{

std::swap (A[index],A[index-1]);

temp=index;

}

}

size = temp;

}

}

In stick RPG complete, get 500 intelligence, click on the car next to your house and click the key. press c to get in.