ADVANCED 'c'

Malloc Implementation

2011-09-09T09:30:00.000-07:00

Below is a program enter any integer either positive, negative or zero upto so many times you want and when you've to stop then enter 01.
The program will count number of positive,negative and zeros among the numbers you've given in your program.

#include "stdio.h"
#include "stdlib.h "
main() {
int p=0,q=0,z=0,pt;

while(1) {
printf("note : press 01 to exit \n Enter any number : ");
pt=(int)malloc(12);
scanf("%d",pt);
if(pt==01)
break;
if(pt > 0)
p++;
if(pt < 0)
q++;
if(*pt==0)
z++;
}
printf("you have entered \n positive = %d , negative = %d , zeros = %d",p,q,z);
}

Compile online RUN offline!

2011-09-09T09:23:00.000-07:00

http://www.onlinecompiler.net/

This is the C/C++ Online Compiler.
In online compilers (.net) you can find and use online many compilers ( GCC, MINGW, GFORTRAN, JAVA, GPC, FREEBASIC) for the mainstream languages that exist, you can search THE LINUX MANUAL (DEV MAN) PAGES, the JAVA & WIN32 API'S. Also, i have gathered some material to get you started with programming.

Now you are able to run graphics code in c whether you r on windows 7 from this website just copy and paste your code to this website then you got a exe file n you're done enjoy : )

Any Base to Any Base conversion in C

2011-09-07T10:45:00.000-07:00

This program is able to convert any base from any base you want and the most interesting feature is that it can convert numbers which have fractional part too.
No program on the Internet till date can provide you such features.
Below is a link which will get you to the source code download page of this program.
Just download it and then copy that named conversi.c file to the tc\bin\ folder and open your IDE and goto open and type there conversi.c and after that just press ctrl+F9 to run.
output :
Enter a number 43.25

Enter its base 6
Enter the base to be converted : 4
Decimal value = 27
Converted value 123
converted value with fractional part 123.1

conversi.c http://www.4shared.com/file/oY5-zj_k/conversi.html
or download the exe file conversi.exe

r u unable to understand this program??????????TRY THESE

1. Email us at chelperr@gmail.com

2. Post your question in the comment box.

3. You can give us your email ID also.

4. If you want to ask a program/topic or wanted introduce any discussion topic then just email at chelperr@gmail.com or drop a comment in the comment box.

Finding a number is even or odd without using arithmatic operators

2011-08-28T13:54:00.000-07:00

#include < stdio.h >
main()
{
    int i,j;   /*int type variables*/
    scanf("%d",&i);/*read i value*/
    j=i&1;    /*perform logical AND operation */
    if(j==0)
        printf("even");
    else
        printf("odd");

}

Math is Fun Games

I AM AN IDIOT.

2011-08-20T12:37:00.000-07:00

#include "stdio.h"
#include "conio.h"
void main()
{char ch[]="I AM AN IDIOT.";
char c='A';
int i=0;
while(c)
{
c=getch();
printf("%c\a",ch[i]);
i++;

if(i==14)
{printf(" "); i=0;

}
}
}

Quick sort in C

2011-08-18T12:33:00.000-07:00

#define maxsize 6

int A[maxsize];

void quicksort(int a, int b)

{

int rtidx=0,ltidx=0,k=a,l=0,pivot;

int leftarr[maxsize],rtarr[maxsize];

pivot=A[a];

if(a==b)return;

while(k

{

++k;

if(A[k]

{

leftarr[ltidx]=A[k];

ltidx++;

}

else

{

rtarr[rtidx]=A[k];

rtidx++;

}

}

k=a;

for(l=0;l

A[k++]=pivot;

for(l=0;l

if(ltidx>0)quicksort(a,a+ltidx-1);

if(rtidx>0)quicksort(b-rtidx+1,b);

}

void printarr(int a)

{

int i;

for(i=0;i

{

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

printf("\n");

}

}

main()

{

int i,s;

printf("enter the number of numbers to be entered \n");

scanf("%d",&s);

for(i=0;i

{

printf("enter the number \n" );

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

}

printf("array before sorting ");

printarr(s);

quicksort(0,s-1);

printf("array after sorting");

printarr(s);

}

OUTPUT : -

enter the number of numbers to be entered

enter the number

-5

enter the number

-1

enter the number

array before sorting 8

-5

-1

array after sorting -5

-1

r u unable to understand this program??????????TRY THESE

1. Email us at chelperr@gmail.com

2. Post your question in the comment box.

3. You can give us your email ID also.

4. If you want to ask a program/topic or wanted introduce any discussion topic then just email at chelperr@gmail.com or drop a comment in the comment box.

const and volatile in C

2011-08-18T10:48:00.000-07:00

Const and volatile

These are new in Standard C, although the idea of const has been borrowed from C++. Let us get one thing straight: the concepts of const and volatile are completely independent. A common misconception is to imagine that somehow const is the opposite of volatile and vice versa. They are unrelated and you should remember the fact.
Since const declarations are the simpler, we'll look at them first, but only after we have seen where both of these type qualifiers may be used. The complete list of relevant keywords is

char      long      float     volatile
short     signed    double    void
int       unsigned  const

In that list, const and volatile are type qualifiers, the rest are type specifiers. Various combinations of type specifiers are permitted:

char, signed char, unsigned char
int, signed int, unsigned int
short int, signed short int, unsigned short int
long int, signed long int, unsigned long int
float
double
long double

A few points should be noted. All declarations to do with an int will be signed anyway, so signed is redundant in that context. If any other type specifier or qualifier is present, then the int part may be dropped, as that is the default.
The keywords const and volatile can be applied to any declaration, including those of structures, unions, enumerated types or typedef names. Applying them to a declaration is called qualifying the declaration—that's why const and volatile are called type qualifiers, rather than type specifiers. Here are a few representative examples:

volatile i;
volatile int j;
const long q;
const volatile unsigned long int rt_clk;
struct{
        const long int li;
        signed char sc;
}volatile vs;

Don't be put off; some of them are deliberately complicated: what they mean will be explained later. Remember that they could also be further complicated by introducing storage class specifications as well! In fact, the truly spectacular

extern const volatile unsigned long int rt_clk;

is a strong possibility in some real-time operating system kernels.

Const

Let's look at what is meant when const is used. It's really quite simple: const means that something is not modifiable, so a data object that is declared with const as a part of its type specification must not be assigned to in any way during the run of a program. It is very likely that the definition of the object will contain an initializer (otherwise, since you can't assign to it, how would it ever get a value?), but this is not always the case. For example, if you were accessing a hardware port at a fixed memory address and promised only to read from it, then it would be declared to be const but not initialized.
Taking the address of a data object of a type which isn't const and putting it into a pointer to the const-qualified version of the same type is both safe and explicitly permitted; you will be able to use the pointer to inspect the object, but not modify it. Putting the address of a const type into a pointer to the unqualified type is much more dangerous and consequently prohibited (although you can get around this by using a cast). Here is an example:

#include 
#include 

main(){
        int i;
        const int ci = 123;

        /* declare a pointer to a const.. */
        const int *cpi;

        /* ordinary pointer to a non-const */
        int *ncpi;

        cpi = &ci;
        ncpi = &i;

        /*
         * this is allowed
         */
        cpi = ncpi;

        /*
         * this needs a cast
         * because it is usually a big mistake,
         * see what it permits below.
         */
        ncpi = (int *)cpi;

        /*
         * now to get undefined behaviour...
         * modify a const through a pointer
         */
        *ncpi = 0;

        exit(EXIT_SUCCESS);
}

Example

As the example shows, it is possible to take the address of a constant object, generate a pointer to a non-constant, then use the new pointer. This is an error in your program and results in undefined behaviour.
The main intention of introducing const objects was to allow them to be put into read-only store, and to permit compilers to do extra consistency checking in a program. Unless you defeat the intent by doing naughty things with pointers, a compiler is able to check that const objects are not modified explicitly by the user.
An interesting extra feature pops up now. What does this mean?

char c;
char *const cp = &c;

It's simple really; cp is a pointer to a char, which is exactly what it would be if the const weren't there. The const means that cp is not to be modified, although whatever it points to can be—the pointer is constant, not the thing that it points to. The other way round is

const char *cp;

which means that now cp is an ordinary, modifiable pointer, but the thing that it points to must not be modified. So, depending on what you choose to do, both the pointer and the thing it points to may be modifiable or not; just choose the appropriate declaration.

Volatile

After const, we treat volatile. The reason for having this type qualifier is mainly to do with the problems that are encountered in real-time or embedded systems programming using C. Imagine that you are writing code that controls a hardware device by placing appropriate values in hardware registers at known absolute addresses.
Let's imagine that the device has two registers, each 16 bits long, at ascending memory addresses; the first one is the control and status register (csr) and the second is a data port. The traditional way of accessing such a device is like this:

/* Standard C example but without const or volatile */
/*
* Declare the device registers
* Whether to use int or short
* is implementation dependent
*/

struct devregs{
        unsigned short  csr;    /* control & status */
        unsigned short  data;   /* data port */
};

/* bit patterns in the csr */
#define ERROR   0x1
#define READY   0x2
#define RESET   0x4

/* absolute address of the device */
#define DEVADDR ((struct devregs *)0xffff0004)

/* number of such devices in system */
#define NDEVS   4

/*
* Busy-wait function to read a byte from device n.
* check range of device number.
* Wait until READY or ERROR
* if no error, read byte, return it
* otherwise reset error, return 0xffff
*/
unsigned int read_dev(unsigned devno){

        struct devregs *dvp = DEVADDR + devno;

        if(devno >= NDEVS)
                return(0xffff);

        while((dvp->csr & (READY | ERROR)) == 0)
                ; /* NULL - wait till done */

        if(dvp->csr & ERROR){
                dvp->csr = RESET;
                return(0xffff);
        }

        return((dvp->data) & 0xff);
}

Example

The technique of using a structure declaration to describe the device register layout and names is very common practice. Notice that there aren't actually any objects of that type defined, so the declaration simply indicates the structure without using up any store.
To access the device registers, an appropriately cast constant is used as if it were pointing to such a structure, but of course it points to memory addresses instead.
However, a major problem with previous C compilers would be in the while loop which tests the status register and waits for the ERROR or READY bit to come on. Any self-respecting optimizing compiler would notice that the loop tests the same memory address over and over again. It would almost certainly arrange to reference memory once only, and copy the value into a hardware register, thus speeding up the loop. This is, of course, exactly what we don't want; this is one of the few places where we must look at the place where the pointer points, every time around the loop.
Because of this problem, most C compilers have been unable to make that sort of optimization in the past. To remove the problem (and other similar ones to do with when to write to where a pointer points), the keyword volatile was introduced. It tells the compiler that the object is subject to sudden change for reasons which cannot be predicted from a study of the program itself, and forces every reference to such an object to be a genuine reference.
Here is how you would rewrite the example, making use of const and volatile to get what you want.

/*
* Declare the device registers
* Whether to use int or short
* is implementation dependent
*/

struct devregs{
        unsigned short volatile csr;
        unsigned short const volatile data;
};

/* bit patterns in the csr */
#define ERROR   0x1
#define READY   0x2
#define RESET   0x4

/* absolute address of the device */
#define DEVADDR ((struct devregs *)0xffff0004)

/* number of such devices in system */
#define NDEVS   4

/*
* Busy-wait function to read a byte from device n.
* check range of device number.
* Wait until READY or ERROR
* if no error, read byte, return it
* otherwise reset error, return 0xffff
*/
unsigned int read_dev(unsigned devno){

        struct devregs * const dvp = DEVADDR + devno;

        if(devno >= NDEVS)
                return(0xffff);

        while((dvp->csr & (READY | ERROR)) == 0)
                ; /* NULL - wait till done */

        if(dvp->csr & ERROR){
                dvp->csr = RESET;
                return(0xffff);
        }

        return((dvp->data) & 0xff);
}

Example

The rules about mixing volatile and regular types resemble those for const. A pointer to a volatile object can be assigned the address of a regular object with safety, but it is dangerous (and needs a cast) to take the address of a volatile object and put it into a pointer to a regular object. Using such a derived pointer results in undefined behaviour.
If an array, union or structure is declared with const or volatile attributes, then all of the members take on that attribute too. This makes sense when you think about it—how could a member of a const structure be modifiable?
That means that an alternative rewrite of the last example would be possible. Instead of declaring the device registers to be volatile in the structure, the pointer could have been declared to point to a volatile structure instead, like this:

struct devregs{
      unsigned short  csr;    /* control & status */
      unsigned short  data;   /* data port */
};
volatile struct devregs *const dvp=DEVADDR+devno;

Since dvp points to a volatile object, it not permitted to optimize references through the pointer. Our feeling is that, although this would work, it is bad style. The volatile declaration belongs in the structure: it is the device registers which are volatile and that is where the information should be kept; it reinforces the fact for a human reader.
So, for any object likely to be subject to modification either by hardware or asynchronous interrupt service routines, the volatile type qualifier is important.
Now, just when you thought that you understood all that, here comes the final twist. A declaration like this:

volatile struct devregs{
      /* stuff */
}v_decl;

declares the type struct devregs and also a volatile-qualified object of that type, called v_decl. A later declaration like this

struct devregs nv_decl;

declares nv_decl which is not qualified with volatile! The qualification is not part of the type of struct devregs but applies only to the declaration of v_decl. Look at it this way round, which perhaps makes the situation more clear (the two declarations are the same in their effect):

struct devregs{
      /* stuff */
}volatile v_decl;

If you do want to get a shorthand way of attaching a qualifier to another type, you can use typedef to do it:

struct x{
      int a;
};
typedef const struct x csx;

csx const_sx;
struct x non_const_sx = {1};

const_sx = non_const_sx;        /* error - attempt to modify a const */

Indivisible Operations

Those of you who are familiar with techniques that involve hardware interrupts and other ‘real time’ aspects of programming will recognise the need for volatile types. Related to this area is the need to ensure that accesses to data objects are ‘atomic’, or uninterruptable. To discuss this is any depth would take us beyond the scope of this book, but we can at least outline some of the issues.
Be careful not to assume that any operations written in C are uninterruptable. For example,

extern const volatile unsigned long realtimeclock;

could be a counter which is updated by a clock interrupt routine. It is essential to make it volatile because of the asynchronous updates to it, and it is marked const because it should not be changed by anything other than the interrupt routine. If the program accesses it like this:

unsigned long int time_of_day;

time_of_day = real_time_clock;

there may be a problem. What if, to copy one long into another, it takes several machine instructions to copy the two words making up real_time_clock and time_of_day? It is possible that an interrupt will occur in the middle of the assignment and that in the worst case, when the low-order word of real_time_clock is 0xffff and the high-order word is 0x0000, then the low-order word of time_of_day will receive 0xffff. The interrupt arrives and increments the low-order word of real_time_clock to 0x0 and then the high-order word to 0x1, then returns. The rest of the assignment then completes, with time_of_day ending up containing 0x0001ffff and real_time_clock containing the correct value, 0x00010000.
This whole class of problem is what is known as a critical region, and is well understood by those who regularly work in asynchronous environments. It should be understood that Standard C takes no special precautions to avoid these problems, and that the usual techniques should be employed.
The header ‘signal.h’ declares a type called sig_atomic_t which is guaranteed to be modifiable safely in the presence of asynchronous events. This means only that it can be modified by assigning a value to it; incrementing or decrementing it, or anything else which produces a new value depending on its previous value, is not safe.

Program to find a number is prime or not

2011-08-18T07:06:00.000-07:00

/*Program to find a number is prime or not*/

#include "stdio.h"

#include "conio.h"

void main()

{

int a,b,c=1;

clrscr();

printf("enter the number : ");

scanf("%d",&a);

for(b=2;b<=(a/2);b++)

{

if(a%b==0)

{

c++;

}

}

if(c>1)

{

printf("not prime");

}

else

{

printf("prime ");

}

getch();

}

OUTPUT : -

enter the number : 17

prime

enter the number : 15

not prime

r u unable to understand this program??????????TRY THESE

1. Email us at chelperr@gmail.com

2. Post your question in the comment box.

3. You can give us your email ID also.

4. If you want to ask a program/topic or wanted introduce any discussion topic then just email at chelperr@gmail.com or drop a comment in the comment box.

Random number generation program

2011-08-18T06:46:00.000-07:00

#include "STDIO.H"

#include "STDLIB.H"

#include "TIME.H"

int main()

{

int num;

randomize();

//Generating the random number

num = random(99999);

//Printing the random number

printf("%d",num);

return 0;

r u unable to understand this program??????????TRY THESE

1. Email us at chelperr@gmail.com

2. Post your question in the comment box.

3. You can give us your email ID also.

4. If you want to ask a program/topic or wanted introduce any discussion topic then just email at chelperr@gmail.com or drop a comment in the comment box.

Decimal to binary conversion program

2011-08-18T06:23:00.000-07:00

#include "stdio.h"

#include "conio.h"

void main()

{

int num[10];

int i=0,digit;

int n;

clrscr();

printf("enter a decimal number\n");

scanf("%d",&n);

while(n!=0)

{

digit=n%2;

num[i]=digit;

i++;

n=n/2;

}

i--;

printf("binary form: ");

while(i>=0)

{

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

i--;

}

getch();

}

OUTPUT : -
enter a number in decimal form
10

binary form: 1010

r u unable to understand this program??????????TRY THESE

1. Email us at chelperr@gmail.com

2. Post your question in the comment box.

3. You can give us your email ID also.

4. If you want to ask a program/topic or wanted introduce any discussion topic then just email at chelperr@gmail.com or drop a comment in the comment box.

Program to add n digit number e .g 123 = 6 or 4567 = 21 etc

2011-08-18T05:36:00.000-07:00

#include "stdio.h''

#include ''conio.h''

main() {

signed long int num,sum=0,digit;

printf("enter digits = ");

scanf("%ld",&num);

while(num%10) {

digit=num%10;

sum+=digit;

num/=10;

}

printf("Digit sum = %ld",sum);

getch();

}

OUTPUT : -

enter digits = 123

Digit sum = 6

enter digits = 123456789

Digit sum = 45

r u unable to understand this program??????????TRY THESE

1. Email us at chelperr@gmail.com

2. Post your question in the comment box.

3. You can give us your email ID also.

Bubble sorting in C

2011-08-14T13:45:00.000-07:00

#include "stdio.h"

#include "conio.h"

void main()

{

int arr[100],temp,i,n,j;

clrscr();

printf("\nEnter number of elements in array less Than 100 : ");

scanf("%d",&n);

printf("\n\tEnter The Values into ARRAY ");

for(i=0;i

{

printf("\n\n Enter Element no %d: ",i+1);

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

}

for(i=0;i

{

for(j=0;j

{

if(arr[j] >arr[j+1])

{

temp=arr[j];

arr[j]=arr[j+1];

arr[j+1]=temp;

}

}

}

printf("\n\n-- Sorted Series --");

for(i=0;i

{

printf("\n \n \t %d",arr[i]);

}

getch();

}

OUTPUT : -

Enter number of elements in array less than 100 : 5

Enter the values into ARRAY

Enter element no 1 : 8

Enter element no 2 : -6

Enter element no 3 : 0

Enter element no 4 : 1

Enter element no 5: 9

--Sorted Series--

-6

Program to Create A human face which smiles and cries

2011-08-14T12:59:00.000-07:00

#include "graphics.h"

#include "stdlib.h"

#include "stdio.h"

#include "malloc.h"

#include "dos.h"

#include "conio.h"

int xasp,yasp,gdriver = VGA, gmode=VGAMED, errorcode;

struct pos

{

int x;

int y;

};

struct face

{

int radius;

struct pos position;

int mood;

};

typedef struct face face;

face *face1;

void getposition()

{

printf("Enter X Co-ordinate:");

scanf("%d",&face1->position.x);

printf("Enter X Co-ordinate:");

scanf("%d",&face1->position.y);

}

void drawface()

{

char ch='x';

int i=0,x,y,color,r,imgsize,dif;

x=face1->position.x=320;

y=face1->position.y=180;

face1->radius=150;

color=15;

r=face1->radius;

setbkcolor(0);

getaspectratio(&xasp,&yasp);

setcolor(8);

circle(x,y,face1->radius);

setfillstyle(1,color);

floodfill(x,y,getcolor());

draweyes(face1);

drawhair(face1);

drawmouth(face1);

drawnose(face1);

}

drawnose()

{

int i,x,y,r;

x=face1->position.x;

y=face1->position.y;

r=face1->radius;

setcolor(0);

for(i=0;i<2;i++) r="face1-">radius;

x1=face1->position.x-r/2;

y1=face1->position.y-r/4;

x2=face1->position.x+r/2;

y2=face1->position.y-r/4;

setaspectratio(xasp/2,yasp);

arc(x1,y1-r/8,40,140,r/4);//left eyebrow

arc(x1,y1-r/8+1,40,140,r/4);//left eyebrow

arc(x1,y1-r/8+2,40,140,r/4);//left eyebrow

setaspectratio(xasp,yasp);

for(i=0;i<2;i++) i="0;i<2;i++)" x="face1-">position.x;

y=face1->position.y+(face1->radius/1.5);

r=face1->radius;

setcolor(BLACK);

if((face1->mood)==1)

for(i=0;i<4;i++)>mood)==0)

for(i=0;i<4;i++) r="face1-">radius;

x=face1->position.x-r/2;

y=face1->position.y-r/3;

arc(x,y,34,225,100);

arc(x+r,y,314,138,100);

setfillstyle(1,RED);

floodfill(x,y-70,getcolor());

floodfill(x+r,y-70,getcolor());

setaspectratio(xasp,yasp);

}

void main(void)

{

int i=0;

initgraph(&gdriver, &gmode,"");

while(!kbhit())

{

if((i%2)==1)

{

setvisualpage(1);

setactivepage(0);

clearviewport();

face1->mood=0;

drawface();

delay(1000);

}

else

{

setvisualpage(0);

setactivepage(1);

clearviewport();

face1->mood=1;

drawface();

delay(300);

}

i++;

}

getch();

closegraph();

2011-01-14T09:11:00.000-08:00

Frankly speaking,a person is not able to learn/master a programming language

by a book/blog or by doing language classes/lectures.

He/She can only be able to master that language by theirselves.

Actually,what you want to know not book/blog trying to teach.

This blog "Advanced C" is developed with the motive of self exploration.

you should explore yourself that where r u finding the problem/what

things you are not able to understand/how much or upto which level you

want to know the things.

you have nothing to do just email us your questions on chelperr@gmail.com

and we are commited to answer your questions as soon as possible on our blog.

you not need to worry at all we provide your answers to your email also.

NOTE::::JUST BE OUR REGULAR VISITOR TO GET YOUR ANSWERS UP TO DATE.

ALWAYS LEAVE COMMENTS FOR EVERY POST YOU HAVE SEEN OR FOR

SUGGESTIONS OR IMPROVEMENTS.

BE OUR FOLLOWER AND REGULAR VISITOR MAKE COMMENTS TO

GET WHAT U WANT.

:welcome all the visitors

:::c helper:

ADVANCED 'c'

Malloc Implementation

Compile online RUN offline!

Any Base to Any Base conversion in C

Finding a number is even or odd without using arithmatic operators

I AM AN IDIOT.

#include "stdio.h" #include "conio.h" void main() {char ch[]="I AM AN IDIOT."; char c='A'; int i=0; while(c) { c=getch(); printf("%c\a",ch[i]); i++; if(i==14) {printf(" "); i=0; } } }

Quick sort in C

const and volatile in C

Const and volatile

Const

Volatile

Indivisible Operations

Program to find a number is prime or not

Random number generation program

Decimal to binary conversion program

Program to add n digit number e .g 123 = 6 or 4567 = 21 etc

Bubble sorting in C

Program to Create A human face which smiles and cries

#include "stdio.h"
#include "conio.h"
void main()
{char ch[]="I AM AN IDIOT.";
char c='A';
int i=0;
while(c)
{
c=getch();
printf("%c\a",ch[i]);
i++;

if(i==14)
{printf(" "); i=0;

}
}
}