Converting binary fractions to rational numbers (decimal fractions)
📌 To convert binary fractions to their decimal equivalents, all we have to do is multiply each bit with its power of 2 position.
💎 Note: To convert octal and hexadecimal fractions to their decimal equivalents we follow the same steps
we used above except we change the multiplier(Base) to 8 and 16 respectively.
Converting rational numbers to Baes B fractions
💎To convert rational numbers to their Base B fraction equivalent we will follow the following steps.
Step 1: Multiply the number after decimal point by B
Step 2: Take number before the decimal point from the result.
Step 3: repeat steps 1 and 2 until there is no decimal point to multiply
@Computer_science_course
📌 To convert binary fractions to their decimal equivalents, all we have to do is multiply each bit with its power of 2 position.
💎 Note: To convert octal and hexadecimal fractions to their decimal equivalents we follow the same steps
we used above except we change the multiplier(Base) to 8 and 16 respectively.
Converting rational numbers to Baes B fractions
💎To convert rational numbers to their Base B fraction equivalent we will follow the following steps.
Step 1: Multiply the number after decimal point by B
Step 2: Take number before the decimal point from the result.
Step 3: repeat steps 1 and 2 until there is no decimal point to multiply
@Computer_science_course
Computer Arithmetic
Now that binary numbers are discussed, it’s time to look at how their arithmetic works. But
there are two basic binary number representations so far. Unsigned binary numbers and binary
numbers that are represented using the sign and magnitude method.
@Computer_science_course
Now that binary numbers are discussed, it’s time to look at how their arithmetic works. But
there are two basic binary number representations so far. Unsigned binary numbers and binary
numbers that are represented using the sign and magnitude method.
@Computer_science_course
Addition & subtraction for signed binary integers (using sign and magnitude)
💎If the binary numbers are signed then addition and subtraction can be expressed using just the
addition operation.
💎Take a look at the following equations.
📌X – Y = X + (- Y )
📌-X – Y = (- X ) + (- Y)
📎Recap: The first bit of the binary number indicates sign, 0 for positive and 1 for negative
🔑Rules:
1. Identify the sign of each binary number [ the sign bit is excluded for the calculation]
A. If they both have the same sign
📌Add the two binaries.
📌Apply the sign to the result.
@Computer_science_course
💎If the binary numbers are signed then addition and subtraction can be expressed using just the
addition operation.
💎Take a look at the following equations.
📌X – Y = X + (- Y )
📌-X – Y = (- X ) + (- Y)
📎Recap: The first bit of the binary number indicates sign, 0 for positive and 1 for negative
🔑Rules:
1. Identify the sign of each binary number [ the sign bit is excluded for the calculation]
A. If they both have the same sign
📌Add the two binaries.
📌Apply the sign to the result.
@Computer_science_course
3) Multiplication for unsigned integers is straight
forward,
📌Find out the number of bits needed n
📌 Represent both numbers with n
📌 apply decimal multiplication rule
📌 apply the unsigned binary addition rule
📌cut-off unnecessary bits
@Computer_science_course
forward,
📌Find out the number of bits needed n
📌 Represent both numbers with n
📌 apply decimal multiplication rule
📌 apply the unsigned binary addition rule
📌cut-off unnecessary bits
@Computer_science_course
Division Rules:
📌Assumption
o n= number of bits of the divisor db1
o db2= dividend
📌cut n from db2 to create a smaller binary b
📌 if b is less than db1 then multiply db1 by 1
📌if b is greater than db1 then multiply db1 by 0
📌subtract and continue until the dividend is exhausted
💎apply the subtraction rule for unsigned integers
💎trim unnecessary bits
@Computer_science_course
📌Assumption
o n= number of bits of the divisor db1
o db2= dividend
📌cut n from db2 to create a smaller binary b
📌 if b is less than db1 then multiply db1 by 1
📌if b is greater than db1 then multiply db1 by 0
📌subtract and continue until the dividend is exhausted
💎apply the subtraction rule for unsigned integers
💎trim unnecessary bits
@Computer_science_course
Binary Complements
Complements are used to represent negative integers in a binary form.
💎Positive integers are
represented in the normal binary from.
✅ 1’s complement
Simply convert 0s to 1s and 1s to 0s.
@Computer_science_course
Complements are used to represent negative integers in a binary form.
💎Positive integers are
represented in the normal binary from.
✅ 1’s complement
Simply convert 0s to 1s and 1s to 0s.
@Computer_science_course
Subtraction using 1’s complement.
💎Since every negative integer can be represented uniquely subtraction can be replaced with addition. Like previously
X – Y = X + (-Y).
🔑Rule: If there is a remainder at the end it’s added to the result.
@Computer_science_course
💎Since every negative integer can be represented uniquely subtraction can be replaced with addition. Like previously
X – Y = X + (-Y).
🔑Rule: If there is a remainder at the end it’s added to the result.
@Computer_science_course
2’s compliment
💎This is a more refined version of 1’s compliment.
💎It solves the problem of 1’s complement.
💎To find the 2’s complement of a negative integer, first find the 1’s complement the add 1.
@Computer_science_course
💎This is a more refined version of 1’s compliment.
💎It solves the problem of 1’s complement.
💎To find the 2’s complement of a negative integer, first find the 1’s complement the add 1.
@Computer_science_course
Steps in SDLC
📌SDLC can be made up of multiple steps.
There is no concrete set number of steps involved.
📌Around seven or eight steps appear commonly;
however, there can be anywhere from five upwards to 12.
Typically, the more steps defined in an SDLC model,
the more granular the stages are.
💎In general, an SDLC methodology follows these following steps:
@Computer_science_course
📌SDLC can be made up of multiple steps.
There is no concrete set number of steps involved.
📌Around seven or eight steps appear commonly;
however, there can be anywhere from five upwards to 12.
Typically, the more steps defined in an SDLC model,
the more granular the stages are.
💎In general, an SDLC methodology follows these following steps:
@Computer_science_course
Steps in SDLC
📌SDLC can be made up of multiple steps.
There is no concrete set number of steps involved.
📌Around seven or eight steps appear commonly;
however, there can be anywhere from five upwards to 12.
Typically, the more steps defined in an SDLC model,
the more granular the stages are.
💎In general, an SDLC methodology follows these following steps:
@Computer_science_course
📌SDLC can be made up of multiple steps.
There is no concrete set number of steps involved.
📌Around seven or eight steps appear commonly;
however, there can be anywhere from five upwards to 12.
Typically, the more steps defined in an SDLC model,
the more granular the stages are.
💎In general, an SDLC methodology follows these following steps:
@Computer_science_course
1.Plan and requirements:
💎The new system requirements are defined. In particular, the deficiencies in the existing system must be addressed with specific proposals for improvement. Other factors defined include needed features, functions and capabilities.
@Computer_science_course
💎The new system requirements are defined. In particular, the deficiencies in the existing system must be addressed with specific proposals for improvement. Other factors defined include needed features, functions and capabilities.
@Computer_science_course