Computer System Architecture – Previous Year Questions
224 questions from past UGC NET Paper 2 – Computer Science papers, each with the correct answer. Open any question for its explanation.
- In a multiprocessor system, the crossbar switch interconnection network is an example of a
- The representation of the 4-bit code 1101 as a 7-bit even-parity Hamming code is
- The number of gate inputs required to realise the expression ABC + AB′CD + EF′ + AD is
- Consider a logic circuit with 8 input lines (D0, D1, …, D7) and 3 output lines (A0, A1, A2) specified by: A2 = D4 + D5 + D6 + D7 A1 = D2 + D3 + D6 + D7 A0 = D1 + D3 + D5 + D0 where + is logical OR. This circuit is a(n)
- The total storage capacity of a floppy disk having 80 tracks and storing 128 bytes/sector is 163,840 bytes. How many sectors does this disk have (per track)?
- In a cache memory, if the address has 9 bits in the tag field and 12 bits in the index field, the sizes of main memory and cache memory would be, respectively,
- A 4-stage pipeline has stage delays of 150, 120, 160 and 140 ns. Registers between the stages have a delay of 5 ns. Assuming a constant clocking rate, the total time required to process 1000 data items is
- Match List I with List II. Choose the correct answer from the options given below:List I List II A. Stack overflow I. Software interrupt B. Timer II. Internal interrupt C. Invalid opcode III. External interrupt D. Super…
- A magnetic tape drive has a transport speed of 200 inches per second and a recording density of 1600 bytes per inch. The time required to write 600000 characters of data grouped into 100-character records with a blockin…
- Statement I: Consider the 20-bit 'branch' microinstruction format: F1 (3 bits) | F2 (3) | F3 (3) | CD (2) | BR (2) | AD (7), where F1, F2, F3 are micro-operation fields, CD = condition for branching, BR = branch field a…
- Level – 0 DFD is also called as:
- 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:
- If every requirement can be checked by a cost-effective process, then SRS is called
- The process to gather the software requirement from client, analyze and document is known as
- 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.
- Let n1 be the number of requirements for which all reviewers have identical interpretations and n2 be the total number of requirements. Which of the following is used to determine the specificity of the requirements?
- Which one of the following statements, related to the requirements phase in Software Engineering, is incorrect?
- Requirements prioritisation and negotiation belongs to:
- 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…
- 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?
- 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 ma…
- 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?
- 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 sec…
- 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…
- The Bounded Buffer problem is also known as the ________.
- Two atomic operations permissible on semaphores are ________ and ________.
- 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 t…
- 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?
- 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 c…
- Match List I with List II