CSE Merge 22 07 2017 PDF

B.
Tech (Computer Science and Engineering) Syllabus for Admission Batch 2015-16
Branch-Computer Science & Engineering

First Year Engineering
First Semester
Theory Practical
Code Course Name Hours/ Credit University Internal Hour/W Credit Marks
Week Theory Marks Evaluation eek Practical
L/T L/T
BS Mathematics-I 3-1 4 100 50 - - -
BS Chemistry/ Physics 3-0 3 100 50 2 1 50
ES Basics of Electronics / 3-0 3 100 50 2 1 50
Basic Electrical
Engineering
ES Mechanics/ 3-0 3 100 50
Thermodynamics
ES Programming in ‘c” 3-0 3 100 50 2 2 50
HS English 3-0 2 100 50 2 1 50
Communication Skill
ES Engineering Workshop/ 4 2 100
Engineering Drawing
Total 16 18 600 300 18 7 300
Total Marks: 1200
Total Credits: 25
Second Semester
Theory Practical
Code Course Name Hours/w Credit University Internal Hour/ Credit Marks
eek/ Theory marks Evaluation Week/ Practical
L/T L/T
BS Mathematics-II 3-1 4 100 50 - - -
BS Chemistry/ Physics 3-0 3 100 50 2 1 50
ES Basics of Electronics / 3-0 3 100 50 2 1 50
Basic Electrical Engineering
ES Mechanics/ 3-1 3 100 50
Thermodynamics
ES Data Structure Using ‘C” 3-0 3 100 50 2 2 50
HS Business communication 3-0 2 100 50 2 1 50
ES Engineering Workshop/ 4 2 100

Engineering Drawing
MC NSS/NCC - - - -
Total 17 18 600 300 14 7 300
Total Marks: 1200
Total Credits: 25
1
Page
B.Tech (Computer Science and Engineering) Syllabus for Admission Batch 2015-16
Second Year Engineering

Third Semester
Theory Practical
Code Course Name Hours/ Credit University Internal Hours/ Credit Marks
week Theory Marks Evaluation Week Practical
L/T L/T
PC Switching Theory & 3-0 3 100 50 2 1 50
Logic Design
PC Object Oriented 3-0 3 100 50 2 1 50
Programming using
JAVA
PC System Programming 3-0 3 100 50 2 1 50
PC Software Engg. 3-0 3 100 50 2 1 50
PC Discrete Structures 3-1 4 100 50
HS Engineering Economics/ 2-1 3 100 50
Organizational
Behaviour
Total 19 19 600 300 8 4 200
Total Marks: 1100
Total Credits: 23
Honours Artificial 4 4 100 50
Intelligence
Minor Software
Engineering
Fourth Semester
Theory Practical
L/T L/T
HS Applied Mathematics III 3-0 3 100 50
PC Computer Organization 3-0 3 100 50 2 1 50
& Architecture
PC Design & Analysis of 3-0 3 100 50 2 1 50
Algorithms
PC Database System 3-0 3 100 50 2 1 50
PC Formal Language & 3-0 3 100 50 Open 2 1 50
Automata Theory Source
Tool Lab
Organizational
Behaviour
*Skill Project and Hands 6 3 100
on Practice-
Information Technology
Enable System(System
Administration/Networ
king/QOS/Multimedia
and Animation )
Total 18 18 600 300 14 7 300
Total Marks: 1200
Total Credits: 25
Honours Data Analytic 4 4 100 50
Minor Database
System/
2
Computer
Page
Organization
& Architecture
*College should conduct at least one NSDC program under this category.
Third Year Engineering

Fifth Semester
Theory Practical
Code Course Name Hours/week Credit University Internal Hours/week Credit Marks
L/T Theory Marks Evaluation L/T Practical
PC Operating System 3-0 3 100 50 2 1 50
PC Computer 3-0 3 100 50 2 1 50
Graphics
PC Advanced 3-0 3 100 50 2 1
Computer
Architecture
PE Advanced JAVA 3-1 4 100 50 50
Programming/
Internet of
Things/Software
Testing/Parallel
Algorithms
OE Cloud 3-1 4 100 50
Computing/ Data
mining & Data
Warehousing/
Computer Vision
/Information
Retrieval
PC Advance Lab-I 8 4 200
Total 17 17 500 250 14 7 350
Total Marks: 1100
Total Credits: 24
Honours Real Time 4 4 100 50
System
Minor Operating
System
3
Page
Sixth Semester
Theory Practical
Code Course Name Hours/w Credit University Internal Hours/ Credit Marks
eek Theory Marks Evaluation week Practical
L/T L/T
PC Computer Network & 3-0 3 100 50 2 1 50
Data Communication
PC Compiler Design 3-0 3 100 50 2 1 50
PE Digital Image 3-1 4 100 50
Processing/Digital
Signal
Processing/Natural
language
Processing/Wireless
Sensor Networks
PE Internet & Web 3-1 4 100 50
Technology/Pattern
Recognition/Machine
Learning/Advanced
Operating System
MC & Environmental Science 3-0 3 100 50
GS & Engineering
OE Industrial Lecture # 3 1 50
HS Presentation Skill & 2-0 1 50 4 2 100
Skill for Interview # #
MC Yoga 2 1 50
Total 19 18 500 300 13 6 300
Total Marks: 1100
Total Credits: 24
Honours Embedded 4 4 100 50
System
Minor Computer
Network and
Data
Communication
# To be conducted by the Training & Placement department by inviting experts from the industry. No academician to be called. Record may
be asked by the University for verification. Evaluation to be done by the TPO.
# # To be conducted by the Training & Placement department of the College.
4 Page
Final Year Engineering

Seventh Semester
Theory Practical
Code Course Name Hours/ Credit University Internal Hours/week Credit Marks
week Theory Marks Evaluation L/T Practical
L/T
GS Nano Science & Bio 3-1 4 100 50
Technology
PE Cryptography & 3-1 4 100 50
Network
Security/Robotics/VLSI
Design/Social Networks
PE Mobile 3-1 4 100 50
Computing/Software
Project Management/
Algorithm for
Bioinformatics/Expert
Systems
OE Soft Computing */ 3-1 4 100 50
Object Oriented System
Design/Parallel
Distributed
System/Distributed
Computing/Modelling
Simulation
PC Advance Lab-II/ Project 8 4 200
Projects on Internet of 8 4 200

Things
Total 16 16 400 200 16 8 400
Total Marks: 1000
Total Credits: 24
Honours Computational 4 4 100 50
Numbers
Theory
Minor Cryptography
& Network
Security
*Student can choose from any department but subject must be running in that semester.
Eighth Semester
Training cum Project Evaluation Scheme
Code Course Name Hours/week Credit Total Marks
L/T Theory Marks
Industrial 30 20 1000 Evaluation by the 500
Training cum Industry / Training
Project/
Entrepreneurship Organisation
Training cum Evaluation by the 500
Project / Stratup Institute
Training cum (Report & Institute Viva)
Project
Total 30 20 1000 1000
Total Marks:1000
Total Credits:20
5
Page
Note- Minimum Pass Mark from Industry Evaluation is 300 (i.e. 60%).
Distribution of Credit Semester wise:

Semester Credit
First 25
Second 25
Third 23
Fourth 25
Fifth 24
Sixth 24
Seventh 24
Eighth 20
-------------------------------------
Total 190
Internal Evaluation Scheme

Attendance & Class Interaction 05
Assignment 05
Surprise Test 05
Quiz 05
Class Test I & II 30
Total 50
Class Test Time(Hrs.): 1
Pass Mark in Internal is 50% of total marks i.e. 25

External Evaluation Scheme
University Semester Examination of 3 Hours duration.
Pass mark will be 35% which means students have to score 35 out of 100.
Practical/Sessional Evaluation Scheme

Pass mark will be 50% which means students have to score 25 out of 50.
Evaluation Scheme
Attendance & Daily Performance -10
Lab Record - 10
Lab Quiz - 05
Final Experiments & Viva – 25
-------------------------------------------------------
Total=50
All Lab examinations are to be completed one week before the end semester examination and
marks are to be displayed on the college notice board.
6 Page
DETAIL SYLLABUS
FROM
III - VIII SEMESTER OF B.TECH. DEGREE PROGRAMME
for
ADMISSION BATCH 2015-16
BRANCH-COMPUTER SCIENCE AND ENGINEERING
7
Page
B.Tech (Computer Science and Engineering) Syllabus for Admission Batch 2015-16 3rd Semester
Second Year Engineering

Third Semester
Theory Practical
Subject Category Course Name Hours/w Credit University Internal Hours/ Credit Marks
Code eek Theory Marks Evaluation Week Practical
L/T L/T
PCS3I101 PC Switching Theory 3-0 3 100 50 2 1 50
& Logic Design
PCS3I102 PC Object Oriented 3-0 3 100 50 2 1 50
Programming
using JAVA
PCS3I103 PC System 3-0 3 100 50 2 1 50
Programming
PCS3I104 PC Software 3-0 3 100 50 2 1 50
Engineering
PCS3I001 PC Discrete 3-1 4 100 50
Structures
PEK3E001/ HS Engineering 2-1 3 100 50
POB3E002 Economics/
Organizational
Behaviour
Total 19 19 600 300 8 4 200
Total Marks: 1100
Total Credits: 23
PCS3D001 Honours Artificial 4 4 100 50
Intelligence
PCS3G001 Minor Software

Engineering
8
Page
Semester : 3rd
--------------
1. PCS3D001 Honours(CP) Artificial Intelligence 4-0-0 4
2. PEK3E001 HS(O1) Engineering Economics 3-0-0 3
3. POB3E002 HS(O1) Organizational Behavior 3-0-0 3
4. PCS3G001 Minor(CP) Software Engineering 4-0-0 4
5. PCS3I001 PC(CP) Discrete Structures 4-0-0 4
6. PCS3I101 PC(CP) Switching Theory & Logic Design 3-0-1 4
7. PCS3I102 PC(CP) Object Oriented Programming using JAVA 3-0-1 4
8. PCS3I103 PC(CP) System Programming 3-0-1 4
9. PCS3I104 PC(CP) Software Engineering 3-0-1 4
---
27
---
9 Page
PCS3I101 SWITCHING CIRCUITS AND LOGIC DESIGN

Theory L/T (Hours per week): 3/0, Credit: 3
Introduction: Logic design, transistors as switches, CMOS gates, sequential circuits,some

examples.
Digital Systems: Representation of numbers, binary codes, Gray code, error-detecting
and error-correcting codes, registers, binary logic, basic logic gates.
Boolean Algebra: Boolean operations, Boolean functions, algebraic manipulations,
minterms and maxterms, sum-of-products and product-of-sum representations, two-
input logic gates, functional completeness.
Minimization of Boolean Functions: Karnaugh map, don't-care conditions, prime
implicants, Quine–McCluskey technique, Logic gates, NAND/NOR gates, Universal gates.
Combinational Circuits: Adder, subtractor, multiplier, comparator, decoders,
encoders, multiplexers, demultiplexers, MUX Realization of switching functions, Parity
bit generator, Code-converters, Hazards and hazard free realizations
Synchronous Sequential Circuits: Finite-state machines, latches and flip-flops (SR, D,
JK, T), synthesis of clocked sequential circuits, Steps in synchronous sequential circuit
design. Design of modulo-N Ring & Shift counters, Serial binary adder.
Registers and Counters: Registers and shift registers, sequential adders, binary and
BCD ripple counters, synchronous counters
Algorithmic State Machines: Salient features of the ASM chart-Simple examples-
System design using data path and control subsystems-control implementations-
examples of Weighing machine and Binary multiplier.
Text Book:
1. Digital Design – Morris Mano, PHI, 3rd Edition, 2006.
2. Digital Electronics by G.K. Kharate, Oxford University Press
References:
1. Switching & Finite Automata theory – Z. Kohavi, TMH,2nd Edition.
2. An Engineering Approach To Digital Design – Fletcher, PHI.
3. Fundamentals of Logic Design – Charles H. Roth, Thomson Publications, 5th
Edition, 2004.
4. Digital Logic Applications and Design – John M. Yarbrough, Thomson Publications,
2006
10 Page
SWITCHING CIRCUITS AND LOGIC DESIGN LAB
1. Digital Logic Gates: Investigate logic behavior of AND, OR, NAND, NOR, EX-OR,
EX-NOR, Invert and Buffer gates, use of Universal NANDGate.
2. Gate-level minimization: Two level and multi level implementation of
Booleanfunctions.
3. Combinational Circuits: design, assemble and test: adders and subtractors,
comparators.
4. Design and Implementation of code converters, gray code to binary and BCD to
seven segment display.
5. Design and Implementation of a function using MUX/ DEMUX.
6. Design of functions using encoder, decoder.
7. Flip-Flop: assemble, test and investigate operation of SR, D & J-Kflip-flops.
8. Shift Registers: Design and investigate the operation of all types of shift registers
with parallelload.
9. Counters: Design, assemble and test various ripple and synchronous
counters - decimal counter, Binary counter with parallelload.
10. Design of Binary Multiplier.
11. Verilog/VHDL simulation and implementation of Experiments listed at Sl. No. 1
to 10.
12. C/C++ implementation of Experiments listed at Sl. No. 1 to 10.
11 Page
PCS3I102 OBJECT ORIENTED PROGRAMMING USING JAVA

Module1:-
Chapter 1-: An introduction to programming.
Different types of programming languages, Description of Compiler and Interpreter,
Advantage of Object Oriented Programming, Object Oriented Programming, Features of
Object Oriented Programming.
Chapter 2-: Introduction to Java.
What is Java?, Why Java?, History behind Java, Different versions of Java, Difference between
C/C++ and Java, Features of Java, First Java Program, Prerequisites Before start writing a
java program, Writing the program, Compiling the program, How Java program compiles?,
Executing the program, How Java program executes?, What is JVM and its significance in
executing a program?, Architecture of JVM.
Chapter 3-: Understanding First Program and a step forward, Understanding every term of
the program, Java Tokens, Datatypes, Operators, What are Operators?, Different types of
Operators, Typecasting, Control Structures and Arrays, Different types of control structures,
Conditional Statements, Loops/ Iterators, Jumping Statements, Java Arrays,
Multidimensional Arrays, Taking Input from keyboard, Command Line Arguments, Using
Scanner Class, Using Buffered Reader class.
Module 2: -
Chapter 1-: Introduction to Classes and Objects.
Classes, Methods, Objects, Description of data hiding and data encapsulation, Constructors,
Use of static Keyword in Java, Use of this Keyword in Java, Array of Objects, Concept of
Access Modifiers (Public, Private, Protected, Default).
Chapter 2-: Inheritance
Understanding Inheritance, Types of Inheritance and Java supported Inheritance,
Significance of Inheritance, Constructor call in Inheritance, Use of super keyword in Java,
Polymorphism, Understanding Polymorphism, Types of polymorphism, Significance of
Polymorphism in Java, Method Overloading, Constructor Overloading, Method Overriding,
Dynamic Method Dispatching.
Chapter 3-: String Manipulations.
Introduction to different classes, String class, String Buffer, String Builder, String Tokenizer,
Concept of Wrapper Classes, Introduction to wrapper classes, Different predefined wrapper
classes, Predefined Constructors for the wrapper classes. Conversion of types from one type
(Object) to another type (Primitive) and Vice versa, Concept of Auto boxing and unboxing.
Chapter 4:- Data Abstraction
Basics of Data Abstraction, Understanding Abstract classes, Understanding Interfaces,
Multiple Inheritance Using Interfaces, Packages, Introduction to Packages, Java API
Packages, User-Defined Packages, Accessing Packages, Error and Exception Handling,
Introduction to error and exception, Types of exceptions and difference between the types,
Runtime Stack Mechanism, Hierarchy of Exception classes, Default exception handling in
Java, User defined/Customized Exception Handling, Understanding different keywords (try,
catch, finally, throw, throws), User defined exception classes, Commonly used Exceptions
and their details.
12Page
Chapter 5:- Multithreading

Introduction of Multithreading/Multitasking, Ways to define a Thread in Java, Thread
naming and Priorities, Thread execution prevention methods. (yield(), join(), sleep()),
Concept of Synchronisation, Inter Thread Communication, Basics of Deadlock, Demon
Thread, Improvement in Multithreading, Inner Classes, Introduction, Member inner class,
Static inner class, Local inner class, Anonymous inner class.
Module 3: -
Chapter 1:- IO Streams (java.io package)
Introduction, Byte Stream and Character Stream, Files and Random Access Files,
Serialization, Collection Frame Work (java.util), Introduction, Util Package interfaces, List,
Set, Map etc, List interfaces and its classes, Setter interfaces and its classes.
Chapter 2:-Applet
Introduction, Life Cycle of an Applet, GUI with an Applet, Abstract Window Toolkit (AWT),
Introduction to GUI, Description of Components and Containers, Component/Container
hierarchy, Understanding different Components/Container classes and their constructors,
Event Handling, Different mechanisms of Event Handling, Listener Interfaces, Adapter
classes.
Module 4: -
Chapter 1:- Swing (JFC)
Introduction Diff b/w awt and swing, Components Hierarchy, Panes, Individual Swings
Components JLabel, JButton, JTextField, JTextArea.
Chapter 2:-JavaFX
Getting started with JavaFX, Graphics, User Interface Components, Effects, Animation, and
Media, Application Logic, Interoperability, JavaFX Scene Builder 2, Getting Started with
scene Builder.
Working with scene Builder.
Text Book:-
1. Programming in Java. Second Edition. OXFORD HIGHER EDUCATION. (SACHIN

MALHOTRA/SAURAV CHOUDHARY)
2. CORE JAVA For Beginners. (Rashmi Kanta Das), Vikas Publication
Reference Book:-
1. JAVA Complete Reference (9th Edition) Herbalt Schelidt.

13 Page
JAVA PROGRAMMING LAB

JAVA programs on:
1. Introduction, Compiling & executing a java program.
2. Data types & variables, decision control structures: if, nested if etc.
3. Loop control structures: do, while, for etc.
4. Classes and objects.
5. Data abstraction & data hiding, inheritance, polymorphism.
6. Threads, exception handlings and applet programs
7. Interfaces and inner classes, wrapper classes, generics
14 Page
PCS3I103 SYSTEM PROGRAMMING
Module I (12 Hrs)

Introduction: System Software, Application Software, components of a programming system:
Assembler, Loader, Linker, Macros, Compiler, Program Development Cycle, Evolution of
Operating Systems, Functions of Operating System, Machine Structure: General Machine
Structure, Approach to a new machine, Memory Registers, Data, Instructions, Evolution of
Machine Language: Long Way, No looping, Address Modification, Looping, Introduction to
Assembly Language Program.
Module II (12 Hrs)
Assemblers: Design Procedure, Design of Assembler, Two-pass Assembler, Table Processing.
Macros Language and Macro Processor: Macro Instructions, Features of a Macro Facility,
Implementation. Loaders: Loader Schemes, Design of an Absolute Loader, Direct Linking loader,
Bootstrap Loader. Dynamic Loading and Linking, Algorithm and Data structures for Linking
Loader, Linkers and Linkage Editors.
Module III (10 Hrs)
Programming Languages: Importance of High Level Languages, Features, Data Types and Data
Structures, Storage Allocation and Scope Name, Accessing Flexibility, Functional Modularity,
Formal Systems: Uses of Formal Systems, Formal Specification, Formal Grammars, Introduction
to Compilers, passes of compiler, Phases of a compiler, Interpreter.
Module IV (06 Hrs)
Software Tools for Program Development, Editor, Design and User Interface, Programming
Environment and Integrated Development Environments, Debugger Functionalities, Debug
Monitors, Debugger Facilities, Debugger Internal Mechanism Operating.
Text Book:
Systems Programming by John J Donovan (McGraw-Hill Education)
Reference Book:
(1) Operating System and System Programming – Dhamdhere (McGraw-Hill Education)
(2) System Programming,by Srimanta Pal, Oxford University Press
(3) System Software, S. Chattopadhyay (Prentice-Hall India)
(4) System Programming with C and UNIX. - Hoover (Pearson Education)
(5) System Software: An Introduction to systems programming by Leland Beck (Pearson)
(6) System Software: Nityashri (McGraw-Hill Education)
15 Page
SYSTEM PROGRAMMING LABORATORY

1. Programs using 8085 Microprocessor
a. addition
b. subtraction
c. multiplication
d. division
2. Program on linker using stack concept.
3. Program on design of Macro using C/C++
4. Program on design of assembler using C/C++
5. Program on design of loader using C/C++
6. Program on design of a lexical analyzer using LEX.
7. Program on design of a parser using YACC
16 Page
PCS3I104 SOFTWARE ENGINEERING

Software Process Models:

Software Product, Software crisis, Handling complexity through Abstraction and
Decomposition, Overview of software development activities, Process Models,
Classical waterfall model, iterative waterfall model, prototyping mode, evolutionary
model, spiral model, RAD model, Agile models: Extreme Programming, and Scrum.
Software Requirements Engineering:
Requirement Gathering and Analysis, Functional and Non-functional requirements,
Software Requirement Specification(SRS), IEEE 830 guidelines, Decision tables and
trees.
Structured Analysis & Design: (10Hrs)
Overview of design process: High-level and detailed design, Cohesion and coupling,
Modularity and layering, Function–Oriented software design: Structured Analysis using
DFD Structured Design using Structure Chart, Basic concepts of Object Oriented
Analysis & Design. User interface design, Command language, menu and iconic
interfaces.,
Coding and Software Testing Techniques:
Coding, Code Review, documentation. Testing: - Unit testing, Black-box Testing, White-
box testing, Cyclomatic complexity measure, coverage analysis, mutation testing,
Debugging techniques, Integration testing, System testing, Regression testing.
Software Reliability and Software Maintenance:
Basic concepts in software reliability, reliability measures, reliability growth modeling,
Quality SEI CMM, Characteristics of software maintenance, software reverse
engineering, software reengineering, software reuse.
Emerging Topics:
Client-Server Software Engineering, Service-oriented Architecture (SOA), Software as a
Service (SaaS),
Text Book:
1. Fundamentals of Software Engineering, Rajib Mall , PHI, 2014.
Reference Books:
1. Software Engineering, A Practitioner’s Approach, Roger S. Pressman ,TMG

Hill.
2. Software Engineering, I. Sommerville, 9th Ed. , Pearson Education.
17 Page
SOFTWARE ENGINEERING LABORATORY
Experiment1: Develop requirements specification for a given problem(The requirements

specification should include both functional and non-functional requirements. For a set of about
20 sample problems, see the questions section of Chap 6 of Software Engineering book of Rajib
Mall)
Experiment 2: Develop DFD Model (Level 0, Level 1 DFD and data dictionary) of the sample
problem (Use of a CASE tool required)
Experiment 3: Develop structured design for the DFD model developed
Experiment 4: Develop UML Use case model for a problem (Use of a CASE tool any of Rational
rose, Argo UML, or Visual Paradigm etc. is required)
Experiment 5: Develop Sequence Diagrams.
Experiment 6: Develop Class diagrams.
Experiment 7: Develop code for the developed class model using Java.
Experiment 8: Use testing tool such as Junit.
Experiment 9: Use a configuration management tool.
Experiment 10: Use any one project management tool such as Microsoft Project or Gantt Project,
etc.
18 Page
PCS3I001 DISCRETE STRUCTURES

Module-1.(15 Hours)
Sets and Propositions: Principle of Inclusion and Exclusion, Mathematical induction,
Propositions, Logical Connectives, Conditionals and Biconditionals, Logical Equivalences,
Predicate Calculus, Quantifiers, Theory of inference, Methods of proof.Relations and Functions:
properties of binary relations, Closure of relations, Warshall’s algorithm, Equivalence relations,
Partial ordering relations and lattices, Chains and antichains, Functions, Composition of
Functions, Invertible Functions, Recursive Functions, Pigeonhole principle.
Module-2. (5 Hours)
Numeric Functions and Generating Functions: Discrete Numeric functions, Generating
Functions, Recurrence Relations and Recursive Algorithms:Recurrence relations, Linear
recurrence relations with constant coefficients, Solution of recurrence relations by the method
of generating functions, Divide and conquer algorithms,
Module-3.(10 Hours)
Groups and Rings: groups and subgroups, Cosets and Lagrange’s theorem, Codes and Group
codes, Error detection and correction using Group codes, Isomorphism, Homomorphism and
normal subgroups, Rings, Integral domains and Fields, Boolean Algebras: Lattices and algebraic
systems, Principle of duality, Distributive and complemented lattices, Boolean functions and
Boolean expressions, Simplification of logic expressions using Karnaugh Map, Design and
Implementation of Digital Networks, Switching Circuits.
Module-4.(10 Hours)
Graphs and Trees: Basic terminology, Diagraphs and relations, representation of Graphs,
operations on graphs, paths and circuits, graph traversals, shortest path in weighted graphs,
Eulerian paths and circuits, Hamiltonian paths and circuits, Traveling sales person’s problem,
Planar graphs, Graph Coloring, Trees, Rooted trees, Binary search trees, Spanning trees,
Minimum spanning trees, Kruskal’s Algorithm, Prim’s Algorithm.
Text Book:
1. C. L. Liu, D. P. Mohapatra, Elements of Discrete Mathematics: A computer Oriented
Approach, McGraw Hill Education (India) Private Limited, 4th Edition, 2013.
Reference Books:
1. R.K.Bisht, and H.S.Dhami, Discrete Mathmatics, Oxford University Press, First Edition,
2015
2. Kenneth H. Rosen, Discrete Mathematics and its Applications, Tata McGraw Hill, 5thed,
2003.
3. J. P. Tremblay and R. Manohar, Discrete Mathematical Structures with Applications, to
Computer Science, TataMc-Graw Hill, 2001.
4. Joe L. Mott, A. Kandel, and T. P. Baker, Discrete Mathematics for Computer Scientists &
Mathematics, Prentice Hall of India, 2nd Edition, 2006.
5. N. Deo, Graph Theory with applications to Engineering & Computer Science, Prentice
Hall of India, 2006.
19
6. S. Lipschutz, Discrete Mathematics, Tata McGraw Hill, 2005

Page
PEK3E001 ENGINEERING ECONOMICS

Theory L/T (Hours per week):2/1, Credit: 3
Module I (12 hours)

Engineering Economics- Nature, Scope, Basic problems of an economy, Micro Economics
and Macro Economics.
Demand- Meaning of demand, Demand function, Law of Demand and its exceptions,
Determinants of demand, Elasticity of demand & its measurement (Simple numerical
problems to be solved ), Supply-Meaning of supply, Law of supply and its exception,
Determinants of supply, Elasticity of supply, Determination of market equilibrium
(Simple numerical problems to be solved).
Production-Production function, Laws of returns: Law of variable proportion, Law of
returns to scale
Module II (12 hours)
Cost and revenue concepts, Basic understanding of different market structures,
Determination of equilibrium price under perfect competition (Simple numerical
problems to be solved), Break Even Analysis-linear approach (Simple numerical
problems to be solved).
Banking -Commercial bank, Functions of commercial bank, Central bank, Functions of
Central Bank.
Inflation-Meaning of inflation, types, causes, measures to control inflation.
National Income-Definition, Concepts of national income, Method of measuring national
income.
Module III (12 hours)
Time value of money- Interest - Simple and compound, nominal and effective rate of
interest, Cash flow diagrams, Principles of economic equivalence.
Evaluation of engineering projects-Present worth method, Future worth method,
Annual worth method, Internal rate of return method, Cost benefit analysis for public
projects .
Depreciation- Depreciation of capital assert, Causes of depreciation, Methods of
calculating depreciation (Straight line method, Declining balance method), After tax
comparison of project.
Text Books
1. Riggs, Bedworth and Randhwa, “Engineering Economics”, McGraw Hill

Education India
2. Principles of Economics, Deviga Vengedasalam; Karunagaran Madhavan,
Oxford University Press.
3. Engineering Economy by William G.Sullivan, Elin M.Wicks, C. Patric Koelling,
Pearson
4. R.Paneer Seelvan, “ Engineering Economics”, PHI
5. Ahuja,H.L., “Principles of Micro Economics” , S.Chand & Company Ltd
6. Jhingan,M.L., “Macro Economic Theory”
20
7. Macro Economics by S.P.Gupta, TMH

Page
POB3E002 ORGANIZATIONAL BEHAVIOUR

Credit- 3 Class Hours - 40
Objectives:
1. To develop an understanding of the behavior of individuals and groups inside

organizations
2. To enhance skills in understanding and appreciating individuals, interpersonal,
and group process for increased effectiveness both within and outside of
organizations.
3. To develop theoretical and practical insights and problem-solving capabilities for
effectively managing the organizational processes.
Unit Contents Class

Hours
01 Fundamentals of OB: Definition, scope and importance of OB, 6
Relationship between OB and the individual, Evolution of OB,
Theoretical framework (cognitive), behavioristic and social cognitive),
Limitations of OB.
02 Attitude: Importance of attitude in an organization, Right Attitude, 10

Components of attitude, Relationship between behavior and attitude,
Developing Emotional intelligence at the workplace, Job attitude,
Barriers to changing attitudes.
Personality and values: Definition and importance of Personality for
performance, The Myers-Briggs Type Indicator and The Big Five
personality model, Significant personality traits suitable to the
workplace (personality and job – fit theory), Personality Tests and their
practical applications.
Perception: Meaning and concept of perception, Factors influencing

perception, Selective perception, Attribution theory, Perceptual process,
Social perception (stereotyping and halo effect).
Motivation: Definition & Concept of Motive & Motivation, The Content
Theories of Motivation (Maslow’s Need Hierarchy & Herzberg’s Two
Factor model Theory), The Process Theories (Vroom’s expectancy
Theory & Porter Lawler model), Contemporary Theories – Equity
Theory of Work Motivation.
03 Foundations of Group Behavior: The Meaning of Group & Group 9
behavior & Group Dynamics, Types of Groups, The Five – Stage Model of
Group Development.
Managing Teams: Why Work Teams, Work Teams in Organization,
Developing Work Teams, Team Effectiveness & Team Building.
Leadership: Concept of Leadership, Styles of Leadership, Trait
21
Approach Contingency Leadership Approach, Contemporary leadership,

Meaning and significance of contemporary leadership, Concept of
Page
transformations leadership, Contemporary theories of leadership,

Success stories of today’s Global and Indian leaders.
04 Organizational Culture : Meaning & Definition of Organizational

Culture, creating & Sustaining Organizational Culture, Types of Culture 8
(Strong vs. Weak Culture, Soft Vs. Hard Culture & Formal vs. Informal
Culture), Creating Positive Organizational Culture, Concept of
Workplace Spirituality.
05 Organizational Change: Meaning, Definition & Nature of 7

Organizational Change, Types of Organizational Change, Forces that acts
as stimulants to change.
Implementing Organizational Change : How to overcome the
Resistance to Change, Approaches to managing Organizational Change,
Kurt Lewin’s-Three step model, Seven Stage model of Change & Kotter’s
Eight-Step plan for Implementing Change, Leading the Change Process,
Facilitating Change, Dealing with Individual & Group Resistance,
Intervention Strategies for Facilitating Organizational Change, Methods
of Implementing Organizational Change, Developing a Learning
Organization.
Reference Books
1. Understanding Organizational Behaviour, Parek, Oxford
2. Organizational Behaviour, Robbins, Judge, Sanghi, Pearson.
3. Organizational Behaviour, K. Awathappa,HPH.
4. Organizational Behaviour, VSP Rao, Excel
5. Introduction to Organizational Behaviour, Moorhead, Griffin, Cengage.
6. Organizational Behaviour, Hitt, Miller, Colella, Wiley
22 Page
HONOURS SUBJECT
PCS3D001 ARTIFICIAL INTELLIGENCE

Module 1 (12Hrs)
What is Artificial Intelligence? AI Technique, Level of the Model,Problem Spaces, and
Search: Defining the Problem as a State Space Search, Production Systems, Problem
Characteristics, Production System Characteristics, Issues in the Design of Search
Programs.Heuristic Search Techniques: Generate-and-Test, Hill Climbing, Best-first Search,
Problem Reduction, Constraint Satisfaction, Means-ends Analysis,Knowledge
Representation: Representations and Mappings, Approaches to Knowledge
Representation, Using Predicate Logic: Representing Simple Facts in Logic, Representing
Instance and ISA Relationships, Computable Functions and Predicates, Resolution, Natural
Deduction.Using Rules: Procedural Versus Declarative Knowledge, Logic Programming,
Forward Versus Backward Reasoning, Matching, Control Knowledge.Symbolic Reasoning
Under Uncertainty: Introduction to Nonmonotonic Reasoning, Logics for Nonmonotonic
Reasoning, Implementation Issues, Augmenting a Problem-solver, Depth-first Search,
Breadth-first Search.Weak and Strong Slot-and-Filler Structures: Semantic Nets, Frames,
Conceptual DependencyScripts, CYC.
Module 2( 10Hrs)
Game Playing: The Minimax Search Procedure, Adding Alpha-beta Cutoffs, Iterative
Deepening.Planning: The Blocks World, Components of a Planning System, Goal Stack
Planning, Nonlinear Planning Using Constraint Posting, Hierarchical PlanningOther
Planning Techniques.Understanding: What is Understanding, What Makes Understanding
Hard?, Understanding as Constraint Satisfaction.Natural Language Processing:
Introduction, Syntactic Processing, Semantic Analysis, Discourse and Pragmatic Processing,
Statistical Natural Language Processing, Spell Checking.
Module 3 (8Hrs)
Learning: Rote Learning, Learning by Taking Advice, Learning in Problem-solving, Learning
from Examples: Induction, Explanation-based Learning, Discovery, Analogy, Formal
Learning Theory, Neural Net Learning and Genetic Learning. Expert Systems: Representing
and Using Domain Knowledge, Expert System Shells, Explanation, Knowledge Acquisition.
Text Book:
1. Elaine Rich, Kevin Knight, & Shivashankar B Nair, Artificial Intelligence, McGraw Hill,
3rd ed.,2009
References:
1. Introduction to Artificial Intelligence & Expert Systems, Dan W Patterson, PHI.,2010
2. S Kaushik, Artificial Intelligence, Cengage Learning, 1st ed.2011
23 Page
MINOR SUBJECT
PCS3G001 SOFTWARE ENGINEERING

Software Process Models:

Software Product, Software crisis, Handling complexity through Abstraction and
Decomposition, Overview of software development activities, Process Models,
Classical waterfall model, iterative waterfall model, prototyping mode, evolutionary
model, spiral model, RAD model, Agile models: Extreme Programming, and Scrum.
Software Requirements Engineering:

Requirement Gathering and Analysis, Functional and Non-functional requirements,
Software Requirement Specification(SRS), IEEE 830 guidelines, Decision tables and
trees.
Structured Analysis & Design: (10Hrs)

Overview of design process: High-level and detailed design, Cohesion and coupling,
Modularity and layering, Function–Oriented software design: Structured Analysis using
DFD Structured Design using Structure Chart, Basic concepts of Object Oriented
Analysis & Design. User interface design, Command language, menu and iconic
interfaces.,
Coding and Software Testing Techniques:
Coding, Code Review, documentation. Testing: - Unit testing, Black-box Testing, White-
box testing, Cyclomatic complexity measure, coverage analysis, mutation testing,
Debugging techniques, Integration testing, System testing, Regression testing.
Software Reliability and Software Maintenance:
Basic concepts in software reliability, reliability measures, reliability growth modeling,
Quality SEI CMM, Characteristics of software maintenance, software reverse
engineering, software reengineering, software reuse.
Emerging Topics:
Client-Server Software Engineering, Service-oriented Architecture (SOA), Software as a
Service (SaaS),
Text Book:
1. Fundamentals of Software Engineering, Rajib Mall , PHI, 2014.
Reference Books:
1. Software Engineering, A Practitioner’s Approach, Roger S. Pressman ,TMG

24
Hill.
Page
2. Software Engineering, I. Sommerville, 9th Ed. , Pearson Education.

B.Tech (Computer Science and Engineering) Syllabus for Admission Batch 2015-16 4th Semester
Fourth Semester
Theory Practical
L/T L/T
HS Applied Mathematics III 3-0 3 100 50
PC Computer Organization & 3-0 3 100 50 2 1 50
Architecture
PC Design & Analysis of 3-0 3 100 50 2 1 50
Algorithms
PC Database System 3-0 3 100 50 2 1 50
PC Formal Language & Automata 3-0 3 100 50 2 1 50
Theory
Organizational Behavior
*Skill Project and Hands on 6 3 100
Total 18 18 600 300 14 7 300
Total Marks: 1200
Total Credits: 25
Honours Data Analytics 4 4 100 50
Minor Database System
/ Computer
Organization &
Architecture
25
Page
Semester : 4th
--------------
1. PCS4D001 Honours(CP) Data Analytics 4-0-0 4
2. PMA4E001 HS(CP) Applied Mathematics - III 3-0-0 3
3. PEK4E002 HS(O1) Engineering Economics 3-0-0 3
4. POB4E003 HS(O1) Organizational Behavior 3-0-0 3
5. PCS4G001 Minor(O3) Database System 4-0-0 4
6. PCS4G002 Minor(O3) Computer Organization & Architecture 4-0-0 4
7. PCS4I101 PC(CP) Computer Organization & Architecture 3-0-1 4
8. PCS4I102 PC(CP) Design & Analysis of Algorithms 3-0-1 4
9. PCS4I103 PC(CP) Database System 3-0-1 4
10. PCS4I104 PC(CP) Formal Language & Automata Theory 3-0-1 4
11. PCS4I201 PC(CP) Skill Project and Hands on 0-0-3 3
---
26
---
26
Page
PMA4E001 APPLIED MATHEMATICS - III
Module-I
Complex Analysis:
Analytic function, Cauchy-Riemann equations, Complex integration: Line integral in the
complex plane, Cauchy’s integral theorem, Cauchy’s integral formula, Derivatives of analytic
functions, Taylor’s series, Maclaurin’s series, Laurent’s series, Singularities and zeros.
Module-II
Complex Analysis:
Residue integration method, evaluation of real integrals
Numerical Methods:
Errors of numerical results, error propagation,., Lagrange Interpolation, Newton divided
difference interpolation, Newton’s forward and backward interpolation, Spline interpolation.
Module-III
Numerical Methods:
Numerical integration: The trapezoidal rule, The Simpson’s rules, Gauss Integration formulas.
Solution of ordinary differential equation: Euler’s method, Improvement of Euler’s method,
Runge-Kutta methods, multi step methods, Methods for system and higher order ordinary
differential equations.
Module-IV
Probability Theory and Its Applications: Probability, Random variables, Probability
distributions, Mean and variance; Features of Probability Distribution: Binomial, Poisson,
Uniform and Normal distribution, Distribution of several random variables.
Statistical Techniques and Its Applications: Scope of Statistics, Random sampling, Sampling
Distribution,Correlation analysis, Regression Analysis,Fitting Straight Lines, Estimation of
Parameters, Statistical Hypothesis.
Text books:
1. E. Kreyszig,” Advanced Engineering Mathematics:,Tenth Edition, Wiley India
2. S.Pal and S.C. Bhunia, “Engineering Mathematics” Oxford University Press
3. Jay L. Devore, “Probability and Statistics for Engineering and Sciences”, Seventh
Edition, Thomson/CENGAGE Learning India Pvt. Ltd
Reference books:
1. E.B. Saff, A.D.Snider, “Fundamental of Complex Analysis”, Third Edition, Pearson
Education, New Delhi
2. P. V. O’Neil, “Advanced Engineering Mathematics”, CENGAGE Learning, New Delhi
27
Page
PCS4I101 COMPUTER ORGANIZATION AND ARCHITECTURE
Module – I (06 Hrs)

Basic structures of Computers: Computer Architecture vs. Computer Organization, Functional
units, Operational concepts, Registers, Bus and Bus organization, Memory location and
addresses, Big-endian and Little-endian representation.
Module – II (14 Hrs)

Basic Processing Units: Fundamental concepts, Instruction format, Instruction set, Addressing
modes. Instruction Sequencing, Execution cycle, Hardwired control, Micro programmed
control.
Memory System: Basic Concepts, Memory hierarchy, Main Memory, Secondary storage, Cache
memory.
Module – III (8 Hrs)

Arithmetic: Addition and Subtraction of signed and unsigned numbers, Multiplication of signed
and unsigned numbers, Booth Multiplier, Array Multiplier, Integer Division, Floating- point
Numbers and operations.
Module – IV (12 Hrs)

Microprocessors, Instruction set, Assembly Language Programming, Stack, Subroutine,
Interrupt, Accessing I/O devices, Standard I/O Interfaces- RS-232C, IEEE-488, USB, Data
Transfer techniques.
Text Books:
1. Computer Organization: Carl Hamacher, Zvonkovranesic, Safwat Zaky, McGraw Hill
2. Computer system Architecture: Morris M. Mano PHI.
Reference Book:
1. Computer Architecture: Parhami, Oxford University Press
2. Computer Architecture and Organization: William Stallings, Pearson Education.
3. Computer Architecture and Organization: John P. Hayes McGraw Hill.
4. Computer Architecture and Organization: An Integrated Approach, Murdocca, Heuring
Willey India.
5. Computer Organization and Design Hardware/ Software Interface: David A. Patterson,
John L. Hennessy, Elsevier. 28
Page
COMPUTER ORGANIZATION AND ARCHITECTURE LAB
1. (a) Identification of different components of a PC.
(b) Assembling & disassembling of a PC.
2. Study of different troubleshooting of a dot matrix printer using LX 1050+ Printer

Trainer Module.
3. Study of the functions of SMPS using SMPS Trainer Kit.

(a) Study of SMPS with Single Output under Line Regulation.
(b) Study of SMPS with Multi Output under Line Regulation.
(c) Study of SMPS with Single Output under Load Regulation.
4. Study of different troubleshooting of CPU using CPU Trainer Module.
5. Familiarization of different types of byte addressing instruction using 8085 simulator.
6. Study of assembly Language program in PC using 8086 architecture.
7. Design of digital circuits (H/A, F/A, Decoder & Encoder) in VHDL using Active VHDL.
8. Design of digital circuits (MUX, DEMUX & ALU) in VHDL using Active VHDL.
9. Write a C/C++ program to perform signed bit multiplication using Booth’s

algorithm.
10. Write a C/C++ program for IEEE-754 floating point representation and perform
Addition/Subtraction.
29
Page
PCS4I104 FORMAL LANGUAGE AND AUTOMATA THEORY
Mathematical preliminaries: Alphabet, String, Languages, Grammars, Strings and operations on
strings.
Finite Automata: Definition, Basic model, Types of Finite Automata, NFA vs. DFA, NFA to DFA
conversion, Eliminating ε-transitions from NFA, NFA as a language acceptor, Minimization of Finite
Automata, Design of DFA.

Regular Expressions: Operators in Regular expressions, Building Finite Automata from Regular
expression, Arden’s theorem, Building Regular expression from Finite Automata, Pumping Lemma
for Regular languages, Closure properties of Regular languages.CYK algorithm.
Context Free Grammars: Derivation and Parse Trees, Ambiguity, Elimination of Ambiguity,
Simplification of a CFG, Chomsky and Greibach Normal Forms. Closure and Decision Properties of
CFL, Pumping Lemma for CFL.

Push Down Automata: Basic Model, Components, Moves of a PDA, ID of a PDA, Design of a PDA, PDA
to CFG and CGA to PDA conversion.
Turing Machines: Model, Components, move of a TM, ID of TM, design of a TM, Recursively
Enumerable Languages, Variation of Turing Machine model, Universal Turing Machine and
Undecidable problems, Undecidability of Post correspondence problem.
Linear Bounded Automata and Context Sensitive Languages, Chomsky’s Hierarchy of Languages.
Module – IV (08 Hrs)

Primitive Recursive functions: µ- Recursive functions, Cantor and Godel numbering, Ackermann's
function, Excursiveness of Ackermann and Turing computable functions. Church Turing hypothesis,
Recursive and Recursively Enumerable sets, NP Completeness: P and NP, NP complete and NP Hard
problems.
Text Books:
1. Introduction to Automata Theory, Languages and Computation: J. E. Hopcroft, J. D Ullman,
Pearson Education.
2. Formal Language and Automata Theory, C. K. Nagpal, Oxford University Press.
Reference Books:
1. Introduction to Formal Languages, Automata Theory and Computation, K.
Kirthivasan, Rama R, Pearson Education.
2. Introduction to Languages and the Theory of Computation, Martin, Tata Mc-Graw Hill.
3. Theory of Computation, V. Kulkarni, Oxford University Press.
4. Elements of Theory of Computation, Lewis, PHI.
5. Introduction to the theory of computation, Michael Sipser, Cengage Learning.
30
Page
FORMAL LANGUAGE & AUTOMATA THEORY LAB
Implementation of following concept of Theory of computation using C-program:
1. DFAs for some regular languages
2. ϵ-NFA to DFA conversion
3. NFA to DFA conversion
4. Program for DFA minimization
5. PDAs for some Context free languages
6. CYK parsing algorithm for some specific Context free grammars
7. Turing machine for some Recursively Languages
31
Page
PCS4I102 DESIGN AND ANALYSIS OF ALGORITHM
Module- I (10
Hours)
Introduction, Definition, Chrematistics of algorithm, Growth of Functions, Asymptotic
analysis, Amortized analysis, standard notations and common functions, Recurrences,
solution of recurrences by substitution, recursion tree, induction method, and Master
methods, Algorithm design techniques, worst case analysis of Merge sort, Quick sort and
Binary search, Design & Analysis of Divide and conquer algorithms.
Module – II (10
Hours)
Heapsort mechanism, Heaps, Building a heap, The heapsort algorithm, Priority Queue,
Lower bounds for sorting. Dynamic programming methodology, Elements of dynamic
programming, Matrix-chain multiplication, Longest common subsequence, Greedy
Algorithms, Elements of Greedy strategy, Assembly-line scheduling, Activity selection
Problem, Fractional knapsack problem, Huffman codes).
Module – III (10

Hours)
Data structure for disjoint sets, Disjoint set operations, Linked list representation, path
compression, Disjoint set forests. Graph Algorithms and their characteristics, Breadth first
search and depth-first search, Minimum Spanning Trees, Kruskal algorithm and Prim's
algorithms, single- source shortest paths (Bellman-ford algorithm and Dijkstra's
algorithms), All-pairs shortest paths (Floyd – Warshall Algorithm).
Module – IV (10
Hours)
Back tracking, Branch and Bound, Eight Queen problem, string matching algorithms, naïve
string matching algorithm, Rabin-Karp algorithm, Knuth–Morris–Pratt algorithm, NP -
Completeness (Polynomial time, Polynomial time verification, NP - Completeness and
reducibility, NP-Complete problems (without Proofs), Approximation algorithms
characteristics, Traveling Salesman Problem.
Text Book:
1. T.H. Cormen, C.E. Leiserson, R.L. Rivest, C.Stein : Introduction to Algorithms, 2nd
Edition, PHI Learning Pvt. Ltd.
2. H. Bhasin: Algorithms, Design and Analysis, First Edition, Oxford Higher
Education.
Reference Books:
1. Sanjay Dasgupta, Umesh Vazirani: Algorithms, McGraw-Hill Education.
2. Horowitz & Sahani: Fundamentals of Algorithm, 2nd Edition, Universities Press.
32
3. Goodrich, Tamassia: Algorithm Design, Wiley India.

Page
DESIGN AND ANALYSIS OF ALGORITHMS LAB
1. Using a stack of characters, convert an infix string to postfix string (1 class)
2. Implement insertion, deletion, searching of a BST. (1 class)
3. (a) Implement binary search and linear search in a program

(b)Implement a heap sort using a max heap.
4. (a) Implement DFS/ BFS for a connected graph.

(b)Implement Dijkstra’s shortest path algorithm using BFS.
5. (a) Write a program to implement Huffman’s algorithm.

(b)Implement MST using Kruskal /Prim algorithm.
6. (a) Write a program on Quick sort algorithm.

(b)Write a program on merge sort algorithm.
Take different input instances for both the algorithm and show the running time.
7. Implement Strassen’s matrix multiplication algorithm.
8. Write down a program to find out a solution for 0 / 1 Knapsack problem.
9. Using dynamic programming implement LCS.
10. (a) Find out the solution to the N-Queen problem.

(b)Implement back tracking using game trees.
● *College should conduct at least one NSDC program under this category.
33
Page
PCS4I103 DATABASE SYSTEM
Module I: (10
Hours)
Introduction to database Systems, advantages of database system over traditional file
system, Basic concepts & Definitions, Database users, Database Language, Database System
Architecture, Schemas, Sub Schemas, & Instances, database constraints, 3-level database
architecture, Data Abstraction, Data Independence, Mappings, Structure, Components &
functions of DBMS, Data models.
Module II: (10

Hours)
Entity relationship model, Components of ER model, Mapping E-R model to Relational
schema, Network and Object Oriented Data models, Storage Strategies: Detailed Storage
Architecture, Storing Data, Magnetic Disk, RAID, Other Disks, Magnetic Tape, Storage
Access, File & Record Organization, File Organizations & Indexes, Order Indices, B+ Tree
Index Files, Hashing Data Dictionary
Module III: (10

Hours)
Relational Algebra, Tuple & Domain Relational Calculus, Relational Query Languages: SQL
and QBE. Database Design :-Database development life cycle (DDLC), Automated design
tools, Functional dependency and Decomposition, Join strategies, Dependency Preservation
& lossless Design, Normalization, Normal forms:1NF, 2NF,3NF, and BCNF, Multi-valued
Dependencies, 4NF & 5NF. Query processing and optimization: Evaluation of Relational
Algebra Expressions, Query optimization, Query cost estimation.
Module IV: (10

Hours)
Transaction processing and concurrency control: Transaction concepts, properties of
transaction, concurrency control, locking and Timestamp methods for concurrency control
schemes. Database Recovery System, Types of Data Base failure & Types of Database
Recovery, Recovery techniques. fundamental concepts on Object-Oriented Database, Object
relational database, distributed database, Parallel Database, Data warehousing & Data
Mining and Big data and NoSQL.
Text Books:
1. Sudarshan, Korth: Database System Concepts, 6th edition, McGraw-Hill Education.
References Books:
1. Elmasari &Navathe: Fundamentals of Database System, Pearson Education.

2. Ramakrishnan: Database Management Systems, McGraw-Hill Education.
3. Andrew S. Tanenbaum: Modern Operating Systems, 3rd Edition, Pearson Education.
34
4. Terry Dawson, Olaf Kirch: Linux Network Administrator’s Guide, 3rd Edition, O’Reilly
Page
Media
DATABASE SYSTEM LAB
1. Use of SQL syntax: insertion, deletion, join, updation using SQL. (1 class)
2. Programs on join statements and SQL queries including where clause. (1 class)
3. Programs on procedures and functions. (1 class)
4. Programs on database triggers. (1 class)
5. Programs on packages. (1 class)
6. Programs on data recovery using check point technique. (1 class)
7. Concurrency control problem using lock operations. (1 class)
8. Programs on ODBC using either VB or VC++. (1 class)
9. Programs on JDBC. (1 class)
10. Programs on embedded SQL using C / C++ as host language. (1 class)
35
Page
HONOURS SUBJECT
PCS4D001 DATA ANALYTICS (4-0-0)
(I) Predictive Analytics

1.Linear Methods for Regression and Classification: Overview of supervised learning,Linear
regression models and least squares, Multiple regression, Multiple outputs, Subset selection , Ridge
regression, Lasso regression , Linear Discriminant Analysis , Logistic regression , Perceptron learning
algorithm.
2.Neural Networks(NN) , Support Vector Machines(SVM),and K-nearest Neighbor: Fitting neural

networks, Back propagation,Issues in training NN, SVM for classification, Reproducing Kernels,
SVM for regression, K-nearest –Neighbour classifiers( Image Scene Classification)
3.Unsupervised Learning and Random forests: Association rules,Cluster analysis,Principal

Components,Random forests and analysis.
(II) Inferential Statistics and Prescriptive analytics

4.Assessing Performance of a classification Algorithm( t-test,McNemar’s test,Paired t-test,paired F-
test),Analysis of Variance, Creating data for analytics through designed experiments.
Introduction to big data and Challenges for big data analytics.
(III)Lab work
5. Implementation of following methods using R or Matlab ( One of the class tests with a
weightage of 15 marks be used to examine these implementations):
Simple and multiple linear regression,Logistic regression,Linear discreminant analysis,Ridge
regression, Cross-validation and boot strap, Fitting classification and regression trees, K-nearest
neighours, Principal component analysis ,K-means clustering.
RecommendedTexts:
1.Trevor Hastie, Robert Tibshirani,Jerome Friedman , The Elements of Statistical Learning-Data
Mining, Inference,and Prediction,Second Edition , Springer Verlag, 2009.
[ chapters: 2,3(3.1-3.4,3.6),4(4.3-4.5),11(11.3-11.6),12(12.1-12.3),13.3,14(14.1-14.3.8,14.5.1),15]
2. ( For unit 5 only) -G.James,D.Witten,T.Hastie,R.Tibshirani-An introduction to statistical learning
with applications in R,Springer,2013.(2.3,3.6.1-3.6.3,4.6.1-4.6.3,5.3,6.6.1,8.3.1,8.3.2,10.4,10.5.1)
3 ( for unit 4 only).E.Alpaydin, Introduction to Machine Learning, Prentice Hall Of
India,2010,(Chapter-19)
Refeerences
1.C.M.Bishop –Pattern Recognition and Machine Learning,Springer,2006
36
2. L.Wasserman-All of statistics
Texts 1 and 2 and reference 2 are available on line.
Page
Fifth Semester
Theory Practical
Code Course Name Hours/week Credit University Internal Hours/week Credit Marks
L/T Theory Marks Evaluation L/T Practical
PC Operating System 3-0 3 100 50 2 1 50
PC Computer 3-0 3 100 50 2 1 50
Graphics
PC Advanced 3-0 3 100 50 2 1
Computer
Architecture
PE Advanced JAVA 3-1 4 100 50 50
Programming/
Internet of
Things/Software
Testing/Parallel
Algorithms
OE Cloud 3-1 4 100 50
Computing/ Data
mining & Data
Warehousing/
Information
Retrieval
PC Advance Lab-I 8 4 200
Total 17 17 500 250 14 7 350
Total Marks: 1100
Total Credits: 24
Honours Real Time 4 4 100 50
Systems
Minor Operating
Systems
35
Page
Third Year Engineering

Semester : 5th
--------------
1. PCS5D001 Honours(CP) Real Time Systems 4-0-0 4
2. PCS5G001 Minor(CP) Operating Systems 4-0-0 4
3. PCS5H001 OE(O2) Cloud Computing 4-0-0 4
4. PCS5H002 OE(O2) Data mining & Data Warehousing 4-0-0 4
5. PCS5H004 OE(O2) Information Retrieval 4-0-0 4
6. PCS5I001 PC(CP) Advanced Computer Architecture 3-0-1 3
7. PCS5I101 PC(CP) Operating Systems 3-0-1 4
8. PCS5I102 PC(CP) Computer Graphics 3-0-1 4
9. PCS5I201 PC(CP) Advance Lab - I 0-0-4 4
10. PCS5J101 PE(O3) Advanced JAVA Programming 4-0-0 5
11. PCS5J102 PE(O3) Internet of Things 4-0-0 5
12. PCS5J103 PE(O3) Software Testing 4-0-0 5
13. PCS5J104 PE(O3) Parallel Algorithms 4-0-0 5
---
28
36
Page
PCS5G001 OPERATING SYSTEM (3-0-1)
MODULE-I (10 Hours)
Overview Operating System, Simple Batch Processing Systems, Multiprogramming and
Time Sharing systems. Personal Computer Systems, Parallel Systems, Distributed
Systems and Real- time Systems.
Operating System Structures: Operating System Services, System components,
Protection system, Operating System Services, system calls, Process Concept, Process
Scheduling, Operation on Processes, Inter-process communication, Examples of IPC
Systems, Multithreading Models, Threading Issues, Process Scheduling Basic concepts,
scheduling criteria, scheduling algorithms, Thread Scheduling.
MODULE-II (12 Hours)

Process Coordination, Synchronization, Critical section problem, Synchronization
hardware, Semaphores, Classical problems of synchronization, Monitors. Deadlocks,
System model, Deadlock Characterization, Handling Deadlocks, Deadlock Prevention,
Deadlock avoidance, Deadlock Detection, recovery from Deadlock. Memory
Management strategies, Logical versus Physical Address space, swapping, contiguous
Allocation, Paging, Segmentation. Virtual Memory: Background, Demand paging,
performance of Demand paging, Page Replacement, Page Replacement Algorithms.
Allocation of frames, Thrashing, Demand
Segmentation.
MODULE-III (08 Hours)

Recovery, Overview of Mass Storage Structure, Disk Structure, Disk Scheduling, Disk
Management, Swap-Space Management, I/O System Overview, I/O Hardware,
Application I/O Interface, Kernel I/O Subsystem, Transforming I/O Request to
Hardware Operation.
MODULE-IV (10 Hours)

File system, file structure, Directory Structure, Allocation Methods, Basic concepts of
Linux system, administration requirements, setting up Linux multi-server setup, setting
up of local network services, domain name systems, Virtualization concepts,
classification, VM ware and Hypervisor concepts.
TEXT BOOK:
1. Abraham Silberschatz, Peter Baer Galvin, Greg Gagne: Operating System Concepts,
8th edition, Wiley-India, 2009.
2. Naresh Chouhan: Principles of Operating System, Oxford University Press.
3. Dhamdhare: Operating Systems: A Concept, 3rd Edition, Tata McGraw Hill Education
India
REFERENCE BOOK:
1. William Stallings: Operating Systems, PHI Learning Pvt. Ltd.

2. H.M. Deitel, P. J. Deitel, D. R. Choffnes: Operating Systems, 3rdEdition, Pearson Education.
3. Andrew S. Tanenbaum: Mordern Operating Systems, 3rdEdition, PHI Learning Pvt. Ltd.
37
Page
OPERATING SYSTEM LABORATORY
1. Basic UNIX Commands.

2. Linux Administrative commands.
3. UNIX Shell Programming.
4. Programs on process creation and synchronization, inter process
communication including shared memory, pipes and messages.
(DinningPhilosopher problem / Cigarette Smoker problem / Sleeping barber
problem)
5. Programs on UNIX System calls.
6. Simulation of CPU Scheduling Algorithms. (FCFS, RR, SJF, Priority,
Multilevel Queuing)
7. Simulation of Banker’s Algorithm for Deadlock Avoidance, Prevention
8. Program for FIFO, LRU, and OPTIMAL page replacement algorithm.
9. Android Programming for mobile application.
38
Page
PCS5I102 COMPUTER GRAPHICS (3-0-1)
Module – I (12 hours)
Overview of Graphics System: Video Display Units, Raster-Scan and Random Scan Systems,
Graphics Input and Output Devices.
Output Primitives: Line drawing Algorithms: DDA and Bresenham’s Line Algorithm, Circle
drawing Algorithms: Midpoint Circle Algorithm and Bresenham’s Circle drawing Algorithm.
Two Dimensional Geometric Transformation: Basic Transformation (Translation, Rotation,
Scaling) Matrix Representation, Composite Transformations, Reflection, Shear, Transformation
between coordinate systems.
Module – II (12 hours)

Two Dimensional Viewing: Window-to- View Port Coordinate Transformation.
Line Clipping (Cohen-Sutherland Algorithm) and Polygon Clipping (Sutherland-Hodgeman
Algorithm)
Aliasing and Antialiasing, Half Toning, Thresholding, Dithering.
Polygon Filling: Seed Fill Algorithm, Scan line Algorithm.
Two Dimensional Object Representations: Spline Representation, Bezier Curves, B-Spline
Curves.
Fractal Geometry: Fractal Classification and Fractal Dimension.
Module – III (8 hours)

Three Dimensional Geometric and Modeling Transformations: Translation, Rotation, Scaling,
Reflections, shear, Composite Transformation.
Projections: Parallel Projection, Perspective Projection.
Visible Surface Detection Methods: Back-Face Detection, Depth Buffer, A- Buffer, Scan- Line
Algorithm, Painters Algorithm.
Module – IV (8 hours)
Illumination Models: Basic Models, Displaying Light Intensities.
Surface Rendering Methods: Polygon Rendering Methods: Gouraud Shading, Phong Shading.
Computer Animation: Types of Animation, Key frame Vs. Procedural Animation, Methods of
Controlling Animation, Morphing.
Introduction to Virtual Reality and Augmented Reality.
Textbook:
1. Computer Graphics, D. Hearn and M.P. Baker (C Version), Pearson Education.
Reference Books:
1. Computer Graphics Principle and Practice, J.D. Foley, A. Dam, S.K. Feiner, Addison
Wesley.
2. Procedural Elements of Computer Graphics, David Rogers, TMH.
3. Computer Graphics: Algorithms and Implementations, D.P Mukherjee, D. Jana, PHI.
4. Computer Graphics, Z. Xiang, R. A. Plastock, Schaum’s Outlines, McGrow Hill.
5. Computer Graphics, S. Bhattacharya, Oxford University Press.
39
Page
COMPUTER GRAPHICS LABORATORY
1. Implementation of DDA and Bresenham’s Line drawing algorithms.
2. Implementation of Midpoint & Bresenham’s circle drawing algorithms.
3. Implementation of Two Dimensional transformations - Translation,
Rotation, Scaling, Reflection, Shear.
4. Implementation of Composite 2D Transformations
5. Implementation of Cohen Sutherland 2D line clipping and Windowing
6. Implementation of Sutherland – Hodgeman Polygon clipping Algorithm
7. Implementation of Three dimensional transformations - Translation,
Rotation, Scaling
8. Implementation of Composite 3D transformations
9. Implementation of B-Spline & Bezier Curves.
10. Implementations of fractals.
40
Page
PCS5I001 ADVANCED COMPUTER ARCHITECTURE (3-0-1)
Microprocessor and Microcontroller, RISC and CISC architectures, Parallelism, Pipelining
fundamentals, Arithmetic and Instruction pipelining, Pipeline Hazards, Superscalar
Architecture, Super Pipelined Architecture, VLIW Architecture, SPARC and ARM processors.

Basic Multiprocessor Architecture: Flynn’s Classification, UMA, NUMA, Distributed Memory
Architecture, Array Processor, Vector Processors.

Interconnection Networks: Static Networks, Network Topologies, Dynamic Networks, Cloud
computing.
Module –IV (08 Hrs)

Memory Technology: Cache, Cache memory mapping policies, Cache updating schemes,
Virtual memory, Page replacement techniques, I/O subsystems.
Text Book
1. John L. Hennessy and David A. Patterson, Computer Architecture: A Quantitative
Approach, Morgan Kaufmann.
2. Computer Organization: Carl Hamacher, Zvonkovranesic, Safwat Zaky, McGraw Hill
References:
1. Kai Hwang, Advanced Computer Architecture: Parallelism, Scalability, Programmability,
McGraw-Hill.
2. K. Hwang and F. A. Briggs, Computer Architecture and Parallel Processing, McGraw Hill.
3. Computer Architecture: Parhami, Oxford University Press
4. Dezso Sima, Terence Fountain, and Peter Kacsuk, Advanced Computer Architecture: A
Design Space Approach, Addison Wesley.
5. John Paul Shen and Mikko Lipasti, Modern Processor Design, Tata McGraw Hill.
41
Page
ADVANCED COMPUTER ARCHITECTURE LAB
(Using Simplescalar Simulator)
Introduction
These lab assignments are designed to learn and perform hardware simulations
usingSimplescalar.
Lab Assignment
Experiment 1: Program behavior (Instruction Profiling)

Download different benchmarks programs from internet and run the profiling simulator
for them to find out the distribution of instruction classes. Test for the following
questions.
1. Is your benchmark memory intensive or computation intensive?
2. Is your benchmark mainly using integer or floating point?
3. What percentage of the instructions executed are conditional branches?
Experiment 2: Branch Predictor Test

In this experiment branch prediction simulator (sim-bpred) can be used to investigate
the effects of branch predictors on the execution of the benchmark Programs. This
simulator allows you to simulate 6 different types of branch predictors. You can see the
list of them by looking at the menu 'branchpredictor type' for the branch prediction
simulator sim-bpred.
Experiment 3: In-order versus out-of-order

Conduct experiments to find out how the increase in the parallelism in
processinginstructions affect the CPI of your processor, and how you can improve the
performance of memory reference instructions. In all experiments you will use the
default cache and branch predictor configurations.
Experiment 4 and 5: In-order and out-of-order issue.

Experiment with the width of the pipeline by running the simulation with the following
combinations of parameters. Measure CPI and total no of cycles.
 Pipeline width 1, in-order and out-of-order execution (out-of order execution is
default, in-order must be selected explicitly, see the SimpleScalar manual for
instructions on how to do this).
 Pipeline width 4, in-order and out-of-order execution
 Pipeline width 8, in order and out of order execution
Memory references
Run the sim-outorder simulator varying the number of memory ports available: 1,2 and
4. Use a pipeline width of 4. What is the impact on CPI on the increase in available
memory ports?
Assignment 5: Cache Performance
Use a single run of sim-cheetah to simulate the performance of the following cache
configurations for the benchmark you previously selected.
 least-recently-used (LRU) replacement policy
 8 to 1024 sets
42
 1-way to 8-way associativity

 32-byte cache blocks
Page
Assignment 6, 7 and 8: Test the Performance for other cache replacement policies
like Least Frequently Used(LFU) and Random Replacement with different cache
mapping techniques.
Assignment 9 and 10: Testing Relation of block size, miss ratio and mean access
time
Run simulations for your benchmark with sim-outorder, using a unified L1 cache with a
size of 32 KB, associativity 2 and block sizes 16, 32, 64, 128, 256 bytes. The L2 data
cache should be 512 KB with block size of at least 256 (choose reasonable parameters).
References:
SimpleScalaris an open source tool and is available for download together with various
tools and utilities including detailed documentation from
http://www.simplescalar.com/
43
Page
PCS5J101 ADVANCED JAVA PROGRAMING (4-0-0)
Module1:-
An introduction to Network Programming.
Basics of Networking, Introduction to Socket Programming, Remote Method Invocation,
Java Mail API, A small chatting application using Network Programming.
Introduction to Web Application and its programming.
Description about Web application, Client, Server (Apache Tomcat/ WebLogic/
GlassFish), An Introduction to client side programming
(HTML5/CSS3/JavaScript/JQuery), An Introduction to XML/JSON.
Module2:-
Basics of JDBC
Introduction to JDBC, Need of JDBC, JDBC Drivers (4 types), Architecture of JDBC,
Components of JDBC (Classes and Interfaces).
Programming with JDBC
Creating a DATABASE (MS- ACCESS/ORACLE/MySQL (for Type-3 and Type-4
connection), First Program to connect to the DATABASE created, Loading the Driver,
Establishing the Connection, Creating Statements
(Statement/PreparedStatement/CallableStatement), Executing a SQL Query, Different
types of SQL Queries, Simple Statement, Atomic Statement, Pre-Compiled Statement,
SQL Statements for stored Procedures.
JDBC Program to retrieve data from DATABASE.
Introduction to Result Set, Result Set with Statement Interface, Result Set with Prepared
Statment Interface, Bidirectional Result Set, Result Set Scroll ability Type, Result Set
Updatabiltiy Type, Updating data to the database using Result Set, Result Set Metadata,
Executing Stored Procedures Using Callable Statement.
Module3:-
Introduction to Servlets.
What is Servlet, Advantage of Servlet Over Applets and CGI, Strengths of Servlet,
Architecture of Web Application, Web Servers and its Containers, Role of servlet in Web
application development, Understanding servlet-api, Understating HTTP protocol and
communication between HTML-SERVLET.
Getting Deep to Servlets.
Types of Servlet, Difference between HttpServlet and GenericServlet, Life cycle of
Servlets and different life cycle methods, Difference between doGet() and doPost(),
Servlet Generating Html output, Collecting Client submitted data in a Servlet.
Servlet communications.
Servlet to DBMS communication using type-4 connection, Servlet to DBMC
communication using JDBC connection pooling, Servlet communication with other
servlets (Servlet Chaining), Servlet communication with JSP or HTML page
(sendRedirect(), Difference between sendRedirect() and RequestDispatcher forward(),
Understanding ServletConfig.
Conclusion to Servlets.
Servlet Filters and wrappers, Servlet Listeners, Session Tracking, Cookies, HttpSession,
HTML hidden form filed element, URL rewriting, Annotation based servlet programs,
44
Web Security with servlets, Servlet code for file uploading and downloading, Servlet
Page
code for mailing.

Module4:-
Java Server Pages: -
Introduction to JSP, Scope of JSP, Anatomy of a JSP program, Execution of a JSP program,
Significance of JSP Engine, Built in objects of JSP, Significance of JSP Elements, Scripting
Elements, Scriptlets, Declaration, Expression, Directives and Action Elements, Page
Directive, Include Directive, Taglib Directive, Forward action element, Include, Param,
useBean with introduction to beans, setProperty, getProperty
Miscellaneous
Introduction to JNDI, Introduction to web services (SOAP/SOA), Rest API, An
introduction to JSTL, CORBA Architecture, Facelets, JSF, AJAX Programming,
Struts/Springs, Hibernates.
Text book:-
1. Advanced Java Programming, Uttam K. Roy, Oxford University Press.
Reference Book:-
1. Black book, Kogent Learning Solution Inc.
2. Java 2: The Complete Reference by Herbert Schildt, Fifth Edition Paperback
45
Page
PCS5J102 INTERNET OF THINGS (4-0-0)
Module 1
Introduction: Definition – Foundations – Challenges and Issues - Identification - Security.
Components in internet of things: Control Units – Sensors – Communication modules –Power
Sources – Communication Technologies – RFID – Bluetooth – Zigbee – Wifi – Rflinks –Mobile
Internet – Wired Communication-IoT Platform Overview-Raspberry pi-Arduino boards.
Module2
IoT Protocols: Protocol Standardization for IoT-M2M and WSN Protocols-SCADA and RFID
Protocols-Issues with Iot Standardization-Protocols-IEEE 802.15.4-BACNet Protocol-
Zigbee,Architecture - Network layer – APS Layer – Security.
Module 3
Resource Management in the Internet of Things: Clustering - Software Agents - Data
Synchronization - Clustering Principles in an Internet of Things Architecture - The Role of
Context - Design Guidelines -Software Agents for Object – Data Synchronization- Types of
Network Architectures - Fundamental Concepts of Agility and Autonomy-Enabling
Autonomymand Agility by the Internet of Things - The Evolution from the RFID-based EPC
Network to an Agent based Internet of Things- Agents for the Behaviour of Objects.
Module 4
Case Study and IoT Application Development: IoT applications in home- infrastructuressecurity-
Industries- IoT electronic equipments. Use of Big Data and Visualization in IoTIndustry 4.0
concepts - Sensors and sensor Node –Interfacing using Raspberry Pi/Arduino- Web Enabled
Constrained Devices.
Module 5
Web of Things: Web of Things versus Internet of Things-Architecture Standardization for
WoT-Platform Middleware for WoT- WoT Portals and Business Intelligence-Cloud of
Things:Grid/SOA and Cloud Computing-Cloud Standards –Cloud of Things Architecture-Open
Source e-Health sensor platform.
Programming assignments are mandatory.Develop schemes for the applications of IOT in real
time scenarios.Design business Intelligence and Information Security for WoT.
Text Books:
1. Honbo Zhou, ”The Internet of Things in the Cloud:A Middleware Perspective” –– CRC
Press-2012.
2. Dieter Uckelmann, Mark Harrison, “Architecting the Internet of Things”, Springer-2011.
3. Arshdeep Bahga, Vijay Madisetti, “Internet of Things (A Hands-On-Approach)”, VPT,
2014.
4. Olivier Hersent, David Boswarthick, Omar Elloumi, “The Internet of Things – Key
applications and Protocols”, Wiley, 2012.
References:
1. Luigi Atzori, Antonio Lera, Giacomo Morabito, “The Internet of Things: A Survey”,
Journal on Networks, Elsevier Publications, October, 2010.
2. http://www.theinternetofthings.eu/what-is-the-internet-of-things.
46
Page
PCS5J103 SOFTWARE TESTING (4-0-0)
Module 1-Introduction
Testing as an Engineering Activity – Testing as a Process – Testing axioms – Basic definitions –
Software Testing Principles – The Tester’s Role in a Software Development Organization –
Origins of Defects – Cost of defects – Defect Classes – The Defect Repository and Test Design –
Defect Examples – Developer/Tester Support of Developing a Defect Repository – Defect
Prevention strategies.
Module 2-TEST CASE DESIGN

Test case Design Strategies – Using Black Bod Approach to Test Case Design – Random Testing –
Requirements based testing – Boundary Value Analysis – Equivalence Class Partitioning – State
based testing – Cause-effect graphing – Compatibility testing – user documentation testing –
domain testing – Using White Box Approach to Test design – Test Adequacy Criteria – static
testing vs. structural testing – code functional testing – Coverage and Control Flow Graphs –
Covering Code Logic – Paths – code complexity testing – Evaluating Test Adequacy Criteria.
Module 3-LEVELS OF TESTING

The need for Levers of Testing – Unit Test – Unit Test Planning – Designing the Unit Tests – The
Test Harness – Running the Unit tests and Recording results – Integration tests – Designing
Integration Tests – Integration Test Planning – Scenario testing – Defect bash
elimination System Testing – Acceptance testing – Performance testing – Regression Testing –
Internationalization testing – Ad-hoc testing – Alpha, Beta Tests – Testing OO systems –
Usability and Accessibility testing – Configuration testing – Compatibility testing – Testing the
documentation – Website testing.
Module 4-TEST MANAGEMENT

People and organizational issues in testing – Organization structures for testing teams –
testing services – Test Planning – Test Plan Components – Test Plan Attachments – Locating
Test Items – test management – test process – Reporting Test Results – The role of three groups
in Test Planning and Policy Development – Introducing the test specialist – Skills needed by a
test specialist – Building a Testing Group.
Module 5-TEST AUTOMATION

Software test automation – skill needed for automation – scope of automation – design
and architecture for automation – requirements for a test tool – challenges in automation – Test
metrics and measurements – project, progress and productivity metrics.
TEXT BOOKS:
1. Srinivasan Desikan and Gopalaswamy Ramesh, “Software Testing – Principles
and Practices”, Pearson Education, 2006.
2. Naresh Chauhan, Software Testing Principle and Practices, Oxford University Press.
3. Ron Patton, “Software Testing”, Second Edition, Sams Publishing, Pearson Education,
2007.
REFERENCES:
1. Ilene Burnstein, “Practical Software Testing”, Springer International Edition, 2003.
2. Edward Kit,” Software Testing in the Real World – Improving the Process”, Pearson
Education, 1995.
3. Boris Beizer,” Software Testing Techniques” – 2nd Edition, Van Nostrand Reinhold, New
York, 1990.
47
4. Aditya P. Mathur, “Foundations of Software Testing _ Fundamental Algorithms

and Techniques”, Dorling Kindersley (India) Pvt. Ltd., Pearson Education, 2008.
Page
PCS5J104 PARALLEL ALGORITHMS (4-0-0)
Introduction: Need for High Performance Computer, Motivation for Parallelism, Methods to
achieve High Performance, Parallel Programming Platforms- Control structure of parallel
platform, Pipelining, Superscalar Architecture, Super Pipelined Architecture, VLIW Architecture,
Pipelining vs. Parallelism.
Module – II (10Hrs)
Interconnection Networks for Parallel Computer: Static Interconnection Networks, Network
Topologies, Evaluation of Static Network, Dynamic Interconnection Networks, Evaluation of
Dynamic Network, Routing Mechanism for Interconnection Network.

Designing Parallel Algorithms: Temporal Parallelism, Data Parallelism, Task Decomposition,
Concurrency, Granularity selection, Inter-Task Dependency, Dependency Graph, Parallel
Algorithm Models, Models of Computation, Performance Metrics of Parallel Algorithm, Amdahl’s
Law.

Parallel Programming: Sorting, Searching, Matrix Multiplication, Data dependency and Loop
Optimizations, Message Passing Programming, Shared Memory Programming, Data Parallel
Programming, Performance evaluation of Parallel Computer.
Text Book
1. A. Grama, A. Gupta, G. Karypis, V. Kumar, Introduction to Parallel Computing, Pearson.
2. V. Rajaraman, C. S. R. Murthy, Parallel Computers Architecture and Programming, PHI.
References:
1. M. J. Quinn, Designing Efficient Algorithms for Parallel Computers, McGraw-Hill
2. W. P. Petersen, P. Arbenz, Introduction to Parallel Computing, Oxford University Press.
3. B. Wilkinson, M. Allen, Parallel Programming, Pearson.
4. H. Attiya, J. Welch, Distributed Computing Fundamentals, Simulations and Advanced
Topics, Wiley.
5. T. G. Lewis, Parallel Programming: A Machine-Independent Approach, IEEE Computer
Society Press.
6. M. R. Bhujade, Parallel Computing, New Age.
48
Page
PCS5H001 CLOUD COMPUTING (4-0-0)
Module 1
Evolution of Computing Paradigms - Overview of Existing Hosting Platforms, Grid
Computing, Utility Computing, Autonomic Computing, Dynamic Datacenter Alliance,
Hosting / Outsourcing, Introduction to Cloud Computing, Workload Patterns for the
Cloud, “Big Data”, IT as a Service, Technology Behind Cloud Computing,
Module 2
A Classification of Cloud Implementations- Amazon Web Services - IaaS, The Elastic
Compute Cloud (EC2), The Simple Storage Service (S3), The Simple Queuing Services
(SQS), VMware vCloud - IaaS, vCloud Express, Google AppEngine - PaaS, The Java
Runtime Environment,
Module 3
The Python Runtime Environment- The Datastore, Development Workflow, Windows
Azure Platform - PaaS, Windows Azure, SQL Azure, Windows Azure AppFabric,
Salesforce.com - SaaS / PaaS, Force.com, Force Database - the persistency layer, Data
Security, Microsoft Office Live - SaaS, LiveMesh.com, Google Apps - SaaS, A Comparison
of Cloud Computing Platforms, Common Building Blocks.
Module 4
Cloud Security – Infrastructure security – Data security – Identity and access
management Privacy- Audit and Compliance.
Text Book:
1. Kai Hwang, Geoffrey C. Fox and Jack J. Dongarra, “Distributed and Cloud Computing
from Parallel Processing to the Internet of Things”, Morgan Kaufmann, Elsevier, 2012
Reference Books
1. Barrie Sosinsky, “Cloud Computing Bible” John Wiley & Sons, 2010
2. Tim Mather, Subra Kumaraswamy, and Shahed Latif, “Cloud Security and Privacy An
Enterprise Perspective on Risks and Compliance”, O'Reilly 2009
49
Page
PCS5H004 INFORMATION RETRIEVAL (4-0-0)
Module1
Introduction: Definition, Objectives, Functional Overview, Relationship to DBMS,
Digital libraries and Data Warehouses. Information Retrieval System
Capabilities: Search, Browse, Miscellaneous.Cataloging and Indexing: Objectives,
Indexing Process, Automatic Indexing, Information Extraction.
Module2
Data Structures: Introduction, Stemming Algorithms, Inverted file structures, N-gram
data structure, PAT data structure, Signature file structure, Hypertext data structure.
Automatic Indexing: Classes of automatic indexing, Statistical indexing, Natural
language, Concept indexing, Hypertext linkages
Module3
Document and Term Clustering: Introduction, Thesaurus generation, Item clustering,
Hierarchy. of clusters. User Search Techniques: Search statements and binding,
Similarity measures and ranking, Relevance feedback, Selective dissemination of
information search, Weighted searches of Boolean systems, Searching the Internet and
hypertext.
Information Visualization: Introduction, Cognition and perception, Information
visualization technologies.
Module4
Text Search Algorithms: Introduction, Software text search algorithms, Hardware text
search systems. Information System Evaluation: Introduction, Measures used in
system evaluation, Measurement example – TREC results.
TEXTBOOK:
1. Kowalski, Gerald, Mark T Maybury: Information Retrieval Systems: Theory and
Implementation, Kluwer Academic Press, 1997.
REFERENCES:
1. Frakes, W.B., Ricardo Baeza-Yates: Information Retrieval Data Structures
and Algorithms, Prentice Hall, 1992.
2. Modern Information Retrival By Yates Pearson Education.
3. Information Storage & Retieval By Robert Korfhage – John Wiley & Sons.
50
Page
PCS5H002 DATA MINING AND DATA WAREHOUSING (4-0-0)
Module 1
The Compelling Need for data warehousing: Escalating Need for strategic information, failures
of Past decision-support systems, operational versus decision-support systems, data
warehousing – the only viable solution, data warehouse defined
Data warehouse – The building Blocks: Defining Features, data warehouses and data marts,
overview of the components, metadata in the data warehouse
Defining the business requirements: Dimensional analysis, information packages – a new
concept, requirements gathering methods, requirements definition: scope and content.
Module 2
OLAP in the Data Warehouse:
Demand for Online analytical processing, need for multidimensional analysis, fast access and
powerful calculations, limitations of other analysis methods, OLAP is the answer, OLAP
definitions and rules, OLAP characteristics, major features and functions, general features,
dimensional analysis, what are hypercube? Drill-down and roll-up, slice-and-dice or rotation,
OLAP models, overview of variations, the MOLAP model, the ROLAP model, ROLAP versus
MOLAP, OLAP implementation considerations
Module 3
Data Mining Basics: What is Data Mining, Data Mining Defined, The knowledge discovery
process, OLAP versus data mining, data mining and the data warehouse, Major Data Mining
Techniques, Cluster detection, decision trees, memory-based reasoning, link analysis, neural
networks, genetic algorithms, moving into data mining, Data Mining Applications, Benefits of
data mining, applications in retail industry, applications in telecommunications industry,
applications in banking and finance
Module 4
Applications of Data mining-Social Impacts of Data mining-Tools- Mining the World Wide
Web– Spatial Data Mining – Multimedia Data Mining – Text Mining. Programming assignments
are mandatory.
Text Book:
1. Jiawei Han, Micheline Kamber, and Jian Pei, “Data Mining Concepts and Techniques”,
Third Edition, Elsevier.
2. Vikram Pudi & P. Radha Krishna, Data Mining, Oxford University Press.
3. Reema Thareja, Data Warehousing, Oxford University Press.
Reference Books:
1. Alex Berson and Stephen J. Smith “Data Warehousing, Data Mining & OLAP”,
Tata McGraw – Hill Edition, Tenth Reprint 2007
2. K.P. Soman, ShyamDiwakar and V. Ajay “Insight into Data mining Theory and
3. Practice”, Easter Economy Edition, Prentice Hall of India, 2006
4. G. K. Gupta “Introduction to Data Mining with Case Studies”, Easter Economy Edition,
Prentice Hall of India, 2006
5. Pang-Ning Tan, Michael Steinbach and Vipin Kumar “Introduction to Data
Mining”, Pearson Education, 2007.
51
Page
Honors
PCS5D001 REAL TIME SYSTEMS (4-0-0)
MODULE-1 14Hrs
Introduction: What is real time, Applications of Real-Time systems, A basic model of
Real-time system, Characteistics of Real-time system, Safety and Reliability, Types of
Real-time tasks, timing constraints, Modelling timing constraints Real-Time Task
Scheduling: Some important concepts, Types of Real-time tasks and their
characteristics, Task scheduling, Clock-Driven scheduling, Hybrid schedulers, Event-
Driven scheduling, Earliest Deadline First (EDF) scheduling, Rate monotonic algorithm
(RMA). Some issues Associated with RMA. Issues in using RMA practical situations.
MODULE-2 14Hrs
Handling Resource Sharing and dependencies among Real-time Tasks: Resource sharing
among real-time tasks. Priority inversion. Priority Inheritance Protocol (PIP), Highest
Locker Protocol (HLP). Priority Ceiling Protocol (PCP). Different types of priority
inversions under PCP. Important features of PCP. Some issues in using a resource
sharing protocol. Handling task dependencies. Scheduling Real-time tasks in
multiprocessor and distributed systems: Multiprocessor task allocation, Dynamic
allocation of tasks. Fault tolerant scheduling of tasks. Clock in distributed Real-time
systems, Centralized clock synchronization
MODULE-3 12Hrs
Commercial Real-time operating systems: Time services, Features of a Real-time
operating system, Unix as a Real-time operating system, Unix-based Real-time operating
systems, Windows as a Real-time operating system,POSIX-RT, A survey of
contemporary Real-time operating systems. Benchmarking real-time systems.
Real-time Databases: Example applications of Real-time databases. Review of basic
database concepts, Real-time databases, Characteristics of temporal data. Concurrency
control in real-time databases. Commercial real-time databases. Realtime
Communication: Basic concepts, Examples of applications, Real-time communication in
a LAN and Real-time communication over packet switched networks.
Text Book:
1. Real-time Systems Theory and Practice by Rajib Mall, Pearson Publication,
2008.
References:
1. Jane W. S. Liu, Real-Time Systems, Pearson Education, 2000.
2. C.M. Krishna and K.G. Shin, Real-Time Systems, TMH.
52
Page
Advanced Lab-I
1. Write a JAVA program to demonstrating multithreading.
2. Write a set of two JAVA programs for communicating between them using socket
& datagram programming.
3. Write a JAVA Servlet Program to implement and demonstrate get() and Post
methods(Using HTTP Servlet Class).
4. Write a JAVA JSP Program to implement verification of a particular user login

and display a Welcome page.
5. Write a JDBC Program to insert data into Student DATA BASE and retrieve info
based on particular queries(For example update, delete, search etc…).
6. Write a JSP program to read data from a DATABASE.
7. Write a set of JAVA programs to implement Remote method Invocation.

8. Develop a JAVA SWING program to design a calculator.
9. Using JSP develop a project to implement ONLINE EXAMINATION SYSTEM.
53
Page

CSE Merge 22 07 2017 PDF

Uploaded by

Copyright:

Available Formats

CSE Merge 22 07 2017 PDF

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

CSE Merge 22 07 2017 PDF

Uploaded by

Copyright:

Available Formats

B.

Branch-Computer Science & Engineering

ES Engineering Workshop/ 4 2 100

Second Year Engineering

Third Year Engineering

# # To be conducted by the Training & Placement department of the College.

Final Year Engineering

Projects on Internet of 8 4 200

Distribution of Credit Semester wise:

Internal Evaluation Scheme

Pass Mark in Internal is 50% of total marks i.e. 25

Practical/Sessional Evaluation Scheme

ADMISSION BATCH 2015-16

BRANCH-COMPUTER SCIENCE AND ENGINEERING

Second Year Engineering

PCS3G001 Minor Software

PCS3I101 SWITCHING CIRCUITS AND LOGIC DESIGN

Introduction: Logic design, transistors as switches, CMOS gates, sequential circuits,some

SWITCHING CIRCUITS AND LOGIC DESIGN LAB

PCS3I102 OBJECT ORIENTED PROGRAMMING USING JAVA

Chapter 5:- Multithreading

1. Programming in Java. Second Edition. OXFORD HIGHER EDUCATION. (SACHIN

1. JAVA Complete Reference (9th Edition) Herbalt Schelidt.

JAVA PROGRAMMING LAB

PCS3I103 SYSTEM PROGRAMMING

Module I (12 Hrs)

SYSTEM PROGRAMMING LABORATORY

PCS3I104 SOFTWARE ENGINEERING

Software Process Models:

1. Fundamentals of Software Engineering, Rajib Mall , PHI, 2014.

1. Software Engineering, A Practitioner’s Approach, Roger S. Pressman ,TMG

SOFTWARE ENGINEERING LABORATORY

Experiment1: Develop requirements specification for a given problem(The requirements

Experiment 3: Develop structured design for the DFD model developed

Experiment 5: Develop Sequence Diagrams.

Experiment 6: Develop Class diagrams.

Experiment 8: Use testing tool such as Junit.

Experiment 9: Use a configuration management tool.

PCS3I001 DISCRETE STRUCTURES

6. S. Lipschutz, Discrete Mathematics, Tata McGraw Hill, 2005

PEK3E001 ENGINEERING ECONOMICS

Module I (12 hours)

1. Riggs, Bedworth and Randhwa, “Engineering Economics”, McGraw Hill

7. Macro Economics by S.P.Gupta, TMH

POB3E002 ORGANIZATIONAL BEHAVIOUR

1. To develop an understanding of the behavior of individuals and groups inside

Unit Contents Class

02 Attitude: Importance of attitude in an organization, Right Attitude, 10

Perception: Meaning and concept of perception, Factors influencing

Approach Contingency Leadership Approach, Contemporary leadership,

transformations leadership, Contemporary theories of leadership,

Success stories of today’s Global and Indian leaders.

04 Organizational Culture : Meaning & Definition of Organizational

05 Organizational Change: Meaning, Definition & Nature of 7

PCS3D001 ARTIFICIAL INTELLIGENCE

PCS3G001 SOFTWARE ENGINEERING

Software Process Models:

Software Requirements Engineering: