Skip to content
Early access — you're among the first to try PYQLabs. Share feedback
Concept drill

graph-reachability

GATE CSE & IT · Complexity Theory · 2014-2014

1
PYQs
100%
keyed
0
elite explanations
1
years appeared

Study anchor

Cormen et al. — Introduction to Algorithms (CLRS)

Algorithms, data structures, graph algorithms, complexity

Practice action

Start latest PYQ

PYQs in this concept

All concepts →
2014 PYQ

Consider the decision problem 2CNFSAT defined as follows: { $$\Phi $$ | $$\Phi $$ is a satisfiable propositional formula in CNF with at most two literal per clause} For example, $$...

mediumanswer key