Lehigh University

ECE 33 Introduction to Computer Engineering [4]

Instructor: M. D. Wagh

Current Course Catalog Description

Analysis, design and implementation of small digital circuits. Boolean algebra. Minimization techniques, synchronous sequential circuit design, number systems and arithmetic. Microcomputer architecture and assembly level programming. Prerequisite: Engr 1 or CSE 17.

Textbook

Carroll, Irwin, Nelson, Nagle, Digital Logic Circuit Analysis and Design”, Prentice Hall.

References

Notes on 8085 microprocessor architecture and assembly language

Course Goals

To provide students with a comprehensive background in digital logic design and analysis techniques and Assembly programming.

Prerequisites by Topic

Basics of computers and computing
Familiarity with programming environment
Experience in algorithms, flow-charts and programming

Major Topics Covered in the Course

Coding of data and information in a computer
Boolean algebra
Analysis and design of combinational circuits
Analysis and design of sequential circuits
Computer organization and in particular 8085 µP organization
8085 µP instruction codes and addressing modes
Assembler and assembly programming
Interacting with external word through an operating system

Laboratory projects (specify number of weeks on each)

Four assembly programming assignments; approximately three weeks for each.

Estimate CSAB Category Content

CORE ADVANCED

Data Structures                                                 1
Computer Organization and Architecture              2
Algorithms Software Design                                1
Concepts of Programming Languages                  0

Oral and Written Communications

Every student is required to submit at least __0___ written reports (not including exams, tests, quizzes, or commented programs) of typically _____ pages and to make __0___ oral presentations of typically _____ minutes duration. Include only material that is graded for grammar, spelling, style, and so forth, as well as for technical content, completeness, and accuracy.

Social and Ethical Issues

Theoretical Content

Boolean algebra (1 week); computer architecture, analysis of algorithms (1 week)

Problem Analysis

Analysis of combinational logic using truth tables and algebraic description.
Analysis of sequential logic using state transition tables and diagrams.
Analysis of assembly programs for code efficiency and cime complexity.

Solution Design

Design and minimization of combinational logic using Boolean algebra, K-maps and Q-M technique.
Design of sequential logic from their word description.
Design of algorithms for data manipulation, input/output and computational tasks and their implementation using assembly language.