EC Syllabus Kerala University (2003 Scheme)
EC Syllabus Kerala University (2003 Scheme)
EC Syllabus Kerala University (2003 Scheme)
References
1. Spalding and Cole, “Engineering Thermodynamics”
2. Gill, Smith and Zuirys, “Fundamentals of IC Engines”
3. Roy and Choudhary, “Elements of Mechanical Engineering”
4. Amstead, Ostwald and Begeman, “Manufacturing processes”
5. Benjamin, “Basic Mechanical Engineer
Note: The question paper will consist of two parts. Part I is to be compulsory for 40 marks. This may contain 20
questions of 2 marks each or 10 questions of 4 marks each. Part II is to cover 3 modules. There can be 3 questions
from each module (10 marks each) out of which 2 are to be answered. Or there will be 2 questions from each
module (20 marks each) out of which one is to be answered.
A. Carpentry : Study of tools and joints- planning, chiseling, marking and sawing practice. Joints – cross and tee
joints- dove tail joint, mortise and tenon joint
B. Fitting : Study of tools – practice in chipping, filing, cutting, drilling, tapping and dieing- male and female
joints-stepped joints
C. Smithy : Study of tools – forging of square prism, hexagonal bolt, T bolt and eye bolt.
D. Foundry : Study of tools, preparation of sand, moulding practice, casting demonstration.
E. Sheet metal work : Study of tools, selection of different gauge GI sheets for jobs – types of joints, riveted and
soldered joints- preparing tube joints, frustums, trays and containers.
F. Plumbing : Study of tools – details of pluming work in domestic and industrial applications, study of pipe joints,
cutting, threading and laying of pipes with different fittings. Use of special tools in plumbing work.
Note : For the university examination the student shall be examined in any one of the first five trades (A-E) by
drawing lots.
UNIVERSITY OF KERALA
ELECTRONICS AND COMMUNICATION ENGINEERING
SCHEME OF STUDIES AND EXAMINATION AND SYLLABUS FOR B. TECH DEGREE
III to VIII SEMESTERS 2003 SCHEME
Semester III
Course Name of subject Weekly load, Max Exam Exam Credits
No hours sessional Dur max
L T D/P marks Hrs marks
03.301 Engg.MathematicsII 3 1 0 50 3 100 4
03.302 Electrical Technology (TA) 2 1 0 50 3 100 3
03.303 Solid State Devices (TA) 3 1 0 50 3 100 4
03.304 Electronic Circuits I (TA) 3 1 0 50 3 100 4
03.305 Network Analysis (TA) 3 1 0 50 3 100 4
03.306 Programming In C++ (TA) 2 0 2 50 3 100 4
03.307 Electronic workshop (TA) 0 0 3 50 3 100 3
03.308 Electronic Devices Lab (TA) 0 0 3 50 3 100 3
TOTAL 16 5 8 400 800 29
Semester IV
Course Name of subject Weekly load, Max Exam Exam Credits
No hours sessional Dur max
L T D/P marks Hrs marks
03.401 Engineering Mathematics III 3 1 0 50 3 100 4
03.402 Humanities (TA) 3 0 0 50 3 100 3
03.403 Analog Communication (TA) 2 1 0 50 3 100 3
03.404 Signals And Systems (TA) 3 1 0 50 3 100 4
03.405 Electronic Circuits II (TA) 3 1 0 50 3 100 4
03.406 Digital Electronics (TA) 2 1 0 50 3 100 3
03.407 Programming & Simulation Lab(TA) 0 0 4 50 3 100 4
03.408 Electronic Circuits Lab (TA) 0 0 4 50 3 100 4
TOTAL 16 5 8 400 800 29
Semester V
Course Name of subject Weekly load, Max Exam Exam Credits
No hours sessional Dur max
L T D/P marks Hrs marks
03.501 Engineering Mathematics IV 3 1 0 50 3 100 4
03.502 Industrial Management (TA) 2 1 0 50 3 100 3
03.503 Linear Integrated circuits (TA) 2 1 0 50 3 100 3
03.504 Computer Organization (TA) 2 1 0 50 3 100 3
03.505 Applied Electromagnetic Theory (T) 3 1 0 50 3 100 4
03.506 Elective I (TA) 3 1 0 50 3 100 4
03.507 Digital Electronics Lab (TA) 0 0 4 50 3 100 4
03.508 Integrated Circuits Lab (TA) 0 0 4 50 3 100 4
TOTAL 15 6 8 400 800 29
Semester VI
Course Name of subject Weekly load, Max Exam Exam Credits
No hours sessional Dur max
L T D/P marks Hrs marks
03.601 Digital Signal Processing (TA) 3 1 0 50 3 100 4
03.602 Microprocessors (TA) 3 1 0 50 3 100 4
03.603 Industrial Electronics &Instrumentation 2 1 0 50 3 100 3
(T)
03.604 Digital Communication (T) 2 1 0 50 3 100 3
03.605 Antenna & Wave Propagation (T) 2 1 0 50 3 100 3
03.606 Elective II (TA) 3 1 0 50 3 100 4
03.607 Communication Engg.Lab (T) 0 0 4 50 3 100 4
03.608 Mini Project (TA) 0 0 4 50 3 100 4
TOTAL 15 6 8 400 800 29
Semester VII
Course Name of subject Weekly load, Max Exam Exam Credits
No hours sessional Dur max
L T D/P marks Hrs marks
03.701 VLSI Circuit Design (TA) 3 1 0 50 3 100 4
03.702 Information Theory & Coding (T) 3 1 0 50 3 100 4
03.703 Microwave Engg. (T) 2 1 0 50 3 100 3
03.704 Control Systems (T) 2 1 0 50 3 100 3
03.705 Elective-III (TA) 3 1 0 50 3 100 4
03.706 Elective IV (TA) 3 1 0 50 3 100 4
03.707 Micro Processor .Lab (TA) 0 0 2 50 3 100 2
03.708 Digital Signal Processing Lab (T) 0 0 2 50 3 100 2
03.709 Project Design & Seminar(TA) 0 0 3 75+25 - - 3
TOTAL 16 6 7 500 800 29
Semester VIII
Course Name of subject Weekly load, Max Exam Exam Credits
No hours sessional Dur max
L T D/P marks Hrs marks
03.801 Optical Communication (T) 2 1 0 50 3 100 3
03.802 Radar & Television Engineering (T) 2 1 0 50 3 100 3
03.803 Computer Communication (T) 2 1 0 50 3 100 3
03.804 Satellite & Mobile Communication (T) 2 1 0 50 3 100 3
03.805 Elective V (TA) 3 1 0 50 3 100 4
03.806 Elective VI (TA) 3 1 0 50 3 100 4
03.807 Microwave & Optical Communication 0 0 4 50 3 100 4
Lab (T)
03.808 Project & Viva- voce (TA) 0 0 5 150 3 100 5
TOTAL 14 6 9 500 800 29
MATLAB:
Introduction to Matlab, study of matlab functions. Writing simple programs using matlab, for handling arrays, files,
plotting of functions etc.
Writing M files for
Creation of analog & discrete signals, plotting of signals etc.
Filtering of analog & digital signals using convolution
Generation of noise signals (Gaussian, random, Poisson etc)
Simulation using Simulink.
Simulation study
(A)Design of analog low pass, bandpass, high pass and band elimination filters
using Butterworth, Chebyshev etc.
(B) Anti-aliasing filters
(C) Bode plot
(D) Steady state and Transient analysis
(E) Z Transforms
(F) Fourier Analysis
Note:
For University examination, the following guidelines should be followed regarding award of marks:
(a) Programming and design -40%
(b) Result & Performance -35%
(c) Viva voce -25%
Practical examination to be conducted covering entire syllabus given above.
03.506 (2) (Elective –I) DATA STRUCTURES USING C++ (TA) 3-1-0
Module I (Quantitative Approach)
Abstract data types and data structures, classes and objects, complexity of algorithms, worst case, average case and
amortised complexity. Lists, Stacks. Queues- implementation. Garbage collection, hash tables and hashing
techniques, collision resolution techniques.
Module II (Quantitative Approach)
Trees- Binary trees, Traversal, operations. Binary search trees, decision trees, AVL Trees, Splay trees, redblack
trees, B Trees, Tries- operation on tries.
Module III (Quantitative Approach)
Graphs- Representation and operations. Shortest path algorithms, Minimum spanning tree algorithm, Depth first
search, Breadth first search, Binary decision diagrams.
Text Book :
1. AV Aho and J D Ullman et al: Data Structures and Algorithms, Addison Wesley
References:
1. Robert Kruse et al: Data Structures and Program Design in C, PHI
2. D samenta: Classic Data structures, PHI
3. Richard F Gilburg, B A Frouzan: Data Structure: A Pseudocode Approach with C++, Thomson Learning.
Question Paper
The question paper shall consist of two parts. Part I is to cover the entire syllabus, and carries 40 marks. This shall
contain 10 compulsory questions of 4 marks each. Part II is to cover 3 modules, and carries 60 marks. There shall be
3 questions from each module (10 marks each) out of which 2 are to be answered.
03.506 (3) (Elective –I) PROBABILITY & RANDOM PROCESSES (TA) 3-1-0
Module I (Quantitative Approach)
Introduction – Basic concepts – Random experiments & events – Elementary Theorems – Probabilistic Modeling –
Histograms – Transformations – Moments – Reliability and failure rates – Transforms of PDF – Tail inequalities - A
vector Random variable – The sets – Joint CDF & Joint PDF Conditional Probabilities & Densities – Independence.
Transformations – Expectation, Covariance & correlation coefficient – Joint distributions.
Module II (Quantitative Approach)
Introduction to estimation – MMSE estimation – Linear prediction – Dow Jones example – Maximum likelihood
estimation. Sequences of Random variables – IID Random variables – Sums & Random sums – weak law and strong
law of large numbers – central limit theorem – convergence of sequences – Borel Cantilli Lemmas.
Random processes – Joint CDF and PDF – Expectation, Auto covariance & Correlation functions – continuity,
Derivatives and Integrals – Ergodicity - Kaurnen Loeve Expansions – Poisson & Gaussian Random Processes.
Module III (Quantitative Approach)
Processing of Random Processes – PSD function – Response of linear systems – optimal linear estimation – Kalman
filter – periodo grams – Markov chains – Discrete & continuous time Markov chains. Spectral estimation –
Ergodicity – Extrapolation – Mean Square estimation – Prediction – Filtering and Prediction. Queueing theory.
Text Books :
1. Yannis Viniotis : Probability & Random Processes for Electrical Engineers, McGraw Hill.
2. Papoulis : Probability, Random Variables & Stochastic Processes, 3rd Edn., McGraw Hill.
Reference :
1. Jorge I Aunon, V. Chandrasekar: Introduction to Probability & Random Processes , McGraw Hill
Question Paper
The question paper shall consist of two parts. Part I is to cover the entire syllabus, and carries 40 marks. This shall
contain 10 compulsory questions of 4 marks each. Part II is to cover 3 modules, and carries 60 marks. There shall be
3 questions from each module (10 marks each) out of which 2 are to be answered.
03.506 (4) (Elective –I) JAVA & INTERNET PROGRAMMING (TA) 3-1-0
Module I
Introduction to Internet TCP/IP overview. Web server. Web page development using basic HTML scripts.
Introduction to Java programming – object oriented programming concepts, java virtual machine, security, java
compilers, jdk, java applets, java and internet, web browsers, java interaction with web. Declaration of constants,
variables and data types, Java programs for arithmetic operations. Java programs of control and conditional
statements, arrays, strings etc. & Java threads.
Module II
Applet programming concepts – Building applet code – Creating executable code for applets. Adding applet to
HTML file. GUI programming with Java AWT class. Graphics programming with Java – simple programs for
drawing lines, rectangles, ellipse, polygon etc., simple program for creating animation with java. Event handling
(handling of mouse events) simple programs. Program for displaying image files.
Module III
Managing input output files using java I/O class. Simple programs for reading and writing files. Exception
Handling.
Socket programming with java. TCP and UDP client server programming. Introduction to JDBC.
References:
1. E. Balaguruswami : Programming with Java A Primer.
2. Bruce Eckel : Thinking in Java , Pearson Education.
3. Dietel and Dietel : Java How to Program.
Question Paper
The question paper shall consist of two parts. Part I is to cover the entire syllabus, and carries 40 marks. This shall
contain 10 compulsory questions of 4 marks each. Part II is to cover 3 modules, and carries 60 marks. There shall be
3 questions from each module (10 marks each) out of which 2 are to be answered.
03.606 (2) (ELECTIVE – II ) LINEAR ALGEBRA & APPLICATIONS IN ELECTRONICS (TA) 3-1-0
Module I (Quantitative Approach)
Linear Models in Engineering – Systems of linear equations, Row reduction and Echelon forms, Vector equations,
Matrix equation, Solution sets of linear systems, Linear independence, Linear transformation, Models in
Engineering, Matrix operations, Invertible Matrices, Partitioned Matrices, Matrix factorizations, Solutions of linear
systems, Leontief Input-Output Model, Application to Computer Graphics.
Module II (Quantitative Approach)
Determinants – Properties – Grame’s Rule, Volume and linear transformations. Vector spaces & Sub spaces, Null &
Column spaces, Linear transformations, Bases, Co-ordinate systems, dimension, Rank, Change of basis, Application
to difference equations and Markov Chains. Eigen values & Eigen Vectors – Characteristic equation,
diagonalization, linear transformations, complex Eigen values, discrete dynamical systems, Application to
differential equations.
Module III (Quantitative Approach)
Orthogonality & Least – squares – Inner product, length and orthogonality, Orthogonal sets & projections, Gram –
Schmidt Process, Least – Squares Problems, Inner product spaces, Applications of Inner Product spaces. Symmetric
Matrices & quadratic forms – Constrained optimization, singular value decomposition, Application to Image
processing. Numerical Techniques-Gaussian elimination, LU decomposition, Practical difficulties in solving
equations, Iterative methods for solving linear equations.
Text Books :
1) David C Lay : Linear Algebra and its Applications, 2nd Edn., Peason Education Asia
2) Gareth Williams : Linear Algebra with Applications, 4th Edn., Jones & Bartlett, Mathematics.
3) Arch W.Naylor R.Sell: Linear operator Theory, Vol 40 , Springer
Question Paper
The question paper shall consist of two parts. Part I is to cover the entire syllabus, and carries 40 marks. This shall
contain 10 compulsory questions of 4 marks each. Part II is to cover 3 modules, and carries 60 marks. There shall be
3 questions from each module (10 marks each) out of which 2 are to be answered.
03.606 (7) (ELECTIVE – II ) ARTIFICIAL INTELLIGENCE & EXPERT SYSTEMS (TA) 3-1-0
Module I
Definition - history and applications - propositional calculus - predicate calculus - inference rules - structures and
strategies for state space search - heuristic search algorithms - heuristics in games - complexity issues - control and
implementation of state space search - production systems - planning - the blackboard architecture Introduction to
understanding natural language - introduction to automated reasoning - introduction to machine learning
Module II
Knowledge intensive problem solving - expert system technology - rule-based expert systems - model based
reasoning - case based reasoning - knowledge representation problem - reasoning with uncertain or incomplete
information - statistical approach - non-monotonic systems - fuzzy sets - knowledge representation - languages -
issues - network representation - conceptual graphs - structured representation
Module III
Languages and programming techniques for AI - overview of LISP - search - higher order functions and procedural
abstractions - search strategies - pattern matching - recursion - interpreters - logic programming in LISP - streams
and delayed evaluation - expert system shell in LISP - network representations and inheritance - CLOS
Text book:
Luger G.F. & Stubblefield W.A., Artificial Intelligence, Addison Wesley
References:
1. Nilsson N.J., Artificial Intelligence - A New Synthesis, Harcourt Asia Pte. Ltd
2. Elain Rich & Kevin Knight, Artificial Intelligence, Tata McGraw Hill
3. Tanimotto S.L., The Elements of Artificial Intelligence, Computer Science Press
4. Winston P.H., LISP, Addison Wesley
Question Paper
The question paper shall consist of two parts. Part I is to cover the entire syllabus, and carries 40 marks. This shall
contain 10 compulsory questions of 4 marks each. Part II is to cover 3 modules, and carries 60 marks. There shall be
3 questions from each module (10 marks each) out of which 2 are to be answered.
03.705 (5) (ELECTIVE III ) ANTENNA THEORY AND DESIGN (T) 3-1-0
Module I
Cylindrical antenna – Current distributions, Input impedance, Patterns. Thin cylindrical antenna, Antennas of other
shapes – Current distribution on long cylindrical antennas. The moment method in Electrostatics. The moment
method and its application to a wire antenna.
Continuous aperture distribution, Fourier transform relations between the far – field pattern and the aperture
distribution. Spatial frequency response and pattern smoothing. Aperture synthesis – Multi aperture arrays, Grating
lobes.
Module II
Lens antenna – Fermat’s principle. Artificial dielectric lens antennas. E-plane and H-plane metal-plate Lens
antennas , Electrically Small antennas, Physically Small antennas – Antenna siting, Ground plane antennas, Sleeve
antennas, Turnstile antennas, Super turnstile antennas, Omnidirectional antennas – circularly polarized antennas,
Antenna design considerations for satellite communication – Receiving, Transmitting and Bandwidth consideration.
ILS antennas.
Module III
Antennas for terrestrial mobile communication. Antennas for ground penetrating radar, UWB antennas for digital
applications.
Terahertz antennas – Pyramidal horn cavity with dipole. Planar antenna structure in dielectric lenses, Smart
antennas.
Microstrip antennas – Rectangular patch – Models directivity, Circular patch – Design, Conductance and directivity,
Quality factor, Band width, efficiency, Input impedance, Coupling.
References:
1. John D. Krans, Ronald J. Marhefka : Antennas for all Applications , 3/e, TMH.
2. Constantive A. Balanis: Antenna Theory – Analysis and Design, 2/e, John Wiley & Sons.
Question Paper
The question paper shall consist of two parts. Part I is to cover the entire syllabus, and carries 40 marks. This shall
contain 10 compulsory questions of 4 marks each. Part II is to cover 3 modules, and carries 60 marks. There shall be
3 questions from each module (10 marks each) out of which 2 are to be answered.
03.706 (4) (ELECTIVE IV) DISCRETE EVENT SYSTEM SIMULATION (TA) 3-1-0
Module I (Quantitative Approach)
Introduction to simulation. Motivational examples. Discrete Event Models. Modeling of Uncertainty. Random
Number generation and Random Variate Generation. Test of Random number sequences and goodness of fit tests.
Simulation languages. GPSS, SIMSCRIPT.
Module II (Quantitative Approach)
Statistical models. Continuous and discrete distributions. Poison process. Empirical distributions. Queuing models –
characteristics – long-run performance- steady state behavior infinite population markov models. Steady state
behavior of finite population models.
Module III (Quantitative Approach)
Selection of Input Probability distribution. Multivariate and time-series input models. Verification of Simulation
models. Validation of Simulation models. Variance reduction and output analysis.
Text Book:
1) Banks J, Carson J S and Nelson B – Discrete-Event System Simulation, 3/e, Pearson
Reference:
1) Law AW, Kelton WD, Simulation Modeling and Analysis, McGraw Hill, 1991
2) Raj Jain, The Art of Computer System Performance Analysis, Wiley and Sons, 1991
3) Trivedi KS, Probability and statistics with reliability, Queuing and Computer Science Applications,
PHI, 1990
Question Paper
The question paper shall consist of two parts. Part I is to cover the entire syllabus, and carries 40 marks. This shall
contain 10 compulsory questions of 4 marks each. Part II is to cover 3 modules, and carries 60 marks. There shall be
3 questions from each module (10 marks each) out of which 2 are to be answered.
Assignment for Sessional marks shall be problems based on MATLAB / any other software packages covering the
syllabus above.
03.706 (5) (Elective IV) MICROWAVE SOLID STATE DEVICES AND CIRCUITS ( T) 3-1-0
Module I
Microwave Network Analysis – Equivalent voltages and currents, Impedance, Impedance and Admittance matrices,
Scattering matrix, The transmission matrix. Signal flow graphs. Impedance matching and tuning – Matching with
lumped elements, Single stub tuning, Double stub tuning. Quarter wave transformer, Theory of small reflections:
Bipolar transistors – biasing, FET – biasing, MESFET – Structure, Operation, High Electron mobility transistors
(HEMT) – Physical structure, Operation, Characteristics.
Module II
Gunn – effect diodes – Gunn effect, Ridley – Watkins-Hilsum theory, Modes of operation, Limited space – Charge
accumulation (LSA) mode of gunn diode, InP diodes. Microwave generation and amplification.
The Read diode, IMPATT diodes – Structure, Operation, Power output and efficiency, TRAPATT diodes –
Operation, Power output and efficiency BARITTdiodes – structure, Operation. Parametric devices, Parametric
amplifiers. Monolithic Microwave Integrated Circuit – Materials, Growth, MOSFET fabrication.
Module III
Microwave filters – Periodic structures – Analysis of infinite periodic structures and terminated periodic structures,
Filter design by image parameter method – Constant k, m-derived and composite. Filter design by insertion loss
method. Filter transformation and implementation.
Microwave amplifiers and oscillators – Amplifiers – Gain and stability, Single stage transistor amplifier design.
Oscillator design – One port negative resistance oscillators, transistor oscillators.
References:
1. David M. Pozar : Microwave Engineering , 2nd edn., John Wiley & Sons (Asia) Pvt. Ltd.
2. Sitesh Kumar Roy, Monojit Mitra : Microwave Semiconductor Devices, PHI - 2003.
3. Liao: Microwave Devices and Circuits, 3rd edn, Pearson Education, 2003.
4. Robert E Collin: Foundations of Microwave Engineering, Mc Graw Hill.
Question Paper
The question paper shall consist of two parts. Part I is to cover the entire syllabus, and carries 40 marks. This shall
contain 10 compulsory questions of 4 marks each. Part II is to cover 3 modules, and carries 60 marks. There shall be
3 questions from each module (10 marks each) out of which 2 are to be answered.
03.805 (2) (Elective V) INTEGRATED OPTICS & PHOTONIC SYSTEMS (TA) 3-1-0
Module I
Integrated photonics: history and characteristics, integrated photonics technology, basic
Integrated photonics components, IP devices, electromagnetic waves, Maxwell’s equations, wave equation in
dielectric media, monochromatic waves in dielectric media, polarization of EM waves, light propagation in
absorbing media, EM waves at planar dielectric interface, boundary conditions at the interface, reflection and
transmission coefficients, total internal reflection.
Module II
Integrated optic waveguides, optical waveguides, modes in planar waveguides, wave equation in planar waveguides,
guided modes in step index planar waveguide and channel waveguides, Marcatili’s method and effective index
method, graded index planar waveguides, multilayer and ray approximations, reconstruction of index profiles,
inverse WKB method, modal coupling, coupled mode equations, co directional and contra directional coupling,
diffraction gratings in waveguides, coupling coefficients in modulation index and relief diffraction gratings
Module III
Light propagation in wave guides: beam propagation method, paraxial propagation method, fresnel equation, Fast
Fourier transform method based on finite differences, boundary conditions, transparent boundary conditions, spatial
frequencies filtering, modal description based on BPM, modal field calculation using BPM
Textbooks:
1. G. Lifante - Integrated Photonics: Fundamentals - John Wiley & Sons 2003
2. P Battacharya - Semiconductor Optoelectronic Devices – 2/e– Pearson Education - 2001
Question Paper
The question paper shall consist of two parts. Part I is to cover the entire syllabus, and carries 40 marks. This shall
contain 10 compulsory questions of 4 marks each. Part II is to cover 3 modules, and carries 60 marks. There shall be
3 questions from each module (10 marks each) out of which 2 are to be answered.
03. 805 (3) (Elective V) SOFTWARE ARCHITECTURE & SYSTEMS (TA) 3-1-0
Module I (Quantitative Approach)
Software process and the role of modeling and analysis, Software architecture, and software design.
Software Modeling and Analysis : analysis modeling and best practices, Traditional best practice diagrams such as
DFDs and ERDs, UML disgrams and UML analysis modeling, Analysis case studies, Analysis tools, Analysis
patterns.
Module II (Quantitative Approach)
Software Architecture : Architectural styles, Architectural patterns, Analysis of architectures, Formal descriptions of
software architectures. Architectural description lnguages and tools, Scalability and interoperability issues, Web
application architectures, Case studies.
Module III (Quantitative Approach)
Software Design: Design best practices, Design patterns, Extreme programming, Design case studies, Component
technology, Object oriented frame works, distributed object request brokers, case studies.
Reference:
1. Booch G, Rumbaugh, J. Jacobson : The Unified modelling Language User Guide, Addison-Wesley,
1999
2. Gamma, E. Helm, R. Johnson, R. Vissides : Design Patterns, Elements of Reusable Object-Oriented Software
Architecture, Volume I: A System of Patterns. John Wiley & Sons, 1996
3. Shaw M, Garlan D: Software Architecture : Perspectives on an Emerging Discipline, Prentice Hall, 1996
4. Len Bass et al: Software Architecture in Practice – Addison Wesly, 1998.
Question Paper
The question paper shall consist of two parts. Part I is to cover the entire syllabus, and carries 40 marks. This shall
contain 10 compulsory questions of 4 marks each. Part II is to cover 3 modules, and carries 60 marks. There shall be
3 questions from each module (10 marks each) out of which 2 are to be answered.
03.806 (3) (Elective VI) MICROCONTROLLER BASED SYSTEM DESIGN (TA) 3-1-0
Module I (Quantitative Approach)
History of microcomputers, Application of embedded controllers, Over view of 8051, 8096, 6811, 6812. 6812
architecture, 68HC12 Hardware system, Modes of operation, Hardware pin assignments, 68HC12 sub system.
Module II (Quantitative Approach)
Programming model, Assembly language, instruction execution cycle, Instruction set, Addessing modes, Advanced
assembly programming. Interrupts, General interrupts, concept of ISR, Writing an ISR for 68HC812, Advanced
interrupt topics.
Module III (Quantitative Approach)
Clock Module – Background theory, clock module, Clock drivider chain, 68HC12 Timer Module, Components of
the timer module. The Real Time Interrupt (RTI). Programming Input Capture, Output Compare and the Pulse
Accumulator Features of the TIM. 68HC12 memory system, 68HC12 ADC (ATD) , 68HC12 Communication
System.
References:
1. Daniel J Pack & Steven F Barett – 68HC12 Microcontroller
2. Han – Way Huang – MC 68HC12 An Introduction : Software & Hardware
3. Jonathan W Valvano – Introduction to Embedded Microcomputer System : Motorola 6811/6812
Simulator.
Question Paper
The question paper shall consist of two parts. Part I is to cover the entire syllabus, and carries 40 marks. This shall
contain 10 compulsory questions of 4 marks each. Part II is to cover 3 modules, and carries 60 marks. There shall be
3 questions from each module (10 marks each) out of which 2 are to be answered.