44 Discussion / Question Topics
Remove Filter  | [CODE] #include<stdio.h> #include<stdlib.h> #define MAX 5 char queue[MAX][30]; int front, rear, temp; void init() { front = -1; rear = -1; } void insert() { if ( rear >= MAX-1 && front == -1 ) { printf("\nQueue overflow"); return ; } temp = rear; rear = ( rear + 1 … |
| | Hi , i know one method of deleting a record from a binary file. that is : read the contents of the file and every time check for some criteria based on which we want to delete the record. if record does not match criteria then write to new file … |
| | hi, how the below code is generating out put as " -1 < ( unsigned char ) 1 ". i read in many books saying when we do operation with singed and unsigned value always the resultant will be data type that has more width . i understand that -1 … |
| | Hi, i have written a program to find the power of two numbers using iteration. The problem here is that to return the correct out put for even powers but not for odd powers. b = base , e = expo ,p= power( b, e);; for even powers the statements … |
| | Hi, [CODE] #include<stdio.h> int main( void ) { float a = 0.2; if( a > 0.2 ) printf( "\n a is greater than 0.2" ); else if( a < 0.2 ) printf( "\n a is less than 0.2" ); else printf( "\n a is equal to 0.2" ); return 0; …  |
| | what is the correct declaration of pointer to a pointer to array of N elements. ( i want to store address of pointer to an array of n elements ) i am using the below declarions seperately , but getting errors. [CODE] int (*p)[4]; int (*p1) (*)[4] = &p; int … |
| | 1. Why Nesting of comments is not supported by c. code does not involve much complexity to have that. 2. Why Array partial initialization have zero appended. why it cannot do in normal declaration. 3. continued.... Thanks, 3R  |
| | Hi, I have written a program just to check the behaviour of the compiler. i expected an error in function call statement. but its not generating any error. the declaration of function we include to check the type of args and no of args and return value of function. but … |
| | Hi, Please some one clarify what does the below snippets mean and the compiler assumptions. which one is the correct one to use, what is the problem with others. [CODE] main() { } [/CODE] [CODE] void main() { } [/CODE] [CODE] int main() { } [/CODE] [CODE] int main() { … |
| | Hi , i have read that new line character gets converted to \r\n when writing characters to a file and converted to new line again when reading. but i observed one thing here. i have written contents hello followed by return key . and i have written a program to …  |
| | Hi , when i run the program i got the same out put by using memcpy and memmove but i dont understand the difference between them. manual page says that memory area should not overlap in memcpy but can in memmove. what is meant by moving memory and how its … |
| | here i have two bubble sort versions. [CODE] void bsort() { int i,j,jc=0,ic=0,temp,swap=1; //for(i=0;i<NOE & swap;i++){ this one or for(i=0;i<NOE-1 & swap;i++){ \\ this swap=0,ic++; for(j=0;j<NOE-1-i;j++){ jc++; if(a[j]>a[j+1]){ temp = a[j]; a[j] = a[j+1]; a[j+1] = temp; swap = 1; } } } printf("jc=%d ic=%d\n",jc,ic); } [/CODE] i checked it … |
| | Hi, i understand the ieee 754 representation. but can some one explain why we need to add specifically 127 to the power of 2. for ex: 5.75 ; 101.110 can be written as 1.01110 * 2 ^ 2 127 +2 = 129 . i.e 10000001 now IEEE 754 of 5.75 … |
| | below is one simplest code to illustare the pyramid of number. [CODE] void piramid(int const c) { int r, x; for (r = c; r > 0; r--) { for (x = 1; x < = (2 * c - r); x++) { if (x < r) printf(" "); else … |
| | [CODE] #define fst 1 int main() { #if( fst ==1 ) printf("FST\n"); #else printf("Dummy FST\n"); return 0; }[/CODE] if i replace the statement in line 4 with [ICODE] #if fst [/ICODE] also the code is working. can any one tell me what is the correct way , advantages and disadvantages.  |
| | As far as my understanding and other referals i understood that when the address of a local variable is returned the first call using this address may print the correct value but if it is called after any other function may get undefined values. but my program is returning the … |
| | Hi , so far i have been concentrating on programming aspects. now its time to learn some internals of C -compiler. Lexical Analyzer Parser Hashtables Syntax Checkers Expression Evaluators Symbol table : etc please share me some info related to symbol table what are the contents of the symbol table … |
| | i am writting a program for finding the no of keyword ( occurances ) and operators occurances. i am taking the all the keywords in an array and all the operators in seperate arrays for each category of operators. char *kw[] = {"auto","break"..."while" }; char *Arth_op[] = { "%","*","+","-","/"}; according … |
| | Hi, i have a doubt regarding conditional macros and undef directive. can i use undef for a function like - macro, by just specifying the name of the macro with out specifying the argument list as written in line 8. is the code correct with out these statements: [ICODE] #define … |
| | Hi , I want to write a program on Lexical Analyzer: which finds the no of keywords, no of operators ( based on the classification arithmetic, logical,....), constants, and others. please suggest me one good method. i am using a method which follows as below: char *Arith_Oper[]={ "+", "-", "*", … |
| | how the sizeof array is the total number of elements multiped by its base data type size, when the name of the array gives only the base address. [ICODE] int array [5]; sizeof array ; [/ICODE] gives 20 bytes. why not 4 bytes. because [ICODE] array = &array[0] .[/ICODE] |
| | Hi, i understand merge sort & quick sort even i can write the programs but iam unable to understand its complexity. its very easy to derive complexity equations for selection & bubble sort. as the code is little complex & recursive nature i am unable to understand its complexity and … |
| | [CODE] [Davis@localhost UNS]$ gcc U_bc.c [Davis@localhost UNS]$ ./a.out a=d i=100 f=0.000000 sizeof(u)=4 [Davis@localhost UNS]$ cat U_bc.c int main() { union test { char ch; float f; int i; }; //union test u={'a',21,34.65}; gives a warning excess elements union test u={100.23}; printf("a=%c i=%d f=%f\n",u.ch,u.i,u.f); printf("sizeof(u)=%d\n",sizeof(u)); return 0; } [/CODE] in the … |
| | Hi, I used Enum constant as a case of swict statement and trying to select by using the pointer to the structure , which internally has a union and a enum member. the union member again internally have three structures. even i debugged the code. the value of the variable … |
| | [CODE] /*dynamically allocating memory in called funcion and freeing in caller*/ char** memall(int ns); #define Max 20 #include<stdio.h> int main() { char **s; int i,ns; printf("no of string you want to store"); scanf("%d",&ns); s=memall(ns); for(i=0;i<ns;i++) printf("addrs =%u and string=%s\n",(s+i),s[i]); for(i=0;i<ns;i++) free(s[i]); free(s); /* s=NULL; for(i=0;i<ns;i++) printf("%s\n",s[i]); *///dont try to access … |
| | Hi, I have little idea of padding. i read in one of the links that : all character variables gets stored in the memory location that is divided by 1. all short variables gets stored in the memory location that is divided by 2. all int variables gets stored in …  |
| | Hi, i dont understand the following; PLZ fix me. when i try to change the character pointed by pointer the behaviour is undefined. but when i change the same by using pointer as formal parameter of function it will be ok. why i cant change the base address of array, … |
| | Hi , i want to use hash tables in my project. i got few codes in that i got some function called hash() [CODE] int hash(char *s) { int h =0; for (; *s;s++) h = *s + h * 31; return h % 101; } [/CODE] i understand the … |
| | i run the below code and surprised to see the o/p . take a look and let me know whats happenning there. [CODE]#define print(x) printf(#x"=%d\n",x) int main(){ int a[10]; print(a); print(*a); print(*a+1); print(*a+3); print(*a+1-*a+3); return 0; } [/CODE] Out Put: [QUOTE] [Zonnie@telnet CPz]$gcc funny.c [Zonnie@telnet CPz]$ ./a.out a=-1073745776 *a=1 *a+1=2 …  |
| | The Programming languages started with the low level language( 1's and zero's , so no conversion is needed. Assembly language is used mnemonics ( ADD,INC,DEC) so needs conversions as the machine cannot understand it directly. there comes the Assembler. Now the question is how the Assember was implemented, i mean … |
| | Hi , I read that c is not a block structured language. means it does not allow defining functions inside other functions. but this code is not generating any error not even warnings, though we nest the functions. whats the story. [CODE] #include<stdio.h> int main() { int num; num = …  |
| | Hi i have written a program to check the precision of float and double values. i read that the precision of float is 6 digits and double is 10. but it is showing only 6 for both. do we need to make any arrangement for the system to print the … |
| | hi , i have read that c99 introduced: inline,_Bool,restrict,_Complex,_Imaginary i have used _Bool here but do no how to use remaining all please any one used the above can help me. [CODE] int main() { _Bool b; b=true;// giving error true undeclared ,cant i use that way // with out … |
| | [CODE] enum fivenums {Z,O,T,TH,F,FI} int main() { char ch; int num; do{ scanf("%d",&num); switch(num) { case Z: printf("ZERO\n"); break; case O: printf("ONE\n"); break; case T: printf("TWO\n"); break; case TH: printf("THREE\n"); break; case F: printf("FOUR\n"); break; case FI: printf("FIVE\n"); break; default : printf("Invalid\n"); break; } getchar();// to eat '\n' terminator so …  |
| | Hi , this one is with respect to C. (i) when we use array an array index always starts from zero . is it a standard one? or compilers are implemented that way? if compilers are implented that way they must have followed some standard. (ii) the array name cannot … |
| | Hi, i like to know what are the different systems that have gstreamer built in, or systems which allows gstreamer to be installed. I also like to know what this below lines specifies: I found this in my shell of proc/version file Linux Version 2.6.9-5.Elsm gcc version 3.4.3 20041212 (red … |
| | can somebody explain the behaviour of the statement printf("%d"); is it any where depends on the statements that present before or after it. i have some satatements that allocates memory dynamically. its printing one of that value. is there any proper reason for undefined behaviour. |
| | [CODE] #include <gst/gst.h> #include <stdbool.h> static GMainLoop *loop; static gbooleanbus_call (GstBus *bus,GstMessage *msg, gpointer user_data) { switch (GST_MESSAGE_TYPE (msg)) { case GST_MESSAGE_EOS: { g_message ("End-of-stream"); g_main_loop_quit (loop); break; } case GST_MESSAGE_ERROR: { gchar *debug; GError *err; gst_message_parse_error (msg, &err, &debug); g_free (debug); g_error ("%s", err->message); g_error_free (err); g_main_loop_quit (loop); break; … |
| | i have just written a small program on DEV C++. i have been using it for couple of months but i never observed this error. [CODE] #include<stdio.h> int main() { printf("Welcome\n"); system("PAUSE"): return 0; } [/CODE] could not create makefile I/o error 32 any idea? what does that mean |
| | please provide the free pdf link of k & R c prog lang. i spent lot of time in googling but couldnot get it. thanks in adv. |
| | Dont know these types of questions are asked here or not but if any one has idea please help me. i just started started learning system programming and want to pursue a career in the sys prog area. below is the program that use a fork() call. i read in …  |
| | Hello , i have written the code for finding the middle element of the list with 0(n) complexity. please gurus, verify that and let me know if it needs any modifications and ofcourse i have question to ask when the no of elements are odd we can easily find the … |
| | written a code for finding nth last element but no idea how to caluculate complexity. how can i make this, of 0(n) complexity. [CODE]// p is position of element to find int nthlast(struct node *n, int p) { struct node *f, *s; if(n) { int cnt=0; f = n;// start … |
| | Hello every one, i have written the following program for testing getch function behaviour. but, as soon as i run the program i am getting segmentation fault. i dont understand the problem. i am using GCC compiler on Linux Environment. i want to test the key scan program. [CODE] #include<ncurses.h> … |
The End.