A. S –> Sa | b
B. S –> aSb | ab
C. S –> abX, X –> cY, Y –> d | aX
D. None of these

A. win.txt
B. win.std
C. win.main
D. none of these

A. Signals
B. Pipes
C. Semaphore
D. All of these

A. compile prog 1, prog 2
B. run test, prog
C. load R1 , A
D. 001001000010101

A. if there are more than two processes competing for that resource
B. if there are only two processes competing for that resource
C. if there is a single process competing for that resource
D. none of these

A. Rise time
B. Decay time
C. Propagation time
D. Charging time

A. NOR
B. AND
C. OR
D. NAND

A. A tautulogy
B. A contradiction
C. Logically equivalent to p ^ q
D. All of above

A. (p v q)→q
B. p v (q→p)
C. p v (p→q)
D. Both (b) & (c)

A. Large collection of data mostly stored in a computer system
B. The removal of noise errors and incorrect input from a database
C. The systematic description of the syntactic structure of a specific database. It describes the structure of the attributes the tables and foreign key relations hips.
D. None of these

A. fluorescence
B. persistence
C. phosphorescence
D. incandescence

A. H₂S and CO₂
B. CaSO4 and H₂O
C. Lime and H₂O
D. CO₂ and calcium

A. Metals
B. Semiconductors
C. Insulators
D. All of the above

A. A single copy of the operating system resides in each processor.
B. Useful for situations where data must remain in memory to process.
C. Bottlenecks increase with uniprocessor systems because tasks are not shared.
D. The problems of memory contention are unlikely.

A. Arithmetic Exception
B. Throwable
C. Object
D. Exception