Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged data-structures
0
votes
0
answers
181
Tree
damz1499
393
views
damz1499
asked
Dec 29, 2022
DS
data-structures
binary-tree
probability
+
–
0
votes
0
answers
182
Made easy test series question
Any one please let me know if there is any other way to this output?
Any one please let me know if there is any other way to this output?
Sgm
387
views
Sgm
asked
Dec 28, 2022
Programming in C
data-structures
programming
made-easy-test-series
doubt
+
–
0
votes
2
answers
183
made easy test series for gate cse 2023
please help me out in solving this question. the solution provided there is not upto the mark
please help me out in solving this question. the solution provided there is not upto the mark
sachidanand_dwivedi
1.1k
views
sachidanand_dwivedi
asked
Dec 21, 2022
Programming in C
data-structures
heap-sort
binary-heap
difficult
made-easy-test-series
+
–
1
votes
1
answer
184
DRDO CSE 2022 Paper 1 | Question: 26 (b)
Provide the correct data structures for the following: Asynchronous data transfer and accessing shared resource involve _________.
Provide the correct data structures for the following:Asynchronous data transfer and accessing shared resource involve _________.
admin
339
views
admin
asked
Dec 15, 2022
DS
drdocse-2022-paper1
data-structures
1-mark
fill-in-the-blanks
+
–
1
votes
0
answers
185
DRDO CSE 2022 Paper 1 | Question: 26 (a)
Provide the correct data structures for the following: ________ is used for delimiter checking and recursion.
Provide the correct data structures for the following:________ is used for delimiter checking and recursion.
admin
527
views
admin
asked
Dec 15, 2022
DS
drdocse-2022-paper1
data-structures
stack
1-mark
fill-in-the-blanks
+
–
1
votes
1
answer
186
DRDO CSE 2022 Paper 1 | Question: 27
Find the number of binary tree(s) with $3$ nodes (i.e., $\text{A, B,}$ and $\text{C})$ which when traversed by pre-order gives the sequence $\textbf{C B A}$. You also need to draw each such tree.
Find the number of binary tree(s) with $3$ nodes (i.e., $\text{A, B,}$ and $\text{C})$ which when traversed by pre-order gives the sequence $\textbf{C B A}$. You also nee...
admin
392
views
admin
asked
Dec 15, 2022
DS
drdocse-2022-paper1
data-structures
binary-tree
5-marks
descriptive
+
–
1
votes
2
answers
187
DRDO CSE 2022 Paper 1 | Question: 28
If the maximum height of a binary tree is $\mathrm{N},$ then how many number of nodes will there be?
If the maximum height of a binary tree is $\mathrm{N},$ then how many number of nodes will there be?
admin
292
views
admin
asked
Dec 15, 2022
DS
drdocse-2022-paper1
data-structures
binary-tree
4-marks
descriptive
+
–
1
votes
2
answers
188
DRDO CSE 2022 Paper 1 | Question: 29
Five items $\text{A, B, C, D, E}$ are pushed onto a stack, one after other starting from item $\mathrm{A}$. The stack is then popped by three items, and each item is inserted into a queue. Next, two items are deleted from the queue, ... deleted items are pushed back onto the stack. Now, one item is popped from the stack. Which item is at the top of the stack.
Five items $\text{A, B, C, D, E}$ are pushed onto a stack, one after other starting from item $\mathrm{A}$. The stack is then popped by three items, and each item is inse...
admin
530
views
admin
asked
Dec 15, 2022
DS
drdocse-2022-paper1
data-structures
stack
5-marks
descriptive
+
–
1
votes
0
answers
189
DRDO CSE 2022 Paper 1 | Question: 30
If the prefix traversal order of a tree is $*+\mathbf{a} \mathbf{b}-\mathbf{c} \mathbf{d}$. Then, find the equivalent postfix order of the that tree.
If the prefix traversal order of a tree is $*+\mathbf{a} \mathbf{b}-\mathbf{c} \mathbf{d}$. Then, find the equivalent postfix order of the that tree.
admin
270
views
admin
asked
Dec 15, 2022
DS
drdocse-2022-paper1
data-structures
tree-traversal
3-marks
descriptive
+
–
0
votes
1
answer
190
Random
Consider a 15 element min-heap which follows these conditions. right child of root is7 and one child of node 3 is 9. Calculate how many min heap possible?
Consider a 15 element min-heap which follows these conditions.right child of root is7 and one child of node 3 is 9. Calculate how many min heap possible?
shub2204
680
views
shub2204
asked
Nov 30, 2022
DS
data-structures
binary-heap
combinatory
+
–
1
votes
2
answers
191
Malloc | Free | Dangling Pointer | Prog. & DS
MSQ Consider the following C snippet: #include <stdio.h> int main() { int *ptr = (int*) malloc(100*sizeof(int)); *ptr=33; printf("%d %d\n",ptr,*ptr); // Line X free(ptr); *ptr=37; printf("%d %d\n",ptr,* ... *ptr) is 0 as in Line Y, the allocated heap is freed, and we cannot update it anymore, as ptr is now a dangling pointer
MSQ Consider the following C snippet:#include <stdio.h int main() { int *ptr = (int*) malloc(100*sizeof(int)); *ptr=33; printf("%d %d\n",ptr,*ptr); // Line X free(ptr); *...
Souvik33
640
views
Souvik33
asked
Nov 28, 2022
Programming in C
data-structures
pointers
programming-in-c
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
10
11
12
...
60
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register