Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
VishalBarkule
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by VishalBarkule
1
answer
1
On sets
Consider two sets A and B such that A U B is a subset of A intersection B the A={ } and B={ } is always true or false
Consider two sets A and B such that A U B is a subset of A intersection Bthe A={ } and B={ } is always true or false
175
views
answered
Sep 14, 2017
8
answers
2
GATE IT 2006 | Question: 47
Consider the depth-first-search of an undirected graph with $3$ vertices $P$, $Q$, and $R$. Let discovery time $d(u)$ represent the time instant when the vertex $u$ is first visited, and finish time $f(u)$ represent the time instant when the ... are two connected components, and $Q$ and $R$ are connected There are two connected components, and $P$ and $Q$ are connected
Consider the depth-first-search of an undirected graph with $3$ vertices $P$, $Q$, and $R$. Let discovery time $d(u)$ represent the time instant when the vertex $u$ is fi...
11.0k
views
commented
Jun 11, 2017
Algorithms
gateit-2006
algorithms
graph-algorithm
normal
graph-search
depth-first-search
+
–
7
answers
3
GATE CSE 2000 | Question: 2.7
Let $a, b, c, d$ be propositions. Assume that the equivalence $a ⇔ ( b \vee \neg b)$ and $b ⇔c$ hold. Then the truth-value of the formula $(a ∧ b) → (a ∧ c) ∨ d$ is always True False Same as the truth-value of $b$ Same as the truth-value of $d$
Let $a, b, c, d$ be propositions. Assume that the equivalence $a ⇔ ( b \vee \neg b)$ and $b ⇔c$ hold. Then the truth-value of the formula $(a ∧ b) → (a ∧ c) ∨...
12.0k
views
commented
Jun 11, 2017
Mathematical Logic
gatecse-2000
mathematical-logic
normal
propositional-logic
+
–
0
answers
4
Kenneth Rosen Edition 6th Exercise 1.3 Question 41 c (Page No. 49)
Express using predicate,quantifies and connectives:- The diagnostic monitor tracks status of all systems except main console
Express using predicate,quantifies and connectives:-The diagnostic monitor tracks status of all systems except main console
503
views
commented
Jun 9, 2017
Mathematical Logic
kenneth-rosen
discrete-mathematics
propositional-logic
quantifiers
+
–
6
answers
5
GATE CSE 2006 | Question: 39
We consider the addition of two $2's$ complement numbers $ b_{n-1}b_{n-2}\dots b_{0}$ and $a_{n-1}a_{n-2}\dots a_{0}$. A binary adder for adding unsigned binary numbers is used to add the two numbers. The sum is denoted by $ c_{n-1}c_{n-2}\dots c_{0}$ and the ... $ c_{out}\oplus c_{n-1}$ $ a_{n-1}\oplus b_{n-1}\oplus c_{n-1}$
We consider the addition of two $2's$ complement numbers $ b_{n-1}b_{n-2}\dots b_{0}$ and $a_{n-1}a_{n-2}\dots a_{0}$. A binary adder for adding unsigned binary numbers i...
18.4k
views
commented
Jun 9, 2017
Digital Logic
gatecse-2006
digital-logic
number-representation
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register