8085 microprocessor has 8 bit ALU. It performs arithmetic and logical operations like Addition, Subtraction, AND, OR, etc. on 8-bit data.

Status register(SR):
→ A status register is a collection of status flag bits for a processor.
→ The status register is a hardware register that contains information about the state of the processor. Individual bits are implicitly or explicitly read and/or written by the machine code instructions executing on the processor.
→ The status register lets an instruction take action contingent on the outcome of a previous instruction.
Interrupt service register(ISR):
→ Interrupt service routine(ISR) is a special block of code associated with a specific interrupt condition.
→ Interrupt handlers are initiated by hardware interrupts, software interrupt instructions, or software exceptions, and are used for implementing device drivers or transitions between protected modes of operation, such as system calls.
Interrupt mask register(IMR):
→ The Interrupt Mask Register is a read and write register.
→ This register enables or masks interrupts from being triggered on the external pins of the Cache Controller.
→ The IMR is used to disable (Mask) or enable (Unmask) individual interrupt request inputs. This is also an 8-bit register.
Interrupt request register(IRR):
→ It stores all the interrupt inputs that are requesting service.
→ It is an 8-bit register, one bit for each interrupt request.
→ It keeps track of which interrupt inputs are asking for service. If an interrupt input is unmasked, and has an interrupt signal on it, then the corresponding bit in the IRR will be set.
→ The content of this register can be read to know the status of pending interrupts.

Register indirect: It is specified implicitly in the definition of instruction. Register indirect addressing mode, the operands are stored in the memory. The address of the corresponding memory location is given in a register which is specified in the instruction.
Index mode: The address of the operand is obtained by adding to the contents of the general register (called index register) a constant value. The number of the index register and the constant value are included in the instruction code.

TRUE: An OODBMS avoids the“impedance mismatch” problem.
FALSE: An OODBMS avoids the “phantom” problem.
FALSE: An OODBMS provides higher performance concurrency control than most relational databases.
TRUE: An OODBMS provides faster access to individual data objects once they have been read from disk.

Functional Completeness Condition: It is the condition used to check the equivalence(The condition that all the data of the global relation must be mapped into the fragments) between global relation and its fragments after decomposition. When a relation is decomposed into fragments, both global relation and its fragments should be able to determine each other.
For decomposing a global relation, lossless decomposition is the necessary condition but functionally completeness problem is not a necessary condition.
A relation in BCNF may or may not be functionally complete

Here ‘B’ is common attribute but ‘B’ is not the primary key in any of the decomposed relations (R1 or R2). Hence this decomposition is not a lossless decomposition i.e., it is a lossy decomposition.
Hence, option (C) is correct.

EXCEPT operation is like subtraction operation.
EXCEPT : EXCEPT operator do not include duplicates i.e if there are duplicate copies of a tuple in a relation the EXCEPT will consider only one copy of that duplicated tuple.
EXCEPT ALL : EXCEPT operator includes duplicates.

Specialization: Specialization is a top-down approach, means higher to lower. Result of taking a subset of a higher level entity set to from a lower level entity set.
Generalization: Generalization is a bottom-up approach, means lower to higher. Result of taking the union of two or more disjoint(lower-level) entity sets to produce higher-level entity set.
Aggregation: It is treated as higher level entity sets and can participate in relationships. Mapping cardinalities: Number of entities to which another entity can be associated via a relationship set. An abstraction in which relationship sets(along with their associated entity sets) are treated as higher level entity sets, and can participate in relationships.
Mapping cardinalities: Express the number of entities to which another entity can be associated via a relationship set.