20 votes
205
What is the output of the following program?Class Test { public static void main (String [] args) { int x = 0; int y = 0 for (int z = 0; z < 5; z++) { if((++x >2)||(++y ...
5 votes
206
How will you perform asymptotic comparison of the following three functions:​1. $\log{n}$,2. $(\log{n})^c$ and3. $\sqrt{n}$Obviously $\log{n} < (\log{n})^c$. But where ...
13 votes
207
In 8085 microprocessor, the ISR for handling trap interrupt is at which location?$3CH$$34H$$74H$$24H$
3 votes
208
//First Case char *p, q[100]; p = "Hello"; //1 q = "Hello"; //2 //Second Case char *p, q[100]; scanf("%s",p); //1 scanf("%s",q); //2In the first case, 1st works but 2nd d...
5 votes
210
3 votes
211
#include<stdio.h int main() { char arr[10]; memset(arr,0,sizeof(arr)); gets(arr); printf("\n The buffer entered is [%s]\n",arr); return 0; }
5 votes
214
1, 10, 33, 76, _____?
6 votes
215
5 votes
216
void f(int n){ if(n <= 1){ printf("%d", n); } else{ f(n/2); printf("%d", n%2); } }
6 votes
223
3 votes
224
Consider the following sentences :1. Static allocation binding do not change at run time2. Heap Allocation allocate and deallocate at run timeWhich of the above is true ?...
7 votes
225
I have seen questions about Radix Sort but not about bucket sort and Counting sort and hence my doubt
6 votes
226
System programs such as Compiler are designed so that they are1) Recursive2) Serially usable3) Non reusable4) ReenterablePlease provide explanation too
5 votes
230
The regular expression 0*(10*)* denotes the same set as(A) (1*0)*1*(B) 0 + (0 + 10)*(C) (0 + 1)* 10(0 + 1)*(D) none of these