• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

ISRO CS 2011

Question 1

Consider a direct mapped cache with 64 blocks and a block size of 16 bytes. To what block number does the byte address 1206 map to
  • does not map
  • 6
  • 11
  • 54

Question 2

A context model of a software system can be shown by drawing a

  • LEVEL-0 DFD

  • LEVEL-1 DFD

  • LEVEL-2 DFD

  • LEVEL-3 DFD

Question 3

The encoding technique used to transmit the signal in giga ethernet technology over fiber optic medium is
  • Differential Manchester encoding
  • Non return to zero
  • 4B/5B encoding
  • 8B/10B encoding

Question 4

Which of the following is an unsupervised neural network?
  • RBS
  • Hopfield
  • Back propagation
  • Kohonen

Question 5

In compiler terminology reduction in strength means
  • Replacing run time computation by compile time computation
  • Removing loop invariant computation
  • Removing common subexpressions
  • replacing a costly operation by a relatively cheaper one

Question 6

The following table shows the processes in the ready queue and time required for each process for completing its job.
Process    Time
P1          10
P2          5
P3          20
P4          8
P5          15
If round-robin scheduling with 5 ms is used what is the average waiting time of the processes in the queue?
  • 27 ms
  • 26.2 ms
  • 27.5 ms
  • 27.2 ms

Question 7

MOV [BX], AL type of data addressing is called ?
  • register
  • immediate
  • register indirect
  • register relative

Question 8

Evaluate (X xor Y) xor Y?
  • All 1\'s
  • All 0\'s
  • X
  • Y

Question 9

Which of the following is true about z-buffer algorithm?
  • It is a depth sort algorithm
  • No limitation on total number of objects
  • . Comparisons of objects is done
  • z-buffer is initialized to background colour at start of algorithm

Question 10

What is the decimal value of the floating-point number C1D00000 (hexadecimal notation)? (Assume 32-bit, single precision floating point IEEE representation)
  • 28
  • -15
  • -26
  • -28

There are 80 questions to complete.

Last Updated :
Take a part in the ongoing discussion