Gate Exam

Consider the following sequence of micro operations MBR

Read Solution (Total 0)

Gate Other Question

Consider a hard disk with 16 recording surfaces (0 15) having 16384 cylinders (0 16383) and each cylinder contains 64 sectors (0 63). Data storage capacity in each sector is 512 bytes. Data are organized cylinder wise and the addressing format is . A file of size 42797 KB is stored in the disk and the starting disk location of the file is . What is the cylinder number of the last sector of the file, if it is stored in a contiguous manner?

Option
(A) 1281
(B) 1282
(C) 1283
(D) 1284 The line graph L(G) of a simple graph G is defined as follows:
There is exactly one vertex v(e) in L(G) for each edge e in G.
For any two edges e and in G, L(G) has an edge between v(e) and v(), if
and only if e and e- are incident with the same vertex in G.
Which of the following statements is/are TRUE?
(P) The line graph of a cycle is a cycle.
(Q) The line graph of a clique is a clique.
(R) The line graph of a planar graph is planar.
(S) The line graph of a tree is a tree.

Option
(A) P only
(B) P and R only
(C) R only
(D) P, Q and S only