GPL - Gate Question |

X Close

You need to enable javascript to view this page properly.

Branch

All

Loading

265.

In a token ring network the transmission speed is 10⁷ bps and the propagation speed is 200 metres/µs. The 1-bit delay in this network is equivalent to: [2 marks]
(A) 500 metres of cable.
(B) 200 metres of cable.
(C) 20 metres of cable.
(D) 50 metres of cable.

asked in Computer Science And Engineering, 2007

View Comments [0 Reply]
266.

There are n stations in a slotted LAN. Each station attempts to transmit with a probability p in each time slot. What is the probability that ONLY one station transmits in a given time slot? [2 marks]
(A) np(1-p)^n-1
(B) (1-p)^n-1
(C) p(1-p)^n-1
(D) 1- (1-p)^n-1

asked in Computer Science And Engineering, 2007

View Comments [0 Reply]
267.

Consider the following schedules involving two transactions. Which one of the following statements is TRUE?

[2 marks]
(A) Both S₁ and S₂ are conflict serializable.
(B) S₁ is conflict serializable and S₂ is not conflict serializable.
(C) S₁ is not conflict serializable and S₂ is conflict serializable.
(D) Both S₁ and S₂ are not conflict serializable.

asked in Computer Science And Engineering, 2007

View Comments [0 Reply]
268.

The order of a leaf node in a B⁺-tree is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is 1K bytes, data record pointer is 7 bytes long, the value field is 9 bytes long and a block pointer is 6 bytes long, what is the order of the leaf node? [2 marks]
(A) 63
(B) 64
(C) 67
(D) 68

asked in Computer Science And Engineering, 2007

View Comments [0 Reply]
269.

Which one of the following statements if FALSE? [2 marks]
(A) Any relation with two attributes is in BCNF
(B) A relation in which every key has only one attribute is in 2NF
(C) A prime attribute can be transitively dependent on a key in a 3 NF relation.
(D) A prime attribute can be transitively dependent on a key in a BCNF relation.

asked in Computer Science And Engineering, 2007

View Comments [0 Reply]
270.

Consider the table employee(empId, name, department, salary) and the two queries Q₁, Q₂ below. Assuming that department 5 has more than one employee, and we want to find the employees who get higher salary than anyone in the department 5, which one of the statements is TRUE for any arbitrary employee table?
Q1 :: Select e.empId
From employee e
Where not exists
(Select * From employee s where s.department = “5” and s.salary >=e.salary)
Q2 :: Select e.empId
From employee e
Where e.salary > Any
(Select distinct salary From employee s Where s.department = “5”)
[2 marks]
(A) Q₁ is the correct query
(B) Q₂ is the correct query
(C) Both Q₁ and Q₂ produce the same answer.
(D) Neither Q₁ nor Q₂ is the correct query

asked in Computer Science And Engineering, 2007

View Comments [0 Reply]

801 1 ...‹‹43 4445 46 47 ›› ... 134

High Frequency Word List with Mnemonics

GPL Dictionary is fast way to learn words with mnemonics.
It contains high frequency word list which are mostly asked in various examinations.
It is dedicated for student appearing for PSUs, GRE, UPSC or any other exams in which vocabulary test is taken.
User can save their own mnemonics (key and link).

Check Now