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
Recent activity 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
3
answers
1
GATE2020CS31
Let $G = (V, G)$ be a weighted undirected graph and let $T$ be a Minimum Spanning Tree (MST) of $G$ maintained using adjacency lists. Suppose a new weighed edge $(u, v) \in V \times V$ is added to $G$. The worst case time complexity of determining if $T$ is still an MST of the ... $\Theta (\mid E \mid \mid V \mid) \\$ $\Theta(E \mid \log \mid V \mid) \\$ $\Theta( \mid V \mid)$
commented
Feb 12
in
Algorithms

1.8k
views
gate2020cs
algorithms
9
answers
2
If every nonkey attribute is functionally dependent on the primary key then the relation will be in
answer edited
Jan 19
in
Databases

10.1k
views
databasenormalization
databases
2
answers
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?
commented
Aug 15, 2019
in
Digital Logic

236
views
digitallogic
madeeasytestseries
decoder
1
answer
4
numbering system 2
1142 – 921 = 821, then 1674 – 788 = ? Answer is EEC by hexadecimal subtraction
answered
Jul 29, 2019
in
Digital Logic

103
views
1
answer
5
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
2
answers
6
Simplify given switching network
answered
Jul 26, 2019
in
Digital Logic

485
views
digitallogic
networkswitching
booleanalgebra
3
answers
7
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
4
answers
8
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
3
answers
9
GateBook Test Series: Digital Logic  Boolean Algebra
What is the time complexity for checking whether an assignment of truth values to variables $x_1,\dots ,x_n$ satisfies a given formula $f(x_1\dots,x_n)$? $O(2^n)$ $O(g(n))$ where $g$ is a polynomial $O(log(n))$ None of the above
commented
Jun 29, 2019
in
Digital Logic

325
views
gatebook
digitallogic
booleanalgebra
2
answers
10
No of spanning Trees
Let $K_n$ denote the complete undirected graph with $n$ vertices where n is an even number. Find the maximum number of spanning trees of $K_n$ that can be formed in such a way that no two of these spanning trees have a common edge.
commented
Apr 8, 2017
in
Graph Theory

908
views
spanningtree
graphtheory
3
answers
11
ISI Entrance Exam MTech (CS)
Consider all possible trees with $n$ nodes. Let $k$ be the number of nodes with degree greater than $1$ in a given tree. What is the maximum possible value of $k$?
commented
Apr 8, 2017
in
Graph Theory

1.1k
views
isi2016
graphtheory
trees
descriptive
4
answers
12
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
answers
13
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 ...
comment edited
Apr 8, 2017
in
Graph Theory

455
views
graphtheory
discretemathematics
graphconnectivity
engineeringmathematics
2
answers
14
graph theory
A graph with n vertices and 0 edges.can this graph be called as Bipartite ? i mean can we simply partition the n vertices into two sets of vertices such that there is no edge within the set as well there is no edge between the two sets and say it as a Bipartite graph ?
comment edited
Apr 7, 2017
in
Graph Theory

312
views
graphtheory
discretemathematics
graphconnectivity
engineeringmathematics
2
answers
15
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
1
answer
16
PREDICT SERIALIZABILITY OF GIVEN SCHEDULE
T1 T2 READQ WRITEP WRITEQ READP Given schedule is: a) Not conflct serializable, but view serializable b) conflct serializable, not view serializable c) Both conflct serializable, and view serializable d) Not conflct serializable, not view serializable
commented
Feb 11, 2017
in
Databases

131
views
databases
view_serializable
2
answers
17
Find the Space complexity of following Code [Ace Gate Practice Booklet Vol1 Page 127]
commented
Jun 3, 2016
in
Algorithms

724
views
spacecomplexity
algorithms
2
answers
18
what is the time complexity ?
sum=0; for(i=0;i<n;i++) for(j=0;j<i*i;j++) for(k=0;k<j;k++) sum++;
commented
Jun 2, 2016
in
Algorithms

480
views
timecomplexity
3
answers
19
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
1
answer
20
CMI2012A08
You are given two sorting algorithms A and B that work in time $O(n \log n)$ and $O(n^2)$, respectively. Consider the following statements: Algorithm $A$ will sort any array faster than algorithm $B$. On an average, algorithm $A$ will sort a given array faster ... be preferable to algorithm $B$. Which of the statements above are true? I, II and III I and III II and III None of them
commented
Jun 2, 2016
in
Algorithms

327
views
cmi2012
algorithms
sorting
timecomplexity
asymptoticnotations
2
answers
21
Analysis of code fragment to find time complexity [ACE Gate Practice Booklet Volume 1 Page 127 Question 32]
commented
Jun 2, 2016
in
Algorithms

613
views
asymptoticnotations
timecomplexity
algorithms
4
answers
22
GATE2014121
Consider the relation scheme $R = (E, F, G, H, I, J, K, L, M, N)$ and the set of functional dependencies $\left\{ \{E, F \} \to \{G\}, \{F\} \to \{I, J\}, \{E, H\} \to \{K, L\}, \\ \{K\} \to \{M\}, \{L\} \to \{N\}\right\}$ on $R$. What is the key for $R$? $\{E, F\}$ $\{E, F, H\}$ $\{E, F, H, K, L\}$ $\{E\}$
commented
Mar 25, 2015
in
Databases

2.2k
views
gate20141
databases
databasenormalization
normal
52,222
questions
59,846
answers
201,030
comments
118,094
users