4.3.

4 SYLLABI OF PROGRAM CORE COURSES : IV SEMESTER

SYLLABI B. TECH. B.Tech. Computer Science & Engineering(Data Science) IV SEM

Course Type Subject L T P Credits TC TM TE PC PES Pre-requisites

Code A S S A
Operating 3 0 2 Design and
CDCSC09 CC 4 15 15 40 15 15
Systems Analysis of
Algorithms
COURSE OUTCOMES
1. Understand the function, structure, history of an operating system and the
design issues associated with an operating system.
2. Understand the concept of multithreading, process management concepts
including scheduling, synchronization and deadlocks.
3. Learn the memory management concepts including virtual memory.
4. Comprehend file system interface and implementation and disk management.
5. Be familiar with protection and security mechanisms.

COURSE CONTENT
Unit 1
Overview: Operating systems – structure, operations, components, types, services,
user interfaces. System calls, system programs, system boot.
Process management: Processes – concept, scheduling, operations on processes,
interprocess communications. IPC Methods, pipes, popen, pclose functions, Co-
Processes, FIFOs, Message Queues, Shared Memory, Stream pipes, Threads – single-
and multi-threaded processes.

Unit 2
CPU scheduling – criteria, algorithms, multiple-processor scheduling.
Process synchronization – critical-section problem, semaphores, classic
synchronization problems, monitors.

Unit 3

Deadlocks – characterization, deadlock prevention, deadlock avoidance, deadlock

detection, prevention, avoidance, recovery from deadlock.

68 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE, NSUT MAIN CAMPUS

 Memory management: Objective and functions, Simple monitor resident program,
overlays- swapping, Main memory – memory allocation schemes, paging,
segmentation. Virtual memory concept– demand paging, page interrupt fault, page
replacement algorithms, segmentation – simple, multilevel, segmentation with
paging, frame allocation, thrashing.

Unit 4
Storage management: File system – files and directories, structure and
implementation of file systems, mounting and unmounting, storage allocation
methods, free-space management. Disk – structure, scheduling, management.

Unit 5
I/o management: i/o hardware, i/o interface, kernel i/o subsystem.
Protection and security: Access matrix, security threats.
Case studies of latest operating systems.

Practical List

Implement these programs in C/C++ using Linux/Unix environment operating system. Maintain hard copy
of the same for final assessment.
1. Process creation and termination for operating system (fork, wait, signal, exit
etc.).
2. Threads.
3. CPU scheduling algorithms: FCFS, SJF, Round Robin, Preemptive Priority
Scheduling.
4. Inter process communication.
5. Critical Section problem.
6. Producer – Consumer problem using bounded and unbounded buffer.
7. Reader Writers problem, Dining Philosophers problem using semaphores.
8. Banker’s algorithm.
9. Page replacement algorithms: LRU, LRU-Approximation, FIFO, Optimal.
10. File operation system calls (open, read, close, append etc.)
11. Disk scheduling algorithms: FCFS, SSTF, SCAN, CSCAN, LOOK, CLOOK.

Text Book:
1. Silberschatz, A., Galvin, P. B., and Gagne, G. 2009. “Operating System
Principles (8th ed.)”, Wiley.
Reference Book:
1. Stallings, W. 2014. “Operating Systems: Internals and Design Principles (8th
ed.)”, Pearson.
2. Tanenbaum, A. S. 2007. “Modern Operating Systems (3rd ed.)”, Pearson.

69 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE, NSUT MAIN CAMPUS

 3. UNIX System Programming Using C++,by Terrence Chan: Prentice Hall India,
1999.
4. Advanced Programming in UNIX Environment, by W. Richard Stevens: 2nd Ed,
Pearson Education, 2005.
5. Operating Systems – William Stallings, Pearson Education Asia (2002)
6. Operating Systems - Nutt, Pearson Education Asia (2003)

B.Tech. Computer Science & Engineering (Data Science) SEMESTER IV

Course No. Type Subject L T P Credits CA MS ES CA ES Pre-requisites

CC Theory of
Automata
3 1 0 Discrete
CDCSC10 & Formal 4 25 25 50
Structures
language
s
COURSE OUTCOMES

1. Students will be able to demonstrate knowledge of basic mathematical models

of computation and relate them to the formal languages.
2. Acquire knowledge of Regular Languages, FA, CFG, Push Down Automata and
Turing recognizable languages
3. Be able to get a broad overview of the theoretical foundations of computer
science
4. Be able to think analytically and intuitively for problem solving situations in
related areas of theory of computer science
5. Students will understand the limitations of computers and learn examples of
unsolvable problems.

COURSE CONTENT
UNIT I
Finite Automata: Deterministic FA, Non deterministic FA, Regular
expressions, Finite Automaton with €- moves, Regular Expression, Regular
Languages and Kleene’s theorem– Conversion of NFA to DFA, Equivalence of
finite Automaton and regular expressions, Arden’s Theorem. Myhill Nerode
Theorem, Minimization of DFA, Pumping Lemma for Regular sets, Problems

70 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE, NSUT MAIN CAMPUS

 based on Pumping Lemma.
UNIT II

Context Free Grammar: Grammar, Types of Grammar, Context Free Grammars

and Languages, Derivations, Ambiguity, Relationship between derivation and
derivation trees, Simplification of CFG, Elimination of Useless symbols - Unit
productions - Null productions, Chomsky normal form (CNF), Greibach Normal
form (GNF), Problems related to CNF and GNF.
UNIT III

Pushdown Automata: Moves, Instantaneous descriptions, Deterministic

pushdown automata, Equivalence of Pushdown automata and CFL, pumping
lemma for CFL, problems based on pumping Lemma.
UNIT IV

Turing Machine: Definitions of Turing machines, Computable languages and

functions, Techniques for Turing machine construction, Multi head and Multi
tape Turing Machines, The Halting problem, Partial Solvability, Problems about
Turing machine- Chomsky hierarchy of languages.

UNIT V

Difficult problems: Unsolvable Problems and Computable Functions, Primitive

recursive functions, Recursive and recursively enumerable languages, Universal
Turing machine, Measuring and classifying complexity - Tractable and Intractable
problems,

SUGGESTED READINGS
1. Hopcroft J.E., Motwani R. and Ullman J.D, “Introduction to Automata Theory,
Languages and Computations”, Second Edition, Pearson Education.
2. John C Martin, “Introduction to Languages and the Theory of Computation”,
Third Edition, Tata McGraw Hill Publishing Company, New Delhi
3. Marvin L. Minsky “Computation: Finite and Infinite” – Prentice Hall, 1967
4. Michael Sipser “Introduction to the Theory of Computation” , Third Edition,
2012 Cengage Learning
5. Peter Lenz – An Introduction to Formal languages and Automata – 3rd Edition
Narosa, 2003
6. Thomas A. Sukamp – An introduction to the theory of computer science
languages and machines – 3rd edition, Pearson Education, 2007.
7. G E Reevsz “Introduction to Formal Languages” TMH, 2000

71 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE, NSUT MAIN CAMPUS

B.Tech. Computer Science & Engineering (Data Science) SEMESTER IV

Course No. Type Subject L T P Credits CA MS ES CA ES Pre-requisites

CC Big Data
Data base
CDCSC11 Analytics 3 0 2 4 15 15 40 15 15 management
system

COURSE OUTCOMES

1. Gain a conceptual understanding of big data analytics concepts, algorithms, data

management tools and statistical analysis.
2. Acquire tools to manage various aspects of big data such as Hadoop, HDFS
3. Get familiar with the Map-Reduce based HBase, Cassandra, Pig, Hive etc.
4. Use the soft computing techniques for analytics
5. Build applications based on big data.
COURSE CONTENT
UNIT I
Introduction to Big Data: Databases and their evolution, convergence of key
trends, unstructured data, industry examples of big data, web analytics, big data
and marketing, fraud and big data, risk and big data, credit risk management, big
data and algorithmic trading, big data and healthcare, big data in medicine,
advertising and big data, big data technologies, introduction to Hadoop, open
source technologies, cloud and big data mobile business intelligence, Crowd
sourcing analytics, inter and trans firewall analytics.
UNIT II

NoSql Data Management: Introduction to NoSQL, Types of NoSQL, aggregate data

models, aggregates, key-value, document data models, relationships, graph
databases, schema less databases, materialized views. Overview of MongoDB.
MapReduce, partitioning and combining, composing map-reduce calculations,
MapReduce examples such as matrix multiplication.
UNIT III

Hadoop: Introduction to Hadoop, Data format, analyzing data with Hadoop, scaling
out, Hadoop streaming, Hadoop pipes, Hadoop distributed file system (HDFS), HDFS
concepts, data flow, Hadoop I/O, data integrity, compression, serialization, Avro
file-based data structures, Map Reduce workflows, unit tests with MRUnit, test data
and local tests – anatomy of Map Reduce job run, classic Map-reduce, YARN, failures
in classic Map-reduce and YARN, job scheduling, shuffle and sort, task execution,

72 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE, NSUT MAIN CAMPUS

MapReduce types, input formats, output formats.
UNIT IV

Hadoop Related Tools: Hbase, data model and implementations, Hbaseclients, Hbase
examples – praxis. Cassandra, Cassandra data model, Cassandra examples, Cassandra
clients, Hadoop integration. Pig, Grunt, pig data model, Pig Latin, developing and
testing Pig Latin scripts. Hive, data types and file formats, HiveQL data definition,
HiveQL data manipulation – HiveQL queries, Overview of spark.

UNIT V
Data Analysis: Overview of R programming language, Regression Modelling,
Multivariate Analysis, Bayesian Modeling, Inference and Bayesian Networks, Support
Vector and Kernel Methods, Analysis of Time Series, Linear Systems Analysis,
Nonlinear Dynamics, Rule Induction, Neural Networks, Learning And Generalization,
Competitive Learning, Principal Component Analysis and Neural Networks, Fuzzy
Logic: Extracting Fuzzy Models from Data, Fuzzy Decision Trees, Stochastic Search
Methods. Emerging Trends.

List of Practicals:
1. Installation of VMWare to setup the Hadoop environment and its ecosystems.
2. Perform setting up and Installing Hadoop in its three operating modes. –
Standalone, Pseudo distributed and Fully distributed.
3. Implement the following file management tasks in Hadoop by: Adding files
and directories , Retrieving files and Deleting files.
4. Run a basic word count Map Reduce program to understand Map Reduce.
5. Write a Map Reduce program that mines Weather data or Financial data or
any other domain data.
6. Implement matrix multiplication with Hadoop Map Reduce.
7. Install PIG. Write Pig Latin scripts sort, group, join, project, and filter your
data. Run the Pig Latin Scripts to find Word Count.
8. Install HIVE. Use Hive to create, alter, and drop databases, tables, views,
functions, and indexes.
9. Install MongoDB. Create database in MongoDB.
10. Write R programs for various functions of Array, Matrix and Factor.
11. Analyze online retail data using Hadoop Ecosystem.
12. Implement Store Sales Prediction Using Spark.
13. Implement Healthcare Data Analytics or any other domain analytics.
14. Project: Implement Financial Data Analytics or any other domain.
15. Implement and run clustering and classification in Spark with Spark MLlib.

73 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE, NSUT MAIN CAMPUS

SUGGESTED READINGS

1. Michael Minelli, Michelle Chambers, and AmbigaDhiraj, "Big Data, Big Analytics,
“Emerging Business Intelligence and Analytic Trends for Today's Businesses",
Wiley.
2. Big-Data Black Book, DT Editorial Services, Wiley India
3. Massive Online Open Courses (MOOCS): Big Data University, Udacity and Coursera
4. P. J. Sadalage and M. Fowler, "NoSQL Distilled: A Brief Guide to the Emerging World
of Polyglot Persistence", Addison-Wesley Professional, 2012.
5. Tom White, "Hadoop: The Definitive Guide", Third Edition, O'Reilley, 2012.
6. Eric Sammer, "Hadoop Operations", O'Reilley, 2012.
7. E. Capriolo, D. Wampler, and J. Rutherglen, "Programming Hive", O'Reilley, 2012.
8. Lars George, "HBase: The Definitive Guide", O'Reilley, 2011. 8. Eben Hewitt, "Cassandra: The
Definitive Guide", O'Reilley, 2010. 9. Alan Gates, "Programming Pig", O'Reilley, 2011

Course Type Subject L T P Credits CA MS ES CA ES Pre-

Code requisites
Data 3 0 2 None
CDECC12 CC 4 15 15 40 15 15
Commun
ication
COURSE OUTCOMES
1. To introduce students about different digital modulation schemes.
2. To introduce the students the functions of different layers of
networking.
3. To introduce various types of access control methods.
4. To make students to get familiarized with different protocols and
network components.
5. To introduce the students about basic queuing models
COURSE CONTENT
UNIT-I

Digital Communication: Sampling theorem (Instantaneous Sampling, Natural Sampling and

Flat Top Sampling), PAM, PPM, PWM, Quantization noise, PCM, Binary Modulation: ASK,
PSK, FSK, MSK, DPSK, QPSK and their probability of error calculation.

UNIT-II

Data Communications: Review of Error Detection and Correction codes. Need of line coding,
Line coding scheme: Unipolar, Polar, Bipolar and Multilevel Encoding, Network and Protocol
Architecture, Reference Model ISO-OSI, TCP/IP-Overview, topology, DTE-DCE interface,
interface standards, modems, cable modem, transmission media. Switching: Circuit switching

74 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE, NSUT MAIN CAMPUS

 (space-division, time division and space-time division), packet switching (virtual circuit and
Datagram approach), message switching,

UNIT-III

Data Link Layer: Data Link Control and Protocols: Flow and Error Control, Stop-and-wait
ARQ. Sliding window protocol, Go-Back-N ARQ, Selective Repeat ARQ, HDLC, Point-to –
Point Access: PPP Point –to- Point Protocol, PPP Stack, IEEE standard 802.3 & 802.11 for
LANS, high speed LANs, Token ring, Token Bus, FDDI based LAN, Network Devices-
repeaters, hubs, switches bridges.

UNIT-IV

Medium Access Sub layer: Channel allocation problem, multiple access protocols (ALOHA,
CSMA and CSMA/CD)

Network Layer: Design issues, Routing algorithms, Congestion control algorithms,

Host to Host Delivery: Internetworking
UNIT-V

Queuing Theory: Finite Markov Chain –Discrete and continuous time Markov
chains, Classification of states, Limiting distribution, Birth and death process,
Poisson process, Steady state and transient distributions, Simple Markovian
queuing models (M/M/1, M/M/1/N).

List of Experiments
1. Introduction to MATLAB
a. Matrix computation.
b. To Plot Sine Wave of frequency 200 Hz.
c. To plot a pulse of width 10.
d. Plot the spectrum (Amplitude and phase) 0f the pulse generated in 3.
2. Uniform random number and plot its density function. Find its mean and
variance.
3. Generate Gaussian distributed random number and plot its density function.
Find its mean and variance.
4. Compute the Signal to quantization Noise ratio of Uniform Quantization. Plot
SNQR versus Quantization levels.
5. Compute the Signal to quantization Noise ratio of Non-Uniform Quantization.
Plot SNQR versus Quantization levels.
6. Study of passband digital communication technique BPSK. Calculate the BER
of BPSK modulated signal.
7. Given is a linear block code with the generator matrix G
1100101
a. G = 0 1111001110011
a. Calculate the number of valid code words N and the code rate RC. Specify
the complete Code set C.
b. Determine the generator matrix G′ of the appropriate systematic (separable)

75 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE, NSUT MAIN CAMPUS

 code C’.
c. Determine the syndrome table for single error.
8. To generate a M/M/1 Queue having infinite buffer space with parameters (λ, μ)
and plot the average delay per packet vs λ/μ.
9. To generate a M/M/1 Queue having finite buffer space with parameters (λ, μ)
and plot blocking probability with respect to variation with buffer space.
10. To simulate STOP and WAIT protocol using M/M/1 queuing system and
plot average delay per packet vs λ/μ.
11. To simulate SLIDING WINDOW protocol and evaluate its performance
with variation of window size.
12. Observe and measure the performance of TOKEN BUS MAC Layer
protocols by changing the network load, distance between the nodes.
13. Observe and measure the performance of ALOHA protocol by changing
the network load, distance between the nodes.
14. Observe and measure the performance of CSMA protocols by changing
the network load, distance between the nodes.
15. Observe and measure the performance of CSMA/CD protocols by
changing the network load, distance between the nodes.

Text Book:

1. A. S. Tannenbum, D. Wetherall, “Computer Networks”, Prentice Hall, Pearson, 5 th

Ed [T2] Behrouz A. Forouzan, “Data Communications and Networking”, Tata McGraw-
Hill, 4th Ed

Reference:

1. Fred Halsall, “Computer Networks”, Addison – Wesley Pub. Co. 1996.

2. Larry L, Peterson and Bruce S. Davie, “Computer Networks: A system Approach”, Elsevier,
4 th Ed
3. Tomasi, “Introduction To Data Communications & Networking”, Pearson 7th impression
2011
4. William Stallings, “Data and Computer Communications”, Prentice Hall, Imprint of
Pearson, 9 th Ed.
5. Zheng , “Network for Computer Scientists & Engineers”, Oxford University Press
6. Data Communications and Networking: White, Cengage Learning

76 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE, NSUT MAIN CAMPUS

Course No. Title of the Course Pre-Requisite
Course Structure

CAMTC13 Probability and 3L-1T-0P None

Stochastic
Processes

COURSE OUTCOMES (CO)

1. To understand the detailed concept of probability and applications.
2. To know about Continuous Frequency distribution.
3. To know about MGF and Method of Least square.
4. To understand the concept of large samples.
5. To understand sampling theory for small samples and inference.
COURSE CONTENT:

UNIT-1

Probability: Mathematical and Statistical definitions and problems, Marginal

probability, Random variables, discrete and continuous random variables, Mathematical
Expectation, Moments, Central moments, Kurtosis.

UNIT-2

Important Theoretical Distributions: Review of continuous and discrete probability

distributions, Negative binomial distribution, Fitting of standard distributions, Fitting of
Normal distribution by method of areas and method of ordinates, Hypergeometric
distributions, Multinomial distribution, Rectangular distribution, Beta distribution of
first and second kind, Gamma distribution, Cauchy’s distribution, Geometrical
probability, Tchebycheff's and Markov's inequalities.

UNIT-3

MGF and Method of Least Square: Change of origin and scale in MGF, moment
generating functions of standard distributions (Poisson, Binomial, Exponential, Uniform,
Normal, Gamma, chi square), Cumulants, characteristic function, Weak law of large
numbers, Central limit theorem. Method of least squares: Fitting of straight lines,
parabola and exponential curves.

UNIT-4

Simple sampling of attributes: Large samples, mean and S. D. in simple sampling of

attributes, Test of significance for large samples, Standard error, Type I and II errors,

77 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE, NSUT MAIN CAMPUS

Null hypothesis, Confidence limits, Chi-square distribution, Degree of freedom, Level of
significance, Test of goodness of fit, Test of independence, Coefficient of contingency,
Yate's correction for continuity.

UNIT-5

Sampling of variables and Inference: Small samples, t-distribution, test of significance of

the mean of random sample from normal population, F-distribution, Relationship
between t, F and chi square distributions, Inference: Point estimation, interval
estimation, properties of good estimator, Maximum likelihood parameter.
Recommended Books:
1. An Introduction to Probability Theory and Its Applications, Vol. 1
(Wiley Series in Probability and Statistics) by W. Feller, 1968
2. Advanced Engineering Mathematics by Erwin Kreyszig (Wiley Publication), 2020
3. Probability & Statistics- SOS by Spiegel, McGraw Hill, 2010
4. Probability and Statistics for Engineers by Anthony J. Hayter (Cengage Learning), 2013
5. Mathematical Statistics, Krishna Prakashan Media by J. K. Goyal and J. N. Sharma, 2014

78 | SCHEME OF COURSES AND EXAMINATION: B.Tech. CSE, NSUT MAIN CAMPUS