B.Tech.

(CSE) Scheme
(For Candidates Admitted From 2009 Onwards)
SYLLABUS

SEMESTER IV:

Periods of
Subject Code Subject Title Instruction Credits
L T P
BCSCMA401 R01 Discrete Structures & Combinatorics 3 1 0 4
BCSCCS402 R02 Operating Systems 3 1 0 4
BCSCCS403 R01 Java Programming 3 1 0 4

BCSCCS404 R02 Object Oriented Analysis and Design 3 1 0 4

BCSCCS 405 Control System 3 1 0 4
BCSDCS XXX DE-3 3 1 0 4
BCSCCS406 R02 Operating Systems Lab 0 0 3 2
BCSCCS407 R01 Java Programming Lab 0 0 3 2
BCSCTP408 HR SKILLS- II 1 0 0 1
TOTAL 19 6 6 29

DEPARTMENTAL ELECTIVES:

BCSDCS 402 R02 Communication Engineering 3 1 0 4

BCSDCS 403 Linux Programming 3 1 0 4
BCSDCS 404 R01 Theory of Computation 3 1 0 4

ADDITIONAL COURSES FOR LATERAL ENTRY STUDENTS

BCSDCS401 R01 Object Oriented Programming in C++ 3 1 0 4

BCSDCS405 R01 Object Oriented Programming Lab 0 0 3 2
 BCSCMA401R01 DISCRETE STRUCTURES & COMBINATORICS
(Common for CSE, IT and ICT)
L T P CREDITS
3 1 0 4
UNIT – I (15 Periods)
Mathematical Logic and Set Theory – Statements and notations – connectives – normal
forms – predicate calculus – Inference theory of predicate calculus – relations and ordering
– functions – recursion – recursion in mechanical theorem proving – mathematical
induction.

UNIT – II (15 Periods)

Algebraic structures – Group- definition – examples – Abelian and cyclic groups –
permutation group – Cosets – Right and left cosets- Lagrange’s theorem – Normal
subgroups – Examples and simple problems only.
Boolean algebra – Boolean functions – representation and minimization K-map and Quine
MC-cluskey.

UNIT – III (15 Periods)

A general introduction on graphs – connected and disconnected graphs – types of graphs –
paths and circuits – cut set and cut vertices – Euler and Hamiltonian graphs – matrix
representation of graphs – incidence and adjacency matrices – properties.

UNIT – IV (15 Periods)

Combinatorics: Combination of sets – Finite and infinite sets – Countability and
uncountability – binary relations – equivalence relation and partition – partial ordering and
lattices - anti-chains - Application of Relational Model in databases – Algebra of formal
power series – Recursive functions.

Text books:

1. M.K. Venkataraman, S. Chandrasekaran and N. Sridharan, “Discrete Mathematics”,

National Publication Company, 2003. [Units I & II].
2. Narsingh Deo, “Graph Theory and its Engineering applications”, Prentice Hall of
India, 2004. [Unit III]
3. C.L. Liu, “Elements of Discrete mathematics”, Tata McGraw Hill, Second Edition,
2000. [Unit IV]

References:

1. V. Krishnamoorthy, “Combinatorics”, Affiliated East-West Press, 1985.

2. M.L. Santigo, “Modern Algebra”, Tata McGraw Hill, 2001.
 BCSCCS 402 R02 OPERATING SYSTEMS
(Common for CSE, IT and ICT)
L T P CREDITS
3 1 0 4

UNIT - I (15 Periods)

Operating system overview: Objectives and functions – Evolution of Operating systems –
Major achievements – Developments leading to modern operating systems – Computer
system overview: Basic elements – Processor registers – Instruction execution – Interrupts
– Memory hierarchy – Cache memory – I/O communication techniques.
Processes: Process – Process States – Process Description – Process Control
Threads: Processes and threads
UNIT - II (15 Periods)
Scheduling: Uniprocessor scheduling – Types of processor scheduling – Scheduling
algorithms – Multiprocessor scheduling – Real-Time scheduling.
Concurrency: Principles of Concurrency – Mutual exclusion – Semaphores – Monitors –
Message passing – Readers/Writers problem.
Deadlock and Starvation: Principles of deadlock – Deadlock Prevention – Deadlock
Avoidance – Deadlock Detection – Integrated deadlock strategy – Dinning philosophers
problem.
UNIT - III (15 Periods)
Memory Management: Address binding – logical verses physical address space –
Dynamic loading – Dynamic linking and shared libraries – Overlays – Swapping –
Contiguous memory allocation – Paging – Segmentation – Segmentation with paging
Virtual Memory: Background – Demand paging – Process creation – Page replacement –
Allocation of frames – Thrashing
UNIT - IV (15 Periods)
I/O Management and disk scheduling: I/O devices – Organization of the I/O function –
OS design issues – I/O buffering – Disk scheduling – RAID – Disk cache.
File management: Overview – Organization and access – File directories – File sharing –
Record blocking – Secondary storage managements.
Security: Security threats – Protection – Intruders – Malicious software – Trusted systems.
Text Books:
1. William Stallings, “Operating Systems Internals and Design Principles”, Pearson
Education, Fifth Edition, 2005. [Units I, II & IV]
2. SilberSchatz, J. Peterson, P. Galvin, “Operating System concepts”, John Wiley, Sixth
Edition, 2004. [Unit III]
References:
1. Tanenbaum, Andrew S, “Modern Operating Systems”, Prentice Hall of India, Third
Edition, 2007.
2. Milenkovic, M, “Operating Systems: Concepts and design”, Tata McGraw Hill, Second
Edition, 1997.
 BCSCCS 403R01 JAVA PROGRAMMING
(Common for CSE, IT and ICT)
L T P CREDITS
3 1 0 4

UNIT – I (15 Periods)

Introduction: Object Oriented Programming - Genesis of Java - Overview of Java - Data
types, Variables and Arrays - Operators – Control Statements - Introducing Classes -
Methods and Classes - Overloading - Understanding static, final - Nested and Inner
Classes - String class - Command Line Arguments - Inheritance - I/O Basics -
Packages and Interfaces - Exception Handling.

UNIT – II (15 Periods)

Multithreaded Programming: Multithreaded Programming – Java Thread Model -
Creating Multiple Threads - Thread Priorities - Synchronization - Inter thread
communication - Suspending, Resuming and Stopping threads.
Applets: Fundamentals - Applet class - Applet Skeleton - Event Handling - Event
classes – Event Listener Interfaces - Adapter Classes - Inner Classes.

UNIT – III (15 Periods)

AWT, RMI: AWT – Window Fundamentals – Working with Frame Windows, Graphics,
colors and Fonts – Using AWT controls, Layout managers and Menus – Control
Fundamentals - Understanding Layout Managers - Java RMI.
Networking: Basics - Networking Classes and Interfaces - InetAddress - TCP/IP
Socket, ServerSocket classes - UDP DatagramSocket, DatagramPacket classes.

UNIT – IV (15 Periods)

Strings and Files: Java Library - String handling - String Operation, comparison,
searching, modifying - String Buffer - java.lang - Simple Type Wrappers – Math -
java.util - Stack - Dictionary - Hash table - Date class - Random class - java.io -
File - ByteStreams - CharacterStreams - Serialization .

Text Book:

1. Herbert Schildt, "The Complete Reference JAVA 2", Tata McGraw Hill, Fifth
Edition, 2002.

References:

1. Harvey M. Deitel, Paul J. Deitel, "JAVA: How to Program", Deitel & Associates Inc.,
Seventh Edition, 2006.
2. Peter Norton and William Stanek, “Peter Norton’s Guide to JAVA Programming”,
Techmedia, 1997.
 BCSCCS 404R02 OBJECT ORIENTED ANALYSIS AND DESIGN
(Common for CSE, IT and ICT)
L T P CREDITS
3 1 0 4
UNIT I (15 Periods)

OBJECT BASICS :Overview of Object Oriented System Development - Objects –

Attributes – Behaviors – Relationship and Associations – Aggregation – Object and
identity – Static and Dynamic binding – Object persistence – OOSD Life cycle –
OO Methodologies – Patterns – Frameworks –-Unified approach.

UNIT II (15 Periods)

ANALYSIS: Unified modeling language – Introduction - UML Class diagrams – Use

Case Diagram – Dynamic modeling - OO Analysis Process – Use case driven OO Analysis–
Use case model – Classification – Noun Phrase approach – Common class pattern -
Identifying object relationship - Associations – super subclass –Aggregation – Identifying
Attributes and Methods – Classes, Responsibilities and Collaborators -Object
Responsibility.

UNIT III (15 Periods)

DESIGN: Object Oriented Design – Axioms and Corollaries- Designing classes – Process –
Class visibility – Refining Attributes – Designing methods and protocols – Access Layer
– OODBMS – Object relational systems – Multi database systems- Designing Access
layer classes – View layer – Designing view layer classes.

UNIT IV (15 Periods)

APPLICATIONS: Client server computing- Object diagram compiler- Computer

Animation - Electrical distribution design system.

Text Books:
1. Ali Bahrami, “Object oriented System Development”, McGraw Hill, 1999. [Units I, II
& III]
2. James Rumbaugh, Michael Blaha, William Premerlani, Frederick Eddy and William
Lorensen, “Object Oriented Modeling and Design”, 2002. [Unit IV]
 BCSCEE 405 CONTROL SYSTEMS
(Common for CSE and IT)
L T P CREDITS
3 1 0 4

UNIT – 1 (14 periods)

Introduction: Definition of control system – linear system – open loop and closed loop
systems – block diagrams – transfer function – signal flow graph (Mason’s rule) –
examples and problems.
Control system components: Potentiometers-synchros-a.c and d.c tacho generators –
transfer functions of armature controlled and field controlled d.c shunt motor – a.c and
d.c servomotors for position control – stepper motor – gear trains – analogy with
transformer.

UNIT – 2 (15 periods)

Time response of linear systems : first order and second order ystems – impulse
response and step response of first and second order linear systems – time domain
specifications like rise time, delay time, overshoot and settling time of a second order
system – response to ramp input – type and order of a system – stready state error and
error constants – generalized error constants – examples and problems.

UNIT – 3 (15 periods)

Frequency response: correlation between time and frequency response – polar plot –
Bode plots – magnitude plot – steps for drawing the asymptotic Bode magnitude plot –
phase angle plot – gain and phase cross-over frequencies – gain margin and phase margin
- their definitions and determination from Bode plots-examples and problems

UNIT – 4 (16 periods)

Stability analysis: concept of stability – BIBO criterion – characteristic equation –
stability definitions – Routh-Hurwitz stability criterion – Nyquist plot – Steps for drawing
the Nyquist plot – Typical Nyquist curves – critical point – Nyquist stability criterion and
its application – examples and problems.
Root locus technique: Root locus plot – rules for construction – typical root locus
trajectories – determination of critical gain.

Text Book:
1. I.J. Nagrath & M.Gopal, ‘Control System Engineering’, New Age
International,2001.

References:
1. Benjamin C.Kuo, ‘Automatic Control Systems’, Prentice Hall,India,New Delhi,
7th Edition 2000.
2. Katsuhiko Ogata, ‘Modern Control Engineering’, Prentice Hall,India, New Delhi,
3rd Edition 2000.
 BCSDCS 402 R02 COMMUNICATION ENGINEERING
(Common for CSE and IT)
L T P CREDITS
3 1 0 4

UNIT – I (15 Periods)

Amplitude Modulation: Transmission And Reception: Electromagnetic spectrum –
Need for modulation – Principles of amplitude modulation – AM envelope, frequency
spectrum and bandwidth, modulation index, AM power distribution – SSB, DSBSC and
VSB systems. AM modulator circuits – linear and non linear modulators – Envelope
detector – AM transmitters – Low and high level transmitters, receiver parameters –AM
receivers – choice of IF – TRF, super heterodyne receiver
UNIT – II (15 Periods)
Angle Modulation: Transmission And Reception : Angle modulation – FM and PM
waveforms, phase deviation and modulation index, frequency deviation, Bandwidth
requirements for Angle – modulated waves – direct and indirect method of FM generation –
slope, balanced slope, ratio detector and Foster Seely FM discriminators. Direct and indirect
FM transmitters, Comparison of AM, FM and PM

UNIT – III (15 Periods)

Digital Communication: Introduction, Sampling Theorem, pulse modulation, PCM – PCM
sampling, sampling rate, signal to quantization noise rate, companding – percentage error,
delta modulation, pulse transmission – PAM, PDM and PPM – modulation and
demodulation techniques Introduction, Shannon limit for information capacity – OOK,
ASK, FSK, PSK systems – Bit rate and baud rate consideration, comparison – QPSK,
Quadrature Amplitude modulation – constellation diagram

UNIT – IV (15 Periods)

Communication Systems: Introduction t o satellite communication – types of
Sa t e ll i te s , orbits, earth station, components of communication satellite. Introduction
to optical communication system – advantages – Principle of light transmission, types of
fiber – transmitter and receiver block – fiber losses – Introduction to RADAR system –
principle – range equation – PRF – pulsed Radar and CW Radar -Radar antennas

Text Books:
1. Kennedy and Davis, “Electronic Communication Systems”, Tata McGraw Hill,
Fourth Edition 1999. [Units I & II]
2. Wayne Tomasi, “Electronic Communication Systems: Fundamentals Through
Advanced”, Pearson Education, 2001. [Units III & IV]
References:
1. Simon Haykin, “Communication Systems”, John Wiley & Sons, Fourth Edition,
2001.
2. Behrouz Forouzan, “Introduction to data communications and Networking”, Tata
McGraw Hill, 2004.
3. Roody D and Coolen J, “Electronic Communications”, Prentice Hall of India,
Fourth Edition, 2007.
 BCSDCS 403 LINUX PROGRAMMING
L T P CREDITS
2 0 3 4

UNIT – I (19 Periods)

Introduction and Shell Programming: Basic Linux Programming Concepts – Linux
Design – Linux Documentation – Man Pages – Information Pages – Program
Documentation – Internet Resources - Quick Introduction to Bash – Redirection and Piping
– Variables – Functions – Conditionals and Loops – Shell utilities.

UNIT – II (19 Periods)

Regular Expressions, Emacs, Linux Data files and scripts: Introducing Regular
Expressions – Understanding character classes – using quantifiers – Introducing
Alternation and Grouping – Supporting Regular Expressions in Linux – Emacs modes and
Emacs as an IDE – File system layout – Passwd and Shadow files – group files – init files
and network files.
UNIT – III (19 Periods)
Processes and Signals : Understanding the process model – introducing process basics –
starting and stopping processes – using return codes – synchronizing actions –
understanding security – use of signals – signal handlers – signal sending -signals and
system calls

UNIT – IV (18 Periods)

Shared Memory and Semaphores – Pipes, FIFOs – Internet Sockets: Synchronization

with Semaphores – Communicating with Shared Memory, Setting up Pipes – Implementing
Redirection – Addressing Communication issues – Using FIFOs – Introduction to TCP/IP –
Protocols – Addressing Client Side Connections – Server side Connections.

Text Book:

1. John Goerzen, “Linux Programming Bible”, IDG Books India (P) Ltd., 2000.

References:

1. Richard Petersen, “Linux: The Complete Reference”, Tata McGraw Hill, Second
Edition, 2001.
2. Neil Mathew and Richard Stones, “Professional Linux Programming”, Wrox Press
Ltd., 2001.
 BCSDCS404R01 THEORY OF COMPUTATION
(Common for CSE, IT and ICT )
L T P CREDITS
3 1 0 4

UNIT – I (15 Periods)

Regular Languages: Finite Automata-Non determinism-Regular expressions-non-regular

languages, Context Free Languages: Context Free Grammars-Push Down Automata-Non
Context Free Languages.

UNIT – II (15 Periods)

The Church Turing Thesis: Turing Machines-variants of Turing Machines, Reducibility,

The Recursion Theorem-decidability of logical theories-Turing Reducibility

UNIT – III (15 Periods)

Time Complexity: Measuring Complexity-The class P-The class NP- NP completeness-

Definition-Cook Levin Theorem- vertex cover problem-Hamiltonian path problem. Space
Complexity: Savitch’s Theorem-PSPACE class-PSPACE completeness-The classes L and
NL-NL completeness-coNL

UNIT – IV (15 Periods)

Intractability: Hierarchy Theorems-Relativization-Circuit Complexity, Approximation

algorithms-Probabilistic algorithms-Interactive Proof Systems-Parallel Computation

Text Book:

1. Sipser, Michael, “Introduction to the Theory of Computation”, Second Edition,

Boston, MA: Thomson Course Technology, 2005.

References:
1. Jozef Gruska, “Foundations of Computing”, International Thomson Computer Press,
1997.
2. J.E.Hopcroft and J.D.Ullman, “Introduction to Automata Theory, Languages and
Computation”, Narosa Publishers, 2002.
3. J.C.Mortin, “Introduction to Languages and Theory of Computation”, McGraw Hill,
2002.
 BCSCCS 405 R02 OPERATING SYSTEMS LAB
L T P CREDITS
0 0 3 2

1. Write a C program that illustrates the execution of two commands concurrently

with a command pipe.
2. Write a C program that illustrates the creation of child process using fork system
call.
3. Write a C program that implements a producer-consumer system with two
processes
4. Write a C program that implements a Reader- Writer problem.
5. Write a C program that implements a Dining Philosopher Problem.
6. Write a C program that illustrates inter process communication using shared
memory system calls.
7. Write a C program that illustrates the following :
a. Creating a message queue.
b. Writing to a message queue.
c. Reading from a message queue.
8. Simulate the following CPU scheduling algorithms :
a. Round Robin b) SJF c) FCFS d) Priority
9. Simulate the following File Allocation strategies :
a. Sequential b. Indexed c. Linked
10. Simulate MVT and MFT
11. Simulate Bankers Algorithm for Dead Lock Avoidance.
12. Simulate Bankers Algorithm for Dead Lock Detection.
13. Simulate the following File Organization Techniques :
a. Single level directory b) Two level c) Hierarchical d) DAG
14. Simulate the following Page Replacement algorithms :
a. FIFO b) LRU c) LFU
15. Simulate Paging Technique of Memory Management.
 BCSCCS 406R01 JAVA PROGRAMMING LAB

L T P CREDITS
0 0 3 2

1. Polymorphism in java.
2. Inheritances in Java.
3. Interfaces in Java.
4. Packages in java.
5. Programs to create multiple threads in JAVA.
6. Developing a simple applet using labels, text fields and buttons.
7. Developing a simple applet using list box, choice box, scroll bar and check box.
8. Developing standalone GUI interface using frames.
9. Developing an applet for demonstrating the font features.  
10. Develop an applet using panels and layout manager.
11. Develop an applet for demonstrating graphics features – using brush styles, colors,
etc.,

 
 
 BCSCTP 407 HR SKILLS - II

L T P CREDITS
1 0 0 1

S.NO DETAILS NO.OF CLASSES

1. Creative Thinking-Picture/Case Study 2

2. Check your memory Power –Audio Visual Presentation 1

3. If I were …………?-Speech 2

4. Aptitude Test II 3

5. Skit/Mime Presentation-Group Exercise 2

6. The Book I like-(Book Review) 2

7. Quiz on Current Affairs 1

8. End Semester Examinations 2

TOTAL 15
 BCSDCS401 R01 OBJECT ORIENTED PROGRAMMING IN C++
(Common for CSE, IT and ICT)
L T P CREDITS
3 1 0 4

UNIT - I (15 Periods)

Introduction: Principles of Object Oriented Programming- C++-Applications-C++
statements-Structure –Tokens – Keywords-Identifiers-Constants-Data Types – user
defined-derived – declaration of variables – dynamic initialization of variables – reference
variables – operators in C++ - scope resolution – member dereferencing and memory
management operators – type cast operator – expressions and their types – operator
overloading – operator precedence-control structures
UNIT – II (15 Periods)
Functions, Classes and Objects: Function prototyping – call by reference- inline
functions-function overloading-friend and virtual functions – class – defining member
functions – nesting of member functions-private member functions-static data members –
static member functions-array of objects – objects as function arguments – pointers to
members-Constructors - destructors

UNIT –III (15 Periods)

Overloading, Inheritance and Polymorphism: Overloading unary, binary operators –
binary operators using friends, manipulation of strings- rules – type conversions – single,
multi-level, multiple, hierarchical, hybrid inheritance – virtual base classes- abstract classes
– virtual functions – pointers -pointers to objects.

UNIT – IV (15 Periods)

Files, Templates and Exception Handling: File stream operations – file modes – file
pointers – command line arguments, class templates – function templates – overloading of
template functions – basics of exception handling, mechanism, throwing, catching-
manipulation of strings.

Text Book:

1. E. Balagurusamy, “Object Oriented Programming with C++”, Tata McGraw Hill, Third
Edition, 2006.
References:
1. Bjarne Stroustrup, “The C++ Programming Language”, Pearson Education, Third
Edition, 2005.
2. Robert Lafore, “Object Oriented Programming in Turbo C++”, Galgotia Publications,
2006.
 BCSDCS 405R01 OBJECT ORIENTED PROGRAMMING LAB
(Common for CSE, IT and ICT)
L T P CREDITS
0 0 3 2

Develop C++ Program with the following concepts

1. Pointers and Arrays.

2. Structures and Functions.
3. Classes and Objects.
4. Unary and Binary Operator Overloading with and without Friend Functions.
5. Various types of Inheritance.
6. Virtual functions and Abstract Classes.
7. Overriding Virtual base functions.
8. Class and Function Templates.
9. Exceptions Handling.
10. Files and Streams.
11. Overloading Insertion/Extraction Operators.