Technical Quiz ( Round-2 )

A tree is a hierarchical data structure that contains vertices connected to each other by edges. This means that each element in the tree, called a vertex, is connected to other vertices through edges. Therefore, the correct answer is "VERTEX, EDGES".

The special symbol allowed in a variable name is the underscore (-_).

The given statement "extern int i;" is a declaration because it introduces the existence of a variable named "i" without defining its value or memory allocation. The keyword "extern" indicates that the variable is defined in another file and this statement is used to inform the compiler about its existence.

In the given program, the line "extern int a;" is a declaration of the variable "a". It tells the compiler that the variable "a" is defined somewhere else in the program. The line "int a = 20;" is the definition of the variable "a", where it is assigned a value of 20. So, the correct answer is "extern int a is declaration, int a = 20 is the definition".

The ceil() function is used to round up a value to the nearest whole number. In this case, the value 1.66 would be rounded up to 2.0.

The strcmp() function is used to compare two strings. If the two strings are identical, strcmp() returns 0.

The declaration "int (*ptr)[10];" means that "ptr" is a pointer to an array of 10 integers. This means that "ptr" can store the memory address of an array that contains 10 integers.

The strstr() function is used to find the first occurrence of a given string within another string. It returns a pointer to the first occurrence of the substring or NULL if the substring is not found. This function is commonly used in string manipulation and searching algorithms.

When you pass an array as an argument to a function in C, only the base address of the array gets passed. This means that the function will have access to the memory location where the array starts, allowing it to manipulate or access the elements of the array. The function does not receive the actual values of the elements in the array or the address of the last element.

The program will print "IndiaBIX" infinite times because the main function is recursively calling itself without any condition to stop the recursion. Therefore, the program will keep printing "IndiaBIX" indefinitely until the stack overflows.

The answer is "No difference, except extern int fun(); is probably in another file." The reason for this is that both declarations have the same return type and function name, indicating that they are referring to the same function. The only difference is the keyword "extern" in the first declaration, which suggests that the function is defined in another file. This keyword is used to declare that the function is defined elsewhere and is being referenced in the current file.

The output of the program will be "i=5,j=0,k=20".
In the given program, a while loop is used to increment the value of i from 0 to 5. Inside the loop, the value of j is always set to 0 and k is calculated as i multiplied by j. Since j is always 0, k will always be 0. After the loop, the printf statement prints the final values of i, j, and k, which are 5, 0, and 0 respectively.

The average time of a binary search is proportional to logN. This is because in a binary search, the search list is divided in half at each step until the target element is found. This means that the number of steps required to find the target element is equal to the logarithm of the size of the search list. Therefore, the average time complexity of a binary search is logarithmic in the size of the search list.

The correct answer is `*(*(*(*(a+i)+j)+k)+l)`. This expression is the equivalent pointer expression for referring to the array element `a[i][j][k][l]`. It uses nested pointer dereferences to access the element at the specified indices. The outermost dereference `*(a+i)` accesses the `i`th element of the array `a`, the next dereference `*(*(a+i)+j)` accesses the `j`th element of the sub-array `a[i]`, and so on until the innermost dereference `*(*(*(*(a+i)+j)+k)+l)` accesses the `l`th element of the sub-sub-sub-array `a[i][j][k]`.

The maximum number of children a node can have is referred to as the order of the tree. The order of the tree determines the maximum number of branches or children a node can have, which affects the overall structure and organization of the tree.

In the given program, the declaration "typedef char (*(*arrfptr[3])())[10];" defines an array of three function pointers named "arrfptr". Therefore, the variable "x" is an array of three function pointers.

The function randomize() in Turbo C under DOS will return a random number generator with a random value based on time. This means that each time the function is called, it will generate a different random number. The random value is based on the current time, ensuring that the generated numbers are unpredictable and not repetitive.

The NULL macro is defined in both stdio.h and stddef.h header files. These header files are part of the C standard library and provide various definitions and functions. stdio.h is used for input and output operations, while stddef.h is used for defining various types and macros, including NULL. Therefore, to use the NULL macro in a C program, one needs to include either stdio.h or stddef.h header file.

The function fmod() should be used to obtain the remainder after dividing 3.14 by 2.1.