GeeksforGeeks

In a token ring network the transmission speed is 7^10 bps and the propagation speed is 200 metres/microsec. The 1-bit delay in this network is equivalent to:
(A) 500 metres of cable.
(B) 200 metres of cable.
(C) 20 metres of cable.
(D) 50 metres of cable.

Normally user programs are prevented from handling I/O directly by I/O instructions in them. For CPUs having explicit I/O instructions, such I/O protection is ensured by having the I/O instructions privileged. In a CPU with memory mapped I/O, there is no explicit I/O instruction. Which one of the following is true for a CPU with memory mapped I/O?
(a) I/O protection is ensured by operating system routine(s)
(b) I/O protection is ensured by a hardware trap
(c) I/O protection ...

Increasing the RAM of a computer typically improves performance because:
(a) Virtual memory increases
(b) Larger RAMs are faster
(c) Fewer page faults occur
(d) Fewer segmentation faults occur

Match the following:
(P) SMTP
(Q) BGP
(R) TCP
(S) PPP

(1) Application layer
(2) Transport layer
(3) Data link layer
(4) Network layer
(5) Physical layer

(A) P - 2 Q - 1 R - 3 S - 5
(B) P - 1 Q - 4 R - 2 S - 3
(C) P - 1 Q - 4 R - 2 S - 5
(D) P - 2 Q - 4 R - 1 S - 3

Which languages necessarily need heap allocation in the runtime environment?
(A) Those that support recursion
(B) Those that use dynamic scoping
(C) Those that allow dynamic data structures
(D) Those that use global variables

The atomic fetch-and-set x, y instruction unconditionally sets the memory location x to 1 and fetches the old value of x n y without allowing any intervening access to the memory location x. consider the following implementation of P and V functions on a binary semaphore S.

void P (binary_semaphore *s)
  unsigned y;
  unsigned * = &(s—>value);
  do
    fetch—and—set x, y;
  while (y)

void V (binary_semaphore *s)
   S—>value = 0;

Which one of the followin...

A CPU has a five-stage pipeline and runs at 1 GHz frequency. Instruction fetch happens in the first stage of the pipeline. A conditional branch instruction computes the target address and evaluates the condition in the third stage of the pipeline. The processor stops fetching new instructions following a conditional branch until the branch outcome is known. A program executes io instructions out of which 20% are conditional branches. If each instruction takes one cycle to complete on average,...

Group 1 contains some CPU scheduling algorithms and Group 2 contains some applications. Match entries in Group 1 to entries in Group 2.

Group I                                                       Group II
(P) Gang Scheduling                          (1) Guaranteed Scheduling
(Q) Rate Monotonic Scheduling      (2) Real-time Scheduling
(R) Fair Share Scheduling                 (3) Thread Scheduling

(A) P - 3 Q - 2 R - 1
(B) P - 1 Q - 2 R - 3
(C) P - 2 Q - 3 R -...

What is the chromatic number of an n-vertex simple connected graph which does not contain any odd length cycle? Assume n >= 2.
(A) 2
(B) 3
(C) n-1
(D) n

Which one of the following are essential features of an object-oriented programming language?
(i) Abstraction and encapsulatoin
(ii) Strictly-typedness
(iii) Type-safe property coupled with sub-type rule
(iv) Polymorphism in the presence of inheritance

(a) (i) and (ii) only
(b) (i) and (iv) only
(c) (i), (ii) and (iv) only
(d) (i), (iii) and (iv) only

Which data structure in a compiler is used for managing information about variables and their attributes?
(A) Abstract syntax tree
(B) Symbol table
(C) Semantic stack
(D) Parse table

An organization has a class B network and wishes to form subnets for 64 departments. The subnet mask would be:
(a) 255.255.0.0
(b) 255.255.64.0
(c) 255.255.128.0
(d) 255.255.252.0

#include <stdio.h>
int f(int n, int k)
{
   if (n == 0) return 0;
   else if (n%2) return f(n/2, 2*k) + k;
   else return f(n/2, 2*k) + k;
}
int main () {
   printf("%d",f(20,1));
   return 0;
}

How many distinct paths are there for the robot to reach the point starting from the initial position (0,0)?
(A)20 C 10 
(B) 20 C 2
(C) 10 C 2
(D) None of the above

Which of the following are true?

I. A programming language which does not permit global variables of any kind and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation

II. Multi-level access link (or display) arrangement is needed to arrange activation records only if the programming language being implemented has nesting of procedures/functions

III. Recursion in programming languages cannot be implemented with dyn...

What is the probability that divisor of 10^99 is a multiple of 10^96?
(A) 1/625 (B) 4/625 (C) 12/625 (D) 16/625