Professional Documents
Culture Documents
Expt Title LO
no
1 Study of PC Motherboard Technology (South Bridge and North LO1
Bridge), Internal Components and Connections used in computer
system
2 Verify the truth table of various logic gates (basic and universal LO2
gates)
7 Develop Program to find even and odd numbers from a given list LO4
8 Program to find largest and smallest numbers from a given list LO4
EXPERIMENT NO.1
THEORY:
DEFINITION:
The motherboard is the main circuit board of your
computer and is also known as the mainboard or logic
board. It is a printed circuit board containing the principal
components of a computer or other device, with connectors
for other circuit boards to be slotted into.
COMPONENTS OF MOTHERBOARD:
1. Central Processing Unit (CPU):
Also known as the microprocessor or the processor,
the CPU is the computer's brain. It is responsible for
fetching, decoding, and executing program
Year/ Sem: SE/ IV Academic Year : 2020-21
2. Northbridge:
This allows communication between the CPU and
the system memory and PCI-E slots. It is a focal
Point of Motherboard and It is also called as Memory
Controller Hub.
3. Southbridge:
This is the controller for components such as the PCI
slots, onboard audio, and USB connections.
the user opens other files and programs that are still
loaded in memory.
7. Cache Memory:
Cache memory is a small block of high-speed
memory (RAM) that enhances PC performance by
pre-loading information from the (relatively slow)
main memory and passing it to the processor on
demand.
8. Expansion Bus:
An expansion bus is an input/output pathway from
the CPU to peripheral devices and it is typically
made up of a series of slots on the motherboard.
Expansion boards (cards) plug into the bus.
Expansion buses enhance the PCs capabilities by
allowing users to add missing features in their
computers by slotting adapter cards into expansion
slots.
2. Power connectors:
Every PC power supply has special connectors that
attach to the motherboard, giving power to the
system processor, memory, and all slotted add-on
boards (ISA, PCI, AGP). Attaching these connectors
improperly can have a devastating effect on your PC,
including burning up both your power supply and
motherboard. The following sections detail the
motherboard power connectors used by various
power supplies.
DIAGRAM:
Year/ Sem: SE/ IV Academic Year : 2020-21
EXPERIMENT NO.2
TRUTH TABLES:
OUTPUT / RESULT:
EXPERIMENT NO.3
TRUTH TABLES:
Year/ Sem: SE/ IV Academic Year : 2020-21
OUTPUT/RESULT:
EXPERIMENT NO.4
CIRCUIT DIAGRAMS:
MUX:
Year/ Sem: SE/ IV Academic Year : 2020-21
DEMUX:
OUTPUT/RESULT:
Year/ Sem: SE/ IV Academic Year : 2020-21
EXPERIMENT NO.5
ALGORITHM:
Addition:
Step 1 : Start the microprocessor
Step 2 : Initialize the carry as ‘Zero’
Step 3 : Load the first 8 bit data into the accumulator
Step 4 : Copy the contents of accumulator into the register
‘B’
Step 5 : Load the second 8 bit data into the accumulator.
Step 6 : Add the 2 - 8 bit data and check for carry.
Step 7 : Jump on if no carry
Step 8 : Increment carry if there is
Step 9 : Store the added request in accumulator
Step 10 : More the carry value to accumulator
Step 11 : Store the carry value in accumulator
Step 12 : Stop the program execution.
Subtraction:
Step 1 : Start the microprocessor
Year/ Sem: SE/ IV Academic Year : 2020-21
FLOWCHART:
Year/ Sem: SE/ IV Academic Year : 2020-21
PROGRAM:
OUTPUT/RESULT:
EXPERIMENT NO.6
ALGORITHM:
Multiplication:
Step 1 : Start the microprocessor
Step 2 : Get the 1st 8 bit numbers
Step 3 : Move the 1st 8it number to register ‘B’
Step 4 : Get the 2nd 8 bit number
Step 5 : Move the 2nd 8 bit number to register ‘C’
Step 6 : Initialize the accumulator as zero
Step 7 : Initialize the carry as zero
Step 8 : Add both register ‘B’ value as accumulator
Step 9 : Jump on if no carry
Step 10 : Increment carry by 1 if there is
Step 11 : Decrement the 2nd value and repeat from step 8,
till the 2nd value becomes zero.
Step 12 : Store the multiplied value in accumulator
Step 13 : Move the carry value to accumulator
Step 14 : Store the carry value in accumulator
Year/ Sem: SE/ IV Academic Year : 2020-21
Division:
Step 1 : Start the microprocessor
Step 2 : Initialize the Quotient as zero
Step 3 : Load the 1st 8 bit data
Step 4 : Copy the contents of accumulator into register ‘B’
Step 5 : Load the 2nd 8 bit data
Step 6 : Compare both the values
Step 7 : Jump if divisor is greater than dividend
Step 8 : Subtract the dividend value by divisor value
Step 9 : Increment Quotient
Step 10 : Jump to step 7, till the dividend becomes zero
Step 11 : Store the result (Quotient) value in accumulator
Step 12 : Move the remainder value to accumulator
Step 13 : Store the result in accumulator
Step 14 : Stop the program execution
FLOWCHART:
Multiplication:
Year/ Sem: SE/ IV Academic Year : 2020-21
Division:
PROGRAM:
OUTPUT/RESULT:
EXPERIMENT NO.7
ALGORITHM:
Step 1: Load the number from memory
Step 2: AND 01H with Acc content
Step 3: If Z = 0, it is Even
Step 4: Load 01H to indicate it is Odd
Step 5: Jump to store
Step 6: Load FFH to indicate it is Even
Step 7: Store the result into memory
Step 8: Terminate the program
FLOWCHART:
Year/ Sem: SE/ IV Academic Year : 2020-21
PROGRAM:
OUTPUT/RESULT:
EXPERIMENT NO.8
ALGORITHM:
Step 1: Get the size of array
Step 2: Point to actual array
Step 3: Load the first number into B
Step 4: Decrease C
Step 5: Point to next location
Step 6: Get the next number from memory to Acc
Step 7: Compare Acc and B
Step 8: if B > A, then skip (for largest). If B <= A, then
skip (for smallest)
Step 9: If CY is 0 (for largest). If CY is 1 (for smallest),
update B
Step 9: Decrease C
Step 10: When count is not 0, go to LOOP
Step 11: Point to destination address
Step 12: Store the maximum number(largest). minimum
number (smallest)
Year/ Sem: SE/ IV Academic Year : 2020-21
FLOWCHART:
PROGRAM:
OUTPUT/RESULT:
EXPERIMENT NO.9
ALGORITHM:
Step 1: Load data from offset 500 to register CL (for
count).
Step 2: Travel from starting memory location to last and
compare two numbers if first number is greater than second
number then swap them. For descending, first number is
smaller than the second
Step 3: First pass fixes the position for last number.
Step 4: Decrease the count by 1.
Step 5: Again, travel from starting memory location to
(last-1, by help of count) and compare two numbers if first
number is greater than second number then swap them. For
descending, first number must be smaller then the second
one.
Step 6: Second pass fix the position for last two numbers.
Step 7: Repeat.
Step 8: Terminate the program.
Year/ Sem: SE/ IV Academic Year : 2020-21
FLOWCHART:
PROGRAM:
OUTPUT/RESULT:
EXPERIMENT NO.10
ALGORITHM:
Step 1: Create a string
Step 2: Traverse to the end of the string
Step 3: Get the address of the end of the string, DI
Step 4: Load the starting address of the string, SI
Step 5: Compare the value stored at the address
Step 6: Increment the pointer, SI
Step 7: Decrements the pointer, DI
Step 8: Compare again the value stored at SI and DI
Step 9: Repeat the steps until SI<=DI
Step 10: If all the characters match print string is
palindrome else print not palindrome
Step 11: Terminate the program.
FLOWCHART:
Year/ Sem: SE/ IV Academic Year : 2020-21
PROGRAM:
OUTPUT/RESULT:
EXPERIMENT NO.11
ALGORITHM:
Step 1: Move the value stored at offset 00H into CX(this
will act as the counter), and decrement it by 2 (because we
need to explicitly load the first 2 elements of the sequence)
Step 2: Move 00H into AL
Step 3: Move 500 into SI
Step 4: Move AL into [SI]
Step 5: Increment both AL and SI by 1, and store AL’s
value in [SI] (with this, we have loaded the first 2 elements
of the sequence into the memory)
Step 6: Move [SI-1]th value into AL
Step 7: Move [SI]th value into AH0
Step 8: Move 00H into BH
Step 9: Add BH and AH (result stored in BH)
Step 10: Add BH again with AL
Step 11: Increment SI by 1
Step 12: Store BH into [SI]
Step 13: Loop back to Step 6 till counter becomes 0
Year/ Sem: SE/ IV Academic Year : 2020-21
FLOWCHART:
PROGRAM:
OUTPUT/RESULT:
EXPERIMENT NO.12
THEORY:
DIAGRAM:
Year/ Sem: SE/ IV Academic Year : 2020-21