Skip to main content

The address of the first location of a 256 kilo byte (KB) memory is (2500)H. Choose the correct address ...

 

Q. The address of the first location of a 256 kilo byte (KB) memory is (2500)H. Choose the correct address of the last location of the memory.

(A) (2FFF)H (B) (124FF)H (C) (424FF)H (D) (324FF)H

The address of the first location of a 256 KB memory is (2500)H. Choose the correct address of the last location of the memory.

Starting Address

(2500)H

Memory Size

256 KB

Step-by-Step Solution

Step 1: Convert Memory Size into Bytes

We know that:

\[ 1 KB = 1024 \text{ bytes} \]

Given memory size = 256 KB.

\[ 256 KB = 256 \times 1024 \] \[ = 262144 \text{ bytes} \]

Step 2: Convert Bytes into Hexadecimal

Convert 262144 into hexadecimal notation.

\[ 262144_{10}=40000_{16} \]

Therefore, 256 KB = 40000H bytes.

Step 3: Calculate the Last Memory Address

Use the following formula:

\[ \boxed{ \text{Last Address} = \text{Starting Address} + \text{Memory Size} -1 } \]

Substitute the given values:

\[ =2500_H+40000_H-1 \] \[ =42500_H-1 \] \[ =424FF_H \]
Correct Answer

Last Memory Address

\[ \boxed{(424FF)_H} \]

The last location of the 256 KB memory is 424FFH.

Shortcut Method for GATE Exams

Remember this formula to solve memory address calculation problems quickly:

\[ \boxed{ \text{Last Address} = \text{Starting Address} + \text{Size} -1 } \]

Why subtract 1? Because the starting address itself is counted as the first memory location.

For example, if memory starts at address 100 and contains 10 bytes, the last address is 109, not 110.

Important Points for GATE Preparation

  • ✓ 1 KB = 1024 bytes in the conventional binary memory-size convention used in this question.
  • ✓ 1 MB = 1024 KB.
  • ✓ Always subtract 1 when calculating the last address from the starting address and size.
  • ✓ Hexadecimal numbers use digits from 0 to 9 and A to F.
  • ✓ Check whether the memory is byte-addressable or word-addressable before calculating addresses.

Frequently Asked Questions

How do you calculate the last address of memory?

Use Last Address = Starting Address + Memory Size - 1. Ensure the memory size is expressed in addressable units, such as bytes for byte-addressable memory.

How many bytes are there in 256 KB?

Using the binary convention, 256 KB = 256 × 1024 = 262144 bytes.

Why is 1 subtracted while calculating the last address?

Because the starting address represents the first location. Therefore, a memory containing N bytes occupies N consecutive addresses, from the starting address through starting address + N - 1.

What is the last address of 256 KB memory starting at 2500H?

The last address is 424FFH, assuming byte-addressable memory and 1 KB = 1024 bytes.

Conclusion

Memory address calculation is an important topic in Computer Organization and Architecture. For a memory of 256 KB starting at 2500H, the last address is 424FFH. Remember the starting address + memory size - 1 formula to solve similar GATE examination problems.



Contact Us

Name

Email *

Message *

Popular Posts

UGC NET Electronic Science Previous Year Question Papers with Solutions

Download Papers and Solutions Exam Pattern Preparation Tips FAQs More Home / Engineering & Other Exams / UGC NET 2026 PYQ 📊 Exam Highlights: Electronic Science (88) Feature Details Junior Research Fellowship (JRF) ₹37,000 + HRA per month Eligibility M.Sc/M.Tech in Electronics (55%) Validity of Certificate JRF (3 Years) | Lectureship (Lifetime) 📥 Download UGC NET Electronics PDFs Complete collection of previous year question papers, answer keys and explanations for Subject Code 88. Start Downloading 📂 View All Question Papers June 2026 - Question Paper Download PDF June 202...

GMSK BER vs SNR (with Simulation)

  GMSK Performance: Why the BER vs. SNR Curve Matters If you’ve ever wondered why GMSK (Gaussian Minimum Shift Keying) became the backbone of the global GSM revolution, the answer lies in its unique balance of spectral efficiency and power performance. But there is no free lunch in engineering. To get that sleek, narrow spectrum, you have to pay a price in Bit Error Rate (BER) . In this guide, we break down the theoretical BER vs. SNR performance of GMSK, the "magic" of the BT product, and how to optimize your link budget for real-world conditions. What is GMSK and Why Should You Care? GMSK is a derivative of MSK (Minimum Shift Keying) that uses a Gaussian pre-modulation filter. This filter "smooths" the phase transitions, significantly reducing sideband power. The result? A constant envelope signal that allows you to use high-efficiency Class-C amplifiers without distorting the signal. This is the secr...

The output voltage V0 (in Volt) for the network given in the Figure is ___

  Find the Output Voltage V o Solve the given circuit using Kirchhoff's Current Law (KCL), Ohm's law, and the supernode method. 1. Given Circuit Parameters Current source 1 mA Resistors 1 kΩ Each resistor Voltage source 6 V Required V o 2. Understand the Circuit The circuit contains a 1 mA current source, four 1 kΩ resistors, and a 6 V source connected between the two midpoint nodes. The output voltage is measured between the top and bottom rails. Reference node Take the bottom rail as ground: 0 V . Let the top rail voltage be V T , and...

What is a Supernode?

  Circuit Analysis What Is a Supernode? A supernode is formed when an ideal voltage source connects two non-reference nodes. It allows us to apply Kirchhoff's Current Law (KCL) to the combined circuit boundary. 1. Understanding a Supernode In nodal analysis, a voltage source between two unknown-voltage nodes makes the current through that source difficult to express directly using Ohm's law. We combine the two nodes and the voltage source into one extended region called a supernode. Key idea Apply KCL around the outer boundary of the supernode, then use the voltage source to write an additional voltage equation. 2. Supernode Circuit Diagram The voltage source connects nodes V L an...

A binary ripple counter is designed to count (0)₁₀ to (64)₁₀. Which of the following is/are the number of flip-flops required ...

  Q. A binary ripple counter is designed to count  (0)₁₀ to (64)₁₀ . Which of the following is/are the number of flip-flops required to design the counter?   (A) 6 (B) 7 (C) 4 (D) 5 Solution A binary ripple counter must count from (0)₁₀ to (64)₁₀ , including both endpoints. Step 1: Calculate the total number of states Since both 0 and 64 are included, add 1 to the difference: N = Last value − First value + 1 N = 64 − 0 + 1 = 65 states The counter visits every integer from 0 through 64: 0, 1, 2, 3, ..., 63, 64 There are 65 distinct states in total. Step 2: Calculate the number of flip-flops Each flip-flop stores one bit. With n flip-flops, the counter can represent 2ⁿ distinct states. 2⁶ = 64 states (not enough) 2⁷ = 128 states (eno...

The cutoff frequency (in GHz) for the dominant TE10 mode of an air-filled rectangular waveguide of ...

  Q. The cutoff frequency (in GHz) for the dominant TE10 mode of an air-filled rectangular waveguide of inner dimension 0.28 inch×0.14 inch is __. (rounded off to two decimal places). Given Information Waveguide dimensions = 0.28 inch × 0.14 inch Wider dimension (a) = 0.28 inch Smaller dimension (b) = 0.14 inch Medium = Air Dominant mode = TE 10 Speed of light (c) = 3 × 10 8 m/s Step 1: Cutoff Frequency Formula The cutoff frequency of a rectangular waveguide is: f c = (c / 2) √[(m/a) 2 + (n/b) 2 ] For the dominant TE 10 mode: m = 1, n = 0 f c = c / 2a Step 2: Convert Inch into Meter We know that 1 inch = 0.0254 meter. a = 0.28 × 0.0254 a = 0.007112 m ...

Parametric Down-Conversion of Photons

  Nonlinear Optics One incoming photon is converted into two lower-energy photons, typically in a nonlinear optical medium. Energy is conserved: E in = E 1 + E 2 E in ​ = E 1 ​ + E 2 ​ . Parametric Down-Conversion A nonlinear optical process in which one pump photon is converted into two lower-energy photons, known as the signal and idler photons. 1 Energy Conservation The energy of the pump photon equals the sum of the energies of the signal and idler photons. \[ \boxed{\hbar\omega_p=\hbar\omega_s+\hbar\omega_i} \] \[ \boxed{\omega_p=\omega_s+\omega_i} \] ωₚ Pump angular frequency ...

SRAM, DRAM, EPROM, MRAM, and DDRAM Explained

Computer Fundamentals Types of Memory and Their Technologies Understand the fundamental relationship between different types of computer memory and the technologies used to implement them. Fundamental Matching Memory type, technology, and key characteristics Memory Type Technology Key Characteristic Cache Memory SRAM Very fast; stores frequently accessed data Main Memory DRAM Holds programs and data currently in use Au...