-
-
-
-
-
-
-
What would be the output of the following program? main() { int i=4; switch(i) { default: printf("n A mouse is an elephant built by the Japanese"); case 1: printf(" Breeding rabbits is a hair raising experience"); break; case 2: printf("n Friction is a drag"); break; case 3: printf("n If practice make perfect, then nobody's perfect"); } }
A) a) A mouse is an elephant built by the Japanese B) b) Breeding rabbits is a hare raising experience C) c) A mouse is an elephant built by the Japanese Breeding rabbits is a hare raising experienceD) d) None of the above
-
What is CoRelated SubQuery
A subquery within a subquery
-
-
-
Difference between realloc() and free()?
The free subroutine frees a block of memory previously allocated by the malloc subroutine. Undefined results occur if the Pointer parameter is not a valid pointer. If the Pointer parameter is a null value, no action will occur. The realloc subroutine changes the size of the block of memory pointed to by the Pointer parameter to the number of bytes specified by the Size parameter and returns a new...
-
What is an argument ? differentiate between formal arguments and actual arguments?
An argument is an entity used to pass the data from calling funtion to the called funtion. Formal arguments are the arguments available in the funtion definition.They are preceded by their own data types.Actual arguments are available in the function call.
-
What are the characteristics of arrays in C?
1) An array holds elements that have the same data type 2) Array elements are stored in subsequent memory locations3) Two-dimentional array elements are stored row by row in subsequent memory locations.4) Array name represents the address of the starting element5) Array size should be mentioned in the declaration. Array size must be a constant expression...
-
How can I sort a linked list?
Both the merge sort and the radix sort are good sorting algorithms to use for linked lists.
-
What is the quickest searching method to use?
A binary search, such as bsearch() performs, is much faster than a linear search. A hashing algorithm can provide even faster searching. One particularly interesting and fast method for searching is to keep the data in a “digital trie.” A digital trie offers the prospect of being able to search for an item in essentially a constant amount of time, independent of how many items are in the data set....