II Year II Semester

Course Hours /Week

S. No. Course
Code L T P/D C
1 BS Mathematics – III 3 1 - 4
2 CS Computer Organization and Architecture 3 1 - 4
3 CS Object Oriented Programming Concepts 3 1 - 4
4 CS Operating Systems 3 - - 3
5 CS Theory of Computation 3 1 - 4
6 OE Open Elective – II 3 - - 3
7 CS Object Oriented Programming Concepts Lab - - 2 1
8 CS Operating Systems Lab - - 2 1
24

MATHEMATICS – III

COURSE OUTCOMES
At the end of the course the student should be able to:
1. Find the Laplace and Inverse Laplace transforms of a given function and apply them to solve
differential equations.
2. Recognize Irrotational and Solenoidal vector fields
3. Apply various integral theorems relating line, surface and volume integrals.
4. Understand the harmonic and analytic functions and also construct the analytic function.
5. Represent a given function in Taylor’s & Laurent’s series along a given path and evaluate
certain real integrals using integral theorems.

UNIT I
Laplace Transforms
Definition - Existence - Laplace transforms of standard functions - First & Second Shifting
theorems - Change of scale property - Laplace transform of Derivatives - Integrals- functions
multiplied by t - divided by t - Laplace Transform of Periodic functions.

UNIT II
Inverse Laplace Transforms
Inverse Laplace transforms by partial fractions - Inverse Laplace transforms of Derivatives -
Integrals - functions multiplied by s - divided by s - Convolution theorem - Applications of Laplace
transforms to Ordinary Differential Equations.

UNIT III
Vector Differentiation
Vectors - The Dot Product - The Cross Product - Lines and Planes in Space - Cylinders and Quadric
Surfaces - Arc Length in Space - Curvature and Normal Vectors of a Curve - Vector Fields –
Directional Derivatives - Gradient – Divergence – Curl - Vector Identities (without proofs).
UNIT IV
Vector Integration
Integral of a vector valued function – Line Integrals of Scalar Functions: Work, Circulation, and
Flux - Path Independence, Conservative Fields, and Potential Functions - Green's Theorem -
Surface Integrals - Stokes' Theorem - Divergence Theorem. (All theorems without proof)

UNIT V
Complex Analysis I
Analyticity – properties – Cauchy - Riemann conditions - harmonic and conjugate harmonic
functions, construction of analytic function. Line integral - Cauchy's integral theorem - Cauchy's
integral formula - Generalized integral formula - applications.

UNIT VI
Complex Analysis II
Radius of convergence - Expansion in Taylor's series - Maclaurin's series - Laurent series -
applications. Definitions - Singular point - Isolated singular point - pole of order m - essential
singularity. Residues - Evaluation of residues - Residue theorem (without proof) – applications.

TEXTBOOKS
1. Erwin Kreyszig, "Advanced Engineering Mathematics", John wiley & sons, 605 Third
Evenue, New York.
2. Peter V. O'Neil, "Advanced Engineering Mathematics", Cl-Engineering.

REFERENCE BOOKS
1. R.K.Jain, S.R.K. Iyengar, “Advanced engineering Mathematics", Narosa publishing house,
New Delhi
2. B.S.Grewal, "Higher Engineering Mathematics", Khanna publishers, Delhi.
3. J. W. Brown and R.V. Churchill, “Complex Variables and Applications”, McGraw Hill.
 COMPUTER ORGANIZATION AND ARCHITECTURE

COURSE OUTCOMES
At the end of the course, the students will develop ability to
1. Illustrate register transfer language using micro operations.
2. Explain Computer arithmetic, processor organization & design of control unit.
3. Comprehend memory hierarchy & organization.
4. Discuss input output devices organization, modes of transfer, pipelining and parallel processing.
5. Apply inter connection structures, arbitration, synchronization and coherence concepts to design
multiprocessor system..

UNIT I
Basic Structure of Computers: Functional units, Basic operational concepts
Digital Logic Circuits: Logic Gates, Boolean algebra, Sequential Circuits, basic Map
simplifications, Combinational Circuits - Decoders, Multiplexers.

UNIT II
Data Representation: Data Types, Complements, Fixed Point Representation, Floating Point
Representation. Register Transfer and Microoperations: Register Transfer, Bus and Memory
Transfers, Arithmetic Microoperations, Logic Microoperations, Shift Microoperations, Arithmetic
Logic Shift Unit.

UNIT III
Basic Computer Organization and Design: Instruction Codes, Computer Registers, Computer
Instructions, Timing and Control, Instruction Cycle.
Central Processing Unit: Register Organization, Instruction Formats, Addressing Modes.

UNIT IV
Computer Arithmetic: Addition, Subtraction, Multiplication and Division Algorithm.
Input-Output Organization: Peripheral Devices, Input-Output Interface, Asynchronous Data
Transfer, Modes of Transfer, Priority Interrupt, Direct Memory Access.

UNIT V
Pipelining: Arithmetic pipeline, Instruction pipeline, RISC Pipelining.

UNIT VI
Memory Organization: Memory Hierarchy, Main Memory, Auxiliary Memory, Associative
Memory, Cache Memory, Virtual Memory, Memory Management Hardware.

TEXT BOOKS
1. Carl Hamacher, ZvonkoVranesic and SafwatZaky, “Computer Organization”,
FifthEdition,McGraw Hill, 2002.
2. M. Morris Mano, “Computer System Architecture”, 3rd Edition, PHI / Pearson, 2006.

REFERENCE BOOKS
 1. William Stallings, “Computer Organization and Architecture”, 7th Edition, PHI / Pearson,
2006.
2. David A Patterson, “Computer Architecture and Organization”, TMH.

WEB LINKS
1. http://nptel.iitm.ac.in
2. http://computerscience.jbpub.com/ecoa/2e/student_resources.cfm
 OBJECT ORIENTED PROGRAMMING CONCEPTS

COURSE OUTCOMES
At the end of the course, the student will develop ability to
1. List all OOP features to design object oriented applications, and execute straight forward
programs using a high level language.
2. Discuss the principles and practice of object oriented analysis and design in the
construction of robust, maintainable programs which satisfy their requirements.
3. Analyze implementation, compilation, testing and run C++ programs comprising more than
one class, to address a particular software problem.
4. Classify effective use of applications through inheritance, Polymorphism, Exception
Handling, templates and File Handling.
5. Learning and implementing advanced concepts like Iterators, Vectors and containers.

UNIT I
Introduction
Review of C++, data types and size supported by C++, keywords, variables, scope and life time,
different types of operators, expressions, Conditional and Control statements. Arrays, strings and
its handling and functions.

UNIT II
OOP Basics
Introduction to Object Oriented Programming, Class Definition, Objects, Class Members, Access
Controls, Class Scope, Constructors and destructors, Inline functions, static data members and
static member functions, this pointer, friend functions, dynamic memory allocation and
deallocation :new and delete.

UNIT III
Polymorphism, Static Binding, Runtime Binding, Function Overloading, Operator Overloading.
Virtual Functions, Pure Virtual Functions, Abstract Class.

UNIT IV
Inheritance
Inheritance basics, Protected Data with Private Inheritance, Types of Inheritances : Single
Inheritance, Multilevel Inheritance, Multiple Inheritance, Hierarchical Inheritance, Hybrid
Inheritance, Multipath Inheritance, Virtual Base Classes, Constructors, Destructors, Inheritance,
Object as a Class Member, Abstract Classes, Qualifier Classes And Inheritance, Constructor In
Derived Class, Pointers and Inheritance, Advantages of Inheritance, Disadvantages of Inheritance

UNIT V
Exception Handling
Introduction to Exception Handling, Try, Throw and Catch, Multiple Catch Statements, Catching
Multiple Exceptions. Files and streams in C++, Streams I/O.
UNIT VI
Generic Programming- Function Templates and class templates, Standard Template Library,
Container Classes , Types Of Containers, Container Adaptors, Iterators.
TEXT BOOKS
1. Problem solving with C++, The OOP, Fourth edition, W.Savitch, Pearson education
2. Mastering C ++, Venugopal, Rajkumar, Ravi kumar TMH
3. C++ How To Program by Harvey Deitel, Paul Deitel, Publisher: Pearson

REFERENCE BOOKS
1. The Complete Reference, C++, 4ed, Herbert Schildt, TMH
2. Object Oriented Programming C++ , Joyce Farrell, Cengage
3. The C++ Programming Language (4th Edition) by Bjarne Stroustrup,
Addison-Wesley ISBN 978-0321563842
 OPERATING SYSTEMS

COURSE OUTCOMES
At the end of the course, the student will develop ability to
1. Understand the functions and services of an operating system that are provided to user and
system.
2. Apply various cpu scheduling algorithms and recognize classic synchronization problem to
avoid dead locks.
3. Apply the concepts of memory management to solve the issues in real time application
4. Analyze various disk scheduling algorithms.
5. Summarize the full range of considerations in the design of file systems and security issues

UNIT I
Computer system overview-basic elements, Instruction execution, operating system overview-
objectives and functions, Evolution of OS. Process description and control - process states, process
description, process control; Process and threads, Types of Threads.

UNIT II
Principles of concurrency - critical section, mutual exclusion, semaphores, monitors message
passing, Readers/Writers problem. Scheduling: Types of schedulers–CPU scheduling algorithms.

UNIT III
Memory management requirements, partitioning, paging, and segmentation, Address translation,
paging levels, Virtual memory, Page replacement algorithms.

UNIT IV
Deadlocks – prevention- avoidance – detection
I/O management and disk scheduling–I/O devices, organization of I/O functions, I/O buffering,
disk scheduling, RAID. Memory mapped I/O,DMA, Interrupt handlers, device drivers, power
management

UNIT V
File management–file and file system, file architecture, file organization and access, directories,
file sharing, record blocking, Secondary storage management.

UNIT VI
Computer Security Concepts - Threats, Attacks, and Assets, Intruders, Malicious Software
Overview–Trojan Horses, Viruses, Worms, Spyware, Rootkits and Bots, Access control, security
maintenance-Firewalls, Antivirus, Code Signing, Intrusion Detection, Explore Java Security
TEXT BOOKS
1. William Stallings, “Operating Systems – internals and design principle”, Prentice Hall India,
8th Edition, 2014.
2. Silberschatz, Peter Galvin, “Operating System Concepts”, 9th Edition, 2013,

REFERENCE BOOKS
1. Andrew S. Tannenbaum& Albert S. Woodhull, “Operating System Design and
Implementation”, Prentice Hall India, 3rd Edition, 2009.
2. Gary Nutt, “Operating System - A Modern Perspective”, Pearson Education Asia, 3rd
Edition 2003.
3. Harvey .M. Deitel, “Operating Systems”, 3rd Edition, 2003.
4. Ida M.Flynn, Ann MclverMcHoes, “Understanding Operating Systems”, 7th Edition ,
Thomson Learning ,2014

WEB LINKS
1. http://nptel.ac.in/courses/106108101/
2. http://williamstallings.com/OperatingSystems/OS7e-Student/
3. http://williamstallings.com/OS/OS6e.html
 THEORY OF COMPUTATION

COURSE OUTCOMES
At the end of the course, the student will develop ability to
1. Apply grammars and languages to design the automata.
2. Analyze the lemma’s, identity rules for regular languages
3. Design deterministic, non-deterministic and push down automata’s and turing machines
4. Analyze normal forms, ambiguity grammars and simplification of grammars.
5. Interpret different types of Chomsky hierarchy of languages and their capabilities

UNIT I
Fundamentals
Strings, Alphabet, Language, Operations, Finite state machine, definitions, finite automaton
model, acceptance of strings, and languages, deterministic finite automation and non deterministic
finite automaton, transition diagrams.

UNIT II
Finite Automata
NFA with Î transitions, acceptance of languages. Conversions and Equivalence: Equivalence
between NFA with and without Î transitions, NFA to DFA conversion
Minimisation
Minimisation of FSM, equivalence between two FSM’s, Finite Automata with output- Moore and
Mealy machines.

UNIT III
Regular Languages
Regular sets, regular expressions, identity rules, Constructing finite Automata for a given regular
expressions, Conversion of Finite Automata to Regular expressions. Pumping lemma of regular
sets, closure properties of regular sets (proofs not required).

UNIT IV
Grammar Formalism
Chomsky hierarchy of languages, Regular grammars-right linear and left linear grammars,
equivalence between regular linear grammar and FA, inter conversion.
Context free grammar: Context free grammar, derivation trees, sentential forms. Right most and
leftmost derivation of strings. Ambiguity in context free grammars. Minimisation of Context Free
Grammars

UNIT V
CFG Normal Forms
Chomsky normal form, Greiback normal form, Enumeration of properties of CFL (proofs omitted)
Push Down Automata
Push down automata, definition, model, acceptance of CFL, Acceptance by final state and
acceptance by empty state.

UNIT VI
Turing Machine
Turing Machine, definition, model, design of TM, recursively enumerable languages, types of
Turing machines (proofs not required).
Computability Theory
Linear bounded automata and context sensitive language, Posts Correspondence problem.

TEXT BOOKS
1. Hopcroft H.E. and Ullman J.D, “Introduction to Automata Theory Languages and
Computation”, Pearson Education.
2. Sipser, “Introduction to Theory of Computation”, 2nd Edition Thomson

REFERENCES BOOKS
1. Daniel I.A. Cohen, “Introduction to Computer Theory”, John Wiley.
2. John C Martin, “Introduction to languages and the Theory of Computation”, TMH.
3. Theory of Computer Science – Automata languages and computation -Mishra and
Chandrashekar

WEB LINKS
1. http://nptel.ac.in/courses/106104028/
2. http://www.comp.nus.edu.sg/~sanjay/cs4232.html
3. http://www.cs.virginia.edu/~robins/cs3102/
 OBJECT ORIENTED PROGRAMMING CONCEPTS LAB

COURSE OUTCOMES
At the end of the course, the students will develop ability to
1. Design, compile, test and execute straightforward programs using a high level language.
2. Discuss the principles and practice of object oriented analysis and design in the
construction of robust, maintainable programs which satisfy their requirements.
3. Analyze implementation, compilation, testing and run C++ programs comprising more than
one class, to address a particular software problem.
4. Illustrate Inheritance and Polymorphism .
5. Classify effective use of applications through inheritance, Polymorphism, Exception
Handling.

Week 1
1. Write a C++ program to find Factorial of a given number using for, while, do-while.
2. Write a C++ program to check given number is Armstrong Number or not.
3. Write a C++ Program to display Pyramid of numbers.

Week 2
1. Write a C++ program that prompts the user for an integer and then prints out all prime
numbers up to that integer.
2. Write a C++ program to multiply two given matrices.
3. Write a C++ Program to generate Fibonacci series upto given number.

Week 3
1. Write a C++ program using class.
2. Write a C++ program for sorting a given list of names in ascending order using class.
3. Write a C++ program using static data member and member functions.
4. Write a C++ program to implement friend functions.
5. Write a C++ program to implement Friend class.

Week 4
1. Write a C++ program using inline Functions.
2. Write a C++ program using this operator.
3. Write a C++ program to implement constructor and destructors.
4. Write a C++ Program to implement copy constructor.
5. Write a C++ program to implement parameterized constructor.

Week 5
1. Write a C++ program using new and delete operators.
2. Write a C++ program to implement static polymorphism
3. Write a C++ Program to implement Runtime Polymorphism.
4. Write a C++ program to implement operator overloading using Assignment Operator (=)
5. Write a C++ program to implement operator overloading using Relational Operators (<,>)

Week 6
1. Write a C++ program to implement operator overloading using addition Operator (+)
2. Write a C++ program to swap to numbers using Function Overloading
3. Write a C++ program to implement Virtual Functions.
4. Write a C++ program to implement pure Virtual Functions.

Week 7
1. Write a C++ program to implement Multiple Inheritance using Student Information System
2. Write a C++ program to implement Multilevel Inheritance using Library Information System.
3. Write a C++ program using Hierarchical Inheritance.

Week 8
1. Write a C++ program to implement Hybrid inheritance
2. Write a C++ program to implement Constructors under Inheritance
3. Write a program to implement Virtual Base Class.

Week 9
1. Write a C++ program to handle divide by zero exceptions.
2. Write a C++ program to handle multiple exceptions.
3. Write a C++ program to implement flow of execution of try/catch blocks.

Week 10
1. Write a C++ program to copy the contents one file to another file
2. Write a C++ program to display file information in reverse order.
3. Write a C++ program to implement streams.

Week 11
1. Write a C++ program to implement Function Templates.
2. Write a C++ program to implement Class Template
3. Write a C++ program to swap to numbers using function templates.

Week12
1. Write a C++ program to create simple calculator using class template.
2. Write a C++ program to implement containers.
3. Write a C++ program to implement Iterators.
 OPERATING SYSTEMS LAB

COURSE OUTCOMES
At the end of the course, the student will develop ability to
1. Execute various system calls in operating system.
2. Apply synchronization techniques to processes
3. Analyze the memory management and disk scheduling Algorithms.
4. Develop programs for page replacement and dead locks conditions.
5. Implement the file Allocation technique
Week 1
Implementation of
a) Basic Unix Commands: man, list, date, calendar, echo, banner, who, tty, binary calculator,
clear, manipulation (tput) .
b) Directory Related Commands: pwd, mkdir, cd, rmdir.

Week 2
Implementation of
a) File Related Commands: cat ,sort ,cp ,my , rm ,wc ,lp ,pg ,df ,free, filters and pipe.
b) Communication Through UNIX Commands: mesg, write, wall, mail, reply.

Week 3
a) Write a program to implement System Calls--(Fork, Exec, Sleep….)
b) Create a process in UNIX environment.
c) Write a program to illustrate exec.
d) Create child with sleep.
e) Write a program to demonstrate signal handling in UNIX (Kill).

Week 4
Implement CPU Scheduling algorithms
a) First Come First Serve.
b) Shortest Job First.

Week 5
Implement CPU Scheduling algorithms
a) Round Robin.
b) Priority.

Week 6
Producer Consumer Problem Using Semaphore
Implement the solution for Bounded Buffer (Producer-Consumer) Problem Using Inter Process
Communication Technique – Semaphores.

Week 7
Memory Management Scheme
a) Write a Program to implement Memory Management scheme like Paging.
b) Write a Program to implement Memory Management scheme like Segmentation.
Week 8
Implementation of Contiguous allocation techniques:
a) Worst-Fit
b) Best-Fit
c) First-Fit

Week 9
Simulate all Page Re-Placement Algorithms.

Week 10
Simulate Banker’s algorithm for Deadlock Avoidance.

Week 11
Simulate all Disk scheduling algorithms

Week 12
Simulate file storage allocation techniques:
a) Contiguous (Using Array)
b) Linked –List (Using Linked List)
c) Indirect Allocation (Indexing)
SOCIOLOGY
(Open Elective - II)
COURSE OUTCOMES
At the end of the course, the students will be develop ability to
1. Demonstrate the knowledge of core concepts of sociology.
2. Enrich their skill of social interaction through verbal and non-verbal communication.
3. Learn about socially acceptable behaviours in a group and use their sociological knowledge
in the course of their lives.
4. Think critically about the causes and effects of various social issues.
5. Design and evaluate empirical sociological research.

UNIT I
Introduction to Sociology: Sociology - Meaning, Nature, Scope and significance, Basic Concepts
of Society – Society, community, Role and Status, Norms and Value, Institution, Association.
Social Groups - Meaning, Type of Groups – Primary, Secondary, In Group, Out Group, Reference
Group.

UNIT II
Social Processes: Social Processes – Meaning, Socialization - Meaning, Socialization Theories.
Social Interaction: Social Interaction - Verbal - Non Verbal Communication, Forms of Social
Interaction - Cooperation, Competition, Conflict, Accommodation, Exchange – Virtual
Networking.
UNIT III
Social Control: Deviance and Conformity – Means and Agencies of Social Control.
Social Change: Theories and Factors of Social Change.

UNIT IV
Social Institutions: Marriage, Family, Kinship, Class, Caste, Religion, their function and features.

UNIT V
Social Research, Method and Techniques: Social Research – Definition, Steps in social research,
Research Method, Observation method, Interview method, Questionnaire method, Case Study
method, and Social Survey.

UNIT VI
Social Problems, Issues and Development Programmes: Social Problem – Meaning and
Definition, Importance of the study of Social Problems; Social Issues – Equality of caste, Class
gender, Communalism, Community Development Programmes, Women Empowerment.

TEXT BOOKS
1. Goode, W.J. and P.K.Hatt, “Methods in Social Research”, McGraw Hill International, 1952.
2. Ahuja, Ram, “Social Problems in India”, Rawat Publications, New Delhi, 2000.

REFERENCE BOOKS
1. Gisbert, “Fundamentals of Sociology”, Orient Blackswan, New Delhi, 2010.
2. Thakur, Devender, “Research Methodology in Social Science”, Delhi Deep and Deep
Publication, 2003.