C Programming Interview Question and Answer SET 2
21.
Why does malloc(0) return valid memory address ? What's the
use?
malloc(0)
does not return a non-NULL under every implementation. An implementation is
free to behave in a manner it finds suitable, if the allocation size requested
is zero. The implmentation may choose any of the following actions:
*
A null pointer is returned.
* The behavior is same as if a space of non-zero size was requested. In this case, the usage of return value yields to undefined-behavior.
* The behavior is same as if a space of non-zero size was requested. In this case, the usage of return value yields to undefined-behavior.
Notice,
however, that if the implementation returns a non-NULL value for a request
of a zero-length space, a pointer to object of ZERO length is returned!
Think, how an object of zero size should be represented
For
implementations that return non-NULL values, a typical usage is as
follows:
void
func ( void )
{
int *p; /* p is a one-dimensional array, whose size will vary during the the lifetime of the program */
size_t c;
p = malloc(0); /* initial allocation */
if (!p)
{
perror (”FAILURE” );
return;
}
/* … */
while (1)
{
c = (size_t) … ; /* Calculate allocation size */
p = realloc ( p, c * sizeof *p );
/* use p, or break from the loop */
/* … */
}
return;
}
Notice that this program is not portable, since an implementation is free to return NULL for a malloc(0) request, as the C Standard does not support zero-sized objects.
void
func ( void )
{
int *p; /* p is a one-dimensional array, whose size will vary during the the lifetime of the program */
size_t c;
p = malloc(0); /* initial allocation */
if (!p)
{
perror (”FAILURE” );
return;
}
/* … */
while (1)
{
c = (size_t) … ; /* Calculate allocation size */
p = realloc ( p, c * sizeof *p );
/* use p, or break from the loop */
/* … */
}
return;
}
Notice that this program is not portable, since an implementation is free to return NULL for a malloc(0) request, as the C Standard does not support zero-sized objects.
22.
Difference between const char* p and char const* p
In
const char* p, the character pointed by ‘p’ is constant, so u cant change the
value of character pointed by p but u can make ‘p’ refer to some other
location.
In
char const* p, the ptr ‘p’ is constant not the character referenced by it, so u
cant make ‘p’ to reference to any other location but u can change the value of
the char pointed by ‘p’.
23.
What does ‘segment violation’ means?
It is a error which occurs when program
attempt to access a memory that is not permissible.
24.
What is the benefit of using an enum rather than a #define constant?
The
use of an enumeration constant (enum) has many advantages over using the
traditional symbolic constant style of #define. These advantages include a
lower maintenance requirement, improved program readability, and better
debugging capability.
1) The first advantage is that enumerated constants are generated automatically by the compiler. Conversely, symbolic constants must be manually assigned values by the programmer.
2) Another advantage of using the enumeration constant method is that your programs are more readable and thus can be understood better by others who might have to update your program later.
1) The first advantage is that enumerated constants are generated automatically by the compiler. Conversely, symbolic constants must be manually assigned values by the programmer.
2) Another advantage of using the enumeration constant method is that your programs are more readable and thus can be understood better by others who might have to update your program later.
3)
A third advantage to using enumeration constants is that some symbolic
debuggers can print the value of an enumeration constant. Conversely, most
symbolic debuggers cannot print the value of a symbolic constant. This can be
an enormous help in debugging your program, because if your program is stopped
at a line that uses an enum, you can simply inspect that constant and instantly
know its value. On the other hand, because most debuggers cannot print #define
values, you would most likely have to search for that value by manually looking
it up in a header file.
25.
What is the quickest sorting method to use?
The
answer depends on what you mean by quickest. For most sorting problems, it just
doesn’t matter how quick the sort is because it is done infrequently or other
operations take significantly more time anyway. There are three sorting methods
in this author’s toolbox that are all very fast and that are useful in
different situations. Those methods are quick sort, merge sort, and radix sort.
26.
When should the volatile modifier be used?
The
volatile modifier is a directive to the compiler’s optimizer that operations
involving this variable should not be optimized in certain ways. There are two
special cases in which use of the volatile modifier is desirable. The first
case involves memory-mapped hardware (a device such as a graphics adaptor that
appears to the computer’s hardware as if it were part of the computer’s
memory), and the second involves shared memory (memory used by two or more
programs running simultaneously).
27.
When should the register modifier be used?
The
register modifier hints to the compiler that the variable will be heavily used
and should be kept in the CPU’s registers, if possible, so that it can be
accessed faster.
28.
How can you determine the size of an allocated portion of memory?
You
can’t, really. free() can , but there’s no way for your program to know the
trick free() uses. Even if you disassemble the library and discover the trick,
there’s no guarantee the trick won’t change with the next release of the
compiler.
29.
When does the compiler not implicitly generate the address of
the first element of an array?
Whenever
an array name appears in an expression such as
· array as an operand of the size of operator
· array as an operand of & operator
· array as a string literal initializer for a character array
Then the compiler does not implicitly generate the address of the address of the first element of an array.
· array as an operand of the size of operator
· array as an operand of & operator
· array as a string literal initializer for a character array
Then the compiler does not implicitly generate the address of the address of the first element of an array.
30.
Why n++ executes faster than n+1 ?
The
expression n++ requires a single machine instruction such as INR to carry out
the increment operation whereas, n+1 requires more instructions to carry out
this operation.
31.
Why doesn't the following statement work?
char
str[ ] = "Hello" ;
strcat ( str, '!' ) ;
strcat ( str, '!' ) ;
Answer:
The string function strcat( ) concatenates strings and not a character.
The basic difference between a string and a character is that a string is a
collection of characters, represented by an array of characters whereas a
character is a single character. To make the above statement work writes the
statement as shown below:
strcat
( str, "!" ) ;
32.
What is the benefit of using #define to declare a constant?
Using
the #define method of declaring a constant enables you to declare a constant in
one place and use it throughout your program. This helps make your programs
more maintainable, because you need to maintain only the #define statement and
not several instances of individual constants throughout your program.
For
instance, if your program used the value of pi (approximately 3.14159) several
times, you might want to declare a constant for pi as follows: #define PI
3.14159
Using
the #define method of declaring a constant is probably the most familiar way of
declaring constants to traditional C programmers. Besides being the most common
method of declaring constants, it also takes up the least memory.
Constants
defined in this manner are simply placed directly into your source code, with
no variable space allocated in memory. Unfortunately, this is one reason why
most debuggers cannot inspect constants created using the #define method.
33.
What is the purpose of main( ) function ?
The
function main( ) invokes other functions within it.It is the first function to
be called when the program starts execution.
·
It is the starting function
· It returns an int value to the environment that called the program
· Recursive call is allowed for main( ) also.
· It is a user-defined function
· Program execution ends when the closing brace of the function main( ) is reached.
· It has two arguments 1)argument count and 2) argument vector (represents strings passed).
· Any user-defined name can also be used as parameters for main( ) instead of argc and argv
· It returns an int value to the environment that called the program
· Recursive call is allowed for main( ) also.
· It is a user-defined function
· Program execution ends when the closing brace of the function main( ) is reached.
· It has two arguments 1)argument count and 2) argument vector (represents strings passed).
· Any user-defined name can also be used as parameters for main( ) instead of argc and argv
34.
How can I search for data in a linked list?
Unfortunately,
the only way to search a linked list is with a linear search, because the only
way a linked list’s members can be accessed is sequentially.
Sometimes it is quicker to take the data from a linked list and store it in a different data structure so that searches can be more efficient.
Sometimes it is quicker to take the data from a linked list and store it in a different data structure so that searches can be more efficient.
35.
Why should we assign NULL to the elements (pointer) after freeing them?
This
is paranoia based on long experience. After a pointer has been freed, you can
no longer use the pointed-to data. The pointer is said to dangle; it doesn’t
point at anything useful.
If
you NULL out or zero out a pointer immediately after freeing it, your program
can no longer get in trouble by using that pointer. True, you might go indirect
on the null pointer instead, but that’s something your debugger might be able
to help you with immediately.
Also,
there still might be copies of the pointer that refer to the memory that has
been deallocated; that’s the nature of C. Zeroing out pointers after freeing
them won’t solve all problems.
36.
What is a null pointer assignment error? What are bus errors, memory
faults, and core dumps?
These
are all serious errors, symptoms of a wild pointer or subscript. Null
pointer assignment is a message you might get when an MS-DOS program finishes
executing. Some such programs can arrange for a small amount of memory to be
available “where the NULL pointer points to (so to speak). If the program tries
to write to that area, it will overwrite the data put there by the compiler.
When
the program is done, code generated by the compiler examines that area. If that
data has been changed, the compiler-generated code complains with null pointer
assignment. This message carries only enough information to get you worried.
There’s no way to tell, just from a null pointer assignment message, what part
of your program is responsible for the error. Some debuggers, and some
compilers, can give you more help in finding the problem.
Bus
error: core dumped and Memory fault: core dumped are messages you might see from
a program running under UNIX. They’re more programmer friendly. Both mean that
a pointer or an array subscript was wildly out of bounds. You can get these
messages on a read or on a write. They aren’t restricted to null pointer
problems. The core dumped part of the message is telling you about a file,
called core, that has just been written in your current directory. This is a
dump of everything on the stack and in the heap at the time the program was
running. With the help of a debugger, you can use the core dump to find where
the bad pointer was used. That might not tell you why the pointer was
bad, but it’s a step in the right direction. If you don’t have write permission
in the current directory, you won’t get a core file, or the core dumped message
37.
Predict the output or error(s) for the following programmes:
void
main()
{
int const * p=5;
printf("%d",++(*p));
}
{
int const * p=5;
printf("%d",++(*p));
}
Answer: Compiler
error: Cannot modify a constant value.
Explanation: p is a pointer to a "constant integer". But we tried to change the value of the "constant integer".
Explanation: p is a pointer to a "constant integer". But we tried to change the value of the "constant integer".
38.
main()
{
char s[ ]="man";
int i;
for(i=0;s[ i ];i++)
printf("\n%c%c%c%c",s[ i ],*(s+i),*(i+s),i[s]);
}
{
char s[ ]="man";
int i;
for(i=0;s[ i ];i++)
printf("\n%c%c%c%c",s[ i ],*(s+i),*(i+s),i[s]);
}
Answer:
mmm
aaaa
nnnn
mmm
aaaa
nnnn
Explanation:
s[i], *(i+s), *(s+i), i[s] are all different ways of expressing the same idea.
Generally array name is the base address for that array. Here s is the base
address. i is the index number/ displacement from the base address. So,
indirecting it with * is same as s[i]. i[s] may be surprising. But in the case
of C it is same as s[i].
39.
main()
{
float me = 1.1;
double you = 1.1;
if(me==you)
printf("I love U");
else
printf("I hate U");
}
{
float me = 1.1;
double you = 1.1;
if(me==you)
printf("I love U");
else
printf("I hate U");
}
Answer:
I hate U
Explanation: For floating point numbers (float, double, long double) the values cannot be predicted exactly. Depending on the number of bytes, the precession with of the value represented varies. Float takes 4 bytes and long double takes 10 bytes. So float stores 0.9 with less precision than long double.
Explanation: For floating point numbers (float, double, long double) the values cannot be predicted exactly. Depending on the number of bytes, the precession with of the value represented varies. Float takes 4 bytes and long double takes 10 bytes. So float stores 0.9 with less precision than long double.
Rule
of Thumb: Never compare or at-least be cautious when using floating point
numbers with relational operators (== , >, <, <=, >=,!= ) .
40.
main()
{
static int var = 5;
printf("%d ",var--);
{
static int var = 5;
printf("%d ",var--);
if(var)
main();
}
main();
}
Answer:
5 4 3 2 1
Explanation: When static storage class is given, it is initialized once. The change in the value of a static variable is retained even between the function calls. Main is also treated like any other ordinary function, which can be called recursively.
Explanation: When static storage class is given, it is initialized once. The change in the value of a static variable is retained even between the function calls. Main is also treated like any other ordinary function, which can be called recursively.
Comments
Post a Comment