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{2024-1}&\textbf{2024-2}&\textbf{2023}& \textbf{2022}&\textbf{2021-1}&\textbf{2021-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count} & 2&2&1&1 &0&2&0&1.33&2
\\\hline\textbf{2 Marks Count} &1&1&0& 2&2&2&0&1.33&2
\\\hline\textbf{Total Marks} &4&4&1& 5&4&6&\bf{1}&\bf{4}&\bf{6}\\\hline
\end{array}}}$$

Filter

Recent questions in Programming

#1261
430
views
0 answers
0 votes
sizeof() operrator
#include <stdio.h>int main(){ int a=2; int b=4; double c; printf("%d",sizeof(c=a+b)); }In the above program, sizeof () operator will not evaluate the expression passed. But how it will return the size of double
User Avatar
#1262
376
views
1 answers
0 votes
Finding Min and Max keys
The minimum and maximum number of keys in the internal nodes of B-r with order 4 is:(a) 1, 3(b) 2, 4(c) 1, 4(d) 2, 3
User Avatar
#1263
1.3k
views
1 answers
0 votes
Output of printf
What is the output???
User Avatar
#1264
134
views
0 answers
0 votes
Integer in c
User Avatar
#1265
391
views
2 answers
0 votes
Modulous operator
User Avatar
#1266
173
views
0 answers
–1 votes
Printf
User Avatar
#1267
1.7k
views
1 answers
1 votes
Size of operator
#include<stdio.h> int main(void) { printf("bytes occupied by '7' = %d\n", sizeof('7')); printf("bytes occupied by 7 = %d\n", sizeof(7)); printf("bytes occupied by 7.0 = %d\n", sizeof(7.0)); return 0; }
User Avatar
#1268
641
views
0 answers
0 votes
C Programming MACROS
Can someone explain how the output is derived for the second printf statement.I have not understood how the value of x changed to 13 instead of 10. Detailed step by step explanation please. ... n",x); x=g(x,x+1); printf("%d",x); return 0; }
User Avatar
#1269
300
views
0 answers
0 votes
Better Algorithm for aggregating data from LDAP Systems
This question is not related to GATE, but certainly would help you to grill your mind to come up with a better approach.. Feel free to comment if ... dependency with other downstream systems.Is there a better approach to achieve the same ?
User Avatar
#1270
371
views
4 answers
0 votes
Why b is not decrementing ?
main(){int a = 1; int b = 1; int c = a || b--; printf("a = %d b=%d\n",a,b); return 0;}
User Avatar
#1271
507
views
1 answers
0 votes
Binary Tree
How to generate post order array from given in order array [8,6,9,4,7,2,5] ?
User Avatar
#1272
606
views
1 answers
0 votes
gfg C pointer Basic
Please explain solution in brief . #include <stdio.h> void f(char**); int main() { char *argv[] = { "ab", "cd", "ef", "gh", "ij", "kl" }; f(argv); return 0; } void f(char **p ... -1]; printf("%s\n", t); }A] ab B] cd C] ef D] gh
User Avatar
#1273
536
views
2 answers
0 votes
gfg c pointer basic
What changes must be done for printing value 5. #include <stdio.h> int main() { int var; /*Suppose address of var is 2000 */ void *ptr = &var; *ptr = 5; printf("var=%d and *ptr=%d",var,*ptr); return 0; }
User Avatar
#1274
320
views
0 answers
0 votes
Finding diameter of Binary Tree
How do we find the diameter of a Binary tree?I have come to below algorithm. Please let me know if it works(1)Use BFS on root's left subtree to ... number of nodes that appear before our node2 appears. This count will give us the diameter.
User Avatar
#1275
529
views
1 answers
1 votes
Finding deepest node of a binary tree.
We want to find an algorithm for finding the deepest node of a binary tree.My idea is to use BFS (Breadth-first search) and while visiting each node ... that will give me node with the highest depth.Is my above-suggested algorithm correct?
User Avatar
#1276
327
views
1 answers
0 votes
Doubt
The number of times “MadeEasy” will be printed ________.
User Avatar
#1277
295
views
1 answers
0 votes
Doubt
Consider a stack is used to evaluate fully parenthesized arithmetic expression from left to right. Each opperand is placed on the stack and operators operate ... The minimum size of stack required to evaluate given expression is ________.
User Avatar
#1278
253
views
2 answers
0 votes
Doubt
Consider A be a 2-dimensional array declared as follows: A[15] [15] of integers. Assume each integer take 1B. The array stored in row major order and first element ... at location 1000, then the address of element a[10] [6] is ________ B.
User Avatar
#1279
3.4k
views
1 answers
0 votes
Data Structure Doubt
Which of the following is true?A . In a sorted array of n' distinct elements, deletion of an element take Ο(log n) timeB. In sorted array of n' ... unsorted array of n' distinct elements, insertion of an element take Ω(log n) time
User Avatar
#1280
173
views
0 answers
0 votes
self doubt
1)Please correct me if anything written in comment // is wrong 2) also tell me why why did ABC getdata()and ABC & getdata() both are true as return type#include<stdio. ... .getdata(); printf("%d\n",obj1.x); }Output:-66610[Finished in 0.1s]
User Avatar
Page: