Professional Documents
Culture Documents
Course Code
Course Title
L-T-P
(Hrs/Week)
Course
Credits
11UMAC300
4-0-0
11UCSC300
4-0-0
11UCSC301
4-0-0
11UCSC302
Data Structures
4-0-0
11UCSC303
Computer Organization
4-0-0
11UCSC304
0-0-4
11UCSL305
0-0-4
11UCSL306
0-0-4
30
26
L-T-P
(Hrs/Week)
Course
Credits
Total Credits
IV SEMESTER B. E
Course Code
11UMAC400
Engineering Mathematics IV
4-0-0
11UCSC400
Microcontroller
4-0-0
11UCSC401
4-0-0
11UCSC402
4-0-0
11UCSC403
3-0-2
11UCSL404
0-0-4
11UCSL405
Microcontroller Laboratory
0-0-4
29
24
Total Credits
SDMCET: Syllabus
III SEMESTER
11UMAC300
ENGINEERING MATHEMATICS-III
(4-0-0) 4
Course Learning Objectives: At the end of the course the students must be able
to:
CLO1. Apply the concepts of Fourier series and Transforms to the engineering
problems to obtain the solution.
CLO2. Model the engineering problems into partial differential equations and
obtain the solution using various methods.
CLO3. Derive and apply solutions from the knowledge of difference equations
and Z-transforms.
CLO4. Formulate the engineering problems into linear system of equations and
be able to obtain the solutions.
CLO5. Identify the type of the solution for a given engineering problems and
apply the numerical methods to obtained desired solution.
CLO6. At the end of course student will be able to use system of linear equations
in problems related to electrical circuits, where student can determine the
currents and voltages at various locations in resistors circuits.
Course outcomes: At the end the under graduate Engineering program the
graduates to demonstrate
CO1. The ability to derive and apply solutions from knowledge of Mathematics.
CO2. An ability to identify, formulate and solve engineering problems.
CO3. An ability to engage in life long learning.
Course Contents:
1) Fourier Series: Fourier series, evaluation of Fourier co-efficient, waveform
symmetries as related to Fourier co-efficient, convergence in truncated series,
exponential form of the Fourier series, half range Fourier series, practical
harmonic analysis.
8 Hrs.
2) Fourier Transform: Exponential representation of non-periodic signals, existence
of Fourier transforms properties of Fourier Transform: symmetry, scaling,
shifting, convolution theorem and Parsevals identity.
8 Hrs.
3) Partial Differential Equations: Introduction to partial differential equations,
classification, formation of partial differential equations, solution of equation of
the type Pp + Qq = R, solution of partial differential equation by method of
separation of variables.
8 Hrs.
4) Applications of Partial Differential Equations: Modeling vibration of stringwave equation, heat equation, solution of wave, heat equation and solution of
Laplace equation by the method of separation of variables, D Alemberts solution
of wave equation. Applications (electrostatic field problems).
8 Hrs.
II Year B.E. (CSE): 2014 - 15
SDMCET: Syllabus
5) Difference equations and ZTransform: Difference equationsbasic definitions
of z-transform, transform of standard forms, linearity property, damping rule,
shifting rule, initial and final value theorems, Inverse z- transforms (Partial
Fraction method), convolution theorem, applications of z-transforms to
solve
difference equations.
10 Hrs.
6) Matrices and System of Linear Equations: Introduction to system of Linear
equations, rank of matix, consistency of system of linear
equation, Gauss
elimination method, Guass-Seidal method, Eigen values and Eigen
vectors of
matrices, Largest Eigen value and corresponding Eigen vector by power
method, examples related to electrical circuits (Determine the currents and
voltages at various locations in resister circuits).
10 Hrs.
Books:
1. Kreyszig E., Advanced Engineering Mathematics, 8th Edn, John Wiley & sons,
2003.
2. Potter M C, Jack Goldberg and Aboufadel E F, Advanced Engineering
Mathematics, 3rd Edn, Oxford Indian Edition, 2005.
3. Lathi B. P, Modern Digital and Analog Communication System, 2nd Edn, pp. 2963.
4. David C. Lay, Linear Algebra and its applications, 3rd Edn., Pearson Education, 2003.
SDMCET: Syllabus
11UCSC300
(4-0-0) 4
SDMCET: Syllabus
registers, Derivation of Flip-flop input equations.
9 Hrs.
6) Introduction to Sequential circuits: Mealy and Moore models, State machine
notation, Synchronous sequential circuit analysis, Construction of State diagram,
Applications of Op-amps: Schmitt trigger, ADC, DAC, Clippers and Clampers.
12 Hrs.
Additional contents beyond the syllabi:
1. Exposure to simulators for circuit design. POC, D, E
2. Designing simple circuits
Books:
1) Thomas Floyd-Digital Fundamentals, 3rd edition, Universal Book Stall, New
Delhi.
2) Charles.H.Roth.Jr- Fundamentals of Logic Design,4th edition.
3) John. M. Yarbrough-Digital Logic Applications and Design, Thomson/Brooks/
Cole
4) Malvino and Bates- Electronic Principals, 6th ed, TMH.
5) Robert. L. Boylestad, Louis Nashelsky- Electronic Devices and Circuit Theory,
9th ed, PHI, 2006.
SDMCET: Syllabus
11UCSC301
(4-0-0) 4
SDMCET: Syllabus
4) Graphs: properties and types - Finite- Infinite , Connected-disconnected, Sub
graphs, Complements, and complete graph, Isomorphism, walks, paths, circuits,
Euler graph, Hamilton Graph, Chromatic Number of Graph. Planar Graphs,
Bipartite Graphs, Kuratowski Graphs, Dual of a graph. Cut set Cut vertex. Trees,
Spanning trees, Matrix representation of Graph: Incidence matrix and Adjacency
matrix.
18 Hrs.
Additional contents beyond the syllabi:
Making the participants prepare for competitive exams like GATE, CAT.
(POA,B,H)
Books:
1) Ralph P. Grimaldi- Discrete and Combinatorial Mathematics, 5th edition,
PHI/Pearson Education, 2004
2) Kolman, Busby, Ross- Discrete Mathematical Structures, 5th edition, Eastern
Economy Edition 2008.
3) Narasingh Deo Graph Theory, PHI/Eastern Economy Edition.
SDMCET: Syllabus
11UCSC302
Data Structures
(4-0-0) 4
SDMCET: Syllabus
11UCSC303
Computer Organization
(4-0-0) 4
SDMCET: Syllabus
6) Basic Processing Unit: Some Fundamental Concepts, Execution of a Complete
Instruction, Multiple Bus Organization, Hard wired Control, Micro programmed
Control.
7 Hrs.
Additional contents beyond the syllabi:
Simulation of different units of the computer using tools like VHDL. (POA, B, I,D,C)
Books:
1) Carl Hamacher, Zvonko Vranesic, Safwat Zaky Computer Organization, 5th
edition, TMH, 2002.
2) William Stallings Computer Organization & Architecture, 7th edition, PHI, 2006
3) Vincent P. Heuring & Harry F. Jordan Computer Systems Design and
Architecture, 2nd edition, Pearson education, 2004.
10
SDMCET: Syllabus
11UCSC304
(0-0-4) 2
11
SDMCET: Syllabus
12
SDMCET: Syllabus
2. Introducing modern IDEs, Advantages of IDE for writing code in multiple files,
organizing and managing program files. Using enums, macros conditional compilers
and hard coding.
3. Writing stubs to perform the Unit Testing, technique performing integrated
testing, usage of files to test programs against the large data. Generating Data using
Spreadsheets. Writing test scripts to generate data for analysis comparing the
performance of the programs. If-else ladder experiment with Excel.
4. Describe strategies that are useful in debugging using UNIXs GDB or MS visual
studios.
5. Using bat or equivalent shell scripts. UNIX commands for programming and vi
beyond labs
6. Writing Technical documents: Using Ms Office, Google Docs, Search Engines,
Emails, wikies,
7. Understanding private library documents meant for developers, referring
programmers manuals.
8. Following skill building, web learning resources ITS , Web-Apps and Codeeuse: LearnStreet, ConceptMaps, MindMups, HeapNote, ShiftEdit,
etc.
www.codeforge.com/
9. Importance of User Interfaces. CUI and GUI : DDA, Case studies..
www.irctc.co.in, www.jabong.com, www.myntra.com, www.denimcraft.com
10. Completion and Contest: ICPC, Google Code jam,
11. Know the World, Society, Constitution, processes: www.incometaxindia.gov.in,
ww.ahara.kar.nic.in, www.portal.uidai.gov.in, www. ceokarnataka.kar.nic.in, Banking
rules, banks services and RBI, www.passportindia.gov.in
13
SDMCET: Syllabus
11UCSL305
(0-0-4) 2
14
SDMCET: Syllabus
11UCSL306
(0-0-4) 2
15
SDMCET: Syllabus
IV SEMESTER
11UMAC400
ENGINEERING MATHEMATICS-IV
(4-0-0)4
Course Learning Objectives: At the end of the course the students must be able
to:
CLO1. Find the series solutions for the ordinary differential equations.
CLO2. Identify the type of the solution for a given engineering problem and apply
the numerical methods to obtained desired solution.
CLO3. Identify different transformations and use the concepts of linear
transformations to find the solutions of linear system of equations and
orthogonalization of the matrices.
CLO4. Calculate probabilities and discrete distributions for simple combinatorial
processes.
CLO5. Use the concepts of Markov chains in modeling the problems and finding
the solutions.
Course outcomes: At the end the under graduate Engineering program the
graduates to demonstrate
CO1. The ability to derive and apply solutions from knowledge of Mathematics.
CO2. An ability to identify, formulate and solve engineering problems
CO3. An ability to engage in life long learning
Course Contents:
1) Numerical Methods: Approximations and error, significant figures, Accuracy and
precision, Round off and Truncation Errors, Roots of equations using Bisection
Method, Regula- Falsi
Method
and Newton- Raphson Method, Finite
differences, Forward, Backward and central
differences Operators. Newton
Gregory forward and backward
interpolation formulae.
Strilings and
Bessels interpolation formulae. Lagranges
interpolation. Newtons general
interpolation formula for divided differences. Applications (design of electrical
circuits).
10 Hrs.
rd
2) Numerical integration: Trapezoidal rule, Simpsons 1/3 rule, and Weddles rule
Numerical solution of first order ODE -Taylors series method. Modified Eulers
method. Runge Kutta fourth
order method. Applications (RMS current by
numerical integration).
6 Hrs.
3) Series Solution of Bessels Differential Equation: Introduction to series
solution, Series solution of Bessels differential equation, ecurrence formulae,
generating functions, orthogonal property, Bessels integral formula.
8 Hrs.
4) Linear Transformation: Linear Transformation, similarity transformation,
Diagonalization, Quadratic forms, Orthogonalization, QR-factorization.
6 Hrs.
5) Statistics and probability: Curve fitting by the method of least squares: y =
a+bx, y = a+bx+cx2, y = abx, y= aebx, y= axb. Correlation and regression.
Probability addition rule, conditional
probability, multiplication rule, Bayes
II Year B.E. (CSE): 2014 - 15
16
SDMCET: Syllabus
rule. Discrete and continuous random variables- PDF-CDF- Binomial, Poisson,
exponential and Normal distribution.
12 Hrs.
6) Markov Chains: Joint probability distribution of two random variables
Introduction: Markov chains introduction, probability vectors, Stochastic
Matrices, Fixed points and Regular stochastic matrices, Markov chains, higher
transition probabilities, stationary distribution of regular Markov chains and
absorbing states.
10 Hrs.
Books:
1. Jain, Iyengar and Jain, Numerical Methods for Engg. & Scientist, PHI, 3rd Edn.,
2005.
2. Gupta S C and Kapoor V K, Fundamentals of Mathematical Statistics, 9th Edn,
Sultan Chand & Sons, New Delhi, 2002.
3. Chapra S C and Canale R P, Numerical methods for Engineers, 5th Edn, TATA
McGraw-Hill, 2007.
4. David C. Lay, Linear Algebra and its applications, 3rd Edn., Pearson Education, 2003.
17
SDMCET: Syllabus
11UCSC400
Microcontroller
(4-0-0) 4
18
SDMCET: Syllabus
Prerequisites:
1. 11UCSC301: Analog and Digital Electronics
2. 11UCSC100/200 : Problem Solving and Programming in C.
Course Contents:
1) Microprocessor Architecture, timing diagram of 8086
3 Hrs.
2) 8051 Microcontroller Architecture Introduction, 8051 Microcontroller
hardware:The 8051 Oscillator and Clock, Programme Counter and Data pointer,
A & B CPU Registers, Flags and Programme Status Word(PSW), Internal
memory ,internal RAM, The Stack and the stack pointer, Special function
registers, Internal ROM, Input/Output pins, ports & circuits : Port 0, Port 1, Port 2,
Port 3, External Memory : connecting external memory, Counter & Timer : Timer
Counter interrupts, timing, timer mode of operation, counting, Serial Data
input/output :Serial data interrupts, data transmission, data reception, serial data
transmission mode. Interrupts: Timer flag interrupt, serial port interrupt, external
interrupts,reset, interrupt control, interrupt priority, interrupt destinations,
softwaregenerated interrupts.
10 Hrs.
3) Addressing modes and Logical, Arithmetic operations Addressing modes:
Immediate addressing more, register addressing mode, direct addressing
mode,indirect addressing mode. External Data Moves, Code Memory Read-only
Data moves, Push and Pop Opcodes, Data exchanges, Example programs.
Logical Operations: Introduction, Byte-level logical operations, Bit-level logical
operations: Internal RAM Bit Addresses, SFR Bit Addresses, Bit-level Boolean
Operations, Rotate & SWAP operations, Example programs, Arithmetic
operations: Introduction, Flags: Instructions Affecting Flags, Incrementing &
Decrementing, Unsigned Addition.
9 Hrs.
4) Jump & Call instructions, Interrupts & Returns Introduction, The jump & Call
program Range : Relative Range, Short Absolute Range, Long Absolute Range,
Jumps : Bit Jumps, Byte jumps, Unconditional Jumps, Calls and Subroutines :
Subroutines, Calls and the Stack, Calls and Returns, Interrupts and
Returns,More Detail on Interrupts : the Interrupt Enable (IE) Special Function
Register,the Enable all interrupts (EA) Bit, Individual Interrupt Enable Bits, The
interrupt priority (IP) Special Function Register, Ties, Interrupts and Interrupt
Handler Subroutines, The Fine Print, In conclusion, Example programs.
8 Hrs.
5) 8051 Programming in C Data types and time delay in 8051 C, I/O programming
in 8051 C, Logic operations in 8051 C, Data conversion programs in 8051
C,Accessing code ROM space in 8051 C, Data serialization using 8051 C.
7 Hrs.
6) 8051 Timer programming Programming 8051 timers, Programming timers 0
and 1 in 8051 C.
5 Hrs.
7) Interrupts Programming 8051 interrupts, Programming timer interrupts,
Programming external hardware interrupts, Programming the serial
communication interrupt, interrupt priority in the 8051/52, Interrupt programming
in C.
7 Hrs.
8) 8051 Interfacing & Applications Interfacing: LED, 7 segment display,
LCD,DAC, ADC, Stepper & DC motor.
4 Hrs.
II Year B.E. (CSE): 2014 - 15
19
SDMCET: Syllabus
20
SDMCET: Syllabus
11UCSC401
(4-0-0) 4
Course Learning Objectives: At the end of the course the student should
CLO1. Determine a languages location in the Chomsky hierarchy (regular sets,
context-free, context-sensitive, and recursively enumerable languages).
CLO2. Convert among equivalently powerful notations for a language, including
among DFAs, NFAs, and regular expressions, and between PDAs and
CFGs.
CLO3. Understand paring processes.
CLO4. Understand the Turing thesis and its significance.
Course Outcomes: At the end of this course the student should be able to
CO1. Understand the fundamentals concepts of automata and formal languages.
(POA)
CO2. Employ finite state machine to solve problems in computing. (POA, C, E)
CO3. Construct regular expression, grammars and automata for different levels of
formal languages. (POA, C,E)
CO4. Analyze the power and limitations of regular languages and context free
languages. (POA, B, C, E)
CO5. Implement the lex and yacc system tools for the regular expression and
context free grammars. (POA, C,E)
CO6. Understand the concept of turing machine and relationship between turing
machine and modern computer. (POA, C,E)
Prerequisites:
11UCSC100/200 : Problem Solving and Programming in C
Course Contents:
1) Introduction to Finite Automata: Structural Representation. The central
concepts of Automata theory Alphabet, Strings & Languages. Finite Automata:
Introduction, Deterministic Finite Automata (DFA), Non-Deterministic Finite
Automata (NFA) , Equivalence of NFA and DFA, Applications of Finite automata,
FA with Epsilon transitions.
8 Hrs.
2) Regular Expressions and languages: Regular Expressions, Finite Automata
and Regular Expressions, Applications of Regular Expressions. Properties of
Regular Languages (RL): Proving Languages not to be Regular. Closure
properties of Regular Languages, Decision properties of Regular Languages,
Equivalence and Minimization of Automata.
10 Hrs.
3) Context-Free Grammars (CFG) and Languages (CFL): Context-Free
Grammars, Parse Trees, Applications of Context-Free Grammars, Ambiguity in
Grammars and Languages.
8 Hrs.
4) System Applications & Tools: Lex and Yacc: The Simplest Lex Program,
Recognizing Words with Lex, Grammars, Running Lex and Yacc, Lex vs. Hand
Written Lexers Using Lex: Regular Expressions, A Word count program, parsing
a Command Line , A C Source Code Analyzer Using Yacc: Grammars, A Yacc
II Year B.E. (CSE): 2014 - 15
21
SDMCET: Syllabus
Parser, the Lexer, Arithmetic Expressions and Ambiguity Parser: The Role of the
Parser.
9 Hrs.
5) Pushdown Automata (PDA): Definition of Pushdown Automata, The languages
of a PDA, Equivalence of PDA's and CFG'S, Deterministic Pushdown Automata.
Properties of Context
Free Languages: Normal forms for Context Free
Grammar, Pumping lemma for Context Free Languages, Closure properties of
Context Free languages.
9 Hrs.
6) Introduction to Turing Machines (TM): Problems that computer cannot solve,
Turing Machine, Programming Techniques for Turing Machine, Extensions to
Basic Turing Machine, Restricted Turing Machines, Turing Machines and
Computers.
8 Hrs.
Additional contents beyond the syllabi:
The case study of present syntactic and semantic tools. (PO B,D, E, C)
Books:
1) J.P. Hopcroft, Rajeev Motwanl, J.D. Ullman Introduction to Automata Theory,
Languages and Computation, II edition, Pearson Education, 2001.
2) Alfred V Aho, Ravi Sethi , Jeffrey D. Ullman Compilers Principles, Techniques
and Tools.
3) John R Levine, Tony Mason & Doug Brown UNIX Programming Tools Lex &
Yacc.
4) Peter Linz An Introduction to Formal Languages and Automata, II edition,
Narosa Publishing House, 1997.
5) John Martin Introduction to languages and theory of computation, Tata McGraw
Hili, 2003.
22
SDMCET: Syllabus
11UCSC402
(4-0-0) 4
B,D,E)
Books:
1) Herbert Schildt Java The Complete Reference 7th edition, Tata McGraw Hill,
2007.
2) Java 60 Minutes a Day by ichard aposa
3) Grady Booch et al Object-Oriented Analysis and Design with Applications, 3rd
edition, Pearson Education, 2007.
II Year B.E. (CSE): 2014 - 15
23
SDMCET: Syllabus
11UCSC403
(4-0-0) 4
24
SDMCET: Syllabus
4) Basic Traversal and search techniques: Depth First search, Breadth First
Search, connected components, labeling of components, Path.
5 Hrs.
5) Greedy Strategy: Introduction and General Method, Knapsack problem, Job
sequencing with dead lines, min cost spanning tree prims & kruskals , optimal
storage on tapes, single source shortest path. Huffman Tree.
8 Hrs.
6) Dynamic Programming: Introduction and General method, Computing a
binomial coefficient, warshalls algorithm, Floyds algorithm, knapsack problem,
multistage graphs, Traveling sales person(TSP) problem
6 Hrs.
7) Back tracking and Branch and Bound: Introduction General Method for both
strategies Back Tracking: Sum of Sub sets, Knapsack problem, Traveling Sales
person (TSP).
5 Hrs.
8) Limitations of Algorithm Power: Lower bound arguments, decision trees, P,
NP and NP Complete Problems.
4 Hrs.
Additional contents beyond the syllabi:
Exposure to various design patterns used in the algorithmic techniques used in the
real time. (POC, D)
Books:
A. Anany Levitin Introduction to the Design and analysis of algorithms, Pearson
Education 2nd edition 2007
B. Horowitz, Sahani et.al Fundamentals of Computer Algorithms, Galgotia
Publication, 2004.
C. Marks Allen Weiss, Data Structure and Algorithm Analysis, Pearson
Education,3rd Edition, 2009
D. Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest-Introduction to
Algorithms, Second edition, PHI 2003.
25
SDMCET: Syllabus
11UCSL404
(0-0-4) 2
26
SDMCET: Syllabus
Books:
1) Sourav Sahay Object Oriented Programming with C++, Oxford University Press,
2006.
2) Stanley B. Lippman, Josee Lajoie, Barbara E. Moo C++ Primer, 4th edition,
Addison Wesley, 2005.
3) Herbert Schildt The Complete Reference C++, 4th edition, TMH, 2005
4) Mastering C + + by K. R. Venugopal, Rajkumar, T Ravishankar, TATA McGraw
HIll
27
SDMCET: Syllabus
11UCSL405
Microcontroller Laboratory
(0-0-4) 2
28
SDMCET: Syllabus
29