Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged self-doubt
0
votes
0
answers
1
Projects
Could you suggest any btech project which also help in my gate cs preparation and for building the concepts?
Could you suggest any btech project which also help in my gate cs preparation and for building the concepts?
soumikplus
65
views
soumikplus
asked
Feb 27
Machine Learning
self-doubt
doubt
general-topic-doubt
+
–
0
votes
0
answers
2
COA Self doubt
Çșȇ ʛấẗẻ
83
views
Çșȇ ʛấẗẻ
asked
Feb 15
Mathematical Logic
co-and-architecture
self-doubt
+
–
0
votes
1
answer
3
Operating System
How much time is required to load a 64 KB program from a disk with an average seek time of 30 ms, a rotation time of 20 ms per rotation, a track size of 32 KB, and a page size of 2 KB. It is assumed that the pages are spread randomly around the disk. A. 1200 ms B. 1300 ms C. 1320 ms D. 1400 ms
How much time is required to load a 64 KB program from a disk with an average seek time of 30 ms, a rotation time of 20 ms per rotation, a track size of 32 KB, and a page...
jaydip74
268
views
jaydip74
asked
Jan 28
Operating System
operating-system
self-doubt
+
–
0
votes
0
answers
4
#Doubt
Biswajit Kumar
63
views
Biswajit Kumar
asked
Jan 8
CO and Architecture
computer-architecture
self-doubt
test-series
+
–
1
votes
1
answer
5
selfdoubt combinatory
In how many ways can you distribute 4 different choclates to 3 people such that each gets atleast 1 choclate.
In how many ways can you distribute 4 different choclates to 3 people such that each gets atleast 1 choclate.
nihal_chourasiya
174
views
nihal_chourasiya
asked
Jan 7
Combinatory
self-doubt
made-easy-test-series
+
–
0
votes
0
answers
6
#selfdoubt
In CRC, if the dataword is 5 bits and the codeword is 8 bits, how many 0s need to be added to the dataword to make the dividend? What is the size of the remainder? What is the size of the divisor?
In CRC, if the dataword is 5 bits and the codeword is 8 bits, how many 0s need to be added to the dataword to make the dividend? What is the size of the remainder? What i...
Ansh Sinha
142
views
Ansh Sinha
asked
Jan 7
Computer Networks
computer-networks
self-doubt
crc-polynomial
+
–
0
votes
1
answer
7
selfdoubt testseries toc
isn’t this language regular? it’s nfa according to me
isn’t this language regular?it’s nfa according to me
nihal_chourasiya
86
views
nihal_chourasiya
asked
Jan 6
Theory of Computation
self-doubt
made-easy-test-series
+
–
0
votes
0
answers
8
How is the next-hop IP information passed down from Network layer to DLL
Let's say my device wants to send a packet to far way device many networks away. Once my router receives the packet, it doesn't know much about this destination IP and chooses to send it to the next hop router. ... layer and change the port number can they also interfere in the DLL and do all operations by itself in reality?
Let’s say my device wants to send a packet to far way device many networks away. Once my router receives the packet, it doesn’t know much about this destination IP an...
phaniphani
96
views
phaniphani
asked
Jan 6
Computer Networks
self-doubt
general-topic-doubt
computer-networks
routing
+
–
1
votes
0
answers
9
Made Easy: Counting number of subgraphs of the given graph. How should I approach this question?
tishhaagrawal
497
views
tishhaagrawal
asked
Dec 16, 2023
Graph Theory
gate-preparation
test-series
made-easy-test-series
self-doubt
counting
graph-theory
discrete-mathematics
graph-connectivity
+
–
0
votes
0
answers
10
Self Doubt Topology
Which topology covers security robust and eliminating traffic factors? a. Mesh b. Ring c. Star d. bus i am confused with mesh or star or bus option. please give clarification on this as well
Which topology covers security robust and eliminating traffic factors?a. Meshb. Ringc. Stard. bus i am confused with mesh or star or bus option. please give clarificati...
gateexplore
170
views
gateexplore
asked
Dec 7, 2023
Computer Networks
self-doubt
computer-networks
+
–
0
votes
1
answer
11
Made Easy Test Series : Assume a system has a 64bit VAS and 48 bit PAS. Page size is equal to 4KB. If only single level paging is used then the size of the page table (in TB)
Can anybody explain why are they dividing the number of pages by page size?According to me, it should be – Page table size = Number of entries * entry sizei.e PT size =...
tishhaagrawal
309
views
tishhaagrawal
asked
Dec 5, 2023
CO and Architecture
computer-architecture
gate-preparation
self-doubt
made-easy-test-series
+
–
0
votes
4
answers
12
Made Easy Probability - Let X be a set containing n elements. Three subsets A,B, C of X are chosen at random. The probability that A, B, C are pairwise disjoint is? (What do they mean by pairwise disjoint? and how should I approach this question?)
tishhaagrawal
969
views
tishhaagrawal
asked
Dec 4, 2023
Probability
probability
combinatory
counting
made-easy-test-series
gate-preparation
test-series
engineering-mathematics
self-doubt
bad-question
+
–
0
votes
0
answers
13
MadeEasy Test Series 2024 - In this question they have asked about the number of context switches that are happening. (Excluding the first and the last context switch). I am getting the answer as 5, according to the answer key it should be 6. I am not pre-empting process P when Q arrives as P has a higher priority than Q, in the solutions they have done the exact opposite, can anyone please tell me whether my approach is correct or I am missing onto something.
tishhaagrawal
361
views
tishhaagrawal
asked
Dec 4, 2023
Operating System
gate-preparation
operating-system
made-easy-test-series
process-scheduling
self-doubt
test-series
process
+
–
0
votes
1
answer
14
self doubt
In fragmentation, if any fragment gets lost then in which case whole packet will be sent again? and in which case only that fragment will be sent again?
In fragmentation, if any fragment gets lostthen in which case whole packet will be sent again?and in which case only that fragment will be sent again?
viral8702
203
views
viral8702
asked
Dec 2, 2023
Computer Networks
self-doubt
computer-networks
ip-packet
fragmentation
+
–
0
votes
1
answer
15
Self-doubt
What are the 3 important topics from where almost every year questions come in Computer Network ? Please help
What are the 3 important topics from where almost every year questions come in Computer Network ? Please help
Jiten008
143
views
Jiten008
asked
Dec 2, 2023
Others
computer-networks
self-doubt
+
–
0
votes
1
answer
16
Machine Learning Self-doubt
Please Solve this question with full explanation.
Please Solve this question with full explanation.
gateexplore
243
views
gateexplore
asked
Nov 30, 2023
Artificial Intelligence
machine-learning
self-doubt
+
–
0
votes
0
answers
17
Self Doubt Question
gateexplore
81
views
gateexplore
asked
Nov 17, 2023
Compiler Design
self-doubt
compiler-design
+
–
0
votes
1
answer
18
Database system concepts by abraham silberschatz #14th chapter
is it allowed in a B+ tree, while deletion to leave behind a key in internal nodes while deleting it from the leaf ?
is it allowed in a B+ tree, while deletion to leave behind a key in internal nodes while deleting it from the leaf ?
phaniphani
176
views
phaniphani
asked
Nov 16, 2023
Databases
self-doubt
b-tree
databases
+
–
3
votes
0
answers
19
[Self Doubt] Conversion of SR-flipflop to T-flipflop
The standard approach for solving such problem is as follows: This approach gives us the equation for $S$ & $R$ in terms of $T, Q$ as $S = T\overline Q \qquad \to (1)$ $R = TQ \qquad \to (2)$ I tried using a different ... & $(7)$, we get $S=T\overline{Q}$ and $R=TQ$ which is consistent with the standard approach and maintains $SR=0$
The standard approach for solving such problem is as follows:This approach gives us the equation for $S$ & $R$ in terms of $T, Q$ as$S = T\overline Q \qquad \to (1)$$R = ...
thehitchh1ker
284
views
thehitchh1ker
asked
Oct 31, 2023
Digital Logic
digital-logic
flip-flop
self-doubt
+
–
0
votes
0
answers
20
Self Doubt
It is always true that Recursive code is easier to debug?? If yes then why?? please give full explanation.
It is always true that Recursive code is easier to debug?? If yes then why?? please give full explanation.
gateexplore
124
views
gateexplore
asked
Oct 25, 2023
Algorithms
self-doubt
algorithms
+
–
3
votes
2
answers
21
TOC - Self Doubt
Can anyone explain $\overline{ww}$ is $CFL$ or $CSL$ And if $CFL$ can you write the equivalent $CFG$ for this ?
Can anyone explain $\overline{ww}$ is $CFL$ or $CSL$ And if $CFL$ can you write the equivalent $CFG$ for this ?
Jiten008
343
views
Jiten008
asked
Oct 24, 2023
Theory of Computation
pushdown-automata
theory-of-computation
self-doubt
regular-language
context-free-language
context-sensitive
turing-machine
closure-property
context-free-grammar
+
–
2
votes
2
answers
22
Self doubt
How $O(n)+O(n)+O(n)+O(n)+O(n)+….+O(n)=O(n^2)$ but $\neq O(n)$ please explain it.
How $O(n)+O(n)+O(n)+O(n)+O(n)+….+O(n)=O(n^2)$ but $\neq O(n)$please explain it.
राजकुमारी विसर्पी
382
views
राजकुमारी विसर्पी
asked
Oct 17, 2023
Algorithms
algorithms
asymptotic-notation
self-doubt
+
–
0
votes
1
answer
23
self doubt
2. Simplify the following Boolean expressions to a minimum number of literals: (a + b + c’)(a’b’ + c) 3. Draw logic diagrams of the circuits that implement the original and simplified expression in Problem 2.
2. Simplify the following Boolean expressions to a minimum number of literals: (a + b + c’)(a’b’ + c) 3. Draw logic diagrams of the circuits that implement the orig...
dvlken
330
views
dvlken
asked
Oct 16, 2023
Digital Logic
digital-logic
boolean-algebra
self-doubt
+
–
0
votes
1
answer
24
Self doubt
How many simple directed (unweighted) graphs on the set of vertices {v0,v1,…v5} are there that have at most one edge between any pair of vertices? (That is, for two vertices a, b, only at most one of the edges (a, b) and (b, a) is in the graph.)
How many simple directed (unweighted) graphs on the set of vertices {v0,v1,…v5} are there that have at most one edge between any pair of vertices? (That is, for two ver...
Anand67222
302
views
Anand67222
asked
Oct 14, 2023
Graph Theory
self-doubt
graph-theory
discrete-mathematics
+
–
0
votes
1
answer
25
Self Doubt
What is the function of Error Control and Flow Control in Transport Layer? I think it's only used in Data Link Layer only?
What is the function of Error Control and Flow Control in Transport Layer? I think it's only used inData Link Layer only?
Vashishtha
247
views
Vashishtha
asked
Oct 13, 2023
Computer Networks
self-doubt
data-link-layer
+
–
0
votes
2
answers
26
DBMS
The correct answer is a and d. I just wanted to know that why not b and c. It is possible that it may be speed and color is also a candidate key. If you have any clarification on this let me know!!!
The correct answer is a and d. I just wanted to know that why not b and c. It is possible that it may be speed and color is also a candidate key. If you have any clarific...
gateexplore
441
views
gateexplore
asked
Sep 22, 2023
Databases
self-doubt
candidate-key
superkeys
rdbms
+
–
1
votes
1
answer
27
Self doubt
#include <stdio.h> void SSort(int [], int); void swap(int *,int*); int main() { int arr[] = {5,4,3,2,1,0}; int n = sizeof(arr)/sizeof(arr[0]); SSort(arr,n); for(int i = 0; i < n; i++) { printf("%d\t", arr[i]); } return 0; } void SSort( ... = *x; *x = *y; *y = tmp; } This is a selection sort algorithm. But the output of the algo is: 0 0 0 0 0 0. Where is the problem ?
#include <stdio.h>void SSort(int [], int);void swap(int *,int*);int main() { int arr[] = {5,4,3,2,1,0}; int n = sizeof(arr)/sizeof(arr[0]); SSort(arr,n); for(...
Gopal6854
326
views
Gopal6854
asked
Sep 13, 2023
DS
sorting
self-doubt
algorithms
+
–
0
votes
0
answers
28
Confusion on GATE CS vs DA
Hi Everyone, 2022 Grad here from Btech ECE, Currently Working in IT (Android Development) Preparing for Gate 2025 I have interest in AI & ML, but not sure about the carrer prespective on it. Should I take DA in gate and Prepare for it? Or ... CS Also what are the difference in course provided by college in them. Any resources to prepare for DA also will be helpful.
Hi Everyone,2022 Grad here from Btech ECE, Currently Working in IT (Android Development)Preparing for Gate 2025I have interest in AI & ML, but not sure about the carrer p...
madvam
990
views
madvam
asked
Sep 11, 2023
Others
self-doubt
+
–
0
votes
1
answer
29
Self Doubt
I have a question that , if we solve only gate cs aptitude then it is enough or not ? bcoz i felt that there are max questions are just like branch specific application based in Quantitative aptitude @Hira Thakur sir ?
I have a question that , if we solve only gate cs aptitude then it is enough or not ? bcoz i felt that there are max questions are just like branch specific application b...
Ray Tomlinson
293
views
Ray Tomlinson
asked
Sep 11, 2023
Verbal Aptitude
self-doubt
quantitative-aptitude
general-aptitude
verbal-aptitude
analytical-aptitude
spatial-aptitude
gate-preparation
+
–
Page:
1
2
3
4
5
6
...
10
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register