ISRO Scientist/Engineer CS Solved Papers
Prepare for ISRO ICRB examinations with verified solutions covering Algorithms, Theory of Computation, Compiler Design, Computer Architecture, OS, Discrete Mathematics, and Computer Networks.
All ISRO CS PYQs / All CS Subjects / All Topics
Marking scheme: +3.00 positive, -0.75 negative (ICRB Standard).
The number of edges in a 'n' vertex complete graph is ?
The binary equivalent of the decimal number 42.75 is
Which of the following is not provided as a service in cloud computing?
The built-in base class in Java, which is used to handle all exceptions is
In graphics, the number of vanishing points depends on
The encoding technique used to transmit the signal in giga ethernet technology over fiber optic medium is
Which of the following is an unsupervised neural network
In compiler terminology, reduction in strength means
The following table shows the processes in the ready queue and time required for each process for completing its job.
| Process | Time (ms) |
|---|---|
| $P_1$ | 10 |
| $P_2$ | 5 |
| $P_3$ | 20 |
| $P_4$ | 8 |
| $P_5$ | 15 |
If round robin scheduling with 5ms is used what is the average waiting time of the processes in the queue?
MOV [BX], AL type of data addressing is called
Evaluate (X xor Y) xor Y
Which of the following is true about the z-buffer algorithm?
What is the decimal value of the floating-point number C1D00000 (hexadecimal notation)? (Assume 32-bit, single precision floating point IEEE representation)
What is the raw throughput of USB 2.0 technology?
Below is the precedence graph for a set of tasks to be executed on a parallel processing system S.
What is the efficiency of this precedence graph on S if each of the tasks T1,..., T8 takes the same time and the system S has five processors?
How many distinct binary search trees can be created out of 4 distinct keys?
The network protocol which is used to get MAC address of a node by providing IP address is
Which of the following statements about peephole optimizations is False?
Which one of the following in place sorting algorithms needs the minimum number of swaps?
What is the equivalent serial schedule for the following transactions?
| Transaction $T_1$ | Transaction $T_2$ | Transaction $T_3$ |
|---|---|---|
| $R(Y)$ | ||
| $R(Z)$ | ||
| $R(X)$ | ||
| $W(X)$ | ||
| $W(Y)$ | ||
| $W(Z)$ | ||
| $W(Z)$ | ||
| $R(Y)$ | ||
| $W(Y)$ | ||
| $R(Y)$ | ||
| $W(Y)$ | ||
| $R(X)$ | ||
| $W(X)$ |
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?
A context model of a software system can be shown by drawing a
An example of poly-alphabetic substitution is
The IEEE standard for WiMax technology is
If node A has three siblings and B is parent of A, what is the degree of A?