Wednesday, December 17, 2008

C, Data structures and algorithm questions

What is the purpose of a function prototype?
Does C support function overloading?
How can I return multiple values from a function?
Does extern in a function declaration mean anything?
How to declare a pointer to a function?
What are the common causes of pointer bugs?
What is an opaque pointer?
Why is sizeof() an operator and not a function?
What is the difference between malloc() and calloc()?
What are near, far and huge pointers?
What operations are valid on pointers? When does one get the Illegal use of pointer in function
Is *(*(p+i)+j) is equivalent to p[i][j]? Is num[i] == i[num] == *(num + i) == *(i + num)?
What do pointers contain?
What is a dangling pointer? What are reference counters with respect to pointers?
What are brk() and sbrk() used for? How are they different from malloc()?
What is a memory leak?
What is the difference between an array of pointers and a pointer to an array?
What do Segmentation fault, access violation, core dump and Bus error mean?
What is a void pointer? Why can't we perform arithmetic on a void * pointer?
What's the difference between const char *p, char * const p and const char * const p?
What does malloc() , calloc(), realloc(), free() do? What are the common problems with malloc()?
Is the cast to malloc() required at all?
Does an array always get converted to a pointer? What is the difference between arr and &arr?
What is a null pointer assignment error?
What is a NULL pointer? How is it different from an unitialized pointer? How is a NULL pointer
What does *p++ do? Does it increment p or the value pointed by p?
How can I sort things that are too large to bring into memory?
Implement the bubble sort algorithm. How can it be improved? Write the code for selection sort,
Give pseudocode for the mergesort algorithm
What is the difference between Merge Sort and Quick sort?


Your Title