ECE-216 E

Microprocessors And Interfacing

Unit-1:THE 8085 PROCESSOR : Introduction to microprocessor, 8085 microprocessor : Architecture, instruction set, interrupt structure, and assembly language programming.

MEMORY INTERFACING: Semiconductor memory and its types- Static and dynamic RAM, ROM, EPROM, EEROM and NOVRAM- Interfacing memory- Interfacing SRAM, DRAM, EPROM etc. Timing of RAM and ROM signals.

Unit-2 : THE 8086 MICROPROCESSOR ARCHITECTURE : Architecture, block diagram of 8086, details of sub-blocks such as EU, BIU; memory segmentation and physical address computations, program relocation, addressing modes, instruction formats, pin diagram and description of various signals.

INSTRUCTION SET OF 8086 : Instruction execution timing, assembler instruction format, data transfer instructions, arithmetic instructions, branch instructions, looping instructions, NOP and HLT instructions, flag manipulation instructions, logical instructions, shift and rotate instructions, directives and operators, programming examples.

Unit-3 : INTERFACING DEVICE : The 8255 PPI chip: Architecture, control words, modes and examples.Interfacing D/A and A/D converters

Unit-4: DMA : Introduction to DMA process, 8237 DMA controller,

INTERRUPT AND TIMER : 8259 Programmable interrupt controller, Programmable interval timer chips.

Text Books : • Microprocessor Architecture, Programming & Applications with 8085 : Ramesh S Gaonkar; Wiley Eastern Ltd. Computer Architecture & Organization

Sessional: 50 Marks 3 1 - Unit-1: General System Architecture: Store program control concept. stack. MFLOPS. micro architecture. main memory. main memory and secondary memory. indirect. Processor level parallelism (Multiprocessor systems overview). direct. CISC. . segments. Instruction level parallelism (pipelining. Unit-4: Introduction to Parallelism: Goals of parallelism (Exploitation of concurrency. indexed. throughput enhancement). Memory parameters: access/ cycle time. hybrid). MIPS. secondary memory units & I/O. Allocation & replacement polices. addressing modes: register. ISA. Data Transfer. Main memory (Semiconductor RAM & ROM organization. Memory hierarchy in practice: Cache. Unit-3: Memory Hierarchy & I/O Techniques: The need for a memory hierarchy (Locality of reference principle. Instruction set formats (fixed. microinstruction sequencing. MIMD). memory/ register) detailed data path of a typical register based CPU. implementation of control unit. Fetch-Decode-Execute cycle (typically 3 to 5 stage). Enhancing performance with pipelining. structured organization. register. virtual memory. simulation using MASM Unit-2: Basic non pipelined CPU Architecture: CPU Architecture types (accumulator. Amdahl’s law. memory expansion. and their comparison). operating systems. Flynn’s classification of computers (SISD. Instruction Set Architecture: Instruction set based classification of processors (RISC. Operations in the instruction set. Arithmetic and Logical. immediate. Multilevel viewpoint of a machine: digital logic. pages & file organization. Language of the machine: 8086 . CPU. Machine Control Flow. Micro programmed control unit.L T P CAO Exam : 100 Marks Total: 150 Marks Duration of Exam: 3 Hrs. Performance metrics. cost per bit). MISD. super scaling –basic features). high level language. Static & dynamic memory types). Cache memory (Associative & direct mapped cache organizations. caches. Hardwired control design method. variable.

timing and control. computer register. Kauffmann. I/O reference. 2nd Ed. Patterson and John L. UNIT 1 FUNDAMENTALS OF DIGITAL TECHNIQUES: . register reference. by J DIGITAL ELECTRONICS L T P 3 1 Theory : 100 Marks Sessional : 50 Marks Total : 150 Marks Duration of Exam: 3 Hrs. Instruction Formats. micro-instruction formats. • Computer Architecture and Organization. microprogram sequencer.. 3rd Edi. Morgan 1997. Types of interrupts. Control memory. Hennessy. instruction cycle. computer instructions. Programmed I/O. memory reference. Basics of Logic Design. accumulator logic.Computer Organization [80x86]: Instruction codes. Text Books: • Computer Organization and Design. address sequencing. Stack Organization. by David A. DMA & Interrupts. type of instructions. Memory Hierarchy.

shift registers. Decoders. SEQUENTIAL CIRCUITS: Flip Flops: S-R. TTL. Binary codes: BCD. A/D converters: Quantization. Karnaugh map and Quine Mcluskey methods of simplification. UNIT 3 DIGITAL LOGIC FAMILIES: Switching mode operation of p-n junction. Adders / Subtracters. . PLA. MOS. ECL. Introduction to FPGA and CPLDs. sequence generators. parallel -comparator.EX-OR. DCTL. Asynchronous and Synchronous Ring counters and Johnson Counter. Tristate logic. weighted resistor and R -2 R ladder D/A Converters. D. Gray codes. PAL. and CMOS logic families. DTL. Design of Synchronous and Asynchronous sequential circuits. PROGRAMMABLE LOGIC DEVICES: ROM. logic gates: AND. Review of Number systems. master-slave. Decoders / Drivers for display devices. NAND. Interfacing of CMOS and TTL families. COMBINATIONAL DESIGN USING GATES: Design using gates.J-K. EX-NOR. NOR. specifications for D/A converters. HTL. Encoders. Bipolar logic families: RTL. bipolar and MOS-devices. Excess-3. counting type. Dual-slope ADC. UNIT 4 A/D AND D/A CONVERTERS: Sample and hold circuit. edge triggered. successive approximation. Counters. OR. Boolean algebra. BCD arithmetic Circuits. specifications of ADCs.Digital signal. UNIT 2 COMBINATIONAL DESIGN USING MST DEVICES Multiplexers and Demultiplexers and their use as logic elements. T. NOT.

enumerations. Characteristics of a good programming language. Declarations . variable & constants. Booleans & characters.type checking & type conversions . data types. Numeric data types. Specification & implementation of elementary data types. Unit-1: Introduction: A brief history.Programming Languages L T P 3 1 Sessional: 50 Marks Exam: 100 Marks Total: 150 Marks Duration of Exam: 3 Hrs. Programming language translators compiler & interpreters . . Elementary data types – data objects. Assignment & initialization.

attribute grammar dynamic semantic. Exception & exception handlers. over loaded subprograms. sequence control within statement.programmer and system controlled storage management & phases . logical.vector & arrays.Syntax & Semantics : Introduction. Static storage management . co routines. 199 .sequence control within expressions. encapsulation & information hiding . Union. Shared data: dynamic & static scope. Text Book: • Programming languages Design & implementation by T.variable & fixed size elements. Subprograms . Comparison of C & C++ programming languages. general problem of describing syntax. Parameter & parameter transmission schemes.W. sets. sequence control. Stack based storage management. specification & implementation of structured data types. synchronization through semaphores. Subprograms and Programmer Defined Data Types: Evolution of data type concept abstraction. Unit-4: Storage Management: Major run time elements requiring storage . monitors & message passing Data Control: Names & referencing environment. non-procedural .structured. files. Unit-2: Structured data objects : Structured data objects & data types . Programming Languages: Introduction to procedural.type definitions. formal method of describing syntax. Unit–3: Sequence Control: Implicit & explicit sequence control . variable size data structures . functional and object oriented programming language. Subprogram sequence control: simple call return. block structure. recursive subprograms. Heap storage management . records Character strings. static & dynamic scope. Declaration & type checking of data structure .Pratt. Local data & local referencing environment. Concurrency – subprogram level concurrency. generic subprograms. . abstract data types. pointer & programmer defined data objects.

Other Modifiers. Header Files and Namespaces. Function overloading. description. Polymorphism: Overloading. Object as Member of Classes. Structure Definitions. C++ Standard Library. Fundamentals of Operator Overloading. Dynamic Memory Allocation with New and Delete. Controlling Access Function And Utility Functions. Object Oriented Analysis & Object Modeling techniques. protected. Pre-processors Directives.Class Pointers. Object Oriented Concepts : Introduction to Objects and Object Oriented Programming. library files. Separating Interface from Implementation. package). Operator Functions as Class Members vs. Friend Function and Friend Classes. Access Modifiers: Controlling access to a class. Overloading. Abstract Classes. Implicit Derived –Class Object To Base.. Protected and Private Inheritance. Casting BaseClass Pointers to Derived. Using Destructors. Concept of objects. Class’s Behaviors. as Friend Functions. object classes. or variable (public. Restrictions On Operators Overloading. associations.Object Oriented Programming Using C++ L T P 3 1 Sessional: 50 Marks Exam: 100 Marks Total: 150 Marks Duration of Exam: 3 Hrs. Accessing Members of Structures. Classes and Data Abstraction: Introduction. Class Scope and Accessing Class Members. Basics of a Typical C++ Environment. Classes : Const(Constant) Object And Const Member Functions. Public. Encapsulation (Information Hiding). Initializing Class Objects: Constructors. Proxy Classes. Illustrative Simple C++ Programs. Container Classes And Integrators. Reusability.Class Object . Inheritance: Base Classes And Derived Classes. Static Class Members. Inheritance: Introduction. method. >> Overloading Unary Operators. Unit-2: Operator Overloading: Introduction. Using Constructors and Destructors in derived Classes. Overriding Methods. Inheritance. Using This Pointer. Overriding Base –Class Members in a Derived Class. Unit–1: Introduction to C++. Using Default Arguments With Constructors. Using Member Functions. basic of object modeling. Overloading Binary Operators. behaviors. private. <<. Protected Members.

Catching an Exception. Stream Input. Throwing an Exception. Templates and Friends. Reading Data Sequentially from a Random Access File. Basics of C++ Exception Handling: Try Throw. Class Templates and Non-Type Parameters. Unit–3: Virtual Functions and Polymorphism: Introduction to Virtual Functions. Unformatted I/O (with read and write). Destructors and Exception Handling. Files and I/O Streams: Files and Streams. Updating Sequential Access Files. Dynamic Binding. Templates and Inheritance. Stream Format States. 1998.III . Writing Data Randomly To a Random Access File. Exception specifications. Text Books: • C++ How to Program by H M Deitel and P J Deitel. Overloading Template Functions. Reading Data From A Sequential Access File. Exceptions and Inheritance. Constructors. Creating A Random Access File.Conversion. Prentice Hall MATH-201 E MATHEMATICS . Polymorphism. Random Access Files. Stream Input/Output Classes and Objects. Composition Vs. Stack Unwinding. Catch. Creating a Sequential Access File. Class Template. Stream Output. New Classes And Dynamic Binding. Polymorphism. Stream Manipulators. Templates and Static Members. Re-throwing an Exception. Abstract Base Classes And Concrete Classes. Processing Unexpected Exceptions. Virtual Destructors. Stream Error States. Unit-4: Templates & Exception Handling: Function Templates. Introduction. Inheritance.

Harmonic functions. Polar form of the Cauchy-Riemann equations. Exponential function. Conformal transformation. Hyperbolic and Logarithmic functions. Discrete & Continuous probability distributions. Poisson and normal distributions. Relation between Fourier and Laplace transforms. Application to boundary value problems. Necessary and sufficient conditions for a function to be analytic.L T P 3 1 - Theory : 100 Marks Sessional : 50 Total : 150 Marks Duration of Exam : 3 Hrs. UNIT-II Functions of a Complex Variables : Functions of a complex variable. Probability generating function. Simplex Method. Differentiability and analyticity. Perseval’s identity. Magnification & rotation. Fourier cosine and sine transforms. inversion & reflection. Odd & even functions. limit and continuity of a function. Moment generating function. Fourier expansion of functions having points of discontinuity. UNIT-IV Linear Programming : Linear programming problems formulation. UNIT-III Probability Distributions : Probability. Application to flow problems. Trigonometric. Half-range series. Fourier Transforms : Fourier integrals. Baye’s theorem. change of interval.S. Mathematics : B. Grewal . Cauchy-Riemann equations. Properties of Fourier transforms. Dual-Simplex Method. Fourier transforms. Properties and applications of Binomial. Bilinear). Marks UNIT – I Fourier Series : Euler’s Formulae. Convolution theorem. Fourier transforms of the derivatives of a function. Solution of Linear Programming Problem using Graphical method. Conditions for Fourier expansions. Standard transformations (Translation. Text Book Higher Engg.

Mathematics : E. Kreyzi .Advanced Engg.