The output f of the circuit is given as feedback input which should always be 1.
From the given circuit
f= (A+B')C (Assuming that feedback input is 1)
So, the output remains 1 iff C=1 and (A+B')=1.
A=1, B=0, C=1
A=1, B=1, C=1
A=0, B=0, C=1
Hence option A and D are correct.

AVL tree is a self balancing tree with height difference at most 1. A balance factor in AVL tree is used to check what rotation to make.

GSM Architecture:

→Mobile Station (MS)
Mobile Equipment (ME)
Subscriber Identity Module (SIM)
→Base Station Subsystem (BSS)
Base Transceiver Station (BTS)
Base Station Controller (BSC)
→Network Switching Subsystem (NSS)
Mobile Switching Center (MSC)
Home Location Register (HLR)
Visitor Location Register (VLR)
Authentication Center (AUC)
Equipment Identity Register (EIR)

The given set is not a null set don't get confused in this.
A null set is a set which have no element in it and can be represented as either { } or ɸ.
And the given set {ɸ} represents a set having ɸ as its element. It is not a null set because given set is having ɸ inside it.
As we know power set is a set of all subsets of a given set. For given set it's power set is {ɸ, {ɸ}}

Explanation:

C and C++ are context sensitive languages.

→ The Mobile Application Protocol (MAP) is an SS7 protocol that provides an application layer for the various nodes in GSM and UMTS mobile core networks and GPRS core networks to communicate with each other in order to provide services to users.
→ The Mobile Application Protocol is the application-layer protocol used to access the Home Location Register, Visitor Location Register, Mobile Switching Center, Equipment Identity Register, Authentication Centre, Short message service center and Serving GPRS Support Node (SGSN).

M bit is 1: It is either the first fragment or a middle one because of the offset value is 0, it is the first fragment.
M bit is 0: It means there are no more fragments. The fragment is the last one.

→ Number of bit strings of length 8 that start with 1: 27 = 128.
→ Number of bit strings of length 8 that end with 00: 26 = 64.
→ Number of bit strings of length 8 that start with 1 and end with 00: 25 = 32.
→ Applying the subtraction rule, the number is 128+64−32 = 160

In compiler design ‘reducing the strength’ refers to code optimization using cheaper machine instructions.
Example:
Dividing by 2→ Use right shift by 2.
Multiplication by 2→ Use left shift by 2.

1. An absolute address is represented by the contents of a register. This addressing mode is absolute in the sense that it is not specified relative to the current instruction address.
2. Indirect addressing is a scheme in which the address specifies which memory word or register contains not the operand but the address of the operand.
Immediate Operand:
The simplest way for an instruction to specify an operand is for the address part of the instruction actually to contain the operand itself rather than an address or other information describing where the operand is. Such an operand is called an immediate operand because it is automatically fetched from memory at the same time the instruction itself is fetched. It is immediately available for use.
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