UGC NET Computer || Free Quiz || Jun 2023

The dual simplex method is applicable provided

Suppose two strings S=ABAZDC and T=BACBAD are given. What would be the longest common subsequence for both the strings?

The following LPP

Maximize z = 100x₁ + 2x₂ + 5x₃

Subject to

14x₁ + x₂ – 6x₃ + 3x₄ = 7

32x₁ + x₂ – 12x₃ ≤ 10

3x₁ – x₂ – x₃ ≤ 0

x₁, x₂, x₃, x4  0

has

A combinational logic circuit which is used to send data coming from a single source to 2 or more separate destinations is called

Match the following :

P. SMTP - 1) Application layer

Q. BGP - 2) Transport layer

R. TCP - 3) Data link layer

S. PPP - 4) Network layer

5) Physical Layer

Codes :