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

0 votes
1 answer
3541
total possible BST with n nodes
total possible binary search trees with 3 nodes is: 14 15 6 none
total possible binary search trees with 3 nodes is:14 15 6 none
User Avatar
1 votes
2 answers
3542
Complexity
User Avatar
3 votes
2 answers
3543
Identify syntax error
Find the $C$ statement which has a syntax error. If (z) For (a, b, c) While (a, b) None of these.
Find the $C$ statement which has a syntax error.If (z)For (a, b, c)While (a, b)None of these.
User Avatar
1 votes
1 answer
3544
output
User Avatar
1 votes
1 answer
3545
returned value
User Avatar
5 votes
2 answers
3546
Pointers
Main() { int a[2][3][2]={{{2,4},{7,8},{3,4}}，{{2,2},{2,3},{3,4}}}; Printf("%u",a); Printf("%u",*a); Printf("%u",**a); Printf("%u",***a); Printf("%u",a+1); Printf("%u",*a+1); Printf("%u",**a+1); Printf("%u",***a+1); }
Main(){int a [3] ={{{2,4},{7,8},{3,4}}，{{2,2},{2,3},{3,4}}};Printf("%u",a);Printf("%u",*a);Printf("%u", a);Printf("%u", *a);Printf("%u",a+1);Printf("%u",*a+1);Printf("%...
User Avatar
2 votes
2 answers
3547
DataStructure
Which of the following data structures would programmer be least likely to use to implement an abstract data type that must include an efficient implementation of the operation " find the maximum"? Ordered array. Binary search. Heap. Ordered linked list.
Which of the following data structures would programmer be least likely to use to implement an abstract data type that must include an efficient implementation of the ope...
User Avatar
–2 votes
0 answers
3548
source code for building Hotel Management system in java
Source code for building Hotel Management system in java
Source code for building Hotel Management system in java
User Avatar
2 votes
2 answers
3549
MadeEasy Test Series: Programming & DS - Programming in C
Q.43 Consider the following C program. Which of the following represent the output of above program? 4,500 4,501 5,500 3,500
Q.43Consider the following C program.Which of the following represent the output of above program?4,5004,5015,5003,500
User Avatar
3 votes
1 answer
3550
stack
We want to reverse elements of stack using a queue. Suppose stack operations push and pop take 1 unit of time each and queue operations insert and delete take 2 units of time each. Assume n elements are there in the stack .The minimum time to reverse the stack is a) 4n units a) 6n units a) 8n units a) 9n units
We want to reverse elements of stack using a queue. Suppose stack operations push and pop take 1 unit of time each and queue operations insert and delete take 2 units of ...
User Avatar
1 votes
1 answer
3551
stack
Five nodes labeled 1,2,3,4,5 are used to construct different binary trees. How many such binary trees can be constructed whose preorder traversal is 1,2,3,4,5? Ans given is 42 but how??
Five nodes labeled 1,2,3,4,5 are used to construct different binary trees. How many such binary trees can be constructed whose preorder traversal is 1,2,3,4,5?Ans given i...
User Avatar
0 votes
1 answer
3552
Stack
In a stack (index from 1 to n) the command to access ith element from the top pf the stack S will be known as Peep(S,i). What is the condition to check for underflow on Peep. A)S[Top-i] <= 0 B)S[Top+i] <= 0 C)S[Top-i+1] <= 0 D)NONE
In a stack (index from 1 to n) the command to access ith element from the top pf the stack S will be known as Peep(S,i). What is the condition to check for underflow on P...
User Avatar
2 votes
2 answers
3553
Probability
In a hash table of size 6 currently the locations 0,2,4 and 5 are occupied. The probability of a new record going into location 1 with a hash function resolving collisions by linear probing is (assume uniform hashing) a)2/3 b)1/3 c)1 d) 1/6
In a hash table of size 6 currently the locations 0,2,4 and 5 are occupied. The probability of a new record going into location 1 with a hash function resolving collision...
User Avatar
1 votes
2 answers
3554
Please explain
Consider the following program fragment: char c= ‘a’ while (c++ ≤ ‘z’) putchar (xxx); if the required output is abcdefghijklmnopqrstuvwxyz then xxx should be : (a) c (b) c++ (c) c–1 (d) –c
Consider the following program fragment: char c= ‘a’ while (c++ ≤ ‘z’) putchar (xxx);if the required output is abcdefghijklmnopqrstuvwxyz then xxx should be: (a...
User Avatar
0 votes
2 answers
3555
Pointer
User Avatar
1 votes
2 answers
3556
ptr
User Avatar
0 votes
1 answer
3558
Find the error in program
the given ans is (d) but it will run forever as ch is character type and can have max value 255 and then it will be reset. also char would be implicitly typecasted to int so comparison is valid. why would it give compilation error
the given ans is (d) but it will run forever as ch is character type and can have max value 255 and then it will be reset. also char would be implicitly typecasted to int...
User Avatar
2 votes
1 answer
3560
programming
int x=0,i; for(i=0;i<10;i++) if(i%2&&x++) x=+2; what is the value of x.
int x=0,i;for(i=0;i<10;i++)if(i%2&&x++)x=+2;what is the value of x.
User Avatar
Page: