NPTEL Advanced Computer Architecture Week 12 Assignment Answers 2025
1. If a lockset of a variable is ___________, it means that there is ___________ between accesses to the variable.
- empty, synchronization
- not empty, synchronization
- empty, no synchronization
- not empty, no synchronization
Answer :- For Answers Click Here
2. Consider the following statements and select the correct option.
S1: The lockset of threads initially has all the locks.
S2: When a thread acquires a lock, we add the lock to its lockset.
- Only S1 is true
- Only S2 is true
- Both S1 and S2 are true
- Both S1 and S2 are false
Answer :-
3. Consider the following statements and select the correct option.
S1:If a program has a data race, it may not show up in an SC execution.
S2: Two vector clocks are always comparable.
- Only S1 is true
- Only S2 is true
- Both S1 and S2 are true
- Both S1 and S2 are false
Answer :-
4. Vector clocks ___________be used to track happens-before relationships between events. Transactional memory _______ disjoint access parallelism.
- can, doesn’t provide
- can, provides
- cannot, doesn’t provide
- cannot, provides
Answer :-
5. Consider the following statements and select the correct option.
S1: When a transaction is finished, if its results are written to stable storage, it is said to be durable.
S2: A consistent state is a valid state that is as per a given set of specifications (consistency model).
- Only S1 is true
- Only S2 is true
- Both S1 and S2 are true
- Both S1 and S2 are false
Answer :- For Answers Click Here
6. Which of the following conditions do not lead to a conflict among transactions i and j (W represents write set and R represents read set)?
- Wi ∩ Wj ≠ ϕ
- Wi ∩ Rj ≠ ϕ
- Ri ∩ Wj ≠ ϕ
- Ri ∩ Rj ≠ ϕ
Answer :-
7. Which of the following statements is not true?
- A conflict is resolved when a transactional memory system delays the transaction.
- In optimistic concurrency control, conflict detection and resolution are done as soon as the conflict occurs.
- A conflict is detected much after the transactional memory system becomes aware of it.
- A conflict is resolved when a transactional memory system aborts it.
Answer :-
8. Consider the following statements.
S1: Eager version management writes directly to memory.
S2: Eager version management does not require maintaining an undo log .
- Only S1 is true
- Only S2 is true
- Both S1 and S2 are true
- Both S1 and S2 are false
Answer :-
9. In __ version management, aborts are fast.
- eager
- lazy
- atomic
- non-atomic
Answer :-
10. The ____________ sequential ordering is consistent with the real-time ordering. Aborted transactions _________to see a consistent state produced by committed transactions.
- serializable, need
- strictly serializable, need
- serializable, don’t need
- strictly serializable, don’t need
Answer :- For Answers Click Here
