ISRO - CS Questions

1. Let A(1:8, -5:5, -10:5) be a three dimensional array.
How many elements are there

in the array A?
A. 1200
B. 1408
C. 33
D. 1050
Answer ||| B
Solution ||| Here they have specified the size
So 1:8 mean 8 elements ( both are inclusive )
(-5 : 5 ) mean 11 elements
(-10 : 5 ) mean 16 elements
So no of elements will be ( just like Multidimensional array will be )
8*11*16=1408.
Question Type |||
Linked To Above Question|||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
Topic ||| Level I || Level II || Level III
PYSP ||| ISRO-CS-2013
2. The number of rotations required to insert a sequence of elements 9,6,5,3,7,10 into
an empty AVL tree is?
A. 0
B. 1
C. 2
D. 3
Answer ||| D
Solution ||| Number of rotation = 3
Following are the rotation
1. LL
2. LL
3. RR
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
3. Opportunistic reasoning is addressed by which of the following knowledge
representation
A. Script
B. Blackboard
C. Production Rules
D. Fuzzy Logic
Answer ||| D
Solution ||| Opportunistic reasoning is a method of selecting a suitable logical
inference strategy within artificial intelligence applications.
So Fuzzy Logic is used in artificial intelligence applications.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
4. The following steps in a linked list
p = getnode()
info (p) = 10
next (p) = list
list = p
result in which type of operation?
A.
B.
C.
D.
a pop operation in stack

removal of a node
inserting a node
modifying an existing node
Answer ||| C
Solution ||| A node have 2 fields associate with it

1. Data (The information that it contain )
2 . Next --- (which point to the next node )
The line P= get node () ; mean you are allocating a space for a new node that
you want to create
Then you from second line info(p)=10 mean you are setting the info value to
10
And then you are updating list Field
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
5. Shift reduce parsing belongs to a class of
A. bottom up parsing
B. top down parsing
C. recursive parsing
D. predictive parsing
Answer ||| A
Solution ||| Bottom up parsing is right Shift reduce belong to bottom up.
Top down include
1) Recursive
2) Predictive.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
6. Which of the following productions eliminate left recursion in the productions given
below:
S Aa | b
A Ac | Sd |
A.
B.
C.
D.
S
S
S
S
Aa
Aa
Aa
Aa
|
|
|
|
b,
b,
b,
b,
A bdA',
A A' | bdA
A Ac | A'd
A cA' | adA | bdA'
A
A'
A
A'
Ac | A'ba | A |
cA' | adA |
bdA' | cA |
A |
Answer ||| B
Solution ||| Your question is wrong
It should be S-->Aa/d
and A--> Ac / Aad/ epsilon
Then for this Option B is correct !
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
7. Consider the following psuedocode:
x : integer := 1
y : integer := 2
f
procedure add
x := x + y
procedure second (P: procedure)
x : integer := 2
P()
procedure first
y : integer := 3
Second(add)
first()
write _integer (x)
What does it print if the language uses dynamic scoping with deep binding?
A. 2
B. 3
C. 4
D. 5
Answer ||| D
Solution ||| Deep binding binds the environment at the time the procedure is passed as an
argument. So using Dynamic scoping with deep access it will find global
variable x and update x to 4 .While Shallow binding binds the environment at
the time the procedure is actually called. Shallow binding just traverses up until
it finds the nearest variable that corresponds to the name so the answer would
be 2+3=5.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
8. Which logic gate is used to detect overflow in 2's complement arithmetic?
A. OR gate
B. AND gate
C. NAND gate
D. XOR gate
Answer ||| D
Solution ||| The following are characteristics of XOR GATE-:
If the sum of two positive numbers yields a negative result, the sum has
overflowed.
If the sum of two negative numbers yields a positive result, the sum has
overflowed.
Otherwise, the sum has not overflowed.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4

9. In an array of 2N elements that is both 2-ordered and 3-ordered, what is the
maximum number of positions that an element can be from its position if the array
were 1-ordered?
A. 1
B. 2
C. N/2
D. 2N-1
Answer ||| A
Solution ||| An array A [ 1 n] is said to be k-ordered if
A [i - k] < A [ i ] < A [i + k]
for each i such that k < i < n k.
For example, the array 1 4 2 6 3 7 5 8 is 2- ordered.
Now come to question
array is both 2 ordered and 3 ordered.i.e.
12345678
Now if the array were 1-ordered
then array will be 1 2 3 4 5 6 7 8
maximum number of positions that an element can be from its position=1.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
10. If the frame buffer has 8 bits per pixel and 8 bits are allocated for each of the R, G, B
components, what would be the size of the lookup table?
A. 24 bytes
B. 1024 bytes
C. 768 bytes
D. 256 bytes
Answer ||| C
Solution ||| There are 2^8 = 256 entries in the lookup table with each entry size equal to
3*8 = 24 bits.
Hence, total size of memory = 256*24/8 bytes = 768 bytes.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
11. When two BCD numbers 0x14 and 0x08 are added what is the binary representation
of the resultant number?
A. 0x22
B. 0x1 c '
C. 0x16
D. results in overflow
Answer ||| A
Solution ||| 0x14=14
0x08=8
15 + 8 = 22. In BCD representation 4 bits represent a decimal digit from 0-9.
So, here forst 4 bits represent 2, and next four bots represent 2 again.
0010 0010 = 0x22
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
12. Which of the following sorting algorithms has the minimum running time complexity
in the best and average case?
A.
B.
C.
D.
Insertion sort, Quick sort

Quick sort, Quick sort
Quick sort, Insertion sort
Insertion sort, Insertion sort
Answer ||| A
Solution ||| Insertion sort best case O(n)
Quick sort avg case O(n log n)
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
13. The number 1102 in base 3 is equivalent to 123 in which base system?
A. 4
B. 5
C. 6
D. 8
Answer ||| B
Solution ||| (1102)3=133+132+2=38
(123)x=1x2+2x+3
Now, 1x2+2x+3=38
x=5
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4

14. A processor is fetching instructions at the rate of 1 MIPS. A DMA module is used to
transfer characters to RAM from a device transmitting at 9600 bps. How much time
will the processor be slowed down due to DMA activity?
A. 6 ms
B. 4.8 ms
C. 2.4 ms
D. 1.2 ms
Answer ||| D
Solution ||| Assuming Data Width of the System bus is Byte, DMA Will run every Cycle for
every Byte. which has arrived.
So,
10^6 bits in 1 second
1 bit in 1/10^6 second
9600 bits in 9600* 1/10^6 seconds
9600/8 bytes in 9600/8* 1/10^6 seconds
Which gives 1.2 ms or 1MIPS..
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
15. A pipeline P operating at 400 MHz has a speedup factor of 6 and operating at 70%
efficiency. How many stages are there in the pipeline?
A. 5
B. 6
C. 8
D. 9
Answer ||| D
Solution ||| Efficiency of K stage Pipeline = Speed Up Factor (Sk) / Number of Stages (K)
0.70 = 6/K
K = 6/0.70 = 8.57 9
Number of Stages = 9
Question Type |||

Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
16. How much speed do we gain by using the cache, when cache is used 80% of the
time? Assume cache is faster than main memory.
A. 5.27
B. 2.00
C. 4.16
D. 6.09
Answer ||| C
Solution ||| Tcache<<TmemoryTcache<<Tmemory
We can assume memory is accessed only on a cache miss (hierarchical memory
access by default) and hence on cache miss we first access cache and then only
main memory (both times are added here)
Speed Gain=Memory Access Time without Cache Memory Access Time with
Cache Speed Gain=Memory Access Time without Cache Memory Access Time
with Cache
=TmemoryTcache+0.20.Tmemory=1TcacheTmemory+0.20=TmemoryT
cache+0.20.Tmemory=1TcacheTmemory+0.20
TcacheTmemory=x,0<x0.1TcacheTmemory=x,0<x0.1 ( Since cache (say
last level cache) is faster than memory by at least 10 times)
Speed Gain=10.20+x3.33Speed Gain<5Speed
Gain=10.20+x3.33Speed Gain<5
It will go through 4.16.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4

17. Two eight bit bytes 1100 0011 and 0100 1100 are added. What are the values of the
overflow, carry and zero flags respectively, if the arithmetic unit of the CPU uses 2's
complement form?
A. 0 ,1 ,1 '
B. 1, 1, 0
C. 1, 0, 1
D. 0, 1,0
Answer ||| D
Solution ||| 11000011
01001100
= (1) 00001111 with Carry =1 (specified in bracket )
The zero flag will be set if result is 0 . but here the result is not 0 so zero flag is
set to 0
For overflow we have condition of C = Carryout Exor Carry In
where Carry out is carry from MSB (bit 8 )
8
// taking byte as from bit1 to bit
Carry in carry from bit 7

So carry out = 1
carry in 1
so exor of both of them is 0 --- which will be carry flag
So option d
carry flag - 1sum -- 0 overflow is 0
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4

18. How many check bits are required for 16 bit data word to detect 2 bit errors and
single bit correction using hamming code?
A. 5
B. 6
C. 7
D. 8
Answer ||| A
Solution ||| You would have parity bits at the position 1, 2, 4,8,16 (assuming my rep start
from 0).
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
19. What is the maximum number of characters (7 bits + parity) that can be transmitted
in a second on a 19.2 kbps line. This asynchronous transmission requires 1 start bit
and 1 stop bit.
A. 192
B. 240
C. 1920
D. 1966
Answer ||| C
Solution ||| 19.2*10^3 bits -is transfer per second
19200 bit is transfer per second
Now they say 1 character is made 7 bits + 1 parity = 8 bits
Since it is asynchronous whenever you are sending it would require 1 start and
stop bit .So 10 bit now is required to send 1 character
Number of character that can be send is 19200/10 = 1920 character.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
20. IEEE 1394 is related to
A. RS-232
B. USB
C. Firewire
D. PCI
Answer ||| C
Solution ||| IEEE 1394 is an interface standard for a serial bus for high-speed
communications and isochronous real-time data transfer. It was developed in
the late 1980s and early 1990s by Apple, which called it FireWire.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
21. What will be the cipher text produced by the following cipher function for the plain
text ISRO with key k =7. [Consider 'A' = 0, 'B' =1,. 'Z '= 25]
Ck(M) = (kM + 13) mod 26
A. RJCH
B. QIBG
C. GQPM
D. XPIN
Answer ||| A
Solution ||| See A=0 B=1 C=2 .......... you will get I = 8 ................
Now you just apply the cipher function character wise ,
BY THE WAY IN THE ABOVE FUNCTION M STANDS FOR 1 character one by one
of input
So our first character is I
C( I ) = ( KM+13) MOD 26 =(7*8+13)MOD 26 = 17 and if you see 17 is R
value
So just from the first character you can get answer RJCH
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
22. Any set of boolean operators that is sufficient to represent all boolean expressions is
said to be complete. Which of the following is not complete?
A. {NOT, OR}
B. {NOR}
C. {AND, OR}
D. {AND, NOT}
Answer ||| C
Solution ||| NAND AND NOR are universal gate and with the help of these gates we can
implement any other function. Hence they are called functionally complete
option a)
Not + Or = Nor gate only
option b ) It says NOR
option d ) And + not = NAND gate
So remaining is option c---which is answer :)
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
23. Which of the following is the highest isolation level in transaction management?
A.
B.
C.
D.
Serializable
Repeated Read
Committed Read
Uncommitted Read
Answer ||| A
Solution ||| Serializable is the highest isolation level in transaction management.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
24. Consider the following relational schema:
Suppliers (sid:inteqer, sname:strinq, saddress:strinq)
Parts (pid:inteqer, pname:strinq, pcolor:strinq)
Cataloq (sid:inteqer, pid:inteqer, pcost:real)
What is the result of the following query?
(SELECT Catalog.pid from Suppliers, Catalog
WHERE Suppliers.sid = Catalog.pid)
MINUS
(SELECT Catalog.pid from Suppliers, Catalog
WHERE Suppliers.sname <> sachin and Suppliers.sid = Catalog.sid)
A. pid of Parts supplied by all except sachin
B. pid of Parts supplied only by sachin
C. pid of Parts available in catalog supplied by sachin
D. pid of Parts available in catalogs supplied by all except scahin
Answer ||| C
Solution ||| Here in 1st query we are joining Catalog and Supplier and getting those supplier
and parts which are available in Catalog
In 2nd query we are doing same as 1st query but just removing those rows
where Supplier name sachin
So, resulting table has only those rows where catalog. name is sachin
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
25. Consider the following dependencies and the BOOK table in a relational database
design. Determine the normal form of the given relation.
ISBN Title
ISBN Publisher
Publisher Address
A. First Normal Form
B. Second Normal Form
C. Third Normal Form
D. BCNF
Answer ||| B
Solution ||| second normal form.
We first need to find Candidate key by taking closure of attributes = ISBN
Now with ER modeling we get relation in 1 NF.
for 2nf , we shouldnt have any partial dependency ( A non key shouldnt be
fully functionally dependent on a subset of Ck )
Since our Ck is 1 attribute only we wont have that partial dependency
But now for 3nf , if you see we have Address which is transitively dependent on
ISBN. Hence Transitive dependency exists.
So relation is in 2nf and not in 3nf.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
26. Calculate the order of leaf (pleaf) and non leaf (p) nodes of a B+tree based on the
information given below
Search key field = 12 bytes
Record pointer =10 bytes

Block pointer = 8 bytes
Block size = 1 KB
A. Pleaf = 51 & p = 46
B. Pleaf = 4 7 & p = 5 2
C. Pleaf = 46 & p = 51
D. Pleaf = 52 & p = 47
Answer ||| C
Solution ||| Pleaf
1*BP + (Pleaf )*(key +Record Pointer) <= Block size
Pleaf<=46.18
Pnonleaf
P*Block Pointer +(P-1)*(Key) <= Block Size
Pnonleaf <=51.8
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
27. The physical location of a record determined by a formula that transforms a file key
into a record location is
A. Hashed file
B. B-Tree file
C. Indexed file
D. Sequential file
Answer ||| A
Solution ||| For the rest you dont use any formula to determine physical location of records
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
28. The most simplified form of the boolean function
x (A,B,C,D) = (7,8,9,10,11,12,13,14,15)
(expressed in sum of minterms) is?
A. A + A'BCD
B. AB + CD
C. A + BCD
D. ABC + D
Answer ||| C
Solution |||
Question Type |||

Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
29. How many programmable fuses are required in a PLA which takes 16 inputs and
gives 8 outputs? It has to use 8 OR gates and 32 AND gates.
A. 1032
B. 776
C. 1284
D. 1536
Answer ||| C
Solution |||
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
30. In a tree stage counter, using RS flip flops what will be the value of the counter after
giving 9 pulses to its input? Assume that the value counter before giving any pulses
is 1.
A. 1
B. 2
C. 9
D. 10
Answer ||| B
Solution ||| 3 stage counter with RS FF is 3 bit counter, so after every 8 clock pulse, it will
return to initial state.
Initial state is 1, state after 8 clock pulse will be 1, So, after 9th clock pulse ,
state will be 2.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
31. In which of the following shading models of polygons, the interpolation of intensity
values is done along the scan line?
A. Gourard shading
B. Phong shading
C. Constant shading
D. Flat shading
Answer ||| B
Solution ||| Phong shading is one of the most useful shading algorithms in computer
generated images as it provides high degree of practicality. It is slowest but
provides best quality of images. The first stage in the process is the same as
for the Gouraud Shading - for any polygon we evaluate the vertex normals [9].
or each scan line in the polygon we evaluate by linear interpolation the normal
vectors at the end of each line. These two vectors Na and Nb are then used to
interpolate Ns . We thus derive a normal vector for each point or pixel on the
polygon that is an approximation to the real normal on the curved surface
approximated by the polygon. Ns, the interpolated normal vector, is then used
in the intensity calculation. The vector interpolation tends to restore the
curvature of the original surface that has been approximated by a polygon
mesh. Phong shading species how to calculate color on every point of surface.
But calculating of color at every point may be slow therefore phong shading
employs calculating intensities at vertices only and then apply interpolation to
calculate in between points(between pixels) [7]. The algorithm is as follows: 1)
Compute a normal N for each vertex of the polygon. 2) From bi-linear
interpolation compute a normal, Ni for each pixel. 3) From Ni compute intensity
Ii for each pixel of the polygon. 4) Paint pixel to shade corresponding to Ii.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
32. Which of the following number of nodes can form a full binary tree?
A. 8
B. 15
C. 14
D. 13
Answer ||| B
Solution |||
Question Type |||

Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
33. What is the matrix transformation which takes the independent vectors
and transforms them to
1 1
1 0
0
0
B.
0.5 0.5
1 1
C.
1 1
A.
1
3
1 and 2 respectively?
1
2
2 and 5

D.
1
1
1
0
Answer ||| D
Solution |||
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
34. In 8086, the jump condition for the instruction JNBE is?
A. CF = 0 or ZF = 0
B. ZF = 0 and SF = 1
C. CF = 0 and ZF = 0
D. CF = 0
Answer |||
Solution |||
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
35. How many number of times the instruction sequence below will loop before coming
out of the loop?
MOV AL, 00H
A1:
INCAL
JNZ A1
A.
B.
C.
D.
1
255
256
Will not come out of the loop
Answer ||| D
Solution ||| Answer would be D Since AL = 00H =0000 0000 H after incrementing it every
time it will be 0000 0001 0000 00010 .... 1111 1111 (highest value ) and then
again incrementing will make result back 0000 0000 with Cy 1 so loop doesnt
end and the process goes on.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
36. In 8085 microprocessor, the ISR for handling trap interrupt is at which location?
A. 3CH
B. 34 H
C. 74H
D. 24 H
Answer ||| D
Solution |||
Question Type |||

Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
37. The voltage ranges for a logic high and a logic low in RS-232 C standard is
A. Low is 0.0V to 1.8V, High is 2.0V to 5.0V
B. Low isf-15.0V to -3.0V, High is 3.0V to 15.0V
C. Low is 3.0V to 15.0V, High is-3.0V to-15.0V
D. Low is 2.0V to 5.0V, High is 0.0V to 1,8V
Answer ||| B
Solution |||
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
38. In the Ethernet, which field is actually added at the physical layer and is not part of
the frame
A. Preamble
B. CRC
C. Address
D. Location
Answer ||| A
Solution ||| Preamble of 802.3 frame contains 7 bytes of alternating 0s and 1s that alerts
the receiving system to the coming frame and enables it to synchronize its
input timing. Preamble is added at the physical layer and is not part of the
frame.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
39. Ethernet layer-2 switch is a network element type which gives
A. different collision domain and same broadcast domain
B. different collision domain and different broadcast domain
C. same collision domain and same broadcast domain
D. same collision domain and different broadcast domain
Answer ||| A
Solution ||| A broadcast domain is a logical division of a computer network, in which
all nodes can reach each other by broadcast at the data link layer. A broadcast
domain can be within the same LAN segment or it can be bridged to other LAN
segments. A broadcast domain encompasses a set of devices for when one of
the devices sends a broadcast, all the other devices receive a copy of the
broadcast. In terms of current popular technologies: Any computer connected
to the same Ethernet repeater or switch is a member of the same broadcast
domain. collision domain is the set of LAN interfaces whose frames could collide
with each other, but not with frames sent by any other devices in the network.
The collision is happened when to computer in same time want to use
bandwidth. The CSMA/CD algorithm that deals with the issue of collisions, and
some of the differences between how hubs and switches operate to create
either a single collision domain (hubs) or many collision domains (switches).
Generally speaking in easy terms, A collision domain is a set of network
interface cards (NIC) for which a frame sent by one NIC could result in a
collision with a frame sent by any other NIC in the same collision domain.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
40. If the frame to be transmitted is 1101011011 and the CRC polynomial to be used for
generating checksum is x4 + x + 1, then what is the transmitted frame?
A. 11010110111011
B. 11010110111101
C. 11010110111110
D. 11010110111001
Answer ||| C
Solution |||
Question Type |||

Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
41. What will be the efficiency of a Stop and Wait protocol, if the transmission time for a
frame is 20ns and the propagation time is 30ns?
A. 20%
B. 25%
C. 40%
D. 66%
Answer ||| B
Solution ||| Efficiency in Stop and Wait Protocol is given by
Efficiency = T,transmission / (T,transmission + 2* T,propagation)
Efficiency= 20 / (20+2*30)
= 20/80 =0.25
For percentage = 0.25 * 100 =25%
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
42. IPv6 does not support which of the following addressing modes?
A. unicast addressing
B. multicast addressing
C. broadcast addressing
D. anycast addressing
Answer ||| C
Solution ||| For Unicast, multicast IPV6 support IPV4 firewall.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4

43. What is IP class and number of sub-networks if the subnet mask is 255.224.0.0?
A. class A, 3
B. class A, 8
C. class B, 3
D. class B, 32
Answer ||| B
Solution ||| Subnet mask is 11111111.11100000.00000000.00000000
here 8 bit for network ( all 8 ones )
And 8 bit for network id belong to class A
And next 3 ones used for subnet . Since 3 ones so number of subnet is 2^3=8.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
44. Which algorithm is used to shape the bursty traffic into a fixed rate traffic by
averaging the data rate?
A. solid bucket algorithm
B. spanning tree algorithm
C. hocken helm algorithm
D. leaky bucket algorithm
Answer ||| D
Solution |||
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
45. A packet filtering firewall can
A. deny certain users from accessing a service
B. block worms and viruses from entering the network
C. disallow some files from being accessed through FTP
D. block some hosts from accessing the network
Answer ||| D
Solution ||| A firewall typically establishes a barrier between a trusted, secure internal
network
A packet filtering firewall Block some hosts from accessing the network
Packet filtering works on 3 layer of OSI model .Most of the work is done
between the network and physical layers.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
46. Which of the following encryption algorithms is based on the Fiestal structure?
A. Advanced Encryption Standard
B. RSA public key cryptographic algorithm
C. Data Encryption Standard
D. RC4
Answer ||| C and D
Solution ||| Feistel structure is symmetric key cryptography
DES and RC4 both are symmetric cryptography
So, Answer C) and D)
Question Type |||

Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
47. The protocol data unit for the transport layer in the internet stack is
A. Segment
B. Message
C. Datagram
D. Frame
Answer ||| A
Solution ||| PDU used for Transport Layer is Segment
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
48. The Guass-Seidal iterative method can be used to solve which of the following sets?
A. Linear algebraic equations
B. Linear and non-linear algebraic equations
C. Linear differential equations
D. Linear and non-linear differential equations
Answer ||| A
Solution ||| Guass-Seidal iterative method can be used to solve Linear Algebraic Solution.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
49. What is the least value of the function f(x) = 2x* - 8x - 3 in the interval [ 0, 5]?
A. -15
B. 7
C. -11
D. -3
Answer ||| C
Solution ||| f(x) = 2x2 -8x -3
f'(x)=4x-8
f''(x)=4 , then it has minimal value at the point x=2
minimum value is 2(2)2 -8(2) -3= -11
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
50. Consider the following set of processes, with arrival times and the required CPUburst times given in milliseconds.
Process
Arrival Time
Burst Time
P1
0
4
P2
2
2
P3
3
1
What is the sequence in which the processes are completed? Assume round robin
scheduling with a time quantum of 2 milliseconds.
A. P1, P2, P3
B. P2, P1, P3
C. P3, P2, P1
D. P2, P3, P1
Answer ||| B
Solution |||
0-2
2-4
4-6
6-7
p1
p2
p1
p3
Question Type |||

Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
51. In case of a DVD, the speed of data transfer is mentioned in multiples of?
A. 150 KB/s
B. 1.38 MB/s
C. 300 KB/s
D. 2.40 MB/s
Answer |||
Solution ||| It should be always multiple of 150KB/sec
it represented as N*x where N is number and x is 150kb/sec
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
52. Suppose we have variable logical records of lengths of 5 bytes, 10 bytes, and 25
bytes while the physical block size in disk is 15 bytes. What is the maximum and
minimum fragmentation seen in bytes?
A. 25 and 5
B. 15 and 5
C. 15 and 0
D. 10 and 5
Answer ||| C
Solution ||| Block size 15 B
Maximum we can put 10B and 5B records
So, fragmentation 0.
Maximum fragmentation will be 15B
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
53. A CPU scheduling algorithm determines an order for the execution of its scheduled
processes. Given 'n' processes to be scheduled on one processor, how many possible
different schedules are there?
A. n
B. n2
C. n!
D. 2n
Answer ||| C
Solution ||| preemptive= infinite way
non preemptive=n!
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4

54. Which of the following are the likely causes of thrashing?
A. Page size was very small
B. There are too many users connected to the system
C. Least recently used policy is used for page replacement
D. First in First out policy is used for page replacement
Answer ||| B
Solution ||| option b: There are many user connect to the system . Mean many process are
simultaneously running in the system.
For more process less number of pages for each process would be in memory.
So now for majority of new page request by a process it has to replace its
exists page. Hence the process of paging is done every now and then.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
55. Consider a logical address space of 8 pages of 1024 words each, mapped onto a
physical memory of 32 frames. How many bits are there in the physical address and
logical address respectively?
A. 5,3
B. 10, 10
C. 15, 13
D. 15, 15
Answer ||| C
Solution ||| Physical Memory 32 frames = 25
Size of word 1024 = 210
Total Physical Address Space =15 bits
Logical Memory 8 pages = 23

Size of word = 210
Total Logical Address Space= 10 +3 = 13 bits
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
56. In a 64-bit machine, with 2 GB RAM, and 8 KB page size, how many entries will be
there in the page table if it is inverted?
A. 218
B. 220
C. 233
D. 251
Answer ||| B
Solution ||| RAM 2 GB =231 B
Page size = 8 KB = 213 B
Number of Entries in page table = 231 / 213 =218
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
57. Which of the following is not a necessary condition for deadlock?
A.
B.
C.
D.
Mutual exclusion
Reentrancy
Hold and wait
No pre-emption
Answer ||| B
Solution ||| 4 necessary condition for being deadlock are
Mutual Exclusion
Hold and wait
No Preemption
Circular wait
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
58. Consider the following process and resource requirement of each process.
Process
P1
P2
P3
Type 1
Used
Max
1
2
1
3
2
4
Type 2
Used
1
1
1
Max
3
2
4
Predict the state of this system, assuming that there are a total of 5 instances of
resource type 1 and 4 instances of resource type 2.
A. Can go to safe or unsafe state based on sequence
B. Safe state
C. Unsafe state
D. Deadlock state
Answer ||| B
Solution ||| Total no of resources = 5 ( for A )
4 ( For b )
allocated resources for A = 1+1+2=4
Allocated resources for B = 1+1+1=3

Avl Resources For A = total -avl = 5-4 = 1
Avl Resources For B = Total - avl = 4-3=1
Now this ( 1,1) Cant handle any of one further needs of any process
So answer is Unsafe State.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
59. A starvation free job scheduling policy guarantees that no job indefinitely waits for a
service. Which of the following job scheduling policies is starvation free?
A. Priority queuing
B. Shortest Job First
C. Youngest Job First
D. Round robin
Answer ||| D
Solution ||| Round Robin is starvation free .Each and every process is given equal CPU
time.
While the other Scheduling policy favour a particular type of process ( say
shortest job first ) which will cause Starvation !
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
60. The state of a process after it encounters an I/O instruction is

A. Ready
B. Blocked
C. idle '
D. running
Answer ||| B
Solution ||| The State of a process after it encounters I/O instruction is blocked state. It has
nothing to do with CPU after it encounter I/O instruction.
Hence answer is Blocked state.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
61. Embedded pointer provides
A. a secondary access path
B. a physical record key
C. an inverted index
D. a prime key
Answer ||| A
Solution ||| Embedded Pointer are Pointer Set in a data record So it provides a secondary
access path. Option A is correct.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4

62. A particular parallel program computation requires 100 seconds when executed on a
single CPU. If 20% of this computation is strictly sequential, then theoretically the
best possible elapsed times for this program running on 2 CPUs and 4 CPUs
respectively are
A. 55 and 45 seconds
B. 80 and 20 seconds
C. 75 and 25 seconds
D. 60 and 40 seconds
Answer ||| D
Solution ||| 2 CPU :- CPU1 spends 20 secs for sequential instructions. Remaining 80 secs
work is divided such that CPU1 does 40 sec work and CPU2 does 40 sec work.
But CPU2 cannot start processing until CPU1 finishes its 20 sec work. Hence
time required is 20 + 40 = 60sec.
4 CPU :- CPU1 spends 20 secs for sequential instructions. Remaining 80 secs
work is divided such that CPU1 does 20 sec work, CPU2 does 20 sec work,
CPU3 does 20 sec work and , CPU4 does 20 sec work. But CPU2, CPU3, CPU4
cannot start processing until CPU1 finishes its 20 sec work. Hence time required
is 20 + 20 = 40sec.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
63. Consider the following C code.
#include <stdio.h>
#include <math.h>
void main()
{
double pi = 3.1415926535;
int a = 1;
int i;
for(i=0; i < 3; i++)
if(a = cos(pi * i/2) )
printf("%d",l);
else printf("%d ", 0);
}
What would the program print?
A. 0 0 0
B. 0 1 0
C. 1 0 1
D. 1 1 1
Answer ||| C
Solution ||| Initially I thought there is a typo in this line
if (a = cos(pi * i/2))
Then I checked the ISRO paper and found that it is correct i.e. @makhdoom
has not done any mistake.
According to that,
i = 0 : Cos(0), i.e. a = 1 i.e. condition will be True, hence it will print 1.
i = 1 : Cos(Pi/2) i.e. a = 0 i.e. Condition will be False, Hence It will print 0.
i = 2 : Cos(Pi) i.e. a = -1, i.e. Condition will be True, Hence It will print 1.
Hence answer is C. 101
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
64. What is the output of the following Java program?
Class Test
A.
B.
C.
D.
82
85
83
53
Answer ||| A
Solution ||| Here is the Answer:
z=0z=0 : x=1x=1 and y=1y=1, Because x++;x++; will not be executed
because condition is false
z=1z=1 : x=2x=2 and y=2y=2, Because x++;x++; will not be executed
because condition is false
z=2z=2 : x=4x=4 and y=2y=2, Here x++;x++; will be executed,
but ++y++y will not be executed due to short circuit evaluation
Hence at the end, It will print 8 2.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
65. Consider the list of page references in the time line as below:
96234444344258685532339627
What is the working set at the penultimate page reference if A is 5?
A. {8,5,3,2,9,6}
B. {4,3,6,2,5}
C. {3,9,6,2,7}
D. {3,9,6,21}
Answer ||| C
Solution |||
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
66. What is the cyclomatic complexity of a module which has seventeen edges and
thirteen nodes?
A. 4
B. 5
C. 6
D. 7
Answer ||| C
Solution ||| Cyclomatic complexity is used for testing purpose . It is calculated by using
below formula E-N+2
=17-13+2
=4+2
=6
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4

67. Which of the following types of coupling has the weakest coupling?
A. Pathological coupling
B. Control coupling
C. Data coupling
D. Message coupling
Answer ||| D
Solution ||| Message coupling :This is the loosest type of coupling. It can be achieved by
state decentralization (as in objects) and component communication is done via
parameters or message passing
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
68. Which of the following testing methods uses fault simulation technique?
A. unit testing
B. beta testing
C. stress testing
D. mutation testing
Answer ||| D
Solution ||| Mutation Testing adopts fault simulation mode.
It has been advocated as a technique for generating test cases by inserting
faults in a program and the effectiveness of test suite is represented by
mutation score.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
69. If a program P calls two subprograms P1 and P2 and P1 can fail 50% of the time and
P2 can fail 40% of the time, what is the failure rate of program P
A. 50%
B. 60%
C. 70%
D. 10%
Answer ||| C
Solution ||| P1: fails 50% time. Success 50% time....0.5
P2: fails 40% time. Success 60% time.... 0.6
Success rate = both p1 and p2 wins = 0.5x0.6= 0.3
Failure rate =1- success rate = 1-0.3 =0.7=70%.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
70. Which of the following strategy is employed for overcoming the priority inversion
problem?
A. Temporarily raise the priority of lower priority level process
B. Have a fixed priority level scheme
C. Implement kernel pre-emption scheme
D. Allow lower priority process to complete its job
Answer ||| A
Solution ||| The priority-based model of execution states that a task can only be preempted
by another task of higher priority.
However, scenarios can arise where a lower priority task may indirectly preempt
a higher priority task, This is called "priority inversion", and usually occurs when
resource sharing is involved.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
71. Let P(E) denote the probability of the occurrence of event E.
If P(A) = 0.5 and P(B) = 1, then the values of P(A/B) and P(B/A) respectively are
A. 0.5, 0.25
B. 0.25, 0.5
C. 0.5, 1
D. 1,0.5
Answer ||| C
Solution ||| P(A)= 0.5
P(B)=1
Here there is no dependency in event A and B.
So P(A B) = P(A) * P(B)
P(A/B)= probability of occurrence of event A when B has already occurred
= P(A B) / P(B)
= (0.5 * 1) /1 = 0.5
P(B/A)= probability of occurrence of event B when A has already occurred
= P(B A) / P(A)
= (1 * 0.5) / 0.5 = 1
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
72. How many diagonals can be drawn by joining the angular points of an octagon?
A. 14
B. 20
C. 21
D. 28
Answer ||| B
Solution ||| Number of diagonals = (n-3) + Sum of first (n-3) numbers
n=8
Number of diagonals = 5 + (1+2+3+4+5) = 20
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
73. What are the final states of the DFA generated from the following NFA?
A.
B.
C.
D.
q 0, q 1, q 2
[q0, q1], [q0, q2], []
q0, [q1, q2]
[q0, q1], q2
Answer ||| A
Solution ||| The closure of the states which contain final states in its closure is also Final
state, So q0 ,q1,q2 all are final states.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
74. The number of elements in the power set of the set {{A,B},C} is
A. 7
B. 8
C. 3
D. 4
Answer ||| D
Solution ||| No of elements of power set will be 2n2n. here n is element of set
so given set has 2 elements then power set has 2222 = 4 elements
which are { , {A,B}, {C}, { { A,B},C} }
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
75. What is the right way to declare a copy constructor of a class if the name of the class
is MyClass?
A. MyClass (constant MyClass *arg)
B. MyClass (constant MyClass &arg)
C. MyClass (MyClass arg)
D. MyClass (MyClass *arg)
Answer ||| B
Solution ||| It should be B (with a const keyword instead of constant)as reference of arg is
passed in copy constructor
Question Type |||

Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
76. The number of edges in a 'n' vertex complete graph is?
A. n * (n-1) / 2
B. n2
C. n * (n+1)/2
D. n * (n+1)
Answer ||| A
Solution ||| In a complete graph each vertex is associated with all other vertex. They dont
have self loop
So in Complete graph of n vertices each vertex has a degree of n-1
Therefore n vertex will have n (n-1) degree....1
And we know that sum of degree of vertex = 2*edges
n*(n-1) = 2*e
e = n(n-1)/2
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
77. The binary equivalent of the decimal number 42.75 is

A. 101010.110
B. 100110.101
C. 101010.101
D. 100110.110
Answer ||| A
Solution ||| 42 can be represented as 1*32+0*16+1*8+0*4+1*2+0*1 = 42, so the binary
representation is (101010)2.
And fraction part can be obtained as 12+14=0.7512+14=0.75, the binary
representation is .110
So, the total binary representation of 42.75 is (101010.110)2
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
78. Which of the following is not provided as a service in cloud computing?
A. Infrastructure as a service
B. Architecture as a service
C. Software as a service
D. Platform as a service
Answer ||| B
Solution ||| Architecture as service is not part of cloud computing stack.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4

79. The built-in base class in Java, which is used to handle all exceptions is
A. Raise
B. Exception
C. Error
D. Throwable
Answer ||| D
Solution ||| Throwable is the base class of all exceptions in java. Exception and Error are
sub classes of Throwable .
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4
80. In graphics, the number of vanishing points depends on the number of axes cut by
A. the projection plane
B. the centre of projection
C. the number of axes which are parallel to the projection plane
D. the perspective projections of any set of parallel lines that are not parallel to the
projection plane
Answer ||| C
Solution ||| The number of axes which are parallel to the projection plane.
Question Type |||
Difficulty |||
Time ||| 90
Marking ||| 1, -1/4

ISRO - CS Questions

Uploaded by

Copyright:

Available Formats

ISRO - CS Questions

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

ISRO - CS Questions

Uploaded by

Copyright:

Available Formats

1. Let A(1:8, -5:5, -10:5) be a three dimensional array.

How many elements are there

a pop operation in stack

Solution ||| A node have 2 fields associate with it

Marking ||| 1, -1/4

Insertion sort, Quick sort

PYSP ||| ISRO-CS-2013

Question Type |||

Topic ||| Level I || Level II || Level III

// taking byte as from bit1 to bit

Carry in carry from bit 7

PYSP ||| ISRO-CS-2013

Record pointer =10 bytes

Question Type |||

Question Type |||

Question Type |||

Question Type |||

Marking ||| 1, -1/4

Linked To Above Question|||

Question Type |||

Marking ||| 1, -1/4

Logical Memory 8 pages = 23

57. Which of the following is not a necessary condition for deadlock?

Allocated resources for B = 1+1+1=3

60. The state of a process after it encounters an I/O instruction is

PYSP ||| ISRO-CS-2013

Topic ||| Level I || Level II || Level III

Question Type |||

77. The binary equivalent of the decimal number 42.75 is

Topic ||| Level I || Level II || Level III

PYSP ||| ISRO-CS-2013

You might also like