Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Webpage
Programming in C.
Recursion.
Filter
No answer
No selected answer
No upvoted answer
Previous GATE
Featured
Questions without answers in Programming and DS
0
votes
0
answers
1
Bitwise Operator - C Programming
Problem Statement: Class teacher to IX-C wants to store whether a particular student has passed in exams. The class has a strength of $32$ students. Their roll numbers lie in the range: $[1, 32]$. The teacher used bits of an integer to store ... Bitwise OR (|) operator and count number of set bits d. Apply Bitwise AND (&) operator and count number of set bits
Problem Statement: Class teacher to IX-C wants to store whether a particular student has passed in exams. The class has a strength of $32$ students. Their roll numbers li...
Debargha Mitra Roy
116
views
Debargha Mitra Roy
asked
Apr 12
Programming in C
programming-in-c
operator-precedence
boolean-algebra
+
–
1
votes
0
answers
2
GATE CSE SET-1 2024
My question is that can we use command line arguments without use of main function's parameters argc and *argv?
My question is that can we use command line arguments without use of main function's parameters argc and *argv?
RahulVerma3
142
views
RahulVerma3
asked
Mar 22
Programming in C
programming-in-c
programming
+
–
0
votes
0
answers
3
GATE 2024 CSE1
I have a question that can we use command line arguments without main function arguments? int main(int argc, char **argv){ }
I have a question that can we use command line arguments without main function arguments?int main(int argc, char argv){}
RahulVerma3
142
views
RahulVerma3
asked
Mar 16
Programming in C
gatecse2024-set1
programming-in-c
+
–
1
votes
0
answers
4
I have purchased the IIIT Hyderabad 2024 test series but i can't find the test series anywhere
Khushbu Chaudhary
103
views
Khushbu Chaudhary
asked
Feb 25
0
votes
0
answers
5
Memory Based GATE DA 2024 | Question: 20
Consider the following Python code: S[1] = [1] x = [6, 3, 5, 4, 10] for i in range(2, len(x)): S[i] = [1] if x[i - 1]
Consider the following Python code:S = x = [6, 3, 5, 4, 10]for i in range(2, len(x)): S[i] = if x[i - 1]
GO Classes
115
views
GO Classes
asked
Feb 4
Programming
gate2024-da-memory-based
goclasses
programming
programming-in-python
+
–
0
votes
0
answers
6
Memory Based GATE DA 2024 | Question: 21
What does the following Python code do? \begin{verbatim} def fun(D, S_1, S_2): if S_1 < S_2: D[S_1], D[S_2] = D[S_2], D[S_1] fun(D, S_1 + 1, S_2 - 1) \end{verbatim}
What does the following Python code do?\begin{verbatim}def fun(D, S_1, S_2): if S_1 < S_2: D[S_1], D[S_2] = D[S_2], D[S_1] fun(D, S_1...
GO Classes
101
views
GO Classes
asked
Feb 4
Programming
gate2024-da-memory-based
goclasses
programming
programming-in-python
+
–
0
votes
0
answers
7
Memory Based GATE DA 2024 | Question: 49
Consider the following Python code: def countchildren(l, i): Some code Given lists if i > 2: return 1 ans = 1 for i in l.keys(): ans = ans + countchildren(l,i) return ans Example usage l = dict() l[1] = [2, 3] l[2] = [3, 4, 5] l[3] = [6, 7, 8] result = countchildren(l,1) print(result)
Consider the following Python code:def countchildren(l, i): Some code Given lists if i 2: return 1 ans = 1 for i in l.k...
GO Classes
115
views
GO Classes
asked
Feb 4
Programming
gate2024-da-memory-based
goclasses
programming
programming-in-python
+
–
0
votes
0
answers
8
Memory Based GATE DA 2024 | Question: 55
Data Structure question: Binary tree question having four options involving no of internal nodes, leaf nodes, height etc.
Data Structure question: Binary tree question having four options involving no of internal nodes, leaf nodes, height etc.
GO Classes
216
views
GO Classes
asked
Feb 4
DS
gate2024-da-memory-based
goclasses
data-structures
binary-tree
+
–
4
votes
0
answers
9
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 19
What will be the output of the following program? #include <stdio.h> int main() { int a[2][2] = { {1, 2}, {3, 4} }; int (*p)[2][2]; p = &a; printf("%d", (*p)[0][1]); return 0; } $1$ $2$ $3$ $4$
What will be the output of the following program?#include <stdio.h int main() { int a = { {1, 2}, {3, 4} }; int (*p) ; p = &a; printf("%d", (*p)[0] ); return 0; }$1$$2...
GO Classes
329
views
GO Classes
asked
Jan 28
Programming in C
goclasses2024-mockgate-13
goclasses
programming
programming-in-c
array-of-pointers
1-mark
+
–
6
votes
0
answers
10
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 52
Consider the following binary heap – Suppose the last operation you performed in the binary heap above was inserting the key $x$. What are the possible values of $x?$ $20$ $8$ $13$ $11$
Consider the following binary heap –Suppose the last operation you performed in the binary heap above was inserting the key $x$.What are the possible values of $x?$$20$...
GO Classes
526
views
GO Classes
asked
Jan 13
DS
goclasses2024-mockgate-11
goclasses
data-structures
binary-heap
multiple-selects
2-marks
+
–
0
votes
0
answers
11
Objects First with Java™: A Practical Introduction Using BlueJ
Write a program in BlueJ Q4. Draw Class Diagram and Object Diagram from the below given Details. public class University { private Student stdob; private Faculty fctob; }
Write a program in BlueJQ4. Draw Class Diagram and Object Diagram from the below given Details. public class University{ private Student stdob; private Faculty ...
Ebrahim
80
views
Ebrahim
asked
Jan 12
Programming in C
java
+
–
0
votes
0
answers
12
ISRO 2024
In Reeverse Polish notation, expression A*B+C*D is written as AB*CD*+ A*BCD*+ AB*CD+* A*B*CD+ A request to the approver.!! This question is asked in ISRO 2024. Due to insufficient points, couldn’t add ‘isro2024’ tag, Please add it.
In Reeverse Polish notation, expression A*B+C*D is written asAB*CD*+A*BCD*+AB*CD+*A*B*CD+A request to the approver.!!This question is asked in ISRO 2024. Due to insuffici...
Ramayya
140
views
Ramayya
asked
Jan 7
DS
isro-2024
data-structures
+
–
0
votes
0
answers
13
#Float Data Type
#include <iostream> using namespace std; int main() { float a,b,c; cout<<"Enter a="; cin>>a; b=a + (1-1); cout<<"a + (1-1)="<<b<<endl; c=(a+1)-1; cout<<" (a+1)-1="<<c; getchar(); } Here is a is till 1E-7 c gives us a value .but after a= 1E-8 c gives us 0 can you explain how float data type is working here
#include <iostream>using namespace std;int main(){ float a,b,c; cout<<"Enter a="; cin>>a; b=a + (1-1); cout<<"a + (1-1)="<<b<<endl; c=(a+1)-1; cout<...
Rajib Datta Roy
181
views
Rajib Datta Roy
asked
Dec 26, 2023
Programming in C
programming-in-c
+
–
0
votes
0
answers
14
testbook
Rohit Chakraborty
125
views
Rohit Chakraborty
asked
Dec 24, 2023
Programming in C
testbook-test-series
programming-in-c
recursion
+
–
0
votes
0
answers
15
Made Easy
Please solve I am unable to understand the solution given by made easy
Please solve I am unable to understand the solution given by made easy
Dadu
212
views
Dadu
asked
Dec 7, 2023
0
votes
0
answers
16
Gate Overflow Test series
Can anyone explain this question to me
Can anyone explain this question to me
priyansh_1705
399
views
priyansh_1705
asked
Jul 3, 2023
Programming in C
linked-list
data-structures
+
–
0
votes
0
answers
17
Ace test series
What is the smallest and largest number of entries for 2-3 BTree (B2-3 Tree) of height 8 (i.e., 8 levels) ? 255 and 6560 127 and 2186 6561 and 255 255 and 2186
What is the smallest and largest number of entries for 2-3 BTree (B2-3 Tree) of height 8 (i.e., 8 levels) ?255 and 6560127 and 2186 6561 and 255255 and 2186
none30
439
views
none30
asked
Jun 11, 2023
DS
ace-test-series
data-structures
binary-tree
+
–
0
votes
0
answers
18
Programming 2024 test series
Caption @sachinmittal1 sir here answer should be B na because Arr[2] point s to the 0th index of 2nd 1D-array so it means pointing to address of arr[2][0] so address size would be 8.
Caption@sachinmittal1 sir here answer should be B na because Arr point s to the 0th index of 2nd 1D-array so it means pointing to address of arr [0] so address size woul...
JayRathi
320
views
JayRathi
asked
Jun 1, 2023
Programming in C
goclasses
+
–
0
votes
0
answers
19
testbook question
The total number of binary trees possible with height n - 2 having n nodes are? (2n - 5)^ 2n - 3 (2n - 7)^2n - 3 (n - 3) ^2n - 2 (2n - 7)^ 2n - 2
The total number of binary trees possible with height n - 2 having n nodes are?(2n - 5)^ 2n - 3 (2n - 7)^2n - 3(n - 3) ^2n - 2(2n - 7)^ 2n - 2
jugnu1337
369
views
jugnu1337
asked
May 16, 2023
DS
binary-tree
+
–
1
votes
0
answers
20
Strings in C language
I have seen alot of people saying that we can make an Integer string in C language. But according to me we can only make a character string in C language. here is the code: void main(){ char c[20] = { 1234 }; } as far as i know this is a ... but can someone tell me that is it possible to make a string of only integers in C language? If yes then how can we initialize it?
I have seen alot of people saying that we can make an Integer string in C language.But according to me we can only make a character string in C language.here is the code:...
deependu
259
views
deependu
asked
Apr 23, 2023
Programming in C
strings
programming-in-c
+
–
0
votes
0
answers
21
isi 2022 PCB
Let B be a binary search tree (BST) on eight nodes filled with the following set of eight integer keys A = {10, 2, 5, 3, 20, 15, 9, 22}. The order in which these keys were inserted to create B is not known. However, it is ... construct and depict pictorially four possible BSTs each of which requires 36 comparisons to check the presence of all the eight keys in A. Justify your answer
Let B be a binary search tree (BST) on eight nodes filled with the following set of eight integer keys A = {10, 2, 5, 3, 20, 15, 9, 22}. The order in which these keys wer...
Ray Tomlinson
373
views
Ray Tomlinson
asked
Apr 12, 2023
Programming in C
gate-preparation
binary-search-tree
+
–
3
votes
0
answers
22
GO Classes 2023 | IIITH Mock Test 1 | Question: 14
Consider a perfect binary tree with $\mathrm{n}$ nodes and $\mathrm{h}$ height. A tree is perfect when all levels of the tree are completely full. Let root is at depth $0$ and leaves are at height $0.$ Assume Expected height of any ... $S1$ is correct but $S2$ is incorrect $S1$ is incorrect but $S2$ is correct Both are correct Both are incorrect
Consider a perfect binary tree with $\mathrm{n}$ nodes and $\mathrm{h}$ height. A tree is perfect when all levels of the tree are completely full. Let root is at depth $0...
GO Classes
751
views
GO Classes
asked
Mar 26, 2023
DS
goclasses2023-iiith-mock-1
goclasses
data-structures
tree
binary-tree
1-mark
+
–
0
votes
0
answers
23
TestBook TestSeries BFS Question to find 4th enqueue element
Consider the following graph. If BFS is implemented on the following graph where the root node is 1 then which of the following set of the nodes are present in the queue after performing 4th enqueue operation? 3, 4, 5 4, 6, 5 3, 4 4, 5, 6
Consider the following graph. If BFS is implemented on the following graph where the root node is 1 then which of the following set of the nodes are present in the queue ...
Sahil_Lather
314
views
Sahil_Lather
asked
Jan 28, 2023
Programming in C
data-structures
graph-algorithms
+
–
0
votes
0
answers
24
TestBook testseries TLB and C programming combined question
Consider the following C function executed in an OS with paging where the page size is 4 kilobytes. Further, assume that the system employs a 32-entry direct mapped TLB. int *alloc_and_init() { int counter, value=0, size=2048; int ... of the program, what is the number of TLB misses during the execution of the for loop? 0 1 2048 2
Consider the following C function executed in an OS with paging where the page size is 4 kilobytes. Further, assume that the system employs a 32-entry direct mapped TLB.i...
Sahil_Lather
215
views
Sahil_Lather
asked
Jan 28, 2023
Programming in C
operating-system
programming-in-c
data-structures
pointers
+
–
0
votes
0
answers
25
Made Easy
can anyone help me how to approach these type of questions..? And also please attach link of similar questions if possible . thanks in advance
can anyone help me how to approach these type of questions..? And also please attach link of similar questions if possible .thanks in advance
TusharKumar
289
views
TusharKumar
asked
Jan 24, 2023
1
votes
0
answers
26
Made Easy Test Series | Prog. and DS | Dynamic Memory Allocation | Malloc
Which line number contains an error or warning:
Which line number contains an error or warning:
Souvik33
714
views
Souvik33
asked
Jan 9, 2023
Programming in C
programming-in-c
data-structures
memory-management
made-easy-test-series
numerical-answers
+
–
0
votes
0
answers
27
#madeeasy
Dknights
285
views
Dknights
asked
Jan 7, 2023
Programming in C
programming-in-c
made-easy-test-series
bad-question
+
–
0
votes
0
answers
28
Tree
damz1499
392
views
damz1499
asked
Dec 29, 2022
DS
data-structures
binary-tree
probability
+
–
0
votes
0
answers
29
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
386
views
Sgm
asked
Dec 28, 2022
Programming in C
data-structures
programming
made-easy-test-series
doubt
+
–
1
votes
0
answers
30
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
524
views
admin
asked
Dec 15, 2022
DS
drdocse-2022-paper1
data-structures
stack
1-mark
fill-in-the-blanks
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register