What will be the output of the following C code?
#include < stdio.h >
void main()
{
int i = 0, k;
if (i == 0)
goto label;
for (k = 0;k < 3; k++)
{
printf(“hi\n”);
label: k = printf(“%03d”, i);
}
}
a) 0
b) hi hi hi 0 0 0
c) 0 hi hi hi 0 0 0
d) 0 0 0
Answer: d
Related Posts
While inserting the record into the index, if the search-key value does not appear in the index.
Insertion of a large number of entries at a time into an index is referred to as __________ of the index
In B+ tree the node which points to another node is called
A search key containing more than one attribute is referred to as a _________ search key.
Incase the indices values are larger, index is created for these values of the index. This is called
In a __________ index, an index entry appears for only some of the search-key values.
In a _______ clustering index, the index record contains the search-key value and a pointer to the first data record with that search-key value and the rest of the records will be in the sequential pointers.
Join The Discussion