Time Left - 05:00 mins
ISRO Exam CS 2017 Daily Quiz -3 (Programming and Data Structure )
Attempt now to get your rank among 751 students!
Question 1
The number of ways in which the numbers 1, 2, 3, 4, 5, 6, 7 can be inserted in an empty binary search tree, such that the resulting tree has height 6, is _____.
Note: The height of a tree with a single node is 0.
Note: The height of a tree with a single node is 0.
Question 2
void count (int n) { static int d=1; printf ("%d",n); printf ("%d",d); d++; if (n>1) count (n-1); printf ("%d",d); } void main(){ count (3); }
What will be the output of the following C program?
Question 3
Consider the following function.
void f (int n)
{
if (n < 0) return;
else
{
print (n);
f (n – 2);
print (n);
f (n – 1);
}
}
Let f(n) be the number of values printed. What is the number of values printed by above function?
void f (int n)
{
if (n < 0) return;
else
{
print (n);
f (n – 2);
print (n);
f (n – 1);
}
}
Let f(n) be the number of values printed. What is the number of values printed by above function?
Question 4
How many minimum number of link (address) fields are modified to insert a new node in the middle of doubly linked list of 11 nodes?
Question 5
In compiler integer takes 4 bytes memory space.
int a[]={5,8,9,10,11,37,40};
void *p;
p=a;
p=p+4;
printf(“%d”,*(int*)p);
int a[]={5,8,9,10,11,37,40};
void *p;
p=a;
p=p+4;
printf(“%d”,*(int*)p);
- 751 attempts
- 4 upvotes
- 12 comments
Mar 31GATE & PSU CS
