C Programming

grep

Editing code is easy, they're simply plain text files you can edit with any text editor. However, you lose the syntax engine and all the external headers and libraries required by the code, not to mention the compiler and the linker that are required to actually build the code. Migrating code to another compiler is the only option if you don't have access to the original compiler.

By basic types you presumably mean primitive types or built-in types. These include char, int, long, short, wchar_t, float, double and bool, amongst others. Most are simply variations of each other, but their lengths are implementation dependant. The only exception is char which is always 1 byte in length.

User-defined types are those you yourself define or are defined for you. These include typedefs, enums, classes, structs and unions, but can also include some implementation-specific built-in types and all third-party types. Regardless, all user-defined types build upon the primitive data types or other user-defined types. In the case of class and struct types, methods (or member functions) can be associated with those types, thus combining data and the specific methods that act upon that data into a single entity. Objects are specific instances of a class or struct.

A derived type is a class (or struct) which inherits from another class (or struct). A derivative cannot inherit from a primitive, enum or union. Derived types are also, by definition, user-defined types.

If you are applying for this study grant, YOU should think what sets YOU apart, and write about it. It just doesn't make sense to gather, and list, a number of reasons that set OTHER people apart.

The name of the program should be saved as .pc

example:hello.pc

install the glomosim in your computer

move to nirmal@ubuntu:~/glomosim/glomosim-2.03/parsec/redhat-7.2/bin$

then use the following commands

1.nirmal@ubuntu:~/glomosim/glomosim-2.03/parsec/redhat-7.2/bin$pcc -lm -c hello.pc

2. nirmal@ubuntu:~/glomosim/glomosim-2.03/parsec/redhat-7.2/bin$pcc -user_main hello.o -lm -o hello

3. nirmal@ubuntu:~/glomosim/glomosim-2.03/parsec/redhat-7.2/bin$./hello

thats it then the output will be displayed as

Hello World

and followed by the time limits

That cannot be answered here; there are commercial packages to do this, which you can locate on the Internet.

'n' can be an identifier, '1' is a digit

an algorithm that is composed for creating music, investigating particular aspect of music, representing music in specific readable form (notation), deriving a new composition from the existing one, based on music theory and/or common practice

Not possible.

There are two AND operators in C, logical AND (&&) and bitwise AND (&).

The return type for logical AND is always bool, however logical AND only works when both operands can be implicitly cast to bool. The value 0 is always regarded as being false while all non-zero values are regarded as being true.

The return type for bitwise AND is that of the largest of its two operands. For instance, the return type of int & char is int (same as the l-value) while the return type of char & int is also int (same as the r-value).

if (condition) statement else statement;

It is a designing method, but has nothing to do with the C language.

No its a very useful technique of C programming

In top down stepwise refinement we start with a psuedocode (it is actually a puseudocode)

First the "Top"...is a single statement, in effect the complete representation of programme.

but cannot give all the details so we do some refinement

We do refinements in steps, like specifing variables and then again refine them by intializing them with specific or desired numbers or values.

So top down stepwise refinements make it easy for us to design a programme...we divide our program from top to down in segments and refine (or define) these segments.

what is the individual data item in a record

There has to be a key on your keyboard, between 'X' and 'V', marked with 'C'. Press it!

We use loops with arrays because it's one the simplest methods of traversing an array. since each element in an array is the same size, every element can be access via an offset from the start of the array, using the array suffix operator []. Arrays employ zero-based offsets because the first element is always at the same address as the array itself. Thus the first element is at offset [0], while the third is at offset [2]. What this means is that if we multiply the size of an element by its offset index, we can determine the address of that element and therefore access that element's value. The subscript operator does this for us automatically, thus giving us constant-time random access to any element in the array. We can also use pointers to manually calculate the address of an element (which is what actually goes on behind the scenes). However, when we wish to traverse the array, one element at a time, a loop is the simplest method of doing so. The loop simply iterates through all the offset indices, beginning with offset 0, then 1, and 2, and so on. The final index is always 1 less than the number of elements in the array, because arrays are zero-based.

tell me , how we create a username & password for many users in c language.

The FILE type is declared in stdio.h.

Question doesnt make sense. There are tens of database types availible. Each using one or two drivers.

High-level to binary is known as compilation or interpretation, depending on whether the entire program is converted at once (compilation) or only one statement at a time is converted (interpretation).

There is no conversion from binary to high level -- it's one-way only.

"real" numbers, in any programming language, are actually approximations of what is called a "real number" in math. Basically, a number that can handle decimals - but unlike the actual real numbers, of limited precision.

In Java, the "real" data types are float, and double. double has greater precision.

A "constant" in Java is similar to a variable, but its value can't be changed after it has been assigned a value.

#include<stdio.h>

#define TRUE 1

#define FALSE 0

int days_in_month[]={0,31,28,31,30,31,30,31,31,30,31,30,31};

char *months[]=

{

" ",

"\n\n\nJanuary",

"\n\n\nFebruary",

"\n\n\nMarch",

"\n\n\nApril",

"\n\n\nMay",

"\n\n\nJune",

"\n\n\nJuly",

"\n\n\nAugust",

"\n\n\nSeptember",

"\n\n\nOctober",

"\n\n\nNovember",

"\n\n\nDecember"

};

int inputyear(void)

{

int year;

printf("Please enter a year (example: 1999) : ");

scanf("%d", &year);

return year;

}

int determinedaycode(int year)

{

int daycode;

int d1, d2, d3;

d1 = (year - 1.)/ 4.0;

d2 = (year - 1.)/ 100.;

d3 = (year - 1.)/ 400.;

daycode = (year + d1 - d2 + d3) %7;

return daycode;

}

int determineleapyear(int year)

{

if(year% 4 FALSE)

{

days_in_month[2] = 29;

return TRUE;

}

else

{

days_in_month[2] = 28;

return FALSE;

}

}

void calendar(int year, int daycode)

{

int month, day;

for ( month = 1; month <= 12; month++ )

{

printf("%s", months[month]);

printf("\n\nSun Mon Tue Wed Thu Fri Sat\n" );

// Correct the position for the first date

for ( day = 1; day <= 1 + daycode * 5; day++ )

{

printf(" ");

}

// Print all the dates for one month

for ( day = 1; day <= days_in_month[month]; day++ )

{

printf("%2d", day );

// Is day before Sat? Else start next line Sun.

if ( ( day + daycode ) % 7 > 0 )

printf(" " );

else

printf("\n " );

}

// Set position for next month

daycode = ( daycode + days_in_month[month] ) % 7;

}

}

int main(void)

{

int year, daycode, leapyear;

year = inputyear();

daycode = determinedaycode(year);

determineleapyear(year);

calendar(year, daycode);

printf("\n");

}

Some bits of machine instruction code. Of course it is platform-dependent.

1-C2/2

1111 or 15 in decimal notation