Register

Webpage

Programming in C. Recursion.

$$\scriptsize{\overset{{\large{\textbf{Mark Distribution in Previous GATE}}}}{\begin{array}{|c|c|c|c|c|c|c|c|}\hline
\textbf{Year} & \textbf{2022}&\textbf{2021-1}&\textbf{2021-2}&\textbf{2020}&\textbf{2019}&\textbf{2018}&\textbf{2017-1}&\textbf{2017-2}&\textbf{2016-1}&\textbf{2016-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} & 1 &0&2&1&2&2&1&2&2&1&0&1.4&2
\\\hline\textbf{2 Marks Count} & 2&2&2&1&3&3&4&4&2&2&1&2.5&4
\\\hline\textbf{Total Marks} & 5&4&6&3&8&8&9&10&6&5&\bf{4}&\bf{6.4}&\bf{10}\\\hline
\end{array}}}$$

Filter

Highest voted questions in Programming

1 votes
2 answers
1321
pseudo code
int zap(int n) { if (n<=1) then zap =1; else zap = zap(n-3)+zap(n-1); } then the call zap(6) gives the values of zap Give the proper explanation
int zap(int n){if (n<=1) then zap =1;else zap = zap(n-3)+zap(n-1);}then the call zap(6) gives the values of zapGive the proper explanation
User Avatar
1 votes
0 answers
1322
MCQs in computer science
What are the correct options?
What are the correct options?
User Avatar
1 votes
0 answers
1323
Let Us C- Q2.43
Output will be- int main(){ int a =0,b=1,c=3: *((a)?&b&:&a)=a ? b : c; printf("%d %d%d ", a,b,c); }
Output will be-int main(){ int a =0,b=1,c=3:*((a)?&b&:&a)=a ? b : c;printf("%d %d%d ", a,b,c);}
User Avatar
1 votes
0 answers
1324
Pointers
#include<stdio.h> int main() { char A[5][7][6]; char *p[5][7][6]; printf("%d\t", (unsigned)(A+1)-(unsigned)A); printf("%d", (unsigned)(p+1)-(unsigned)p); } What will be the output ?? 1. 42 ,42 2. 42,336 3. 336,42 4. 1,1
#include<stdio.h>int main(){char A[5][7][6];char *p[5][7][6];printf("%d\t", (unsigned)(A+1)-(unsigned)A);printf("%d", (unsigned)(p+1)-(unsigned)p);}What will be the outpu...
User Avatar
1 votes
2 answers
1325
Binary Tree Array Implementation
What must be the ideal size of array if the height of tree is ‘l’? a) 2l-1 b) l-1 c) l d) 2l
What must be the ideal size of array if the height of tree is ‘l’?a) 2l-1b) l-1c) ld) 2l
User Avatar
1 votes
1 answer
1326
Linked List
What kind of linked list is best to answer question like “What is the item at position n?” a) Singly linked list b) Doubly linked list c) Circular linked list d) Array implementation of linked list
What kind of linked list is best to answer question like “What is the item at position n?”a) Singly linked listb) Doubly linked listc) Circular linked listd) Array im...
User Avatar
1 votes
1 answer
1327
Binary Search Tree
8. What are the worst case and average case complexities of a binary search tree? a) O(n), O(n) b) O(logn), O(logn) c) O(logn), O(n) d) O(n), O(logn)
8. What are the worst case and average case complexities of a binary search tree?a) O(n), O(n)b) O(logn), O(logn)c) O(logn), O(n)d) O(n), O(logn)
User Avatar
1 votes
1 answer
1328
array
Consider a three dimensional array A[30][40][50], find the location of the array element A[5][6][7] , if the base address of array A is 150 and each element take 4 byte of memory.
Consider a three dimensional array A[30][40][50], find the location of the array element A[5][6][7] , if the base address of array A is 150 and each element take 4 byte...
User Avatar
1 votes
1 answer
1329
madeeasy test series
How many times made easy is printed? #include <stdio.h> int main() { c(4); return 0; } int c(int m){ if (m>0){ for(int i=1;i<3;i++){ c(m-i); c(m-i-1); printf("madeeasy") } } }
How many times made easy is printed?#include <stdio.h>int main() { c(4);return 0;}int c(int m){ if (m>0){ for(int i=1;i<3;i++){ c(m-i); ...
User Avatar
1 votes
0 answers
1330
gate 15 set-2
int fun(int n) { int x=1,k; if(n==1) return x; for(k=1;k<n;++k) x=x+fun(k)*fun(n-k) return x; } return value of fun(5)??? how to solve this using tree method approach???
int fun(int n){int x=1,k;if(n==1) return x;for(k=1;k<n;++k)x=x+fun(k)*fun(n-k)return x;}return value of fun(5)??? how to solve this using tree method approach???
User Avatar
1 votes
1 answer
1332
Programming
User Avatar
1 votes
0 answers
1333
Virtual gate
User Avatar
1 votes
0 answers
1334
Array and Pointer
#include <stdio.h> main() { int arr[5]; printf("%p,%p\n",arr,&arr); } How do both print the same address?
#include <stdio.h>main(){ int arr[5]; printf("%p,%p\n",arr,&arr);}How do both print the same address?
User Avatar
1 votes
1 answer
1335
Data Type (Programming)
#include <stdio.h> int main() { long int a = 0x7fffffff * 0x7fffffff; long int b = 0x7fffffff * 0x7fffffffl; printf("a = %ld, b = %ld\n", a, b); return 0; } What will be output if sizeof(int) is 4 and sizeof(long int) is 8.
#include <stdio.h int main() { long int a = 0x7fffffff * 0x7fffffff; long int b = 0x7fffffff * 0x7fffffffl; printf("a = %ld, b = %ld\n", a, b); return 0; }What will be ou...
User Avatar
1 votes
1 answer
1336
#Test_series
The height h of an AVL tree with n nodes lies in the interval: 1. log2(n+1) ≤ h < c log2(n+2)+b 2. log10(n) ≤ h < c log10(n+1)+b 3. log10(n+1) ≤ h < c log10(n+2)+b 4. log2(n) ≤ h < c log2(n+1)+b
The height h of an AVL tree with n nodes lies in the interval:1.log2(n+1) ≤ h < c log2(n+2)+b 2.log10(n) ≤ h < c log10(n+1)+b 3.log10(n+1) ≤ h < c log10(n+2)+b 4.lo...
User Avatar
1 votes
0 answers
1338
Testbook test
am i right ??
am i right ??
User Avatar
1 votes
1 answer
1339
self doubt
main() { int x=68; char y='D'; if (x!=y) printf("true"); else printf("false"); } the output is coming false. but why? according to me the base address is compared so answer should be true?
main(){int x=68;char y='D';if (x!=y)printf("true");else printf("false");}the output is coming false. but why?according to me the base address is compared so answer should...
User Avatar
Page: