Ans .
A
Ans .
C
Ans .
A
Ans .
B
Ans .
A
Ans .
C
Ans .
D
Ans .
B
Ans .
D
Ans .
A
Ans .
B
Ans .
A.
Ans .
D
Ans .
B
Ans .
'B'.
Ans .
B
Ans .
A
Ans .
B or D.
Ans .
C.
Ans .
C.
Ans .
D.
Ans .
A
Ans .
C
Ans .
A.
Ans .
D.
Ans .
C
Ans .
B.
Ans .
A
Ans .
D
Ans .
A
Ans .
B
Ans .
A
Ans .
B
Ans .
A
Ans .
A
Ans .
A
Ans .
D
Ans .
B
Ans .
D
Ans .
B
Ans .
B
START, END, BYTE, WORD, RESB, RESW. These statements are not translated into machine instructions.Instead, they provide instructions to the assembler itself.
Ans .
B
Ans .
D
Ans .
B
Lisp was used as the implementation of the programming language Micro Planner which was used in the famous AI system SHRDLU
Ans .
C
(1+5)(3-2)+
15+32-+Ans .
B
The page table is the full list of pages, whether mapped or unmapped - so there are 256 entries in the page table, since there are 256 pages.
Ans .
C
The Banker's algorithm, sometimes referred to as the detection algorithm, is a resource allocation and deadlock avoidance algorithm developed by Edsger Dijkstra that tests for safety by simulating the allocation of predetermined maximum possible amounts of all resources, and then makes an "s-state" check to test for possible deadlock conditions for all other pending activities, before deciding whether allocation should be allowed to continue.
Ans .
A
Device or special files are used for device I/O on UNIX and Linux systems. They appear in a file system just like an ordinary file or a directory.
Ans .
B
As we modify a file, its date and time for the modification reflects.
Ans .
D