Computer Science
Computer Science
Ques 1- Processes P1, P2 and P3 are processed by the First Come, First
Served (FCFS) scheduling algorithm. What will be the values of the average
waiting time, average turnaround time and average throughput, respectively?
Process Burst Time
(in
milliseconds)
P1 24
P2 3
P3 3
a. 3,13,10
b. 17,27,10
c. 13,3,16
d. 17,13,16
Ques 2- Passage
JOB 1
150
JOB 2
350
JOB 3
A part of a system’s memory is shown in the image. JOB 1, JOB 2and
JOB 3 are in the memory. The free space can be allocated to the new
jobs that arrive in an order according to the different memory allocation
strategies.
Which technique will satisfy the request of the memory blocks of size
250,70, 150?
a. First fit
b. Next fit
c. Either first fit or next fit
d. Neither first fit nor next fit.
Ques 3.
Group A Group B
A. Process 1. Passive entity
B. Program 2. Degree of
multiprogramm
ing
C. Long term 3. Active entity
scheduler
D. Message 4. Interprocess
passing communication
Refer to the given table. Match the terms related to process management
in group A with their characteristics in group B.
a. A-3, B-1, C-2, D-4
b. A-3, B-2, C-1, D-4
c. A-1,B-3,C-4,D-2
d. A-1,B-3,C-2,D-4
Ques 4-
Group A Group B
A. Next fit 1. Processor
allocation sharing
B. Mapping of 2. Contiguous
address memory
allocation
C. Round- 3. Memory
robin management
scheduling unit
D. Push 4. Load
migration balancing
Refer to the given table. Match the technique in Group A with their
functions in Group B.
a. A-4,B-2,C-3,D-1
b. A-3,B-4,C-1,D-2
c. A-2,B-3,C-1,D-4
d. A-2,B-1,C-4,D-3
Ques 5. Refer to the given table. Match the allocation technique in Group
A with their drawbacks in Group B.
Group A Group B
A. Contiguous 1. Extra
allocation memoryconsu
me
B. Linked list 2.Slow random
allocation access
C. FAT allocation 3. Disk
fragmentation
a. A-1,B-2,C-3
b. A-1,B-3,C-2
c. A-3,B-2,C-1
d. A-2,B-1,C-3
Ques 6- Suppose a disk drive has 100 cylinders, numbered from 0 to 99.
The drive is currently serving a request at cylinder 40 and the disk arm is
moving towards 99. The queue of pending requests is: 35, 65, 55, 45, 85,
75. What is the total distance (in cylinders) moved by the disk arm to
satisfy all the pending requests for C -LOOK disk scheduling algorithm,
starting from the current head position?
a. 75
b. 95
c. 123
d. 193
Ques 7-Which of the following is a threat to system?
a. Torjan horse
b. Worms
c. Trap door
d. Logic bomb
Ques 8- A worm is made of and .
a. Grappling hook and main program
b. Main program and secondary program
c. Grappling hook and secondary program.
Ques 9- Any program residing in the memory contains a set of
instructions that need to be executed by the computer in a sequential
manner. This cycle for every instruction is known as the instruction cycle.
The cycle consists of the following steps that may or may not be the
proper sequence of execution.
1, Fetch the operand from the memory
2. Execution
3. Fetch the instruction
4. Decode the instruction
5. Result
What will be the proper sequence of the instructions in the instruction
cycle?
a. 3-4-1-2-5
b. 3-4-2-5-1
c. 2-3-1-4-5
d. 1-2-3-4-5
Ques 10. Which of the following statement is incorrect?
a. Pseudo instruction are machine instructions.
b. Dynamic RAM is faster than static RAM.
c. NAND gate is a universal gate
d. Negative numbers are represented by 2’s complement.
Ques 11. What is the minimum number of bits required to store -256 to
+256 in a computer?
a. 7
b. 8
c. 9
d. 10
Ques 12. Which of the following states don’t occur in the life cycle of a
process?
a. Ready
b. Running
c. Terminated
d. Waiting
e. Abort
Ques 13. A DBA uses log- based recovery method to ensure atomicity for
a transaction ‘T’ and realize after some time that it is aborted. Which of
the following operation should be used to ensure atomicity?
a. Undo (T)
b. Abort(T)
c. Redo (T)
d. Commit (T)
Ques 14. Cooperating processes require an interprocess communication
(IPC) mechanism that will allow them to exchange data and information_
Which of thefollowing is/are an IPC method(s)?
1. Message passing
2. Cooperation
3. Shared memory
a. 1 and 3
b. Only 2
c. Only3
d. 2 and 3
e. Only 1
Ques 15.
T0 T1 T0 T1
read (A) read (A)
write (A) write (A)
read (B) read (A)
write (B) write (A)
read (A) read (B)
write (A) write (B)
read (B) read(B)
write (B) write (B)
Schedule 1 schedule 2
There are two schedules - Schedule 1 and Schedule 2 as shown in the
table. Consider a system with two data items, A and B, that are both read and
written by two transactions, TO and Ti. These transactions are executed in a
chronological order from top to bottom. The instructions of TO are in the left
column and the instructions of T1 are in the right column.
Which of the following options is true about Schedule 1?
a. It is a conflicting schedule
b. It is a nonserial schedule
c. It is a nonconflictserializable schedule
d. It is a serial schedule
Ques 16.
Segment base length
0 210 600
1 2300 140
2 100 90
3 1300 460
4 2000 110
Segment table
Refer to the segment table and map the several logic address spaces (
segment number , byte) given below in their physical addresses.
1. 1, 430
2. 1,10
3. 3,180
4. 4,200
a. 640,2310,1480,2110
b. 640,2310,1480,2200
c. 830,150,640,310
d. None of the above
Ques 17. Which of the following statements are true?
1. TCP is a connection-oriented protocol
2. UDP is a connectionless protocol.
3. TCP is faster than UDP
4. TCP is more secure than UDP.
a. 1 and 2
b. 3 and 4
c. 1,2 and 4
d. 2,3 and 4
e. All of these
Ques 18. A dedicated path is needed in switiching before the data
is sent from the sender to the receiver while it is not needed in
switching.
a. Packet, circuit
b. Circuit, packet
c. Packet , time division
d. Space division , packet.
Ques 19.
Group a group b
a. Distance vector interior 1. Open shortest path first.
routing protocol
b. Distance vector exterior 2. Enhanced interior gateway
routing protocol routing protocol