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
0
answers
181
#madeeasy
Dknights
285
views
Dknights
asked
Jan 7, 2023
Programming in C
programming-in-c
made-easy-test-series
bad-question
+
–
0
votes
1
answer
182
Programming
Why nothing is printed for %c.
Why nothing is printed for %c.
Overflow04
322
views
Overflow04
asked
Jan 3, 2023
Programming in C
programming
self-doubt
+
–
2
votes
3
answers
183
Made Easy Mock -1
how does the program is working..? answer – 8
how does the program is working..?answer – 8
TusharKumar
421
views
TusharKumar
asked
Dec 29, 2022
Programming in C
programming
numerical-answers
made-easy-test-series
+
–
0
votes
0
answers
184
Tree
damz1499
392
views
damz1499
asked
Dec 29, 2022
DS
data-structures
binary-tree
probability
+
–
0
votes
0
answers
185
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
+
–
1
votes
1
answer
186
UNacademy Tests
int fun(int arr[]); int fun(int arr[2]); Both the statements are same??? HELP
int fun(int arr[]); int fun(int arr ); Both the statements are same??? HELP
Rajender gill
350
views
Rajender gill
asked
Dec 27, 2022
Programming in C
programming-in-c
+
–
0
votes
1
answer
187
ZEAL SERIES
What should be the answer?
What should be the answer?
DAWID15
501
views
DAWID15
asked
Dec 23, 2022
Programming in C
programming-in-c
zeal
+
–
0
votes
1
answer
188
ZEAL TESTSERIES
Options: 10, 12,14, 16, 18, 20 20, 18, 16, 14, 12, 10 12, 10, 16, 14, 20, 18 NONE
Options:10, 12,14, 16, 18, 2020, 18, 16, 14, 12, 1012, 10, 16, 14, 20, 18NONE
DAWID15
529
views
DAWID15
asked
Dec 22, 2022
DS
test-series
zeal
+
–
0
votes
1
answer
189
Unacacdemy AIMT 2
can anyone explain how the for loop works here..?
can anyone explain how the for loop works here..?
TusharKumar
526
views
TusharKumar
asked
Dec 22, 2022
Programming in C
programming-in-c
output
loop
+
–
2
votes
0
answers
190
How to approach this question
h4kr
310
views
h4kr
asked
Dec 21, 2022
Programming in C
programming-in-c
+
–
0
votes
2
answers
191
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
192
Array P&DS | Time Complexity
What is the worst case time complexity of an efficient algorithm (in order of n) to get the last index for an actually filled element, in an array, given the condition that we may not fill the entire initialized array with elements, the array is initialized as “int a[n]; ” [Array may not be filled in a sorted order] O(n) O(1) O(log(n)) O($n^2$)
What is the worst case time complexity of an efficient algorithm (in order of n) to get the last index for an actually filled element, in an array, given the condition th...
Souvik33
673
views
Souvik33
asked
Dec 17, 2022
DS
algorithms
time-complexity
array
+
–
0
votes
1
answer
193
Object Oriented Programming
Imagine a scenario where new child classes are introduced frequently from a base class. The method calling sequences for every child class are the same but the implementations are different among the child classes. Here which design pattern would you like to apply? Explain the reasons with examples j
Imagine a scenario where new child classes are introduced frequently from a base class. The method calling sequences for every child class are the same but the implementa...
rayhanrjt
312
views
rayhanrjt
asked
Dec 16, 2022
Programming in C
object-oriented-programming
programming
+
–
1
votes
1
answer
194
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
337
views
admin
asked
Dec 15, 2022
DS
drdocse-2022-paper1
data-structures
1-mark
fill-in-the-blanks
+
–
1
votes
0
answers
195
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
196
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
197
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
290
views
admin
asked
Dec 15, 2022
DS
drdocse-2022-paper1
data-structures
binary-tree
4-marks
descriptive
+
–
1
votes
2
answers
198
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
525
views
admin
asked
Dec 15, 2022
DS
drdocse-2022-paper1
data-structures
stack
5-marks
descriptive
+
–
1
votes
0
answers
199
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
0
answers
200
Java Programming
Suppose, you are implementing Overdraft Account (OD) class using java for a banking app. An OD type account is opened with an approved loan limit (ex 100000/-). The account holder can deposit any amount of money in the OD account at any time. S ... amount of his OD limit. How can u handle the problems mentioned in the question? Write necessary java codes to solve the problem.
Suppose, you are implementing “Overdraft Account (OD)” class using java for a banking app. An OD type account is opened with an approved loan limit (ex 100000/-). The...
rayhanrjt
323
views
rayhanrjt
asked
Dec 15, 2022
Programming in C
programming
object-oriented-programming
java
+
–
Page:
« prev
1
...
5
6
7
8
9
10
11
12
13
14
15
...
310
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register