Gate Exam

Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal to

option
(A) 15
(B) 30
(C) 90
(D) 360

Read Solution (Total 0)

Gate Other Question

Suppose a circular queue of capacity ( n-1) elements is implemented with an array of n elements.
Assume that the insertion and deletion operations are carried out using REAR and FRONT as array
index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect queue full
and queue empty are

option
(A) full: (REAR+1) mod n == FRONT
empty: REAR == FRONT

(B) full: (REAR+1) mod n == FRONT
empty: (FRONT+1) mod n == REAR

(C) full: REAR == FRONT
empty: (REAR+1) mod n == FRONT

(D) full: (FRONT+1) mod n == REAR
empty: REAR == FRONT
A file system with 300 GByte disk uses a file descriptor with 8 direct block addresses, 1 indirect
block address and 1 doubly indirect block address. The size of each disk block is 128 Bytes and the size of each disk block address is 8 Bytes. The maximum possible file size in this file system is
(A) 3 KBytes
(B) 35 KBytes
(C) 280 KBytes
(D) dependent on the size of the disk