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, $$\Phi = \left( {{x_1} \vee {x_2}} \right) \wedge \left( {{x_1} \vee {{\overline x }_3}} \right) \wedge \left( {{x_2} \vee {x_4}} \right)$$ is a Boolean formula and it is in 2CNFSAT.

The decision problem 2CNFSAT is

One of the purposes of using intermediate code in compilers is to

Consider the basic block given below.

a = b + c 
c = a + d 
d = b + c 
e = d - b 
a = e + b

The minimum number of nodes and edges present in the DAG representation of the above basic block respectively are

An IP router implementing Classless Inter-domain Routing (CIDR) receives a packet with address 131.23.151.76. The router’s routing table has the following entries:

The identifier of the output interface on which this packet will be forwarded is ______.