 Unsigned integers occupies
| ||||||||
A weather forecasting computation requires 250 billion floating point operations. The problem is processed in a supercomputer that ca perform 100 mega flops. How long will it take to do these calculations.
| ||||||||
The value that follows the keyword CASE may only be
| ||||||||
A data structure whose elements from a sequence is known as
| ||||||||
The process of production of customer list in alphabetical order falls under the category of
| ||||||||
If an array is used as function argument, the array is passed
| ||||||||
Binary search tree is an example of
| ||||||||
The earliest calculating devices are
| ||||||||
Which of the following data structure is non-linear type?
| ||||||||
| What value would the following function return for the input x=95
Function fun (int x)
{
if(x>100)
{
return fun(x-10)
}
else
return fun(fun(x+11))
}
| ||||||||
A data structure in which linear sequence is maintained by pointers is known as
| ||||||||
The information about an array used in a program will be sorted in
| ||||||||
What does the following fragment of C-program print?
char c[] "GATE2011";
char *p =c;
printf ("%s", p+p[3]-p [1] );
| ||||||||
From the point of view of the programmer, what are the major advantages of using a high-level language rather than internal machine code or assembly language ?
| ||||||||
By default real number is treated as
| ||||||||
Which of the following data structure is used to represent relationship between pairs, where relationship is not hierarchical ?
| ||||||||
| What is the output of the following program segment? main() { int i = ++2; printf(“%d\n”, i); }
| ||||||||
‘C’ allows a three-way transfer of control with the help of
| ||||||||
The postfix expression AB + CD – * can be evaluated using a
| ||||||||
C language was invented by
| ||||||||
| What is the output of the following program segment? main() { int i = 1; do { printf(“%d..”, i); } while(i--); }
| ||||||||
Suppose a circular queue of capacity (n -1) elements is implemented with an array of n elements. Assume that the insertion and deletion operations are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are
| ||||||||
Consider the following sequence of operations :
(i) Pointer p1 is set to point at a new heap-dynamic variable.
(ii) Pointer p2 is assigned p1 value.
(iii) The heap dynamic variable pointed to by p1 is explicitly de-allocated, but p2 is not changed by the operation. This situation leads to which of the following :
| ||||||||
| Consider the following program main ( ) { float a = 0.5, b = 0.7; if (b < 0.8) if (a < 0.5) printf (“ABCD”); else printf (“PQR”); else printf (“JKLF); } The output is
| ||||||||
| What would be the output of the following program, if run from the command line as “myprog 1 2 3” ? main (int argc, char * argv[ ]) { int i ; i = argv[1] + argv[2] + argv[3] ; printf (“% d”, i) ; }
| ||||||||
The expression P >> 6 shifts all bits of P six places to right. What is the value of P >> 6 if P 0.6db7 ?
| ||||||||
The process of accessing data stored in a serial access memory is similar to manipulating data on a
| ||||||||
Queue is a ----------- list.
| ||||||||
Linked lists are not suitable data structures for which one of the following problems
| ||||||||
The << operator is used for
| ||||||||
In a circular linked list
| ||||||||
If binary tree has n leaf nodes,then number of nodes of degree 2 in T is
| ||||||||
| Consider the following C code segment. int a, b, c = 0; void prtFun(void); main( ) { static int a = 1; /* Line 1 */ prtFun( ); a += 1; prtFun( ); printf(“ \n %d %d ”, a, b); } void prtFun(void) { static int a = 2; /* Line 2 */ int b = 1; a += ++b; printf(“ \n %d %d ”, a, b); } What output will be generated by the given code segment?
| ||||||||
| Following sequence of operations is performed on a stack:
PUSH (10), PUSH(20), POP,PUSH (10), PUSH (20),POP, POP, POP, PUSH (20), POP
| ||||||||
| Output of the program given below is int i; main() { printf(“%d”, i)
| ||||||||
Usually, an algorithm will contain a number of procedural steps which are dependent on results of previous steps and is called _______________.
| ||||||||
What would be output of the following program? # define SQR(X) (X*X) main() { int a, b=3; a = SQR(b+2); printf(“\n%d”, a); }
| ||||||||
The efficient data structure to insert/delete a number in a stored set of numbers is
| ||||||||
How many times the following program would print (“abc”)? main() { printf(“\nabc”); main(); }
| ||||||||
When the following code is executed what will be the value of x and y ?
int x = 1, y = 0;
y = x++;
| ||||||||
Which of the following is a bad example of recursion ?
| ||||||||
An advantage of choosing this implementation of \set of integers" is that adding an element to a set is a contact time operation. Which of the following is a disadvantage of this implementation?
| ||||||||
The number of different directed trees with 3 nodes are
| ||||||||
| What would be output of the following program, if the array begins at 65486? main() { int arr[ ] = {12, 14, 15, 23, 45}; printf(“%u%u”, arr+1, &arr+1); }
| ||||||||
The name of all functions end with a
| ||||||||
A template stores
| ||||||||
| What would be output of the following program? # define SQR(X) (X*X) main() { int a, b=3; a = SQR(b+2); printf(“\n%d”, a); }
| ||||||||
The decimal value 0.5 in IEEE single precision floating point representation has
| ||||||||
Queues serve a major role in
| ||||||||
Number of binary trees formed with 5 nodes are
|