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 Ruchirchaitanya
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Ruchirchaitanya
2
answers
1
Semaphores { Ace }
Pseudocode: Int x = 0 , y =20; Semaphores SX=1 , SY= 1; Parbegin Begin P(SX) , P(SY) ; X=X+1; V(SY), V(SX); End Begin P(SY) , P(SX) ; X=Y+2; V(SX), V(SY); End Parend Question: Final Values of X? I am getting 1, 22 and deadlock. How come answer is 22, 23 and deadlock possible??
commented
in
Operating System
Nov 21, 2017
663
views
operating-system
semaphore
process-synchronization
1
answer
2
profit loss
answered
in
Quantitative Aptitude
Nov 6, 2017
293
views
profit-loss
quantitative-aptitude
3
answers
3
Ethernet
Consider two nodes A and B on the same Ethernet, and suppose the propagation delay b/w the two nodes is 225-bit times. Suppose at the time both nodes A and B begin to transmit a frame.Both nodes transmit a 50-bit jam signal after detecting collision. For 10^7 bit/set find the time at which both nodes A and B sense idle channel?
answered
in
Computer Networks
Oct 24, 2017
1.5k
views
ethernet
computer-networks
lan-technologies
1
answer
4
propagation delay
Two hosts are connected via a packet switch with 107 bits per second links. Each link has a propagation delay of 20 microseconds. The switch begins forwarding a packet 35 microseconds after it receives the same. If 100 bits of data are to be transmitted ... between the transmission of the first bit of data and the reception of the last bit of the data in microseconds is _____.
commented
in
Computer Networks
Oct 23, 2017
2.0k
views
computer-networks
network-switching
3
answers
5
Finding Time complexity
Given answer: B Please explain
answered
in
Algorithms
Oct 20, 2017
2.1k
views
time-complexity
algorithms
recursion
test-series
4
answers
6
GATE CSE 1989 | Question: 4-vii
In the graph shown above, the depth-first spanning tree edges are marked with a $’ T’$. Identify the forward, backward, and cross edges.
commented
in
Algorithms
Oct 7, 2017
2.7k
views
gate1989
descriptive
algorithms
graph-algorithms
spanning-tree
depth-first-search
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:...