Ques 1: Host A is sending data to host B over a full duplex link. A and B are using the sliding window protocol for flow control. The send and receive window sizes are 5 packets each. Data packets (sent only from A to B) are all 1000 bytes long and the transmission time for …
Computer Networks ISO/OSI Stack and SWP GATE Previous Year Solved Questions Read More »
Ques 1: Consider the equation (43)x = (y3)8 where x and y are unknown. The number of possible solutions is ________. GATE 2015 Set 3 Ans: 5 Solution: 4x+3=8y+3 4x=8y x=2y Also 4<x i.e x>4 y<8 So possible combinations are: x=6, y=3 x=8,y=4 x=10,y=5 x=12,y=6 x=14,y=7 So total 5 possibilities Ques 2: The 16-bit 2’s complement representation …
Number System GATE Previous Years Questions Solved Read More »
Ques 1: Consider Guwahati, (G) and Delhi (D)whose temperatures can be classified as high (H), medium (M) and low (L). Let P(HG) denote the probability that Guwahati has high temperature. Similarly, P(MG) and P(LG)denotes the probability of Guwahati having medium and low temperatures respectively. Similarly, we use P(HD),P(MD) and P(LD) for Delhi. GATE 2018 The following table gives the conditional probabilities for Delhi’s temperature given Guwahati’s temperature. HD MD LD …
Discrete Mathematics Probability GATE Previous Year Solved Questions Read More »
Ques 1: A graph is planar if and only if, GATE 1990 (A) It does not contain subgraphs homeomorphic to k5 and k3,3 (B) It does not contain subgraphs isomorphic to k5 or k3,3 (C) It does not contain subgraphs isomorphic to k5 and k3,3 (D) It does not contain subgraphs homeomorphic to k5 or k3,3 Ans: (D) It does not contain subgraphs homeomorphic to k5 or k3,3 Solution: Kuratowski’s …
Discrete Mathematics Graph Theory GATE Previous Years Solved Questions Read More »
Ques 1: How many substrings (of all lengths inclusive) can be formed from a character string of length n? GATE 1989 Ans: 1+[n(n+1)/2] Solution: Lets take an example . Lets consider the given string is {GATE}. So, set of string of length 1={G,A,T,E} cardinality of set =4 Set of strings of length 2={GA,AT,TE}. Set of strings of length 3={GAT,ATE}. Set of strings …
Discrete Mathematics Combinatories GATE Previous Years Solved Questions Read More »
Ques 1: State whether the following statements are TRUE or FALSE: GATE 1987 The union of two equivalence relations is also an equivalence relation. Solution: Equivalence Relation: Relation is reflexive, symmetric, transitive. A relation R1 is defined on a set A={a,b,c}. R1={(a,a),(b,b),(c,c),(a,b),(b,a)} → Equivalence Relation. A relation R2 is defined on a set A={a,b,c}. R2={(a,a),(b,b),(c,c),(c,b),(b,c)} …
Discrete Mathematics Set Theory and Algebra Previous Year GATE Questions Read More »
Ques 1: A problem in NP is NP-complete if GATE 2006 (A) it can be reduced to the 3-SAT problem in polynomial time (B) the 3-SAT problem can be reduced to it in polynomial time (C) it can be reduced to any other problem in NP in polynomial time (D) some problem in NP can …
Algorithms P & NP Concepts GATE Previous Years Solved Questions Read More »
Ques 1: What is the equivalent Boolean expression in product-of-sums form for the Karnaugh map given below. GATE 1996 (A) BD’ + B’D(B) (B+C’+D)(B’+C+D’)(C) (B+D)(B’+D’)(D) (B+D’)(B’+D) Ans:(C) Solution: For POS Form, Consider 0 s and k-map is Ques 2: Let * be defined as x*y= x’+y. Let z = x*y. Value of z*x is GATE 1997 (A) x +y …
Digital Logic : Logic Functions and Minimisation GATE Previous Years Questions Solved Read More »
Ques 1: What is the converse of the following assertion?I stay only if you go GATE 2001 (A) I stay if you go (B) If I stay then you go (C) If you dont go then I dont stay (D) If I dont stay then you go Ans: (B) If I stay then you go …
Discrete Mathematics Mathematical Logic GATE Previous Years Questions solutions Read More »