The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Answers by APOORV PANSE
User APOORV PANSE
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User APOORV PANSE
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+7
votes
1
If every nonkey attribute is functionally dependent on the primary key then the relation will be in
answered
Oct 11, 2019
in
Databases

10.1k
views
databasenormalization
databases
+1
vote
2
numbering system 2
1142 – 921 = 821, then 1674 – 788 = ? Answer is EEC by hexadecimal subtraction
answered
Jul 29, 2019
in
Digital Logic

103
views
0
votes
3
Made Easy Test Series: Digital Logic
A $3\times 8$ decoder with $2$ enable inputs is used to address $8$ block of memory. What will be the size of each memory block when addressed from a $16$ bit bus with $2$ MSB’s used to enable the decoder?
answered
Jul 28, 2019
in
Digital Logic

237
views
digitallogic
madeeasytestseries
decoder
+2
votes
4
Made Easy Test Series:FlipFlop
A Finite State Machine(FSM) is implemented using the DFFs A and B with logic gates as shown below. The four possible states of FSM are $Q_{A}Q_{B}=00,01,10,11$. Assume that $X_{in}$ is held at constant logic level throughout the operation of FSM. ... states if $X_{in}=0$ How do we check $X_{in}$ here? Can we check it arbitrarily, or checked with prev states??
answered
Jul 28, 2019
in
Digital Logic

197
views
digitallogic
flipflop
madeeasytestseries
+3
votes
5
Simplify given switching network
answered
Jul 26, 2019
in
Digital Logic

485
views
digitallogic
networkswitching
booleanalgebra
0
votes
6
Testbook Test Series Question
f(A,B,C,D)=∏M(0,1,3,4,5,7,9,11,12,13,14,15) is a maxterm representation of a Boolean function f(A,B,C,D) where A is the MSB and D is the LSB. The equivalent minimized representation of this function is (A+C¯+D)(A¯+B+D)(A+C¯+D)(A¯+B+D) AC¯D+A¯BD+A¯BC A¯CD¯+AB¯CD¯+AB¯C¯D¯ (B+C¯+D)(A+B¯+C¯+D)(A¯+B+C+D)
answered
Jun 30, 2019
in
Digital Logic

470
views
minimization
booleanalgebra
0
votes
7
Boolean algebra expression Floyd Digital Logic
Simplify the following expression AB’C + A’BC + A’B’C Solution given is A’C + B’C can someone show me how?
answered
Jun 29, 2019
in
Digital Logic

275
views
digitallogic
booleanalgebra
0
votes
8
graph theory
chromatic number of a graph <= ( maxdegree of the graph ) + 1 can somebody explain how ?
answered
Apr 8, 2017
in
Graph Theory

653
views
graphtheory
discretemathematics
graphconnectivity
engineeringmathematics
+3
votes
9
graph theory
A graph consists of only one vertex,which is isolated ..Is that graph A) a complete graph ??? B) a clique??? C) connected graph ??? Please explain your answer ...
answered
Apr 8, 2017
in
Graph Theory

455
views
graphtheory
discretemathematics
graphconnectivity
engineeringmathematics
0
votes
10
JNUEE2016
Consider an undirected graph G with 100 nodes. What is the maximum number of edges to be included in G so that graph is connected? (a) 2451 (b) 4851 (c) 4950 (d) 9990
answered
Apr 7, 2017
in
Graph Theory

267
views
0
votes
11
Given two positive functions f(n) and g(n).If f(n)/g(n)=c , for some constant c >=0 , which of the stmts are true ?
answered
Jun 2, 2016
in
Algorithms

322
views
asymptoticnotations
52,222
questions
59,853
answers
201,032
comments
118,095
users