B.

Tech (Computer Science and Engineering) Syllabus for Admission Batch 2015-16 4th Semester
Fourth Semester
Theory Practical
Code Course Name Hours/ Credit University Internal Hours/ Credit Marks
week Theory Marks Evaluation Week 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
HS Engineering Economics/ 2-1 3 100 50
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
 B.Tech (Computer Science and Engineering) Syllabus for Admission Batch 2015-16 4th Semester
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
B.Tech (Computer Science and Engineering) Syllabus for Admission Batch 2015-16 4th Semester
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
B.Tech (Computer Science and Engineering) Syllabus for Admission Batch 2015-16 4th Semester
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
B.Tech (Computer Science and Engineering) Syllabus for Admission Batch 2015-16 4th Semester
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
B.Tech (Computer Science and Engineering) Syllabus for Admission Batch 2015-16 4th Semester
PCS4I104 FORMAL LANGUAGE AND AUTOMATA THEORY
Module – I (10 Hrs)
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.

Module – II (10 Hrs)

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.

Module – III (12 Hrs)

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
B.Tech (Computer Science and Engineering) Syllabus for Admission Batch 2015-16 4th Semester
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
B.Tech (Computer Science and Engineering) Syllabus for Admission Batch 2015-16 4th Semester
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
B.Tech (Computer Science and Engineering) Syllabus for Admission Batch 2015-16 4th Semester
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
B.Tech (Computer Science and Engineering) Syllabus for Admission Batch 2015-16 4th Semester
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
B.Tech (Computer Science and Engineering) Syllabus for Admission Batch 2015-16 4th Semester
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
B.Tech (Computer Science and Engineering) Syllabus for Admission Batch 2015-16 4th Semester
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