C Programming

the equation that convert from cartesian to polar coordinates and vice versa

r = sqrt (x*x+y*y);

phi = atan2 (y, x);

x = r*cos (phi);

y = r*sin (phi);

Array is always faster to read from disk/access any element in the array is quicker since elements in a array are stored in contiguous location in the memory, you need the pointer to the head or 0th element in the array and then it much quick to navigate to the next on index based. But you need to know INDEX of the element for best results

List (say linked list) will be slower since not always elements are stored in contiguous location in the memory as well it involves a function call which is can be assembler/cpu expensive.

However getting an individual object from an array is faster if you know the index of the object. Walking through a linked list is faster than walking through an array, if you use a non-recursive algorithm.

--Vinay Solanki

from the abstraction: list

you go to the implementation details (concrete):

arraylist,vector or linkedlist,circularlinkedlist and maybe more

when somebody asks you for a special list in this case (queue)

speciality 1 enqueue -add to botton

speciality 2 dequeue - remove from top

you are free to pick up arraylist,and/or linkedlist and/or circularlists and/or vector to implement your new specialized list called queue.

and/or means you might want to combine as well

Used in carbon dating that is to find the age of fossils.

If you are talking "far pointer", then you are probably talking about real mode in a 16 bit environment such as DOS or Windows 3.1, or in Virtual 8086 mode in Windows 95 or higher. In this mode, addressing is segmented into 65536 segments of 65536 bytes each, but each segment overlaps the next by only a 16 byte offset. This gives you addressability to 1048576 bytes. A far pointer is a 32 bit object, containing a 16 bit segment and a 16 bit offset. int __far *p; /* a far pointer called p which points to an int */

No such predefined type, so you can define it as you wish.

#include<iostream.h>

#include<conio.h>

void main()

{

int a, b, c;

clrscr();

cout<<"enter the two numbers";

cin>>a;

cin>b;

c=a+b;

cout<<"Addition of two numbers="<<c;

getch();

}

Data structure is a very basic concept.

I don't think it's possible to trace it back to a single person who invented it...

A data type tends to mean a primitive data type. Primitive data are built-in data types, such as integers, characters and Booleans. They are basic constructs of the language (that is, they are built into the language).

Primitive data also tends to be of a strict data type, meaning you can't treat characters like integers or Booleans like integers, etc., although some languages will support implicit casting of primitive data types (for example, will treat Booleans like integers if you use a Boolean in an arithmetic operation).

Abstract data types are generally constructed by the user or by a higher level language. For example, you might create a currency data type, which generally acts like a float but always has a precision of 2 decimal places and implements special rules about how to round off fractions of a cent.

Abstract data types also often contain the ability to either be treated as a specific type of primitive data in certain circumstances (for example, many languages allow you to treat strings as character arrays); or contain certain rules / methods to manipulate their data (such as a programming language allowing you to cast a float as an integer).

A data structure is a gathering together of many different data types. For example, objects and arrays are data structures. Data structures usually can contain information of many different types (such as strings, integers, Booleans) at the same time, and in more complex structures -- namely, classes -- can contain specific methods, properties and events to manipulate that data, change its type, etc.

yes

In Java:

int[] myArray;
// or: int myArray[]

followed by:

myArray = new int[16];

Instead of int, you can use any other data type, including a class.

Very little. C is a very common language to write operating systems in.

#include<stdio.h>

#include<conio.h>

#include<string.h>

#include<process.h>

char a[20],b[50],c[50],ch;

int i=0,n;

void sender();

void receiver();

void main()

{

clrscr();

sender();

receiver();

getch();

}

void sender()

{

int j=0,pos;

printf("\n\n Sender side \n\n");

printf("Enter string : ");

scanf("%s",&a);

n=strlen(a);

printf("\n Enter position : ");

scanf("%d",&pos);

label: if(pos>n)

{

printf("\n Invalid position, Enter again : ");

scanf("%d",&pos);

goto label;

}

printf("\n Enter the character : ");

ch=getche();

b[0]='d';

b[1]='l';

b[2]='e';

b[3]='s';

b[4]='t';

b[5]='x';

j=6;

while(i<n)

{

if(i==pos-1)

{

b[j]='d';

b[j+1]='l';

b[j+2]='e';

b[j+3]=ch;

b[j+4]='d';

b[j+5]='l';

b[j+6]='e';

j=j+7;

}

if(a[i]=='d' && a[i+1]=='l' && a[i+2]=='e')

{

b[j]='d';

b[j+1]='l';

b[j+2]='e';

j=j+3;

}

b[j]=a[i];

i++;

j++;

}

b[j]='d';

b[j+1]='l';

b[j+2]='e';

b[j+3]='e';

b[j+4]='t';

b[j+5]='x';

b[j+6]='\0';

printf("\nframe after stuffing : %s" ,b);

}

void receiver()

{

int j=6;

printf("\n\n\n\n Receiver side\n\n");

printf("\nThe data came from sender side is : %s",b);

n=strlen(b);

while(j<n-6)

{

if(b[j]=='d' && b[j+1]=='l' && b[j+2]=='e')

{

if(b[j+3]=='d' && b[j+4]=='l' && b[j+5]=='e')

{

c[i]=b[j+3];

c[i+1]=b[j+4];

c[i+2]=b[j+5];

i = i+3;

j = j+6;

}

else if(b[j+4]=='d' && b[j+5]=='l' && b[j+6]=='e')

{

j = j+7;

}

}

else

{

c[i]=b[j];

i++;

j++;

}

}

printf("\n\nOriginal data : %s",c);

}

That depends on who you ask and how far back you go. It could be Intel, it could be whoever designed the ENAIC (used for looking up trajectory tables) but I think it was Charles Babbage, inventor of the 'analytical machine.'

More:

http://en.wikipedia.org/wiki/Turing_complete

You don't need to write a program to do this. Each character (char) is actually an int. If you want to see the ASCII value of a char you can simply:

char c = 'a';

System.out.print( (int)c );

Quicksort will usually be the best performing sort. However, quicksort has a worst-case time complexity of O(n2), which may not be reasonable in a real world application. Heapsort is often used in place of quicksort in these cases, as it has a worst-case of O(n log n).

The last of the "big three" sorts is mergesort, which excels in a few areas. Mergesort is trivially easy to parallelize, which is increasingly useful as multi-CPU machines become more and more common. Mergesort is also a stable sort, which may or may not be useful for a given application.

#include <stdio.h>

int main(void){

// Local Declerations

int intNum;

int midDigit;

// Statements

printf("Enter a 5 digit integral number: ");

scanf("%d", &intNum);

//the assignment expression below is used to calculate the mid digit

oneDigit = (intNum % 1000) / 100;

printf("\nThe middle digit is: %d", oneDigit);

return 0;

}

The three types of master data discussed are reference data and enterprise data. Lastly, there is also market master data.

scanf: scanf is a built-in function to read input from the user.