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
Recent activity by Debanjan Dey
1
answer
1
ACE Bits and bYtes
Minimum no of edges necessary in a simple graph with 10 vertices to ensure connectivity is_______.
Minimum no of edges necessary in a simple graph with 10 vertices to ensure connectivity is_______.
1.3k
views
commented
Dec 4, 2018
Graph Theory
graph-theory
graph-connectivity
+
–
1
answer
2
GATE CSE 1996 | Question: 24-b
Consider the synchronous sequential circuit in the below figure Given that the initial state of the circuit is $S_4,$ identify the set of states, which are not reachable.
Consider the synchronous sequential circuit in the below figureGiven that the initial state of the circuit is $S_4,$ identify the set of states, which are not reachable.
2.4k
views
commented
Dec 4, 2018
Digital Logic
gate1996
normal
digital-logic
circuit-output
descriptive
+
–
1
answer
3
NIELIT2017 STA-set-c-119
The function $f(x)=\frac{x^2 -1}{x-1}$ at $x=1$ is: Continuous and Differentiable Continuous but not Differentiable Differentiable but not Continuous Neither Continuous nor Differentiable
The function $f(x)=\frac{x^2 -1}{x-1}$ at $x=1$ is:Continuous and Differentiable Continuous but not DifferentiableDifferentiable but not ContinuousNeither Continuous nor ...
1.5k
views
commented
Sep 20, 2018
Calculus
nielit-july-2017
engineering-mathematics
calculus
continuity
+
–
1
answer
4
TIFR-2014-Maths-A-11
Let $A$ be an $n \times n$ matrix with real entries such that $A^{k}=0$ (0-matrix), for some $k \in \mathbb{N}$. Then $A$ has to be the $0$ matrix Trace$(A)$ could be non-zero $A$ is diagonalizable $0$ is the only eigenvalue of $A$
Let $A$ be an $n \times n$ matrix with real entries such that $A^{k}=0$ (0-matrix), for some $k \in \mathbb{N}$. Then$A$ has to be the $0$ matrix Trace$(A)$ could be non-...
449
views
commented
Aug 25, 2018
Linear Algebra
tifrmaths2014
linear-algebra
matrix
+
–
1
answer
5
Process Synchronization
which of the following is true? it guarantees mutual exclusion. it is busy waiting solution. it does not guarantees progress. it guarantee bounded waiting. entry_section(int process) { int other = 1-process while (flag!=process); CS } exit_section(int process) { flag = other }
which of the following is true?it guarantees mutual exclusion.it is busy waiting solution.it does not guarantees progress.it guarantee bounded waiting.entry_section(int p...
886
views
commented
Aug 18, 2018
Operating System
critical-section
process-synchronization
operating-system
+
–
4
answers
6
Self Doubt regarding C-SCAN
Consider a disk has 200 cylinders, numbered from 0 to 199. At some time the disk arm is at cylinder 100, and moving towards right direction. There is a queue of disk access requests for cylinders 30, 85, 110, 100, 105, 126, 135, 55 and ... the R/W head when the LOOK algorithm is used compared to the CSCAN algorithm is ________. Please also mention the method of C-SCAN.
Consider a disk has 200 cylinders, numbered from 0 to 199. At some time the disk arm is at cylinder 100, and moving towards right direction. There is a queue of disk acce...
4.3k
views
comment edited
Aug 17, 2018
Operating System
operating-system
disk-scheduling
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register