SDMCET: Syllabus

Computer Science & Engineering

Suggested plan of study
III SEMESTER B. E

Course Code

Course Title

L-T-P
(Hrs/Week)

Course
Credits

11UMAC300

Engineering Mathematics III

4-0-0

11UCSC300

Analog & Digital Electronics

4-0-0

11UCSC301

Discrete Structures in Computer Science

4-0-0

11UCSC302

Data Structures

4-0-0

11UCSC303

Computer Organization

4-0-0

11UCSC304

Industry Oriented Programming Practices

0-0-4

11UCSL305

Analogy and Digital Electronics Laboratory

0-0-4

11UCSL306

Data Structures Laboratory

0-0-4

30

26

L-T-P
(Hrs/Week)

Course
Credits

Total Credits

IV SEMESTER B. E

Course Code

Title of the Course

11UMAC400

Engineering Mathematics IV

4-0-0

11UCSC400

Microcontroller

4-0-0

11UCSC401

Finite Automata and Formal Languages

4-0-0

11UCSC402

Object Oriented Programming

4-0-0

11UCSC403

Analysis and Design of Algorithms

3-0-2

11UCSL404

Object Oriented Programming Laboratory

0-0-4

11UCSL405

Microcontroller Laboratory

0-0-4

29

24

Total Credits

Total credits offered for the Second year: 50

II Year B.E. (CSE): 2014 - 15

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.

II Year B.E. (CSE): 2014 - 15

SDMCET: Syllabus

11UCSC300

Analog and Digital Electronics

(4-0-0) 4

Course Learning Objectives:

CLO1. Design a simple circuit analog and digital using fundamental building
blocks.
CLO2. Appreciate the effect of AND, OR, NOT and EXOR operations on binary
data
CLO3. Understand the design of combinational and sequential ckts and basic
memory element.
CLO4. Understand the design and working of clipping, clamping, 555 Timer ckts,
DAC/ADC ckts.
Course Outcomes: At the end of this course the student should be able to
CO1. Knowledge of basic operation of transistors, timers and their application.
(POA,B,C)
CO2. Knowledge of designing simple analog and digital circuits based on the
given requirements. (POA,B,C,D)
CO3. Knowledge of designing combinational and sequential circuits as per the
given specifications. (POB, C, D, E, G)
CO4. Knowledge of designing basic clipping, clamping, 555, timer ckts,
DAC/ADC ckts (POB, C, and H)
Prerequisites:
11UECC100/200: Basic Electronics
Course Contents:
1) Boolean Algebra: Boolean operations, Logic Expressions, Boolean Rules &
Laws of Boolean Algebra, DeMorgans Theorem, Boolean Expressions for Gate
Networks, Simplification of Boolean Expression.
4 Hrs.
2) Simplification of Boolean Expressions: Minimum forms of switching functions,
2- & 3- variable Karnaugh Map, 4-variable K-maps, Determination of minimum
expression using essential Prime Implicants, Other uses and forms of K-maps,
Quine-McCluskey Method, Determination of Prime Implicant chart, Patricks
Method, Simplification of Incompletely specified functions, Simplification using
MEVs.
10 Hrs.
3) Functions of Combinational Logic: Adders, Parallel Binary Adders, A method
of speeding Addition, Magnitude Comparators, Decoders, Encoders, Code
conversions, Multiplexers, De-multiplexers, Parity Checkers/ Generators.
10 Hrs.
4) Flip-flop: Gate delays & Timing diagrams, SR Flip-flop, Triggered Flip-flop,
Clocked T-Flip-flop, J-K Flip-flop, Clocked J-K Flip-flop, D-Flip-flop, Clocked Flipflops with Clear & Preset inputs, Characteristic equations.
7 Hrs.
5) Counters & Similar Sequential circuits: Design of a Binary counter, Counters
for Other sequences, Counter design using S-R Flip-flop, Counter design using JK Flip- flop, Counters using D Flip-flop, Design of a code-converter, Shift
II Year B.E. (CSE): 2014 - 15

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.

II Year B.E. (CSE): 2014 - 15

SDMCET: Syllabus

11UCSC301

Discrete Structures In Computer Science

(4-0-0) 4

Course Learning Objectives:

CLO1. Explain with examples the basic terminology of math reasoning, functions,
relations.
CLO2. Perform the operations associated with functions, and relations.
CLO3. Relate practical examples to the appropriate function, or relation model,
and interpret the associated operations and terminology in context.
CLO4. Use formal logic proofs and/or informal but rigorous logical reasoning to,
for example, predict the behavior of software or to solve problems such as
puzzles.
CLO5. Describe the importance and limitations of predicate logic.
CLO6. Illustrate by example the basic terminology of graph theory, and some of
the properties and special cases of each.
CLO7. Demonstrate different traversal methods for trees and graphs.
CLO8. Model problems in computer science using graphs and trees.
CLO9. Relate graphs and trees to data structures, algorithms, and counting.
Course Outcomes: At the end of this course the student should be able to
CO1. Illustrate by examples the basic terminology of math reasoning, functions,
relations, and demonstrate knowledge of their associated operations.
(POA,B, E, I)
CO2. Outline basic proofs and disproofs for theorems using the techniques of direct proofs, proof by Counter example, proof by contradiction,
mathematical induction. (POA,B, E, I)
CO3. Demonstrate in practical applications the use of basic counting principles of
permutations, combinations, inclusion/exclusion principle and the
pigeonhole methodology. (POA,B, E, I)
CO4. Demonstrate in practical applications the use of graph and trees.
(POA,B, E, I)
Prerequisites:
Knowledge of mathematical concepts.
Course Contents:
1) Mathematical reasoning; propositions; negation disjunction and conjuction;
implication and equivalence; truth tables; predicates; quantifiers; rules of
Inference; methods of proofs; use in program proving; Proof techniques: direct
proofs; proof by counter example; proof by contraposition; proof by contradiction;
Indirect proof by exhaustion and proof by existence; Disproof techniques by
contradiction and counter example.
15 Hrs.
2) Fundamental Counting: The Rules of Sum and Product, Permutations and
Combinations, The Binomial coefficients, Pigeonhole Principle, Recurrence
relations, Generating Functions, Inclusion-Exclusion.
12 Hrs.
3) Functions and Relations: Functions (surjections, injections, inverses,
composition), Recursive function; relations (reflexivity, symmetry, transitivity,
equivalence relations)
7 Hrs.
II Year B.E. (CSE): 2014 - 15

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.

II Year B.E. (CSE): 2014 - 15

SDMCET: Syllabus

11UCSC302

Data Structures

(4-0-0) 4

Course Learning Objectives:

CLO1. Realization of fundamental data structures like stacks, queues, link list,
trees.
CLO2. Compare and contrast the costs and benefits of dynamic and static data
structure implementations.
CLO3. Selection of the appropriate data structure for modeling a given problem.
Course Outcome: At the end of this course the student should be able to
CO1. Use of stacks, queues, link list, trees etc., in solving the problems
(POA,E)
Prerequisites:
11UCSC100/200 : Problem Solving and Programming in C
Course Contents:
1) Structure, unions and Pointer Revisit: Motivation for using structures. Pointer,
access data from memory through pointer, pointer to structures. Motivation for
dynamic memory requirement. Realizing arrays using pointer and dynamic
memory allocation. Importance of memory management during allocation and
deallocation of memory.
8 Hrs.
2) Lists: Constructing dynamic data structures using self-referential structure (using
the same realized linked Lists), operations on lists. Doubly Linked list. Application
of Lists in sorting.
10 Hrs.
3) Stack: Realization of stack and its operations using static and dynamic
structures. Application of stack in converting an expression from infix to postfix
and evaluating a postfix expression. Heterogeneous stack using Unions. 10 Hrs.
4) Queues: Realization of queues (FIFO, Double-ended queue, Priority queue) and
its operations using static and dynamic data structures.
8Hrs.
5) Trees: Types of trees and their properties, Realization of trees using static and
dynamic data structures. Operations on Binary trees and their application in
searching (BST and AVL Tree), Binary heap as priority queues.
12 Hrs.
6) Hash Table: Realizing effective hash table with proper data stricture and hash
function, its application.
4Hrs.
Books:
1) Aaron M. Tenenbaum, Yedidyah Langsam and Moche J. Augenstein- Data
Structures using C and C ++, , 2006, Pearson Education/ PHI
2) E. Balagurusamy- Programming in ANSI C, edition 4, Tata McGrawHill
3) Behrouz A. Foruzan and Rechard F. Gilberg- Computer Science A Structured
Programming Approach Using C, Second edition, 2003, Thomson.
4) Robert Kruse and Bruce Leung- Data structures and Program Design in C, 2007,
Pearson Education
5) D. Samantha- Classic Data Structures, 2001, Estern Economy edition, PHI
II Year B.E. (CSE): 2014 - 15

SDMCET: Syllabus

11UCSC303

Computer Organization

(4-0-0) 4

Course Learning Objectives:

CLO1. Appreciate the concept of an instruction set architecture, ISA, and the
nature of a machine-level instruction in terms of its functionality and use
of resources (registers and memory).
CLO2. To understand the relationship between instruction set architecture, micro
architecture, and system architecture and their roles in the development
of the computer.
CLO3. Awareness of the various classes of instruction: data movement,
arithmetic, logical, and flow control.
CLO4. Design and functionalities of various units of a computer.
Course Outcomes: At the end of this course the student should be able to
CO1. Understand the basic structure of computer and assess cost/performance
trade-offs while assessing a computing system.(PO A,B,E)
CO2. Represent the information and different ways of accessing the operands.
(PO A,B,E)
CO3. Employ various classes of instructions in writing an assembly language
program. (POA, B, C)
CO4. Understand the design and functionalities of different units of computer. an
assembly language program. (POA, B, C,E)
Course Contents:
1) Basic Structure of Computers: Computer Types, Functional Units, Basic
Operational Concepts, Bus Structures, Performance Processor Clock, Basic
Performance Equation, Clock Rate, Performance Measurement, Historical
Perspective.
5 Hrs.
2) Machine Instructions and Programs: Numbers, Arithmetic Operations and
Characters, Memory Location and Addresses, Memory Operations, Instructions
and Instruction Sequencing, Addressing Modes, Assembly Language, Basic
Input and Output Operations, Stacks and Queues, Subroutines, Additional
Instructions, Encoding of Machine Instructions.
10 Hrs.
3) Input/Output Organization: Accessing I/O Devices, Interrupts Interrupt
Hardware, Enabling and Disabling Interrupts, Handling Multiple Devices,
Controlling Device Requests, Exceptions, Direct
Memory Access, Buses
Interface Circuits, Standard I/O Interfaces PCI Bus, SCSI Bus, USB.
10 Hrs.
4) Memory System: Basic Concepts, Semiconductor RAM Memories, Read Only
Memories, Speed, Size, and Cost, Cache Memories Mapping Functions,
Replacement Algorithms, Performance Considerations Virtual Memories, And
Secondary Storage.
10 Hrs.
5) Arithmetic: Addition and Subtraction of Signed Numbers, Design of Fast Adders
Multiplication of Positive Numbers, Signed Operand Multiplication, Fast
Multiplication, Integer Division, Floating point Numbers and Operations. 10 Hrs.

II Year B.E. (CSE): 2014 - 15

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.

II Year B.E. (CSE): 2014 - 15

10

SDMCET: Syllabus

11UCSC304

Industry Oriented Programming Practices

(0-0-4) 2

Course Learning Objectives:

CLO1.Introducing the students to Industry competent programming.
CLO2. As per ACM/IEEE the expected capabilities and skills for computer
science graduates can be captured under three headings: Objective of this
course is to bring awareness about them in the students. Conduct lecturer
and design activities to realize the importance of these skills and try to help
them in design and adopt personalized practices so that they can acquire
these skills for life long.
Course Outcomes: At the end of this course the student should be able to
CO1. Have hands on exposure over different fundamental commands to infer
some result from any of the components of OS (POA, C)
CO2. Write scripts using the various scripting languages to achieve administrative
tasks or configuration management (POB, D)

Prerequisites: 11UCSC100/200: Problem Solving and Programming in C

Course Contents:
I. Cognitive capabilities and skills relating to computer science
1. Knowledge and understanding. Demonstrate knowledge and understanding of
essential facts, concepts, principles, and theories relating to computer science and
software applications.
2. Modeling. Use such knowledge and understanding in the modeling and design of
computer-based systems in a way that demonstrates comprehension of the tradeoff
involved in design choices.
3. Requirements. Identify and analyze criteria and specifications appropriate to
specific problems, and plan strategies for their solution.
4. Understanding the elements of computational thinking. This includes recognizing
its broad relevance in everyday life as well as its applicability within other domains,
and being able to apply it in appropriate circumstances.
5. Critical evaluation and testing. Analyze the extent to which a computer-based
system meets the criteria defined for its current use and future development.
6. Methods and tools. Deploy appropriate theory, practices, and tools for the
specification, design, implementation, and maintenance as well as the evaluation of
computer-based systems.
7. Professional responsibility. Recognize and be guided by the social, professional,
legal and ethical as well as
8. Cultural issues involved in the use of computer technology. Increasingly cultural
issues are also relevant.
II Year B.E. (CSE): 2014 - 15

11

SDMCET: Syllabus

II. Practical capabilities and skills relating to computer science

1. Design and implementation. Specify, design, and implement computer-based
systems.
2. Evaluation. Evaluate systems in terms of general quality attributes and possible
tradeoffs presented within the given problem.
3. Information management. Apply the principles of effective information
management, information organization, and information-retrieval skills to information
of various kinds, including text, images, sound, and video. This must include
managing any security issues.
4. Human-computer interaction. Apply the principles of human-computer interaction
to the evaluation and construction of a wide range of materials including user
interfaces, web pages, multimedia systems and mobile systems.
5. Risk assessment. Identify any risks (and this includes any safety or security
aspects) that may be involved in the operation of computing equipment within a
given context.
6. Tools. Deploy effectively the tools used for the construction and documentation of
software, with particular emphasis on understanding the whole process involved in
using computers to solve practical problems. This should include tools for software
control including version control and configuration management.
7. Software reuse. Be aware of the existence of publicly available software (such as
APIs or open source materials) and engage effectively in open-source projects.
8. Operation. Operate computing equipment and software systems effectively.

III.Additional transferable skills

1. Communication. Make succinct presentations to a range of audiences about
technical problems and their solutions. This may involve face-to-face, written
communication or electronic communication.
2. Teamwork. Be able to work effectively as a member of a development team.
3. Numeracy. Understand and explain the quantitative dimensions of a problem.
4. Self management. Manage ones own learning and development, including time
management and organizational skills
5. Professional development. Keep abreast of current developments in the
discipline to continue ones own professional development.
6. Software reuse, open source issues. Separate compilation.
Prerequisites: Student registering for this course should belong to 3rd or Higher
Semester.
1. Problem-solving strategies. Exploring and thinking like engineers. Understanding
operating system support to Programmer/Strengthening fundamentals of
programming.
II Year B.E. (CSE): 2014 - 15

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

II Year B.E. (CSE): 2014 - 15

13

SDMCET: Syllabus

11UCSL305

Analog and Digital Electronics Laboratory

(0-0-4) 2

Course Learning Objectives:

CLO1. Solve Boolean expressions using different reduction techniques.
CLO2. Design optimal combinational and sequential circuits.
CLO3. Test and verify Boolean expression (application oriented) for different MSI
designs like MUX, Decoder.
CLO4. Design clipping, clamping, Astable and Monostable multivibrators
Course Outcomes: At the end of this course the student should be able to
CO1. Design and implement independently analog/digital circuits of real time
scenarios. (POA,B,C,D)
Course Contents:
1) a) To design and implement an Astable multivibrator circuit using 555 timers for a
given frequency and duty cycle.
b) Using a simulation package design a Monostable multivibrator for a
given pulse width tp.
2) a) To design and implement a Schmitt trigger circuit using Op-amp for a
given values of UTP and LTP.
3) b) To implement a Schmitt trigger circuit using Op-amp using a simulation
package for two sets of values of UTP and LTP.Design a 4- bit R-2R ladder DAC
using Op-amp. Determine its accuracy and resolution. To study the working of
positive clipper and positive clamper using Op-amp.
4) a) Given any 4-variable logic expression, simplify using MEV and realize
using 8:1 multiplexer IC.
b) Write VHDL code for MUX. Simulate and verify its working.
5) a) Realize an expression using 3-to-8 decoder IC
b) Write VHDL code for 3-to-8 decoder. Simulate and verify its working
6) a) Design and implement a magnitude comparator. Verify its truth table.
b) Write VHDL code for the above comparator. Simulate and verify its working.
7) a) Realize a J-K Master/slave F/F using NAND gates and verify its truth table.
b) Write VHDL code for any basic F/F. Simulate and verify its working.
8) a) Realization of one F/F using other F/F. Verify its truth table.
b) Write VHDL code for the above. Simulate and verify its working.
9) a) Design and implement a mod-n (n<16) synchronous counter using J-K
F/F IC.
b) Write VHDL code for the above counter. Simulate and verify its working.
10) a) Design and implement a mod-n (n<=9) asynchronous counter using
Decadecounter IC.
b) Write VHDL code for the above counter. Simulate and verify its working.
11) a) Design and implement Ring /Johnson counter using 4-bit shift register.
b) Write VHDL code for the above counter. Simulate and verify its
working.
Additional contents beyond the syllabi:
1. Initiating a hobby projects.
II Year B.E. (CSE): 2014 - 15

14

SDMCET: Syllabus

11UCSL306

Data Structures Laboratory

(0-0-4) 2

Course Learning Objectives:

CLO1. Realization of fundamental data structures like stacks, queues, link list,
trees.
CLO2. Compare and contrast the costs and benefits of dynamic and static data
structure implementations.
CLO3. Selection of the appropriate data structure for modeling a given problem.
Course Outcome: At the end of this course the student should be able to
CO1. Use of stacks, queues, link list, trees etc., in solving the problems
(POA,E)
CO2. Coding expertise in C and Linux (POJ)
CO3. Code organization, standardization and testing (POJ)
CO4. Writing reliable code (POJ)
Suggested Plat forms:
1. Visual Studio 6, Windows
2. Vi editor, Linux
3. Eclipse, Fedora 4
All programs
1. Written, keeping coding standards in the mind
2. More generic
3. Exceptions are handled
4. Tested for different test cases
Contents:
1) Programs that targets the understanding of pointers.
2) Programs that help to appreciate stack developments, operations on it.
Applications of stack like converting infix to prefix expression and evaluation of
postfix expressions
3) Programs that helps to implement different types of queues, operations on it, and
applications of queues.
4) Programs that help to understanding recursion and its uses. Examples like tower
of Hanoi and binary search.
5) Programs on linked lists to showing its advantages over other data structures.
6) Programs on trees to show where tree data structure is more appropriate.
7) Programs on hash table concept.

II Year B.E. (CSE): 2014 - 15

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.

II Year B.E. (CSE): 2014 - 15

17

SDMCET: Syllabus

11UCSC400

Microcontroller

(4-0-0) 4

Course Learning Objectives:

Students completing this course will be able to:
CLO1. Understand the differences between Microprocessor and Microcontroller,
and concept of an embedded system.
CLO2. The internal architecture and instruction set of 8051 microcontroller and
assembling process.
CLO3. Implement small programs to solve well-defined problems on an 8051
Microcontroller.
CLO4. Develop and demonstrate how to accomplish a given task using assembly
language and C on a Microcontroller
CLO5. Demonstrate the use of interrupts and other advanced concepts related to
8051 Microcontrollers
CLO6. Demonstrate working knowledge of the necessary steps and methods used
to interface a microcontroller system to devices such as motors, LCD, ADC,
DAC etc.
CLO7. Develop familiarity with tools used to develop in an embedded environment.
Course Outcomes: At the end of this course the student should be able to The
specific course outcomes supporting the program outcomes are:
CO1. Students should be able to apply knowledge of the microcontrollers internal
registers and operations by use of a PC based microcontroller simulator.
(PO-> B,C,E)
CO2. Students should be able to demonstrate programming proficiency using the
various addressing modes and 8051 instructions of the microcontroller.
(PO-> A,B,C)
CO3. Students should be able to program using the capabilities of the stack, the
program counter, and the status register and show how these are used to
execute a machine code program. (PO-> B,C,E)
CO4. Students should be able to solve basic binary math operations using the
microcontroller.(PO-> A,B)
CO5. Students should be able to write assemble assembly language programs
and C , assemble into machine a cross assembler utility and download and
run their program on the training boards. (PO-> B,C,E,K)
CO6. Students should be able to program using the capabilities of the IO ports,
the Timer/counter, and the interrupt and show how these are used to
execute a machine code program. (PO-> B,C,E)
CO7. Students should be able to write assembly language programs and C
programs and download the machine code that will provide solutions to
real-world control problems such as fluid level control, temperature control,
and batch processes. (PO-> C,E,H).

II Year B.E. (CSE): 2014 - 15

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

Additional contents beyond the syllabi:

1. Designing a small microcontroller based project. (POC, D, E, I)
Books:
1) Kenneth J. Ayala, The 8051 Microcontroller Architecture, Programming
&Application, 2nd edition
2) Muhammad Ali Mazidi, Janice Gillispie Mazidi, Rolin D. McKinlay, The
8051Microcontroller and Embedded Systems using Assembly and C, 2nd
edition,Eastern Economy Edition
3) Dr. Ramani Kalpathi and Ganesh Raja, Microcontrollers and Applications
1stRevised edition, Sanguine 2007.
4) Myke Predko, Programming and customizing the 8051 microcontroller,
4thEdition, Tata McGraw-Hill publishers, 2002.

II Year B.E. (CSE): 2014 - 15

20

SDMCET: Syllabus

11UCSC401

Finite Automata & Formal Languages

(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.

II Year B.E. (CSE): 2014 - 15

22

SDMCET: Syllabus

11UCSC402

Object Oriented Programming

(4-0-0) 4

Course Learning Objectives:

CLO1. Analyze the system requirements and model the solution space using
Object Oriented Concepts.
CLO2. Implement the OO Design concepts using Java as a Programming
Language.
CLO3. Expertise in Java Programming Language as per the industrial needs so
that students meet the demands of future developments in Java related
technologies.
Course Outcomes: At the end of this course the student should be able to
CO1. Understand the use of Core Java concepts to build applications that are
Object Oriented and Platform Independent. Also to analyze any given
problem and to have a desired outcome for the problem. ( PO
A)
CO2. Apply the concepts of Java Technology, to introduce new ideas in their
future projects. Also to validate the applications developed using them.
(PO B,D,E)
CO3. Apply the concepts in the future leading to a position of establishing his/her
own entrepreneurship in the world of Java and web programming.
(PO H,J)
Prerequisites:
Programming experience with any High level programming language preferably C
Contents:
1). Introduction to Object Oriented Paradigm (OOP): Object Oriented
Philosophy, Key Concepts of OOP, Encapsulation, Polymorphism, Inheritance
10 Hrs
2). Basic Features of JAVA: Introduction to JAVA, Data Types, Variables and
Arrays, String Handling Operators, Control Structures, Classes, Objects,
Methods, Constructors, Overloading methods, A Closer look at Methods and
Classes, Inheritance, Packages and Interfaces
20 Hrs
3). Core Features of Java: Exception Handling, Multi Threaded Programming,
Streams, AWT and Swings, Applets, Events
22 Hrs
Additional contents beyond the syllabi:
1. Exposure to industry standard IDEs like netbeans, eclipse etc. (PO
2. Database transactions using multithreading. (PO
E)

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

Analysis and Design of Algorithms

(4-0-0) 4

Course Learning Objectives:

To develop abilities to,
CLO1. Select algorithms appropriate to particular purposes and to apply them,
recognizing the possibility that no suitable algorithm may exist. and
CLO2. Understand the range of algorithms that address an important set of welldefined problems, recognizing their strengths and weaknesses and their
suitability in particular contexts.
Course Outcomes: At the end of this course the student should be able to
CO1. Able to understand some ones algorithm, analysis and find different
implementation possibilities and convince himself/herself through
implementation and experiments.
CO2. Understand asymptotic notation, its properties and use in measuring
algorithm behaviour
CO3. Determine asymptotic expressions for the worst-case execution time and
space requirements of algorithms and data structures
CO4. Understand the process of proving algorithm correctness and provide
proofs for classical algorithms studied in the course and similar ones
CO5. Understand the importance of a data structure in providing efficient
algorithms to solve a particular problem
CO6. Know the different strategies that are known to be useful in finding efficient
algorithms to solve problems and to be able to apply them
CO7. Be able to establish comparisons among different solutions and deciding
circumstances when one may be better.
CO8. Understand the concepts of computational complexity and its use in
categorizing problems in terms of their computational requirements, and to
know about different techniques to cope with hard problems
CO9. Be able to use mathematical language and do elementary proofs
CO10. Create algorithms to solve problems
Prerequisites:
11UCSC303: Data Structures with C
Course Contents:
1) Introduction: Algorithm, Fundamentals of problem solving, Problem types,
Principles of Algorithm Design. Analysis frame work, Asymptotic notations,
Mathematical analysis of Non recursive algorithms, Recurrence relations;
Mathematical analysis of recursive analysis.
8 Hrs.
2) Brute force strategy: Selection Sort, Bubble sort, string matching, concept of
exhaustive search.
4 Hrs.
3) Divide and Conquer: Introduction and General method, Binary search,
Maximum and Minimum, Merge sort, Quick sort. Matrix multiplication using
stressens Matrix multiplication with analysis for all applications , Heap sort,
String Matching, The median of a list of numbers.
8 Hrs.
II Year B.E. (CSE): 2014 - 15

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.

II Year B.E. (CSE): 2014 - 15

25

SDMCET: Syllabus
11UCSL404

Object Oriented Programming Laboratory

(0-0-4) 2

Course Learning Objectives:

CLO1. Hands on experience of Object Oriented Programming Concepts with
C++.
CLO2. Preparedness to study independently any other Object Oriented
Programming language and apply to variety of real time problem
scenarios.
Course Outcomes: At the end of this course the student should be able to
CO1. Conceptualize the given problem and transform it into an Object Oriented
system. (PO A,B,C,D)
CO2. Implement coding standard and verification practices. (PO C,D,E)
CO3. Build expertise in Object Oriented programming language. (PO C,D,E)
Suggested Plat forms:
1. Visual Studios 6, Windows (Any one)
2. Vi editor, Linux
3. Eclipse, Fedora 4
All programs should be
1. Written to realize the need for oops.
2. Written keeping coding standards in the mind.
3. More generic.
4. Written with Exception handling.
5. Tested for different test cases.
Course Contents:
1) Programs which help the students understand, class, Object and Array of
objects.
2) Programs that targets the continuously of function over loading.
3) Programs that targets the under standing of friend classes and friend functions
(overloading of global functions can be demonstrated).
4) Programs on Dynamic memory allocation and de allocation (using new and
delete operators). Role of constructors and destructors in dynamic memory
allocation and de-allocation can be demonstrated.
5) Programs on function templates and template class.
6) Programs on overloading unary operators both using member and non member
functions
7) Programs on overloading binary (arithmetic, relational) operators.
8) Programs on Inheritance and dynamic polymorphism(virtual functions)
9) Programs on overloading insertion (<<) and extraction (>>) operators.
10) Programs to demonstrate all types of constructors.
Additional contents beyond the syllabi:
Comparative studies of features and capabilities of different object oriented
programming language.
II Year B.E. (CSE): 2014 - 15

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

II Year B.E. (CSE): 2014 - 15

27

SDMCET: Syllabus

11UCSL405

Microcontroller Laboratory

(0-0-4) 2

Course Learning Objectives:

CLO1. Understand the use of memory and its context checking, familiarity with
assemblers, use of DOS functions.
CLO2. Handle macros, procedure, arrays, and instructions of 8051 programming
and assembler directives.
CLO3. Handle exceptional cases and providing reliable solutions.
CLO4. Test and verify programs for different scenarios.
CLO5. Know basic interfacing techniques using 8255.
Course Outcomes: At the end of this course the student should be able to
CO1. Write assembly level codes for a given microcontroller architecture specific
problem. (PO A,B,C,D)
CO2. Write interrupt handles pgms. (PO C,D)
CO3. Interfacing with real world devices such as LCDs Keyboards, DAC, ADC,
Relays Motors etc. (PO D,E)
CO4. Learn any other assembly language. (PO H)
Course Contents:
I) Programming:
1) Data Transfer- Block move,exchange,sorting,finding largest/smallest element in
an array.
2) Arithematic instructions: Addition/substraction, ultiplication/division, square,
cube.
3) Counters-johnsons, ring, updown
4) Boolean and logical instruction-(bit manipulations)
5) Code converstion-BCD to ascii,ascii to decimal,hex to decimal,decimal to hex
6) Programs using serial port and onchip timer/counter.
II) Interfacing:
1) Write a C programs to interface 8051 chip to interfacing modules:
a) Write a C program to switching ON and OFF individual LEDs, with software
delay. (Use the eight independent LEDS).
b) Write a program to blink individual leds and make the blinking led to
move left to right and right to left continuously, with software delay.
2) Write a C program to
a) Up count BCD from 0 to N and display on 2 digit display, with software delay.
b) Down count from N to 0 and display on 2 digit display, with software delay.
c) 0 to N and N to 0 repeat the process with software delay. Where N is taken
from PORT1through DIP switch
3) Write a C program to
a) Display all odd numbers between 0 to N continuously, with software delay.
b) Display all even numbers between 0 to N continuously, with software delay.
Where N is taken from PORT1 through DIP switches and output on 2 digit
display.
II Year B.E. (CSE): 2014 - 15

28

SDMCET: Syllabus

4) a) Write a C program to clear and display "SDMCET", "CSE" and "DEPT"

on the LCD.
b) Write a C program to recognize the keyboard and display the key value
on 1) 7-segment display. 2) LCD
5) Write a C program to rotate the Stepper motor
1) Clockwise. 2) Anticlockwise.
6) Write a C program to rotate the DC motor
1) Clockwise. 2) Anticlockwise.
7) Write a c program to detect the key pressed form hexkeypad n display the
number on a) lcd b) 7-seg
8) Elevator interface

II Year B.E. (CSE): 2014 - 15

29