Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Webpage
Programming in C.
Recursion.
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Most viewed questions in Programming and DS
2
votes
1
answer
1861
Made Easy Test Series:Programming in C
Consider the following $C$ implementation which when given $3$ numbers a,b,c as input, find the maximum of $3$ numbers $a,b,c.$ int kickstart(int a,int b,int c) { if(B1) return a; if(a>=b) return B2; return kickstart(c,a,b); } How the boxes filled up ... $a\geq c, B2:kickstart\left ( b,c,a \right );$ Is it $I) and II)$ or $I) and IV)$
Consider the following $C$ implementation which when given $3$ numbers a,b,c as input, find the maximum of $3$ numbers $a,b,c.$int kickstart(int a,int b,int c) { if(B1) r...
srestha
993
views
srestha
asked
May 19, 2019
Programming in C
made-easy-test-series
programming
programming-in-c
+
–
2
votes
1
answer
1862
Topological order
Will the topological order for acyclic graph through indegree Elimination method and DFS method be same. Please answer the above question ?
Will the topological order for acyclic graph through indegree Elimination method and DFS method be same.Please answer the above question ?
vishal burnwal
993
views
vishal burnwal
asked
Aug 26, 2018
3
votes
1
answer
1863
Program1
const int perplexed = 2; #define perplexed 3 main() { #ifdef perplexed #undef perplexed #define perplexed 4 #endif printf("%d",perplexed); } a. 0 b. 2 c. 4 d. none of the above
const int perplexed = 2; #define perplexed 3 main() { #ifdef perplexed #undef perplexed #define perplexed 4 #endif printf("%d",perplexed); }a. 0 b. 2 c. 4 d. none of the...
srestha
993
views
srestha
asked
Aug 14, 2016
Programming in C
programming-in-c
+
–
2
votes
4
answers
1864
NIELIT 2016 DEC Scientist B (IT) - Section B: 60
How will you free the allocated memory? remove(var-name) free(var-name) delete(var-name) dalloc(var-name)
How will you free the allocated memory?remove(var-name)free(var-name)delete(var-name)dalloc(var-name)
admin
992
views
admin
asked
Mar 31, 2020
Programming in C
nielit2016dec-scientistb-it
programming-in-c
dynamic-scoping
+
–
0
votes
1
answer
1865
Data structure used in TSP
Mayurk
992
views
Mayurk
asked
Feb 3, 2016
Programming in C
data-structures
+
–
0
votes
2
answers
1866
Explain
Use of triple pointer ?
Use of triple pointer ?
mithilesh kumar 1
991
views
mithilesh kumar 1
asked
May 24, 2016
0
votes
2
answers
1867
Extern in C programming
int main() { extern int a = 20; printf("%d",a); } //why this gives error but followig code is not extern int a =20; int main() { printf("%d",a); } //why this happens that first code gives error but second is not ? //please tell i am realy confused now
int main(){extern int a = 20;printf("%d",a); }//why this gives error but followig code is not extern int a =20;int main(){printf("%d",a); } //why this happens that first ...
ykrishnay
990
views
ykrishnay
asked
May 30, 2022
Programming in C
algorithms
programming-in-c
+
–
0
votes
2
answers
1868
AAI JE IT 2018
Suppose x and y are floating-point variables that have been assigned the values x=8.8 and y=3.5. what will be the value of the following expression? 2*x/3*y
Suppose x and y are floating-point variables that have been assigned the values x=8.8 and y=3.5. what will be the value of the following expression?2*x/3*y
aditi19
990
views
aditi19
asked
Dec 18, 2018
Programming in C
aai
expression-evaluation
+
–
0
votes
1
answer
1869
C variable declaration
What is the output of below code? #include<stdio.h> Int check(int); Int main() { Int k=35,z; z=check(k); printf("z=%d\n",z); return 0; } int check(int m) { int m; if(m>40) return (!m++); else return (!++m); }
What is the output of below code?#include<stdio.h Int check(int); Int main() { Int k=35,z; z=check(k); printf("z=%d\n",z); return 0; } int check(int m) { int m; if(m>40) ...
saumya mishra
987
views
saumya mishra
asked
May 21, 2018
Programming in C
programming-in-c
+
–
3
votes
1
answer
1870
Consider an array ‘A’ with 2m elements. The elements in odd position are sorted in non-increasing order that
Consider an array ‘A’ with 2m elements. The elements in odd position are sorted in non-increasing order that is A >= A[3] >= A[5]......A[2m-1] The elements in even p...
Akriti sood
986
views
Akriti sood
asked
Dec 26, 2016
DS
algorithms
sorting
graph-theory
+
–
4
votes
3
answers
1871
Made Easy Test Series:Programming(FLT4)
#include<stdio.h> #include<iostream> int bar(int m, int n){ if(m==0)return n; if(n==0)return m; return bar(n%m,m); } int foo(int m,int n){ return(m*n/bar(m,n)); } int main(){ int x=foo(1000,1500); printf("%d",x); return 0; } Output of the program is ___________
#include<stdio.h #include<iostream int bar(int m, int n){ if(m==0)return n; if(n==0)return m; return bar(n%m,m); } int foo(int m,int n){ return(m*n/bar(m,n)); } int main(...
srestha
985
views
srestha
asked
May 20, 2019
Programming in C
made-easy-test-series
programming
programming-in-c
+
–
0
votes
2
answers
1872
C programming
a=4 and b=3 printf("%d",a+++b); output.?? My doubt is that we will read from left as a++ or as ++b.
a=4 and b=3printf("%d",a+++b);output.??My doubt is that we will read from left as a++ or as ++b.
Ravi_1511
985
views
Ravi_1511
asked
Jan 23, 2017
Programming in C
programming-in-c
output
+
–
0
votes
1
answer
1873
Priority queue stack
How to implement Priority queue using stack?What will be time complexity for Enqueue and Dequeue operations? Edit:- Updated the question clearly
How to implement Priority queue using stack?What will be time complexity for Enqueue and Dequeue operations?Edit:- Updated the question clearly
rahul sharma 5
985
views
rahul sharma 5
asked
Dec 17, 2016
Programming in C
data-structures
priority-queue
test-series
+
–
4
votes
1
answer
1874
C programming - Pointers
Rohan Mundhey
985
views
Rohan Mundhey
asked
Nov 5, 2016
2
votes
1
answer
1875
How to draw a Binary tree
LoveCS
984
views
LoveCS
asked
Dec 5, 2017
DS
data-structures
binary-tree
+
–
2
votes
2
answers
1876
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 20
The number of possible binary trees with $4$ nodes is $12$ $13$ $14$ $15$
The number of possible binary trees with $4$ nodes is$12$$13$$14$$15$
admin
983
views
admin
asked
Apr 1, 2020
DS
nielit2017oct-assistanta-it
data-structures
binary-tree
+
–
0
votes
1
answer
1877
c doubt
is there any operator in c which is context dependent?????????????/
is there any operator in c which is context dependent?????????????/
akankshadewangan24
983
views
akankshadewangan24
asked
Apr 20, 2017
DS
programming-in-c
+
–
1
votes
2
answers
1878
MadeEasy Subject Test 2019: Programming & DS - Binary Tree
four vertices {A,B,C,D} is given which has only vertex D as a leaf total number of binary tree are possible when every binary tree has four node!
four vertices {A,B,C,D} is given which has only vertex D as a leaf total number of binary tree are possible when every binary tree has four node!
CHïntän ÞäTël
982
views
CHïntän ÞäTël
asked
Dec 10, 2018
DS
made-easy-test-series
data-structures
binary-tree
+
–
0
votes
1
answer
1879
C programming
#include<stdio.h> void fun(int *p,int *q) { p=q; *p=q; } int i=0,j=1; int main() { fun(&i,&j); printf("%d%d",i,j); } What will be the output of i and j in 16-bit C Compiler?
#include<stdio.h void fun(int *p,int *q) { p=q; *p=q; } int i=0,j=1; int main() { fun(&i,&j); printf("%d%d",i,j); }What will be the output of i and j in 16-bit C Compiler...
Mr khan 3
982
views
Mr khan 3
asked
Nov 3, 2018
Programming in C
programming-in-c
output
programming
pointers
+
–
0
votes
1
answer
1880
BFS Traversal
Maximum number of BFS Traversal Possible on BST of height 3 is ..........
Maximum number of BFS Traversal Possible on BST of height 3 is ..........
Na462
981
views
Na462
asked
Oct 21, 2018
Programming in C
breadth-first-search
algorithms
data-structures
+
–
Page:
« prev
1
...
89
90
91
92
93
94
95
96
97
98
99
...
309
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register