ISRO CSE 2018 PYQ

In memory-mapped I/O, I/O devices share the same address space as main memory and use standard memory access instructions (MOV, LOAD, STORE).

Merge sort always takes $\Theta(n log n) time$ in worst, average, and best cases, regardless of input order.

Buffer size does not eliminate deadlocks caused by faulty synchronization (II false) nor make implementation easier (III false).

X->Bwd->Fwd = X->Fwd; X->Fwd->Bwd = X->Bwd;.

Traversal of Tree-2 (Inorder)

An Inorder traversal follows the rule: Left Subtree \(\rightarrow \) Root \(\rightarrow \) Right Subtree.
• In Tree-2, traversing through the nodes from left to right yields the matching sequence:
\(\text{G}\rightarrow \text{J}\rightarrow \text{I}\rightarrow \text{H}\rightarrow \text{E}\rightarrow \text{F}\rightarrow \text{B}\rightarrow \text{D}\rightarrow \text{C}\rightarrow \text{A}\)