ISRO Computer Science - 2007 Set AÂ
ISRO previous years computer science questions
Examples
1. Simplify the Boolean expression
XY?Z?+XY?Z?W+XZ?
The above expression can be written as
XY?Z? (1+W) +XZ?
=XY?Z?+XZ? as 1+W=1
=XZ? (Y?+1)
=XZ? as Y?+1=1
2. Simplify the Boolean expression
X+X?Y+Y?+(X+Y?) X?Y
The above expression can be written as
X+X?Y+Y?+XX?Y+Y?X?Y
=X+X?Y+Y? as XX?=0, and YY?=0
=X+Y+Y? as X+X?Y=X+Y
=X+1 as Y+Y?=1
=1 as X + 1=1
3. Simplify the Boolean expression
Z(Y+Z) (X+Y+Z)
The above expression can be written as
(ZY+ZZ)(X+Y+Z)
= (ZY+Z) (X+Y+Z) as ZZ=Z
=Z(X+Y+Z) as Z+ZY=Z
=ZX+ZY+ZZ
=ZX+ZY+Z as ZZ=Z,
=ZX+Z as Z+ZY=Z
=Z as Z+ZX=Z
4. Simplify the Boolean expression
(X+Y)(X?+Z)(Y+Z)
The above expression can be written as
(XX?+XZ+YX?+YZ)(Y+Z)
=(XZ+YX?+YZ) (Y+Z) as XX?=0
=XZY+YYX?+YYZ+XZZ+YX?Z+YZZ
=XZY+YX?+YZ+XZ+YX?Z+YZ as YY=Y, ZZ=Z
Rearranging the terms we get
XZY+XZ+YX?+YX?Z+YZ as YZ+YZ=YZ
=XZ(Y+1) +YX?+YZ (X?+1) as Y+1=1, X?+1=1
=XZ+YX?+YZ
Now it seems that it cannot be reduced further. But apply the following trick:
The above expression can be written as
XZ+YX?+YZ(X+X?) as X+X?=1
=XZ+YX?+YZX+YZX?
Rearranging the terms we get
XZ+YXZ+Y X?+YX?Z
=XZ (1+Y) +YX? (1+Z)
=XZ+YX? as 1+Y=1, 1+Z=1
Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â Â _Â Â Â Â _Â Â Â Â Â _
1.Â The Boolean expression Y = (A + B + AB) C is given by
Â Â Â Â Â Â _
(a) AC
Â Â Â Â Â Â _
(b) BC
Â Â Â Â _
(c) C
(d) AB
Â
2.Â The circuit shown in the following Figure realizes the function
Â Â Â Â Â ___Â Â Â Â Â Â Â _Â _
(a) (A+B+C) (D E)
Â Â Â Â Â Â ___Â Â Â Â Â Â Â Â Â _
(b) (A+B+C) (D E)
Â Â Â Â Â Â Â Â Â ___Â Â Â _Â
(c) (A+B+C) (D E)
Â Â Â Â Â Â Â Â Â Â Â Â Â _Â Â _Â _
(a) (A+B+C) (D E)
Â
3.Â The circuit shown in the given Figure is a
(a) full adder
(b) full subtracter
(c) shift register
(d) decade counter
Â
4.Â When two numbers are added in excess-3 code and the sum is less than 9, then in order to get the correct answer it is necessary to
(a) subtract 0011 from the sum
(b) add 0011 to the sum
(c) subtract 0110 from the sum
(d) add 0110 to the sum
Â
5.Â The characteristic equation of an SR flip-flop is given by
Â
Â
6.Â A grap with "n" vertices and n-1 edges that is not a tree, is
(a) Connected
(b) Disconnected
(c) Euler
(d) A circuit
Â
7.Â If a graph requires k different colours for its proper colouring, the the chromatic number of the graph is
(a) 1
(b) k
(c) k-1
(d) k/2
Â
8.Â A read bit can be read
(a) and written by CPU
(b) and written by peripheral
(c) by pheripheral and written by CPU
(d) by CPU and written by the peripheral
Â
9.Â Eigen vectors of
Â
Â
Â
10.Â The term "aging" refers to
(a) booting up the priority of a process in multi-level of queue without feedback.
(b) gradually increasing the priority of jobs that wait in the system for a long time to remedy infinite blocking.
(c) keeping track of the following a page has been in memory for the purpose of LRU replacement
(d) letting job reside in memory for a certain amount of time so that the number of pages required can be estimated accurately.
Â
11.Â Consider a set of n tasks with known runtimes r1,Â r2 .........Â rn, to be run on a uniprocessor machine.Â Which of the following processor scheduling algorithms will result in the ma throughput ?
(a) Round Robin
(b) Shortest job first
(c) Highest response ratio next
(d) first cum first served
Â
12.Â Consider a job scheduling problem with four jobs J1 J2 J3 and J4 with corresponding deadlines : (d1, d2, d3, d4) = (4,2,4,2)
Which of the following is not a feasible schedule without violating any job deadline ?
(a) J2, J4, J1, J3
(b) J4, J1, J2, J3
(c) J4, J2, J1, J3
(d) J4, J2, J3, J1
Â
13.Â By using an eight bit optical encoder the degree of resolution that can be obtained is (approximately)
(a) 1.80
(b) 3.40
(c) 2.80
(d) 1.40
Â
14.Â The principal of locality of reference justifies the use of
(a) virtual memory
(b) interrupts
(c) main memory
(d) cache memory
Â
15.Â Consider the following psuedocode
xÂ :Â =Â 1;
iÂ Â :Â =Â 1;
while (x ? 1000)
begin
xÂ :Â =Â 2x ;
iÂ Â :Â =Â i + 1 ;
end ;
What is the value of i at the end of the pseudocode ?
(a) 4
(b) 5
(c) 6
(d) 7
Â
16.Â The five items :Â A, B, C, D,Â and E are pushed in a stack, one after the other starting from A.Â The stack is popped four times and each element is inserted in a queue. Then two elements are deleted from the queue and pushed back on the stack. Now one item is popped from the stack.Â The popped item is
(a) A
(b) B
(c) C
(d) D
Â
17.Â Round Robin scheduling is essentially the pre-emptive version of
(a) FIFO
(b) Shortest Job First
(c) Shortest remaining time
(d) Longest remaining time
Â
18.Â The number of digit 1 present in the binary representation of 3 * 512 + 7 * 64 + 5 * 8 + 3 is
(a) 8
(b) 9
(c) 10
(d) 12
Â
19.Â Assume that each character code consists of 8 bits.Â The number of characters that can be transmitted per second through an synchronous serial line at 2400 baud rate, and with two stop bits is
(a) 109
(b) 216
(c) 218
(d) 219
Â
20.Â If the bandwidth of a signal is 5 kHz and the lowest frequency is 52 kHz,Â what is the highest frequency
(a) 5 kHz
(b) 10 kHz
(c) 47 kHz
(d) 57 kHz
Â
21.Â An Ethernet hub
(a) functions as a repeater
(b) connects to a digital PBX
(c) connects to a token-ring network
(d) functions as a gateway
Â
22.Â Phase transition for each bit are used in
(a) Amplitude modulation
(b) Carrier modulation
(c) Manchester encoding
(d) NRZ encoding
Â
23.Â Study the following programme
// precondition : x > = 0
public void demo (int x)
{
System.out.print(x%10);
if ((x/10) ! = 0)
{
demo(x/10);
}
System.out.print(x%10);
}
Which of the following is printed as a result of the call demo (1234) ?
(a) 1441
(b) 3443
(c) 12344321
(d) 43211234
Â
24.Â Bit stuffing refers to
(a) inserting a '0' in user stream to differentiate it with a flag
(b) inserting a '0' in flag stream to avoid ambiguity
(c) appending nibble to the flag sequence
(d) appending a nibble to the use data stream
Â
25.Â What is the name of the technique in which the operating system of a computer executes several programs concurrently by switching back and forth between them ?
(a) Partitioning
(b) Multi tasking
(c) Windowing
(d) Paging
Â
26.Â If there are five routers and six networks in an intranet using link state routing, how many routing tables are there ?
(a) 1
(b) 5
(c) 6
(d) 11
Â
27.Â Virtual memory is
(a) Part of Main Memory only used for swapping
(b) A technique to allow a program, of size more than the size of the main memory, to run
(c) Part of secondary storage used in program execution
(d) None of these
Â
28.Â The level of aggregation of information required for operational control isÂ
(a) Detailed
(b) Aggregate
(c) Qualitative
(d) None of the above
Â
29.Â The set of all Equivalence Classes of a set A of Cardinality C
(a) is of cardinality 20
(b) has the same cardinality as A
(c) forms a partition of A
(d) is of cardinality C2
Â
30.Â 0.75 in decimal system is equivalent to __________ in octal system
(a) 0.60
(b) 0.52
(c) 0.54
(d) 0.50
Â
31.Â In an SR latch made by cross coupling two NAND gates, if both S and R inputs are set to 0, then it will result in
(a) Q = 0,Â Q0 = 1
(b) Q = 1,Â Q0 = 0
(c) Q = 1,Â Q0 = 1
(d) Indeterminate states
Â
32.Â Identify the correct translation into logical notation of the following assertion.Â Some boys in the class are taller than all the girls
Note: taller (x,y) is true if x is taller than y.
image - Computer Science - 2007 -Set A - Qno. 32 (a, b, c, d)
Â
33.Â Company X shipped 5 computer chips, 1 of which was defective, and Company Y shipped 4 computer chips, 2 of which were defective. One computer chip is to be chosen uniformly at random from the 9 chips shipped by the companies. If the chosen chip is found to be defective, what is the probability that the chip came from Company Y ?
(a) 2/9
(b) 4/9
(c) 2/3
(d) 1/2
Â
34.Â Ring counter is analogous to
(a) Toggle Switch
(b) Latch
(c) Stepping Switch
(d) S-R flip flop
Â
35.Â The output 0 and 1 level for TTL Logic family is approximately
(a) 0.1 and 5 V
(b) 0.6 and 3.5 V
(c) 0.9 and 1.75 V
(d) -1.75 and 0.9 V
Â
36.Â Consider a computer system that stores floating-point numbers with 16-bit mantissa and an 8-bit exponent, each in two's complement. The smallest and largest positive values which can be stored are
(a) 1 * 10-128 andÂ 215 * 10128
(b) 1 * 10-256 andÂ 215 * 10255
(c) 1 * 10-128 andÂ 215 * 10127
(d) 1 * 10-128 andÂ (215 - 1) * 10127
Â
37.Â In comparison with static RAM memory, the dynamic RAM memory has
(a) lower bit density and higher power consumption
(b) higher bit density and higher power consumption
(c) lower bit density and lower power consumption
(d) higher bit density and lower power consumption
Â
38.Â The Hexadecimal equivalent of 01111100110111100011 is
(a) CD73E
(b) ABD3F
(c) 7CDE3
(d) FA4CD
Â
39.Â Disk requests are received by a disk drive for cylinder 5, 25, 18, 3, 39, 8 and 35 in that order.Â A seek taken 5 msec per cylinder moved.Â How much seek time is needed to serve these requests for a Shortest Seek First (SSF) algorithm ?Â Assume that the arm is at cylinder ?, 0 when the last of these requests is made with none of the requests yet served
(a) 125 msec
(b) 295 msec
(c) 575 msec
(d) 750 msec
Â
40.Â Consider a system having 'm' resources of the same type.Â The resources are shared by 3 processes A, B, C, which have peak time demands of 3, 4, 6, respectively.Â The minimum value of 'm' that ensures that deadlock will never occur is
(a) 11
(b) 12
(c) 13
(d) 14
Â
41.Â A task in a blocked state
(a) is executable
(b) is running
(c) must still be placed in the run queues
(d) Is waiting for some temporarily unavailable resources.
Â
42.Â Semaphores
(a) synchronize critical resources to prevent deadlock
(b) synchronize critical resources to prevent contention
(c) are used to do I/O
(d) are used for memory management.
Â
43.Â On a system using non-preemptive scheduling, processes with expected run times of 5, 18, 9 and 12 are in the ready queue.Â In what order should they be run to minimize wait time ?
(a) 5, 12, 9, 18
(b) 5, 9, 12, 18
(c) 12, 18, 9, 5
(d) 9, 12, 18, 5
Â
44.Â The number of page frames that must be allocated to a running process in a virtual memory environment is determined byÂ
(a) the instruction set architecture
(b) page size
(c) number of processes in memory
(d) physical memory size
Â
45.Â A program consists of two modules executed sequentially.Â Let f1 (t) and f2 (t) respectively denote the probability density functions of time taken to execute the two modules.Â The probability density function of the overall time taken to execute the program is given by
(a) f1 (t) +Â f2 (t)
(b) ?01 Â f1 (x)f2 (x) dx
(c) ?01Â f1 (x) f2 (t - x) dx
(d) max (f1 (t) +Â f2 (t))
Â
46.Â Consider a small 2-way set associative cache memory, consisting of four blocks.Â For choosing the block to be replaced, use the least recently (LRU) scheme. The number of cache misses for the following sequence of block addresses is 8, 12, 0, 12, 8
(a) 2
(b) 3
(c) 4
(d) 5
Â
47.Â Which commands are used to control access over objects in relational database ?
(a) CASCADE & MVD
(b) GRANT & REVOKE
(c) QUE & QUIST
(d) None of these
Â
48.Â Which of the following is aggregate function in SQL ?
(a) Avg
(b) Select
(c) Ordered by
(d) distinct
Â
49.Â One approach to handling fuzzy logic data might be to design a computer using ternary (base-3) logic so that dataÂ could be stored as "true," "false," and "unknown." If each ternary logic element is called a flit, how many flits are required to represent at least 256 different values ?
(a) 4
(b) 5
(c) 6
(d) 7
Â
50.Â A view of a database that appears to an application program is known as
(a) Schema
(b) Subschema
(c) Virtual table
(d) None of these
Â
51.Â Armstrong's inference rule doesn't determine
(a) Reflexivity
(b) Augmentation
(c) Transitivity
(d) Mutual dependency
Â
52.Â Which operation is used to extract specified columns from a table ?
(a) Project
(b) Join
(c) Extract
(d) Substitute
Â
53.Â In the Big-Endian system, the computer stores
(a) MSB of data in the lowest memory address of data unit
(b) LSB of data in the lowest memory address of data unit
(c) MSB of data in the highest memory address of data unit
(d) LSB of data in the highest memory address of data unit
Â
54.Â BCNF is not used for cases where a relation has
(a) Two (or more) candidate keys
(b) Two candidate keys and composite
(c) The candidate key overlap
(d) Two mutually exclusive foreign keys
Â
55.Â Selection sort algorithm design technique is an example of
(a) Greedy method
(b) Divide-an-conquer
(c) Dynamic Programming
(d) Backtracking
Â
56.Â Which of the following RAID level provides the highest Data Transfer Rate (Read/Write)
(a) RAID 1
(b) RAID 3
(c) RAID 4
(d) RAID 5
Â
57.Â Which of the following programming language (s) provides garbage collection automatically
(a) Lisp
(b) C++
(c) Fortran
(d) C
Â
58.Â The Average case and worst case complexities for Merge sort algorithm are
(a) O (n2),Â O (n2)
(b) O (n2),Â O (n log2 n)
(c) O (n log2 n),Â O (n2)
(d) O (n log2 n),Â O (n log2 n)
Â
59.Â The time taken by binary search algorithm to search a key in a sorted array of n elements is
(a) O (log2 n)
(b) O (n)
(c) O (n log2 n)
(d) O (n2)
Â
60.Â Which of the following is correct with respect to Two phase commit protocol ?
(a) Ensures serializability
(b) Prevents Deadlock
(c) Detects Deadlock
(d) Recover from Deadlock
Â
61.Â The Fibonacci sequence is the sequence of integers
(a) 1, 3, 5, 7, 9, 11, 13
(b) 0, 1, 1, 2, 3, 5, 8, 13, 21, 54
(c) 0, 1, 3, 4, 7, 11, 18, 29, 47
(d) 0, 1, 3, 7, 15
Â
62.Â Let X be the adjacency matrix of a graph G with no self loops.Â The entries along the principal diagonal of X areÂ
(a) all zeros
(b) all ones
(c) both zeros and ones
(d) different
Â
63.Â Which of these is not a feature of WAP 2.0
(a) Push & Pull Model
(b) Interface to a storage device
(c) Multimedia messaging
(d) Hashing
Â
64.Â Feedback queues
(a) are very simple to implement
(b) dispatch tasks according to execution characteristics
(c) are used to favour real time tasks
(d) require manual intervention to implement properly
Â
65.Â Which of the following is not a UML DIAGRAM ?
(a) Use Case
(b) Class Diagram
(c) Analysis Diagram
(d) Swimlane Diagram
Â
66.Â Silly Window Syndrome is related to
(a) Error during transmission
(b) File transfer protocol
(c) Degrade in TCP performance
(d) Interface problem
Â
67.Â To execute all loops at their boundaries and within their operational bounds is an example of
(a) Black Box Testing
(b) Alpha Testing
(c) Recovery Testing
(d) White Box Testing
Â
68.Â SSL is not responsible for
(a) Mutual authentication of client & server
(b) Secret communication
(c) Data Integrity protection
(d) Error detection & correction
Â
69.Â A rule in a limited entry decision table is a
(a) row of the table consisting of condition entries
(b) row of the table consisting of action entries
(c) column of the table consisting of condition entries and the corresponding action entries
(d) columns of the table consisting of conditions of the stub
Â
70.Â The standard for certificates used on internet is
(a) X.25
(b) X.301
(c) X.409
(d) X.509
Â
71.Â Hashed message is signed by a sender using
(a) his public key
(b) his private key
(c) receiver's public key
(d) receiver's private key
Â
72.Â An email contains a textual birthday greeting,Â a picture of a cake, and a song.Â The order is not important.Â What is the content-type ?
(a) Multipart/mixed
(b) Multipart/parallel
(c) Multipart/digest
(d) Multipart/alternative
Â
73.Â Range of IP Address from 224.0.0.0 to 239.255.255.255 are
(a) Reserved for loopback
(b) Reserved for broadcast
(c) Used for muticast packets
(d) Reserved for future addressing
Â
74.Â IEEE 802.11 is standard for
(a) Ethernet
(b) Bluetooth
(c) Broadband Wireless
(d) Wireless LANs
Â
75.Â When a host on network A sends a message to a host on network B, which address does the router look at ?
(a) Port
(b) IP
(c) Physical
(d) Subnet mask
Â
76.Â Which of the following is not an approach to Software Process Assessment ?
(a) SPICE(ISO/IEC 15504)
(b) Standard CMMI Assessment Method for process improvement
(c) ISO 9001 : 2000
(d) IEEE 2000 : 2001
Â
77.Â A physical DFD specifies
(a) what processes will be used
(b) who generates data and who processes it
(c) what each person in an organization does
(d) which data will be generated
Â
78.Â In UML diagram of a class
(a) state of object cannot be represented
(b) state is irrelevant
(c) state is represented as an attribute
(d) state is represented as a result of an operation
Â
79.Â Which of the following models is used for software reliability ?
(a) Waterfall
(b) Musa
(c) COCOMO
(d) Rayleigh
Â
80.Â Djikstra's algorithm is used to
(a) Create LSAs
(b) Flood an internet with information
(c) Calculate the routing tables
(d) Create a link state database