The correct answer is: 2) the output of the previous flip-flop

Explanation:
In an asynchronous counter (also called a ripple counter):

Only the first flip-flop receives the external clock signal.

Each subsequent flip-flop is triggered by the output (Q or Q̅) of the previous flip-flop, not by a common clock.

This causes a ripple effect, where changes propagate sequentially, leading to a slight delay between stages.

Additional Information
Asynchronous Counter

Asynchronous counters are those counters where the clock of the next stage is obtained from the output of the previous state.

The correct answer is: 2) RST 7.5

Explanation:

In the 8085 microprocessor, the RST 7.5 interrupt has unique characteristics:

• Edge-Triggered:
• RST 7.5 is positive-edge sensitive, meaning it triggers when the signal transitions from LOW to HIGH.
• It can be activated by a short pulse (minimum 500 ns wide).
   

Other RST Interrupts:

RST 6.5 and RST 5.5: Level-sensitive (require the signal to remain HIGH until acknowledged).

RST 4.5: Not a standard interrupt in 8085.6

The correct option is 4

Concept:

From the truth table, it is clear that the output of an EX-OR gate is '0' when both inputs are '1'. This is because the EX-OR gate outputs '1' only when the inputs are different. When both inputs are the same (either both 0 or both 1), the output is '0'. Therefore, the correct answer is option 4.

The correct answer is option 3) 1

Concept:

Let's analyze the given problem statement and options in detail:

Given:

• T = 1
• Current output Q = 0

Let's analyze the state of Q after each clock pulse:

1. Initial state Q = 0
2. After 1st clock pulse: Q will toggle from 0 to 1
3. After 2nd clock pulse: Q will toggle from 1 to 0
4. After 3rd clock pulse: Q will toggle from 0 to 1

Therefore, the output Q after 3 clock pulses will be 1.

A half adder circuit is made up of an AND gate with an XOR gate as shown below:

• A half adder is also known as XOR gate because XOR is applied to both inputs to produce the sum
• Half adder can add only two bits (A and B) and has nothing to do with the carry
• If the input to a half adder has a carry, then it will neglect it and adds only the A and B bits
• That means the binary addition process is not complete and that's why it is called a half adder

Sum (S) = A⊕B, Carry = A.B

1 0 0 1 0 0 0 0
-  1 1 1 1 0 0 1
0 0 0 1 0 1 1 1

Step 1: 0 – 1 = Borrow to make 10 – 1 = 1.
Step 2: 1 – 0 = 1.
Step 3: 1 – 0 = 1.
Step 4: 1 – 1 = 0.
Step 5: 0 – 1 = Borrow to make 10 – 1 = 1.
Step 6: 1 – 0 = 1.
Step 7: 1 – 0 = 1.

Remember: When zero takes 1 as carry from its left side number, '0' will become '10' which is equal to '2' (2-1=1) and if that '10' further gives carry then it will become '1' not '0'.

Concept:

XNOR Gate:

Symbol:

Truth Table:

Output Equation: \(Y={\overline{A\oplus B}}\)

1) If B is always Low, the output is the inverted value of the other input A, i.e. A̅.

2) The output is low when both the inputs are different.

3) The output is high when both the inputs are the same.

4) XNOR gate produces an output only when the two inputs are same.

Analysis:

\(F = \overline{A+0}=\bar A\)

Solution:

The binary representation of 257 is 100000001

∴ The total number of the binary digit in 257 is 9

F(P, Q, R) = PQ + QR' + PR'

= PQ (R + R') + (P + P')QR' + P(Q + Q')R'

= PQR + PQR' + PQR' + P'QR' + PQR' + PQ'R'

= PQR + PQR' + P'QR' + PQ'R'

= m₇ + m₆ + m₂ + m₄

The correct answer is 'option 2'

Concept

Divide 127 by 2. Use the integer quotient obtained in this step as the dividend for the next step. Repeat the process until the quotient becomes 0.

Solution:

Write the remainder from bottom to top i.e. in the reverse chronological order.

This will give the binary equivalent of 127. 

Therefore, the binary equivalent of decimal number 127 is 1111111.

• AND, OR, NOT gates are the basic gates.
• The logic gates which are derived from the basic gates like AND, OR, NOT gates are known as derived gates. NAND, NOR, XOR, and XNOR are the derived gates.
• A universal gate is a gate which can implement any Boolean function without need to use any other gate type. The NAND and NOR gates are universal gates.

The correct answer is option 1): 45

Concept:

To convert the binary number 101101 to decimal, follow these two steps:

• Start from one's place in 101101: multiply one place with 2^0, tens place with 2^1, hundreds place with 2^2 and so on from right to left
• Add all the products we got from step 1 to get the decimal equivalent of 101101. Using the above steps, here is the work involved in the solution for converting 101101 to a decimal number (Don't forget that we start from one place to so on...)
  • Decimal equivalent of "1" = 1 × 2^0 = 1
  • Decimal equivalent of "0" = 0 × 2^1 = 0
  • Decimal equivalent of "1" = 1 × 2^2 = 4
  • Decimal equivalent of "1" = 1 × 2^3 = 8
  • Decimal equivalent of "0" = 0 × 2^4 = 0
  • Decimal equivalent of "1" = 1 × 2^5 = 32
  • The decimal equivalent of "101101" =   45
  • Here is the final answer, The binary number 101101₂ converted to decimal is therefore equal 45₁₀

(A.A̅) + A

= 0 + A = A

All Boolean algebra laws are shown below:

The Correct Answer is "Cache Memory".

Important Points

Cache Memory :

• Cache Memory is a special very high-speed memory.
• It is used to speed up and synchronizing with a high-speed CPU. Cache memory is costlier than main memory or disk memory but economical than CPU registers.
• Cache memory is an extremely fast memory type that acts as a buffer between RAM and the CPU.
• It holds frequently requested data and instructions so that they are immediately available to the CPU when needed.
• Cache memory is used to reduce the average time to access data from the Main memory.

Additional Information

Secondary Memory​ :

• It is non-volatile, i.e. it retains data when power is switched off.
• It is large capacities to the tune of terabytes.
• It is cheaper as compared to the primary memory.
• Depending on whether the Secondary memory device is part of the CPU or not, there are two types of secondary memory – fixed and removable.

 Auxiliary Memory :

• Auxiliary memory is the non-volatile memory lowest-cost, highest-capacity, and slowest-access storage in a computer system.
• It is where programs and data kept for long-term storage or when not in immediate use.
• Such memories tend to occur in two types-sequential access (data must access in a linear sequence) and direct access (data may access in any sequence).
• The most common sequential storage device is the hard disk drives, whereas direct-access devices include rotating drums, disks, CD-ROMs, and DVD-ROMs.
• It used as permanent storage of data in mainframes and supercomputers.

Virtual Memo :

• A computer can address more memory than the amount physically installed on the system.
• This extra memory is actually called virtual memory and it is a section of a hard disk that's set up to emulate the computer's RAM.
• The main visible advantage of this scheme is that programs can be larger than physical memory.
• Virtual memory serves two purposes.
  • First, it allows us to extend the use of physical memory by using the disk.
  • Second, it allows us to have memory protection because each virtual address is translated to a physical address.

The number of 2-input NAND gates required to implement a 2-input XOR gate is 4.

Similarly, the number of 2-input NOR gates required to implement a 2-input XNOR gate is 4.