FACULTY OF ENGINEERING AND TECHNOLOGY

REGULATIONS 2018
&
CURRICULUM & SYLLABUS
CHOICE BASED CREDIT SYSTEM
(Applicable to the students admitted from July, 2018)

B. TECH – COMPUTER SCIENCE AND ENGINEERING

(PART TIME)
I-VII SEMESTERS

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

BHARATH INSTITUTE OF SCIENCE AND TECHNOLOGY
NO: 173, AGARAM ROAD, SELAIYUR,
CHENNAI -600 073, TAMIL NADU
 CURRICULUM AND SYLLABUS
(R2018)
CHOICE BASED CREDIT SYSTEM
(Applicable to the batches admitted from July 2018)
B.Tech – COMPUTER SCIENCE & ENGINEERING
PART TIME
I – VII SEMESTERS

SEMESTER I
Sl. No. Contact
Course Code Category Course Title L T P C
Period
THEORY
1 PT18BSMA11 BS Engineering Mathematics 4 3 1 0 4
2
PT18PCCS11 PC Data Structures 3 3 0 0 3

3 PT18PCCS12 System Modelling and 3 3 0 0 3

PC
Simulation
4 PT18PCCS13 Computer Organization and
PC 3 0 0 3
Architecture 3
5 Digital Computer
PC 3 0 0 3
PT18PCCS14 Fundamentals 3
PRACTICAL
6 Object Oriented 4
PT18PCCSL1 PC Programming using C++ 0 0 4 2
Lab
Total 20 15 1 4 18

SEMESTER II
Sl. No. Contact
Course Code Category Course Title L T P C
Period
THEORY
1 PT18BSMA22 BS Numerical methods 4 3 1 0 4
2 Database Management
PT18PCCS21 PC 3 0 0 3
System 3
3 PT18PCCS22 0
PC Computer Networks
3 3 0 3
4 Operating Systems
PC 3 0 0 3
PT18PCCS23 3
PRACTICAL
5 PT18PCCSL2 PC DBMS Laboratory 3 0 0 3 1.5
Total 16 12 1 3 14.5
 SEMESTER III
Sl. No. Contact
Course Code Category Course Title L T P C
Period
THEORY
1 PT18BSMA31 BS Discrete Mathematics 4 3 1 0 4
2 Software Engineering
PT18PCCS31 PC 3 0 0 3
3
3 PT18PCCS32 Problem Solving & Python 0
PC
Programming 3 3 0 3
4
PC System Software 3 0 0 3
PT18PCCS33 3
PRACTICAL
5 Software Engineering 3
PT18PCCSL3 PC 0 0 3 1.5
Laboratory
Total 16 12 1 3 14.5

SEMESTER IV
Sl. No. Contact
Course Code Category Course Title L T P C
Period
THEORY
1 PC Microprocessors and its 3
PT18PCCS41 3 0 0 3
applications
2 PC Distributed Computing
PT18PCCS42 3 0 0 3
3
3 PT18PCCS43 PC Data Warehousing and 0
Data mining 3 3 0 3
4 PC Grid and Cloud
3 0 0 3
PT18PCCS44 Computing 3
PRACTICAL
5 Data Warehousing and 3
PT18PCCSL4 PC 0 0 3 1.5
Data mining Lab
6 Grid and Cloud Computing 3
PT18PCCSL5 PC 0 0 3 1.5
Lab
Total 18 12 0 6 15

SEMESTER V
Sl. No. Contact
Course Code Category Course Title L T P C
Period
 THEORY
1 PC Mobile and Pervasive 3
PT18PCCS51 3 0 0 3
Computing
2 PT18PCCS52 PC Web Technology
3 0 0 3
3
3 HS Organizational Behavior 0
PT18HSBA51
3 3 0 3
4 PE
Professional Elective-I 3 0 0 3
3
PRACTICAL
5 PT18PCCSL6 PC Web Technology Lab 3 0 0 3 1.5
Total 18 12 0 6 13.5

SEMESTER VI
Sl. No. Contact
Course Code Category Course Title L T P C
Period
THEORY
1 PC Artificial Intelligence and 4
PT18PCCS61 3 1 0 4
Expert Systems
2 PE Professional Elective-II
3 0 0 3
3
3 PE Professional Elective-III 0
3 3 0 3
4 OE
Open Elective-I 3 0 0 3
3
PRACTICAL
5 PT18PCCSL8 PC C# and .Net Lab 3 0 0 3 1.5
Total 16 12 1 3 14.5

SEMESTER VII
Sl. No. Contact
Course Code Category Course Title L T P C
Period
THEORY
1 MO Open Elective – II 2
2 0 0 2
(MOOC)
2 PE Professional Elective-IV
3 0 0 3
3
3 PE Professional Elective-V 0
3 3 0 3
PRACTICAL
4 PT18PRCS7P Project 12 0 0 12
PR
1 6
Total 20 12 0 3 14
TOTAL CREDITS TO BE EARNED FOR THE AWARD OF DEGREE: 104

PROFESSIONAL ELECTIVE - I
Sl.No Contact
Code No. Category Course Title Periods L T P C

1 PT18PECS11 PE Parallel Computing 3 3 0 0 3

2 PT18PECS12 PE Data Science 3 3 0 0 3

3 PT18PECS13 PE Software Reliability 3 3 0 0 3

PROFESSIONAL ELECTIVE - II
Sl.No Contact
Code No. Category Course Title Periods L T P C

1 PT18PECS21 PE VHDL 3 3 0 0 3

2 PT18PECS22 PE Big Data Analytics 3 3 0 0 3

3 PT18PECS23 PE Software Quality 3 3 0 0 3

Assurance

PROFESSIONAL ELECTIVE - III

Sl.No Contact
Code No. Category Course Title Periods L T P C

1 PT18PECS31 PE Computer Vision 3 3 0 0 3

2 PT18PECS32 PE Bio Inspired 3 3 0 0 3

Computing
3 PT18PECS33 PE Real Time Software 3 3 0 0 3
Testing

PROFESSIONAL ELECTIVE - IV
Sl.No Contact
Code No. Category Course Title Periods L T P C

1 PT18PECS41 PE TCP / IP Principles and 3 3 0 0 3

Architecture
2 PT18PECS42 PE Performance Evaluation in 3 3 0 0 3
Computer Systems
3 PT18PECS43 PE Advanced Computer 3 3 0 0 3
Networks

PROFESSIONAL ELECTIVE - V
Sl.No Contact
Code No. Category Course Title Periods L T P C

1 PT18PECS51 PE Mobile Communication 3 3 0 0 3

2 PT18PECS52 PE Object Oriented Database 3 3 0 0 3

Design
3 PT18PECS53 PE Advanced Web Design 3 3 0 0 3

OPEN ELECTIVE (for other programme students)

Sl.No. Code No. Category Course Title Contact L T P C
Periods
1 PT18OECS01 OE PHP Programming 3 3 0 0 3
2 PT18OECS02 OE Virtual Reality 3 3 0 0 3
3 PT18OECS03 OE E Commerce 3 3 0 0 3
4 PT18OECS04 OE High Speed Networks 3 3 0 0 3
Cellular
5 PT18OECS05 OE 3 3 0 0 3
Mobile Communication
 ENGINEERING MATHEMATICS – I L T P C
PT18BSMA11
Total Contact Periods – 60 3 1 0 4
Prerequisite – School Level Mathematics
Course Designed by – Department of Mathematics
Category BS
Approval 47th Academic Council Meeting held in Aug, 2018
OBJECTIVES
The aim is to develop mathematical curiosity and use inductive and deductive reasoning when
solving problems, and to develop the knowledge, skills and attitudes necessary to pursue further
studies in Mathematics and to become confident in using Mathematics to analyze and solve
problems in real – life situations.

UNIT I MATRICES 12
Eigen values and Eigenvectors of a real matrix- Characteristic Equation- Properties of Eigen values
and Eigenvectors- Cayley-Hamilton theorem (without proof) - application and uses -
Diagonalization of matrices, by Orthogonal Transformation - Reduction of a Quadratic form to
Canonical form.
UNIT II DIFFERENTIATION AND INTEGRAL CALCULUS 12
Successive differentiation curvature – Evolution and Envelope – Multiple Integration – Cartesian
Co-ordinate – polar Co-ordinates – triple integral.
UNIT III DIFFERENTIAL EQUATION 12
First order – second order linear differential equation with constant coefficient methods – method of
variation of parameter, linear differential equation with variable coefficient – Euler form –
Legendre’s form, simultaneous equation of 1s t order.

UNIT IV ANALYTIC FUNCTION AND COMPLEX INTEGRATION 12

Analytic function – C.R. equation in Cartesian co-ordinate form. Construction of analytic function,
Milne Thomson method, caushys integral formula.
UNIT V VECTOR CALCULUS 12
Vector Differentiation – differential operator, divergence, curl – directional derivative – solenoidal
vector – irrotataional vector – line integral, surface integral – volume integral. Green’s theorem –
stroke’s theorem – gauss divergence theorem and application.

TEXT BOOKS:
1. Bali N.P. and Manish Goyal, ‘Text book of Engineering Mathematics” , Third Edition,

Laxmi Publications(p) Ltd.,(2008).

2. Grewal B.S. Higher Engineering Mathematics, Khanna Publishers, 42nd Edition, Delhi 2012

3. Ramana. B.V. Higher Engineering Mathematics, Tata McGraw Hill Publishing

Company , 2008.
COURSE OUTCOMES (COs)
On completion of the course, the students will be able to
CO1 Identify Eigen value problems from practical areas using transformations; Diagonal sing
the matrix would render the Eigen values.
CO2 To apply differential and integral calculus to notions of curvature
CO3 To apply knowledge of differential equation & Euler's function
 CO4 Get the knowledge of analytic functions
CO5 To Understand the concept of Vector calculus & various theorems

PT18PCCS1 DATA STRUCTURES L T P C

1
Total Contact Periods – 45 3 0 0 3
Prerequisite – Fundamental of Computing and Programming
Course Designed by – Dept. of Computer Science & Engineering
Category PC
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES

This course demonstrates familiarity with major algorithms and data structures and analyzes
performance of algorithms. It is used to choose the appropriate data structure and algorithm
design method for a specified application and determine which algorithm or data structure to
use in different scenarios.

UNIT- I INTRODUCTION 9
Data objects and structures- The linear list data structure-Array Representation- Vector
Representation – Performance analysis- Space complexity – Time complexity.

UNIT- II DATA REPRESENTATION 9

Singly linked list– Circular lists- Doubly liked list – Stacks – Abstract Data Type – Array
Representation – Linked representation – Queues.

UNIT- III BINARY AND OTHER TREES 9

Trees – Binary trees – Properties of binary trees – Representation of binary trees – Binary tree
traversal – Priority queues- Linear lists – Heap – Binary search tree- Binary search tree
implementations –AVL trees -Graph – Graph search Methods.

UNIT- IV GREEDY METHOD 9

Optimization problems – Greedy method – Applications – Divide and conquer - The method –
Applications – Lower bounds on complexity.

UNIT- V DYNAMIC PROGRAMMING 9

The method – Applications – Backtracking - The method – Applications – Branch and bound -
The method – Applications.

TOTAL NO OF PERIODS: 45
 TEXT BOOK:
1. Sartaj Sahni, “Data Structures, Algorithms and Applications in C++”, Second Edition,
Universities Press.2005.

REFERENCES:
1. Horowitz, Sahni, Mehta, “Fundamentals of Data Structures in C++”, 2nd Edition,
Universities Press, 2007.
2. A.V.Aho, Hopcroft, Ullman, “Data Structures & Algorithms”, Pearson Education, 2005.
3. http://lib.mdp.ac.id/ebook/Karya%20Umum/Dsa.pdf

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Explain the basic data structures and its operations.

CO2 Explain the concept of time complexity and space complexity.

CO3 Identify an appropriate data structure for a problem.
CO4 Make use of basic data structures to solve problems.
CO5 Summarize various searching and sorting algorithms.

PT18PCCS12 SYSTEM MODELLING AND SIMULATION L T P C

Total Contact Periods – 45 3 0 0 3
Prerequisite – Fundamental of Computing and Programming
Course Designed by – Dept. of Computer Science & Engineering
Category PC
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES

The overall aim of the course is to provide an understanding of Methods, techniques and tools
for modeling, simulation and performance analysis of complex systems such as communication
and computer networks.

UNIT I INTRODUCTION TO SIMULATION 9

Advantages and disadvantages of simulation, areas of application, System environment,
Components of a system. Discrete and continuous systems, model of a system. Types of
models. Steps in a simulation study, simulation examples: simulation of queuing systems,
simulation of inventory systems. Discrete event simulation, general principles and computer
simulation languages. FORTRAN, SIMSCRIPT, GPSS.

UNIT-II STATISTICAL MODELS IN SIMULATION 9

Review of terminology and concepts. Useful statistical models, discrete distributions,
continuous distributions. Poisson process, Empirical distributions, Queuing models:
Characteristics of queuing systems, queuing notations. Transient and steady state behaviour of
 queues, steady-state behaviour of infinite population, Markovan models, Steady state
behaviour of finite population models.

UNIT-III INVENTORY SYSTEMS 9

Measures of effectiveness, inventory policies, deterministic systems probabilistic systems,

simulation in inventory analysis. Random number generation. Properties of random numbers.
Generation of pseudo-random numbers. Tests for random numbers. Random variate
generation: Inverse transform technique, Direct transform for the normal distribution,
convolution method. Acceptance-Rejection technique.

UNIT-IVINPUT DATA ANALYSIS 9

Data Collection, Identifying the distribution, Parameter estimation, Goodness-of-fit tests,

Verification and validation of simulation models: Models Building, calibration and validation
of models.

UNIT-V OUTPUT ANALYSIS FOR A SINGLE MODEL 9

Stochastic nature of 0/1 data, types of simulations with respect to O/P analysis, Measures of
performance and their estimation, O/P analysis for terminating simulations, O/P analysis for
steady-state simulations.

TEXT BOOKS:
1. Jerry Banks, Carson. J.S., and Nelson B.L., “Discrete Event System Simulation”, Prentice
Hall of India, New Delhi, 2006.
2. Karian, Z. A., Dudewicz, E. J. (112121), “Modern statistical systems, and GPSS
simulation: the first course”, W. H. Freeman and Company, New York, 2005.

REFERENCES
1. System Modelling and Simulation, V.P.Singh, New Age International Publishers,2009.
2 .https://shamsulsarip.files.wordpress.com/2015/07/system-modelling-and-simulation.pdf

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Define basic concepts in modelling and simulation (M&S)

CO2 Classify various simulation models and give practical examples for each category
CO3 Construct a model for a given set of data and motivate its validity
CO4 Generate and test random number varieties and apply them to develop simulation models.
CO5 Analyze output data produced by a model and test validity of the model.

PT18PCCS1 COMPUTER ORGANIZATION AND L T P C

3 ARCHITECTURE
Total Contact Periods – 45 3 0 0 3
Prerequisite – Fundamental of Computing and Programming
 Course Designed by – Dept. of Computer Science & Engineering
Category PC
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES:

To have a thorough understanding of the basic structure and operation of a digital computer.
To discuss in detail the operation of the arithmetic unit including the algorithms &
implementation of fixed-point and floating-point addition, subtraction, multiplication &
division.

UNIT-I ARCHITECTURE FUNDAMENTALS 9

Functional units – CPU Registers–CPU Organization-Different Types of Memory-Memory
Hierarchy- Memory operations –Instruction Format – Addressing modes – Basic I/O
operations-Evaluating CPU Performance.

UNIT-II CPU ARCHITECTURE 9

Instruction sets of different machines –Parallel Processing- Flynn’s Classification- Pipelining-
Arithmetic Pipeline-Instruction Pipeline- -Pipelining Hazards- CISC Vs RISC - Super Scalar
Architecture.

UNIT-III MEMORY SYSTEM 9

Basic concepts – Semiconductor RAMs – ROMs – Speed – size and cost –Cache Memory-
Mapping Techniques-Virtual memory-Evaluating Memory Performance-Secondary Storage-
Multiprocessor.

UNIT-IV I/O ORGANIZATION 9

Input-Output, Interface-I/O Performance Measures-I/O Modes of Transfer-Direct Memory
Access-Input Output Processor-Interfacing to different types of I/O devices.

UNIT-V PARALLEL ARCHITECTURE 9

Data flow –Static Dataflow-Dynamic Dataflow-Dataflow Graph-Vector Processors – CRAY-1
Vector Processor-EPIC.

TEXT BOOKS:
1.David A. Patterson and John L. Hennessy, “Computer Architecture-A Quantitative
Approach”, Elsevier, a division of reed India Private Limited, 5thedition, 2012
2. M. Mano, “Computer System Architecture”, Third Edition, Pearson Education,2008.

REFERENCE BOOKS:
1. Carl Hamacher, Zvonko Vranesic, Safwat Zaky, “Computer Organization”, McGraw-Hill,
5th Edition, Reprint 2012.
2. Ghosh T. K., “Computer Organization and Architecture”, Tata McGraw-Hill,3rd Edition,
2011
3. John P. Hayes, “Computer Architecture and Organization”, Tata McGraw Hill,3rd Edition,
1998
 4. Behrooz Parahami, “Computer Architecture”, Oxford University Press, 8th Impression,
2011.

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Explain the organization and working principle of computer hardware components.

CO2 Explain the hierarchical memory system and data transfer with in a digital computer.
CO3 Outline the operation of Arithmetic unit.

CO4 Summarize the execution sequence of an instruction through the processor

CO5 Explain the ways of communication between a processor and I/O devices.

PT18PCCS1 DIGITAL COMPUTER FUNDAMENTALS L T P C

4
Total Contact Periods – 45 3 0 0 3
Prerequisite – Engineering Mathematics, Fundamental of Computing and
Programming
Course Designed by – Dept. of Computer Science & Engineering
Category PC
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES:

To get a basic understanding of how circuits and systems are designed with digital electronic
circuit elements and analyze and design circuits and systems made from digital electronic
circuit elements such as gates and flip-flops.

UNIT-I NUMBER SYSTEMS AND CODES 9

Review of binary, octal and Hexa decimal representations of numbers and their conversion,
Binary arithmetic; conversion algorithms. Weighted binary codes. Non weighted binary codes
error-detecting and error-correcting codes-Alphanumeric codes.

UNIT-II BOOLEAN ALGEBRA 9

Introduction to Boolean algebra- The AND, OR and not operations. Laws of Boolean algebra
of Boolean expressions. Boolean expressions and logic diagrams. Universal building blocks.
Negative logic.

UNIT-I COMBINATIONAL LOGIC 9

Truth tables and maps. Sum of products and product of sums; Map reduction hybrid functions.
In completely specified functions. Multiple- Output minimization. Variable- Entered maps.
Tabular minimization. analysis of logic schematics. Synthesis of combinational functions.

UNIT-III LOGIC FUNCTION RELIZATION WITH MSI CIRCUITS 9

 Multiplexers, De-multiplexer, Decoders and code converters. Arithmetic circuits, Adder,
Number complements. Subtracting positive binary numbers with adders. Signed number
addition and subtraction.

UNIT-IV SYNCHORONOUS SEQUENTIAL CIRCUITS 9

Basic latch circuits, De-bouncing switch. Flip-flops, truth table and excitation table. Shift
registers. Asynchronous and synchronous counters. Shift counters.

UNIT-V ASYNCHRONOUS SEQUENTIAL CIRCUITS 9

Analysis and Design of Asynchronous Sequential Circuits , Reduction of State and Flow
Tables ,Race-free State Assignment, Hazards.

TEXT BOOKS:
1. T. L Floyd & Jain, “Digital fundamentals”, Pearson Education,3rd edition,2011.
2. Morris Mano M., “Digital Logic and Computer Design”, Pearson Education,2010.

REFERENCE BOOKS:
1. Heiser Man, “Digital IC applications”, Pearson Education,2007.
2. Raj Kamal, “Digital Systems Principles and Design”, Pearson Education, First Edition,
2007.
3. CharlesH.Roth, Jr. and Larry L. Kinney, “Fundamentals of Logic Design”, CL Engineering,
7th Edition, 2013.
4. WilliamH. Gothmann, “Digital electronics: an introduction to theory and practice”,Prentice-
Hall,2006 .
5. http://www.b-u.ac.in/sde_book/digi_com.pdf.

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Perform arithmetic operations in any number system.

CO2 Understand the hierarchical memory system and data transfer with in a digital computer.
CO3 Use Boolean simplification techniques to design a combinational hardware circuit.
CO4 Understand the concept of number system.

CO5 Learn the various gates like AND, OR, NOT, XOR.

PT18PCCSL1 OBJECT ORIENTED PROGRAMMING USING L T P C

C++ LAB
Total Contact Periods – 45 0 0 4 2
Prerequisite – Fundamental of Computing and Programming, Object Oriented
Programming using C++
Lab Manual Designed by – Dept. of Computer Science & Engineering
Category PC
Approval 47th Academic Council Meeting held in Aug, 2018
 LIST OF EXPERIMENTS:
1. Programs Using Functions
- Functions with default arguments
- Implementation of Call by Value, Call by Address and Call by Reference
2. Simple Classes for understanding objects, member functions and Constructors
- Classes with primitive data members
- Classes with arrays as data members
- Classes with pointers as data members – String Class
- Classes with constant data members, Classes with static member functions
3. Compile time Polymorphism
- Operator Overloading including Unary and Binary Operators, Function Overloading
4. Runtime Polymorphism
- Inheritance ,Virtual functions
- Virtual Base Classes, Templates
- File Handling-Sequential access, Random access.

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Demonstrate class object concepts by using C++.
CO2 Develop programs using inheritance and polymorphism.
CO3 Demonstrate the significance of constructors and destructor.
CO4 Implement function and operator overloading using C++.
CO5 Construct generic classes using template concepts.

PT18BSMA22 NUMERICAL METHODS L T P C

Total Contact Periods – 45 3 1 0 4
Prerequisite – Engineering Mathematics
Course Designed by – Dept. of Mathematics
Category BS
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES: To explore complex systems, physicists, engineers, financiers and

mathematicians require computational Methods since mathematical models are only rarely
solvable algebraically Linear algebra underlying systems of equations, ordinary differential
equations to simulate systems, and stochastic simulation under random influences. Explicit
schemes to solve ordinary differential equations; random numbers; stochastic system
simulation.

UNIT – I SOLUTION OF EQUATIONS AND EIGENVALUE PROBLEMS 9+3

Linear interpolation Methods (method of false position) – Newton’s method – Statement of
fixed point theorem – Fixed point iteration: x=g(x) method – Solution of linear system by
Gaussian elimination and Gauss-Jordon Methods - Iterative Methods: Gauss Jacobi and Gauss-
Seidel Methods - Inverse of a matrix by Gauss Jordon method – Eigen value of a matrix by
power method.
UNIT -II INTERPOLATION AND APPROXIMATION 9+3

Lagrangian Polynomials – Divided differences – Interpolating with a cubic spline – Newton’s

forward and backward difference formulas.

UNIT-III NUMERICAL DIFFERENTIATION & INTEGRATION

Derivatives from difference tables – Divided differences and finite differences –Numerical
integration by trapezoidal and Simpson’s 1/3 and 3/8 rules – Romberg’s method – Two and
Three point Gaussian quadrature formulas – Double integrals using trapezoidal and Simpsons’s
rules.

UNIT-IV INITIAL VALUE PROBLEMS FOR ORDINARY DIFFERENTIAL

EQUATIONS
Single step Methods: Taylor series method – Euler and modified Euler Methods – Fourth order
Runge – Kutta method for solving first and second order equations – Multistep Methods:
Milne’s and Adam’s predictor and corrector Methods.

UNIT- V BOUNDARY VALUE PROBLEMS IN ORDINARY AND PARTIAL

DIFFERENTIALEQUATIONS
Finite difference solution of second order ordinary differential equation – Finite difference
solution of one dimensional heat equation by explicit and implicit Methods – One dimensional
wave equation and two dimensional Laplace and Poisson equations.

TEXT BOOKS:
1. C.F. Gerald and P.O. Wheatley, ‘Applied Numerical Analysis’, Sixth Edition,
PearsonEducation Asia, New Delhi, 2002.
2. E. Balagurusamy, ‘Numerical Methods’, Tata McGraw Hill Pub.Co.Ltd, New Delhi, 1999.

REFERENCES:
1. P. Kandasamy, K. Thilagavathy and K. Gunavathy, ‘Numerical Methods’, S.Chand Co. Ltd.,
New Delhi, 2003.
2. R.L. Burden and T.D. Faires, ‘Numerical Analysis’, Seventh Edition, Thomson Asia Pvt. Ltd.,
Singapore, 2002.
3.https://www.math.ust.hk/~machas/numerical-Methods.pdf

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Solve a set of algebraic equations representing steady state models formed in engineering
problems.
CO2 Fit smooth curves for the discrete data connected to each other or to use interpolation
Methods over these data tables.
CO3 Find the trend information from discrete data set through numerical differentiation and
Summary information through numerical integration.
CO4 Predict the system dynamic behavior through solution of ODEs modeling the system.
CO5 Solve PDE models representing spatial and temporal variations in physical systems
Through numerical Methods.
PT18PCCS2 DATABASE MANAGEMENT SYSTEM L T P C
1
Total Contact Periods – 45 3 0 0 3
Prerequisite – Fundamental of Computing and Programming, Object Oriented
Programming using C++
Lab Manual Designed by – Dept. of Computer Science & Engineering
Category PC
Approval 47th Academic Council Meeting held in Aug, 2018
OBJECTIVES:
Most of the organizations depend on databases for storing the data and to share the data among
different kinds of users for their business operations Persistent storage required and several
users must be able to safely access the same data concurrently.

UNIT-I INTRODUCTION 9
Introduction – Database System Applications-Purpose of Database Systems- View of Data-
Data Abstraction- Instances and Schemas- Data Models-Database Languages -Relational
Databases- Database Design- The Entity-Relationship Model - Data Storage and Querying -
Transaction Management - Database Architecture -Database Users and Administrators.

UNIT-II RELATIONAL DATABASES 9

Introduction to Relational model - Structure of Relational Databases - Database Schema - Keys
- Schema Diagrams - Relational Query Languages - Relational Operations -Relational algebra -
Introduction to SQL - Overview of the SQL Query Language - SQL Data Definition - Basic
Structure of SQL Queries - Formal Relational Query Languages- The Relational Algebra-
Relational calculus- Relational database design-Normal Forms- Functional dependency.

UNIT-III DATA STORAGE AND QUERYING 9

Storage and File Structure - File Organization - Indexing and Hashing- Ordered Indices- Static
Hashing- Dynamic Hashing- Query Processing- Overview- Measures of Query Cost-Selection-
Sorting- Join Operation- Evaluation of Expressions- Query Optimization- Overview-
Transformation of Relational Expressions- Estimating Statistics of Expression Results- Choice
of Evaluation Plans.

UNIT-IV TRANSACTIONS 9
Transactions-Transaction Concept-A Simple Transaction Model-Storage Structure-Transaction
Atomicity and Durability-Transaction Isolation-Serializability-Transaction Isolation and
Atomicity-Transaction Isolation Levels-Transactions as SQL Statements-Concurrency Control-
Lock-Based Protocols-Deadlock Handling-Multiple Granularity-Time Stamp-Based Protocols-
Validation Based Protocols-Hierarchical model - Basic Concepts - Data-Structure Diagrams-
Network model.

UNIT-V OBJECT-BASED DATABASES 9

Overview-Complex Data Types-Structured Types and Inheritance in SQL-Table Inheritance-
Array and Multiset Types in SQL-Object-Identity and Reference Types in SQL-Implementing
O-R Features- Persistent Programming Languages-Object-Relational Mapping-Object-
Oriented versus Object-Relational - Data warehousing and Data Mining - Decision-Support
Systems-Data Warehousing- Data Mining-Classification-Association Rules-Other Types of
Associations-Clustering-Other Forms of Data Mining.

TEXT BOOKS:
1. Abraham Silberschatz, Henry. F. Korth and S. Sudharshan, “Database System Concepts”, 6 th
Edition, Tata McGraw Hill, 2011.
 2. RamezElmasri, Shamkant B. Navathe, “Fundamentals of Database Systems", 6 th Edition,
Addison-Wesley,2010.

REFERENCE BOOKS:
1.PakhiraMalay.K, “Database Management System”,PHI publication,2012.
2.NarainGehani, “The Database Book – Principles and Practice Using MySQL”, Universities
Press,2008.
3. Hector Garcia - Molina, Jeff Ullman and Jennifer Widom, “Database systems: The
Complete Book” 2nd Edition, Pearson Education,2008.
4. C. J. Date, A. Kannan and S. Swamynathan, “An Introduction to Database Systems”,
Pearson Education, 8thEdition,2006.
5. Database%20Management%20Systems%203Rd%20Edition.pdf

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Define the fundamental elements of database management systems.
CO2 Explain the basic concepts of relational data model and entity-relationship model.
CO3 Outline relational database design, relational algebra and database language SQL.
CO4 Explain the basic concepts of query processing, transaction management and file storage.
CO5 Develop a database for a given problem.

PT18PCCS2 COMPUTER NETWORKS L T P C

2
Total Contact Periods – 45 3 0 0 3
Prerequisite – Fundamental of Computing and Programming
Course Designed by – Dept. of Computer Science & Engineering
Category PC
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES
Computer Networking is the vital part of any organization these days. This course provides a
foundation to understand various principles, protocols and design aspects of Computer
Networks and also helps to achieve the fundamental purpose of computer networks in the form
of providing access to shared resources.

UNIT- I INTRODUCTION TO NETWORKS 9

Introduction: The uses of computer networks - Network hardware - Network software -
Reference models - Example of networks- Network standardization.
The Physical Layer: The theoretical basis for data communication – Guided Transmission
media - Wireless transmission – PSTN - Mobile telephone - Communication satellite.

UNIT- II DATALINK LAYER 9

The Data Link Layer: Data link layer design issues - Error detection and correction -
Elementary data link protocols - Sliding window protocols - Example of data link protocols-
 ETHERNET – 802.11, 802.16, Bluetooth- Data link layer Switching.

UNIT- III NETWORK LAYER 9

The Network layer: Network layer design issues - Routing algorithms - Congestion control
algorithms -Approaches to Congestion Control-Traffic-Aware Routing-Admission Control-
Traffic Throttling-Load Shedding - Internetworking- Network layer in Internet.

UNIT –IV TRANSPORT LAYER 9

The Transport layer: Transport layer design issues-Addressing, Connection Establishment-
Connection Release-Error Control and Flow Control - Transport protocols - Simple transport
protocol - Internet transport protocols UDP, TCP.

UNIT- V APPLICATION LAYER 9

The Application layer: Domain name system - Electronic mail - World wide web-Architectural
Overview-Static Web Pages-Dynamic Web Pages and Web Applications-HTTP—The
Hypertext Transfer Protocol-The Mobile Web-Web Search – Multimedia – Cryptography,
Digital signature- Communication Security.

TEXT BOOKS:
1. Andrew S. Tanenbaum, “Computer Networks”, Pearson Education, 5th edition 2010.
2. Behrouz A. Forouzan, “Data and Computer Communications”, 4th Edition, McGraw
Hill,2007.

REFERENCE BOOKS:
1.WilliamStallings,“Data and Computer Communications”,8th Edition, Pearson Education,2006
2. Douglas E. Comer, “Internetworking with TCP/IP, Volume-I”, 6 th Edition, Pearson
Education, 2013.
3.http://tocs.ulb.tu-darmstadt.de/49378155.pdf

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Explain data communication system, components and the purpose of layered architecture.
CO2 Illustrate the functionality of each layer of OSI and TCP/IP reference model.
CO3 Explain the data link layer and network layer protocols.
CO4 Outline the functions of transport layer protocols.
CO5 Summarize application layer protocols.

PT18PCCS2 OPERATING SYSTEMS L T P C

3
Total Contact Periods – 45 3 0 0 3
Prerequisite – Internet Programming, Computer Organization and architecture
Course Designed by – Dept. of Computer Science & Engineering
Category PC
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES:
Every computer professional should have a basic understanding of how an operating system
controls the computing resources and provide services to the users. This course provides an
introduction to the operating system functions, design and implementation.

UNIT- I INTRODUCTION TO OPERATING SYSTEM 9

Introduction: What operating systems do? – Computer System Organization - Computer
System Architecture – Single processor systems - Multiple processor systems – Clustered
Systems – Operating System Structure – Operating System Operations – Special purpose
systems: Real Time Embedded Systems, Multimedia Systems and Handheld Systems.
Operating System Services: System Calls – System Programs –Virtual Machines - Operating
System Design and Implementation.

UNIT- II PROCESS MANAGEMENT 9

Process Management: Process Concept – Process Scheduling – Operation on Process –
Cooperating Processes and Inter-process Communication. Threads: Overview –
Multithreading Models. Process Synchronization: The Critical Section Problem –
Synchronization Hardware – Semaphores – Classical Problems of Synchronization. Deadlocks:
System Model – Deadlock Characterization – Methods for handling Deadlocks – Deadlock
Prevention – Deadlock Avoidance – Deadlock Detection –Recovery from Deadlock.

UNIT- III CPU SCHEDULING 9

CPU Scheduling: Basic Concepts – Scheduling Criteria – Scheduling Algorithms. Memory
Management: Background – Swapping –Contiguous Memory Allocation –Paging -
Segmentation – Segmentation with paging. Virtual Memory: Demand paging – Page
Replacement – Thrashing – Allocation of Frames.

UNIT-IV FILE HANDLING 9

File Systems: File Concepts - Access Methods – Directory Structure – File System Mounting –
File Sharing – Protection. File System Structure – File System Implementation – Allocation
Methods - Free-Space Management – Directory implementation – Recovery.

UNIT- VLINUX 9
Secondary Storage Management: Disk Structure – Disk Scheduling – Disk Management –
Swap Space management-Case Study: Linux System – Components of Linux Systems –
Process Management – Process Scheduling – Security.

TEXT BOOKS:
1. Silberschatz, Galvin, Gagne, “Operating System Concepts”, 8 thedition, John Wiley & Sons,
Inc., 2009.
2.William Stallings, “Operating Systems”, Pearson Education, 6th Edition. 2006.

REFERENCS:
1. D.M.Dhamdhere, “Operating Systems: A Concept-Based Approach”, 2 nd Edition, Tata
McGraw Hill, 2006.
2. Andrew S. Tanenbaum, “Modern Operating Systems”, Pearson Education, 3 rd
Edition.2005.
https://it325blog.files.wordpress.com/2012/09/operating-system-concepts-7-th-edition.pdf

COURSE OUTCOMES (COs)

 On completion of the course, the students will be able to
CO1 Illustrate the operating system concepts and its functionalities.
CO2 Apply various CPU scheduling algorithms for problems.
CO3 Outline the needs and applications of process synchronization.
CO4 Identify the issues in deadlock and memory management.
CO5 Illustrate various file and disk management strategies.

PT18PCCSL2 DBMS LABORATORY L T P C

Total Contact Periods – 30 0 0 3 1.5
Prerequisite – Database Management System
Lab Manual Designed by – Dept. of Computer Science & Engineering
Category PC
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES: The main objective is students gain knowledge about databases for storing the
data and to share the data among different kinds of users for their business operations.

LIST OF EXPERIMENTS
1. Data Definition, Manipulation of base tables and views
2. High level programming language extensions.
3. Front end tools.
4. Forms-Triggers-Menu Design.
5. Reports.
6. Database Design and implementation
7. An exercise using Open Source Software like MySQL.

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Develop database modeling for a problem.
CO2 Design a database using normalization.
CO3 Implement a data base query language.
CO4 Develop GUI using front end tool.
CO5 Develop database modeling for a problem.

PT18BSMA31 DISCRETE MATHEMATICS L T P C

Total Contact Periods – 45 3 1 0 4
Prerequisite – Engineering Mathematics, Numerical Methods
Course Designed by – Dept. of Mathematics
Category BS
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES:
Reason Mathematically about basic data types and structures (such as numbers, sets, graphs,
and trees) used in computer algorithms and systems. Distinguish rigorous definitions and
conclusions from merely plausible ones; synthesize elementary proofs, especially proofs by
induction. Model and analyze computational processes using analytic and combinatorial
Methods.

UNIT-I LOGIC 12
Statements - Truth Tables - Connectives - Normal forms - Properties calculus - Inference
theory for statement Calculus and Predicate Calculus.

UNIT-II COMBINATORIES 12
Review of Permutation and Combination - Mathematical Induction - Pigeon hole Principle -
Principle of inclusion and exclusion - Generating function -Recurrence relations.

UNIT-III GROUPS 12
Semigroups- Monoids-Groups-Permutation group-Consets-Lagrange's theorem - Group
homomorphism- Kernal - Rings and Fields (Definitions and Examples only)

UNIT-IV LATTICES 12
Partial ordering - Posets - Hasse diagram - Lattices - Properties of Lattices - Sub Lattices -
Special Lattices - Boolean, Algebra

UNIT-V GRAPHS 12
Introduction of Graphs - Graph terminology - Representation of Graphs - Graph Isomorphism-
Connectivity- Euler and Hamilton Paths.

TEXT BOOKS:
1. Tremblay J.P and Manohar R, “Discrete Mathematical Structures with Application to
Computer Science”, McGraw Hill Book Company, International Edition, 1987, Sections 1
2,1 to 1-2,4; 1-2, 6 to 1-2,14; 1-3,1 to 1-3,5; 1-4,1 to 1-4,3; 1-5,- to 1-5,5:1-6, 4 and 1-6,5
for logic. Section 3:- 1,1 to 3-2, 3; 3-5,1 to 3-5, 5 for Groups Rings and Fields. Sections: 2,
3-8 and 2-3, 9; 4-1, 1 to 4-2, 2 for Lattices.
2. Kenneth H. Rosen, “Discrete Mathematics and its applications”, McGraw Hill Book
Company 1999, Section 3, 3, 4, 3, 6, 1, 6, 2, 6, 4, 6, 5, 7, 1-7, 5, 8, 1-8, 5

REFERENCE BOOKS:
1. Ralph P., Grimaldi, “Discrete and Combinatorial Mathematics”, Pearson Education, Fifth
Edition,2008
2. Venkataraman M.K, Discrete Mathematics”, The National Publishing Company 2000.
3. Iyengar S. N, Chandrasekaran V. M, Venkatesan K.A. and Arunachalam PS., “Discrete
Mathematics”, Vikas Publishing House Pvt. Ltd,2003.
4. http://www.cse.iitd.ernet.in/~bagchi/courses/discrete-book/fullbook.pdf

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Understand the theory and techniques of logic, graphs and trees, and algebraic systems.
CO2 Apply the knowledge and skills obtained to investigate and solve a variety of discrete
mathematical problems.
CO3 Communicate Mathematical Ideas.
CO4 Make effective use of appropriate technology.
CO5 Learn the concept about graphs.
PT18PCCS3 SOFTWARE ENGINEERING L T P C
1
Total Contact Periods – 45 3 0 0 3
Prerequisite – Internet Programming, Computer Organization and architecture
Course Designed by – Dept. of Computer Science & Engineering
Category PC
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES:

This course is intended to provide the students with an overall view over Software Engineering
discipline and with insight into the processes of software development.

UNIT- I INTRODUCTION 9
Software Engineering Process paradigms - Project management - Process and Project Metrics –
software estimation - Empirical estimation models - Planning - Risk analysis - Software project
scheduling.

UNIT- II REQUIREMENTS ANALYSIS 9

Requirement Engineering Processes – Feasibility Study – Problem of Requirements – Software
Requirement Analysis – Analysis Concepts and Principles – Analysis Process – Analysis
Model-Software Prototyping – Selecting the Prototyping Approach – Prototyping Methods
and Tools – Specification – Software Requirement Specification – Specification Review.

UNIT- III SOFTWARE DESIGN 9

Software design - Abstraction - Modularity - Software Architecture - Effective modular design
- Cohesion and Coupling - Architectural design and Procedural design - Data flow oriented
design.

UNIT- IV USER INTERFACE DESIGN AND REAL TIME SYSTEMS 9

User interface design - Human factors - Human computer interaction - Human - Computer
Interface design - Interface design - Interface standards. Programming languages and coding -
Language classes – Code documentation - Code efficiency - Software Configuration
Management.

UNIT- V SOFTWARE QUALITY AND TESTING 9

Software Quality Assurance - Quality metrics - Software Reliability - Software testing - Path
testing – Control Structures testing - Black Box testing - Integration, Validation and system
testing - Software Maintenance - Reverse Engineering and Re-engineering. CASE tools -
projects management, tools - analysis and design tools - programming tools - integration and
testing tool - Case studies.

TEXT BOOK:
1.Roger Pressman .S, Software Engineering, A Practitioner's Approach”, 7thEdition, McGraw
Hill, 2010.

REFERENCE BOOKS:
 1. I. Sommerville, “Software Engineering”, Eighth Edition, Pearson Education, 2007
2. Pfleeger, “Software Engineering-Theory & Practice”, 3rd Edition, Pearson Education, 2009
3. Carlo Ghezzi, Mehdi Jazayari, Dino Mandrioli, “Fundamentals of Software Engineering”,
Pearson Education, 2003.
4.http://www.vumultan.com/Books/CS605-Software%20Engineering%20Practitioner
%E2%80%99s%20Approach%20%20by%20Roger%20S.%20Pressman%20.pdf

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Outline the features of different lifecycle models.
CO2 Explain the principles involved in gathering and validating software requirements
CO3 Make use of suitable models through analysis of requirements and arrive at an appropriate
software design.
CO4 Appreciate the quality assurance procedures during software development.
CO5 Explain software project management and software maintenance practices.

PT18PCCS3 PROBLEM SOLVING AND PYTHON L T P C

2 PROGRAMMING
Total Contact Periods – 45 3 0 0 3
Prerequisite – NIL
Course Designed by – Dept. of Computer Science & Engineering
Category PC
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES:
To gain fundamental knowledge of algorithmic problem solving and python programming.

UNIT-I ALGORITHIMIC PROBLEM SOLVING 9

Introduction to components of a computer system - disks, memory, processor, operating system,
compilers – Problems, Solutions, Idea of Algorithm –Representation of Algorithm. Building blocks
of algorithms (statements, state, control flow, functions), notation (pseudocode, flow chart,
programming language), algorithmic problem solving, simple strategies for developing algorithms
(iteration, recursion). Problem Illustrations.

UNIT-II DATA, EXPRESSIONS, STATEMENTS 9

Python interpreter and interactive mode; values and types: int, float, boolean, string, and list;
variables, expressions, statements, tuple assignment, precedence of operators, comments; modules
and functions, function definition and use, flow of execution, parameters and arguments;
Illustrative programs: exchange the values of two variables, circulate the values of n variables,
distance between two points.

UNIT-III CONTROL FLOW, FUNCTIONS 9

Conditionals: Boolean values and operators, conditional (if), alternative (if-else), chained
conditional (if-elif-else); Iteration: state, while, for, break, continue, pass; Fruitful functions: return
values, parameters, local and global scope, function composition, recursion; Strings: string slices,
immutability, string functions and methods, string module; Lists as arrays. Illustrative programs:
square root, gcd, exponentiation, sum an array of numbers, linear search, binary search.

UNIT-IV LISTS, TUPLES, DICTIONARIES 9

Lists: list operations, list slices, list methods, list loop, mutability, aliasing, cloning lists, list
 parameters; Tuples: tuple assignment, tuple as return value; Dictionaries: operations and methods;
advanced list, Processing list comprehension; Illustrative programs: selection sort, insertion sort,
merge sort, histogram.

UNIT-V FILES, PACKAGES 9

Files and exception: text files, reading and writing files, errors and exceptions, handling exceptions,
packages: NumPy, SciPy, Matplotlib, Scikit-learn, Scilab Interface.

TEXT BOOKS:
1. Allen B. Downey, ‘Think Python: How to Think Like a Computer Scientist’, 2nd edition,
Updated for Python3, Shroff/O‘Reilly Publishers, 2016.
2. Guido van Rossum and Fred L. Drake Jr, ― An Introduction to Python – Revised and updated
for Python 3.2, Network Theory Ltd., 2011.

REFERENCES
1. John V Guttag, ―Introduction to Computation and Programming Using Python‘‘, Revised and
expanded Edition, MIT Press , 2013
2. Robert Sedgewick, Kevin Wayne, Robert Dondero, ―Introduction to Programming in Python:
An Inter-disciplinary Approach, Pearson India Education Services Pvt. Ltd., 2016.
3. Timothy A. Budd, ―Exploring Python‖, Mc-Graw Hill Education (India) Private Ltd.,, 2015.
4. Kenneth A. Lambert, ―Fundamentals of Python: First Programs‖, CENGAGE Learning, 2012.
5. Charles Dierbach, ―Introduction to Computer Science using Python: A Computational
Problem-Solving Focus, Wiley India Edition, 2013.
6. Paul Gries, Jennifer Campbell and Jason Montojo, ―Practical Programming: An Introduction to
Computer Science using Python 3‖, Second edition, Pragmatic Programmers, LLC, 2013.

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Develop algorithmic solutions to simple computational problems.

CO2 Demonstrate programs using simple Python statements and expressions.

CO3 To gain knowledge regarding control flow and functions associated with python.
CO4 Use Python data structures – lists, tuples & dictionaries for representing compound data.

CO5 To gain knowledge on files, exception, modules and packages in Python for solving problems.

PT18PCCS3 SYSTEM SOFTWARE L T P C

3
Total Contact Periods – 45 3 0 0 3
Prerequisite – Fundamental of Computing and Programming, Computer
Organization and Architecture, Operating System
Course Designed by – Dept. of Computer Science & Engineering
Category PC
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES:
The objective of this course is some of the major tasks of the system software of a computer
 system, focusing on internal working of the Hardware and Software interface of a typical
system.

UNIT –I INTRODUCTION TO SYSTEM SOFTWARE 9

Introduction, System Software and Machine Architecture, Simplified Instructional Computer
(SIC) - SIC Machine Architecture, SIC/XE Machine Architecture, SIC Programming
Examples-Instruction formats - Addressing modes -Typical Architectures.

UNIT- II ASSEMBLERS 9
Functions - Features - Machine dependent - Machine independent - Design options - One pass
- Multipass - Implementation – Examples-Basic Assembler Function - A Simple SIC
Assembler, Assembler Algorithm and Data Structures, Machine Dependent Assembler
Features - Instruction Formats & Addressing Modes, Program Relocation.

UNIT- III LINKER AND LOADER 9

Basic Loader Functions - Design of an Absolute Loader, A Simple Bootstrap Loader, Machine-
Dependent Loader Features – Relocation, Program Linking, Algorithm and Data Structures for
a Linking Loader; Machine-Independent Loader Features - Automatic Library Search, Loader
Options, Loader Design Options - Linkage Editor, Dynamic Linkage, Bootstrap Loaders,
Implementation Examples - MS-DOS Linker.

UNIT –IV TEXT EDITORS AND MACRO PROCESSOR 9

Text Editors - Overview of Editing Process, User Interface, Editor Structure, Interactive
Debugging Systems - Debugging Functions and Capabilities, Relationship With Other Parts Of
The System, User-Interface Criteria Functions - Macro parameters - Using labels - Conditional
macro expansion -Recursive macro expansion – General purpose macro processors -Examples.

UNIT- V COMPILER AND UTILITIES 9

Introduction to Compilers- Different phases of a compiler-Simple one pass compiler - Code
optimization techniques - System Software tools -Implementation of editors – Debuggers-Lex
and Yacc - The Simplest Lex Program, Recognizing Words With LEX, Symbol Tables,
Grammars, Parser-Lexer Communication, The Parts of Speech Lexer, A YACC Parser, The
Rules Section.

TEXT BOOKS:
1.L. Beck, “System Software - An Introduction to System Programming”, 3rd Edition, Pearson
Education, 2005.
2.John.R.Levine, Tony Mason and Doug Brown: Lex and Yacc, O'Reilly, SPD, 1998.

REFERENCES:
1.D.M. Dhamdhere, “System Programming and Operating Systems”, Tata McGraw Hill Company,
1999.
2http://uotechnology.edu.iq/ce/Lectures/Dr-Shaima-Sys-Prog/lec1-2-3-4.pdf
3.https://books.google.co.in/books?
id=s7zgF7InxIgC&printsec=frontcover&source=gbs_ge_summary_r&cad=0#v=onepage&q&f=fals
e.

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 An ability to understand Addressing modes and Instruction formats.
CO2 Understand the functionality of Assemblers.
CO3 Understand the Concept of Linkers and Loaders.
CO4 Ability understands the concept of Macro processors.
CO5 Summarize the concepts of Debuggers and implementation of editors.

PT18PCCSL3 SOFTWARE ENGINEERING LABORATORY L T P C

Total Contact Periods – 30 0 0 3 1.5
Prerequisite – Software Engineering
Lab Manual Designed by – Dept. of Computer Science & Engineering
Category PC
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVE:
The Main objective of this Software Engineering Lab is known about various phases in
software development.

1. Problem Analysis and Project Planning

Thorough study of the problem – Identify project scope, Objectives, infrastructure
2. Software Requirement Analysis
Describe the individual Phases/ modules of the project, Identify deliverables
3. Data Modeling
Use work products – data dictionary, use case diagrams and activity diagrams, build and test
lass diagrams, sequence diagrams and add interface to class diagrams.
4. Software Developments and Debugging
5. Software Testing
Prepare test plan, perform validation testing, coverage analysis, memory leaks, develop test
case hierarchy, Site check and site monitor.

LIST OF EXPERIMENTS
1. Library System
2. Course Registration System
3. Quiz System
4. Student marks analyzing system
5. Online ticket reservation system
6. Stock maintenance

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Analyze the problem and do project planning.
CO2 Identify project scope, objectives, and perform data modeling.
CO3
CO3 Identify the deliverables in various phases of SDLC.
CO4 Implement solutions using modern tools.
 CO5 Explain test plan, perform validation testing, coverage analysis.

PT18PCCS4 MICROPROCESSOR AND ITS APPLICATIONS L T P C

1
Total Contact Periods – 45 3 0 0 3
Prerequisite – Digital Computer Fundamentals, Computer Organization and
architecture
Course Designed by – Dept. of Computer Science & Engineering
Category PC
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES:
Become proficient in the functional and technological characteristics of microprocessor
architectures. Understand and write assembly language programs, Learn about memory
components, peripheral support devices and their interface logic.

UNIT-I INTRODUCTION TO MICROPROCESSOR 9

Evolution of microprocessors-Comparison of many computers with mini and large computers-
Advantages and limitations of microprocessors based system design. Architecture and
Organization: CPU-Registers-ALU Decoders-Bus system- Tri-state logic-Data Flow-Intel
architecture 8085 microprocessor-Function of various block and signals- Organization of a
micro-computer-Brief Introduction to Z80, MC 6800 and Intel 8086.

UNIT-III INSTRUCTION SET 9

The origin of software-program execution - Addressing modes-Instruction format- and
classifications - Intel 8085 Instruction set-Stack and subroutine-Instruction-Timing and
operation status.

UNIT-III BASIC PATTERNS OF MEMORY SYSTEMS 9

Memory devices: ROM, RAM, EPROM-Interfacing memory sections-Methods of data transfer
- Programmed data transfer schemes and DMA method of transfer-8257 programmable DMA
controller-Parallel I/O interfacing-Interfacing of ADC and DAC-Intel 8085 I/O-structure.

UNIT-IV INTERRUPT STRUCTURES 9

Need for interrupt structures-Handling of specific sources of interrupts-Software interrupts-
hardware interrupt – Multiple interrupt -polling and vectoring-8259 programmable interrupt
controller - 8255 programmable peripheral interface-8253/8254 programmable interval timer-
Interfacing of 7 segment display.

UNIT-V ASSEMBLY LANGUAGES PROGRAMMING 9

 Assembly Language programming-Mnemonics-Assemblers-Simple programs-List of arrays-
Arithmetic character manipulation-Flow chart-Subroutines –Debugging-Testing-Typical
programs using Intel 8085-Applications to temperature control and speed control of stepper
motor-Traffic light control-Microprocessor based data acquisition systems.

TEXT BOOK:
1.RameshS.Gaonkar, “Microprocessor Architecture, Programming and Applications with the
8085”,6th edition, Penram International Publishing (India) Pvt. Ltd., 2013

REFERENCE BOOKS:
1. A.P.Mathur, “Introduction to Microprocessors”, Third Edition, Tata McGraw Hill,2006
2. Rafiquzzaman, “Microprocessors and Microcomputer Development Systems: Designing
Microprocessor-Based Systems”, John Wiley & Sons Inc,2005
3. N.K. Srinath, “8085 Microprocessor: Programming and Interfacing”, PHI Learning,
2010.

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Identify the basic functions of a microprocessor and explain the instruction sets of 8085
and 8086 microprocessors.
CO2 Make use of the instruction set of 8085 microprocessor and develop assembly code to
Solve problems.
CO3 Illustrate the use of various general purpose interfacing devices.
CO4 Develop skills to write programs using 8086 processor development tools.
CO5 Compare the architecture of 8085, 8086 and 8051 microcontroller.

PT18PCCS4 DISTRIBUTED COMPUTING L T P C

2
Total Contact Periods – 45 3 0 0 3
Prerequisite – Computer Networks
Course Designed by – Dept. of Computer Science & Engineering
Category PC
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES:
The differences among concurrent, networked, distributed, and mobile, Resource allocation
and deadlock detection and voidance techniques.

UNIT- I INTRODUCTION 9
Characterization of Distributed Systems – Examples – Resource Sharing and the Web –
Challenges – System Models – Architectural and Fundamental Models – Networking and
Internetworking – Types of Networks – Network Principles – Internet Protocols – Case
Studies.

UNIT –II PROCESSES AND DISTRIBUTED OBJECTS 9

Inter–process Communication – The API for the Internet Protocols – External Data
Representation and Marshalling – Client –Server Communication – Group Communication –
 Case Study – Distributed Objects and Remote Invocation – Communication Between
Distributed Objects – Remote Procedure Call – Events and Notifications – Java RMI – Case
Study.

UNIT- III OPERATING SYSTEM ISSUES 9

The OS Layer – Protection – Processes and Threads – Communication and Invocation – OS
Architecture – Security – Overview – Cryptographic Algorithms – Digital Signatures –
Cryptography Pragmatics – Case Studies – Distributed File Systems – File Service
Architecture – Sun Network File System – The Andrew File System.

UNIT- IV DOMAIN NAME SYSTEM AND LOCKS 9

Name Services – Domain Name System – Directory and Discovery Services – Global Name
Service – X.500 Directory Service – Clocks – Events and Process States – Synchronizing
Physical Clocks – Logical Time And Logical Clocks – Global States – Distributed Debugging
– Distributed Mutual Exclusion – Elections – Multicast Communication Related Problems.

UNIT –V DISTRIBUTED TRANSACTION PROCESSING 9

Transactions – Nested Transactions – Locks – Optimistic Concurrency Control – Timestamp
Ordering – Comparison – Flat and Nested Distributed Transactions – Atomic Commit
Protocols – Concurrency Control in Distributed Transactions – Distributed Deadlocks –
Transaction Recovery – Overview of Replication And Distributed Multimedia Systems.

TEXT BOOKS:
1.George Coulouris, Jean Dollimore and Tim Kindberg, “Distributed Systems Concepts and
Design”, 3rd Edition, Pearson Education, 2002.
2.Andrew S. Tanenbaum, Maartenvan Steen, Distributed Systems, “Principles and Pardigms”,
Pearson Education, 2002.

REFERENCES :
1.SapeMullender, “Distributed Systems”, 2nd Edition, Addison Wesley, 1993.
2.Albert Fleishman, Distributes Systems, “Software Design and Implementation”, Springer,
Verlag, 1994.
3.M. L. Liu, “Distributed Computing Principles and Applications”, Pearson Education, 2004.
4.MugeshSinghal, Niranjan ,GShivaratri, “Advanced Concepts in Operating Systems”, Tata
McGraw Hill Edition, 2001.

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Explain the distributed environment.
CO2 Explain the functionalities of file management system.
CO3 Organize processes in distributed systems.
CO4 Demonstrate the access of remote objects for the service.
CO5 Explain the Concept of Domain Name Distributed Locks.

PT18PCCS4 DATA WAREHOUSING AND DATA MINING L T P C

3
Total Contact Periods – 45 3 0 0 3
Prerequisite – Data Structures
Course Designed by – Dept. of Computer Science & Engineering
Category PC
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES:
Dramatic advances in data capture, processing power, data transmission, and storage
capabilities are enabling organizations to integrate their various databases into data
warehouses, Data mining is primarily used by the companies with a strong consumer focus. It
enables these companies to determine the factors such as price, product positioning, or staff
skills, and economic indicators, competition, and customer demographics.

UNIT- I DATAWAREHOUSE 9
Data Warehouse Roles and Structures – What is a Data Warehouse? – Multi
Dimensional Data Model- Data Stores, Warehouses and Marts - The Data Warehouse
Environment – Data Warehouse Characteristics - The Data Warehouse Architecture – Meta
Data, Metadata Extraction - Implementing the Data Warehouse - OLAP Engine - Data
Warehouse Backend Process – Data Warehouse Project Success Factors.

UNIT- II INTRODUCTION TO DATA MINING 9

Basic Data Mining Tasks, Data Mining versus Knowledge Discovery in Data Bases, Data
Mining Issues, Data Mining Metrics. Social Implications of Data Mining.Data Mining from a
Database Perspective.

Data Mining Techniques - Introduction – A Statistical Perspective on Data Mining – Similarity

Measures – Decision Trees – Neural Networks – Genetic Algorithms.

UNIT-III CLASSIFICATION 9
Introduction - Statistical Based Algorithms- Distance Based Algorithms – Decision Tree
Based Algorithms - Neural Networks Based Algorithms – Rule Based Algorithms –
Combining Techniques.

UNIT IV ASSOCIATION RULES 9

Introduction-Large Itemsets- - Methods to Discover Association Rules - Apriori Algorithm -
Partition Algorithm.
Clustering Techniques
Introduction – Outliers – Clustering Paradigms –Hierarchical Algorithms, Partitional
Algorithms - Clustering Large Databases.

UNIT-V WEB MINING 9

Introduction-Web Mining – Web Content Mining –Crawlers, Harvest System, Virtual Web
View -Web Structure Mining –Page Rank, Web Usage Mining-Preprocessing, Data structures,
Pattern Discovery and Pattern Analysis.

TEXT BOOKS:
 1. ArunK.Pujari.,“Data Mining Techniques”, Universities Press,2013.
2. Margaret H. Dunham ,S.Sridhar, “Data Mining Introductory and Advanced Topics”, Pearson
Education,2006.
3. K.P.Soman,ShyamDiwakar,V.Ajay,”Data Mining: Theory And Practice” , PHI Learning
Pvt. Ltd., 2006.

REFERENCE BOOKS:
1. “Express Learning - Data Warehousing and Data Mining”, ITL ESL,Pearson Education,
2012.
2. N.Venkatesan,S.Prabhu,”Data Mining and WareHousing”, New Age International (P)
Limited, 2010.
3. George M. Marakas, “Modern Data Warehousing, Mining and Visualization: Core
concepts”, Pearson Education,2003.
4.http://www.essi.upc.edu/~aabello/publications/11.IGIBook1.pdf

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Provide efficient distribution of information and easy access to data.
CO2 Create user friendly reporting environment.
CO3 Find the unseen pattern in large volume of historical data that helps to manage an
organization efficiently.
CO4 Understand the concepts of various data mining Techniques.
CO5 Explain the Architecture of Data warehousing.

PT18PCCS4 GRID AND CLOUD COMPUTING L T P C

4
Total Contact Periods – 45 3 0 0 3
Prerequisite – Computer Networks
Course Designed by – Dept. of Computer Science & Engineering
Category PC
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES:
Identify the technical foundations of cloud systems architectures, Analyze the problems and
solutions to cloud application problem, Apply principles of best practice in cloud application
design and management. Identify and define technical challenges for cloud applications and
assess their importance.

UNIT- I GRID COMPUTING 9

Introduction - Definition and Scope of grid computing, Computational and Data Grids, Current
Grid Activities – Overview of Grid Business Areas, Grid Applications, Grid Computing
Anatomy- Concept of Virtual Organization, Grid Architecture- Fabric layer, Connectivity
layer, Resource Layer, Collective Layer, Application Layer, Layered Grid Architecture
UNIT-II CLOUD ARCHITECTURE AND MODEL 9
Technologies for Network Based system-System Models for Distributed and Cloud
Computing-NIST Cloud Computing Reference Architecture Cloud models: Characteristics-
Cloud Services-Cloud Models (IaaS, PaaS, SaaS)-Public vs. Private Cloud-Cloud Solutions-
Cloud ecosystem-Service Management-Computing on demand.

UNIT-III CLOUD INFRASTRUCTURE 9

Architectural Design of compute and Storage Clouds-Layered Cloud Architecture
Development-Design Challenges-Inter Cloud Resource Management-Resource Provisioning
and Platform Deployment-Global Exchange of Cloud Resources.

UNIT-IV PROGRAMMING MODEL 9

Parallel and Distributed Programming Paradigms-Map Reduce-Twister and Iterative Map
Reduce-Hadoop Library from Apache-Mapping Applications-Programming Support-Google
App Engine, Amazon AWS-Cloud Software Environments-Eucalyptus, Open Nebula, Open
Stack, Aneka, CloudSim.

UNIT-V CLOUD SECURITY 9

Security Overview-Cloud Security Challenges and Risks-Software-as-a-Service-Security
Security Governance-Risk Management-Security Monitoring-Security Architecture Design-
Data Security-Application Security-Virtual Machine Security-Identity Management and
Access Control-Autonomic Security.

TEXTBOOKS:
1. Joshy Joseph & Craig Fellenstein, “Grid Computing”, PHI, PTR-2003(UNIT I)
2.Kai Hwang, Geoffrey C Fox,Jack G Dongarra “Distributed and Cloud Computing ,From
parallel processing to the Internet of Things” Morgan Kaufmann Publishers,2012(Unit-II
to Unit-V)

REFERENCE BOOKS:
1. John W.Rittinghouse and James F.Ransome, “Cloud Computing Implementation,
Management and Security”, CRC Press, 2010
2. Toby Velte, Anthony Velte, Robert Elsenpeter,”Cloud Computing, A Practical Approach”,
TMH, 2009.
3. Kumar Saurabh,”Cloud Computing –Insights into New-Era Infrastructure “, Wiley India,
2011
4. George Reese, “Cloud Applications Architectures: Building Applications and Infrastructure
in the Cloud” O’Reilly.
5. https://benzology.files.wordpress.com/2013/05/grid-computing-joshy-joseph-ebook.pdf
6.http://cloudipedia.com/files/2009/11/cloud_computing_made_easy.pdf

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Understand the fundamental principles of distributed computing.
CO2 Understand how the distributed computing environments known as Grids can be built
from lower level services.
CO3 Understand the importance of virtualization in distributed computing and how this has
enabled the development of Cloud Computing.
CO4 Analyze the performance of Cloud Computing.
 CO5 Understand the concept of Cloud Security.

PT18PCCSL4 DATA WAREHOUSING AND DATA MINING L T P C

LABORATORY
Total Contact Periods – 30 0 0 3 1.5
Prerequisite – Data ware housing and Datamining
Lab Manual Designed by – Dept. of Computer Science & Engineering
Category PC
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES:
Data mining is primarily used by the companies with a strong consumer focus. It enables these
companies to determine the factors such as price, product positioning, or staff skills, and
economic indicators, competition, and customer demographics.

LIST OF EXPERIMENTS:
1. Listing applications for mining
2. File format for data mining
3. conversion of various data files
4. Training the given dataset for an application
5. Testing the given dataset for an application
6. Generating accurate models
7. Data pre-processing – data filters
8. Feature selection
9. Web mining
10. Text mining
11. Design of fact & dimension tables
12. Generating graphs for star schema.

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Provide efficient distribution of information and easy access to data
CO2 Create user friendly reporting environment.
CO3 Find the unseen pattern in large volume of historical data that helps to manage an
organization efficiently.
CO4 Understand the concepts of various data mining Techniques.
CO5 Understand the concepts of Preprocessing.

PT18PCCSL5 GRID AND CLOUD COMPUTING L T P C

LABORATORY
Total Contact Periods – 30 0 0 3 1.5
Prerequisite – Grid and Cloud Computing, Distributed Computing
Lab Manual Designed by – Dept. of Computer Science & Engineering
Category PC
Approval 47th Academic Council Meeting held in Aug, 2018
 OBJECTIVES:
Be exposed to tool kits for grid and cloud environment, familiar with developing web
services/Applications in grid framework and Learn to run virtual machines of different
configuration.

LIST OF EXPERIMENTS:
1.Connecting Zonal Server with JVishwa.
2.Find the Prime Number for largest interval using Grid Computing.
3.Calculate the Matrix multiplication using Grid Computing.
4. Find procedure to run the virtual machine of different configuration. Check how many
virtual machines can be utilized at particular time Find the missing dataset using hadoop and
map reduce.
5.Find procedure to attach virtual block to the virtual machine and check whether it holds the
data even after the release of the virtual machine Classification using Naïve bayes approach.
6.Install a C++ compiler in the virtual machine and execute a sample program.
7.Show the virtual machine migration based on the certain condition from one node to the
other.
8.Find procedure to install storage controller and interact with it.
9.Write a word count program to demonstrate the use of Map and Reduce tasks.

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Use the grid and cloud tool kits.
CO2 Design and implement applications on the Grid.
CO3 Design and Implement applications on the Cloud.
CO4 Connect Multiple System Using Zonal Server and JVishwa.
CO5 Implement the Theorem using Naive Bayes Approach.

PT18PCCS5 MOBILE AND PERVASIVE COMPUTING L T P C

1
Total Contact Periods – 45 3 0 0 3
Prerequisite – Computer Networks, Distributed Computing
Course Designed by – Dept. of Computer Science & Engineering
Category PC
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES
This course discuss about knowledge and skills about a new trend in mobile Computing.

UNIT I MOBILE NETWORKS 9

Cellular Wireless Networks–GSM–Architecture–Protocols–connection establishment– Frequency
Allocation–Routing–Mobility Management–Security–GPRS.

UNIT II WIRELESS NETWORKS 9

Wireless LANs and PANs–IEEE 802.11 Standard–Architecture–Services–Network–
HiperLAN–BlueToothWiFi–WiMAX.

UNIT III ROUTING 9

Mobile IP–DHCP–AdHoc– Proactive and Reactive Routing Protocols–Multicast Routing.
 UNIT IV TRANSPORT AND APPLICATION LAYERS 9
Mobile TCP–WAP–Architecture–WWW Programming Model–WDP –WTLS–WTP–WSP–
WAE–WTA Architecture–WML–WML Scripts.

UNIT V PERVASIVE COMPUTING 9

Pervasive computing infrastructure applications Device Technology Hardware, Human
machine Interfaces, Biometrics, and Operating systems– Device Connectivity–Protocols,
Security, and DeviceManagementpervasive Web Application architectureAccess from PCs and
PDAs Access via WAP.

TEXT BOOKS:
1. Jochen Schiller, “Mobile Communications”, PHI, Second Edition, 2003.
2. Jochen Burkhardt, Pervasive Computing: Technology and Architecture of MobileInternet A
pplications, Addison Wesley Professional; 3rd edition 2007.

REFERENCES:
1.Frank Adelstein, Sandeep KS Gupta, Golden Richard, Fundamentals of Mobile andPervasive
Computing, McGraw-Hill 2005
2. Debashis Saha, Networking Infrastructure for Pervasive Computing:
st
EnablingTechnologies, Kluwer Academic Publisher, Springer; 1 edition, 2002
3. Introduction to Wireless and Mobile Systems by Agrawal and Zeng, Brooks/
Cole(Thomson Learning),1st edition, 2002
4.Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, Principlesof
Mobile Computing, Springer, New York, 2003.
5.http://media.techtarget.com/searchMobileComputing/downloads/
Mobile_and_pervasive_computing_Ch06.pdf

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Explain the concepts and features of mobile networks.
CO2 Explain the working of wireless communication protocols.
CO3 Compare the routing protocols of mobile networks.
CO4 Explain the transport and application layer protocols of mobile networks.
CO5 Outline the basics of pervasive computing.

PT18PCCS5 WEB TECHNOLOGY L T P C

2
Total Contact Periods – 45 3 0 0 3
Prerequisite – Computer Networks, Distributed Computing
Course Designed by – Dept. of Computer Science & Engineering
Category PC
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES
This course discuss about various concepts using to develop web programming.

UNIT- I INTRODUCTION 9
 Internet principles – Basic Web concepts – Client/Server model – Retrieving data from Internet
– HTML and Scripting Languages – Standard Generalized Markup language-Next Generation
Internet - Protocols and applications.

UNIT- II COMMON GATEWAY INTERFACE PROGRAMMING 9

HTML forms – CGI concepts – HTML tags Emulation – Server-Browser communication –
Different Types of Browsers- E-mail generation – CGI client side Applets – CGI Server side
Applets – Authorization and Security.

UNIT- III SOCKET PROGRAMMING 9

Streaming – Networking Principles – Sockets – Protocols handlers – Content handlers –
Multicasting – Remote method invocation.-Activation-Serialization-Marshal streams.

UNIT- IV SERVER SIDE PROGRAMMING 9

Dynamic Web content – Cascading Style Sheets, XML – Structuring Data-VRML-Server side
includes- communication – Active and Java Server Pages.-Firewalls-Proxy Servers-XML with
HTML.

UNIT –V ON-LINE APPLICATIONS 9

Simple applications – On-line Databases – Monitoring user events – Plugins – Database
Connectivity-Internet information Systems-EDI application in business-Internet commerce-
Customization of Internet commerce.

TEXT BOOKS:
1. Paul Deitel, “Internet & World Wide Web: How to Program”, Prentice Hall, 4 th Edition,
2007.
2. E-Business and E-Commerce Management : S: Strategy, Implementation and Practice by
Dave Chaffey, Pearson Education,2013.

REFERENCE BOOKS:
1. Jeff Frantzen and Sobotka, “Java Script”, Tata McGraw Hill, 2002.
2. Eric Ladd, Jim O’Donnell, “Using HTML 4, XML and JAVA”, Prentice Hall of India –
QUE, 1999.
3. N.P.Gopalan&J.Akilandeswari, “Web Technology: A Developer’s Perspective”, PHI
Learning,2008.
4. http://www.icrar.org/__data/assets/pdf_file/0010/1439686/Web-Technology.pdf

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 To understand the concepts of common gateway interface (CGI) programming.
CO2 To Learn about socket program.
CO3 Implementation of on-line applications.
CO4 Explain About Server Side Programming.
CO5 To Learn about XML Concepts.

PT18PCCSL6 WEB TECHNOLOGY LABORATORY L T P C

Total Contact Periods – 30 0 0 3 1.5
Prerequisite – Internet Programming ,Fundamental of Computing and
Programming
 Lab Manual Designed by – Dept. of Computer Science & Engineering
Category PC
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES:
Demonstrate the role of languages like HTML, DHTML, CSS, XML, Java script, ASP and
protocols in the workings of the web and web applications.

LIST OF EXPERIMENTS
1. Create a HTML page, which has properly aligned paragraphs with image along with it.
2. Write a program to display list of items in different styles.
3. Create both client side and server side image maps.
4. Create your own style sheets and use them in your web page.,
5. Create a form with various fields and appropriate front and validations using any one of
the scripting languages.
6. Write a program to store the form fields in a database, use any appropriate Server Slide
Scripting.
7. Create a web page using XML.
8. Write a program to connect a XML web page to any database engine.

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Develop web pages using HTML, DHTML and Cascading Styles sheets
CO2 Develop web pages using HTML, DHTML and Cascading Styles sheets.
CO3 Develop a dynamic web pages using JavaScript (client side programming).
CO4 Develop an interactive web applications using ASP.NET.
CO5 Build and consume web services.

PT18PCCS6 ARTIFICIAL INTELLIGENCE AND EXPERT L T P C

1 SYSTEMS
Total Contact Periods – 60 3 1 0 4
Prerequisite – Computer Networks, Distributed Computing
Course Designed by – Dept. of Computer Science & Engineering
Category PC
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES
The purpose of this course is to impart concepts of Artificial Intelligence and Expert System.

UNIT- I PROBLEMS AND SEARCH 12

What is artificial intelligence? - Problems, problem spaces and search – Searching strategies-
Uninformed Search- breadth first search, depth first search, uniform cost seart, depth limited
search, iterative deepening search, bidirectional search - Informed Search- Best first
search ,Greedy Best first search , A* search – Constraint satisfaction problem , Local searching
strategies.

UNIT- II REASONING 12
 Symbolic Reasoning Under Uncertainty- Statistical Reasoning - Weak Slot-And-Filler-
Structure - Semantic nets – Frames- Strong Slot-And-Filler Structure-Conceptual Dependency-
Scripts- CYC.

UNIT- III KNOWLEDGE REPRESENTATION 12

Knowledge Representation - Knowledge representation issues - Using predicate logic -
Representing Knowledge Using Rules. Syntactic- Semantic of Representation – Logic & slot
and filler - Game Playing – Minimal search- Alpha beta cutoffs –Iteratic deepening planning –
component of planning system – Goal stack planning.

UNIT- IV NATURAL LANGUAGE PROCESSING 12

Natural Language Processing –Syntactic processing, semantic analysis-Parallel and Distributed
AI-Psychological modeling- parallelism and distributed in reasoning systems – Learning -
Connectionist Models – Hopfield networks, neural networks

UNIT- V EXPERT SYSTEMS 12

Common Sense –qualitative physics, commonsense ontologies- memory organization -Expert
systems –Expert system shells- explanation – Knowledge acquisition -Perception and Action –
Real time search- robot architecture.

TEXT BOOKS:
1.Elaine rich, Kevin knight, “Artificial Iintelligence”, 3/e, Tata Mcgraw Hill, 2009.
2.Russell , “ Artificial Intelligence :A Modern Approach , Pearson education ,3rd edition,2013

REFERENCE BOOKS
1.Artificial Intelligence and Expert system by V.Daniel hunt, Springer press,2011.
2. Nilsson N.J., ”Principles of Artificial Intelligence”, Morgan Kaufmann.1998.
3. http://www.ggu.ac.in/download/Class-Note13/Artificial%20Intelligence %20and%20Expert
%20System24.10.13.pdf

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Describe the modern view of AI as the study of agents that receive percepts from the
Environment and perform actions.
CO2 Demonstrate awareness of informed search and exploration Methods.
CO3 Explain about AI techniques for knowledge representation, planning and uncertainty
Management.
CO4 Develop knowledge of decision making and learning Methods.
CO5 Describe the use of AI to solve English Communication problems.

PT18PCCSL7 C# AND .NET LABORATORY L T P C

Total Contact Periods – 30 0 0 3 1.5
Prerequisite – Object Oriented Programming Using C++
Lab Manual Designed by – Dept. of Computer Science & Engineering
Category PC
Approval 47th Academic Council Meeting held in Aug, 2018
 OBJECTIVES:
The main Objective of this course is student know about windows, Web and Console Applications.

LIST OF EXPERIMENTS
1. Classes and objects
2. Inheritance
3. Operator overloading
4. Threading
5. Events and delegates
6. Working with windows forms controls
7. Validating data
8. Creating custom dialog box
9. Designing an MDI application with menu
10. Retrieving data from a SQL database
11. Manipulating data in a connected environment
12. Manipulating data in a disconnected environment

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Display proficiency in C# by building stand-alone applications in the .NET framework
using C#.
CO2 Create distributed data-driven applications using the .NET Framework, C#, SQL Server
and ADO.NET
CO3 Create web-based distributed applications using C#, ASP.NET, SQL Server and ADO.NET
CO4 Utilize DirectX libraries in the .NET environment to implement 2D and 3D animations and
game-related graphic displays and audio.
CO5 Utilize XML in the .NET environment to create Web Service-based applications and
components.

PROFESSIONAL ELECTIVE - I

PT18PECS11 PARALLEL COMPUTING L T P C

Total Contact Periods – 45 3 0 0 3
Prerequisite – Computer Organization and Architecture, Operating Systems
Course Designed by – Dept. of Computer Science & Engineering
Category PE
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES:
To know about the components and building block hypothesis of Genetic algorithm.
understand the features of neural network and its applications.

UNIT-I PARALLEL COMPUTING MODELS &PROGRAM 9

The State of Computing. Multiprocessors & Multi computers, Multi vector & SIMD
Computers, PRAM&VLSI Models, Architectural Development Tracks, Conditions of
 Paralleling Programming, Partitioning & Scheduling, Programming flow mechanism. Systems
interconnect Architecture.

UNIT-II PARALLEL COMPUTER PERFORMANCE 9

Performance Metrics & Measures, Parallel Processing Application, Speedup performance
laws, Scalability analysis &approaches. Processors& memory hierarchy. Advanced processor
technology. Superscalar & Vector processes, Memory hierarchy technologies. Virtual Memory
Technology.

UNIT-III BUS, CACHE, MEMORY & PIPELINING TECHNIQUES 9

Backup bus system, Cache memory organization. Shared memory organization, Sequence &
Weak consistency models. Linear pipeline processes - nonlinear pipeline processes. Instruction
pipeline design, arithmetic pipeline design, Superscalar & Super pipeline design.

UNIT-IV MULTIPROCESSORS & MULTI COMPUTERS 9

Multiprocessor system interconnects. Cache coherence & synchronous mechanisms, Three
generation of multi computers. Message-passing mechanism. Principles of multithreading,
Fine-grained multi computers, Callable& Multithreaded architecture, Data flows Hybrid
architecture.

UNIT-V SOFTWARE FOR PARALLEL PROGRAMMING 9

Parallel programming models, parallel layers & compilers, dependency analysis of data arrays,
code optimization & scheduling, Loop parallelization & pipelining, Multiprocessor mix design
goals.

TEXTBOOKS:
1. Kai Hwang, “Advanced Computer Architecture, Parallel Scalability Programmability”-
Tata McGraw Hill,2012.
2. Parallel computing: theory and practice, Michael Quinn, TMH Edition, 2002.
3.http://www-users.cs.umn.edu/~karypis/parbook/Lectures/GK-CS5451/Chapter
%202%20-%20Parallel%20Programming%20Platforms.pdf

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Be able to reason about ways to parallelize a problem.
CO2 Be able to evaluate a parallel platform for a given problem.
CO3 Become familiar with programming with MPI and Vector processor.
CO4 Given a problem, develop an efficient parallel algorithm to solve it.
CO5 Have knowledge of sufficient theoretical background to be able to reason about the
behaviour of neural networks.

PT18PECS12 DATA SCIENCE L T P C

Total Contact Periods – 45 3 0 0 3
Prerequisite – Data ware housing and Data mining
Course Designed by – Dept. of Computer Science & Engineering
Category PE
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES:
Develop in depth understanding of the key technologies in data science and business analytics:
data mining, machine learning, visualization techniques, predictive modeling, and statistics.

UNIT- I INTRODUCTION TO DATA SCIENCE 9

Data Science - Data Scientist- scope of Data Science: the open data movement, science,
business, government, education, and sport-Introduction to the R data analysis environment-
Formulating data-centric answers to scientific, business and social questions-Best practices:
organizing projects, managing collaborations and expectations.

UNIT –II DATA MANAGEMENT 9

Database SQL, data cleaning, normalization, feature selection -creation spectral-
decompositions and dimensionality reduction. Exploratory Data Analysis- Data scraping-
cleaning and summarization-Visualization I: visualizing to explore-Exploration in scale:
introduction to map reduce.

UNIT-III COMPUTATIONAL AND STATISTICAL DATA ANALYSIS 9

Descriptive-dataquality-Exploratory-statistics-correlation-ANOVA-Inferential-theoryof
generalization-sampling-statistical-testing-Predictive-supervised-unsupervised-machine
learning- exploration to inference- quantifying variation and uncertainty- Linear modeling-
regression and prediction- visualizing inferences and uncertainty

UNIT- IV HASHING AND ASSOCIATION RULES 9

Introduction - Frequent item sets and Association rules - Locality Sensitive Hashing - Theory
of Locality Sensitive Hashing - Dimensionality Reduction: SVD and CUR - Web spam and
Trust Rank, Random Walks with Restarts - Large-Scale Machine Learning: Support Vector
Machines - Large-Scale Machine Learning: Decision

UNIT-V GRAPH TEXT MINING AND CLUSTERING 9

Methods and tools for pre-processing- indexing-querying-retrieval -ranking of text at the
document - collection levels- Algorithms for text Foriented application in web and social
network- Methods and tools for pre-processing graphs- Community mining methods-graph
clustering methods(MinFcut, Spectral, Clustering).

TEXTBOOKS:
1. 1. Introduction to Data Science, with Introduction to R Jeffrey Stanton 2012.
2. Georg Hager, Gerhard Wellein, Introduction to High Performance Computing, CRC Press,
2011.

REFERENCES:
1. Wagner, S., Steinmetz, M., Bode, A., Müller, M.M. (Eds.),, High Performance Computing
in Science and Engineering, Garching/Munich, Springer Verlog, 2010.
2. https://ischool.syr.edu/media/documents/2012/3/DataScienceBook1_1.pdf

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Demonstrate knowledge of statistical data analysis techniques utilized in business decision
making.
 CO2 Apply principles of Data Science to the analysis of business problems
CO3 Use data mining software to solve real-world problems.
CO4 Employ cutting edge tools and technologies to analyze Big Data.
CO5 Demonstrate use of team work, leadership skills, decision making and organization theory.

PT18PECS13 SOFTWARE RELIABILITY L T P C

Total Contact Periods – 45 3 0 0 3
Prerequisite – Software Engineering
Course Designed by – Dept. of Computer Science & Engineering
Category PE
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES:
Explain how system reliability can be measured and how reliability growth models can be used
for reliability prediction.

UNIT- I INTRODUCTION TO RELIABILITY 9

Reliability - Repairable and Non Repairable systems - Maintainability and Availability -
Designing for higher reliability - Redundancy - MTBF - MTTF MDT - MTTR- k out of in
systems.

UNIT- II SOFTWARE RELIABILITY 9

Software reliability - Software reliability Vs Hardware reliability - Failures and Faults -
Classification of Failures - Counting - System Configuration - Components and Operational
Models - Concurrent Systems - Sequential Systems - Standby Redundant systems.

UNIT- III FAULT DETECTION 9

Fault Avoidance - Passive Fault detection - Active Fault Detection - Fault Tolerance - Fault
Recovery - Fault Treatment.

UNIT –IVSOFTWARE RELIABILITY MODELLING 9

Introduction to Software Reliability Modeling - Parameter Determination and Estimation -
Model Selection - Markovian Models - Finite and Infinite failure category Models -
Comparison of Models - Calendar Time Modeling

UNIT- V SPECIAL TOPICS IN SOFTWARE RELIABILITY 9

Management Techniques for reliability - Organization and Staffing - Programming Languages
and Reliability - Computer Architecture and Reliability - Proving Program correctness &
Reliability Design - Reliability Testing - Reliability Economics.

TEXT BOOKS:
1. John D. Musa, "Software Reliability", McGraw Hill, 1985
2. Glenford J. Myers, "Software Reliability", Wiley Interscience Publication, 1976
3. Michael Berthold, David J. Hand,” Intelligent Data Analysis”, Springer, 2007.
 REFERENCES:
1. Patric D. T.O Connor, "Practical Reliability Engineering", 4th Edition, John Wesley & sons,
2003.
2.http://2014.issre.net/sites/2014.issre.net/files/Tutorial_Williams_Slides.pdf

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 To understand the software reliability and its various model.
CO2 To understand the metrics used for software reliability and maintainability.
CO3 To understand the fault detection and correction approaches used in developing quality
software.
CO4 To understand the design principles for achieving higher reliable software system.
CO5 Apply reliability estimation methods.

PROFESSIONAL ELECTIVE – II

PT18PECS21 VHDL L T P C
Total Contact Periods – 45 3 0 0 3
Prerequisite – Digital Computer Fundamentals, System Modelling and
Simulation.
Course Designed by – Dept. of Computer Science & Engineering
Category PE
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES:

Code in VHDL for synthesis, Decompose a digital system into a controller (FSM) and data path,
and code accordingly ,Write VHDL test benches, Synthesize and implement digital systems on
FPGAs.

UNIT- IINTRODUCTION TO VHDL 9

Introduction to VHDL - VHSIC Program - VHDL as a standard - Learning VHDL - VHDL
Terms - Traditional Design Methods - Behavioral Modeling -Introduction - Transport verses
Inertiai Delay - Simulation Deltas - Drivers -Sequential Processing Process Statement - Signal
Assignment versus Variable Assignment - Sequential statements - Wait statements Concurrent
Assignment Problem - Passive Processes.

UNIT- II DATA TYPES 9

Data Types - Object Types - Data types - File type caveats Subprograms and packages -
Subprograms - Packages Predefined Attributes - Value kind attributes - Function kind
attributes -Signal kind attributes - type kind attributes - Range kind attributes.

UNIT- III CONFIGURATIONS 9

Configurations - Default Configurations - Component Configurations -Mapping Library

Entities - Generic in Configurations - Generic value specification in Architecture - Generic
specification in Configurations - Board socket - chip analogy - Block configurations
Architecture configurations - Advanced Topics- Register Transfer level description-
Constraints-Attributes - Technology Libraries-Synthesis-VHDL Synthesis.

UNIT -IV DESIGN FLOW AND SIMULATION 9

High Level Design Flow- RTL Simulation -VHOL Synthesis functional Gate Level
Verification - Place and Route - Post Layout Timing Simulation Static Timing - Top Level
System.
Design - CPU Design - Top - Level system Operation - instructions - sample Instruction
Representation - CPU -Top - Level Design.

UNIT- V VITAL ARCHITECTURE 9

CPU: Synthesis Description - ALU, Comp, Control, Reg. Register array Shift, TRIREG-CPU:
RTL Simulation-Test benches - CPU Simulation - CPU: Synthesis Results - Place and Route
process-placing and routing the Device-CPU: VITAL Simulation - VITAL Library - VITAL
Simulation Overview- VITAL Implementation Simple VITAL Model -VITAL Architecture -
SDF File – Back - Annotated Simulation.

TEXT BOOKS:
1. Douglas Perry, “VHDL”, McGraw Hill, 3rd Edition, 1999
2. J. Bhasker, “A VHDL Primer”, Pearson Education, 3rd Edition, 2005.

REFERENCE:
1. http://www.edutechlearners.com/download/books/A%20VHDL%20Primer%20-
%20Jayaram%20Bhasker.pdf

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Understand and use major syntactic elements of VDHL - entities, architectures, processes,
functions, common concurrent statements, and common sequential statements.
CO2 Design combinational logic in a variety of styles including: structural VHDL, and
behavioral VHDL, as well as demonstrate an awareness of timing and resource usage
associated with each approach.
CO3 Create a VDHL test bench and use it to test/verify a sequential VHDL design of moderate
complexity.
CO4 Draw for a given commented VHDL code of moderate complexity, a corresponding RTL
 level block diagram.
CO5 Create Combinational logic design - Schematic and VHDL.

PT18PECS22 BIG DATA ANALYTICS L T P C

Total Contact Periods – 45 3 0 0 3
Prerequisite – Data Structures, Data Ware Housing and Data Mining
Course Designed by – Dept. of Computer Science & Engineering
Category PE
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES
The basics of Analytics – Concepts, Data preparation – merging, managing missing numbers
sampling, Data visualization, Basic statistics.

UNIT- IINTRODUCTION TO BIG DATA 9

9
Analytics – Nuances of big data – Value – Issues – Case for Big data – Big data options Team
challenge – Big data sources – Acquisition – Nuts and Bolts of Big data. Features of Big Data -
Security, Compliance, auditing and protection - Evolution of Big data – Best Practices for Big
Data Analytics - Big data characteristics - Volume, Veracity, Velocity, Variety – Data
Appliance and Integration tools – Greenplum – Informatica.

UNIT- II DATA ANALYSIS 9

Evolution of analytic scalability – Convergence – parallel processing systems – Cloud

computing –grid computing – map reduce – enterprise analytic sand box – analytic data sets –
Analytic Methods –analytic tools – Cognos – Micro strategy - Pentaho. Analysis approaches –
Statistical significance –business approaches – Analytic innovation – Traditional approaches –
Iterative

UNIT- III STREAM COMPUTING 9

Introduction to Streams Concepts – Stream data model and architecture - Stream Computing,
Sampling data in a stream – Filtering streams – Counting distinct elements in a stream –
Estimating moments – Counting oneness in a window – Decaying window – Real time
Analytics Platform(RTAP)applications IBM Infosphere – Big data at rest – Infosphere streams
– Data stage – Statistical analysis– Intelligent scheduler – Infosphere Streams.

UNIT- IV PREDICTIVE ANALYTICS AND VISUALIZATION 9

Predictive Analytics – Supervised – Unsupervised learning – Neural networks – Kohonen
models –Normal – Deviations from normal patterns – Normal behaviours – Expert options –
Variable entry -Mining Frequent itemsets - Market based model – Apriori Algorithm –
Handling large data sets in Main memory – Limited Pass algorithm – Counting frequent
itemsets in a stream – Clustering Techniques –Hierarchical – K- Means – Clustering high
dimensional data Visualizations - Visual data analysistechniques, interaction techniques;
Systems and applications.
 UNIT- V FRAMEWORKS AND APPLICATIONS 9

IBM for Big Data – Map Reduce Framework - Hadoop – Hive - – Sharding – NoSQL
Databases - S3 -Hadoop Distributed file systems – Hbase – Impala – Analyzing big data with
twitter – Big data for Ecommerce– Big data for blogs.

TEXT BOOKS:
1. Frank J Ohlhorst, “Big Data Analytics: Turning Big Data into Big Money”, Wiley and SAS
BusinessSeries, 2012.
2. Colleen Mccue, “Data Mining and Predictive Analysis: Intelligence Gathering and Crime
Analysis”,Elsevier, 2007
3. Michael Berthold, David J. Hand,” Intelligent Data Analysis”, Springer, 2007.

REFERENCES:
1. AnandRajaraman and Jeffrey David Ullman, Mining of Massive Datasets, Cambridge
UniversityPress, 2012.
2.http://www.mosaic.geo-strategies.com/wp-content/uploads/2013/10/Big-Data-for-
Dummies.pdf

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Be able to analyze a problem for NN solution in terms of these Methods.
CO2 Have an awareness of the computational theory underlying NN.
CO3 Have a working knowledge of a typical neural network simulation
CO4 Experience in programming NN applications from scratch.
CO5 Have knowledge of sufficient theoretical background to be able to reason about the
behaviour of neural networks.

PT18PECS23 SOFTWARE QUALITY ASSURANCE L T P C

Total Contact Periods – 45 3 0 0 3
Prerequisite – Software Engineering
Course Designed by – Dept. of Computer Science & Engineering
Category PE
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES
The Objective of this Course is covers the foundations of software quality assurance and the
development of appropriate quality assurance strategies via the application of current
standards, models and measurement techniques.
UNIT –I INTRODUCTION TO SQA 9
Introduction to software quality – Software modelling – Scope of the software quality program
–Establishing quality goals – Purpose, quality of goals – SQA planning software – Productivity
and documentation.

UNIT- II SOFTWARE QUALITY ASSURANCE PLAN 9

Software quality assurance plan – Purpose and Scope, Software quality assurance Management
– Organization – Quality tasks – Responsibilities – Documentation.

UNIT- III STANDARDS 9

Standards, Practices, Conventions and Metrics, Reviews and Audits – Management, Technical
review – Software inspection process – Walk through process – Audit process – Test processes
ISO, CMM compatibility – Problem reporting and corrective action.

UNIT- IV METHODOLOGIES 9

Tools, Techniques and methodologies, Code control, Media control, Supplier control, Records
Collection, Maintenance and retention, Training and risk management.

UNIT- V ISO MODELS 9

ISO 9000 model, CMM model, Comparisons, ISO 9000 weaknesses, CMM weaknesses,
SPICE – Software process improvement and capability determination.

TEXT BOOKS:
1. Mordechai Ben – Meachem and Garry S.Marliss, “Software Quality – Producing
Practical, Consistent Software”, International Thompson Computer Press, 1997.
2.Watt. S. Humphrey, “Managing Software Process”, Addison – Wesley, 1998.

REFERENCES:
1. Philip.B.Crosby, “Quality is Free: The Art of making quality certain”, Mass Market, 1992.
2.http://www.cipl.net.in/courses/PDF/QA.pdf

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Understand standards, models and techniques aimed at achieving quality assurance in a
variety of software development environments.
CO2 Research, consolidate and present large amounts of information related to appropriate
quality assurance techniques and be able to make recommendations for management
strategies.
CO3 Propose and defend innovative solutions to software quality assurance and measurement
problems in the context of various software development environments.
CO4 Critically evaluate different software development environments and contexts with respect
to the application of appropriate standards and models.
CO5 Evaluate leading edge approaches in software development and attendant quality assurance
methodologies, presenting the research using Harvard referencing.

PROFESSIONAL ELECTIVE – III

PT18PECS31 COMPUTER VISION L T P C
Total Contact Periods – 45 3 0 0 3
Prerequisite – Computer Graphics
Course Designed by – Dept. of Computer Science & Engineering
Category PE
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES:
Able to understand Hough Transform and its applications to detect lines, circles, ellipses

UNIT –I IMAGE PROCESSING FOUNDATIONS 9

9
Review of image processing techniques – classical filtering operations – thresholding
techniques – edge detection techniques – corner and interest point detection – mathematical
morphology – texture.

UNIT- II SHAPES AND REGIONS 9

Binary shape analysis – connectedness – object labeling and counting – size filtering – distance
functions – skeletons and thinning – deformable shape analysis – boundary tracking procedures
– active contours – shape models and shape recognition – centroidal profiles – handling
occlusion – boundary length measures – boundary descriptors – chain codes – Fourier
descriptors – region descriptors – moments.

UNIT- III HOUGH TRANSFORM 9

Line detection – Hough Transform (HT) for line detection – foot-of-normal method – line
localization – line fitting – RANSAC for straight line detection – HT based circular object
detection – accurate center location – speed problem – ellipse detection – Case study: Human
Iris location – hole detection – generalized Hough Transform – spatial matched filtering –
GHT for ellipse detection – object location – GHT for feature collation .

UNIT- IV PREDICTIVE ANALYTICS AND VISUALIZATION 9

Methods for 3D vision – projection schemes – shape from shading – photometric stereo –
shape from texture – shape from focus – active range finding – surface representations – point-
based representation – volumetric representations – 3D object recognition – 3D reconstruction
– introduction to motion – triangulation – bundle adjustment – translational alignment –
parametric motion – Spline based motion – optical flow – layered motion.

UNIT –VAPPLICATIONS 9
Application: Photo album – Face detection – Face recognition – Eigen faces – Active
appearance and 3D shape models of faces Application: Surveillance – foreground-background
separation – particle filters – Chamfer matching, tracking, and occlusion – combining views
from multiple cameras – human gait analysis Application: In-vehicle vision system: locating
roadway – road markings – identifying road signs – locating pedestrians.

TEXT BOOKS:
 1. E. R. Davies, “Computer & Machine Vision”, Fourth Edition, Academic Press, 2012.
2. R. Szeliski, “Computer Vision: Algorithms and Applications”, Springer 20113.
3. Simon J. D. Prince, “Computer Vision: Models, Learning, and Inference”, Cambridge
University Press, 2012.

REFERENCES:
1. D. L. Baggio et al., “Mastering Open CV with Practical Computer Vision Projects”, Packet
Publishing, 2012.
2.http://szeliski.org/Book/drafts/SzeliskiBook_20100903_draft.pdf

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 To perform shape analysis and implement boundary tracking techniques.
CO2 To apply chain codes and other region descriptors.
CO3 To apply Hough Transform for line, circle, and ellipse detections.
CO4 To implement motion related techniques.
CO5 To develop applications using computer vision techniques.

BIO INSPIRED COMPUTING L T P C

PT18PECS32
Total Contact Periods – 45 3 0 0 3
Prerequisite – Artificial Intelligence and Expert System
Course Designed by – Dept. of Computer Science & Engineering
Category PE
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES:
To learn how natural and biological systems influence computational field.

UNIT- I INTRODUCTION 9
What is Life? - Life and Information - The Logical Mechanisms of Life - What is
Computation? Universal Computation and Computability - Computational Beauty of Nature
(fractals, L-systems, Chaos) - Bio-inspired computing - Natural computing -Biology through
the lens of computer science.

UNIT- II COMPLEX SYSTEMS & ARTIFICIAL LIFE 9

Complex Systems and Artificial Life - Complex Networks - Self-Organization and Emergent
Complex Behavior - Cellular Automata - Boolean Networks - Development and
Morphogenesis - Open-ended evolution.

UNIT- III NATURAL COMPUTATION AND NEURAL NETWORKS 9

Biological Neural Networks- Artificial Neural Nets and Learning - pattern classification &
linear separability - single and multilayer perceptrons, backpropagation - associative memory -
Hebbian learning - Hopfield networks - Stochastic Networks – Unsupervised learning.

UNIT- IV EVOLUTIONARY SYSTEMS AND ALGORITHMS 9

Evolutionary Programming: biological adaptation & evolution - Autonomous Agents and Self-
Organization: termites, ants, nest building, flocks, herds, and schools. Genetic algorithms:
Schema theorem - Reproduction-Crossover-Mutation operators.
 UNIT VCOMPETITION, COOPERATION AND SWARM INTELLIGENCE 9

9
Collective Behavior and Swarm Intelligence - Social Insects - Stigmergy and Swarm
Intelligence; Competition and Cooperation - zero- and nonzero-sum games - iterated prisoner’s
dilemma - stable strategies - ecological & spatial models - Communication and Multi-Agent
simulation – Immuno computing.

TEXT BOOKS:
1. Leandro Nunes De Castro, Fernando Jose Von Zuben, “Recent Developments in
Biologically Inspired Computing”, Idea Group Publishing, 2005.
2. Leandro Nunes De Castro , “Fundamentals of Natural Computing: Basic concepts,
Algorithms and Applications”, Chapman & Hall/ CRC Computer & Information Science
Series, 2006.

REFERENCES:
1. Dario Floreano, Claudio Mattiussi, “Bio-Inspired Artificial Intelligence: Theories, Methods
and Technologies”, MIT Press, 2008.
2.http://www.bioinspiredcomputation.com/self-archived-bookNeumannWitt.pdf
3.http://www.dschool.ir/files/
__Bio_Inspired_Artificial_Intelligence__Theories__MethodsTechnologies__Intelligent_Ro
botics_and_Autonomous_Agents_.pdf

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Be able to explain how biological systems exploit natural processes.
CO2 Be able to visualize how complex and functional high-level phenomena can emerge from
low-level interactions.
CO3 Be able to understand how large numbers of agents can self-organize and adapt.
CO4 Be able to design and implement simple Bio-inspired algorithms.
CO5 Students will explain how computational processes can be derived from natural models.

PT18PECS33 REAL TIME SOFTWARE TESTING L T P C

Total Contact Periods – 45 3 0 0 3
Prerequisite – Software Engineering
Course Designed by – Dept. of Computer Science & Engineering
Category PE
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES:
The Objective of this course student should know basic skills in software testing by
implementing various strategies of software testing in their project. They need to bring out the
ways and means of controlling and monitoring testing activity.
UNIT –I TESTING BASICS 9
Testing as an engineering activity –Role of process in software quality –Testing as a process –
Basic definitions –Software testing principles –The tester’s role in a software development
organization –Origins of defects –Defect classes – The defect repository and test design –
Defect examples –Developer / Tester support for developing a defect repository.

UNIT- IITEST CASE DESIGN 9

Introduction to testing design strategies – The smarter tester – Test case design strategies –
Using black box approach to test case design – Random testing – Equivalence class
partitioning – Boundary value analysis – Other black box test design approaches – Black box
testing and COTS – Using white box approach to test design – Test adequacy criteria –
Coverage and control flow graphs – Covering code logic – Paths – Their role in white box
based test design – Additional white box test design approaches – Evaluating test adequacy
criteria.

UNIT- III LEVELS OF TESTING 9

The need for levels of testing – Unit test – Unit test planning – Designing the unit tests – The
class as a testable unit – The test harness – Running the unit tests and recording results –
Integration tests – Designing integration tests – Integration test planning – System test – The
different types – Regression testing – Alpha, beta and acceptance tests.

UNIT- IV TEST MANAGEMENT 9

Basic concepts – Testing, debugging goals, policies – Test planning – Test plan components –
Test plan attachments – Locating test items – Reporting test results – The role of three groups
in test planning and policy development – Process and the engineering disciplines –
Introducing the test specialist – Skills needed by a test specialist – Building a testing group.

UNIT- V CONTROLLING AND MONITORING 9

Defining terms – Measurements and milestones for controlling and monitoring – Status
meeting– Reports and control issues – Criteria for test completion – SCM –Types of reviews –
Developing a review program – Components of review plans – Reporting review results.

TEXT BOOKS:
1. Srinivasan Desikan, Gopalaswamy Ramesh, “Software Testing: Principles and Practices”,
Pearson 2012.
2.Aditya P. Mathur, “Foundations of Software Testing”, Pearson, 2008.
3.Paul Ammann, Jeff Offutt, “Introduction to Software Testing”, Cambridge University Press,
2008.

REFERENCES:
1. Paul C. Jorgensen, “Software Testing: A Craftsman's Approach”, Auerbach Publications,
2008.
2.http://www.tutorialspoint.com/software_testing/software_testing_tutorial.pdf

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Understand the software test life cycle.
CO2 Understands the relationship between testing, software quality and other verification
 techniques the theoretical limits of software testing.
CO3 Test coverage measures such as statement, branch, and path coverage.
CO4 Design patterns for test automation.
CO5 Concepts and techniques for black-box and white-box testing.

PROFESSIONAL ELECTIVE-IV

PT18PECS41 TCP/IP PRINCIPLES AND ARCHITECTURE L T P C

Total Contact Periods – 45 3 0 0 3
Prerequisite – Software Engineering
Course Designed by – Dept. of Computer Science & Engineering
Category PE
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES:
To provide a solid foundation for understanding the communication process of the Internet
exposure to fundamental concepts of computer networking in the context of the TCP/IP model
and protocols.

UNIT- I INTRODUCTION 9
Protocols and standards - OSI model - TCP/ IP protocol suite - addressing -Version -
Underlying technologies.

UNIT –II IP ADDRESSES, ROUTING, ARP AND RARP 9

Classful addressing - other issues - Subnetting - Supernetting - classless addressing - routing
Methods - delivery - table and modules - CIDR - ARP package - RARP.

UNIT-III IP, ICMP, TGMP AND UDP 9

Datagram - fragmentation - options - checksum - IP package - ICMP - messages, formats -
error reporting - query - checksum - ICMP package - IGMP - messages, operation -
encapsulation - IGMP package - UDP - datagram - checksum - operation - uses - UDP
package.

UNIT- IV TCP, UNICAST AND MULTICAST ROUTING PROTOCOLS 9

Services - flow, congestion and error control - TCP package and operation - state transition
diagram - unicast routing protocols - RIP - OSPF - BGP - multicast routing - trees - protocols -
MOSPF - CBT - PIM.

UNIT- V APPLICATION LAYER, SOCKETS 9

Client server model - concurrency - processes - sockets - byte ordering - socket system calls -
TCP and UDP client-server programs - BOOTP -DHCP - DNS - name space, resolution - types
of records - concept - mode of operation - Rlogin.

TEXT BOOKS:
1.Behrouz A. Forouzan, “TCP/IP Protocol Suite”, 4th edition, McGraw Hill, 2013.
 2.Douglas E. Comer, “Internetworking with TCP/IP: principles, protocols and architecture”
(Volume1), 6th Edition, PHI Learning, 2013.

REFERENCES:
1. Douglas E. Comer, David L. Stevens, “Internetworking with TCP/IP, design,
implementation and internals Volume 2, 3rdEdition, PHI Learning, 2009.
2. Ed Tittel, Laura Chappell, “TCP/IP”, 1st Edition, Cengage Learning, 2008.
3. Dr. SidnieFeit, TCP/IP, architecture, protocols and implementation with IPv6 and IP
Security, Tata McGraw-Hill, 2008.
4.http://cpe.rmutt.ac.th/network/images/cn/
[3]Comer_Douglas_Internetworking_with_TCP_IP_Vol.1.pdf

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Understand the principles of internetworking protocols.
CO2 Have aSummarize the functions of transport protocols.
CO3 Learn the concepts of routing
CO4 Learn the concept of Rlogin and UDP.
CO5 Have knowledge of Subnetting and Supernetting.

PT18PECS42 PERFORMANCE EVALUATION IN L T P C

COMPUTER SYSTEMS
Total Contact Periods – 45 3 0 0 3
Prerequisite – Computer Networks
Course Designed by – Dept. of Computer Science & Engineering
Category PE
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES:
To understand the mathematical foundations needed for performance evaluation of computer
Systems.

UNIT-I OVERVIEW OF PERFORMANCE EVALUATION 9

Need for Performance Evaluation in Computer Systems – Overview of Performance
Evaluation Methods – Introduction to Queuing – Probability Review – Generating Random
Variables for Simulation – Sample Paths, Convergence and Averages – Little’s Law and other
Operational Laws – Modification for Closed Systems.

UNIT-II MARKOV CHAINS AND SIMPLE QUEUES 9

Discrete-Time Markov Chains – Ergodicity Theory – Real World Examples – Google, Aloha –
Transition to Continuous-Time Markov Chain – M/M/1 and PASTA.

UNIT-III MULTI-SERVER AND MULTI-QUEUE SYSTEMS 9

Server Farms: M/M/k and M/M/k/k – Capacity Provisioning for Server Farms – Time
Reversibility and Burke’s Theorem – Networks of Queues and Jackson Product Form –
Classed and Closed Networks of Queues.

UNIT-IV REAL-WORLD WORKLOADS 9

 Case Study of Real-world Workloads – Phase-Type Distributions and Matrix-Analytic
Methods – Networks with Time-Sharing Servers – M/G/1 Queue and the Inspection Paradox –
Task Assignment Policies for Server Farms.

UNIT-V SMART SCHEDULING IN THE M/G/1 9

Performance Metrics – Scheduling Non-Preemptive and Preemptive Non-Size-Based Policies -
. Scheduling Non-Preemptive and Preemptive Size-Based Policies – Scheduling - SRPT and
Fairness.

TEXT BOOKS
1. MorHarchol - Balter, “Performance Modeling and Design of Computer Systems –
Queueing Theory in Action”, Cambridge University Press, 2013.
2. LievenEeckhout, “Computer Architecture Performance Evaluation Methods”, Morgan and
Claypool Publishers, 2010.
REFERENCES
1. Paul J. Fortier and Howard E. Michel, “Computer Systems Performance Evaluation and
Prediction”, Elsevier, 2003.
2. http://barbie.uta.edu/~jli/Resources/Resource%20Provisoning&Performance
%20Evaluation/17.pdf

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 To understand the analytical modeling of computer systems.
CO2 Analyze a given problem for possibilities of parallel computations.
CO3 Select algorithms and hardware for the solution of high performance projects.
CO4 Use appropriate programming languages efficiently for scientific computations.
CO5 Program computers with shared and distributed memory architectures.

PT18PECS43 ADVANCED COMPUTER NETWORKS L T P C

Total Contact Periods – 45 3 0 0 3
Prerequisite – Computer Networks
Course Designed by – Dept. of Computer Science & Engineering
Category PE
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES:
The objective of Advanced Computer Networks is to cover theoretical topics in the areas of
advanced networking technologies, distributed computing.

UNIT-I NETWORK ARCHITECTURE 9

Review of Basic Network Architectures: OSI reference model, TCP/IP reference model, ATM
reference model; Applications(WWW, Audio/Video Streaming, Video conference, Networked
Games, Client/Server); Traffic Characterization (CBR, VBR); Switching Paradigms;
Multiplexing; Error Control; Flow Control, FTH, DTH, PON, ISDN, DSL, CATV, SONET,
Optical Networks.

UNIT-II NETWORK TECHNOLOGIES 9

 Local Area Network Technologies: Fast Ethernet, Gigabit Ethernet, IEEE 802.11 WLAN,
Bluetooth, Connecting LANs, VLANS.

UNIT-III ROUTING AND ITS TYPES 9

Internetworking: Inter domain Routing, BGP, IPv6, Multicast Routing Protocols, Multi
Protocol Label Switching, Virtual Private Networks, High speed transport protocols, Quality of
Service Mechanisms, Improving QoS in Internet, DiffServ and IntServ Architectures, RSVP.

UNIT-IV DOMAIN NAME SYSTEMS 9

Distributed Systems: Naming, DNS, DDNS, Paradigms for Communication in Internet,
Caching, Issues of Scaling in Internet and Distributed Systems, Caching Techniques forWeb,
Protocols to Support Streaming Media, Multimedia Transport Protocols, Content Delivery
Networks, Overlay and P2P Networks.

UNIT-V ATTACKS AND SECURITY IN NETWORK 9

Applications and Other Networking Technologies: RTP, RTSP, SIP, VoIP, Security Systems,
SSH, PGP, TLS, IPSEC, DDoS Attack, Mitigation in Internet, Security in MPLS; Introduction
to Cellular, Satellite and Ad hoc Networks.

REFERENCES:
1. Behrouz A. Forouzan, Data Communications and Networking, Fourth Ed., Tata McGraw
Hill, 2006.
2. Larry L. Peterson and Bruce S. Davie, Computer Networks: A Systems Approach, Fourth
Ed., Morgan Kaufmann, 2007.
3. Markus Hoffmann and Leland R. Beaumont, Content Networking: Architecture, Protocols,
and Practice, Morgan Kauffman, 2005.
4.http://www.cs.wayne.edu/~hzhang/courses/7290/Lectures/0-0%20-%20Course%20
plan.pdf

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Learn the concept of basic Network architecture.
CO2 Understand the various routing Methods.
CO3 Learn the concept about Networking and its types.
CO4 To Acquire experience in Domain Name System.
CO5 Understand the Networking Attacks.

PROFESSIONAL ELECTIVE-V

PT18PECS51 MOBILE COMMUNICATION L T P C

Total Contact Periods – 45 3 0 0 3
Prerequisite – Computer Networks
Course Designed by – Dept. of Computer Science & Engineering
Category PE
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES:
The objective of This course is designed to all student understand about Medium Access
Control (MAC), Wireless LAN, Bluetooth.
 UNIT – I INTRODUCTION 9
Medium access control – Telecommunication systems – Broadcast systems-SDMA-TDMA-
FDMA-TCP/IP-UDP.

UNIT – II STANDARDS 9
Wireless LAN: Features-Security standards –Protocol Stack- IEEE 802.11: Standards-
Architecture-Frame format-Features –HIPERLAN: Architecture-Standards – Bluetooth and Its
Application.

UNIT-III ADHOC NETWORKS 9

Characteristics-Performance issues- Routing in mobile hosts-Applications of Ad hoc wireless
networks-Issues in Ad hoc networks: Medium Access Scheme-Security-Energy management-
Deployment Considerations.

UNIT-IVNETWORK ISSUES 9
Mobile IP - DHCP - Mobile transport layer - Indirect TCP - Snooping TCP -Mobile TCP -
Transmission time-out freezing - Selective retransmission -Transaction oriented TCP.

UNIT-V APPLICATION ISSUES 9

Wireless application protocol - Dynamic DNS - File systems - Synchronization protocol -
Context- aware applications - Security - Analysis of existing wireless network.

TEXTBOOKS:
1. J. Schiller, “Mobile Communications”, 2nd Edition, Pearson Education, 2005.
2. William Stallings, “Wireless Communications and Networks”, Pearson Education, 2002

REFERENCES:
1. KavehPahlavan, PrasanthKrishnamoorthy, “Principles of Wireless Networks”, 1 stEdition,
Pearson Education, 2003.
2. UweHansmann, LotharMerk, Martin S. Nicklons and Thomas Stober, “Principles ofMobile
Computing”, Springer, 2003.
3. C.K.Toh, “AdHoc Mobile Wireless Networks”, First Edition, Pearson Education, 2002.
4. https://sgar91.files.wordpress.com/2011/10/mobile_communications_schiller_2e.pdf

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Understand the concepts and features of mobile networks.
CO2 Understand the working principles of wireless communication protocols.
CO3 Compare the routing protocols of mobile networks.
CO4 Learn DLL and MAC layer protocols for reliable and noisy channels.
CO5 Learn TCP & UDP protocols.

PT18PECS52 OBJECT ORIENTED DATABASE DESIGN L T P C

Total Contact Periods – 45 3 0 0 3
Prerequisite – Database Management System
 Course Designed by – Dept. of Computer Science & Engineering
Category PE
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES:
The objective of the course is to provide students with a sound technical exposure to the
concepts, principles, Methods, and best practices in Database Design.

UNIT-I INTRODUCTION TO DATABASE 9

Database management systems - The concepts of the database- levels of representation, using a
DBMS. Relational systems - toward the relational model, The relational model, using a
relational system, Advantages & limitations of relational systems. A new generation of
systems - A new computing context, New Applications.

UNIT-II DATABASE MODELING 9

Fundamental Aspects - The role of the data model general principles, Data manipulation
languages, some important models - ER, SDM, IFO, RM/T, Daplex, Type systems - Concept
of type. Data abstraction. Polymorphism, sub typing Integrating models & type system-
Abstract types and modeling, concepts of inheritance, classes & relations, views & desired data
constants.& transaction.

UNIT-III PROGRAMMING LANGUAGES 9

Extended relational models and system - different approaches, model with structured values,
Deductive models and logic programming, models with object identity. Extensible systems.
Database programming language - Two approaches Integration into an existing languages.
Persistent programming languages.

UNIT-IV OBJECT ORIENTED DATABASE 9

Object Oriented systems - Principles & technology databases. The system - origins & objective
Data model, Data manipulation, interface generator, the programming
environment.Implementation of the 02 system.

UNIT-V CLUSTERING AND INDEXING 9

Object manager architecture - Introduction, Problems encountered, Addressing mechanisms,
Virtual memory, two address levels, distributed architecture, Data management - Data
representation, large sets & long strings, Representing inheritance. Indexing, clustering,
transactions & versions.

TEXT BOOKS:
1. C.S.R. Prabhu,”Object-Oriented Database Systems: Approaches and Architectures”, 2nd
edition., Prentice-Hall Of India Pvt. Limited, 2005.
2. Jan L. Harrington,”Object-oriented Database Design Clearly
Explained”,MorganKaughman,2000.

REFERENCES:
1. Abraham Silberschatz, Henry F.Korth, S. Sudharson, “Database System Concepts”, 6th
Edition, Tata McGraw Hill, 2011.
2.http://web.cs.wpi.edu/~cs561/s12/Lectures/2-3/OO.pdf

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
 CO1 Design and motivate software architecture for large scale software systems.
CO2 Recognize major software architectural styles, design patterns, and frameworks.
CO3 Describe a software architecture using various documentation approaches.
CO4 Apply the technologies required to design and prototype Web-based information systems.
CO5 Learn various Database Modelling.

PT18PECS53 ADVANCED WEB DESIGN L T P C

Total Contact Periods – 45 3 0 0 3
Prerequisite – Web Technology
Course Designed by – Dept. of Computer Science & Engineering
Category PE
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES:
This course builds web applications using ASP and client side script technologies use with
Microsoft’s IIS.

UNIT – I FUNDAMENTALS 9
Introduction to the Web-Web enabling Technologies-Web Service Protocol-web Design
Concepts- Examining Good and Bad Web Design-Page Design Resources.

UNIT – II SIMPLE DESIGN ISSUES 9

Page Design-HTML-Web Page Style Considerations-Page composition-Type Faces-Tag
Parameters-Color and Graphics for web Pages-WYSIWYG web Page Editor-Dream Weaver.

UNIT – III ADVANCE DESIGN ISSUES 9

Advanced Page Design-Tables and Frames-Preparing Graphics and animations Forms-
Cascading Sheets-User interface Design-Page grid-Page Templates-Usability Testing.

UNIT – IV SCRIPTING IN DESIGN 9

Typography and Graphic Design for the Web-Creating Transparent GIP- Lean Graphics-Image
Maps-Palette Map-web Programming-Web Site Garage-W3C HTML Validation Services-Net
Mechanic-DHTML-XML.

UNIT –V TOOLS AND APPLICATIONS 9

Online Applications-Developing an Online Shopping application-Database Design Issues-
Connecting Database with tools such as Java, ASP, Cold fusion-Designing Portals and Vortals.

TEXT BOOK:
1. Deitel and Deitel, “Internet and World Wide Web-How to Program”, 3rd Edition, Pearson
Education, 2005.

REFERENCES:
1.N.P.Gopalan&J.Akilandeswari, “Web Technology: A Developer’s Perspective”, PHI
Learning,2008
2.JeffFrantzen and Sobotka, “Java Script”, Tata McGraw Hill, 2002.
3.JustinHunter,William Crawford, ”Java Servlet Programming”, O’Reilly Publications, 2 nd
Edition, 2001.
4.http://cdn.oreillystatic.com/oreilly/booksamplers/9781449319274_sampler.pdf
COURSE OUTCOMES (COs)
On completion of the course, the students will be able to
CO1 Create richly interactive environments natively within browsers.
CO2 Build web application frameworks which facilitate rapid application development.
CO3 Integrate web applications easily into other server-side web procedures, such as email and
searching.
CO4 Understand about web design concepts.
CO5 Learn various tools and concepts using to build web applications.
 OPEN ELECTIVE-I

PT18OECS01 PHP PROGRAMMING L T P C

Total Contact Periods – 45 3 0 0 3
Prerequisite – Web Technology
Course Designed by – Dept. of Computer Science & Engineering
Category OE
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES:
This course gives all students exposure to basics of PHP and gives knowledge on session
tracking and graphics using PHP.

UNIT –I PHP INTRODUCTION 9

PHP Basics - Evolution of PHP - Introduction to PHP Programming Variables, Operators, and
Constants: Introduction to Variables – Operators – Type Juggling - Type Casting - Variable
Variables - function for Determining and Setting Variable- Types - Constants. Control
Structures: Conditional Expressions- Arrays: Introduction to Arrays- Initializing Arrays -
Working with Arrays. Functions: Introduction to Functions - Passing Arguments to Functions -
Returning Values from Functions - Understanding the Scope of a Variable within a Function,
Variable Functions and Variable Argument Functions

UNIT- II UNDERSTANDING CLASSES 9

Classes – Constructors - Extending a class, Form Parsing in PHP: Parsing HTML Posted
Values in PHP - Form Validation- Printing the Confirmation Page - Printing Hidden Fields -
Putting Theory into Practice. Handling Files: Working with Files - Putting Theory into
Practice.

UNIT III HANDLING DATA STORAGE 9

An Introduction to Database Concepts - Database Management System - Relational Database
Management System - Database Normalization - PHP Support to various Databases - Web
Database Architecture -MySQL Database Programming. Using PHP with SQL Databases:
Working with MySQL - Using Multiple Databases Simultaneously - Important PHP-MySQL
Functions - Error handling in MySQL – Error Types in PHP - Creating Customized Error
Handlers.

UNIT- IV SESSION TRACKING 9

An Overview of Sessions - Tracking Sessions. Input Validators in PHP: Validation Basics -
Performing Validations in an HTML Web Page - Performing Validations in PHP - Functions
for Validating User Input - Validating Email Addresses. Cookies: What Is a Cookie?
Implementing Cookies in PHP - Are Cookies Harmful?

UNIT –V GRAPHICS IN PHP 9

Graphics on the web - Creating Images in PHP. Understanding CVS: CVS an Overview – The
CVS Repository – Environment Variables in CVS - CVS Command Options. PEAR:
Introduction to PEAR – Coding Standards in PEAR – PEAR and CVS – Contributing Codes to
PEAR – Requirements to Make Changes in PEAR – Help in PEAR.

TEXT BOOKS:
1. Matt Doyle,” Beginning PHP 5.3”,Wiley,2011.
 2.AshishWilfred,Meeta Gupta and KartikBhatnagar with NIIT, ”PHP Professional Projects”,
Prentice Hall of India, 2002.

REFERENCES:
1. Kevin Tatroe, Peter MacIntyre, RasmusLerdorf ,”Programming PHP”,O’Rielley,2013.
2.RasmusLerdorf and Kevin Tatroe, “Programming in PHP”, O’Reilly and Associates, 2002.
3.http://www.infoap.utcluj.ro/multi/programming_PHP.pdf

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 To learn Recognize the difference between HTML, XHTML, MySQL& PHP.
CO2 To understand Differentiate between PHP Web & HTML Controls.
CO3 Understand different Web controls.
CO4 Apply the Understand connecting Web pages with DB.
CO5 Understand about Classes, Constructors.

PT18OECS02 VIRTUAL REALITY L T P C

Total Contact Periods – 45 3 0 0 3
Prerequisite – System Modelling and Simulation
Course Designed by – Dept. of Computer Science & Engineering
Category OE
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES:
This course gives Design a virtual environment and compelling virtual reality experience.

UNIT-I VIRTUAL REALITY AND ENVIRONMENTS 9

Introduction - Computer graphics - Real-time Computer Graphics -, Flight Simulation - Virtual
environments- Requirements- Benefits of virtual reality. The historical development of virtual
reality: Scientific landmarks, 3d computer graphics: Virtual world space - Positioning the
observer- Perspective projection - Human vision - Stereo perspective Projection - Human
Vision -Stereo Perspective Projection - 3D clipping - Color theory - 3D Modeling -Illumination
models - Reflection models - Shading Algorithms - Hidden surf ace removal - Stereographic
Images.

UNIT-II GEOMETRIC MODELING 9

Conversion from 20 to 3D-3D Space curves-3D Boundary Representation -modeling strategies.
Geometric Transformations ; Frames of references -Modeling Transformations - Instances -
Packing - Flying - Scaling the Virtual Environment-Collision detection. Generic Virtual
Reality: Virtual Environment - Computer environment - Virtual reality Technology- Models of
interaction - Virtual Reality Systems.

UNIT-III ANIMATING THE VIRTUAL ENVIRONMENT 9

The dynamics of numbers - Animation of objects - shape and Object In betweening - Frame-
from deformation - Particle systems Physical Simulation Objects falling in a gravitational field
- Rotating Wheels-Elastic collision -Projectiles - simple Pendulums - Springs - Flight dynamics
of an aircraft. Human Factors; Eye-Ear- Somatic senses- Equilibrium.
 UNIT-IV VIRTUAL REALITY HARDWARE 9
Sensor Hardware - Head Coupled displays - Acoustic hardware - Integrated Virtual Reality
systems. Virtual Reality Software: Modeling virtual worlds -Physical Simulation-Virtual
Reality Toolkits.

UNIT-V VIRTUAL REALITY APPLICATIONS 9

Engineering-Entertainment-Science-Training Future of Virtual Reality: Virtual environments -
Models of interactions.

REFERENCES:
1. John Vince, “Virtual Reality Systems”, Pearson Education, 2005.
2. Adams, “Visualization of Virtual Reality”, Tata McGraw Hill, 2000.
3.http://www.cs.tut.fi/kurssit/SGN-5406/lectures/VR1-introduction.pdf

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Be able to understand about computer graphics and 3 D.
CO2 Comprehend and analyze the fundamental issues of virtual reality.
CO3 Be able to familiar with virtual reality hardware.
CO4 Create compelling virtual experiences.
CO5 Learn the concepts about animating the virtual environment.

PT18OECS03 E COMMERCE L T P C
Total Contact Periods – 45 3 0 0 3
Prerequisite – Internet Programming ,Web Technology
Course Designed by – Dept. of Computer Science & Engineering
Category OE
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES:
This course Discuss the current drivers and inhibitors facing the business world in adopting
and using Ecommerce.

UNIT-I ELECTRONIC COMMERCE 9

Electronic Commerce, Electronic Data Interchange (EDI), E-Commerce Types – PC and
networking: Networking, Communication media – Computer Communication Systems: ISO
model, Electronic mail, X.400 Message Handling System, E-mail security, Lightweight
directory access protocol – Internet: Introduction, Communication protocols, Issues of concern.

UNIT-II ELECTRONIC DATA INTERCHANGE 9

EDI: Introduction, Cost and Benefits, Components of EDI System, Implementation Issues –
UN/EDIFACT Standard: Introduction, An EDIFACT Message, Interchange Structure,
Message Directories - EDI Over Internet, Commerce Over Extranets, Identification and
Tracking Tools.

UNIT-III BUSINESS PROCESS REENGINEERING 9

Business process reengineering – Approach to BPR, BPR methodology – Change
management: Change management in the Government, Implementation plan.
 CONCERNS FOR E-COMMERCE GROWTH
Legal issues, Risks: Paper document versus electronic document, Technology for
authenticating an electronic document, Laws for e-commerce, EDI interchange agreement.

UNIT-IV CYBER SECURITY 9

Cyber Attacks, Hacking, Firewalls, IDS, Secure Sockets Layer, Symmetric and asymmetric
crypto systems, Guidelines for Cryptography Policy, Developing a Security Policy.
CYBER CRIMES: Cybercrimes and the Information Technology Act, 2000, Cyber forensics

UNIT-V CASE STUDIES 9

E-Commerce: Case Studies: ITC’s e-Choupal - E-Governance: Case Studies: Indian customs
EDI System, Indian Railways, Government of Andhra Pradesh – eSeva.

COMPUTER EMERGENCY RESPONSE TEAM (CERT): Introduction, CERT-In,

CERT-In Activities.

REFERENCE BOOKS:
1. Kamlesh K Bajaj, Debjani Nag, “E-Commerce – The Cutting Edge of Business”, Tata
McGraw Hill, Second Edition, 2006
2. David Whitley, “E-Commerce: Strategy, Technologies and applications”, McGraw Hill,
2000.
3. Ravi Kalakota and Andrew B. Whinston, “Frontiers of Electronic commerce”, Pearson
Education, 2005.
4. Pete Loshin, Paul A. Murphy, “Electronic Commerce”, Jaico Publisher.
5. https://books.google.co.in/books?
id=Co8iBAAAQBAJ&printsec=frontcover&source=gbs_ge_summary_r&cad=0#v=o
nepage&q&f=false

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 Create and refine website and application designs based on industry’s usability.
CO2 Assess the suitability of various design principles for websites and applications.
CO3 Apply the skills necessary for large-scale project development on the Web.
CO4 Apply the technologies required to design and prototype Web-based information system
CO5 Recognize the business impact and potential of e-Commerce.

PT18OECS04 HIGH SPEED NETWORKS L T P C

Total Contact Periods – 45 3 0 0 3
Prerequisite – Computer Networks
Course Designed by – Dept. of Computer Science & Engineering
Category OE
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES:
This course gives an overview of High speed computer networks and TCP/IP protocols. It also
discusses the security and network management aspects.
 UNIT-I HIGH SPEED NETWORKS 9
Introduction-frame relay networks –ATM protocol architecture-ATM logical connection –
ATM cells-ATM service categories -AAL- high speed LANS: the emergence of high speed
LANS-Ethernets-fiber channel-wireless LAN.

UNIT-II CONGESTION CONTROL 9

Congestion control in data networks and internets-link level flow and error control TCP Traffic
-congestion control in ATM networks- Interior routing protocols.

UNIT-III QOS AND SWITCHING 9

Integrated service architecture-queuing discipline -random early detection differentiated
services protocol for QOS support- RSVP- Multiportal Label switching - Real time transport
protocol- IP v6.

UNIT-IV WIRELESS LAN 9

Local broad band and Ad hoc networks .Introduction to wireless LANS-IEEE 802.11 WLAN-
WATM-HIPERLAN-Ad hoc networking and WPAN.

UNIT-V NETWORK MANAGEMENT AND APPLICATION 9

Network management- choosing a configuration method-MIB-SNMP-XMLCORBA-COPS-
VPNS-Mobile IP-voice over IP.

TEXTBOOKS:
1. Williams Stallings, ”High Speed networks and Internet Performance and Quality of
Service”, Pearson Second Edition, 2002.
2. KavenPahlavan and PrashantKrishnamoorthy, “Principles of Wireless Network”, Prentice
Hall Of India, 2010
3. Adrian Farrel,” The Internet and Its Protocols”, Elsevier Publications, 2011.

REFERNCES:
1. Behrouz A. Forouzan, “Data Communication and Computer Networking”, 4thedition, 2011.
2. Larry L. Peterson and Bruce S.Davie, ”Computer Networks”, Third edition, Elsevier
Publications, 2003.
3. http://www.kiv.zcu.cz/~ledvina/vyuka/PDS/PDS-tut/HighSpeedNetworks/hsn0101.pdf

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 To learn High speed networks, Traffic and congestion management.
CO2 To understand resource allocation and service management approaches.
CO3 Compare the routing protocols of mobile networks.
CO4 Understand wireless network operations and functions.
CO5 Learn network management and its protocols.

PT18OECS05 CELLULAR MOBILE COMMUNICATION L T P C

Total Contact Periods – 45 3 0 0 3
Prerequisite – Computer Networks
Course Designed by – Dept. of Computer Science & Engineering
Category OE
Approval 47th Academic Council Meeting held in Aug, 2018

OBJECTIVES:
To import knowledge of signal processing techniques for wireless communication.

UNIT-I INTRODUCTION TO WIRELESS MOBILE COMMUNICATIONS 9

History and evolution of mobile radio systems, Types of mobile wireless services/systems –
Cellular, WLL, Paging, Satellite systems, Standard, Future trends in personal wireless systems.

UNIT-II CELLULAR CONCEPT AND SYSTEM DESIGN FUNDAMENTALS 9

Cellular concept and frequency reuse, Multiple Access Schemes, Channel assignment and
handoff, Interface and system capacity, Trunking and Erlang capacity calculations.

UNIT-III MOBILE RADIO PROPAGATION 9

Radio wave propagation issues in personal wireless systems, Propagation models, Multipath
fading and based and impulse models, Parameters of mobile multipath channels, Antenna
systems in mobile radio.

UNIT-IV MODULATION AND SIGNAL PROCESSING 9

Analog and digital modulation techniques, Performance of various modulation techniques –
Spectral efficiency, Error rate, Power Amplification, Equalization/Rake receiver concepts,
Diversity and Space-time processing, Speech coding and channel coding.

UNIT-V SYSTEM EXAMPLES AND DESIGN ISSUES 9

Multiple Access Techniques – FDMA, TDMA and CDMA systems, Operational systems,
Wireless networking, design issues in personal wireless systems.

TEXT BOOK:
1. K. Feher, Wireless Digital Communication, Prentice Hall of India, New Delhi, 1995.

REFERENCES:
1.T.S. Rappaport, Wireless Communication; Principles and Practice, Prentice Hall, NJ, 1996.
2. W.C.Y. Lee, Mobile Communication Engineering; Theory and Application, Second Edition,
McGraw-Hill International, 1998.
3. http://www.wileyindia.com/media/pdf/0471457124.pdf

COURSE OUTCOMES (COs)

On completion of the course, the students will be able to
CO1 To introduce advanced wireless communication systems.
CO2 To learn the wireless channel characteristics and models.
CO3 Explain the various standards Wireless Communication.
CO4 Describe different propagation models.
CO5 Classify different Equalization & diversity techniques used in wireless communication.