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
Recent questions in Programming and DS
0
votes
1
answer
2441
M.E test
Consider the following C program? The output of above program, when ‘short int take ‘2 B’ and character take 1 B to represent _________. (Assume memory storage follows Little Endian architecture).
Consider the following C program?The output of above program, when ‘short int take ‘2 B’ and character take 1 B to represent _________. (Assume memory storage follo...
Abhinav Gupta
309
views
Abhinav Gupta
asked
Dec 15, 2017
0
votes
0
answers
2442
Output in C
What is the output of following program? main ( ) { union a { int i; char ch[z]; } union a,u; u∙i=256 printf (%d%d%d,u∙i,u∙ch[0],u∙ch[1] ); } 255 1 0 256 0 1 Explanation: In union all elements refer to the same slot of memory. Thus in ▁(union a) if 2 bytes say 4501 & 4502 ... 0] refers to 4501 & ch[1], to 4502. 256 1 0 255 0 1 How are they deciding u.ch[0] = 0 or u.ch[1] =1 ????
What is the output of following program?main ( ){union a { int i; char ch[z]; }union a,u;u∙i=256 printf (%d%d%d,u∙i,u∙ch[0],u∙ch ); } 255 1 0 256 0 1Ex...
atul_21
219
views
atul_21
asked
Dec 15, 2017
0
votes
0
answers
2443
C programming
main { int i; printf ( Hellow \n ); For(i=1; j<=10; i++) main ( ); } What is the o/p of the following program? Hellow 10 time Endless execution of code & printing Hellow continuously Hellow 9 times Compiler error In the loop ,variable ' ... error. Right??? otherwise answer wud be option 2. but given key is 2 only .Are they ignoring 'j' or is it typing mistake?
main { int i; printf (“Hellow \n”); For(i=1; j<=10; i++) main ( );}What is the o/p of the following program?Hellow 10 time Endless execution of code & print...
atul_21
291
views
atul_21
asked
Dec 15, 2017
3
votes
1
answer
2444
Number of BFS traversals.
Maximum number of BFS traversals possible on a binary tree with height 3 ?
Maximum number of BFS traversals possible on a binary tree with height 3 ?
Rajesh R
3.4k
views
Rajesh R
asked
Dec 15, 2017
Programming in C
data-structures
+
–
0
votes
1
answer
2445
Please Solve this Q
kallu singh
258
views
kallu singh
asked
Dec 15, 2017
0
votes
1
answer
2446
How to Solve This Q
kallu singh
387
views
kallu singh
asked
Dec 14, 2017
Programming in C
programming-in-c
recursion
+
–
0
votes
1
answer
2447
C-output
VS
1.0k
views
VS
asked
Dec 14, 2017
Programming in C
programming-in-c
bad-question
+
–
0
votes
1
answer
2448
AckerMann Function
Is there any shortcut to solve the AckerMann function ? e.g. I want to find the value of A(3,1) .https://en.wikipedia.org/wiki/Ackermann_function
Is there any shortcut to solve the AckerMann function ?e.g. I want to find the value of A(3,1).https://en.wikipedia.org/wiki/Ackermann_function
dragonball
848
views
dragonball
asked
Dec 14, 2017
Programming in C
data-structures
+
–
0
votes
0
answers
2449
me test
output ?
output ?
mohitbawankar
290
views
mohitbawankar
asked
Dec 14, 2017
1
votes
1
answer
2450
madeasy testseries
Inorder successor maybe a an ancestor of the node. this statement is true or false.
Inorder successor maybe a an ancestor of the node.this statement is true or false.
eyeamgj
267
views
eyeamgj
asked
Dec 13, 2017
1
votes
0
answers
2451
madeeasy test series
Consider the following statements: S1 : Implementation of stack using queue, deletion of second element from top of stack time complexity Ο(n), when insertion take Ο(1) time. S2 : In implementation of queue using stack, deletion of second element from front take Ο(1) time, when insertion take Ο(n) time.which one of the true? please explain s2 if anyone finds it true.
Consider the following statements:S1 : Implementation of stack using queue, deletion of second element from top of stack time complexity Ο(n), when insertion take Ο(1) ...
eyeamgj
408
views
eyeamgj
asked
Dec 13, 2017
0
votes
0
answers
2452
programming
void printTwoNumbers( int k ) { if (k == 0) return; printf ( "%d ", k ); printTwoNumbers( k - 1 ); printf( “%d” , k ); } Void main() { printTwoNumbers(3); } What is printed as a result of the call printTwoNumbers(3)?
void printTwoNumbers( int k ) { if (k == 0) return; printf ( "%d ", k ); printTwoNumbers( k - 1 ); printf( “%d” , k );}Void main(){printTwoNumbers(3);}What i...
mohitbawankar
287
views
mohitbawankar
asked
Dec 13, 2017
0
votes
2
answers
2453
self doubt
Max no. of node in k-array tree when height 'h' is given The number of internal nodes in 3-ary tree of height 4 is: ___ 40 or 121 which one is right?
Max no. of node in k-array tree when height 'h' is given The number of internal nodes in 3-ary tree of height 4 is: ___40 or 121 which one is right?
mohitbawankar
376
views
mohitbawankar
asked
Dec 12, 2017
0
votes
1
answer
2454
Queue
Consider the following statements: S1 : Implementation of stack using queue, deletion of second element from top of stack time complexity Ο(n), when insertion take Ο(1) time. S2 : In implementation of queue using stack, deletion of second element from front take Ο(1) time, when insertion take Ο(n) time. Why both statements are correct
Consider the following statements:S1 : Implementation of stack using queue, deletion of second element from top of stack time complexity Ο(n), when insertion take Ο(1) ...
Shivi rao
929
views
Shivi rao
asked
Dec 12, 2017
Programming in C
queue
data-structures
+
–
1
votes
1
answer
2455
MadeEasy Test Series: Programming & DS - Stack
Options are TI==(P/Q*i-1) Ti==(P/Q*i+1) Ti==(P/Q*(i-1)-1) Ti==(P/Q*(i+1)-1)
Options areTI==(P/Q*i-1)Ti==(P/Q*i+1)Ti==(P/Q*(i-1)-1)Ti==(P/Q*(i+1)-1)
shivangi5
675
views
shivangi5
asked
Dec 12, 2017
Programming in C
made-easy-test-series
data-structures
stack
array
+
–
0
votes
0
answers
2456
Test Series
Kiran Karwa
595
views
Kiran Karwa
asked
Dec 12, 2017
1
votes
0
answers
2457
GATE IT 2007 | Question: 36 with modification
int i ; program main () { int j = 60; i = 50; call f (i, j); print i, j; } procedure f (x, y) { i = 100; x = 10; y = y + i ; } this is already discussed https://gateoverflow.in/3466/gate2007-it-33 but what if i was redeclared and assigned value 100 in procedure function eg ; int i = 100; then a local var i will be created ?
int i ; program main () { int j = 60; i = 50; call f (i, j); print i, j; } procedure f (x, y) { i = 100; x = 10; y = y + i ; }this is already discussed https://gateoverfl...
A_i_$_h
472
views
A_i_$_h
asked
Dec 12, 2017
1
votes
1
answer
2458
c programming
main( ) { double x, d = 5.0; int y ; x = d * (x = 2.5/d); printf(“x=%lf\n”,x); x = d*(y=(int)2.5+1.5); printf("x=%lf y=%d\n",x,y); } What is output of above program?
main( ){double x, d = 5.0;int y ;x = d * (x = 2.5/d);printf(“x=%lf\n”,x);x = d*(y=(int)2.5+1.5);printf("x=%lf y=%d\n",x,y);}What is output of above program?
mohitbawankar
257
views
mohitbawankar
asked
Dec 12, 2017
1
votes
0
answers
2459
gantt chart for this with round robin time quantum = 1 ,provided my answer in comment plz check is it right /?
sumit goyal 1
1.2k
views
sumit goyal 1
asked
Dec 12, 2017
0
votes
0
answers
2460
Gatebook test
Consider the following code. int a = 1; int b = 1; Function foo() { print(a); } Function bar(int x, int y){ int a = 0; foo() ; x = 0 ; b = b-y; r = Y+1; } Function foobar() { int r = 1 ; bar(r,b); print(b); print(r); ... So how will the function bar( int x,int y) access the variable 'r'?..it is local to fooBar()..i think this will throw compilation error..can anyone verify.
Consider the following code. int a = 1;int b = 1;Function foo() {print(a); }Function bar(int x, int y){int a = 0;foo() ;x = 0 ;b = b-y;r = Y+1;}Function foobar() {int r =...
Tridhara Chakrabarti
288
views
Tridhara Chakrabarti
asked
Dec 12, 2017
Programming in C
scoping-rule
programming-in-c
test-series
+
–
Page:
« prev
1
...
118
119
120
121
122
123
124
125
126
127
128
...
310
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register