Paper 2 CS · UNIT 02 · MOCK TEST

Computer System Architecture — Mock Test 5

25 questions · about 30 minutes. Press End Mock any time to see your score and the correct answers.

0 / 25 answered 00:00

Q1. Level – 0 DFD is also called as:

AUse case Diagram BSequence Diagram CContext Diagram DPrototype Diagram

Q2. Given two statements:
Assertion A: Validity checks real need of system users
Reason R: Completeness checks system user defined requirements
In the light of the above statements, choose the correct answer:

ABoth A and R are true and R is the correct explanation of A BBoth A and R are true but R is NOT the correct explanation of A CA is true but R is false DA is false but R is true

Q3. If every requirement can be checked by a cost-effective process, then SRS is called

AVerifiable BTraceable CModifiable DComplete

Q4. The process to gather the software requirement from client, analyze and document is known as

ASoftware Engineering Process BUser Engineering Process CRequirement Elicitation Process DRequirement Engineering Process

Q5. The Software Requirement Specification (SRS) is said to be ________ if and only if no subset of individual requirements described in it conflict with each other.

ACorrect BConsistent CUnambiguous DVerifiable

Q6. Let n₁ be the number of requirements for which all reviewers have identical interpretations and n₂ be the total number of requirements. Which of the following is used to determine the specificity of the requirements?

An₁ / n₂ Bn₂ / n₁ Cn₁ + n₂ Dn₁ – n₂

Q7. Which one of the following statements, related to the requirements phase in Software Engineering, is incorrect?

A"Requirement validation" is one of the activities in the requirements phase B"Prototyping" is one of the methods for requirement analysis C"Modelling-oriented approach" is one of the methods for specifying functional specifications D"Function points" is one of the most commonly used size metrics for requirements

Q8. Requirements prioritisation and negotiation belongs to:

ARequirements validation BRequirements elicitation CFeasibility study DRequirements reviews

Q9. Which of the following statements are CORRECT?
(A) A process always checks the state of the currently executing process to enter its critical section.
(B) Spin locks use busy waiting.
(C) Periodically testing a variable until some value appears is known as busy waiting.
(D) A critical region/section is the part of a program where shared memory (a shared resource) is accessed.
(E) A printer daemon continuously checks to see if there are any files to be printed.

A(A) and (B) only B(B) and (C) only C(B) and (D) only D(B) and (E) only

Q10. At a particular time of computation, the value of a counting semaphore is 7. Then 20 P operations and 'x' V operations were performed on this semaphore. If the final value of the semaphore is 5, what is x?

A15 B22 C18 D13

Q11. Match List I with List II:
List I: (A) Critical region (B) Wait/Signal (C) Working set (D) Deadlock
List II: (I) Hoare's monitor (II) Mutual exclusion (III) Principle of locality (IV) Circular wait
Choose the correct match from A-D to I-IV.

AA-IV, B-I, C-III, D-II BA-II, B-I, C-III, D-IV CA-I, B-II, C-III, D-IV DA-IV, B-III, C-I, D-II

Q12. At a particular time of computation, the value of a counting semaphore is 7. Then 20 P operations and 'x' V operations were performed on this semaphore. If the final value of the semaphore is 5, what is x?

A15 B22 C18 D14

Q13. In the design protocol of the critical section problem, each process must ask permission to enter the critical section in …… code; it then executes in the critical section; once it finishes executing in the critical section it enters the …… code. The process then enters the …… code.

Aentry section, remainder section, exit section Bentry section, exit section, remainder section Cremainder section, entry section, exit section Dremainder section, exit section, entry section

Q14. Consider a system with five processes P0 through P4 and three resource types A, B and C, with 7, 2 and 6 total instances respectively. At time T0 the system state is:

Process	Allocation (A,B,C)			Request (A,B,C)
P0	0	1	0	0	0
P1	2	0	0	2	2
P2	3	0	3	0	0
P3	2	1	1	1	0
P4	0	2	2	0	2

Available = (0, 0, 0). Applying the deadlock detection algorithm, the system is:

ASemaphore BDeadlock state CCircular wait DNot in deadlock state

Q15. The Bounded Buffer problem is also known as the ________.

AProducer–Consumer problem BReader–Writer problem CDining Philosophers problem DBoth (ii) and (iii)

Q16. Two atomic operations permissible on semaphores are ________ and ________.

Await, stop Bwait, hold Chold, signal Dwait, signal

Q17. Three processes share a single counting semaphore S whose initial value is 1. All three execute wait(S) one after another, in the order P2, P1, P3. After this, P2 exits its critical section by executing signal(S), and then P1 exits by executing signal(S). What is the value of S after these five operations?

A0 B1 C-1 D-2

Q18. In the UNIX operating system, when a process creates a child process using the fork() system call, which of the following is genuinely shared between the parent and child process, rather than being copied?

AHeap BStack CShared memory segments DBoth Heap and Stack

Q19. A system has 12 instances of a resource R shared among four processes. The maximum need and current allocation of each process are:

Process	Max Need	Current Allocation
P1	8	3
P2	9	4
P3	5	2
P4	3	1

With reference to the current allocation, is the system in a safe state? If so, what is a safe sequence?

ANo BYes, P1 P2 P3 P4 CYes, P4 P3 P1 P2 DYes, P2 P1 P3 P4

Q20.

Match List I with List II

AA-IV, B-III, C-I, D-II BA-I, B-II, C-IV, D-III CA-III, B-IV, C-I, D-II DA-II, B-IV, C-I, D-III

Q21.

The write operation in I/O operation does the following-

ATransfer data from I/O device to memory BTransfer data from memory to I/O device CTransfer data from CPU register to memory DTransfer data from CPU register to I/O device

Q22.

Which of the following gates do not give output 1 when both the inputs are 0 -

A. NAND gate

B. NOR gate

C. X-OR gate

D. X-NOR gate

AA, B Only BB, C Only CC, D Only DC Only

Q23.

Which of the following statements are true ?

A. In the write-through policy, only the cache is updated

B. In the write-back policy, both cache and main memory are updated

C. Cache coherence problems exist in multiprocessors with private caches because of the need to share writable data

D. Cache coherence problem can be solved by means of hardware-only scheme

Choose the correct answer from the options given below:

AA, B Only BB, C Only CC, D Only DA, B, C Only η

Q24.

The right sequence of suboperations that are performed in arithmetic pipeline is-

A. Align the mantissas

B. Add or subtract the mantissas

C. Normalize the result

D. Compare the exponents

Choose the correct answer from the options given below:

AD, A, B, C BD, B, A, C CB, C, A, D DB, C, D, A Directions (91-95) Read the following passage and answer the given questions. Consider the following Three Address code sample for solving the questions : 100:t1=y+2 101 : initial = x/t1 102: limit = 10 103: if i >j goto 105 104 : goto 111 105: if num > b goto 107 106: goto 111 107: num = limit-1 108:b=y+2 109: i = i - num 110: goto 103 111: j= i - num 112:k=j+b

Q25.

Correct the order of instruction cycle:

A. Read the effective address

B. Fetch the information

C. Execute the instruction

D. Decode the instruction

AA, B, C, D BB, D, A, C CB, A, D, C DA, B, D, C