Practical No.

Aim: Write an ALP to program to use GDTR, LDTR and IDTR in Real Mode.

Theory:

Global Descriptor Table Register

This register holds the 32-bit base address and 16-bit segment limit for the global descriptor table
(GDT). When a reference is made to data in memory, a segment selector is used to find a segment
descriptor in the GDT or LDT. A segment descriptor contains the base address for a segment.

Local Descriptor Table Register

This register holds the 32-bit base address, 16-bit segment limit, and 16-bit segment selector for the
local descriptor table (LDT). The segment which contains the LDT has a segment descriptor in the GDT.
There is no segment descriptor for the GDT. When a reference is made to data in memory, a segment
selector is used to find a segment descriptor in the GDT or
LDT. A segment descriptor contains the base address for a segment

Interrupt Descriptor Table Register

This register holds the 32-bit base address and 16-bit segment limit for the interrupt descriptor table
(IDT).When an interrupt occurs, the interrupt vector is used as an index to get a gate descriptor from this
table. The gate descriptor contains a far pointer used to start up the interrupt handler.

PREC, Loni Page 22

Algorithm:
1. start
2. display the message using sys_write call
3. Read CR0
4. Checking PE bit, if 1=Protected Mode
5. load number of digits to display
6. rotate number left by four bits
7. convert the number in ASCII
8. display the number from buffer
9. Exit using sys_exit call

Conclusion:-
Thus we have studied ALP program to use GDTR, LDTR and IDTR in Real Mode.

PREC, Loni Page 2

 Algorithm:
1. Start
2. Initialize data section.
20. Get the first number.
21. Get the second number.
22. Initialize result = 0.
23. Initialize the CL counter to 0 and edx to 08 (as 8bit numbers).
24. Rotate right through carry first number in AL by 1 bit.
25. If carry is generated (carry=1) then go to next step(9) and if carry is not generated go to step 12.
26. Make contents of BH=00.
27. Shift left second number in BX by CL count register.
28. Add contents of BX to the results.
29. Increment CLand decrement EDX.
30. Display the result using display procedure.
31. Stop.

Conclusion:
Thus we have studied X86/64 ALP to perform multiplication of two 8-bit hexadecimal
numbers. Use addand shift method. Accept input from the user.

PREC, Loni Page 3

 Practical No.

Aim: Write X 86 Menus driven Assembly Language Program (ALP) to implement OS (DOS) commands TYPE,
COPY and DELETE using file operations. User is supposed to provide command line arguments in all cases.
8.1 Software/Hardware Required:

Core 2 duo/i3/i5/i7 - 64bit processor Operating System – ubuntu/Fedora 64bit OS Assembler: NASM
Editor Used – gedit

8.2 THEORY:
Basics of Disk Operating System
An operating system (OS) is the software that controls a computer's hardware and peripheral devices and
allows other programs to function. Early computers did not have disk drives but were hard-wired to carry
out specific computations. Later, computers were able to store instructions loaded into the computer's
memory using punch cards and later magnetic tapes. Computer memory space was limited and when the
instructions to control a computer were moved onto a disk drive, such as a floppy disk or internal hard
drive, it was considered cutting-edge technology. Today, any modern operating system would be
considered a disk operating system. Convert command into Computer actions
The structure of DOS
- The BIOS (Basic Input/Output System)
- The DOS kernel
- The command processor (shell)

MS-DOS Kernel
The kernel provides a collection of hardware-independent services called system functions.
- File Management
- Memory Management
- Device Input and Output
- Process control
@ The kernel is a proprietary program and provides a collection of hardware-independent services called
system functions.
@ These functions include the following:
◦ File and record management
◦ Memory management
◦ Character-device input/output
◦ spawning of other programs
◦ Access to the real-time clock

The Command Processor

@ The command processor, or shell, is the user's interface to the operating system. It is responsible for
parsing (describing) and carrying out user commands, including the loading and execution of other
programs from a disk or other mass-storage device.
@ The default shell that is provided with MS-DOS is found in a file called COMMAND.COM. It is a special
class of program running under the control of MS-DOS.
PREC, Loni Page 4
User Commands
@ The user commands that are accepted by COMMAND.COM fall into three categories:
@ Internal commands

(Carried out by code embedded in COMMAND.COM)

@ External commands

(names of programs stored on disk file)

@ Batch files

(batch or group of DOS commands) Some of the Important DOS Commands:

1. TYPE COMMAND
Type: Internal
Syntax: TYPE [d:][path]filename Purpose: Displays the contents of a file.
Discussion when you use the TYPE command, the file is displayed with limited on-screen formatting. Tabs
are expanded and generally displayed as eight spaces wide. If you display files that contain special (non-
text) characters, these characters may have unpredictable effects on your dispaly. Wild card characters (?
and *) cannot be used with this command in either the filename or the extension.

2. COPY COMMAND
Type: Internal
Syntax:
COPY [/Y|-Y] [/A][/B] [d:][path]filename [/A][/B] [d:][path][filename] [/V]
or
COPY [/Y|-Y] [/A][/B] [d:][path]filename+[d:][path]filename[...] [d:][path][filename] [/V] Purpose: Copies or
appends files. Files can be copied with the same name or with a new name.
Discussion: COPY is usually used to copy one or more files from one location to another. However, COPY
can also be used to create new files. By copying from the keyboard console (COPY CON:) to the screen, files
can be created and then saved to disk. The first filename you enter is referred to as the source file. The
second filename you enter is referred to as the target file. If errors are encountered during the copying
process, the COPY program will display error messages using these names. Unlike the BACKUP command,
copied files are stored in the same format they are found in. The copied files can be used just as you would
use the original (whether the copied file is a data file or a program). COPY can also be used to transfer data
between any of the system devices. Files may also be combined during the copy process.

3. DELETE COMMAND
Type: Internal
Syntax: DEL (ERASE) [d:][path]filename [/P]
Purpose: Deletes (erases) files from disk.

PREC, Loni Page 5

 Discussion You can use wildcard characters (? and *) to delete groups of files. If you don`t specify a
pathname, the program assumes the files to be deleted are on the drive and directory you are currently
using. The /P option prompts you to enter a Y or N for each file selected for deletion.

Conclusion:
Thus we have studied X 86 Menus driven Assembly Language Program (ALP) to implement
OS (DOS) commands TYPE, COPY and DELETE using file operations. User is supposed to provide
command linearguments in all cases.

PREC, Loni Page 6

 Practical No.
Aim: Write X86 ALP to find, a) Number of Blank spaces b) Number of lines c) Occurrence of a particular
character. Accept the data from the text file. The text file has to be accessed during Program_1 execution
and write FAR PROCEDURES in Program_2 for the rest of the processing. Use of PUBLIC and EXTERN
directives is mandatory.
Software/Hardware Required:
Core 2 duo/i3/i5/i7 - 64bit processor
Operating System – ubuntu/Fedora 64bit OS
Assembler: NASM
Editor Used – gedit

Theory:
Near Procedure: Far Procedure Explanation:
Open given text file. Read the content of file and store it in a buffer. Call far procedure which will calculate
the number of blank spaces, lines and occurrence of a particular character from the buffer.
Assembler Directives Used: (Explain it by your own)
• Extern:
• Global:

Instructions: (Explain instruction used by your own)

Mathematical Model (Draw it by you own)
Flowchart (Draw it by your own)

Input: Text File

Output: Display of-
1. Number of Blank spaces
2. Number of lines
3. Occurrence of a particular character.

Main Algorithm:
A1: Algorithm for program_1
i. Start
ii. Initialize all the sections needed in programming
iii. Display “Enter file name” message using Print macro expansion
iv. Accept file name using Accept macro and store in filename buffer
v. Display “Enter character to search” message with the expansion of Print macro
vi. Read character using Accept macro expansion
vii. Open file using fopen macro
viii. Compare RAX with -1H if equal then display error message “Error in Opening File” with Print macro
expansion else go to step ix ix. Read content of opened file in buffer
x. Store file length in abuf_len
xi. Call far_procedure
xii. Stop

PREC, Loni Page 7

Macros:
Macro 1
1. Name: Print
2. Purpose: to display the messages by replacing the whole code by simple macro declaration
3. I/P: sys_write call Number i.e rax=1, File descriptor (for Standard output rdi=1), Buffer Address in rsi, and
length of Buffer in rdx. Then Call syscall.
Macro 2
1. Name: Accept
2. Purpose: to accept input from the user by replacing the whole code by simple macro declaration
4. I/P: sys_read call Number i.e rax=0, File descriptor (for Standard input rdi=0), Buffer
Address in rsi, and length of Buffer in rdx. Then Call syscall.

Macro 3
1. Name: fopen
2. Purpose: to open a file in given mode
3. I/P: sys_write call Number i.e rax=2, File name in rdi, Mode of file in rsi
(R=0, W=1, RW=2), and file permission in rdx. Then Call syscall.

Macro 4
1. Name: fread
2. Purpose: to read the content of file
3. I/P: sys_read call Number i.e rax=0, File descriptor in rdi , Buffer Address in rsi, and length of Buffer in
rdx. Then Call syscall.

Macro 5
3. Name: fclose
4. Purpose: to close opened file
5. I/P: sys_read call Number i.e rax=3, File handler in rdi. Then Call syscall.

Procedure: 1
1. Name: far procedure
2. Purpose: to count 1. Number of Blank spaces 2. Number of lines 3. Occurrence of a particular character.
3. I/P: Content stored in buffer
4. Algorithm for Procedures
i. Start
ii. Load effective address of buffer in RSI
iii. Load content of abuf_len in RCX
iv. Load content of char in BL
v. Move value of RSI in AL
vi. Compare AL with 20H (ASCII value of space) if not equal then go to step
vii else increment content of scount

PREC, Loni Page 8

 vii. Compare AL with 10H (ASCII value of line) if not equal then go to step viii else increment content of
ncount
viii. Compare AL with BL if not equal then go to step ix else increment content of ccount
ix. Increment RSI
x. Repeat from step vi if RCX is not equal to zero
xi. Display “Number of space” message with the expansion of Print macro.
xii. Move content of scount in RBX
xiii. Call display8num procedure
xiv. Display “Number of lines” message with the expansion of Print macro.
xv. Move content of ncount in RBX
xvi. Call display8num procedure
xvii. Display “Number of Occurrence of Character” message with the expansion of Print macro.
xviii. Move content of ccount in RBX
xix. Call display8num procedure xx. Ret
xxi. Stop
Procedure: 2
1. Name: display8num
2. Purpose: Convert 2 digit hex number into 2 Ascii character to display Positive and negative number count
on Standard output (stdout).
3. I/P: bl=pcnt/ncnt
4. Algorithm for Procedures
a. Move RSI with effective address of dispbuff.
b. Initialize rcx by 2
c. Rotate the contents of bl to the left side by 4 bits.
d. Move the contents of bl into al
e. And the contents of al with 0fH
f. Compare al with 09h
i. If al is below or equal then add 30H in al
ii. Else add 37H in al
g. Move the content of al into memory pointed by RSI
h. Increment RSI
i. Repeat from step c to h until rcx is not equal to 0

Conclusions:
Thus we have studied X86 ALP to find, a) Number of Blank spaces b) Number of lines c)
Occurrence of a particular character. Accept the data from the text file. The text file has to be
accessed during Program_1 execution and write FAR PROCEDURES in Program_2 for the rest of
the processing. Use of PUBLIC and EXTERN directives is mandatory.

PREC, Loni Page 9

 Practical No
Aim:
Write X86 program to sort the list of integers in ascending/descending order. Read the input from
the text file and write the sorted data back to the same text file using bubble sort

7.1 Software/Hardware Required:

Core 2 duo/i3/i5/i7 - 64bit processor Operating System – ubuntu/Fedora 64bit OS Assembler:
NASM
Editor Used – gedit

Theory:

Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps
through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the
wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list
is sorted. The algorithm, which is a comparison sort, is named for the way smaller or larger elements
"bubble" to the top of the list. Although the algorithm is simple, it is too slow and impractical for most
problems even when compared to insertion sort.[2] It can be practical if the input is usually in sorted order
but may occasionally have some out- of-order elements nearly in position.

Algorithm Start
i. Start
ii. Initialize all the sections needed in programming
iii. Display “Enter file name” message using Print macro expansion iv. Accept file name using
Accept macro and store in filename buffer
vi. Read character using Accept macro expansion
vii. Open file using fopen macro
viii. Compare RAX with -1H if equal then display error message “Error in
Opening File” with Print macro expansion else go to step ix
ix. Read content of opened file in buffer
x. Store file length in abuf_len
xi. Call Buff_array
xii. Stop

Algorithm 02
1) Initialize pointer ESI to file buffer
2) Initialize pointer EDI to array buffer
3) Initialize counter to some register
4) Read the Element From file one by one and store it into buffer
5) Increment ESI by 002 so point to next element
6) Increment edi by 01 to buffer
7) Check whether count=0 yes stop otherwise repeat the steps go to step 01
8) Stop

PREC, Loni Page 10

 Algorithm 03
1) Set counter to abuff_len minus 01
2) Set counter for no of iterations
3) Set counter for no of Comparisons
4) Set ESI to First Element And EDI to Next Element
5) Compare EDI and EDI if ESI element less than EDI Element then Skip jump to step 08
6) Otherwise use third variable swap.
7) Decrement comparison count by one
8) Increment ESI and EDI by 01
9) Compare if comparison count is zero
10) Decrement iteration count by 01
11) Go to Step no 04
12) Stop.

Conclusion:
Thus we have studied X86 program to sort the list of integers in ascending/descending
order. Readthe input from the text file and write the sorted data back to the same text file using
bubble sort

PREC, Loni Page 11