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

Most viewed questions in Programming

59 votes
4 answers
33
GATE CSE 2014 Set 2 | Question: 40
Consider the following function. double f(double x){ if( abs(x*x - 3) < 0.01) return x; else return f(x/2 + 1.5/x); } Give a value $q$ (to $2$ decimals) such that $f(q)$ will return $q$:_____.
Consider the following function.double f(double x){ if( abs(x*x - 3) < 0.01) return x; else return f(x/2 + 1.5/x); }Give a value $q$ (to $2$ decimals) such that $f(q)$ wi...
User Avatar
1 votes
1 answer
34
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
2 answers
35
bubble sort
a machine took 200 sec to sort 200 names using bubble sort . in 800 sec it can approx sort how many names a)400 b)800 c)750 d)850
a machine took 200 sec to sort 200 names using bubble sort . in 800 sec it can approx sort how many namesa)400 b)800 c)750 d)850
User Avatar
5 votes
2 answers
36
Find output of the following C program
#include <stdio.h> int main() { int y = 2; int z = y +(y = 10); printf("%d\n", z); }
#include <stdio.h int main() { int y = 2; int z = y +(y = 10); printf("%d\n", z); }
User Avatar
3 votes
1 answer
38
Arithmetics in C
In C programming language x &ndash; = y + 1 ; means (1)x= x-y+1 (2)x=-x-y-1 (3)x=-x+y+1 (4)x= x-y-1
In C programming language x &ndash; = y + 1 ; means(1)x= x-y+1(2)x=-x-y-1(3)x=-x+y+1(4)x= x-y-1
User Avatar
2 votes
3 answers
43
The minimum number of temporary variables needed to swap the contents of two variables?
The minimum number of temporary variables needed to swap the contents of two variables is: (a) 1     (b) 2 (c) 3     (d) 0
The minimum number of temporary variables needed to swap the contents of two variables is:(a) 1     (b) 2(c) 3     (d) 0
User Avatar
48 votes
8 answers
45
GATE CSE 2015 Set 3 | Question: 7
Consider the following C program segment. # include <stdio.h> int main() { char s1[7] = "1234", *p; p = s1 + 2; *p = '0'; printf("%s", s1); } What will be printed by the program? $12$ $120400$ $1204$ $1034$
Consider the following C program segment.# include <stdio.h int main() { char s1[7] = "1234", *p; p = s1 + 2; *p = '0'; printf("%s", s1); }What will be printed by the pro...
User Avatar
0 votes
1 answer
47
Time complexity
Which of the following sorting algorithms yield approximately the same worst-case and average case running time behaviour is O(n log n)? A. Bubble sort and selection sort B. Heap sort and merge sort C. Quick sort and radix sort D.Tree sort and median-of-3-quick sort
Which of the following sorting algorithms yield approximately the same worst-case and average case running time behaviour is O(n log n)?A. Bubble sort and selection sortB...
User Avatar
6 votes
3 answers
48
ISRO2009-29
A one dimensional array A has indices 1....75. Each element is a string and takes up three memory words. The array is stored at location 1120 decimal. The starting address of A[49] is 1267 1164 1264 1169
A one dimensional array A has indices 1....75. Each element is a string and takes up three memory words. The array is stored at location 1120 decimal. The starting addres...
User Avatar
8 votes
3 answers
49
ISRO2007-15
Consider the following pseudo-code x:=1; i:=1; while (x <= 1000) begin x:=2^x; i:=i+1; end; What is the value of i at the end of the pseudo-code? 4 5 6 7
Consider the following pseudo-codex:=1; i:=1; while (x <= 1000) begin x:=2^x; i:=i+1; end;What is the value of i at the end of the pseudo-code?4567
User Avatar
5 votes
6 answers
50
column major in 3d array
Consider 3 dimensional Array A[90] [30] [40] stored in linear array in column major order. If the base address starts at 10. The location of A[20] [20] [30] is __________ . [Assume the first element is stored at A[1][1][1] and each element take 1 B].
Consider 3 dimensional Array A[90] [30] [40] stored in linear array in column major order. If the base address starts at 10. The location of A[20] [20] [30] is __________...
User Avatar
Page: