Computer Programming

Algorithm is deterministic if for a given input the output generated is same for a function. A mathematical function is deterministic. Hence the state is known at every step of the algorithm.Algorithm is non deterministic if there are more than one path the algorithm can take. Due to this, one cannot determine the next state of the machine running the algorithm. Example would be a random function.FYI,Non deterministic machines that can't solve problems in polynomial time are NP. Hence finding a solution to an NP problem is hard but verifying it can be done in polynomial time. Hope this helps.Pl correct me if I am wrong here.Thank you.Sharada

Machine language is all binary numbers, and will vary on different architectures. For example, on a 32 bit processor, instructions will come in the form of a sequence of 32 "1"s or "0"s, where maybe the first 5 tell the CPU which instruction is being performed (add, subtract, load memory into register, load register into memory, etc), if you are adding maybe the next 5 bits means register $eax, the next 5 bits could be register $ebx.

The actual instruction will look something like: 01101001011010001100110011001100

I'm not sure if it's "useful" as much as it is the fact of it being how the Java compiler works.

However, there's a GCC frontend for compiling Java to native machine code rather than bytecode.

I am a major Athlon fan, every computer I've every purchased on my own has ran athlon, or duron, thunderbird, or anything but Intel. That is my personal opinion, i have used Intel in the past, and i am very unsatisfied, especially with Dell. Like right now i have a AMD Athlon 64 Processor 3200+, 2.01 GHz, L1: 64KB L2: 512KB, and i love it, wouldn't use anything else. Remember this is only my personal opinion.. good luck :)

14 decimal in binary is 11102. In octal it is 168 and in hexadecimal it is 0E16.

Encapsulation,Inheritance and Polimorphisim...

1. High accuracy. Comparing to Basic Incremental algorithm (especially if the slope were > 1.) 2. High speed. Comparing to Digital Differenmtial algorithm. 3. Draws the line between any two points. Comparing to Basic Incremental algorithm which can't draw if x0 > x1 ( the format is: (x0, y0), (x1, y1). )

Humans do not write programs using computer language (machine code) we use symbolic programming languages. This wasn't always the case, of course, but humans were speaking "human language" long before we learned to program computers. Without that simple ability we wouldn't be able to communicate with each other let alone invent a programmable machine.

With a compiler, which is a program that "knows" how to transform the programming language logic in to machine code and make it perform from that.

Circular queue have less memory consuption as compared to linear queue because while doing insertion after deletion operation it allocate an extra space the first remaining vacant but in circular queue the first is used as it comes immediate after the last.

no it can also understand person langugage

pretty tricky huh

lol

Think about what each concept means.

A FIFO (First In, First Out) stack is like a supermarket queue - people are served in the order in which they arrive in line. You'd use a FIFO stack for a process that requires sequential access to data in arrival order, such as transaction processing.

On the other hand, a LIFO (Last In, First Out) stack is like an elevator - the people who board last are nearest the front, so they're the first off in "processing" order. You might use a LIFO stack for something like expression parsing. For example, if you're trying to match up parens, you need to use the "nearest match" rule. That means if you have already stacked two "("s you'd want to pair the most recently-scanned one with the first closing ")" encountered and evaluate the enclosed expression. That means the ")" would pair off with the "(" at the top of your paren stack rather than the bottom; i.e. LIFO.

2 MB

1024 byte = 1 KB
1024 KB = 1 MB
1024 MB = 1 GB
1024 GB = 1 TB

and so on...

#include<stdio.h>

#include<conio.h>

void main()

{

int a[10],i,j,k,n;

printf("enter number of elements of array");

scanf("%d",n);

printf("Enter array elements");

for(i=1;i<=n;i++)

{

scanf("%d",a[i]);

}

printf("enter the element you want to delete");

scanf("%d",k);

for(j=0;j<n;j++)

{

if(a[j]==k)

{

a[j]=a[j+1];

n=n-1;

}

}

printf("The array after deletion of %d is:",k);

for(i=1;i<n;i++)

{

printf("%d",a[i]);

}

getch();

}

# Ruby code

print 'Enter n: '; n = gets.to_i

n.times { | i |

puts ( i + 1 ) ** 2 if ( i + 1 ) % 3.0 == 0.0

}

This triangle is called a scalene triangle.

various area of application in computer application in business

the docotors and the facial expert called cynthia rowland

First of all, the terminology is incorrect. There are web based applications and "computer" based applications, the latter of which operate from the computer, not from a browser.

These two are significantly different. The rudimentary difference comes from where the programs are run from. Web-based programs are run through a web browser or an equivalent program. Computer-based applications are run through the OS(Operating System), (Windows, Linux, or Mac OS X).

Each of these programs has their own pro's and con's. Web-based applications are nice because the user does not have to download or install anything before using them. They are able to be used from the browser. This also means that they can be used from many different computers while accessing the same program. For example, Google Docs is a web-based Office suite that a person could access from any computer and work with their files. On the flip side, web-based applications can be slow to load, or if the server goes down the user could be out of luck.

OS based applications can be good. They are run straight from the OS, which generally improves the speed at which they run. However, they can only be accessed from that particular computer, which could be an issue if something happens to the computer.

IF, in C and C++, is not a function - it is a statement. There are two parameters...

if (expression) statement;

The expression is evaluated. If it has logical result true, or arithmentic result not zero, the statement is executed; if not, the statement is not executed. The statement can be a single statement, in which it is terminated with a semi-colon, or it can be a block of statements, in which it is surrounded by braces.

Copyright protection is intended to provide protection against theft of intellectual property. Free and Open Source Software (FOSS) generally specifies that the source code must be distributed with any binary build and that the full original license must remain affixed to the source code. In this case, it means that the author is asking that others do not plagiarize the work or claim it as one's own.

It also generally specifies that the code may only be used for certain purposes, such as non-commercial use. Some projects are dual-licensed with a commerical license for reselling/incorporation into commercial applications. Violations of any of the terms in the license may constitute a violation of copyright protection, and infringements may be prosecuted. This is still relatively new and mostly untried in the area of law, and few courts have had any cases involving FOSS copyright infringements.

A few recent cases have suggested that courts are willing to entertain at least GPLv2-type licenses, and possibly others. Damages have apparently been awarded in at least one case regarding GPLv2 infringements. In other words, FOSS is quickly gaining legal status as a viable copyright protection license. It is therefore important to read the license of any software one intends to modify and/or redistribute to ensure that they are not in violation and risking infringement lawsuits.

Computer applications make it easier for employees to carry out the functions of their jobs. With software, the business can input data quicker instead of creating templates each time.