Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Sahil_Lather
0
votes
1
GATE CSE 2012 | Question: 8
A process executes the code fork(); fork(); fork(); The total number of child processes created is $3$ $4$ $7$ $8$
A process executes the codefork(); fork(); fork();The total number of child processes created is$3$$4$$7$$8$
13.0k
views
answered
Oct 4, 2023
Operating System
gatecse-2012
operating-system
easy
fork-system-call
+
–
0
votes
2
GATE Overflow Test Series | Discrete Mathematics | Test 1 | Question: 21
The domain of the function $f$ defined by $f(x) = \frac{1}{\sqrt{x + |x|}}$ is. $\mathbb{R}$ $\mathbb{R}^+$ $\mathbb{R}- \{0\}$ None of these
The domain of the function $f$ defined by $f(x) = \frac{1}{\sqrt{x + |x|}}$ is.$\mathbb{R}$$\mathbb{R}^+$$\mathbb{R}- \{0\}$None of these
236
views
answered
May 8, 2023
Set Theory & Algebra
go2025-dm-1
functions
+
–
1
votes
3
GATE Overflow Test Series | Discrete Mathematics | Test 1 | Question: 11
Consider the following two identities on three sets $X,Y$ and $Z.$ (Here $\Delta$ represents the symmetric difference operation) $S_1: X - (Y \cup Z) = (X-Y) \cap (X-Z)$ ... is TRUE? Only $S_1$ is True Only $S_2$ is True Both $S_1$ and $S_2$ are True Neither $S_1$ nor $S_2$ is True
Consider the following two identities on three sets $X,Y$ and $Z.$ (Here $\Delta$ represents the symmetric difference operation)$S_1: X - (Y \cup Z) = (X-Y) \cap (X-Z)$$S...
261
views
answered
May 8, 2023
Set Theory & Algebra
go2025-dm-1
set-theory
+
–
1
votes
4
GATE Overflow Test Series | Discrete Mathematics | Test 1 | Question: 10
Let $A,B$ and $C$ be three sets. Then $(A-B) - C$ is _________. $(A-B)-(B-C)$ $(A-C)-(B-C)$ $(B-C)-(A-C)$ $(A-B)-(A-C)$
Let $A,B$ and $C$ be three sets. Then $(A-B) - C$ is _________.$(A-B)-(B-C)$$(A-C)-(B-C)$$(B-C)-(A-C)$$(A-B)-(A-C)$
179
views
answered
May 8, 2023
Set Theory & Algebra
go2025-dm-1
set-theory
easy
+
–
0
votes
5
GATE Overflow Test Series | Discrete Mathematics | Test 1 | Question: 8
Which of the following is a valid partition for $N,$ where $N$ is the set of natural numbers? (Mark all the appropriate choices) $\{x \in N \mid x \geq 100 \} \cup \{x \in N \mid x \leq 100\}$ ... $\{x \in N \mid x \geq 101 \} \cup \{x \in N \mid x < 100 \}$
Which of the following is a valid partition for $N,$ where $N$ is the set of natural numbers? (Mark all the appropriate choices)$\{x \in N \mid x \geq 100 \} \cup \{x \in...
298
views
answered
May 8, 2023
Set Theory & Algebra
go2025-dm-1
relations
normal
multiple-selects
+
–
0
votes
6
GATE Overflow Test Series | Discrete Mathematics | Test 1 | Question: 3
Let's consider a propositional language where $p$ means "$x$ is a power of $2$", $q$ means "$x$ is even". Which of the following is the correct formal representation of the sentence "$x$ being a ... $p \rightarrow q$ $q \rightarrow p$ $\neg p \rightarrow \neg q$ none of these
Let's consider a propositional language where$p$ means "$x$ is a power of $2$",$q$ means "$x$ is even".Which of the following is the correct formal representation of the ...
186
views
answered
May 8, 2023
Mathematical Logic
go2025-dm-1
proportional-logic-order
easy
+
–
0
votes
7
Self Made Question
Consider a connected undirected graph G with n vertices, where n > 4. Suppose that G has the property that every vertex has a degree of at least n/2, i.e., deg(v) ≥ n/2 for all vertices v in G. Prove that G must contain a cycle of length at most 3n/4.
Consider a connected undirected graph G with n vertices, where n 4. Suppose that G has the property that every vertex has a degree of at least n/2, i.e., deg(v) ≥ n/2 ...
330
views
answered
Apr 23, 2023
Graph Theory
graph-theory
bipartite-graph
self-doubt
+
–
0
votes
8
Self Made Question
Consider a bipartite graph G with vertex sets V1 and V2, where |V1| = 10 and |V2| = 15. What is the minimum number of colors needed to properly color G such that no adjacent vertices share the same color? Justify your answer and explain how it is related to the chromatic number of G.
Consider a bipartite graph G with vertex sets V1 and V2, where |V1| = 10 and |V2| = 15. What is the minimum number of colors needed to properly color G such that no adjac...
200
views
answered
Apr 14, 2023
Graph Theory
graph-theory
bipartite-graph
numerical-answers
+
–
0
votes
9
Abraham Silberschatz, Greg Gagne, Peter B. Galvin - Operating System Concepts-Wiley (2018), PART TWO PROCESS MANAGEMENT, Chapter 5 CPU Scheduling, Pg. 202.
Please read below passage from 10th edition Operating System Concepts, pg. 202:5.1.3 Preemptive and Nonpreemptive SchedulingCPU-scheduling decisions may take place under ...
532
views
answered
Apr 11, 2023
Operating System
operating-system
process-synchronization
galvin
+
–
0
votes
10
Tuple Relation Calculus
While learning Tuple Relational Calculus I found there is a substantial need to learn Logic (Discrete mathematics). But I have a loose hold over the topic, and I don't want to break the continuity to learn DBMS, so what are the topics that I must learn in DM (for the time being) to continue learning Tuple Relation Calculus?
While learning Tuple Relational Calculus I found there is a substantial need to learn Logic (Discrete mathematics). But I have a loose hold over the topic, and I don't wa...
271
views
answered
Apr 11, 2023
Others
tuple-relational-calculus
+
–
0
votes
11
Should I take a low-paying internship or focus on cracking GATE?
Hey everyone, I am currently in my 3rd year (6th sem) doing B.Tech in Computer Science from a tier 3 college. So far, no one from my batch has gotten an internship from our college (explaining the market situation ... the low-paying internship at Airtel or focus on cracking GATE? Any advice would be appreciated. Thank you in advance.
Hey everyone,I am currently in my 3rd year (6th sem) doing B.Tech in Computer Science from a tier 3 college. So far, no one from my batch has gotten an internship from ou...
395
views
answered
Apr 11, 2023
0
votes
12
Fork() system call doubt
void main() { int n = 1; if(fork()==0) { n = n<<1; printf(“%d, “, n); n = n <<1; } if(fork()==0) n=n+700; printf(“%d, “,n); } Which of the following output is not possible? 2,4,1,701,704 1,2,4,704,701 2,704,4,701,1 1,704,2,4,701
void main() { int n = 1; if(fork()==0) { n = n<<1; printf(“%d, “, n); n = n <<1; } if(fork()==0) n=n+700; printf(“%d, “,n); }Which of the following output is not ...
782
views
answered
Apr 11, 2023
Operating System
fork-system-call
operating-system
programming-in-c
+
–
1
votes
13
Self Doubt
An adjacency list representation of an undirected simple graph G = (V, E), each edge (u, v) has two adjacency list entries: [v] in the adjacency list of u, and [u] in the adjacency list of v. These are called twins of each other. A twin ... is not a constraint, what is the time complexity of the most efficient algorithm to set the twin pointer in each entry in each adjacency list?
An adjacency list representation of an undirected simple graph G = (V, E), each edge (u, v) has two adjacency list entries: [v] in the adjacency list of u, and [u] in th...
381
views
answered
Apr 10, 2023
Algorithms
algorithms
time-complexity
+
–
1
votes
14
Computer Networks Book by Andrew S. Tanenbaum
383
views
answered
Apr 10, 2023
Computer Networks
computer-networks
slotted-aloha
+
–
0
votes
15
from online classes
Q )Six jobs are waiting to be run. The expected running times are 9, 7, 5, 2, 1 and x respectively. Where 5 < x < 7 and the average completion time is 13. Find the value of x using SJF algorithm? (Assume all jobs arrive at same time = 0). a)3.33 b)4.33 c)5.33 d)6.33
Q )Six jobs are waiting to be run. The expected running times are 9, 7, 5, 2, 1 and x respectively. Where 5 < x < 7 and the average completion time is 13. Find the value ...
656
views
answered
Apr 10, 2023
Operating System
operating-system
algorithms
+
–
0
votes
16
Theory of computation
245
views
answered
Apr 10, 2023
Theory of Computation
theory-of-computation
context-free-language
+
–
1
votes
17
MadeEasy
Consider the following deterministic finite automation Let S denote the set of eight bit strings whose second, third, sixth and seventh bits are 1. Then which of the following strings is/are in S that are accepted by M. 01110111 01111010 10101010 01110110
Consider the following deterministic finite automation Let S denote the set of eight bit strings whose second, third, sixth andseventh bits are 1. Then which of th...
447
views
answered
Apr 10, 2023
Theory of Computation
made-easy-test-series
theory-of-computation
number-of-dfa
+
–
0
votes
18
MadeEasy
Match List-l with List-|l and select the correct answer using the codes given below the lists: List-I List-II A. Regular grammar 1. Pushdown automaton B. Context free grammar 2. Linear bounded automaton C Unrestricted grammar 3. Deterministic finite . D. Context sensitive grammar 4. Turing machine Codes: A B C D (a) 3 1 2 4 (b) 3 1 4 2 Which of the options are correct and why?
Match List-l with List-|l and select the correct answer using the codes given below the lists:List-I List-IIA. Regular grammar 1. Pushdown a...
644
views
answered
Apr 10, 2023
Theory of Computation
made-easy-test-series
finite-automata
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register