M S Ramaiah Institute
of Technology
Department
of
Computer
Science and
Engineering
August 13
2013
Scheme and Syllabi for batch
2012-16
III & IV semester
CSE-12/16
M.S. Ramaiah Institute of Technology, Bangalore - 54
(Autonomous Institute, Affiliated to VTU)
Department of Computer Science and Engineering
Programme Educational Objectives (PEOs)
A B.E. (Computer Science & Engineering) graduate of M S Ramaiah Institute of Technology should,
within three to five years of graduation
1. Pursue a successful career in the field of Computer Science & Engineering or a related field utilizing
his/her education and contribute to the profession as an excellent employee, or as an entrepreneur
2. Be aware of the developments in the field of Computer Science & Engineering, continuously
enhance their knowledge informally or by pursuing graduate studies
3. Engage in research and inquiry leading to new innovations and products
4. Be able to work effectively in multidisciplinary and multicultural environments
5.
Be responsible members and leaders of their communities, understand the human, social and
environmental context of their profession and contribute positively to the needs of individuals and
society at large
Programme Outcomes
The programme leading to the degree of Bachelor of Engineering in Computer Science & Engineering
aims to provide students with a strong theoretical and practical background in computer hardware and
software. A graduate engineer with a B.E. (CSE) degree must attain the engineering analysis, design, and
implementation skills necessary to work in both hardware and software domains.
The outcomes of the Bachelor of Engineering in Computer Science & Engineering Programme are as
follows:
A B.E. (Computer Science & Engineering) graduate must demonstrate
PO 1.
An ability to apply knowledge of mathematics, science, and engineering as it applies to
Computer Science & Engineering to solve engineering problems.
PO 2. An ability to use research methods to design and conduct experiments to investigate complex
problems, as well as to analyze and interpret data
PO 3. An ability to design a system, component, or process to meet the desired economic, social, and
environmental needs with appropriate consideration for public health and safety.
PO 4.
An ability to function effectively individually and in team, and in multi-disciplinary
environment.
PO 5. An ability to identify, formulate, study, analyze and solve problems using the first principles of
mathematics and natural sciences as well as computer science & engineering techniques.
PO 6.
An understanding of professional and ethical responsibilities in professional engineering
practice.
PO 7. An ability to communicate effectively.
PO 8.
The broad education necessary to understand the impact of engineering solutions in an
environmental and societal context.
PO 9. Recognition of the need for, and an ability to engage in life-long learning.
PO 10. An ability to create and use the techniques, algorithms, models and processes, and modern
software/hardware tools necessary for computer engineering practice.
PO 11. An ability to apply knowledge of contemporary issues to assess the societal, legal and cultural
issues related to the practice of computer science and engineering.
PO 12. An understanding of the engineering and management principles required for project and finance
management.
M. S. Ramaiah Institute of Technology, Bangalore – 560054.
Department of Computer Science and Engineering
Scheme of Studies in Bachelor of Engineering in Computer Science for the batch 2012 to 2016
III Semester
Code
Subject
CSMAT301 Engineering Mathematics III
CS311
Electronics Circuits
CS312
Digital Design with VHDL
CS313
Data Structures with C
CS314
Discrete Mathematical Structures
CS315
Object Oriented Programming with C++
CSL316
Programming Laboratory
CSL317
Analog & Digital Circuits Laboratory
IV Semester
Code
CSMAT401
CS411
CS412
CS413
CS414
CS415
CSL413
CSL414
V Semester
Code
CS511
CS512
CS513
CS514
CS515
CSL513
CSL514
Subject
Engineering Mathematics IV
Theory of Computation
Computer Organization
Design and Analysis of Algorithms
Introduction to Microprocessors
Data Communication
Algorithms Laboratory
Microprocessors Laboratory
Subject
System Software
Operating Systems
Database Systems
Computer Networks
Software Engineering
Elective -I
Database Applications Laboratory
Computer Networks Laboratory
VI Semester
Code
Subject
CS612
Compiler Design
CS613
Embedded Systems
CS614
Unix System Programming
CS616
Entrepreneurship & Intellectual Property Rights
CS617
Object Oriented Modeling and Design
Elective II
Elective - III
CSL613 Embedded Systems Laboratory
CSL618 Compilers & Systems Programming Laboratory
Total Credits: 25
L T P
Credit
4 0 0
4
3 0 0
3
3 0 0
3
3 1 0
4
4 0 0
4
3 0 0
3
0 0 2
2
0 0 2
2
Total Credits: 26
T P
Credit
0 0
4
1 0
4
0 0
4
0 0
4
0 0
4
0 0
4
0 1
1
0 1
1
L
4
3
4
4
4
4
0
0
L
2
4
4
4
4
*
0
0
Total Credits: 25
T P Credit
0 1
3
0 0
4
0 0
4
0 0
4
0 0
4
* *
4
0 1
1
0 1
1
Total Credits: 25
L T P Credit
3 1 0
4
3 0 0
3
2 0 0
2
3 0 0
3
3 0 1
4
* * *
4
* * *
3
0 0 1
1
0 0 1
1
VII Semester
Code
Subject
CS711
Advanced Computer Architecture
CS712
Computer Graphics & Visualization
CS723
Project Management & Engineering
Economics
CS724
Cryptography and Network Security
Elective - IV
Elective - V
Open Elective
CSL716 High Performance Computing Laboratory
CSL712 Computer Graphics Laboratory
VIII Semester
Code
Subject
Elective - VI
CS812
Project
CS813
Seminar (for Regular Students)
CS8T1
Technical Seminar (for Lateral Entry
students)
L
3
3
3
3
*
*
*
0
0
L
*
-
Total Credits: 25
T P Credit
0 0
3
0 0
3
0 0
3
0
*
*
*
0
0
0
*
*
*
1
1
3
4
4
3
1
1
Total Credits: 24
T P Credit
* *
4
- 18
18
2
2
1
1
Semester: 3
Year: 2013-2014
Course Title: Engineering Mathematics – III
Course Code: CSMAT301
Credits (L:T:P) : 4:0:0
Core/ Elective: Core
Type of course: Lecture
Total Contact Hours:56
Prerequisites: Nil
Course Objectives:
The students will
1. Learn the concepts of finite differences and its applications.
2. Learn to represent a periodic function in terms of sines and cosines.
3. Understand the concepts of a continuous and discrete integral transform in the form of Fourier and Ztransforms.
4. Understand the concepts of PDE and its applications to engineering.
5. Learn the concepts of linear transformation through matrix algebra.
Course Outcomes:
Students are expected to do the following
1. Will be able to use a given data for equal and unequal intervals to find a polynomial function for
estimation.
2. Computing maxima, minima, curvature, radius of curvature using numerical differentiation.
3. Computing the arc length, area, surface area and volume using numerical integration.
4. Finding the expansion of function as a Fourier series/Half range Fourier series in a given range of values of
the variable.
5. Obtaining the various harmonics of the Fourier series expansion for the given numerical data.
6. To find Fourier transforms, Fourier sine and Fourier cosine transforms of functions.
7. Solving difference equations using Z-transforms.
8. Formation and solution of partial differential equations.
9. Solutions of heat, wave and Laplace equations using numerical methods.
Course Content:
Unit 1
Finite Differences and Interpolation: Forward and backward differences, Interpolation, Newton-Gregory forward
and backward Interpolation formulae, Lagrange’s interpolation formula, Newton’s divided difference interpolation
formula (no proof).
Numerical Differentiation and Numerical Integration: Derivatives using Newton-Gregory forward and
backward interpolation formulae, Newton-Cote’s quadrature formula, Trapezoidal Rule, Simpson’s(1/3) rd rule,
Simpson’s(3/8)th rule.
Unit 2
Fourier Series: Convergence and divergence of infinite series of positive terms, Periodic functions, Dirichlet’s
conditions, Fourier series of periodic functions of period 2 and arbitrary period, Half range Fourier series, Practical
harmonic analysis.
Unit 3
Fourier Transforms: Infinite Fourier transform, Fourier sine and cosine transform, Properties, Inverse transform.
Z-Transforms: Definition, Standard Z-transforms, Single sided and double sided, Linearity property, Damping rule,
Shifting property, Initial and final value theorem, Inverse Z-transform, Application of Z-transform to solve
difference equations.
Unit 4
Partial differential equation: Formation of partial differential equations (PDE) by elimination of
arbitrary constants and functions, Solution of PDE - Lagrange’s linear form, Method of Separation of Variables.
Application of partial differential equations: Finite difference approximation to derivatives, Numerical
solution of second order partial differential equations – Elliptic, Parabolic & Hyperbolic equations
(Laplace, Heat & Wave equations).
Unit 5
Linear Transformations: Introduction to Linear transformations, Composition of matrix transformations, Rotation
about the origin, Dilation, Contraction and Reflection, Kernel and Range ,Change of basis.
Text Books :
1.
2.
3.
Erwin Kreyszig-Advanced Engineering Mathematics-Wiley-India publishers- Abridged edition-2008.
B.S.Grewal - Higher Engineering Mathematics - Khanna Publishers - 40th edition-2007.
Ganeth Williams – Linear Algebra with Applications – Jones and Bartlett Press – 4th edition – 2001.
Reference Books:
1.
2.
3.
Peter V. O’Neil – Advanced Engineering Mathematics – Thomson Brooks/Cole – 5th edition –
2007.
B. V. Ramana – Engineering Mathematics – Tata McGraw Hill Pub. Co. Ltd. – New Delhi – 2008.
Serge Lang – Linear Algebra-Springer-3rd edition-1987.
Semester: 3
Year: 2013-2014
Course Title: Electronic Circuits
Course Code: CS311
Credits (L:T:P) : 3:0:0
Core/ Elective: Core
Type of course: Lecture
Total Contact Hours: 42 Hrs
Prerequisites:
EC201: Elements of Electronics
Course Objectives:
At the end of the course students should be able to:
1. Identify, by inspection, the type of configuration at work in a given amplifier circuit, and estimate the
current gain ,voltage gain, input impedance, output impedance of the given amplifier configuration
2. Understand benefits of negative feedback for amplifier circuits, identify, by inspection, the type of
feedback at work in a given amplifier circuit, and estimate the feedback factor, loop gain, and the allied
properties
3. Understand the relevance of waves happing circuits, mathematics behind it , in different electronic
applications.
4. Design an efficient Linear power supplies and voltag e regulators
5. Classify various applications of OPAMP and design various OPAMP applications.
Course Contents:
Unit 1
Small signal analysis of amplifiers: Hybrid h parameter model for an amplifier, Transistor hybrid model, Analysis
of a transistor amplifier using complete h parameter model, analysis of a transistor amplifier using simplified h
parameter model, Cascading amplifiers, low frequency response of BJT amplifiers.
Unit 2
Feedback amplifiers: Classification of amplifiers, amplifiers with negative feedback, advantages of negative
feedback, feedback topologies, voltage series feedback, voltage shunt feedback, current series feedback, current
shunt feedback.
Unit 3
Wave shaping circuits: Basic RC low pass circuits, RC low pass circuit as integrator, Basic RC high pass circuit,
RC high pass as differentiator, basic RL circuit as integrator, basic RL circuit as differentiator, diode clipper circuits,
diode clamper circuit, integrated circuit multivibrators.
Unit 4
Linear Power Supplies: Constituents of a linear power supply, designing mains transformer, rectifier circuits,
linear regulators, linear IC voltage regulators, regulated power supply parameters.
Unit 5
Op amps: Introduction, inside of the op amp, ideal op amp versus practical op amp, performance parameters. Op
amp Application circuits: Inverting amplifier, non inverting amplifier, voltage follower, summing amplifier,
integrator, peak detector, first order filter, relaxation oscillator, R-2R ladder network, binary weighted network.
Text Books:
1. Anil K Maini, Varsha Agarwal: Electronic Devices and Circuits, Wiley, First Edition, 2009.
2. Ramakant Gayakwad: Op-Amps and Linear Integrated Circuits (4th Edition)
Reference Books:
1. Robert L Boylestad, Louis Nashelsky: Electronic devices and circuit theory, 9th edition. 2007.
2. Albert Malvino & David J Bates: Electronic Principles, TMH, 7th edition, 2007.
3. David A Bell: Electronic devices and Circuits, PHI,4th edition, 2006.
Course Delivery:
The Course will be delivered through classroom teaching, interactions with the students, discussing interesting
electronic systems in the class room where the subsystems are being used.
Course Assessment and evaluation:
Indirect Assessment
Methods
Direct Assessment
Methods
What
To
Whom
Internal
Assessment Tests
CIE
SEE
Class-room
Surprise Quiz
Students
Standard
Examination
Students
Feedback
When/ Where
(Frequency in the
course)
Thrice(Average of
the best two will be
computed)
Max
Marks
Evidence
Collected
Contribution to
Course Outcomes
30
Blue Books
1,2 3,4,5
20
Quiz papers
End of Course
(Answering
5 of 10 questions)
100
Answer scripts
Middle of the
course
-
Feedback
forms
End of the course
-
Questionnaire
Twice(Summation
of the two will be
computed)
1,2,3,4 & 5
1, 2 & 3
Delivery of the
course
1, 2, 3,4,5
Effectiveness of
Delivery of
instructions &
Assessment
Methods
Students
End of Course
Survey
1,2,3,4 &5
Course Outcomes:
This course uses assigned readings, lectures, and homework to enable the students to:
1. Identify, by inspection, the type of configuration of amplifier circuit, and estimate the current gain,
voltage gain, input impedance, output impedance of the given amplifier configuration.
2. Analyze different negative feedback circuits, identify by inspection the type of feedback of amplifier
circuit, and estimate the feedback factor, loop gain, and the allied properties.
3. Analyze and design different wave shaping circuits like clipper, clamper, integrator, differentiator and
multi vibrator circuits.
4. Design efficient linear power supplies and voltage regulators.
5. Understand the insides of OPAMP, and design various applications of OPAMP.
Mapping Course Outcomes with Program Outcomes:
Course Outcomes
Identify, by inspection, the type of configuration of
amplifier circuit, and estimate the current gain, voltage
gain, input impedance, output impedance of the given
amplifier configuration.
Analyze different negative feedback circuits, identify by
inspection the type of feedback of amplifier circuit, and
estimate the feedback factor, loop gain, and the allied
properties
Analyze and design different wave shaping circuits like
clipper, clamper, integrator, differentiator and multi
vibrator circuits.
Design efficient linear power supplies and voltage
regulators
Understand the inside of OPAMP, to design the various
applications of OPAMP.
Program Outcomes
1
2
3
4
5
6
7
8
9
10
11
12
X
X
X
X
X
-
-
-
-
X
-
-
X
X
X
X
X
-
-
-
-
X
-
-
X
X
X
X
X
-
-
-
-
X
-
-
X
X
X
X
X
-
-
-
-
X
-
-
X
X
X
X
X
-
-
-
-
X
-
-
Semester: 3
Year: 2013-2014
Course Title: Digital Design with VHDL
Course Code: CS312
Credits (L:T:P) : 3:0:0
Core/ Elective: Core
Type of course: Lecture
Total Contact Hours: 42 Hrs
Prerequisites:
EC201: Elements of Electronics. Students should know the basic concepts of Boolean Algebra.
Course Objectives:
This course will help students to achieve the ability to:
1. Understand the basic digital principles and working of various logic gates, to analyze and simplify a
boolean function using K-map, Quine-McCluskey techniques as to find the minimal SOP/POS solution for
designing a cost effective combinational circuit.
2. Design and implement complex arithmetic and logic circuits, to understand the working logic, design and
applications of some data processing circuits.
3. Analyze the working behavior, timing issues and internal structure of various bistable elements (flip-flops)
and their design.
4. Analyze and design various flip-flop-based state machines (sequential circuits), that includes registers and
counters.
5. Develop a VHDL code for various logic circuits (combinational and sequential circuits) to test their
functionality and timing.
Course Contents:
Unit 1
Logic gates and Simplification Methods: Overview of Logic Gates, Karnaugh map, Strategy of
minimization, Minimization of SOP and POS forms, Incompletely specified functions, Multiple output circuits,
Multilevel synthesis, Analysis of multilevel circuits, Tabular method for minimization, Introduction to VHDL.
Unit 2
Combinational circuits: Arithmetic Building Blocks, The Adder-Subtractor unit, Fast Adder, Multiplexer,
Demultiplexer, Decoder, Encoder, Code converter, Parity Generator and Checker, Magnitude Comparator,
VHDL for combinational circuits.
Unit 3
Clocks and Flip-Flops: Clock Waveforms, Pulse-forming Circuits, The basic bistable element, latches ,Edgetriggered SR, D, JK and T Flip-flops, Flip-flop timing, Race around condition, JK Master-slave Flip-flops,
Switch Contact Bounce Circuit, SR –Debounce circuit, Various Representation of Flip-flops, Conversion of
Flip-flops, VHDL implementation of Flip-flops.
Unit 4
Registers and Counters: Types of Registers, Serial In-Serial Out, Serial In-Parallel Out, Parallel In-Serial
Out, Parallel In-Parallel Out, Applications of Shift Register, Counters, Asynchronous Counters, Synchronous
Counters, Changing the Counter Modulus, Decade Counters, Counter Design as a Synthesis Problem, VHDL
implementation of Registers and Counters.
Unit 5
Sequential Circuits: Moore and Mealy Model Selection, State Transition Diagram, State Synthesis Table,
Design Equations and Circuit Diagram, Analysis of Sequential Circuits, Implementation using Read Only
Memory, Algorithmic State Machine, FSM for serial adder, State Reduction Technique, State Assignment.
Text Books:
1. Donald P Leach, Albert Paul Malvino & Goutam Saha: Digital Principles and Applications, Tata McGraw
Hill, 7th Edition, 2011.
2. Stephen Brown, Zvonko Vranesic: Fundamentals of Digital Logic Design with VHDL, Tata McGraw Hill,
3rd Edition, 2012.
Reference Books:
1. Donald D Givone: Digital Principles and Design, 2nd edition, Tata McGraw Hill, 2006.
2. Charles H Roth, Jr : Digital Systems Design using VHDL, Thomson, 2nd Edition.
3. John M Yarborough: Digital Logic Applications and Design, Thomson Learning, 2004
Course Delivery:
The course will be delivered through lectures, class room interaction, group discussion, exercises and self study
cases.
Course Assessment and Evaluation:
Indirect Assessment
Methods
Direct
Assessment
Methods
What
Internal
Assessment
Tests
Surprise Quiz
CIE
SEE
To
Whom
Students
Standard
Examination
Students
Feedback
When/ Where
(Frequency in
the course)
Thrice(Average of
the best two will
be computed)
Twice
End of Course
(Answering
5 of 10 questions)
Middle of the
course
Max
Marks
Evidence
Collected
Contribution to
Course Outcomes
30
Blue Books
1,2 3,4,5
20
Quiz Papers
1,2 3,4,5
100
Answer
scripts
1,2 3,4,5
-
Feedback
forms
1, 2 & 3
Delivery of the
course
Questionnaire
1, 2, 3,4,5
Effectiveness of
Delivery of
instructions &
Assessment Methods
Students
End of Course
Survey
End of the course
-
Questions for CIE and SEE are designed according to Bloom’s Taxonomy.
Course Outcomes:
This course uses assigned readings, lectures and homework to enable the students to:
1.
2.
3.
4.
5.
Demonstrate the minimization of combinational functions using various techniques.
Design and analyze the working of combinational circuits and simulate using VHDL.
Design and analyze the working of sequential circuits and simulate using VHDL.
Design counters and registers using the basic building blocks of combinational/sequential functions and
simulate using VHDL
Analyze and design sequential circuits in Moore and Mealy models.
Mapping Course Outcomes with Program Outcomes:
Program Outcomes
Course Outcomes
Demonstrate the minimization of combinational functions
using various techniques.
Design and analyze the working of combinational circuits
and simulate using VHDL
Design and analyze the working of sequential circuits and
simulate using VHDL.
Design counters and registers using the basic building
blocks of combinational/sequential functions and simulate
using VHDL
Analyze and design sequential circuits in Moore and Mealy
models.
8
2
3
4
5
6
7
X
X
X
-
x
-
-
-
X
X
X
-
-
-
-
-
X
-
X
X
X
-
-
-
-
-
X
-
X
X
X
-
-
-
-
-
X
-
X
X
X
-
X
-
-
-
9
1
0
1
-
11
12
-
-
-
Semester: 3
Year: 2013-2014
Course Title: Data Structures with C
Course Code: CS313
Credits (L:T:P) : 3:1:0
Core/ Elective: Core
Type of course: Lecture, Tutorial
Total Contact Hours: 56 Hrs
Pre-requisite: CS101/201: Fundamentals of Computing
Course Objectives:
The objectives of this course are to:
1) Understand the concept of pointers, arrays, structures and unions, strings and file I/O.
2) Understand the properties of data structures such as stacks and queues.
3) Implement the concept learnt using recursion in different manner.
4) Compare different implementations of data structures and recognize the advantages and disadvantages of lists.
5) Understand and implement trees, its types and comparison with other data structures.
Course Contents:
Unit 1
Functions and pointers: passing arrays to functions, understanding pointers, accessing, declaring and initializing
pointer variables, accessing a variable through its pointer, chain of pointers, pointer expressions, pointer increments
and scale factor, pointers and arrays, pointers and character strings, array of pointers, pointers as function arguments,
functions returning pointers, pointers to functions, pointers and structures, Structures: Accessing structure
members, arrays of structures, arrays within structures, structures within structures, structures and functions,
Unions, Strings: string handling functions, File management in C.
Unit 2
Stacks: definition and examples-primitive operations, example, the stack as an ADT, representing stacks in Cimplementing the pop operation, testing for exceptional conditions, implementing push operation, examples: infix,
prefix and postfix-basic definitions and examples, evaluating a postfix expression, program to evaluate a postfix
expression, limitations of the program, converting an expression from infix to postfix, program to convert an
expression from infix to postfix, Recursion: recursive definition and processes-factorial function, multiplication of
natural numbers, Fibonacci sequence, binary search, properties of recursive definitions or algorithms, recursion in
C-factorial in C, Fibonacci numbers in C, binary search in C, recursive chains, recursive definition of algebraic
expressions, writing recursive programs- the towers of Hanoi problem.
Unit 3
Recursion (continued): Simulating recursion-return from a function, implementing recursive functions, simulation of
factorial, Efficiency of recursion. Queues and Lists: the queue and its sequential representation- the queue as an
ADT, C implementation of queues, insert operation, priority queue, array implementation of a priority queue, linked
lists-inserting and removing nodes from a list, linked implementation of stacks, getnode and freenode operations,
linked implementation of queues, linked list as a data structure, examples of list operations, list implementation of
priority queues, header nodes.
Unit 4
Queues and lists (continued): Lists in C-array implementation of lists, limitations of the array implementation,
allocating and freeing dynamic variables, linked lists using dynamic variables, queues as lists in C, examples of list
operations in C, comparing the dynamic and array implementations of lists, implementing header nodes, other list
structures-circular lists, stack as a circular list, queue as a circular list, primitive operations on circular lists, header
nodes, doubly linked lists, addition of long integers using doubly linked lists.
Unit 5
Trees: binary trees-operations on binary trees, applications of binary trees, binary tree representations-node
representation of binary trees, internal and external nodes, implicit array representation of binary trees, choosing a
binary tree representation, binary tree traversals in C, traversal using a father field, heterogeneous binary trees,
representing lists as binary trees-finding the kth element, deleting an element, trees and their applications-C
representations of trees, tree traversals, general expressions as trees, evaluating an expression tree, constructing a
tree.
Text Books:
1. Programming in ANSI C by E Balagurusamy, fifth edition, MGH, 2007.
2.
Data Structures Using C and C++ by Yedidyah Langsam, Moshe J Augenstein, Aaeon M Tanenbaum, PHI,
Second Edition.
Reference Books:
1. Horowitz, Sahni, Anderson-Freed: Fundamentals of Data Structures in C, 2nd Edition, Universities Press, 2008.
2. Data Structures, Seynour Lipschutz and GAV Pai, Schaum’s Outlines, McGraw Hill, 2008.
3. Data Structures: A Pseudo code Approach with C, Richard F Gilberg, Behrouz A Forouzan, Thomson, 2005
4. Data Structures and Program Design in C R.Kruse, C.L Tondo and B.Leung, Second Edition, Pearson
Education, 1997
Course Delivery:
The course will be delivered through lectures, class room interaction, group discussion, exercises and self study
cases.
Course Assessment and Evaluation:
Indirect
Assessment
Methods
Direct Assessment
Methods
What
CIE
Internal
Assessment
Tests
Surprise Quiz
SEE
To
Whom
Students
Standard
Examination
Students
Feedback
End of
Course
Survey
When/ Where
(Frequency in
the course)
Thrice
(Average of
the best two
will be
computed)
Max
Marks
Evidence
Collected
Contribution to Course
Outcomes
30
Blue Books
1,2,3,4 &5
Twice
20
Quiz
Answers
Recollection of Skills
End of Course
(Answering
5 of 10
questions)
100
Answer
scripts
1,2,3,4 &5
Middle of the
course
-
Feedback
forms
1, 2 & 3
Delivery of the course
End of the
course
-
Questionnaire
1, 2, 3, 4, 5 Effectiveness of
Delivery of instructions &
Assessment Methods
Students
Course Outcomes:
This course uses assigned readings, lectures, and homework to enable the students to:
1) Apply the concepts of pointers, arrays, structures, strings and file I/O.
2) Design any application based on the concept of stack and recursion.
3) Recognize various types of queues and their operations.
4) Demonstrate and apply different types of lists and their operations.
5) Understand operations on trees and their applications.
Mapping Course Outcomes with Program Outcomes:
Course Outcomes
Apply the concepts of pointers, arrays, structures, strings and
file I/O.
Design any application based on the concept of stack and
recursion.
Recognize various types of queues and their operations.
Demonstrate and apply different types of lists and their
operations.
Understand operations on trees and their applications.
4
Program Outcomes
5 6 7 8 9
10
1
2
3
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
11
12
Semester: 03
Year: 2013-2014
Course Title: Discrete Mathematical Structures
Course Code: CS314
Credits (L:T:P) : 4:0:0
Core/ Elective: Core
Type of course: Lecture
Total Contact Hours: 56 Hrs
Prerequisites:
Nil
Course Objectives:
1. Identify and distinguish between the notion of discrete and continuous mathematical structures.
2. Analyze the basic concepts of set theory and relations.
3. Understand to solve problems using counting techniques and combinatorics in the context of discrete
probability
4. Identify the basic properties of graphs and use these concepts to model simple applications.
5. Learn the concepts groups and group homomorphism.
Course Contents:
Unit 1
Logics and Proofs: The laws of Logic, Logical implication, Rules of inference, Quantifiers, Proofs of theorems.
Unit 2
Sets & Relations: Set operations, laws of set theory, Relations, Properties of relations, Computer Recognition,
Zero-one Matrices and Directed Graphs, Equivalence Relations and Partitions
Unit 3
Relations & Functions: POSETS, Hasse Diagrams, Lattices, Functions: Basic definitions, Inverse functions,
Composition of functions. Combinatorics: Fundamentals of counting, Permutation, Combination, Combination
with repetition, Binomial Coefficient, Principle of inclusion and exclusion, Pigeon hole principle
Unit 4
Graph Theory: Introduction to Graph theory - Definitions, Subgraphs, Complements, Graph isomorphism, Euler’s
trails and circuits, Hamilton paths and Cycles, Planar graphs, Euler’s Theorem, Graph Coloring.
Unit 5
Groups: Definitions, Elementary Properties, Homomorphism, Isomorphism, and cyclic groups, Cosets and
Lagrange’s Theorem.
Text Book:
1. Ralph P. Grimaldi: Discrete and Combinatorial mathematics, 5th Edition, PHI/ Pearson Education, 2012.
Reference Books:
1. Kenneth H. Rosen: Discrete Mathematics and its Applications, 7th Edition, McGraw Hill, 2010.
2. Thomas Koshy: Discrete Mathematics with Applications, Elsevier, 1 st Edition, 2011.
Course Delivery:
The course will be delivered through lectures, class room interaction, group discussion, exercises and self study
cases.
Course Assessment and Evaluation:
What
To Whom
Direct Assessment
method
Internal
Assessment
test
CIE
Students
Max
Marks
Evidence
Collected
30
Blue Books
Twice
20
Contributing to
course outcome
1,2 3,4,5
Quiz answers
1,2,3,4 & 5
Standard
Examination
SEE
Indirect Assessment
Method
Surprise quiz
When/Where
(frequency in the
course)
Thrice (Average of
best two)
Students
feedback
End of
course(Answering 5
out of 10 questions)
Middle of the course
100
Answer scripts
1,2,3,4 &5
-
Feedback forms
Students
End of course
survey
End of course
Questionnaires
1, 2 & 3
Delivery of the
course
1, 2, 3,4,5
Effectiveness of
Delivery of
instructions &
Assessment
Methods
Course Outcomes:
1. Apply logical reasoning to solve a variety of problems.
2. Understand the sets concepts and distinguish different properties relations.
3. Demonstrate the ability to solve problems using counting techniques and combinatorics in the context of
discrete probability.
4. Apply the concept of graph theory and coloring of graph and its application in computer science.
5. Understand the concept of groups and their applications
Mapping Course Outcomes with Program Outcomes:
Course Outcomes
Program Outcomes
Apply logical reasoning to solve a variety of problems
1
X
2
X
3
-
Understand the sets concepts and distinguish different
properties relations.
X
X
X
Demonstrate the ability to solve problems using counting
techniques and combinatorics in the context of discrete
probability.
Apply the concept of graph theory and coloring of graph
and its application in computer science.
Understand the concept of groups and their applications
4
5
X
6
-
7
-
8
-
-
X
-
-
-
X
X
-
X
-
-
X
X
X
X
-
X
-
X
X
X
X
-
X
-
X
X
-
9
10
X
11
-
12
-
Semester: 03
Year: 2013-2014
Course Title: Object Oriented Programming with C++
Course Code: CS315
Credits (L:T:P) : 3:0:0
Core/ Elective: Core
Type of course: Lecture
Total Contact Hours:42 Hrs
Prerequisites:
CS101/201: Fundamentals of Computing
Course Objectives:
The objectives of this course are to:
1. Understand the philosophy of object-oriented design and the concepts of encapsulation, abstraction,
inheritance, and polymorphism.
2. Implement the concept of constructors and destructors.
3. Design and test the implementation among objects using a class hierarchy and inheritance.
4. Identify the relationship between the run time polymorphism and compile time polymorphism.
5. Implement file I/O operations and exception handling mechanisms.
Course Contents:
Unit 1
Introduction: Overview of C++, Sample C++ program, Different data types, operators, expressions, and statements,
arrays and strings, pointers & function components, recursive functions, user-defined types, function overloading,
inline functions.
Classes & Objects – I: classes, Scope resolution operator, passing objects as arguments, returning objects, and
object assignment.
Unit 2
Classes & Objects –II: Constructors, Destructors, friend functions, Parameterized constructors, Static data
members, Functions, Arrays of objects, Pointers to objects, this pointer, and reference parameter Dynamic allocation
of objects, Copy constructors, Operator overloading using friend functions such as +, - , pre-increment, postincrement, [ ] etc., overloading <<, >>, Generic functions and classes.
Unit 3
Inheritance : Base Class, Inheritance and protected members, Protected base class inheritance, Inheriting multiple
base classes, Constructors, Destructors and Inheritance, Passing parameters to base class constructors, Granting
access, Virtual base classes.
Unit 4
Virtual functions, Polymorphism: Virtual function, calling a Virtual function through a base class reference,
Virtual attribute is inherited, Virtual functions are hierarchical, pure virtual functions, Abstract classes, Using virtual
functions, Early and late binding.
Unit 5
I/O System Basics, File I/0: C++ stream classes, Formatted I/O, I/O manipulators, fstream and the File classes, File
operations.
Exception Handling, STL: Exception handling fundamentals, Exception handling options, STL - An overview,
containers, vectors, lists, maps.
Text Book:
1. Herbert Schildt: The Complete Reference C++, 4th Edition, Tata McGraw Hill, 2011.
Reference Books:
1. Stanley B.Lippmann, Josee Lajoie: C++ Primer, 4 th Edition, Addison Wesley, 2012.
2. Paul J Deitel, Harvey M Deitel: C++ for Programmers, Pearson Education, 2009.
3. K R Venugopal, Rajkumar Buyya, T Ravi Shankar: Mastering C++, 1 st edition, Tata McGraw Hill, 2011.
Course Delivery:
The course will be delivered through lectures, class room interaction, group discussion, exercises and self study
cases.
Course Assessment and Evaluation:
Indirect Assessment
Methods
Direct Assessment
Methods
What
CIE
Internal
Assessment
Tests
Quiz
SEE
To Whom
Students
Standard
Examination
Students
Feedback
When/ Where
(Frequency in
the course)
Thrice(Average of
the best two will
be computed)
Max
Marks
Evidence
Collected
Contribution to
Course Outcomes
30
Blue Books
1,2,3,4 & 5
Twice(Addition
of two quiz)
20
Quiz
Answer
Sheets
End of Course
(Answering
5 of 10 questions)
100
Answer
scripts
Middle of the
course
-
Feedback
forms
End of the course
-
Questionnair
e
2,4,5
1,2,3,4 & 5
1, 2, 3
Delivery of the
course
1, 2 ,3,4,5
Effectiveness of
Delivery of
instructions &
Assessment
Methods
Students
End of Course
Survey
Course Outcomes:
At the end of the course students should be able to:
1. Identify classes, objects, members of a class and the relationships among them needed to solve a specific
problem.
2. Create function templates, overload function templates and using function templates with classes.
3. Understand and demonstrate the concept data encapsulation and inheritance
4. Demonstrate the concept of polymorphism with virtual functions.
5. Demonstrate the concept of streams in C++ and various I/O manipulators.
Mapping Course Outcomes with Program Outcomes:
Course Outcomes
1
Identify classes, objects, members of a class and
the relationships among them needed to solve a X
specific problem.
Create function templates, overload function
templates and using function templates with
X
classes
Understand and demonstrate the concept data
X
encapsulation and inheritance
Demonstrate the concept of polymorphism using
X
virtual functions.
Demonstrate the concept of streams in C++ and
x
various I/O manipulators.
2
3
X
-
X
-
X
4
Program Outcomes
5 6
7 8
9
10
11
12
-
-
-
X
-
-
X
-
-
-
X
-
-
-
X
-
-
-
X
-
-
X
-
X
-
-
-
X
-
-
X
-
X
-
-
-
X
-
-
Semester: 03
Year: 2013-2014
Course Title: Programming Laboratory
Course Code: CSL316
Credits (L:T:P) : 0:0:2
Core/ Elective: Core
Type of course: Practical
Total Contact Hours: 28 Hrs
Prerequisites: CS101/201: Fundamentals of Computing
Course Objectives:
This course will help students to achieve the following objectives:
1. Design and apply appropriate data structures for solving computing problems.
2. Develop computer programs to implement different data structures and related algorithms.
3. Design and develop programs based on the principles of object-oriented programming.
4. Apply the concepts of data encapsulation, inheritance, and polymorphism.
Course Contents:
There shall be a minimum of 2 exercises conducted on each of the following topics.
Part A: - Data Structures with C
1. Pointers and Structures.
2. Unions and string manipulation functions.
3. Standard library functions for files.
4. Stack operations, infix to postfix conversion and evaluation of expressions.
5. Queue and linear list operations using arrays.
6. Singly linked lists.
7. Doubly linked lists.
8. Circular linked lists.
9. Circular queue and D-queue.
10. Binary tree traversals.
11. Binary search tree operations.
12. Expression tree construction and evaluation.
Part B: - Object Oriented Programming with C++.
1. Inline functions & function overloading.
2. Classes & objects.
3. Constructors, destructors & static data members.
4. Friend functions & generic functions.
5. Operator overloading.
6. Inheritance - protected members, protected base class inheritance, inheriting multiple base classes.
7. Passing parameters to base class constructors, granting access and virtual base class.
8. Virtual functions and polymorphism.
9. Pure virtual functions and abstract classes.
10. Formatted I/O, I/O manipulators and file operations.
11. Exception handling.
12. STL.
Reference Books:
1. Behrouz A. Forouzan and Richard F. Gilberg: Computer Science- A Structured Programming Approach
Using C, Second Edition, Course Technology, 2009.
2. Aaron M. Tenenbaum, Y.Langsam, M.J.Augenstein: Data Structures Using C, 1 st Edition, Pearson
Education Ltd, 2012.
3.
4.
5.
Richard F. Gilberg and Behrouz A. Forouzan: Data Structures- A Pseudocode Approach with C, 2nd
Edition, Cengage Learning, 2012.
Herbert Schildt: The Complete Reference C++, 4th Edition, Tata McGraw Hill, 2011.
Stanley B.Lippmann, Josee Lajoie: C++ Primer, 4 th Edition, Addison Wesley, 2012.
Topics: General principles of language design: Design goals, Typing regimes, Data structure models, Control
structure models and Abstraction mechanisms.
Part A: - Data Structures with C.
Part B: - Object Oriented Programming with C++.
Direct Assessment
Methods
Course Delivery: The course will be delivered through lectures in the laboratory with exercises.
Course Assessment and Evaluation:
When/ Where
To
Max
Evidence
Contribution to
What
(Frequency
in the
Whom
Marks
Collected
Course Outcomes
course)
Lab Test
1Lab Test
30
Data sheets
1-5
CIE
Students
Viva
SEE
Indirect
Assessment
Method
Record
Lab
Examination
Students
Feedback
End of Course
Survey
Every
Week(Average of
the total score will
be computed)
Every
Week(Average of
the total score will
be computed)
End
of Course
(Executing 2
programs)
Middle of the course
10
Record
1-5
10
Viva Result
Sheets
Recollection Skills
50
Answer
scripts
-
Feedback
forms
-
Questionnaire
Students
End of the course
1-5
Delivery of the
course
Effectiveness of
Delivery of
instructions &
Assessment Methods
Course Outcomes:
This course uses assigned readings, lectures, and homework to enable the students to:
1. Develop well documented programs containing complex data structures.
2. Incorporate complex input/output and file handling techniques.
3. Create classes incorporating object-oriented techniques.
4. Design, implement, test, and debug simple programs in an object-oriented programming language.
5. Use data abstraction, polymorphism, and exception handling.
Mapping Course Outcomes with Program Outcomes:
Course Outcomes
1
2
Develop well documented programs containing
X X
complex data structures
Incorporate complex input/output and file handling
X X
techniques
Create classes incorporating object-oriented
X X
techniques
Design, implement, test, and debug simple
programs in an object-oriented programming
X X
language
Use data abstraction, polymorphism, and exception
X X
handling
Program Outcomes
5 6 7 8 9
3
4
X
X
X
X
X
X
X
XX
X
X
X
X
10
X
X
X
11
12
Semester: 03
Year: 2013-2014
Course Title: Analog & Digital Circuits Laboratory
Course Code: CSL317
Credits (L:T:P) : 0:0:2
Core/ Elective: Core
Type of course: Practical
Total Contact Hours: 28 Hrs
Prerequisites:
The student must have knowledge in Boolean algebra and Basic electronics.
Course Objectives
This course will help students to achieve the ability to:
1. Understand the Input Output characteristics of BJT Transistor to measure the h-parameter and design the
logic circuit for the given function applying simplification techniques..
2. Inspect , identify the kind of feedback circuit, measure the gain, input impedance & output impedance of
such an amplifier and design & implement arithmetic logic circuits
3. Design , implement clipper - clamper Circuits, multivibrators etc and Design & implement combinational
logic circuits
4. Design& implement rectifier circuits, voltage regulators and Design & implement sequential logic
circuits
5. Measure the characteristics of OPAMP like Slew rate, CMRR etc.,design certain applications of OPAMP
like active filters, relaxation oscillators and simulate logic circuits.
Course Contents:
Session
No.
Topic
8.
Measuring of h-parameters using Graphical methods/ Boolean Function Realization using
Basic and Universal Gates
Characterstics of OPAMP/ Arithmetic circuits
Half Wave rectifiers/ Adder –Subtractor unit
Full Wave Rectifiers/ Code Converter Circuits
Clippers/ Decoders
Clampers/ Multiplexers
Relaxation Oscillators/ Simulation of Data Processing circuits
Applications of Operational Amplifier (inverting /non inverting and integrator) / Magnitude
Comparator
9.
10.
11.
12.
13.
14.
Applications of 555 Timer/ flip-flops
Low pass filter/ Shift Registers
High pass Filters/ Simulation of Sequential circuits
DAC(R-2Rladder Network)/ Ring & Johnson counters
Voltage Shunt Feedback Amplifiers/ Synchronous Counters
Voltage Regulators/ Asynchronous Counters
1.
2.
3.
4.
5.
6.
7.
No. of
Hours
2
2
2
2
2
2
2
2
2
2
2
2
Reference Books:
1. Anil K Maini, Varsha Agarwal: Electronic Devices and Circuits, Wiley, First Edition, 2009
2. Stephen Brown, Zvonko Vranesic: Fundamentals of Digital Logic Design with VHDL, Tata McGraw Hill, 3rd
Edition, 2012.
3. Robert L Boylestad, Louis Nashelsky: Electronic devices and circuit theory, 10th edition. 2009
4. Donald P Leach, Albert Paul Malvino & Goutam Saha: Digital Principles and Applications, Tata McGraw Hill,
7th Edition, 2011.
5. Stephen Brown, Zvonko Vranesic: Fundamentals of Digital Logic Design with VHDL, Tata McGraw Hill, 3rd
Edition, 2012.
Course Delivery:
The course will be delivered through lectures in the laboratory with exercises.
Course Assessment and Evaluation:
What
When/ Where
(Frequency in the
course)
Max
Marks
Evidence
Collected
Contribution to
Course
Outcomes
1Lab Test
30
Data sheets
1-5
10
Record
1-5
10
Viva Result
Sheets
End of Course
(Executing 2 programs)
50
Answer scripts
1-5
Middle of the course
-
Feedback
forms
1, 2, 3
Delivery of the
course
Questionnaire
Effectiveness of
Delivery of
instructions &
Assessment
Methods
To
Whom
Direct Assessment
Methods
Lab Test
CIE
Students
Viva
SE
E
Indirect
Assessment
Method
Every Week(Average of
the total score will be
computed)
Every Week(Average of
the total score will be
computed)
Record
Lab
Examination
Students
Feedback
Students
End of Course
Survey
End of the course
-
Recollection
Skills
Course Outcomes:
At the end of the course the students should be able to:
1. Experimental analysis of I/O characterstics of Transistors and Feedback circuits
2. Design and implementation of Clipper and Clamper Circuits, Multivibrator Circuits, Rectifier Circuits,
voltage Regulators
3. Design and Implementation of Various applications of OPAMPs
4. Design, implement and analyse of combinational and sequential logic circuits.
5. Simulation and analysis of logic circuits in VHDL using Modelsim
Mapping Course Outcomes with Program Outcomes:
Course OutComes
Experimental analysis of I/O
characteristics of Transistors
and
Feedback
circuit
Design
and implementation
of Clipper and Clamper
Circuits,
Multivibrator
Circuits,
Rectifier
Circuits,
Design and Implementation
voltage
regulators
of
Various
applications of
OPAMPs
Design, implementation and
analysis of combinational and
sequential logic circuits.
Simulation and analysis of
logic circuits in VHDL using
Modelsim.
PO3
PO4
Program Outcomes
PO5 PO6 PO7 PO8
PO1
PO2
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
PO9
P10
X
P11
P12
Semester: 4
Year: 2013-2014
Course Title: Engineering Mathematics - IV
Course Code: CSMAT401
Credits (L:T:P) : 4:0:0
Core/ Elective: Core
Type of course: Lecture
Total Contact Hours: 56 Hrs
Prerequisites: Nil
Course Objectives:
The students will
1. Learn to solve algebraic and transcendental equations numerically.
2. Learn fitting a curve, correlation, regression for a statistical data.
3. Learn the basic concepts of probability and Random variables.
4. Learn the concepts of probability distributions.
5. Construct the various tests essentially needed for the testing of small samples for testing for different
attributes.
6. Learn the concepts of stochastic process and queuing theory.
Course Contents:
Unit 1
Numerical Solution of Algebraic and Transcendental equations: Method of false position, Newton-Raphson
method.
Statistics: Curve fitting by the method of least squares, Fitting a Linear curve, Quadratic curve, Geometric curve,
Correlation and Regression.
Unit 2
Theory of Probability: Classical and axiomatic definition of probability, Addition law, Conditional probability,
Multiplication law, Baye’s theorem.
Random Variables: Discrete, Continuous, Mathematical expectation, Variance, Moment Generating Function
(MGF).
Unit 3
Probability Distribution: Binomial, Negative Binomial, Poisson, Geometric, Exponential, Gamma and Normal
distribution.
Joint probability distribution: Concept of joint probability distribution, Discrete random variables, Independent
random variables, Problems on expectation and variance.
Unit 4
Sampling Theory : Sampling, Sampling distributions, Standard error, Central limit theorem, Test of Hypothesis for
means, Confidence limits for means, Student’s t-distribution, F-distribution, Chi-Square distribution as a test of
goodness of fit.
Unit 5
Markov Chain: Introduction, Classification of stochastic process, Probability vectors, Stochastic matrices,
Fixed points, Regular stochastic matrices, Markov chains, Discrete Time Markov chains, Computation of
n-step Transition Probabilities, States classification and l imiting Probabilities.
Queuing theory: Introduction, Concepts and M/G/1 and M/M/1 queuing systems with numerical illustration.
Text Books :
1. B.S.Grewal - Higher Engineering Mathematics - Khanna Publishers - 40th edition-2007.
2. R.E. Walpole, R. H. Myers, R. S. L. Myers and K. Ye – Probability and Statistics for Engineers and
Scientists – Pearson Education – Delhi – 8th edition – 2007.
Reference Books :
1.
2.
3.
Murray R Spiegel, John Schiller & R. Alu Srinivasan – Probability and Statistics – Schaum’s outlines –
2ndedition –2007.
Erwin Kreyszig - Advanced Engineering Mathematics-Wiley-India publishers- Abridged edition-2008.
Kishor S. Trivedi – Probability & Statistics with reliability, Queuing and Computer Science Applications –
PHI – 2nd edition – 2002.
Course Outcomes:
The students are expected to do the following:
1. Will be able to solve the problems of algebraic and transcendental equations using numerical methods.
2. Fit a suitable curve for tabulated values by the method of least squares.
3. Will be able to solve problems on probability of practical importance.
4. Express the probability distribution arising in the study of engineering problems and their applications.
5. Using the concepts of sampling student will be able to take decision about the hypothesis.
6. Will be able to apply the stochastic process and Markov Chain in prediction of future events.
7. Calculate the various parameters of the queuing models.
Semester:
4
Year: 2013-2014
Course Title: Theory of Computation
Course Code: CS411
Credits (L:T:P) : 3:1:0
Core/ Elective: Core
Type of course: Lecture, Tutorial
Total Contact Hours: 56
Prerequisites: NIL
Course Objectives:
At the end of the course the students will be able to:
1. To classify machines by their power to recognize languages
2. Employ finite state machines to solve problems in computing.
3. Design deterministic and non-deterministic machines.
4. Design grammars and recognizers for different formal languages
5. To recognize the decidability of language which are not regular.
Course Contents:
Unit 1
Introduction to Finite Automata: The central concepts of Automata theory; Deterministic finite automata;
Nondeterministic finite automata. An application of finite automata, Finite automata with Epsilon transitions.
Unit 2
Regular Expressions: Finite Automata and Regular Expressions Applications of Regular Expressions. Regular
languages; Proving languages not to be regular languages; Closure properties of regular languages; Decision
properties of regular languages; Equivalence and minimization of automata.
Unit 3
Context–free grammars: Parse trees; Applications; Ambiguity in grammars and Languages. Definition of the
Pushdown automata; the languages of a PDA; Equivalence of PDA’s and CFG’s..
Unit 4
Deterministic Pushdown Automata: Normal forms for CFGs; The pumping lemma for CFGs; Closure properties
of CFLs. Problems that Computers cannot solve.
Unit 5
The Turing machine: Programming techniques for Turing Machines. Undecidability, A Language that is not
recursively enumerable; An Undecidable problem that is RE; Post’s Correspondence problem..
Text Book:
1. John E. Hopcroft, Rajeev Motwani, Jeffrey D.Ullman: Introduction to Automata Theory, Languages and
Computation, 3rd Edition, Pearson Education, 2011.
Reference Books:
1. John C Martin: Introduction to Languages and Automata Theory, 3rd Edition, Tata McGraw-Hill, 2007.
2. Daniel I.A. Cohen: Introduction to Computer Theory, 2nd Edition, John Wiley & Sons, 2009.
3. Thomas A. Sudkamp: An Introduction to the Theory of Computer Science, Languages and Machines, 3rd
Edition,Pearson Education, 2006
Course Delivery:
The course will be delivered through lectures, class room interaction, group discussion and exercises and self-study
cases.
Course Assessment and Evaluation:
Indirect Assessment
Methods
Direct Assessment
Methods
What
CIE
Internal
Assessment
Tests
Surprise Quiz
SEE
To
Whom
When/ Where
(Frequency in
the course)
Thrice(Average
of the best two
will be
computed)
Max
Marks
Evidence
Collected
Contribution to
Course
Outcomes
30
Blue
Books
1,2 3,4,5
Twice
20
Quiz
Answers
1,2,3,4 & 5
End of Course
(Answering
5 of 10
questions)
100
Answer
scripts
1,2,3,4 &5
Middle of the
course
-
Feedback
forms
End of the
course
-
Questionn
aire
Students
Standard
Examination
Students
Feedback
Students
End of Course
Survey
1,2&3
Delivery of the
course
1,2,3,4, &5
Effectiveness of
Delivery of
instructions &
Assessment
Methods
Course outcomes:
At the end of the course the students will be able to:
1. Understand fundamental concepts of theory of computation.
2. To classify machines by their power to recognize languages
3. Employ finite state machines and regular analyzers to solve problems in computing
4. Prove or disprove theorems in automata theory using its properties and conversion theorems
5. Determine the decidability and intractability of computational problems.
Mapping Course Outcomes with program Outcomes:
Course Outcomes
Understand fundamental concepts of theory of computation.
To classify machines by their power to recognize languages
Employ finite state machines, regular analyzers and design
grammars to solve problems in computing
Prove or disprove theorems in automata theory using its
properties and conversion theorems
Determine the decidability and intractability of computational
problems
Program Outcomes
1
X
X
2
3
4
-
5
X
X
6
-
7
-
8
-
9
-
10
X
X
11
-
12
-
X
X
X
X
-
X
-
-
-
-
X
-
-
X
X
-
X
-
-
x
-
X
-
-
X
X
-
X
-
-
X
-
X
-
-
Semester: 4
Year: 2013-2014
Course Title: Computer Organization
Course Code: CS412
Credits (L:T:P:S) : 4:0:0
Core/ Elective: Core
Type of course: Lecture
Total Contact Hours: 56 Hrs
Prerequisites: NIL
Course Objective:
The objective of this course is to make the students to
1. Understanding of the basic structure and operation of a digital computer.
2. Learn in detail the operation of the arithmetic unit including the algorithms & implementation of fixedpoint and floating-point addition, subtraction, multiplication & division.
3. Analyze about register-transfer-level to implement instruction fetching and execution in a processor
which includes processor implementation by both hardwired and microprogrammed control unit.
4. Understand semiconductor memories, cache memory and virtual memory.
5. Understand the basics concepts of I/O data transfer synchronization, which includes complex I/O
structures, interrupts and direct memory access with the PCI, SCSI and USB standards.
Course Contents:
Unit 1
Functional units, bus structures, performance, Overflow in integer arithmetic: Arithmetic, Memory locations
and addresses, Memory operations, instructions and instruction sequencing, Addressing modes, Subroutines and use
of stack frames, Encoding of machine instructions.
Unit 2
Arithmetic unit: Multiplication of two numbers, A signed operand multiplication, Booth algorithm, Bit pair
recoding and CSA – integer division, IEEE standard for floating point numbers, Operations, Guard bits and
truncation.
Unit 3
Processing unit: Fundamental concepts, execution of complete instruction, Multiple bus organization, hardwired
control, Micro programmed control, Pipelining: Basic concepts, Role of cache memory, pipelining performance.
Unit 4
Memory System: Basic concepts, static memories, Asynchronous and synchronous Dynamic RAM memories,
Memory system design, Read only memories, speed, size, cost, cache memories, Performance considerations,
Virtual memories.
Unit 5
I/O organization: Accessing I/O devices, Vectored and nested interrupts, DMA –bus arbitration, Synchronous and
asynchronous bus transfers, Parallel and serial interface circuits, USB.
Text Book:
1. Carl Hamacher, Z vranesic & S Zaky, Computer Organisation, 5th edition 2007
Reference Books:
1. William Stallings Computer Organization and Architecture, 7 th Edition 2007
2. Morris Mano Computer System Architecture, 3rd Edition
3. L .L Wear Computer An Introduction to hardware and software design
4. V.Rajaraman, T.Radhakrishnan Computer Organization and Architecture 2nd edition 2007
Course Delivery:
The course will be delivered through lectures, class room interaction, exercises and self-study cases.
Course Assessment and Evaluation:
To
Whom
Indirect Assessment
Methods
Direct
Assessment
Methods
What
CIE
Internal
Assessment Tests
Surprise Quiz
SEE
Students
Standard
Examination
When/ Where
(Frequency in
the course)
Thrice(Average of
the best two will
be computed)
Twice
End of Course
(Answering
5 of 10 questions)
Max
Marks
Evidence
Collected
Contribution to
Course Outcomes
30
Blue Books
1, 2, 3, 4 and 5
20
Quiz Answers
1,2,4
100
Answer
scripts
1,2,3,4 &5
Middle of the
course
-
Feedback
forms
End of the course
-
Questionnaire
Students
Feedback
1,2&3
Delivery of the
course
1,2,3,4, &5
Effectiveness of
Delivery of
instructions &
Assessment
Methods
Students
End of Course
Survey
Course Outcomes:
At the end of this course the students will be able to:
1. Understand the basic structure of a digital computer.
2. Perform arithmetic operations on binary number system.
3. Recognize the organization of the Control unit and also to write the control sequences for different instructions
using single bus and multiple bus organization.
4. Recognize the memory unit including SRAM, DRAM , cache mapping techniques and basics of virtual memory
5. Analyze I/O unit including interrupts, synchronous/Asynchronous bus and also commercial bus standards, in
particular PCI, SCSI and USB standards.
Mapping Course Outcomes with Program Outcomes:
Course Outcomes
Understand the basic structure of a digital computer.
Perform arithmetic operations on binary number system.
Recognize the organization of the Control unit and also to
write the control sequences for different instructions using
single bus and multiple bus organization.
Recognize the memory unit including SRAM, DRAM ,
cache mapping techniques and basics of virtual memory
Analyze I/O unit including interrupts, synchronous /
Asynchronous bus and also commercial bus standards, in
particular PCI,SCSI and USB standards.
Program Outcomes
1
X
X
2
-
3
-
X
-
X
X
4
5
7
-
8
-
9
X
6
-
-
10
X
X
11
12
-
-
X
-
-
-
-
X
-
-
-
X
-
-
X
-
X
-
-
-
X
-
-
x
-
X
-
Semester: 4
Year: 2013-2014
Course Title: Design and Analysis of Algorithms
Course Code: CS413
Credits (L:T:P) : 4:0:0
Core/ Elective: Core
Type of course: Lecture
Total Contact Hours:56
Prerequisites:
Knowledge of Data Structures and any one programming language.
Course Objectives:
This course will help students to achieve the following objectives:
1. Present fundamental concepts for algorithm design and provide necessary background for writing
algorithms in a formal way.
2. Identify, for a certain problem, adequate algorithm design strategies.
3. Present fundamental concepts and techniques for complexity analysis of algorithms.
4. Design, implement and test an appropriate algorithm for different application problems.
5. Analyze the efficiency of different algorithms for the same problem and classify them according to their
complexity
Course Contents:
Unit 1
Introduction: What is an algorithm?, Fundamentals of algorithmic problem solving, Important problem types,
Fundamental data structures, Fundamentals of the analysis of algorithm efficiency – Analysis framework,
Asymptotic notations and basic efficiency classes, Mathematical analysis of recursive and non recursive algorithms,
Empirical analysis of algorithms, Brute force – selection sort and bubble sort, Sequential search and brute-force
string matching.
Unit 2
Divide and conquer: Mergesort, Quicksort, Binary search, Binary tree traversals and related properties, Decrease
and conquer – insertion sort, depth-first and breadth-first search, Topological sorting.
Unit 3
Transform and conquer: Presorting, Balanced search trees, Heap and Heap sort, Space and time tradeoffs – sorting
by counting, Input enhancement in string matching, Hashing, B-trees.
Unit 4
Dynamic programming: Warshall’s and Floyd’s algorithms, the knapsack problem and memory functions, Greedy
technique – Prim’s algorithm, Kruskal’s algorithm, Dijkstra’s algorithm, Huffman’s trees.
Unit 5
Limitations of algorithmic power: Lower-bound arguments, Decision trees, P,NP, and NP-complete problems,
Challenges of numerical algorithms, Coping with the limitations of algorithm power – Backtracking, Branch and
bound, Approximation algorithms for NP-hard problems, Algorithms for solving nonlinear equations.
Text Books:
1. Anany Levitin: Introduction to the Design and Analysis of Algorithms, 2 nd edition, Pearson Education,
2009.
2. Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest, Clifford Stein: Introduction to Algorithms, 3rd
edition, PHI, 2011.
Reference Books :
1. E Horowitz, S Sahni, S Rajsekaran: Fundamentals of Computer Algorithms, 1 st Edition, Galgotia
Publication, 2012.
2. Richard Neopolitan, Kumarss Naimipour: Foundations of Algorithms using C++ pseudocode, 4th Edition,
Jones & Bartlett India, 2011.
3. Sara Baase and Allen van Gelder: Computer algorithms - Introduction to Design and Analysis, 3rd Edition,
Pearson Education, 2011.
Course Delivery:
The course will be delivered through lectures, class room interaction, group discussion and exercises and self-study
cases.
Course Assessment and Evaluation:
Indirect
Assessment
Methods
Direct Assessment Methods
What
To Whom
Internal
Assessment Tests
CIE
Surprise Quiz
SEE
When/ Where
(Frequency in
the course)
Thrice
(Average of
the best two
will be
computed)
Max
Mark
s
Evidence
Collected
Contribution to Course
Outcomes
30
Blue Books
1,2,3,4 &5
Twice
20
Quiz Answers
1,2,3,4 &5
End of Course
(Answering
5 of 10
questions)
100
Answer scripts
1,2,3,4 &5
Middle of the
course
-
Feedback
forms
1,2 & 3
Delivery of the course
Students
Standard
Examination
Students
Feedback
1,2,3,4, & 5
Effectiveness of Delivery
Questionnaire
of instructions &
Assessment Methods
Questions for CIE and SEE will be designed to evaluate the various educational components (Bloom’s taxonomy)
Students
End of Course
Survey
End of the
course
Course Outcomes:
This course uses assigned readings, lectures, and homework to enable the students to:
1. Explain the basic concepts of time and space complexity and various design strategies.
2. Describe the methodologies of how to analyze an algorithm based on divide and conquer, decrease and
conquer strategies.
3. Identify the complexity in the transform and conquer strategy and the input enhancement methods.
4. Apply and solve the ideas designed by dynamic programming and greedy techniques.
5. Formulate the time-complexity analysis for an algorithm and analyze the branch and bound approximation
algorithms.
Mapping Course Outcomes with Program Outcomes:
Course Outcomes
Explain the basic concepts of time and space
complexity and various design strategies
Describe the methodologies of how to analyze an
algorithm based on divide and conquer, decrease
and conquer strategies
Identify the complexity in the transform and
conquer strategy and the input enhancement
methods
Apply and solve the ideas designed by dynamic
programming and greedy techniques.
Formulate the time-complexity analysis for an
algorithm and analyze the branch and bound
approximation algorithms.
1
2
X
3
4
Program Outcomes
5
6
7
8
9
10
11
12
-
X
-
-
-
-
-
-
X
X
-
-
X
X
-
X
X
X
X
X
X
X
X
X
X
X
X
X
-
X
-
-
X
X
X
X
-
-
X
-
-
Semester: 4
Year: 2012-2013
Course Title: Introduction to Microprocessors
Course Code: CS414
Credits (L:T:P) : 4:0:0
Core/ Elective: Core
Type of course: Lecture
Total Contact Hours:56 Hrs
Prerequisites:
Nil
Course Objectives:
The objectives of this course are to:
1. Understand the internal architecture of microprocessor and the addressing modes used for the
instruction in designing a processor.
2. Design a processor to perform operations using assembly level language.
3. Understand the hardware specification of various processors and demonstrate the basic understanding
of operation between the microprocessor and memory device.
4. Provide the fundamental understanding of interfacing I/O devices using peripheral devices to
microprocessors.
5. Provide the interrupt structure and operations of Intel family, also the DMA technique.
Course Contents:
Unit 1
The Microprocessor and its Architecture: Internal Microprocessor Architecture, Real Mode Memory Addressing,
Introduction to Protected Mode Memory Addressing, Memory Paging, Flat Mode Memory, Addressing Modes, Data
Movement Instructions.
Unit 2
Arithmetic and Logic Instructions: Program Control Instructions, Simple Assembly Language Programs. Using
Assembly Language with C/C++: Using Assembly Language with C++ for 16-Bit DOS Applications. Programming
the Microprocessor: Modular Programming, Using the Keyboard and Video Display, Data Conversions, Example
Programs
Unit 3
8086 Hardware Specifications: Pin-Outs and the Pin Functions, Clock Generator, Bus Timings, Ready and Wait,
8288 Bus Controller, Memory and IO interfacing – static memory interfacing, introduction to dynamic memory
interfacing.
Unit 4
Basic I/O Interface: Introduction to I/O Interface, I/O Port Address Decoding, The Programmable Peripheral
Interface, ADC/DAC Converters
Unit 5
Interrupts: Basic Interrupt Processing, Hard Interrupts, Interrupt Examples. Direct Memory Access and DMAControlled I/O: Basic DMA Operation ,The 8237 DMA Controller.
Text Book:
1. Barry B Brey: The Intel Microprocessors-Architecture, Programming and Interfacing, Eighth Edition, Pearson
Education, 2009.
References:
1. A.K Ray, K.M.Bhurchandi : Advanced Microprocessors and Peripherals, 2nd edition, TMH, 2004
2. Uffen Beck: 8086:Architecture and Interfacing, 2 nd edition, John Wiley, 2005.
3. Internet Resources for Intel Multi Core and ARM Processors.
Course Delivery:
The course will be delivered through lectures, class room interaction, group discussion and exercises and self-study
cases.
Course Assessment and Evaluation:
What
When/ Where
(Frequency in the
course)
Thrice (Average of
the best two will be
computed)
Max
Marks
Evidence
Collected
Contribution to
Course
Outcomes
30
Blue Books
1,2 3,4,5
Quiz 1
Quiz 2
20
Quizzes are
conducted
online and the
scores are
recorded
1,2,3,4 & 5
End of Course
(Answering
5 of 10 questions)
100
Answer
scripts
1,2,3,4 &5
Middle of the course
-
Feedback
forms
End of the course
-
Questionnaire
To
Whom
Direct
Assessment Methods
Internal
Assessment Tests
CIE
Indirect
Assessment
Methods
SEE
Implementation of
Interfacing
Techniques
Students
Semester End
Examination
Students
Feedback
1, 2 & 3
Delivery of the
course
1, 2, 3,4,5
Effectiveness of
Delivery of
instructions &
Assessment
Methods
Students
End of Course
Survey
Course Outcomes:
At the end of the course students should be able to:
1.
2.
3.
4.
5.
Demonstrate the architecture and design of different microprocessor.
Apply and design individual components of microprocessors in real time applications.
Identify and differentiate the hardware specifications of different processor and, demonstrate the process
between the processor and various memory devices.
Design a interfacing between the I/O devices and microprocessors using peripheral devices
microprocessors.
Understand the significance of interrupts in designing a processor.
Mapping Course Outcomes with Program Outcomes:
Course Outcomes
Demonstrate the architecture and design of different
microprocessor.
Apply and design individual components of microprocessors
in real time applications.
Identify and differentiate the hardware specifications of
different processor and, demonstrate the process between the
processor and various memory devices.
Design a interfacing between the I/O devices and
microprocessors using peripheral devices microprocessors.
Understand the significance of interrupts in designing a
processor.
Program Outcomes
1
2
3
4
5
6
7
8
9
10
11
12
X
X
X
-
X
-
-
-
-
X
-
-
X
X
X
-
X
-
-
-
-
X
X
-
X
X
X
X
-
-
-
-
X
-
-
X
X
X
-
X
-
-
-
-
-
X
-
X
X
X
-
X
-
-
X
-
-
Semester: 4
Year: 2013-2014
Course Title: Data Communication
Course Code: CS415
Credits (L:T:P) : 4:0:0
Core : Core
Type of Course: Lecture
Total Contact Hours: 56 Hrs
Prerequisites: Nil
Course Objectives:
At the end of the course students should be able to:
1. Identify the components of a data communication system, factors which impact performance of data
communication systems and solve numerical examples related to these.
2. Understand & Analyze Analog to Digital conversions and vice versa, Multiplexing and various types of
transmission media used in computer networks and methods to optimize utilization of their capacities.
3. Understand the different types of circuit switched Networks and discuss various error detection and correction
techniques employed in data link layer
4. Analyze the various ARQ protocols, frame construction protocols like HDLC, PPP and also the multiple access
protocols employed by Data link layer.
5. Understand the structure of 802.3 and 803.11 protocols along with associated headers and algorithms used and
also learn about the connecting devices.
Course Contents:
Unit 1
Data Communications, Networks, The Internet, Protocols and standards, Network Models - Reference models OSI ,
Reference models OSI (Contd.) TCP/IP Model, Addressing, Data & Signal - Analog and Digital, Transmission
impairment, Date Rate Limits, Performance, Digital Transmissions – Digital Conversions, Analog Conversions,
Transmission Modes, Multiplexing
Unit 2
Transmission Media & Switching Guided Media – Twisted pair cable, Co-axial cable, Fiber optic Cable, Unguided
media – Wireless – Radio waves, Microwaves, Infrared, Circuit switched networks, Datagram networks, virtual
circuit networks, Structure of a switch – Structure of Circuit Switches & Packet Switches, Types of Errors,
redundancy, Detection VS Correction, Forward error Correction VS Retransmission, Block Coding - Error detection
and correction, Hamming Distance, Minimum Hamming Distance, Linear Block Codes, Cyclic Codes – CRC,
Polynomials, Checksum
Unit 3
Data Link Layer: Data Link Control – Framing, Flow and error control, protocols, Noiseless Channels – Simplest
protocol, Noiseless Channels – Stop and wait protocol, Noisy Channel – Stop and wait Automatic Repeat Request,
Go- back N Automatic Repeat Request, Selective Repeat, Automatic Repeat Request, piggybacking, HDLC –
Configurations and Transfer Modes, Frames, Point to Point Protocols – Framing, Transition phases, Multiplexing
Unit 4
Multiple Access and Wired LANs-Random access – Aloha, CSMA, CSMA/CD,CSMA/CA, Controlled access –
reservation, polling, token passing, Channelization – FDMA, TDMA, CDMA, IEEE standards – Data link and
Physical Layer, Standard Ethernet – MAC sublayer, Standard Ethernet – physical layer, Bridged Ethernet, Switched
Ethernet, Full duplex Ethernet, Fast Ethernet, Gigabit Ethernet
Unit 5
Wireless LANs, Connecting LANs and Virtual LANs IEEE 802.11- Architecture, MAC sub layer, Addressing
Mechanisms and physical layer, Bluetooth – Architecture, Bluetooth layers, Connecting Devices – Hub, Repeater,
Bridges, Bridges, Switches, Router, Gateway, Backbone Networks – Bus, Star, Connecting Remote LANs, Virtual
LANs
Text Book:
1. Data Communication and Networking, Behrouz A.Forouzan, McGraw Hill, 4th Edition, 2008.
Reference Books:
1. Data and Computer Communication, William Stallings, 8th Edition, Pearson Education, 2007.
2. Introduction to Data Communications and Networking – Wayne Tomasi, Pearson Education, 2005.
3. Communication Networks-Fundamental Concepts and key architectures, Alberto Leon-Garcia and Indra
Widjaja, Tata Mc-Graw-Hill 2nd Edition, Pearson Education, 2005.
Course Delivery:
The Course will be delivered through classroom teaching, interactions with the students, discussing interesting
electronic systems in the class room where the subsystems are being used.
Course Assessment and Evaluation:
Indirect
Assessment
Methods
Direct Assessment
Methods
What
To
Whom
Internal
Assessment Tests
CIE
Class-room
Surprise Quiz
SEE
Student
s
Standard
Examination
Students
Feedback
End of Course Survey
Student
s
When/ Where
(Frequency in the
course)
Thrice(Average of
the best two will be
computed)
Twice(Summation of
the two will be
computed)
End of Course
(Answering
5 of 10 questions)
Max
Marks
Evidence
Collected
Contribution to Course
Outcomes
30
Blue
Books
1,2 3,4,5
20
Quiz
papers
1,2,3,4 & 5
100
Answer
scripts
1,2,3,4 &5
Middle of the course
-
Feedback
forms
End of the course
-
Questionn
aire
1, 2 & 3
Delivery of the course
1, 2, 3,4,5 Effectiveness
of Delivery of
instructions &
Assessment Methods
Course Outcomes:
At the end of the course, the students will be able to:
1. Identify and recognize the ISO OSI and TCP models and the layers associated functionalities.
2. Understand and analyze the types of digital transmissions and also know in detail about the types of
transmission media.
3. Recognize the different types of networks and learn to solve problems in Error detection and corrections
carried at data link layer.
4. Design algorithms for the different ARQ protocols and also able to know the detailed frame format of
HDLC and PPP.
5. Recognize the different types of Ethernet and get to understand the architecture of different types of
wireless networks.
Mapping Course Outcomes with Program Outcomes:
Program Outcomes
Course Outcomes
1
2
3
4
5
6
7
8
9 10 11
Identify and recognize the ISO OSI and TCP models
and the layers associated functionalities.
Understand and analyze the types of digital
transmissions and also know in detail about the types of
transmission media.
Recognize the different types of networks and learn to
solve problems in Error detection and corrections
carried at data link layer.
Design algorithms for the different ARQ protocols and
also able to know the detailed frame format of HDLC
and PPP.
Recognize the different types of Ethernet and get to
understand the architecture of different types of wireless
networks.
X
-
X
X
-
X
X
X
X
X
X
X
X
-
-
X
-
-
X
X
-
-
X
-
-
12
-
-
X
-
-
X
-
-
-
-
X
-
-
-
-
X
X
-
-
Semester: 4
Year: 2013-2014
Course Title: Algorithms Laboratory
Course Code: CSL413
Credits (L:T:P) : 0:0:1
Core/ Elective: Core
Type of course: Practical
Total Contact Hours:28 Hrs
Prerequisites:
Knowledge of Data Structures and any one programming language.
Course Objectives:
This course will help students to achieve the following objectives:
1. Implement the most common quadratic and O (NlogN) sorting algorithms.
2. Design and implement an appropriate hashing function for an application.
3. Design and implement a collision-resolution algorithm for a hash table.
4. Discuss factors other than computational efficiency that influence the choice of algorithms, such as
programming time, maintainability, and the use of application-specific patterns in the input data.
5. Solve problems using the fundamental graph algorithms, including depth-first and breadth-first search,
single source and all-pairs shortest paths, transitive closure, topological sort, and at least one minimum
spanning tree algorithm.
Course Contents:
Note: Student is required to solve minimum of 2 exercises. The questions are allotted based on lots. Both questions
carry equal marks.
Implement the following concepts using C and evaluate the time complexity for algorithms
1. Brute Force techniques
2. String Matching Algorithms.
3. Divide and Conquer Techniques.
4. Decrease and Conquer Techniques.
5. Input enhancement methods in string matching.
6. Open and closed Hashing.
7. Transform and Conquer Techniques
8. Dynamic Programming and Greedy Algorithms
9. Backtracking and Branch and Bound Techniques
Reference Books:
1. Anany Levitin: Introduction to the Design and Analysis of Algorithms, 2nd edition, Pearson education,
2009.
2. Thomas H. Cormen, Charles E. Leiserson, Ronal L. Rivest, Clifford Stein: Introduction to Algorithms, 3rd
edition, PHI, 2011.
3. E Horowitz, S Sahni, S Rajsekaran: Fundamentals of Computer Algorithms, 1 st edition, Galgotia
Publication Pvt. Ltd., 2012.
4. Richard Neopolitan, Kumarss Naimipour: Foundations of Algorithms Using C++ Pseudocode, Second
Edition, Jones & Bartlett India, 2011.
Course Delivery:
The course will be delivered through algorithmic concepts to confirm the learnt concepts by simulating some simple
exercises.
Course Assessment and Evaluation:
Indirect
Assessment
Methods
Direct Assessment
Methods
What
CIE
Internal
Assessment Tests
Surprise Quiz
SEE
To
Whom
Students
Standard
Examination
When/ Where
(Frequency in
the course)
Thrice(Average
of the best two
will be
computed)
Twice
End of Course
(Answering
5 of 10
questions)
Students
Feedback
Max
Marks
Evidence
Collected
Contribution to
Course Outcomes
30
Blue Books
1,2,3,4 & 5
20
Quiz Answers
1,2,3,4 & 5
50
Answer scripts
1,2,3,4 &5
Middle of the
course
-
Feedback
forms
End of the
course
-
Questionnaire
Students
End of Course
Survey
1, 2 & 3
Delivery of the
course
1, 2, 3,4,5
Effectiveness of
Delivery of
instructions &
Assessment Methods
Course Outcomes:
This course uses assigned readings, lectures, and homework to enable the students to:
1. Distinguish between the basic concepts of time and space complexity and various design strategies
2. Apply the methodologies of Brute force and Divide and conquer and evaluate the complexity.
3. Solve a problem using Transform and conquer algorithms and evaluate its correctness.
4. Formulate the time-complexity analysis for Dynamic programming and greedy techniques.
5. Apply, analyze and Design Branch and Bound techniques.
Mapping Course Outcomes with Program Outcomes:
Course Outcomes
Distinguish between the basic concepts of time
and space complexity and various design
strategies
Apply the methodologies of Brute force and
Divide and conquer and evaluate the
complexity.
Solve a problem using Transform and conquer
algorithms and evaluate its correctness.
Formulate the time-complexity analysis for
Dynamic programming and greedy techniques.
Apply, Analyze and Design Branch and Bound
techniques
1
2
3
X
4
Program Outcomes
5
6
7
8
X
9
10
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
X
11
12
Semester: 4
Year: 2013- 2014
Course Title: Microprocessors Laboratory
Course Code: CSL414
Credits (L:T:P) : 0:0:1
Core/ Elective: Core
Type of course: Practical
Total Contact Hours:28 Hrs
Prerequisites: Nil
Course Objectives:
The objectives of this course are to:
1. Present the method to write, execute the assembly level language programs using MASM environment.
2. Design the programs for real time applications.
3. Provide the details of the hardware specification of 8086 and use them in programming.
4. Present the method and design for interfacing the processor with other peripheral devices.
5. Identify the different interrupts and their significance in designing a processor.
Course Content:
There shall be a minimum of 2 exercises conducted on each of the following topics:
1. Computing GCD
2. Computing LCM
3. Searching Methods
4. Sorting Methods
5. Usage of DOS and BIOS interrupts
6. String instructions usage
7. Stack programming
8. Interfacing exercises with
a. Logical Controller
b. Stepper Motor
c. Display
d. Keypad
e. DAC
Reference Books:
1. Barry B Brey: The Intel Microprocessors-Architecture, Programming and Interfacing, Eighth Edition,
Pearson Education, 2009.
2. A.K Ray, K.M.Bhurchandi: Advanced Microprocessors and Peripherals, TMH, 2004.
3. Barry B Brey: Microprocessors – Architecture and Interfacing, Pearson, 5e, 2006.
4. Uffen Beck: 8086: Architecture and Interfacing, John Wiley, 2005.
5. Internet Resources for Intel Multi Core and ARM Processors
Course Delivery:
The course will be delivered through assembly level language programming to confirm the learnt concepts by
simulating some simple exercises.
Course Assessment and Evaluation:
Indirect
Assessment
Methods
Direct
Assessment
Methods
What
C
I
E
S
E
E
To Whom
Internal
Assessment
Tests
Max
Mark
s
Evidence
Collected
Contribution to Course
Outcomes
50
Datasheets
1,2,3,4 & 5
End of Course
(Answering
2 questions )
50
Answer
scripts
1,2,3,4 & 5
Middle of the
course
-
Feedback
forms
End of the course
-
Questionnaire
Twice
Students
Standard
Examination
Students
Feedback
End of Course
Survey
When/ Where
(Frequency in
the course)
Students
1, 2 & 3
Delivery of the course
1, 2, 3,4,5
Effectiveness of Delivery
of instructions &
Assessment Methods
Course Outcomes:
At the end of the course students should be able to:
1. Identify and write the basic programs addition, subtraction, swapping, GCD, LCM in 8086.
2. Demonstrate sorting techniques, searching techniques in 8086
3. Recognize and execute programs using stack.
4. Classify and interface 8086 and Logical Controller, Stepper Motor, Display, Keypad, DAC.
5. Understand the significance of interrupts ion designing a processor
Mapping Course Outcomes with Program Outcomes:
Course Learning Objectives
Identify and write the basic programs addition,
subtraction, swapping, GCD, LCM in 8086.
Demonstrate
sorting
techniques,
searching
techniques in 8086
Recognize and execute programs using stack.
Classify and interface 8086 and Logical Controller,
Stepper Motor, Display, Keypad, DAC.
Understand the significance of interrupts ion
designing a processor
1
2
X
Program Outcomes
5
6 7
8 9
3
4
10
11
12
X
-
-
X
-
-
-
-
X
X
X
X
-
X
-
-
-
-
X
-
-
X
X
X
-
X
-
-
-
-
X
-
-
X
X
X
-
X
-
-
-
-
X
X
-
X
X
X
-
X
-
-
X
X
-
-
-