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

Recent questions in Programming

2 votes
0 answers
1561
Complexity of given program.
Consider the following C segment: main() { int sum = 0; for(int b=1; b<=n; b*=2) { for(int i=0; i<b; i++) { for(int j=0; j<n; j+=2) { sum += j; } for(int j=1; j<n; j*=2) { sum *= j; } } } } The complexity of above program is ____________.
Consider the following C segment:main() { int sum = 0; for(int b=1; b<=n; b*=2) { for(int i=0; i<b; i++) { for(int j=0; j<n; j+=2) { sum += j; } for(int j=1; j<n; j*=2) {...
User Avatar
3 votes
0 answers
1562
Self doubt
#include<stdio.h> extern int i; int main() { printf( "%d" , i); } int i; What will be the order of execution of this code (line by line)?
#include<stdio.h extern int i; int main() { printf( "%d" , i); } int i;What will be the order of execution of this code (line by line)?
User Avatar
2 votes
2 answers
1563
Algorithm - Extern Variable
extern int i; int i = 10; i = 5; int main() { printf("%d", i); return 0; } The output for the above code is _______
extern int i; int i = 10; i = 5; int main() { printf("%d", i); return 0; }The output for the above code is _______
User Avatar
6 votes
3 answers
1564
multidimensional aaray
39 ) Suppose a multidimensional array is declared as m(2:8,-4:1,6:10). If the base address is 200 and there are 4 words per memory location, then the address of A[5,-1,8] by using row order is ______.
39 ) Suppose a multidimensional array is declared as m(2:8,-4:1,6:10). If the base address is 200 and there are 4 words per memory location, then the address of A[5,-1,8]...
User Avatar
2 votes
0 answers
1566
programming in c
User Avatar
1 votes
0 answers
1568
Test series
User Avatar
2 votes
0 answers
1569
programming & DS
Which of the following is true? A When stack is implemented using two queues, then insertion will take O(1) time while deletion will take O(n) time. B When stack is implemented using linked list, then insertion and deletion will take O(1) time C Stack is used to implement breadth first search D Both (a) and (b)
Which of the following is true?AWhen stack is implemented using two queues, then insertion will take O(1) time while deletion will take O(n) time.BWhen stack is implement...
User Avatar
1 votes
1 answer
1570
programming &DS
User Avatar
1 votes
0 answers
1571
Doubt
Local static variables are stored in stack segment or data segment?
Local static variables are stored in stack segment or data segment?
User Avatar
1 votes
0 answers
1572
Programming
What is the term Binding Used in as as execution phase of a code segment...?
What is the term Binding Used in as as execution phase of a code segment...?
User Avatar
2 votes
0 answers
1573
hashing
User Avatar
2 votes
0 answers
1576
Doubt
# include <stdio.h> int main() { char *s1 = "1234", *p; p = s1 + 2; //*p = '0'; printf("%d", *p); } The above code prints 51, any idea why?
# include <stdio.h>int main(){ char *s1 = "1234", *p; p = s1 + 2; //*p = '0'; printf("%d", *p); } The above code prints 51, any idea why?
User Avatar
2 votes
0 answers
1577
Programming Question
User Avatar
5 votes
1 answer
1578
Balanced binary search tree
A balanced binary search tree of n nodes,the number of steps needed to find and remove the 9th largest element in the worst case? (Please mention the algorithm followed)
A balanced binary search tree of n nodes,the number of steps needed to find and remove the 9th largest element in the worst case?(Please mention the algorithm followed)
User Avatar
1 votes
1 answer
1579
Programming
Output is? With explanation
Output is? With explanation
User Avatar
2 votes
2 answers
1580
data structure
the number of inversions in (n,n-1,.........3,2,1) is n(n-1)/2 how??????????????????/
the number of inversions in (n,n-1,.........3,2,1)is n(n-1)/2how??????????????????/
User Avatar
Page: