Micro computer is the least powerful computer and super computer is the most powerful computer.

In a general computing sense, overlaying means "the process of transferring a block of program code or other data into main memory, replacing what is already stored". Overlaying is a programming method that allows programs to be larger than the computer's main memory.

At first instruction we will load the first no. in accumulator and then from second instruction we will add remaining n-1 no. using accumulator. Till now n instruction is used. And finally we will use one more instruction to store the result back to memory. So in total n+1 instruction is required.

Relative mode is the most relevant addressing mode to write position independent code.
Indexed mode is for arrays and structure.
Indirect mode is used for pointers.

The process in which a CPU of a computer takes instruction from memory and executes them is called fetch-execute cycle.

The formula for above given question is ⁿP_m.

More generally, if C is a group and z∈C with zⁿ = 1, where 1 is the identity of C, then G = {1,z,z²,...,z^n-1} is a group (actually, a subgroup of C).
Indeed:
• Closure: z^jz^k = z^j+k = z^r ∈ G, where r = (j+k) mod n.
• Associativity: comes from C.
• Identity: 1 ∈ G by definition, and 1 is the identity of C.
• Inverse: z^jz^n-j = 1.
• Commutativity: z^jz^k = z^j+k = z^k+j = z^kz^j.

For each digit we have two choices ‘1 or 2’. So no. of possible 10 digits nos.
2*2*2*2*2*2*2*2*2*2 = 2¹⁰

Any graph with n vertices and n-1 edges which is connected will definitely be a tree.

Eigen-vectors of a real symmetric matrix corresponding to different eigenvalues are orthogonal to each other.

Context free language is not closed under intersection. Hence B is the correct option.

Context sensitive grammar can be recognized by linear bounded automata.

Option A do not contain xy which is generated by the grammar.
Option B do not contain xy which is generated by the grammar.
Option C do not contain xy which is generated by the grammar.

Recursively enumerable language are not closed under complementation.

Turing machines is more powerful than finite machines because it has the capability to remember arbitrarily long sequences of input symbols.

NFA, DFA and regular expression are equal in power. So for every regular expression there exists DFA and NFA.

DFA has equal power as NFA.

The given regular expression is not equal to option D.

Fiber Distributed Data Interface (FDDI) uses fiber-optic cable and is wired in a ring topology and Fiber Distributed Data Interface (FDDI) uses token passing as its media-access method and can operate at high speeds.

Broadband is not a class of LAN.

Among the given options FTP and TFTP is used to transfer files. Trivial File Transfer Protocol (TFTP) is an Internet software utility for transferring files that is simpler to use than the File Transfer Protocol (FTP) but less capable. It is used where user authentication and directory visibility are not required.

Aloha is used to get access of the link because it is a access control method or we can also say that it is a channel allocation problem.

Error detection at the data link layer is achieved by CRC method.