C Programming

Yes. Without prototypes you must ensure all definitions are declared forward of their usage. This isn't always possible. Separating the prototypes from the definitions means you can #include the prototypes forward of their usage, and place the actual definitions anywhere you like.

whatever the variables we declare in function signature to receive the arguments at the calling that are known as parameters..

e.g.

int sum(int a,int b);

here a & b are known as parameters.....

Yes.

You can't convert the data type of any variable.

#include<stdio.h> void main() {int k=10; prinft("%d,"&k"); }

c means circa, which means it is an estimate.

A NULL pointer has the same size as a non NULL pointer. NULL means that the pointer has been set to the NULL value that is usually zero (0) but the NULL value is at the digression of the compiler manufacture (and may have a value other than zero) so a pointer should always be set to the NULL value and not zero.

Current compilers (32 and 64 bit, Intel chip) have a pointer size of 4 (8 bit) bytes.

It should be noted that the number of bits in any data type is at the compiler manufactures digression but is heavily influenced by the computer hardware.

void *p= NULL;

printf ("%d\n", sizeof (p));

or

printf ("%d\n", sizeof (void *));

Just as you have started it.

good examples:

'string'

"string"

`string`

»string«

bad examples:

'string"

"string`

»string'

sorted

The only advantage is that it is free. But it is disadvantaged by the fact it only supports Windows 95, 98, NT and 2000. Thus it is not compliant with the current C++ standard, and is only useful for legacy development upon these Windows platforms.

Carefully.

u(t)-u(-t)=sgn(t)

1.take while loop in which u continue up to null in array of string.

2.once u get null pointer then take a new array of same length.

3.when u get null there ll save position no in variable i.

4.take while loop i to 0;

5.and j=0 for new array.

6.in above loop copy old array to new array in each cycle of loop.

7.j++;

8.u ll get reverse of string.

write the javascript code to display the reverse no. of given no. (e.g. 247 reverse of 742)

long float myfun();

#include<stdio.h>

main()

{ char ch;

clrscr();

gotoxy(5,3); printf("*Identification of Consonant and Vowel letter*");

gotoxy(5,5); printf("*Please input a letter from A-Z in order to determine");

gotoxy(5,6); printf("if it is a CONSONANT or a VOWEL*");

gotoxy(5,8); printf("Enter a Letter: "); scanf("%c",&ch);

gotoxy(5,10); printf("Letter %c is a ",ch);

switch(ch)

{ case 'A':

case 'a':

case 'E':

case 'e':

case 'I':

case 'i':

case 'O':

case 'o':

case 'U':

case 'u': printf("VOWEL."); break;

default: gotoxy(5,10); printf("Letter %c is a CONSONANT.",ch); }

gotoxy(5,15); printf("Thanks you for trying this!"); getch();

}

Dynamic memory allocation

You can put as many conditional tests as you want in the while loop conditional location.

As a rule, however, it is a better idea to simplify the conditions as much as possible so that the reader of the code has a better understanding of what is being accomplished.

Once you start putting multiple conditions in a while loop with ANDs and ORs together, the logic can get complex and not well understood.

int main (void)

or

int main(int a, char **p)

a condtional statement may be true or false but only in one direction

a biconditional statement is true in both directions

Compilers ensured that there was no conflict between the Hadith and the teachings of the

Qur'an, i.e. both the Qur'an and Hadith were in conformity and taught the same lessons. It

could be added that they compared the body (matn) of the Hadith with reason, the Qur'an

and other Hadiths to ensure that they agreed with the primary Islamic teaching. Answers

could be further elaborated to state that they ensured the chain of transmitters (isnad) was

unbroken and that the transmitter was a person of sound mind, good memory and upright

character. Examples of collectors going about their work could be given to answer

%hd

ANSWER A hash table is a way to find data in an array, when you have a known key and an unknown value that corresponds to the key. You use a hashing function on the key to create an index into the hash table containing the value. In the ideal case, this directly returns the corresponding value. In the usual case, a collision can occur. This means that the hashed key points to multiple possible values. A hash table is usually used on large arrays that would take a long time to search using other methods. A hash table can be very fast and use very little memory, and does not require the array to be sorted. The source code is slightly more complicated than some search methods. With a poorly designed hashing function when the hashed keys do not correspond one-to-one with the values, the secondary search after a hash collision can take a large amount of time.

yes at the moment he is.