Csis 3 Syll

ENGINEERING MATHEMATICS-III
[As per Choice Based Credit System (CBCS) scheme]

(Effective from the academic year 2015 -2016)
SEMESTER - III
IA Marks
15MAT31
Subject Code
20
Number of Lecture Hours/Week
04
Exam Marks
80
Total Number of Lecture Hours
50
Exam Hours
03
CREDITS - 04
Course objectives: This course will enable students to
Module -1
Understand and use of analytical and numerical methods in different engineering fields
Understand and apply Fourier Series
Understand and use of Fourier transforms and Z-Transforms
Use of statistical methods in curve fitting applications
Use of numerical methods to solve algebraic and transcendental equations, vector integration and
calculus of variation
Teaching
RBT
Hours
Levels
Fourier Series: Periodic functions, Dirichlets condition, Fourier Series of
10Hours
Periodic functions with period 2 and with arbitrary period 2c, Fourier series
of even and odd functions, Half range Fourier Series, practical Harmonic
analysis. Complex Fourier series
L1, L2,
L3,L4
Module -2
Fourier Transforms: Infinite Fourier transforms, Fourier Sine and Cosine transforms,
10 Hours
L1, L2,
L3,L4
10 Hours
L1, L2,
L3,L4
10 Hours
L1, L2,
L3,L4
Inverse transform. Z-transform: Difference equations, basic definition, z-transform-definition,

Standard z-transforms, Damping rule, Shifting rule, Initial value and final value theorems
(without proof) and problems, Inverse z-transform. Applications of z-transforms to solve
difference equations..
Module - 3
Statistical Methods: Correlation and rank Correlation coefficients, Regression
and Regression coefficients, lines of regression - problems Curve fitting:

Curve fitting by the method of least squares, Fitting of the curves of the form,
= + , = + + , = , = .Numerical Methods: Numerical
solution of algebraic and transcendental equations by: Regular-falsi method, Secant method,
Newton - Raphson method and Graphical method. .
Module-4
Finite differences: Forward and backward differences, Newtons forward and
backward interpolation formulae. Divided differences-Newtons divided
difference formula. Lagranges interpolation formula and inverse interpolation
formula. Central Difference-Stirlings and Bessels formulae (all formulae
without proof)-Problems. Numerical integration: Simpsons 1/3, 3/8 rule,
Weddles rule (without proof ) -Problems
Module-5
1|Page
Vector integration: Line integrals-definition and problems, surface and volume
10 Hours
integrals-definition, Greens theorem in a plane, Stokes and Gauss-divergence

theorem(without proof) and problems.
Calculus of Variations: Variation of function and Functional, variational
problems, Eulers equation, Geodesics, minimal surface of revolution, hanging
chain, problems
L1, L2,
L3,L4
Course outcomes:
After Studying this course, students will be able to
know the use of periodic signals and Fourier series to analyze circuits
explain the general linear system theory for continuous-time signals and systems using the Fourier Transform
Analyse discrete-time systems using convolution and the z-transform
use appropriate numerical methods to solve algebraic and transcendental equations and also to calculate a
definite integral
Use curl and divergence of a vector function in three dimensions, as well as apply the Green's Theorem,
Divergence Theorem and Stokes' theorem in various applications
Solve the simple problem of the calculus of variations
Graduate Attributes (as per NBA)
1.
2.
3.
4.
Engineering Knowledge
Problem Analysis
Life-Long Learning
Conduct Investigations of Complex Problems
Question paper pattern:

The question paper will have ten questions.
There will be 2 questions from each module.
Each question will have questions covering all the topics under a module.
The students will have to answer 5 full questions, selecting one full question from each module.
Text Books:
1. B. S. Grewal," Higher Engineering Mathematics", Khanna publishers, 42nd edition, 2013.

2. B.V.Ramana "Higher Engineering M athematics" Tata McGraw-Hill, 2006
Reference Books:
1. N P Bali and Manish Goyal, "A text book of Engineering mathematics" , Laxmi publications, latest
edition.
2. Kreyszig, "Advanced Engineering Mathematics " - 9th edition, Wiley,
3. H. K Dass and Er. RajnishVerma ,"Higher Engineerig Mathematics", S. Chand, 1st ed,
2|Page
Analog and Digital Electronics

SEMESTER - III
Subject Code
15CS32
IA Marks
20
04
Exam Marks
80
50
Exam Hours
03
CREDITS - 04
Course objectives:This course will enable students to

-
Recall and Recognize construction and characteristics of JFETs and MOSFETs.

Describe, Differentiate and Apply JFETs and MOSFETs
Define, Demonstrate and Analyse Operational Amplifier circuits and their applications
Describe, Illustrate and Analyse Combinational Logic circuits, Simplification of
Algebraic Equations using Karnaugh Maps and Quine McClusky Techniques.
Define, Describe and Design Decoders, Encoders, Digital multiplexers, Adders and Subtractors,
Binary comparators, Latches and Master-Slave Flip-Flops.
Describe, Demonstrate, Analyse and Design Synchronous and Asynchronous Sequential Circuits,
State diagrams, Registers and Counters, A/D and D/A converters.
Module -1
Field Effect Transistors: Junction Field Effect Transistors, MOSFETs,
Differences between JFETs and MOSFETs, Biasing MOSFETs, FET
Applications, CMOS Devices. Wave-Shaping Circuits: Integrated Circuit(IC)
Multivibrators. Introduction to Operational Amplifier: Ideal v/s practical
Opamp, Performance Parameters, Operational Amplifier Application
Circuits:Peak Detector Circuit, Comparator, Active Filters, Non-Linear
Amplifier, Relaxation Oscillator, Current-To-Voltage Converter, Voltage-ToCurrent Converter.
(Text book 1:- Ch5:5.2, 5.3, 5.5, 5.8,5.9, 5.1.Ch13: 13.10.Ch 16: 16.3, 16.4.
Module -2
The Basic Gates: Review of Basic Logic gates, Positive and Negative Logic,
Introduction to HDL. Combinational Logic Circuits: Sum-of-Products
Method, Truth Table to Karnaugh Map, Pairs Quads, and Octets, Karnaugh
Simplifications, Dont-care Conditions, Product-of-sums Method, Product-ofsums simplifications, Simplification by Quine-McCluskyMethod, Hazards and
Hazard covers, HDL Implementation Models. Text book 2:- Ch2: 2.4,2.5.
Ch3: 3.2 to 3.11.
Teaching
Hours
RBT
Levels
10
Hours
10 Hours
Module - 3
3|Page
L1,L2,
L3
L1,L2,
L3
Data-Processing Circuits: Multiplexers, Demultiplexers, 1-of-16 Decoder,

BCD to Decimal Decoders, Seven Segment Decoders, Encoders, Exclusive-OR
Gates, Parity Generators and Checkers, Magnitude Comparator, Programmable
Array Logic, Programmable Logic Arrays, HDL Implementation of Data
Processing Circuits. Arithmetic Building Blocks, Arithmetic Logic Unit FlipFlops: RS Flip-Flops, Gated Flip-Flops, Edge-triggered RS FLIP-FLOP, Edgetriggered D FLIP-FLOPs, Edge-triggered JK FLIP-FLOPs. Text book 2:- Ch
4:- 4.1 to 4.9, 4.11, 4.12, 4.14.Ch6:-6.7, 6.10.Ch8:- 8.1 to 8.5.
10 Hours
L2, L3,
L4
Flip- Flops: FLIP-FLOP Timing, JK Master-slave FLIP-FLOP, Switch Contact

Bounce Circuits, Various Representation of FLIP-FLOPs, HDL Implementation
of FLIP-FLOP. Registers: Types of Registers, Serial In - Serial Out, Serial In Parallel out, Parallel In - Serial Out, Parallel In - Parallel Out, Universal Shift
Register, Applications of Shift Registers, Register implementation in HDL.
Counters: Asynchronous Counters, Decoding Gates, Synchronous Counters,
Changing the Counter Modulus.
(Text book 2:- Ch 8: 8.6, 8.8, 8.9, 8.10, 8.13. Ch 9: 9.1 to 9.8. Ch 10: 10.1 to
10.4)
Module-5
10 Hours
L2, L3,
L4, L6
Counters: Decade Counters, Pre settable Counters, Counter Design as a

Synthesis problem, A Digital Clock, Counter Design using HDL. D/A
Conversion and A/D Conversion: Variable, Resistor Networks, Binary
Ladders, D/A Converters, D/A Accuracy and Resolution, A/D ConverterSimultaneous Conversion, A/D Converter-Counter Method, Continuous A/D
Conversion, A/D Techniques, Dual-slope A/D Conversion, A/D Accuracy and
Resolution.
Text book 2:- Ch 10: 10.5 to 10.9. Ch 12: 12.1 to 12.10
10 Hours
L2, L3,
L4, L6
Module-4
Course outcomes:
After studying this course, students will be able to:
Acquire knowledge of
- JFETs and MOSFETs , Operational Amplifier circuits and their applications
- Combinational Logic, Simplification Techniques using Karnaugh Maps, Quine McClusky
Technique.
- Operation of Decoders, Encoders, Multiplexers, Adders and Subtractors.
- Working of Latches, Flip-Flops, Designing Registers, Counters, A/D and D/A Converters
Analyse the performance of
- JFETs and MOSFETs , Operational Amplifier circuits
- Simplification Techniques using Karnaugh Maps, Quine McClusky Technique.
- Synchronous and Asynchronous Sequential Circuits.
Apply the knowledge gained in the design of Counters, Registers and A/D & D/A converters
1. Engineering Knowledge
2. Design/Development of Solutions(partly)
3. Modern Tool Usage
4|Page
4. Problem Analysis
Text Books:
1. Anil K Maini, VarshaAgarwal: Electronic Devices and Circuits, Wiley, 2012.
2. Donald P Leach, Albert Paul Malvino&GoutamSaha: Digital Principles and Applications, 7th
Edition, Tata McGraw Hill, 2014
Reference Books:
1. Stephen Brown, ZvonkoVranesic: Fundamentals of Digital Logic Design with VHDL, 2nd Edition,
Tata McGraw Hill, 2005.
2. R D Sudhaker Samuel: Illustrative Approach to Logic Design, Sanguine-Pearson, 2010.
3. M Morris Mano: Digital Logic and Computer Design, 10th Edition, Pearson, 2008.
5|Page
DATA STRUCTURES AND APPLICATIONS

Subject Code
SEMESTER - III
IA Marks
15CS33
20
04
Exam Marks
80
50
Exam Hours
03
CREDITS - 04
Understand, Practice and Assimilate fundamentals of data structures and their applications essential for
programming/problem solving
Describe, Analyze, Design and Evaluate the Linear Data Structures: Stack, Queues, Lists
Describe, Analyze, Design and Evaluate the Non-Linear Data Structures: Trees, Graphs
Describe, Analyze, Design and Evaluate the sorting & searching algorithms
Assess appropriate data structure during program development/Problem Solving
Module -1
Teaching RBT
Hours
Levels
Introduction to Data Structures, Classification of Data Structures: Primitive and NonPrimitive, Linear and Nonlinear; Data structure Operations: Create, Insert, Delete,
Search, Sort, Merge, Traversal. Review of Structures, Unions and Pointers, Self
Referential Structures. Arrays: Definition, Representation, Operations - Insert, Delete,
Simple Merge, Search, Sort; Multidimensional Arrays; Applications of Arrays.
Strings: Definition, Representation, Operations, and String manipulation Applications.
Dynamic Memory Management Functions - malloc, calloc, realloc, free.,
Programming Examples.
10Hours
L1, L2
Linear Data Structures and their Sequential Storage Representation:

10 Hours
Stack: Definition, Representation, Operations and Applications: Polish and reverse
polish expressions, Infix to postfix conversion, evaluation of postfix expression, infix
to prefix, postfix to infix conversion; Recursion - Factorial, GCD, Fibonacci
Sequence, Tower of Hanoi, Binomial Co-efficient(nCr), Ackerman's Recursive
function. Queue: Definition, Representation, Operations, Queue Variants: Circular
Queue, Priority Queue, Double Ended Queue; Applications of Queues. Programming
Examples.
L1, L2,
L3, L4,
L6
Module -2
Module - 3
Linear Data Structures and their Linked Storage Representation:
10 Hours
Linked List: Definition, Representation, Operations, Types: Singly Linked List,
Doubly Linked list, Circular linked list. Linked implementation of Stack, Queue and its
variants - Double Ended, Priority queues. Applications of Linked lists - Polynomial
Manipulation, multiprecision arithmetic, Symbol table organizations, Sparse matrix
representation with multilinked data structure. Programming Examples - length of a
list, Merging two lists, removing duplicates, reversing a list, union and intersection of
two lists etc.,
L2, L3,
L4, L6
6|Page
Module-4
Nonlinear Data Structures:
10 Hours
Trees: Definitions, Terminologies, Array and linked Representation of Binary Trees,
Types- Complete/full, Almost Complete, Strictly, Skewed; Traversal methods Inorder, postorder, preorder; Binary Search Trees - Creation, Insertion, Deletion,
Traversal, Searching; Expression tree, Threaded binary tree, Conversion of General
Trees to Binary Trees, Constructing BST from traversal orders; Applications Of Trees:
Evaluation of Expression, Tree based Sorting. Programming Examples
L2, L3,
L4, L6
Module-5
Graph: Definitions, Terminologies, Matrix and Adjacency List Representation Of
Graphs, Elementary Graph operations, Traversal methods: Breadth First Search and
Depth First Search. Sorting and Searching: Insertion Sort, Radix sort, Address
Calculation Sort. Hashing: The Hash Table organizations, Hashing Functions, Static
and Dynamic Hashing, Collision-Resolution Techniques, Programming Examples. File
Structures: Definitions and Concepts, Types, File Organizations - Sequential, Indexed
Sequential, Random Access.
10
Hours
L2, L3,
L4, L6
Course outcomes:

- Various types of data structures, operations and algorithms
- Sorting and searching operations
- File structures
Analyse the performance of
- Stack, Queue, Lists, Trees, Graphs, Searching and Sorting techniques
Implement all the applications of Data structures in a high-level language
Design and apply appropriate data structures for solving computing problems.
1.
2.
3.
4.
Design/Development of Solutions
Problem Analysis

Text Books:
1. Fundamentals of Data Structures in C - Ellis Horowitz and SartajSahni, 2nd edition, 2014,
Universities Press
2. Data Structures: A Pseudo-code approach with C - Gilberg&Forouzan, 2nd edition, 2014, Cengage
Learning
Reference Books:
7|Page
1. Data Structures using C, second edition, Reemathareja, Oxford press

2. Data Structures - Seymour Lipschutz, Schaum's Outlines, revised 1st edition,McGraw Hill
3. An Introduction to Data Structures with Applications- Jean-Paul Tremblay & Paul G. Sorenson, 2nd
Edition, 2013, McGraw Hill
4. Data Structures using C - A M Tenenbaum, Pearson
5. Data Structures and Program Design in C - Robert Kruse, PHI
8|Page
COMPUTER ORGANIZATION
Subject Code
SEMESTER - III
IA Marks
15CS34
20
04
Exam Marks
80
50
Exam Hours
03
CREDITS - 04
Understand the basics of computer organization: structure and operation of computers and their
peripherals.
Understand the concepts of programs as sequences or machine instructions.
Expose different ways of communicating with I/O devices and standard I/O interfaces.
Describe hierarchical memory systems including cache memories and virtual memory.
Describe arithmetic and logical operations with integer and floating-point operands.
Understand basic processing unit and organization of simple processor, concept of pipelining and
other large computing systems.
Module -1
Teaching RBT
Hours
Levels
Basic Structure of Computers: Basic Operational Concepts, Bus Structures,
Performance Processor Clock, Basic Performance Equation, Clock Rate,
Performance Measurement. Machine Instructions and Programs: 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
10Hours
L1, L2
10 Hours
L1, L2
10 Hours
L1, L2,
L3
10 Hours
L1, L2,
L3, L4
Module -2
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.
Module - 3
Memory System: Basic Concepts, Semiconductor RAM Memories, Read Only
Memories, Speed, Size, and Cost, Cache Memories Mapping Functions, Replacement
Algorithms, Performance Considerations, Virtual Memories, Secondary Storage.
Module-4
Arithmetic: Numbers, Arithmetic Operations and Characters, 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.
Module-5
9|Page
Basic Processing Unit: Some Fundamental Concepts, Execution of a Complete 10 Hours

Instruction, Multiple Bus Organization, Hard-wired Control, Micro programmed
Control. Pipelining, Embedded Systems and Large Computer Systems: Basic Concepts
of pipelining, Examples of Embedded Systems, Processor chips for embedded
applications, Simple Microcontroller, Forms of parallel processing, Array Processors,
The structure of General-Purpose Multiprocessors.
L1, L2,
L4, L6
Course outcomes:
- The basic structure of computers & machine instructions and programs, Addressing
Modes, Assembly Language, Stacks, Queues and Subroutines.
- Input/output Organization such as accessing I/O Devices, Interrupts.
- Memory system basic Concepts, Semiconductor RAM Memories, Static memories,
Asynchronous DRAMS, Read Only Memories, Cache Memories and Virtual
Memories.
- Some Fundamental Concepts of Basic Processing Unit, Execution of a Complete
Instruction, Multiple Bus Organization, Hardwired Control and Micro programmed
Control.
- Pipelining, embedded and large computing system architecture.
Analyse and design arithmetic and logical units.
Apply the knowledge gained in the design of Computer.

Design and evaluate performance of memory systems
Understand the importance of life-long learning
2. Problem Analysis
3. Life-Long Learning
Text Books:
1. Carl Hamacher, ZvonkoVranesic, SafwatZaky: Computer Organization, 5th Edition, Tata McGraw Hill,
2002. (Listed topics only from Chapters 1, 2, 4, 5, 6, 7, 8, 9 and12)
Reference Books:
1. William Stallings: Computer Organization & Architecture, 7th Edition, PHI, 2006.
10 | P a g e
DISCRETE MATHEMATICAL STRUCTURES

Subject Code
SEMESTER - III
IA Marks
15CS35
20
04
Exam Marks
80
50
Exam Hours
03
CREDITS - 04
Prepare for a background in abstraction, notation, and critical thinking for the mathematics most
directly related to computer science.
Understand and apply logic, relations, functions, basic set theory, countability and counting arguments,
proof techniques,
Understand and apply mathematical induction, combinatorics, discrete probability, recursion, sequence
and recurrence, elementary number theory
Understand and apply graph theory and mathematical proof techniques.
Module -1
Teaching RBT
Hours
Levels
Set Theory: Sets and Subsets, Set Operations and the Laws of Set Theory, Counting
and Venn Diagrams, A First Word on Probability, Countable and Uncountable Sets.
Fundamentals of Logic: Basic Connectives and Truth Tables, Logic Equivalence
The Laws of Logic, Logical Implication Rules of Inference.
10Hours
L2, L3
Fundamentals of Logic contd.: The Use of Quantifiers, Quantifiers, Definitions and 10 Hours
the Proofs of Theorems, Properties of the Integers: Mathematical Induction, The
Well Ordering Principle Mathematical Induction, Recursive Definitions
L3, L4
Module -2
Module - 3
Relations and Functions: Cartesian Products and Relations, Functions Plain and 10 Hours
One-to-One, Onto Functions Stirling Numbers of the Second Kind, Special
Functions, The Pigeon-hole Principle, Function Composition and Inverse Functions.
L3,L4,
L5
Module-4
Relations contd.: Properties of Relations, Computer Recognition Zero-One Matrices 10 Hours
and Directed Graphs, Partial Orders Hasse Diagrams, Equivalence Relations and
Partitions
L3,L4,
L5
Module-5
11 | P a g e
Groups: Definitions, properties, Homomrphisms, Isomorphisms, Cyclic Groups,

Cosets, and Lagranges Theorem. Coding Theory and Rings: Elements of Coding
Theory, The Hamming Metric, The Parity Check, and Generator Matrices. Group
Codes: Decoding with Coset Leaders, Hamming Matrices. Rings and Modular
Arithmetic: The Ring Structure Definition and Examples, Ring Properties and
Substructures, The Integer modulo n.
10
Hours
L3,L4,
L5
Course outcomes:

1. Verify the correctness of an argument using propositional and predicate logic and truth tables.
2. Demonstrate the ability to solve problems using counting techniques and combinatorics in the context
of discrete probability.
3. Solve problems involving recurrence relations and generating functions.
4. Perform operations on discrete structures such as sets, functions, relations, and sequences.
5. Construct proofs using direct proof, proof by contraposition, proof by contradiction, proof by cases, and
mathematical induction.
1.
2.
3.
4.
Problem Analysis

Text Books:
1.Ralph P. Grimaldi: Discrete and Combinatorial Mathematics, , 5th Edition, Pearson Education. 2004.
(Chapter 3.1, 3.2, 3.3, 3.4, Appendix 3, Chapter 2, Chapter 4.1, 4.2, Chapter 5.1 to 5.6, Chapter 7.1 to 7.4,
Chapter 16.1, 16.2, 16.3, 16.5 to 16.9, and Chapter 14.1, 14.2, 14.3).
Reference Books:
1.
2.
3.
4.
Kenneth H. Rosen: Discrete Mathematics and its Applications, 6th Edition, McGraw Hill, 2007.
JayantGanguly: A Treatise on Discrete Mathematical Structures, Sanguine-Pearson, 2010.
D.S. Malik and M.K. Sen: Discrete Mathematical Structures: Theory and Applications, Thomson, 2004.
Thomas Koshy: Discrete Mathematics with Applications, Elsevier, 2005, Reprint 2008.
12 | P a g e
UNIX AND SHELL PROGRAMMING

Subject Code
SEMESTER - III
IA Marks
15CS361
20
03
Exam Marks
80
40
Exam Hours
03
CREDITS - 03
Understand the UNIX Architecture, File systems and use of basic Commands.
Use of editors and Networking commands.
Understand Shell Programming and to write shell scripts.
Understand and analyze UNIX System calls, Process Creation, Control & Relationship.
Module -1
Teaching RBT
Hours
Levels
Introduction - Why UNIX? , Computer System, The UNIX Environment, UNIX
Structure, Accessing Unix, Commands, Common Commands, Other Useful
Commands. File Systems- Filenames, File types, Regular Files, Directories, File
System Implementation, Operations Unique to Directories, Operations Unique to
Regular Files, Operations Common to Both. Security and File Permission Users
and Groups, Security Levels, Changing permissions, User masks , Changing
Ownership and group.
08Hours
L1, L2
08Hours
L1, L2,
L5, L6
08Hours
L1, L2,
L5, L6
Module -2
The Basic vi EditorEditor Concepts , The Vi editor , Modes, Commands, Command
Categories, Local Commands in vi, Range commands in vi, Global Commands in vi,
Rearrange Text in vi, ex editor. Introduction to Shells- Unix Session , Standard
Streams , Redirection, Pipes , tee command , Command execution , Quotes , Command
substitution, Job Control, Aliases, Variables, predefined variables, Options,
Shell/Environment Customization.
Module - 3
Communications User Communication, Electronic Mail, Remote Access, File
Transfer. Interactive Korn Shell Korn Shell Features, Two Special Files , Variables,
Output, Input, exit status of a command, eval command , Environmental variables,
options, Startup Scripts , Command History, Command execution process. Korn Shell
Programming Basic Script Concepts, Expressions, Decisions: Making Selections,
Repetition, Special Parameters and variables, Changing Positional Parameters,
Argument Validation, Debugging Scripts, Script Examples.
Module-4
13 | P a g e
File I/O- Introduction, File Descriptors, open Function, creat Function, close Function
, seek Function, read Function, write Function, I/O Efficiency , File Sharing , Atomic
Operations, dup and dup2 Functions, sync, fsync and fdatasync Functions ,fctnl
Functions, ioctl Functions , /dev/fd. UNIX Processes: The Environment of a UNIX
Process: Introduction, main function, Process Termination, Command-Line
Arguments, Environment List, Memory Layout of a C Program, Shared Libraries,
Memory Allocation, Environment Variables.
08Hours
L1, L2,
L5, L6
08Hours
L1, L2,
L5, L6
Module-5
Process Control
: Introduction, Process Identifiers, fork, vfork, exit, wait,
waitpid, wait3, wait4 Functions, Race Conditions, exec Functions, Changing User IDs
and Group IDs, Interpreter Files, system Function, Process Accounting, User
Identification, Process Times .Process Relationships: Introduction, Terminal Logins,
Network Logins, Process Groups, Sessions, Controlling Terminal, tcgetpgrp, tcsetpgrp
and tcgetsid Functions, Job Control.
Course outcomes:
Explain multi user OS UNIX and its basic features

Interpret UNIX Commands, Shell basics, and shell environments
Design and develop shell programming, communication, System calls and terminology.
Design and develop UNIX File I/O and UNIX Processes.
Understand UNIX process control, relationships, commands and utilities
2. Environment and Sustainability
3. Design/Development of Solutions
Text Books:
1. Behrouz A. Forouzan, Richard F. Gilberg : UNIX and Shell Programming- Cengage Learning India
Edition. (Chapters- 1,2, 3, 4, 5, 7,8, 13, 14) 2009.
2. W. Richard Stevens, Stephen A Rago: Advanced Programming in the UNIX Environment, 2nd Edition,
Pearson Education.(Chapters 3,7.1 to 7.9, 8, 9.1 to 9.8) .2009
Reference Books:
1. Sumitabha Das: UNIX Concepts and Applications,4th Edition, Tata McGraw Hill.
2. Richard Blum , Christine Bresnahan : Linux Command Line and Shell Scripting Bible, 2ndEdition ,
Wiley,2014
3. M.G. Venkateshmurthy: UNIX & Shell Programming, Pearson Education.
14 | P a g e
PROBABILITY AND STATISTICS

Subject Code
SEMESTER - III
IA Marks
15CS362
20
03
Exam Marks
80
40
Exam Hours
03
CREDITS - 03
Acquire knowledge of Probability theory and Statistical methods and their applications
Develop analytical capability
Applying Engineering and Technology
Solve the real world problems.
Module -1
Teaching RBT
Hours
Levels
Statistics and Probability: Overview: Statistical Inference, Samples, Populations, and

the Role of Probability, Sampling Procedures; Collection of Data, Discrete and
Continuous Data, Probability: Sample Space and Events, Counting Sample Points,
Probability of an Event, Additive Rules, Conditional Probability, Multiplicative Rule,
Bayes' Rule.
08Hours
L2,L3,
L4
Random Variables, Distributions and Expectations: Concept of a Random Variable, 08 Hours

Discrete Probability Distributions, Continuous Probability Distributions, Joint
Probability Distributions, Mean of a Random Variable, Variance and Covariance of
Random Variables, Means and Variances of Linear Combinations of Random
Variables, Chebyshevs theorem.
L2,L3,
L4
Module -2
Module - 3
Probability Distributions: Binomial and Multinomial Distributions, Hypergeometric 08 Hours
Distribution, Negative Binomial and Geometric Distributions, Poisson Distribution and
the Poisson Process, Continuous Uniform Distribution, Normal Distribution, Areas
under the Normal Curve, Applications of the Normal Distribution, Gamma and
Exponential Distributions, Chi-Squared Distribution.
L2,L3,
L4
Module-4
Sampling Distributions: Random Sampling, Some Important Statistics, Sampling 08 Hours
Distributions, Sampling Distribution of Means and the Central Limit Theorem,
Sampling Distribution of S2, t-Distribution, F-Distribution.
L2,L3,
L4
Module-5
15 | P a g e
Estimation and Hypothesis: Statistical Inference, Classical Methods of Estimation, 08 Hours

Single Sample: Estimating the Mean, Statistical Hypotheses: General Concepts,
Testing a Statistical Hypothesis, One- and Two-Tailed Tests, The Use of P-Values for
Decision Making in Testing Hypotheses.
L2,L3,
L4
Course outcomes:

1. Demonstrate knowledge & examine use of basic statistics and probability.
2. Characterize probability models using probability mass (density) functions &cumulative distribution
functions.
3. Developing discrete & continuous probability distributions and its applications.

4. Demonstrate knowledge and be able to apply sampling distributions and limit theorems.
5. Understand methods of inference and estimation and apply this for various statistical hypothesis testing.
1.
2.
3.
4.
Problem Analysis
Life-Long Learning

Text Books:
1. Probability and Statistics for Engineers and Scientists, 8th Edition, Walpole, Myers, Myers and Ye,
Pearson Education, 2007.
Reference Books:
1.Probability& Statistics with Reliability, Queuing and Computer Applications by Kishor S. Trivedi ,2nd
Edition, Wiley India, 2014.
2.Probability, Statistics and Random Processes by T.Veerarajan, Tata McGraw Hill.
16 | P a g e
INTRODUCTION TO WEB DEVELOPMENT

Subject Code
SEMESTER - III
IA Marks
15CS363
20
03
Exam Marks
80
40
Exam Hours
03
CREDITS - 03
Understand the importance of the web as a medium of communication.

Understand the principles of creating an effective web page, including an in-depth consideration of
information architecture.
Explain graphic design principles that relate to web design and learn how to implement these theories
into practice.
Develop skills in analysing the usability of a web site.
Understand and use of language of the web: HTML, CSS, JavaScript, Perl and CGI.
Module -1
Teaching RBT
Hours
Levels
How the Web Works: Definitions and History, Internet Protocols, The Client-Server
Model, Where is the Internet, Domain Name System , Uniform Resource
Locators,Hypertext Transfer Protocol,Web Servers, What is HTML and Where Did It
Come from,HTMLSyntax,SemanticMarkup, Structure of HTML Documents,Quick
Tour of HTML Elements,HTML5 Semantic Structure Elements.
08Hours
L1, L2
08Hours
L1, L2,
L6
08Hours
L1, L2,
L3,L6
08Hours
L1, L2,
L3, L4
Module -2
What is CSS? , CSS Syntax, Location of Styles, Selectors, The Cascade: How Styles
Interact, The Box Model, CSS Text Styling,HTML Tables and Forms: Introducing
Tables, Styling Tables, Introducing Forms, Form Control Elements, Table and Form
Accessibility, Microformats.
Module - 3
Advanced CSSLayout: Normal Flow, Positioning Elements, Floating Elements,
Constructing Multicolumn Layouts, Approaches to CSS Layout, Responsive Design,
CSS Frameworks. JavaScript-Client-Side Scripting: What is JavaScript and What can it
Do?, JavaScript Design Principles, Where Does JavaScript Go? Syntax, JavaScript
Objects, The Document Object Model(DOM), JavaScript Events , Forms.
Module-4
Programming in Perl 5-Why Perl? On-line Documentation, The Basic Perl Program,
Scalars, Arrays, Hashes, Control Structures, Processing Text, Regular Expressions,
Using Files, Subroutines, Bits and Pieces.
Module-5
17 | P a g e
CGI Scripting: What is CGI? Developing CGI Applications, Processing CGI,

Introduction to CGI.pm, CGI.pm Methods, Creating MTL pages Dynamically, Using
CGI.pm- An Example, Adding Robustness, Carp, Cookies, Uploading Files, Tracking
Users With Hidden Data, Creating and Manipulating Images.
08Hours
L1, L2,
L3, L6
Course outcomes:

1.
2.
3.
4.
5.
6.
Interpret internet related technologies

Understand the various steps in designing a creative and dynamic website.
Develop a website systematically.
Write HTML, CSS, JavaScript, Perl and CGI codes.
Design dynamic and interactive web pages by embedding Java Script code in HTML.
Create good, effective and customized websites.
1.
2.
3.
4.
Modern Tool Usage
The Engineer and Society

Text Books:
1. Randy Connolly, Ricardo Hoar, Fundamentals of Web Development, Pearson, 2015.

2. Chris Bates, Web Programming, 3rd Edition, Wiley, 2006.
Reference Books:
1. Thomas A. Powell, The Complete Reference HTML& CSS, 5th Edition, McGraw Hill.
2. Brian D Foy, Mastering Perl, O'Reilly Media
18 | P a g e
DESIGN OF PROGRAMMING WITH LOGIC

Subject Code
SEMESTER - III
IA Marks
15CS364
20
03
Exam Marks
80
40
Exam Hours
03
CREDITS - 03
Understand problem solving skills without imposing the overhead of traditional programming notations
and tools.
Understand design process in problem solving that leads problem statements to well organized
solutions.
Understand programming language details, algorithmic minutiae, and specific application domains.
Emphasize on algorithmic minutiae, and specific application domain.
Module -1
Teaching RBT
Hours
Levels
Processing of simple forms of Data, Students, teachers & Computers, Numbers,
expressions, simple programs, programs are function plus variable definitions,
conditional expressions and functions, symbolic informations, compounds data,
verities of data.
08Hours
L1, L2
08Hours
L1, L2,
L4
More on processing arbitrarily large data, self-referential data definitions, mutually

referential, development through iterative refinement, processing two complex pieces
of data.[text Book 1]. Introduction to Programming structure and Problem solving
with sequential logic structure [Text Book 2]
Module-4
08Hours
L1, L2,
L4
Local definitions and lexical scope, abstracting designs, similarities in definitions,

functions are values, designing abstraction from examples & with first class functions,
mathematical examples .[Text book 1], Problem solving with decision [Text Book 2]
08Hours
L1, L2,
L4
08Hours
L1, L2,
L4
Module -2
Syntax and semantics, Processing arbitrarily large data, lists, more on processing lists,
natural numbers, composing functions. [Text Book 1]. Problem solving concepts
and Planning your solution [chapter2 &3 of Text book 2]

Module - 3
Module-5
Generative recursion, designing algorithms, variations on a theme, Algorithm that
backtrack, cost of computing and vectors, the loss of knowledge, designing
accumulator style functions, Nature of intact numbers, overflow, underflow,
DrSchemes numbers.
Course outcomes:
19 | P a g e
Develop a complete algorithm for a given problem

Develop novel programming environment.
Analyze the problem domain clearly.
Interpret functions and their advantages and roles
Explain recursion, backtrack, and styles
1. Problem Analysis
2. Design/Development of Solutions
3. Conduct Investigations of Complex Problems
Text Books:
1. How to Design Programs , Matthias Felleisen, Robert Bruce Findler, Mathew Flatt,
Shriramkrishnamurthi, PHI, ISBN-978-81-203-2461-9,Eastern Economy edition
2. Problem Solving and Programming Concepts, 9th Edition, Maureen Sprankle, Jim Habbard, Pearson,
ISBN 978-93-325-1884-1
Reference Books: NIL
20 | P a g e
ANALOG AND DIGITAL ELECTRONICS LABORATORY

SEMESTER - III
Laboratory Code
IA Marks
20
15CSL37
01I + 02P
Exam Marks
80
40
Exam Hours
03
CREDITS - 02
Course objectives: This laboratory course enable students to get practical experience in
design, assembly and evaluation/testing of
Analog components and circuits including Operational Amplifier, Timer, etc.
Combinational logic circuits.
Flip - Flops and their operations
Counters and Registers using Flip-flops.
Synchronous and Asynchronous Sequential Circuits.
A/D and D/A Converters
Descriptions (if any)
Any simulation package like MultiSim / P-spice /Equivalent software may be used.
Faculty-in-charge should demonstrate and explain the required hardware components and their
functional Block diagrams, timing diagrams etc. Students have to prepare a write-up on the same
and include it in the Lab record and to be evaluated.
Laboratory Session-1: Write-upon analog components; functional block diagram, Pin

diagram (if any), waveforms and description. The same information is also taught in
theory class; this helps the students to understand better.
Laboratory Session-2: Write-upon Logic design components, pin diagram(if any), Timing
diagrams, etc. The same information is also taught in theory class; this helps the students
to understand better.
Note: These TWO Laboratory sessions are used to fill the gap between theory classes and
practical sessions. Both sessions are to be evaluated for 20 marks as lab experiments.
21 | P a g e
Laboratory Experiments:
RBT Levels: L5, L6
1. a) Design and construct a Schmitt trigger using Op-Amp for given UTP and LTP values and
demonstrate its working.
b) Design and implement a Schmitt trigger using Op-Amp using a simulation package for two sets
of UTP and LTP values and demonstrate its working.
2. a) Design and construct a rectangular waveform generator (Op-Amp relaxation oscillator) for
given frequency and demonstrate its working.
b) Design and implement a rectangular waveform generator (Op-Amp relaxation oscillator) using
a simulation package and demonstrate the change in frequency when all resistor values are
doubled.
3. Design and implement an Astablemultivibrator circuit using 555 timer for a given frequency and
duty cycle.
Continued:
RBT Levels: L5, L6
4. Design and implement Half adder, Full Adder, Half Subtractor, Full Subtractor using basic gates.
5. a)Given a 4-variable logic expression, simplify it using Entered Variable Map and realize the
simplified logic expression using 8:1 multiplexer IC.
b) Design and develop the Verilog /VHDL code for an 8:1 multiplexer. Simulate and verify its
working.
6. a) Design and implement code converter I)Binary to Gray II) Gray to Binary Code using basic
gates.
7. Design and verify the Truth Table of 3-bit Parity Generator and 4-bit Parity Checker using basic
Logic Gates with an even parity bit.
8. a) Realize a J-K Master / Slave Flip-Flop using NAND gates and verify its truth table.
b) Design and develop the Verilog / VHDL code for D Flip-Flop with positive-edge triggering.
Simulate and verify its working.
9. a) Design and implement a mod-n (n<8) synchronous up counter using J-K Flip-Flop ICs and
demonstrate its working.
b) Design and develop the Verilog / VHDL code for mod-8 up counter. Simulate and verify its
working.
10. Design and implement an asynchronous counter using decade counter IC to count up from 0 to n
(n<=9) and demonstrate on 7-segment display (using IC-7447).
11. Generate a Ramp output waveform using DAC0800 (Inputs are given to DAC through IC74393
dual 4-bit binary counter).
Study experiment
12. To study 4-bitALU using IC-74181.
Course outcomes:
On the completion of this laboratory course, the students will be able to:
Use various Electronic Devices like Cathode ray Oscilloscope, Signal
generators, Digital Trainer Kit, Multimeters and components like
Resistors, Capacitors, Op amp and Integrated Circuit.
design and demonstrate various combinational logic circuits.
22 | P a g e
design and demonstrate various types of counters and Registers using

Flip-flops
Use simulation package to design circuits.
Understand the working and implementation of ALU.
1.
2.
3.
4.
Problem Analysis
Modern Tool Usage
Conduction of Practical Examination:

1 . All laboratory experiments (1 to 11 nos) are to be included for practical
examination.
2 . Students are allowed to pick one experiment from the lot.
3 . Strictly follow the instructions as printed on the cover page of answer script.
4 . Marks distribution:
a ) For questions having part a only- Procedure + Conduction + Viva:20 + 50
+10 =80 Marks
b ) For questions having part a and b
Part a- Procedure + Conduction + Viva:10 + 35 +05= 50 Marks
Part b- Procedure + Conduction + Viva:10 + 15 +05= 30 Marks
5 . Change of experiment is allowed only once and marks allotted to the
procedure part to be made zero.
23 | P a g e
DATA STRUCTURES WITH C LABORATORY

SEMESTER - III
Laboratory Code
15CSL38
IA Marks
20
01I + 02P
Exam Marks
80
40
Exam Hours
03
CREDITS - 02
Course objectives: This laboratory course enable students to get practical experience in
design, develop, implement, analyze and evaluation/testing of
Asymptotic performance of algorithms.

Linear data structures and their applications such as Stacks, Queues and Lists
Non-Linear Data Structures and their Applications such as Trees and Graphs
Sorting and Searching Algorithms
Descriptions (if any)

Implement all the experiments in C Language under Linux / Windows environment.
Laboratory Experiments: RBT
1.
2.
3.
4.
5.
6.
Levels: L3, L4, L5, L6
Design, Develop and Implement a menu driven Program in C for the following Array operations
a. Creating an Array of N Integer Elements
b. Display of Array Elements with Suitable Headings
c. Inserting an Element (ELEM) at a given valid Position (POS)
d. Deleting an Element at a given valid Position(POS)
e. Exit.
Support the program with functions for each of the above operations.
Design, Develop and Implement a Program in C for the following operations on Strings
a. Read a main String (STR), a Pattern String (PAT) and a Replace String (REP)
b. Perform Pattern Matching Operation: Find and Replace all occurrences of PAT in STR
with REP if PAT exists in STR. Report suitable messages in case PAT does not exist in
STR
Support the program with functions for each of the above operations. Don't use Built-in functions.
Design, Develop and Implement a menu driven Program in C for the following operations on
STACK of Integers (Array Implementation of Stack with maximum size MAX)
a. Push an Element on to Stack
b. Pop an Element from Stack
c. Demonstrate how Stack can be used to check Palindrome
d. Demonstrate Overflow and Underflow situations on Stack
e. Display the status of Stack
f. Exit
Support the program with appropriate functions for each of the above operations
Design, Develop and Implement a Program in C for converting an Infix Expression to Postfix
Expression. Program should support for both parenthesized and free parenthesized expressions with
the operators: +, -, *, /, %(Remainder), ^(Power) and alphanumeric operands.
Design, Develop and Implement a Program in C for the following Stack Applications
a. Evaluation of Suffix expression with single digit operands and operators: +, -, *, /, %, ^
b. Solving Tower of Hanoi problem with n disks
Circular QUEUE of Characters (Array Implementation of Queue with maximum size MAX)
a. Insert an Element on to Circular QUEUE
24 | P a g e
b. Delete an Element from Circular QUEUE

c. Demonstrate Overflow and Underflow situations on Circular QUEUE
d. Display the status of Circular QUEUE
e. Exit
Continued: RBT Levels: L3, L4, L5, L6

7. Design, Develop and Implement a menu driven Program in C for the following operations on
Singly Linked List (SLL) of Student Data with the fields: USN, Name, Branch, Sem, PhNo
a. Create a SLL of N Students Data by using front insertion.
b. Display the status of SLL and count the number of nodes in it
c. Perform Insertion and Deletion at End of SLL
d. Perform Insertion and Deletion at Front of SLL
e. Demonstrate how this SLL can be used as STACK and QUEUE
f. Exit
8.
Doubly Linked List (DLL) of Employee Data with the fields: SSN, Name, Dept, Designation,
Sal, PhNo
a. Create a DLL of N Employees Data by using end insertion.
b. Display the status of DLL and count the number of nodes in it
c. Perform Insertion and Deletion at End of DLL
d. Perform Insertion and Deletion at Front of DLL
e. Demonstrate how this DLL can be used as Double Ended Queue
f. Exit
9. Design, Develop and Implement a Program in C for the following operations on Singly Circular
Linked List (SCLL) with header nodes
a. Represent and Evaluate a Polynomial P(x,y,z) = 6x2y2z-4yz5+3x3yz+2xy5z-2xyz3
b. Find the sum of two polynomials POLY1(x,y,z) and POLY2(x,y,z) and store the result in
POLYSUM(x,y,z)
10. Design, Develop and Implement a menu driven Program in C for the following operations on
Binary Search Tree (BST) of Integers
a. Create a BST of N Integers: 6, 9, 5, 2, 8, 15, 24, 14, 7, 8, 5, 2
b. Traverse the BST in Inorder, Preorder and Post Order
c. Search the BST for a given element (KEY) and report the appropriate message
d. Delete an element(ELEM) from BST
e. Exit
11. Design,
Cities
a.
b.
c.
Develop and Implement a Program in C for the following operations on Graph(G) of

Create a Graph of N cities using Adjacency Matrix.
Print all the nodes reachable from a given starting node in a digraph using BFS method
Check whether a given graph is connected or not using DFS method.
12. Given a File of N employee records with a set K of Keys(4-digit) which uniquely determine the
25 | P a g e
records in file F. Assume that file F is maintained in memory by a Hash Table(HT) of m memory
locations with L as the set of memory addresses (2-digit) of locations in HT. Let the keys in K and
addresses in L are Integers. Design and develop a Program in C that uses Hash function H: K L
as H(K)=K mod m (remainder method), and implement hashing technique to map a given key K
to the address space L. Resolve the collision (if any) using linear probing.
Course outcomes:
On the completion of this laboratory course, the students will be able to:
Analyze and Compare various linear and non-linear data structures
Code, debug and demonstrate the working nature of different types of data
structures and their applications
Implement, analyze and evaluate the searching and sorting algorithms
Choose the appropriate data structure for solving real world problems
1.
2.
3.
4.
Problem Analysis
Modern Tool Usage
Conduction of Practical Examination:
1 . All laboratory experiments (TWELVE nos ) are to be included for practical

2.
3.
4.
5.
examination.
Students are allowed to pick one experiment from the lot.
Strictly follow the instructions as printed on the cover page of answer script
Marks distribution: Procedure + Conduction + Viva:20 + 50 +10 (80)
Change of experiment is allowed only once and marks allotted to the
procedure part to be made zero.
26 | P a g e

Csis 3 Syll

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Csis 3 Syll

Uploaded by

Copyright:

Available Formats

ENGINEERING MATHEMATICS-III

[As per Choice Based Credit System (CBCS) scheme]

Number of Lecture Hours/Week

Total Number of Lecture Hours

Course objectives: This course will enable students to

Fourier Series: Periodic functions, Dirichlets condition, Fourier Series of

Inverse transform. Z-transform: Difference equations, basic definition, z-transform-definition,

and Regression coefficients, lines of regression - problems Curve fitting:

Vector integration: Line integrals-definition and problems, surface and volume

integrals-definition, Greens theorem in a plane, Stokes and Gauss-divergence

Graduate Attributes (as per NBA)

Question paper pattern:

1. B. S. Grewal," Higher Engineering Mathematics", Khanna publishers, 42nd edition, 2013.

Analog and Digital Electronics

Number of Lecture Hours/Week

Total Number of Lecture Hours

Course objectives:This course will enable students to

Recall and Recognize construction and characteristics of JFETs and MOSFETs.

Data-Processing Circuits: Multiplexers, Demultiplexers, 1-of-16 Decoder,

Flip- Flops: FLIP-FLOP Timing, JK Master-slave FLIP-FLOP, Switch Contact

Counters: Decade Counters, Pre settable Counters, Counter Design as a

DATA STRUCTURES AND APPLICATIONS

Number of Lecture Hours/Week

Total Number of Lecture Hours

Course objectives: This course will enable students to

Linear Data Structures and their Sequential Storage Representation:

After studying this course, students will be able to:

Question paper pattern:

1. Data Structures using C, second edition, Reemathareja, Oxford press

Number of Lecture Hours/Week

Total Number of Lecture Hours

Course objectives: This course will enable students to

Basic Processing Unit: Some Fundamental Concepts, Execution of a Complete 10 Hours

After studying this course, students will be able to:

Analyse and design arithmetic and logical units.

Apply the knowledge gained in the design of Computer.

Understand the importance of life-long learning

Graduate Attributes (as per NBA)

DISCRETE MATHEMATICAL STRUCTURES

Number of Lecture Hours/Week

Total Number of Lecture Hours

Course objectives: This course will enable students to

Groups: Definitions, properties, Homomrphisms, Isomorphisms, Cyclic Groups,

After studying this course, students will be able to:

Question paper pattern:

UNIX AND SHELL PROGRAMMING

Number of Lecture Hours/Week

Total Number of Lecture Hours

Course objectives: This course will enable students to

After studying this course, students will be able to:

Explain multi user OS UNIX and its basic features

Graduate Attributes (as per NBA)

3. M.G. Venkateshmurthy: UNIX & Shell Programming, Pearson Education.

PROBABILITY AND STATISTICS

Number of Lecture Hours/Week

Total Number of Lecture Hours

Course objectives: This course will enable students to

Statistics and Probability: Overview: Statistical Inference, Samples, Populations, and

Random Variables, Distributions and Expectations: Concept of a Random Variable, 08 Hours

Estimation and Hypothesis: Statistical Inference, Classical Methods of Estimation, 08 Hours

After studying this course, students will be able to:

3. Developing discrete & continuous probability distributions and its applications.