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
211
Ace Test Series Data Structure Q9
Which data structure would be most appropriate to implement a collection of values with the following 3 characteristics Singly link list with head and tail pointer Doubly link list with only head pointer Binary tree Array
Which data structure would be most appropriate to implement a collection of values with the following 3 characteristicsSingly link list with head and tail pointerDoubly l...
Souvik33
870
views
Souvik33
asked
Nov 2, 2022
DS
data-structures
linked-list
test-series
stack
queue
+
–
2
votes
0
answers
212
igate test series
AVL tree is binary search tree with additional property that difference between height of left sub-tree and right sub-tree of any node can’t be more than 1 if n is the number of nodes in a AVL tree . The maximum value of n for which the difference between the minimum height and maximum height of AVL tree is <2 _________ ?
AVL tree is binary search tree with additional property that difference between height of left sub-tree and right sub-tree of any node can’t be more than 1 if n is the ...
jugnu1337
497
views
jugnu1337
asked
Nov 1, 2022
DS
i-gate-test-series
programming
binary-search-tree
avl-tree
+
–
1
votes
0
answers
213
Ace Academy Test Series Qn#7
A hash function h maps 16-bit inputs to 8 bit hash values. What is the largest k such that in any set of 1000 inputs, there are atleast k inputs that h maps to the same hash value? 3 4 10 64
A hash function h maps 16-bit inputs to 8 bit hash values. What is the largest k such that in any set of 1000 inputs, there are atleast k inputs that h maps to the same h...
Souvik33
405
views
Souvik33
asked
Oct 30, 2022
DS
ace-test-series
data-structures
hashing
pigeonhole-principle
discrete-mathematics
+
–
0
votes
0
answers
214
Ace Academy Test Series
A hash function h maps 16-bit inputs to 8 bit hash values. What is the largest k such that in any set of 1000 inputs, there are atleast k inputs that h maps to the same hash value? 3 4 10 64
A hash function h maps 16-bit inputs to 8 bit hash values. What is the largest k such that in any set of 1000 inputs, there are atleast k inputs that h maps to the same h...
Souvik33
335
views
Souvik33
asked
Oct 30, 2022
DS
ace-test-series
data-structures
hashing
pigeonhole-principle
discrete-mathematics
+
–
0
votes
1
answer
215
Self-Doubt: Stack Overflow in LinkedList
Can there be “Stack Overflow” in Linked list Implementation of stack? If Yes, how?
Can there be “Stack Overflow” in Linked list Implementation of stack? If Yes, how?
Abhrajyoti00
741
views
Abhrajyoti00
asked
Oct 29, 2022
DS
stack
data-structures
linked-list
+
–
–4
votes
2
answers
216
Data Structure- Tree & Graphs
*MSQ* The following figure depicts a a. A tree and only tree b. A tree with 3 nodes c. A graph (Since every tree is a graph) d. A graph and only graph
*MSQ*The following figure depicts a a. A tree and only treeb. A tree with 3 nodesc. A graph (Since every tree is a graph)d. A graph and only graph
Souvik33
637
views
Souvik33
asked
Oct 27, 2022
Programming in C
data-structures
tree
graph-theory
multiple-selects
normal
bad-question
+
–
0
votes
0
answers
217
Class P { void f(int i) { print(i); } } Class Q subclass of P { void f(int i) { print(2*i); } } Now consider the following program fragment: P x = new Q(); Q y = new Q(); P z = new Q(); x.f(1); ((P)y).f(1); z.f(1); Here ((P)y) denotes a typecast of y to P. The output produced by executing the above program fragment will be (A) 1 2 1 (B) 2 1 1 (C) 2 1 2 (D) 2 2 2
Jeetmoni saikia
297
views
Jeetmoni saikia
asked
Oct 16, 2022
Programming in C
programming-in-c
output
normal
+
–
0
votes
0
answers
218
made easy test series
Neelu Lalchandani
352
views
Neelu Lalchandani
asked
Oct 16, 2022
Programming in C
made-easy-test-series
programming-in-c
functions
+
–
1
votes
2
answers
219
Ace test series 2023
The return value of ace(4) is int ace(int a) { int x=1; static int k=1; if(a==1) return x; for(;k<a;++k) x=x+ace(k)*ace(a-k); return x; } A.15 B.4 C.10 D.Error
The return value of ace(4) is int ace(int a) { int x=1; static int k=1; if(a==1) return x; for(;k<a;++k) x=x+ace(k)*ace(a-k); return x; }A.15B.4C.10D.Error
Sazia Tabassum
594
views
Sazia Tabassum
asked
Oct 14, 2022
Programming in C
ace-test-series
programming-in-c
array
+
–
0
votes
1
answer
220
yashwant kanetkar chapter 5 A(F) 18th edition
i dont know why the answer is not coming for the following snippet. I COULD NOT UNDERSTAND EXPLAINATION IN YASHWANT KANETKAR BOOK int main() { float x=1.1; while(x==1.1) { printf(“%f\n”,x); x=x-0.1; } return0; }
i dont know why the answer is not coming for the following snippet. I COULD NOT UNDERSTAND EXPLAINATION IN YASHWANT KANETKAR BOOKint main(){float x=1.1;while(x==1.1){prin...
SHWETAV SUMAN
228
views
SHWETAV SUMAN
asked
Oct 14, 2022
Programming in C
programming-in-c
output
reference-book
+
–
0
votes
0
answers
221
Consider the following class definitions in a hypothetical Object Oriented language that supports inheritance and uses dynamic binding. The language should not be assumed to be either Java or C++, though the syntax is similar. Class P { void f(int i) { print(i); } } Class Q subclass of P { void f(int i) { print(2*i); } } Now consider the following program fragment: P x = new Q(); Q y = new Q(); P z = new Q(); x.f(1); ((P)y).f(1); z.f(1); Here ((P)y) denotes a typecast of y to P. The output produced by executing the above program fragment will be (A) 1 2 1 (B) 2 1 1 (C) 2 1 2 (D) 2 2 2
Jeetmoni saikia
593
views
Jeetmoni saikia
asked
Oct 10, 2022
Programming in C
programming
object-oriented-programming
+
–
1
votes
0
answers
222
AVL Trees
Given a skew tree what will be the time complexity to balance the tree? What will be the algorithm for this?
Given a skew tree what will be the time complexity to balance the tree? What will be the algorithm for this?
Chaitanya Kale
407
views
Chaitanya Kale
asked
Oct 9, 2022
Programming in C
avl-tree
data-structures
time-complexity
+
–
1
votes
1
answer
223
Programming Question
An object whose contents cannot be changed once the object is created is called: (a) Immutable object (b) Mutable object (c) Smart object (d) Rich object
An object whose contents cannot be changed once the object is created is called:(a) Immutable object(b) Mutable object(c) Smart object(d) Rich object
rsansiya111
377
views
rsansiya111
asked
Oct 7, 2022
Programming in C
java
object-oriented-programming
+
–
0
votes
1
answer
224
this similar question was discussed in GO classes C programming video lectures by (sachin mittal sir.)
i have typed the following code but when i executed it the solution was not according to my expectation.unsigned short int y= -9; int iy=y; printf(“%d”,iy); solutio...
SHWETAV SUMAN
328
views
SHWETAV SUMAN
asked
Oct 6, 2022
Programming in C
programming-in-c
+
–
0
votes
0
answers
225
Data Structure
Not able to understand the last option.
Not able to understand the last option.
Overflow04
303
views
Overflow04
asked
Oct 2, 2022
DS
data-structures
binary-search-tree
made-easy-test-series
+
–
0
votes
1
answer
226
Programming
I am getting 5 as output, but the answer is 4, please verify
I am getting 5 as output, but the answer is 4, please verify
Overflow04
361
views
Overflow04
asked
Oct 2, 2022
DS
made-easy-test-series
binary-search-tree
+
–
0
votes
0
answers
227
postfix expression
I want to know which evaluation is wrong here: a-b-c = ab-c- or a-b-c = abc- – a * b *c = ab*c* a*b*c = abc** 3 . a+b-c = ab+c- a+b-c = abc-+
I want to know which evaluation is wrong here:a-b-c = ab-c- or a-b-c = abc- –a * b *c = ab*c* a*b*c = abc 3 . a+b-c = ab+c- a+b-c = ...
Overflow04
456
views
Overflow04
asked
Oct 2, 2022
Programming in C
self-doubt
infix-prefix
programming-in-c
+
–
0
votes
2
answers
228
Programming and DS
#include <stdio.h> int main(){ int a[] = {5,3,7,2,4}; int *p = &a[3]; p -= *p; printf("%d ",*p); return 0; } output is 3. Why 2 * sizeof(int) is doene.?
#include <stdio.h int main(){ int a[] = {5,3,7,2,4}; int *p = &a[3]; p -= *p; printf("%d ",*p); return 0; } output is 3.Why 2 * sizeof(int) is doene.?
Overflow04
345
views
Overflow04
asked
Oct 2, 2022
Programming in C
programming-in-c
made-easy-test-series
+
–
0
votes
1
answer
229
Data Structure
Can we determine unique tree by Inorder and level order traversal .
Can we determine unique tree by Inorder and level order traversal .
Overflow04
447
views
Overflow04
asked
Sep 28, 2022
Programming in C
data-structures
binary-tree
self-doubt
+
–
0
votes
0
answers
230
unacademy test series
Consider a string is stored in a word addressable memory where each word is of 4 Bytes. If the string starts at 100 and ends at 104 then which of the following can be the possible string(s) that can be stored. A)STRUCTURE B)UNION C)POINTER D)FUNCTION
Consider a string is stored in a word addressable memory where each word is of 4 Bytes. If the string starts at 100 and ends at 104 then which of the following can be the...
Pranavpurkar
576
views
Pranavpurkar
asked
Sep 27, 2022
Programming in C
programming-in-c
strings
unacademy-test-series
+
–
Page:
« prev
1
...
6
7
8
9
10
11
12
13
14
15
16
...
310
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register