Skip to content

Tag Archives: GATE-Gate IT 2007

The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. The head is initially positioned at track number 180.… Read More
The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. The head is initially positioned at truck number 180.… Read More
Let P1,P2,…,Pn be n points in the xy-plane such that no three of them are collinear. For every pair of points Pi and Pj, let… Read More
Let P1, P2,….. , Pn be n points in the xy-plane such that no three of them are collinear. For every pair of points Pi… Read More
Consider the following expression ad’ + (ac)’ + bc’d Which of the following expressions does not correspond to the Karnaugh Map obtained for the above… Read More
Consider the following expression ad’ + (ac)’ + bc’d Which of the following Karnaugh Maps correctly represents the expression? (A) A (B) B (C) C… Read More
Consider the sequence <xn>, n>= 0 defined by the recurrence relation xn + 1 = c . xn2– 2, where c > 0. Suppose there… Read More
Consider a token ring topology with N stations (numbered 1 to N) running token ring protocol where the stations are equally spaced. When a station… Read More
Consider a token ring topology with N stations (numbered 1 to N) running token ring protocol where the stations are equally spaced. When a station… Read More
Consider the regular expression R = (a + b)* (aa + bb) (a + b)*<br> Which one of the regular expressions given below defines the… Read More
Consider the regular expression R = (a + b)* (aa + bb) (a + b)* Which deterministic finite automaton accepts the language represented by the… Read More
Consider the regular expression R = (a + b)* (aa + bb) (a + b)*<br> Which of the following non-deterministic finite automata recognizes the language… Read More
Your are given the following four bytes : 10100011            00110111            11101001        … Read More
Consider the following clauses: i. Not inherently suitable for client authentication. ii. Not a state sensitive protocol. iii. Must be operated with more than one… Read More
Consider the following relation schemas : b-Schema = (b-name, b-city, assets) a-Schema = (a-num, b-name, bal) d-Schema = (c-name, a-number) Let branch, account and depositor… Read More