Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User Soumya29
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Soumya29
1
vote
1
answer
1
Testbook Test Series: Operating System - Process Synchronization
Que- Consider the following statements about the dining philosopher problem. 1. There should be at least 6 chopsticks to avoid deadlock for 6 philosophers. 2. If the asymmetric solution is implemented then $1^{st}$ philosopher picks up her right ... above statement is correct? a. Only 1 b. Only 2 c. Both I and II d. None of the above
asked
in
Operating System
Jan 6, 2019
764
views
testbook-test-series
operating-system
process-synchronization
0
votes
0
answers
2
Testbook Test Series: Theory of Computation - Minimal State Automata
$Que-$ The minimum number of states in the $NFA$ for the regular expression $(a + a(b + aa)*b)* a(b + aa)*a$ is ______. Approach ?
asked
in
Theory of Computation
Jan 6, 2019
548
views
testbook-test-series
theory-of-computation
minimal-state-automata
0
votes
1
answer
3
Testbook Test Series: Computer Networks - Stop And Wait
$Que-$ A sender uses a Stop-and-Wait protocol for transmission of $8000 \ K-bits$ size frames on a $1Gbps$ satellite channel with a propagation delay of $400 \ ms$. What will be the link utilization (%) if a probability of single frame error is $0.001?$ $\text{Note – Here Frame size is 8000 K- bits i.e 8}*10^6 \ bits$
asked
in
Computer Networks
Jan 6, 2019
572
views
testbook-test-series
computer-networks
stop-and-wait
1
vote
0
answers
4
Self doubt- Propositional Logic
Que. Consider domain is the set of all people in the world. $F(x,y) =x \text{ is the friend of y}.$ Represent each of the following sentences using first-order logic statements $1.$ Every person has $at most \ 2$ friends. $2.$ Every person has $exactly \ 2$ ... $3. \forall x \exists y_1\exists y_2(F(x,y_1) \wedge F(x,y_2) \wedge (y_1 \neq y_2))$ Please verify.
asked
in
Mathematical Logic
Dec 6, 2018
606
views
discrete-mathematics
first-order-logic
propositional-logic
2
votes
0
answers
5
Self Doubt- Quick Sort
Que - Consider the recursive quicksort algorithm with random pivoting . That is, in each recursive call, a pivot is chosen uniformly at random from the sub-array being sorted. When this randomized algorithm is applied to an array of size n all whose elements are distinct, what is the probability ... - $\frac{2}{n}+(\frac{1}{n}*\frac{2}{n-1}) = \frac{2}{n-1} $ Please verify.
asked
in
Algorithms
Dec 3, 2018
1.0k
views
algorithms
quick-sort
0
votes
1
answer
6
Thrashing
Q. Consider Global Replacement policy is used for page replacement. Which of the following statement is correct - S1 - Increase in the degree of multiprogramming beyond a certain point leads to thrashing. S2 - Thrashing beyond a certain point leads to ... ready queue decreases. As a result, CPU utilization drops and scheduler tries to increase the degree of multiprogramming even more.
asked
in
Operating System
Nov 17, 2018
2.6k
views
operating-system
thrashing
0
votes
0
answers
7
Binary Tree
I know the answer. But is there any general FORMULA for it? If yes, please provide the complete derivation of it. In the solution, they used $\rightarrow 2^{h-1}+1.$ I tried but I am not able to derive it.
asked
in
Programming in C
Oct 22, 2018
300
views
data-structures
binary-tree
0
votes
0
answers
8
Self-doubt - Case of Deletion when Open Addressing is used for collision resolution
In case of Open Addressing, when a key is deleted, a tombstone marker(delete marker) is inserted at its place. So if the hash table contains a lot of markers then it degrades the performance to a great extent ... DOUBT is - When the hash table contains a lot of tombstone markers, will it increases the load factor?
asked
in
Algorithms
Oct 5, 2018
569
views
hashing
algorithms
1
vote
2
answers
9
Peter Linz 4th edition Ex-1.2 -Q10
Q- Prove or Disprove the following claim- $(L^R)^*=(L^*)^R$ for all languages.
asked
in
Theory of Computation
Sep 18, 2018
917
views
theory-of-computation
0
votes
3
answers
10
Self Doubt
How to evaluate this quickly? $\large\sum^{20}_{r=0}(-1)^r\binom{r+2}{r}\\OR\\\large\sum^{20}_{r=0}(-1)^r(r+2)(r+1)$
asked
in
Combinatory
Jul 11, 2018
402
views
combinatory
0
votes
0
answers
11
Self doubt regarding complete lattice related to https://gateoverflow.in/27341/tifr2014-b-16
https://gateoverflow.in/27341/tifr2014-b-16z In this question, why ($\mathbb{N},∣)$ is not a complete lattice? For $any \ finite$ subset of $\mathbb{N}$, $LCM$ of its elements will be $lub$ ... could come up with is they might not considering $0 \ \epsilon \ \mathbb{N}$. Is there any other reason?
asked
in
Set Theory & Algebra
Jun 8, 2018
665
views
discrete-mathematics
set-theory&algebra
lattice
0
votes
1
answer
12
Quasi- Order Relations
What are the conditions for a relation to be quasi-ordered? In NPTEL video lectures, I found conditions for it to be Irreflexive and Transitive. But on Wikipedia and other resources, it's given that a binary relation R on a set A quasi-order if it is Reflexive and Transitive. Which one is correct ? or Am I missing something?
asked
in
Set Theory & Algebra
Jun 6, 2018
886
views
set-theory&algebra
discrete-mathematics
relations
3
votes
1
answer
13
Problem in gate1998-10 part b -
Can someone help me in "part b" of this question- https://gateoverflow.in/1724/gate1998-10 . I am still not able to understand why $R^0$ is considered here ? and what is $R^0 $? Is it Equality relation? Do we have to consider it in every question of this type ?
asked
in
Set Theory & Algebra
May 22, 2018
1.2k
views
discrete-mathematics
set-theory&algebra
relations
4
votes
1
answer
14
Self Doubt. Related to https://gateoverflow.in/94634/gate1988-13ii#c216658.
1. If the set $S$ is countably infinite, prove or disprove that if $f$ maps $S$ onto $S$ (i.e $f:S \rightarrow S$ is a surjective function), then $f$ is one-to-one.
asked
in
Set Theory & Algebra
May 14, 2018
625
views
discrete-mathematics
set-theory&algebra
functions
1
vote
1
answer
15
Self Doubt
The smallest number of states a TM can have?
asked
in
Theory of Computation
Dec 16, 2017
265
views
theory-of-computation
turing-machine
0
votes
1
answer
16
Decidability
L= {<G> | G is CFG and G is NOT ambiguous} . L is TM recognizable or not even TM recognizable?
asked
in
Theory of Computation
Dec 16, 2017
1.0k
views
decidability
theory-of-computation
2
votes
3
answers
17
Kenneth Rosen Edition 7 Exercise 10.8 Question 23 (Page No. 734)
Find the edge chromatic numbers of a) Cn, where n ≥ 3. (Cycle with n vertices) b) Wn, where n ≥ 3 (Wheel with n vertices) c)Complete graph with n vertices.
asked
in
Graph Theory
Jul 8, 2017
3.7k
views
discrete-mathematics
kenneth-rosen
graph-theory
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...