Skip to content

Tag Archives: GATE-GATE IT 2006

If all the edge weights of an undirected graph are positive, then any subset of edges that connects all the vertices and has minimum total… Read More
A problem in NP is NP-complete if   (A) It can be reduced to the 3-SAT problem in polynomial time (B) The 3-SAT problem can… Read More
In a binary tree, the number of internal nodes of degree 1 is 5, and the number of internal nodes of degree 2 is 10.… Read More
Given a boolean function f (x1, x2, …, xn), which of the following equations is NOT true   (A) f (x1, x2, …, xn) =… Read More
In the automaton below, s is the start state and t is the only final state.  Attention reader! Don’t stop learning now.  Practice GATE exam… Read More

Start Your Coding Journey Now!