Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 3786622
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 19, 20262026-05-19T11:42:45+00:00 2026-05-19T11:42:45+00:00

I’m wondering if anyone might know how to perform a division between two signed

  • 0

I’m wondering if anyone might know how to perform a division between two signed integers in MIPS, WITHOUT using the built in division operations.

In the problem specs, I’m told the divisor register, ALU, and quotient register are all 32 bits wide, and the remainder register is 64 bits.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-19T11:42:46+00:00Added an answer on May 19, 2026 at 11:42 am

    Think of how you’d perform a binary division by hand:

    # a/b, where a=2011 and b=18
    
                1101111 ←quotient
          ┌────────────         ↓
    10010 │ 11111011011  a
           -10010↓↓↓↓↓↓  -64b × 1
           ───────↓↓↓↓↓
             11010↓↓↓↓↓
            -10010↓↓↓↓↓  -32b × 1
            ───────↓↓↓↓
              10001↓↓↓↓
             -00000↓↓↓↓  -16b × 0
             ───────↓↓↓
              100011↓↓↓
              -10010↓↓↓   -8b × 1
              ───────↓↓
               100010↓↓
               -10010↓↓   -4b × 1
               ───────↓
                100001↓
                -10010↓   -2b × 1
                ───────
                  11111
                 -10010   -1b × 1
                 ──────                
                   1101  remainder
    

    This “grade school” long division algorithm can be written (in Python — I’ll let you convert it to MIPS) as:

    def unsigned_divide(dividend, divisor):
        if divisor == 0:
            raise ZeroDivisionError()
        if dividend < divisor:
            return 0
        # Determine the position of the first digit of the quotient
        shift_amt = dividend.bit_length() - divisor.bit_length()
        # Loop to find each bit of the quotient
        quotient = 0
        while shift_amt >= 0:
            # Calculate one bit of the quotient
            if dividend >= (divisor << shift_amt):
                 # new bit is 1
                 dividend -= (divisor << shift_amt)
                 quotient |= (1 << shift_amt)
            # Move to the next digit
            shift_amt -= 1
        return quotient
    

    For signed division, you can just divide the absolute values while keeping track of the sign (assuming you want C-style truncating division):

    def signed_divide(dividend, divisor):
        is_negative = (dividend < 0) ^ (divisor < 0)
        abs_quotient = unsigned_divide(abs(dividend), abs(divisor))
        return -abs_quotient if is_negative else abs_quotient
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Does anyone know how can I replace this 2 symbol below from the string
link Im having trouble converting the html entites into html characters, (&# 8217;) i
That's pretty much it. I'm using Nokogiri to scrape a web page what has
I'm parsing an RSS feed that has an &#8217; in it. SimpleXML turns this
We're building an app, our first using Rails 3, and we're having to build
I'm making a simple page using Google Maps API 3. My first. One marker
I have text I am displaying in SIlverlight that is coming from a CMS
Seemingly simple, but I cannot find anything relevant on the web. What is the
this is what i have right now Drawing an RSS feed into the php,
I'm trying to decode HTML entries from here NYTimes.com and I cannot figure out

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.