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

#781
904
views
1 answers
0 votes
Gateforum Test Series: Programming & DS - Programming In C
User Avatar
#782
456
views
0 answers
0 votes
class problem
What is the minimum runtime to reverse a doubly linked list?answer given O(n) . shouldn't it be O(1) ?
User Avatar
#783
456
views
0 answers
0 votes
#geeks_quiz_datastructure
Consider the following list of the integer:19, 23, 40, 32, 91, 25, 100, 36Sort this list in increasing order using insertion sort and determine the number of ... .B7, 7, 14 respectively.C8, 7, 12 respectively.D8, 14, 7 respectively.
User Avatar
#784
270
views
0 answers
0 votes
homework
Consider the following function:int unknown(int n){ int i, j, k=0; for (i=n/2; i<=n; i++) for (j=2; j<=n; j=j*2) k = k + n/2; return (k); }The return value of the function is ?answer given is n^2 log n
User Avatar
#785
330
views
0 answers
0 votes
#Self-doubt
The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is:a) O(logn)b)O(n)c)O(1)d)O(log*n)
User Avatar
#786
246
views
1 answers
0 votes
drdo 2013
let A(1:8, -5:5, -10:5) be a three dimentional arrey. how many elements are there in the arrey A
User Avatar
#787
192
views
0 answers
0 votes
ibps2015
the scope of a variable is1. the range of values that can be assigned to a variable2. the program area is which the variable is accessible3. the maximum number of characters that can be allowed in the name of variable4. both 1 and 2
User Avatar
#788
619
views
0 answers
0 votes
GATEBOOK_DSA5_7
Which of the following provides a lower bound on the number of comparisons needed to find the kth largest element in an array of n integer elements?(A) n ∗ k (B) n + k − log n (C) min (n + k − 1, 2(n − k + 1)) (D) n − 1 + min (k − 1, n − k)
User Avatar
#789
322
views
1 answers
1 votes
GATEBOOK_DSA5_6
Narendra is traveling from point A to point B and there are n toll posts along the way. Before starting the journey, Narendra is given, for each ... has been solved using Dijkstra using fibonacci heaps?Am I thinking in correct direction?
User Avatar
#790
308
views
2 answers
0 votes
ibps2014
the run time for traversing all the nodes of a binary search tree with n nodes and printing them in an order is1. o (n log n)2. o (n)3. o(sqrt(n))4. o (log n)
User Avatar
#791
1.8k
views
1 answers
0 votes
ibps 2014
if n elements are sorted in a binary search tree .what would be the asymptotic complexity to search a key in the tree.a. o(1)b. 0(log n)c. o(n)d. o(n log n)
User Avatar
#792
453
views
0 answers
0 votes
programming
#include<stdio.h> int(*foo())[3] { static int a[3]={1,2,3}; printf("%d",*a); return &a; } int main() { static int (*p)[3]; ... p+2)); return 0; } i try to make picture representation i think this is wrong please make correct
User Avatar
#793
517
views
1 answers
0 votes
made easy test series
what will be the output?
User Avatar
#794
140
views
0 answers
0 votes
Vgate
State true or false:S1: The depth of a breadth-first search tree on an undirected graph G = (V, E) from an arbitrary vertex v ∈ V is the diameter of the graph G. ( ... smallest d such that every pair of vertices s and t have δ(s, t) ≤ d.)
User Avatar
#795
148
views
0 answers
0 votes
GATEBOOK_DSA4_17
If Radix sort is used to sort an array of n integers which are in the range ,where d is some function of input size, the time taken would be?(A) ( ... pass where k represents the range of input numbers.I am unable to solve this.Please help.
User Avatar
#796
742
views
2 answers
2 votes
DS Made easy
User Avatar
#797
1.4k
views
1 answers
0 votes
Parameter Passing
Predict the Output for both the snippets for the following:1. Call by Value2. Call by Reference3. Call by Need4. Call by Name5. Call by value Result/Call by value Return(Copy Restore)6. Call by Text
User Avatar
#798
1.2k
views
1 answers
2 votes
GATEBOOK_DSA4_2
In which of the cases shown below, Binary search can not always be applied for searching(A) Hierarchical data record (B) Internet Domain name conversion (C) Searching ... D) is okay when the array is not sorted.But what about other options?
User Avatar
#799
993
views
0 answers
3 votes
GATEBOOK-DSA4_8
Consider a sorted array A of n integer elements, A[0]...A[n − 1].A search operation is to be performed on this array using .Binary search algorithm. If the ... This is my answer.But it matches none of the options. Where I went wrong?
User Avatar
#800
294
views
0 answers
0 votes
series test -Testbook
int main() { int x = -4; unsigned char z = 10; if (x > z) printf("x>z\n"); else printf("x<z\n"); return 0; }
User Avatar
Page: