Answer Happy

Assembly Language
computer scienc
e
3. Deadlocks: (a) Need to always be prevented by the operating system (b) Always occur when there is a cycle in a resource allocation graph (c) Are also referred to as page faults (d) Can be prevented between two programs if they each code a special entry and exit section before their critical update section (e) Never occur in multiprogramming environments 4. Which statement regarding logic gates is true: (a) The output of a NAND gate is 1 whenever both the input bits are 1 (b) The output of an XOR gate is 1 whenever either or both of the input bits are 1 (c) A NAND gate can be replaced by an AND gate, followed by a NOT gate (d) Some logic gates cannot be represented by a Boolean expression (e) The Boolean expression A+B can be represented by an AND gate