MIME-Version: 1.0 Content-Location: file:///C:/5F19DE30/COMP2600.htm Content-Transfer-Encoding: quoted-printable Content-Type: text/html; charset="us-ascii" Department of Computer Science

Te= nnessee State University

COLLEGE<= /b> OF ENG= INEERING, TECHNOLOGY, & COMPUTER SCIENCE

COURSE DESCRIPTION

COMP 2600 = Assembly Language

 

A.      =         CATA= LOG COURSE DESCRIPTION<= span style=3D'font-size:11.0pt;mso-bidi-font-size:12.0pt;font-family:Arial'>

    =         Introduction to machine structure and machine language, subroutine linkage control, and basic I/O operations

 

B.  &= nbsp;    COURSE OBJECTIVES

   = ;         To introduce students to:

1.          &nbs= p;    Computer Main Hardware Units.

2.          &nbs= p;    Storage methods of data in the computer memories<= o:p>

3.          &nbs= p;    Assembly language.

4.          &nbs= p;    Memory addressing method in low level programs.

5.          &nbs= p;    Simple programming in assembly language.

 

C.<= span style=3D'mso-tab-count:1'>       CO= MPETENCY LEVEL

        &= nbsp;   At the end of semester students who pass THE COURSE SUCCESSFULLY will

1.       Know some basic principles of computer architectu= re.

2.       Know some basic Boolean logic and how it applies = to programming and computer hardware.

3.       Know how a high level language compiler, such as = C++, translates statements from their language into assembly language and native machine code.

4.       Know how high level languages implement arithmetic expressions, loops, and logical structures

 

D.<= span style=3D'mso-tab-count:1'>       PR= EREQUISITE

COMP= 2400 (Computer Organization)=


G.      DETAILED COURSE OUT= LINE

        &= nbsp;  

Topics

Course Introduction

Data representation,  Memory storage of various data t= ypes

Working More Examples

Boolean Operations

Boolean Operations

IA-32 Processor Architecture<= /p>

Architecture cont. Memory Management

Basic Elements of Assembly Language

Assembling, linking, and running programs, defi= ning data

Data Transfer Instructions

Adding and subtractin= g

Multiplication and Division Instructions

NO Classes = 211; Fall Break

Data-Related Operators and Directives

Indexed Addressing, Indirect Addressing

Jump and LOOP Instructions

Boolean and Comparison Instructions

Conditional Jumps and loops

Conditional Structures, Flowcharting=

Application (Finite State Machines)

Shift and Rotate Instructions

Shift and Rotate Applications

NO Classes

Structures=

Macros