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
1
votes
0
answers
2321
ACE test Series: Programming and DS-Programming
void find(int x){ static int i=10,y=0; y=y+i; for(i;i>0;i=i-10){ if(x!=0) find(x-1); else{ printf("%d",y); } } } What will be output printed for find(4)?
void find(int x){ static int i=10,y=0; y=y+i; for(i;i>0;i=i-10){ if(x!=0) find(x-1); else{ printf("%d",y); } } }What will be output printed for find(4)?
srestha
800
views
srestha
asked
Mar 6, 2019
Programming in C
programming-in-c
ace-test-series
programming
+
–
0
votes
3
answers
2322
what is output of program
int f(int); int main() { int b; b = f(20); printf("%d",b); return 0; } int f(int a){ a>10 ?return(20):return 10; }
int f(int); int main() { int b; b = f(20); printf("%d",b); return 0; } int f(int a){ a>10 ?return(20):return 10; }
indrajeet
800
views
indrajeet
asked
Feb 1, 2016
Programming in C
programming-in-c
+
–
1
votes
1
answer
2323
TIFR CSE 2021 | Part B | Question: 2
Let $L$ be a singly-linked list $X$ and $Y$ be additional pointer variables such that $X$ points to the first element of $L$ and $Y$ points to the last element of $L$. Which of the following operations cannot be done in time that is ... after the last element of $L$. Add an element before the first element of $L$. Interchange the first two elements of $L$.
Let $L$ be a singly-linked list $X$ and $Y$ be additional pointer variables such that $X$ points to the first element of $L$ and $Y$ points to the last element of $L$. Wh...
soujanyareddy13
799
views
soujanyareddy13
asked
Mar 25, 2021
DS
tifr2021
data-structures
linked-list
+
–
0
votes
1
answer
2324
Test series
Consider unsorted doubly linked list data structure containing n items. For decrease key operation a pointer is provided to the record on which the operation is performed. An algorithm performs the following operations on the list in this order: sqrt(n) insert operations, o(nlogn) decrease key and ... of all these operations put together? (a) O(n) (b) O(n2) (c) O(n2logn) (d) O(sqrt(n))
Consider unsorted doubly linked list data structure containing n items. For decrease key operation a pointer is provided to the record on which the operation is performed...
Somoshree Datta 5
799
views
Somoshree Datta 5
asked
Oct 22, 2018
DS
data-structures
linked-list
time-complexity
+
–
1
votes
2
answers
2325
CMI2017-A-09
Suppose we constructed the binary search tree shown below by starting with an empty tree and inserting one element at a time from an input sequence, without any rotations or other manipulations. Which of the following assertions about the order of elements in the input sequence $cannot$ be ... came after $12$ and $29$ came before $42$. $3$ came before $14$ and $16$ came before $28$.
Suppose we constructed the binary search tree shown below by starting with an empty tree and inserting one element at a time from an input sequence, without any rotations...
Tesla!
799
views
Tesla!
asked
Feb 4, 2018
DS
cmi2017
data-structures
binary-search-tree
+
–
0
votes
1
answer
2326
TOPIC - Infix to postfix and prefix conversion
Convert the following infix expression to postfix and prefix A^B^C^D
Convert the following infix expression to postfix and prefixA^B^C^D
akash28
798
views
akash28
asked
Feb 23, 2023
DS
infix-prefix
+
–
2
votes
3
answers
2327
ME Test series Question on AVL Tree
Shankar Kakde
798
views
Shankar Kakde
asked
Jan 19, 2019
DS
avl-tree
tree-traversal
made-easy-test-series
+
–
0
votes
1
answer
2328
C programming
What is the output of this program? int main(void) { int a = 10, b = 20, c = 30; printf(" %d..%d..%d ", a+b+c, (b = b*2), (c = c*2)); return 0; } (A) 60..40..60 (B) 110..40..60 (C) 110..20..30 (D) 60..20..30 does sequence point comes into picture here?
What is the output of this program?int main(void){int a = 10, b = 20, c = 30;printf(" %d..%d..%d ", a+b+c, (b = b*2), (c = c*2));return 0;}(A) 60..40..60(B) 110..40..60(C...
sushmita
798
views
sushmita
asked
Sep 29, 2018
Programming in C
programming-in-c
programming
pointers
+
–
3
votes
2
answers
2329
Inversions of array
Samujjal Das
798
views
Samujjal Das
asked
Dec 19, 2016
1
votes
1
answer
2330
Pointers
Which of the following is the proper keyword or function to allocate memory in C? A. new B. malloc C. create D. value
Which of the following is the proper keyword or function to allocate memory in C?A. newB. mallocC. createD. value
IITB2020
797
views
IITB2020
asked
Nov 24, 2018
1
votes
1
answer
2331
circular queue
pritigoya
797
views
pritigoya
asked
Sep 9, 2018
DS
data-structures
+
–
1
votes
1
answer
2332
returned value
Himanshu1
797
views
Himanshu1
asked
Dec 31, 2015
Programming in C
programming
recursion
+
–
1
votes
1
answer
2333
ISI2016-PCB-CS-1
Consider the array $A=[20,13,19,8,3,5,4]$ that represents a heap. Draw the heap after removing the element $20.$ List all the distinct integer keys $k$ such that, when $k$ is inserted in the Binary Search Tree of Figure $1,$ its height increases. Note that you are not allowed to insert an already existing key again. Justify your answer.
Consider the array $A=[20,13,19,8,3,5,4]$ that represents a heap. Draw the heap after removing the element $20.$List all the distinct integer keys $k$ such that, when $k$...
go_editor
795
views
go_editor
asked
Sep 18, 2018
DS
isi2016-pcb-cs
tree
binary-search-tree
descriptive
+
–
0
votes
1
answer
2334
binary search tree
Consider an empty binary search tree of height -1. We need to feel the following sequence of numbers in it: 11, 12, 13, 14, 15, 16, 17. The number of ways in which the numbers can be inserted in an empty binary search tree, such that the resulting tree has height 6, is _____________
Consider an empty binary search tree of height -1. We need to feel the following sequence of numbers in it: 11, 12, 13, 14, 15, 16, 17. The number of ways in which the nu...
poojasharma123
795
views
poojasharma123
asked
Jul 13, 2018
0
votes
0
answers
2335
GATE IT 2007 Tree Traversals
When searching for the key value 60 in a binary search tree, nodes containing the key values 10, 20, 40, 50, 70 80, 90 are traversed, not necessarily in the order given. How many different orders are possible in which these key values can occur on the search path from the root to the node containing the value 60? a) 35 b) 64 c) 128 d) 5040
When searching for the key value 60 in a binary search tree, nodes containing the key values 10, 20, 40, 50, 70 80, 90 are traversed, not necessarily in the order given. ...
parthbkgadoya
794
views
parthbkgadoya
asked
Jul 13, 2016
DS
binary-tree
data-structures
+
–
0
votes
1
answer
2336
Programming
Is there any error in statement *a++ ; // a is an integer pointer. If not please explain what will happen if a=a+1 happens at 1st step then we are left with *a; now what is the meaning of this ? would it give error regarding l-value?
Is there any error in statement *a++ ; // a is an integer pointer. If not please explain what will happen if a=a+1 happens at 1st step then we are left with *a; now ...
Hcas Hgnis
794
views
Hcas Hgnis
asked
Dec 1, 2014
Programming in C
programming
programming-in-c
+
–
3
votes
0
answers
2337
Recursion
The sum of all values printed by Rec (6) is _______.
The sum of all values printed by Rec (6) is _______.
Learner_jai
793
views
Learner_jai
asked
Dec 29, 2017
1
votes
3
answers
2338
AVL tree rotations
Parshu gate
793
views
Parshu gate
asked
Nov 28, 2017
DS
test-series
data-structures
avl-tree
+
–
0
votes
1
answer
2339
output of this c code
main() { int i=5,j=10; i=i&=j&&10; printf("%d %d",i,j); }
main() { int i=5,j=10; i=i&=j&&10; printf("%d %d",i,j); }
asu
793
views
asu
asked
May 15, 2016
0
votes
1
answer
2340
Website
int main() { int a = 10; cout<<a++; return 0; } (A) 10 (B) 11 (C) 12 (D) Not defined
int main(){int a = 10;cout<<a++;return 0;} (A) 10(B) 11(C) 12(D) Not defined
Jeetmoni saikia
792
views
Jeetmoni saikia
asked
Apr 12, 2023
Page:
« prev
1
...
112
113
114
115
116
117
118
119
120
121
122
...
310
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register