Computer Programming

An editor is just a program in which you write and edit the program. The compiler is used to compile the program, i.e., convert the program to machine understandable code. A development environment often combines the both into an intelligent application called the IDE or Integrated Development Environment.

True, unless you start messing about with the stack pointer.

Classified information data must be handled and stored properly based on classification markings and handling caveats.

no, his invention was the 4004. many newer inventions have long superseded it, but it was the breakthrough that made the later inventions possible.

Very much like the Fairchild invention of the planar transistor was the breakthrough that made monolithic ICs possible, but ICs aren't just lots of planar transistors, they have other components as well as wiring on the one chip.

while(condition) {

dosomestuff();

}

for(i = 0; i < 10; i++) {

dosomestuff();

}

No, Main is not a daemon thread in Java. its a non daemon or user thread. Also any thread stem from Main will be non daemon because daemon is derived from parent Thread status.

1. Relational Model : Newer database model; Network Model - Older database model

2. The network model structures data as a tree of records with each record can have multiple parent and child records, forming a lattice structure.

The basic data structure of the relational model is the table, where information about a particular entity (say, an employee) is represented in columns and rows

3.The relational model has strong mathematical foundation with set theory and predicate logic. Network Model has no strong mathematical background.

4. Relational model is the most flexible of the database models. Network model is not very flexible.

5. Relational model has widespead use. Network model has limited use.

Both of them are pointers, but otherwise they are completely unrelated. The former points to the current position of the stack, the latter points to the current instruction of the program.

Programming, its first major application was UNIX.

to translate mnemonic operation codes to their machine language equivalents and assigning machine address to symbolic labels used by the programmer.

To program computers without having to memorize all of the numeric opcodes and other values used in machine code.

However assembly code is exactly as machine specific and tedious to program with as is machine code. The program has to be completely rewritten from scratch in another assembly language to port the program to a different computer.

High Level Languages were created to allow programming to be done in terms that people more easily understand and to simplify porting programs to different computers.

Use a sorting algorithm. There are a bewildering number of sorting algorithms, both stable and unstable. To sort numbers, an unstable sort suffices. The algorithm you use will depend on how many numbers need to be sorted (a small or a large set), however a hybrid algorithm (a combination of two or more algorithms) can cater for both. Introsort (unstable) and timsort (stable) are the two most common hybrid sorting algorithms.

A low-level programming language is one that has little to no abstraction between the source code and the machine code produced by the language translator. Machine code has no abstraction whatsoever and is the lowest possible level of coding (machine code is the native language of the machine). Assembly language has very little abstraction because each mnemonic either maps 1:1 with a specific machine operation code (opcode), or maps to one of several opcodes that only differ by the operand types and can be implied from those operands.

Given the lack of abstraction, low-level code is machine-dependent code and is therefore non-portable. That is, code is written specifically to suit the assembler and thus the machine it was intended to execute upon. Conversely, high-level code has a high-level of abstraction and is generally portable. That is, code is written to suit the language compiler or interpreter rather than underlying hardware. High-level languages generally provide a much more convenient method of producing low-level code that is much easier for humans to read, write and maintain, largely due to the high-level of abstraction these languages provide.

In all areas of program design and development.

#include<stdio.h>

#include<conio.h>

int main(void)

{

int a[10],i;//array declaration

clrscr();

printf("\n enter the elements of array");

for(i=0;i<10;i++)

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

printf("\n the elements you enter into the array");

for(i=0;i<10;i++)

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

getch();

return 0;

}

Function which uses other function as part of it programming is known as function interdependent

// asterisk pyramid

#include<iostream>

using namespace std;

int main()

{

int count = 0;

for (int width = 0; width <= 10; width++)

{

for (int alignLeft = width; alignLeft <= 15; alignLeft++)

{

cout << " ";

}

for (int space = 1; space < count; space++)

{

cout << "*";

}

cout << endl;

count += 2;

}

return 0;

}

No. Pseudocode is not used to write complete programs; rather, it is an overview of what you want to achieve. For example, the following pseudocode is for a program to print a list of square roots:

for i = 1 to 10

show i, i*i

A specific programming language may not have a "show" command, and the structure of the "for" loop might be different; additional setup and cleanup commands may also be required in a real computer program; the purpose of this pseudoce is merely to explain, to a human, what you want to achieve. The real code, with more detail, will have to be added later.

It was Ada Augusta (1815-52), the daughter of Lord Byron, who had become the Countess of Lovelace when she married. She studied mathematics enthusiastically under the famous Augustus de Morgan. Lady Lovelace learned how the Analytical Engine worked from an English translation of an Italian report by L.F. Menabrea of a talk about it given by Charles Babbage in Turin in 1840.

This question cannot be answered here. Go to amazon.com and find a book about chess-programming.

Many researches show that relationship between watching violence on TV and violent behavioral patterns is positively correlated. Can we statistically say from this information that viewing violence on television causes children to behave in a violent way?

A constant may refer to a literal constant, a constant variable.

A literal constant is a value that we use to initialise or assign to a variable, literally, such as:

int x {42}; // initialise

x = 0; // assign

Here, the values 42 and 0 are literal constants.

A constant variable is a variable which will not change value after initialisation:

const int x {42}; // initialise

x = 69; // error - cannot assign to a constant variable

Constant variables are useful when we wish to use the same constant value repeatedly within a scope. We could also use a literal constant rather than a constant variable, however naming our constants makes it easier to refer to the value consistently, particularly during code maintenance where we may wish to review the value. With a constant variable we need only change the initialiser, but with literal constants we must change every occurrence of the literal and that can lead to inconsistencies. Consider the following:

int x[100];

int y[100];

for (int i=0; i<100; ++i) { cout << x[i] << endl; }

// ...

for (int i=0; i<100; ++i) { cout << y[i] << endl; }

Here we've used the literal constant 100 four times. At a future time we may decide array x really needs 200 elements rather than 100, but we have to be careful which literals we change because array y makes use of that same literal constant. Using constant variables helps keep those usages separate:

const int xmax {100};

const int ymax {100};

int x[xmax]; int y[ymax]; for (int i=0; i<xmax; ++i) { cout << x[i] << endl; } // ...

for (int i=0; i<ymax; ++i) { cout << y[i] << endl; }

Now we can safely change the xmax initialiser without affecting any usage of the ymax constant:

const int xmax {200};

const int ymax {100};

int x[xmax];

int y[ymax];

for (int i=0; i<xmax; ++i) { cout << x[i] << endl; }

// ...

for (int i=0; i<ymax; ++i) { cout << y[i] << endl; }

Note that a constant variable cannot be initialised by a non-constant variable:

int x {42};

const int y {x}; // error - x is non-constant