GeeksforGeeks

For a magnetic disk with concentric circular tracks, the seek latency is not linearly proportional to the seek distance due to
(A) non-uniform distribution of requests
(B) arm starting and stopping inertia
(C) higher capacity of tracks on the periphery of the platter
(D) use of unfair arm scheduling policies

A CPU generally handles an interrupt by executing an interrupt service routine
(A) As soon as an interrupt is raised
(B) By checking the interrupt register at the end of fetch cycle.
(C) By checking the interrupt register after finishing the execution of the current instruction.
(D) By checking the interrupt register at fixed time intervals

A thread is usually defined as a ‘light weight process’ because an operating system (OS) maintains smaller data structures for a thread than for a process. In relation to this, which of the followings is TRUE?
(A) On per-thread basis, the OS maintains only CPU register state
(B) The OS does not maintain a separate stack for each thread
(C) On per-thread basis, the OS does not maintain virtual memory state
(D) On per thread basis, the OS maintains only scheduling an...

A computer on a 10Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 2Mbps. It is initially filled to capacity with 16Megabits. What is the maximum duration for which the computer can transmit at the full 10Mbps?
(A) 1.6 seconds
(B) 2 seconds
(C) 5 seconds
(D) 8 seconds

Consider a hypothetical processor with an instruction of type LW R1, 20(R2), which during execution reads a 32-bit word from memory and stores it in a 32-bit register R1. The effective address of the memory location is obtained by the addition of constant 20 and the contents of register R2. Which of the following best reflects the addressing mode implemented by this instruction for the operand in memory?
(A) Immediate Addressing
(B) Register Addressing
(C) Register Indirect ...

In a binary tree with n nodes, every node has an odd number of descendants. Every node is considered to be its own descendant. What is the number of nodes in the tree that have exactly one child?
(A) 0 (B) 1 (C) (n−1)/2 (D) n-1

Let the page fault service time be 10ms in a computer with average memory access time being 20ns. If one page fault is generated for every 106 memory accesses, what is the effective access time for the memory?
(A) 21ns
(B) 30ns
(C) 23ns
(D) 35ns

What must be the hit ratio in order to reduce the effective memory access time from 200ns to 140ns if tlb lookup time is 20ns

What is the possible number of reflexive relations on a set of 5 elements?
(A) 210 (B) 215 (C) 220 (D) 225

In an instruction execution pipeline, the earliest that the data TLB (Translation Lookaside Buffer) can be accessed is
(A) Before effective address calculation has started
(B) During effective address calculation
(C) After effective address calculation has completed
(D) After data cache lookup has completed

A client process P needs to make a TCP connection to a server process S. Consider the following situation: the server process S executes a socket (), a bind () and a listen () system call in that order, following which it is preempted. Subsequently, the client process P executes a socket () system call followed by connect () system call to connect to the server process S. The server process has not executed any accept () system call. Which one of the following events could take place?
...

If a class B network on the Internet has a subnet mask of 255.255.248.0, what is the maximum number of hosts per subnet?
(A) 1022
(B) 1023
(C) 2046
(D) 2047

Which of the following uses UDP as transport protocol
1) HTTP
2) Telnet
3) DNS
4) SMTP

Two processes, P1 and P2, need to access a critical section of code. Consider the following synchronization construct used by the processes:

/* P1 */
while (true) {
  wants1 = true;
  while (wants2==true);
    /* Critical Section */
  wants1=false;
}
/* Remainder section */

/* P2 */
while (true) {
wants2 = true;
while (wants1==true);
/* Critical Section */
Wants2=false;
}
/* Remainder section */

Here, wants1 and wants2 are shared variables, which are initiali...

What is the maximum size of data that the application layer can pass on to the TCP layer below?
(A) Any size
(B) 2^16 bytes-size of TCP header
(C) 2^16 bytes
(D) 1500 bytes

In the slow start phase of the TCP congestion control algorithm, the size of the congestion window
(A) does not increase
(B) increases linearly
(C) increases quadratically
(D) increases exponentially

Consider the process of inserting an element into a Max Heap, where the Max Heap is represented by an array. Suppose we perform a binary search on the path from the new leaf to the root to find the position for the newly inserted element, the number of comparisons performed is:
(A) Theta (log n )
(B) Theta (logLog n )
(C) Theta(n)
(D) Theta(nlog n)