CSMA/CS LAN of 2 Gbps is to be designed over 1 km cable without repeater. If the minimum frame size that data link layer consider, is 20000 bits, then the cable support signal speed (in km/s) is ________.
-
Solution
Which of the following is not relevant to networking?
The monitor station in what standard ensures that one and only one token is circulating?
-
Solution
Here 802.3 is Ethernet, it uses CSMA/CD. But 802.5 is Token ring. It will have only one token in circulation. These are IEEE standards but FDDI is ANSI standard.
Bit stuffing refers to
-
Solution
Bit stuffing is required when there is a flag of bits to represent one of the incidents like start of frame, end of frame, etc. If same flag of bits appear in the data stream, a zero can be inserted. The receiver deletesthis zero from the data stream.
A functional dependency set F = {A → B, BC → E, ED → A,EF → G, E → F}. Find out the closure of (AC)
-
Solution
Closure of (AC) is {A, B, C, E, F, G}
How many solutions does the following system of linear equations have?
–x + 5 y =–1
x – y =2
x + 3y =3
-
Solution
How many perfect matchings are there in a complete graph of 6 vertices?
-
Solution
The following resolution rule is used in logic programming Derive clause (P ∨ Q) from clauses (P ∨ R), (Q ∨ ¬ R).Which of the following statements related to this rule is false?
-
Solution
Derive clause P ∨ Q from clauses P ∨ R, Q ∨ ¬ R means that
(P ∨ R) ^ (Q ∨ ¬ R) ⇒ P ∨ Q
∴ (a) is true
Since, x ⇒ y does not imply that y ⇒ x
∴ P ∨ Q ⇒ (P ∨ R) ^ (Q ∨ ¬ R)
∴ may or may not be true. Hence, (b) is not true.
Let (S,≤) be a partial order with two minimal elements a and b, and a maximum element c. Let P : S → {True, False}be a predicate defined on S. Suppose that P(a) = True,P(b)= False and P(x) ⇒ P(y) for all x, y ∈ S satisfying x ≤ y,where ⇒ stands for logical implication. Which of the following statements cannot be true?
-
Solution
If a ≤ x, since p(x) ⇒ p(y) whenever x ≤ y
∴ p(a) ⇒ p(x)
Now since p(a) = True, p(x) = cannot be false.
∴ (d) cannot be true.
A program consists of two modules executed sequentially.Let f1(t) and f2(t) respectively denote the probability density functions of time taken to execute the two modules. The probability density function of the over all time taken to execute the program is given by
-
Solution