| List I | List II | ||
| A | printf("%d", size of (3.14)); | I | 5 |
| B | Union A (intx, float y,} printf("%d", size of (A)); | II | 4 |
| C | Invalid ostruct B {char x; double y;}; C. 2 printf("%d", size of (B));pcode | III | 2 |
| D | printf("%d", size of ('1')); | IV | 8 |
| List I | List II | ||
| A | Page replacement Policy | I | Circular wait |
| B | Deadlock | II | Page fault |
| C | Scheduling | III | Shortest job first |
| D | Dijakstra is banking algorithm | IV | Deadlock avoidance |