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
Hot questions in Programming and DS
1
votes
1
answer
4891
..........
Rohan Mundhey
179
views
Rohan Mundhey
asked
Nov 5, 2016
0
votes
1
answer
4892
C code
Rohan Mundhey
223
views
Rohan Mundhey
asked
Nov 6, 2016
1
votes
1
answer
4893
.........
Rohan Mundhey
164
views
Rohan Mundhey
asked
Nov 5, 2016
0
votes
2
answers
4894
GATE Overflow | Data Structures | Test 1 | Question: 3
Which of the following permutation can be obtained in the output (in the same order) using a stack assuming that the input is the sequence $1, 2, 3, 4$ in that order? 3, 4, 1, 2 4, 3, 1, 2 1, 2, 3, 4 none
Which of the following permutation can be obtained in the output (in the same order) using a stack assuming that the input is the sequence $1, 2, 3, 4$ in that order?3, 4...
Arjun
481
views
Arjun
asked
Oct 10, 2016
DS
go-ds-1
data-structures
stack
easy
+
–
1
votes
2
answers
4895
How is a stack implemented by a priority queue ?
A priority queue Q is used to implement a stack S that stores characters .PUSH(C) is implemented as Insert(Q,C,K) where K is an appropriate integer key chosen by the implementation .POP is implementd as DELETEMIN(Q) . For a sequence of PUSH ... case , while this element would be at the bottom of the stack so then how will I be able to do this ?
A priority queue Q is used to implement a stack S that stores characters .PUSH(C) is implemented as Insert(Q,C,K) where K is an appropriate integer key chosen by the i...
radha gogia
2.6k
views
radha gogia
asked
Sep 26, 2015
DS
data-structures
+
–
0
votes
2
answers
4896
GATE Overflow | Data Structures | Test 1 | Question: 6
In an administrative office it is required to keep track of the application requests. An applicant can push his application forward by paying extra money. What would be an appropraite datastructure for storing the applications? Stack Queue Linked Lists Priority Queue
In an administrative office it is required to keep track of the application requests. An applicant can push his application forward by paying extra money. What would be a...
Arjun
352
views
Arjun
asked
Oct 10, 2016
DS
go-ds-1
data-structures
+
–
0
votes
0
answers
4897
c programming
Consider the following C function definition: int Trial (int a, int b, int c) { if ((a > = b) && (c < b)) return b; else if (a > = b) return Trial (a,c,b); else return Trial (b,a,c); } The function Trial: (a) Finds the maximum ... an answer if a,b,c are distinct ,but if for example all the no. are same it will fall into an infinite loop ,The answer given in book is c.
Consider the following C function definition:int Trial (int a, int b, int c) { if ((a = b) && (c < b)) return b; else if (a = b) return Trial (a,c,b); else return Trial...
anshul namdeo
657
views
anshul namdeo
asked
Oct 12, 2016
1
votes
0
answers
4898
.......
Rohan Mundhey
209
views
Rohan Mundhey
asked
Nov 5, 2016
0
votes
1
answer
4899
Output
What will be output of the following C code void main( ) { static int main; int a; a = value(main); printf(“%d”, a); } int value(int val2) { val2++; return val2; }
What will be output of the following C codevoid main( ){static int main;int a;a = value(main);printf(“%d”, a);}int value(int val2){val2++;return val2;}
Rohan Mundhey
282
views
Rohan Mundhey
asked
Nov 6, 2016
–3
votes
1
answer
4900
Ace Test Series ----
What does this question mean?
What does this question mean?
Shivam Chauhan
382
views
Shivam Chauhan
asked
Nov 14, 2016
Programming in C
test-series
+
–
0
votes
1
answer
4901
Pointers Question
Pointers in C-programming are useful to 1.Handle data tables efficiently. 2.Reduce the length of a program. 3.Reduce the complexity of a program. Which of the above statements are correct? a) 1 and 2 only b) 1,2 and 3 c) 2 and 3 only d) 1 and 3 only
Pointers in C-programming are useful to1.Handle data tables efficiently.2.Reduce the length of a program.3.Reduce the complexity of a program.Which of the above statement...
bhupalreddy
2.2k
views
bhupalreddy
asked
May 28, 2016
DS
ies
question
+
–
0
votes
1
answer
4902
FUNCTION
Rohan Mundhey
185
views
Rohan Mundhey
asked
Nov 6, 2016
2
votes
1
answer
4903
Kerala PSC AP exam
int main() { int *r2; void abc(int **); abc(&r2); printf("%d",*r2); } void abc(int **r3) { int r1=5; /* add statements here */ } Which statement is added to the above program such that the address of r1 gets stored in r2? A) *r2 = &r1; B)*r1 = &r3; C) *r3 = &r1; D) None of these
int main() { int *r2; void abc(int ); abc(&r2); printf("%d",*r2); } void abc(int r3) { int r1=5; /* add statements here */ }Which statement is added to the above progra...
Sankaranarayanan P.N
815
views
Sankaranarayanan P.N
asked
Sep 28, 2016
Programming in C
programming-in-c
pointers
+
–
0
votes
0
answers
4904
C CODE
Rohan Mundhey
301
views
Rohan Mundhey
asked
Nov 6, 2016
2
votes
3
answers
4905
Data Strucutre Test
Rahul Jain25
427
views
Rahul Jain25
asked
Oct 6, 2016
Programming in C
data-structures
depth-first-search
+
–
–2
votes
1
answer
4906
FUNCTION
Rohan Mundhey
324
views
Rohan Mundhey
asked
Nov 6, 2016
0
votes
2
answers
4907
Postfix evaluation
The following post-fix expression with single digit operands is evaluated using stack, $16\;2\;4\;\wedge \; / \;4\;3\;*\;+\;6\;2\;*\;-$ Note that $\wedge$ is the exponential operator. What is the maximum height of the stack and the final value of post-fix evaluation respectively are a. $3,\;1$ b. $4,\;1$ c. $3,\;12$ d. $2,\;1$
The following post-fix expression with single digit operands is evaluated using stack, $16\;2\;4\;\wedge \; / \;4\;3\;*\;+\;6\;2\;*\;-$Note that $\wed...
tiger
5.3k
views
tiger
asked
Dec 15, 2015
DS
infix-prefix
data-structures
+
–
1
votes
1
answer
4908
avl tree
what is the time complexity of creating an avl tree??????
what is the time complexity of creating an avl tree??????
Rajnish Kumar
538
views
Rajnish Kumar
asked
Oct 1, 2016
DS
data-structures
+
–
0
votes
1
answer
4909
random number function
Sanjay Sharma
184
views
Sanjay Sharma
asked
Nov 4, 2016
0
votes
1
answer
4910
GATE Overflow | Data Structures | Test 1 | Question: 4
The postfix expression for the infix expression $A + B*C/D +E$ is AB+*CD/E+ ABC*D/+E+ AB+C*D/E+ A+*BCD/E+
The postfix expression for the infix expression$$A + B*C/D +E$$isAB+*CD/E+ABC*D/+E+AB+C*D/E+A+*BCD/E+
Arjun
404
views
Arjun
asked
Oct 10, 2016
DS
go-ds-1
data-structures
stack
infix-prefix
+
–
Page:
« prev
1
...
240
241
242
243
244
245
246
247
248
249
250
...
309
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register