q.
recursive function
count(n){
if count<=1
then result = 1;
else
result = count(n-3) + count(n-1)
}
for count(6) ans is:
a. 3
b. 6
c. 9
d. 12
q
#define putchar(%f,c)
int c='d';
putchar(c);
what is the output?
a. ,b. some numbers
c. compiler error
d. segmentation error
...
User Profile
Collapse
-
q.
recursive function
count(n){
if count<=1
then result = 1;
else
result = count(n-3) + count(n-1)
}
for count(6) ans is:
a. 3
b. 6
c. 9
d. 12
q
#define putchar(%f,c)
int c='d';
putchar(c);
what is the output?
a. ,b. some numbers
c. compiler error
d. segmentation error
q
... -
Loop optimization and execution
th equestion goes like
Q1.
for(i=0;i<=50;, i++)
for(j=0;,j<=100 ,j++)
for(j=0;j<=100; ,j++)
for(i=0;i<=50,i ++)
for these type of loop which will be faster ??
options are
same
first
second
depends on s/w and h/w
Q2
#define putchar(%f,c)
int c='p'';
putchar(c);
what...
No activity results to display
Show More
Leave a comment: