Semester Vi Syllabus

ACADEMIC YEAR 2021-22
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

COURSE DETAILS FOR SEMESTER-VI (REGULATION-2018)
SEMESTER VI
Sl.N Contact
Code No. Category Course Title L T P C
o. Periods
THEORY
1 Compiler Design 3 3 0 0 3
U18PCCS601 PC
2 Object Oriented Software
U18PCCS602 PC Engineering 3 3 0 0 3
3 Programme Elective-II 3
U18PECS6E2 PE
3 0 0 3
4 Programme Elective-III 3
U18PECS6E3 PE
3 0 0 3
5 Open Elective-I 3
U18OECS6E1 OE
3 0 0 3
PRACTICAL
6 Compiler Design Laboratory 3
U18PCCS6L1 PC
0 0 3 1.5
7 Object Oriented Software
U18PCCS6L2 PC Engineering Laboratory 3
0 0 3 1.5
8 Term Paper 3
U18PRCS6P1 EE
0 0 3 1
9
Soft Skill 2
U18EECS6S2 EE
0 0 2 1
ACTIVITY BASED COURSES
10 Social Services – Social
U18MCAB609 MC Awareness 2 0 0 2 0
11
U18MCAB610 MC Social Services - NSS 0 0 2 0
2
Total 30 17 0 15 20
BIST-CSE SYLLABUS (SEM-VI) R-2018
LIST OF ELECTIVES FOR THE SEMESTER-VI

PROGRAMME ELECTIVE –II (Semester VI)
Sl. Code No. Specialization Course Title Contact L T P C
No. Periods
1 U18PECS021 Artificial Neural Networks 3 3 0 0 3
3 Intelligence
U18PECS022 Software and Application 3 3 0 0 3
2 Cyber Security
Security
3 U18PECS023 Data Science Machine Learning 3 3 0 0 3
U18PECS024 Pattern Recognition and 3 3 0 0 3
4 Computer Vision
Soft computing
U18PECS025 High Performance High performance 3 3 0 0 3
5
Computing Computer Architecture
U18PECS026 Digital Software Process and 3 3 0 0 3
6 Transformation Project Management
Engineering
PROGRAMME ELECTIVE –III (Semester VI)

Sl. Code No. Specialization Course Title Contact L T P C
No. Periods
1 U18PECS031 Artificial Case based Reasoning 3 3 0 0 3
3 Intelligence
2 U18PECS032 Cyber Security Cyber Forensics 3 3 0 0 3
3 U18PECS033 Data Science Data Analytics 3 3 0 0 3
4 U18PECS034 Computer Vision Augmented Reality 3 3 0 0 3
U18PECS035 High Parallel and Distributed 3 3 0 0 3
5 Performance Computing
Computing
U18PECS036 Digital Software Architecture 3 3 0 0 3
6 Transformation Design
Engineering
LIST OF OPEN ELECTIVES COMMON TO ALL B.Tech PROGRAMMES

ALL THE COURSES WITH L=3, T=0, P=0 & C=3
1. U18OEBA001 Sociology
2. U18OEBA002-Lean Six Sigma
3. U18OEBA003-Cyber Law and Ethics
4. U18OEBA004-Economic Policies in India
5. U18OEBA005-Management Information System
6. U18OEBA006-Total Engineering Quality Management
7. U18OEBA007-Industrial Psychology
8. U18OEBA008-Entrepreneurship Development and IPR
9. U18OEBA009-Intellectual Property Rights
10. U18OEBA010-Engineering Economics and Cost Analysis
11. U18OEEN001- Soft Skills and Interpersonal Communication
12. U18OEEN002-Indian Writing in English
13. U18OEEN003-Creative Writing
14. U18OEEN004- Proficiency in English and Accent Training
15. U18OEMA001-Cryptography
16. U18OEMA002-Finite Automata Theory / Formal Languages
17. U18OEMA003-Linear Programming
18. U18OECE001 - Metro Systems and Engineering
19. U18OECE002-Pollution Regulations
20. U18OECE003-Road Safety
21. U18OECE004- Infrastructure Development
22. U18OECE005- Project Safety Management
23. U18OECE006- Environment, Health and Safety in Industries
24. U18OEME001-Design for Manufacturing and Assembly
25. U18OEME002Industrial Safety
26. U18OEME003-Refrigeration and Cryogenics
27. U18OEME004- Product Design and Development
28. U18OEAU001-Electric and Hybrid Vehicles
29. U18OEAU002-Intelligent Transportation System
30. U18OEAU003-Vibration and Noise Control
31. U18OEAU004-Automotive Sensors and Applications
32. U18OEMT001-MEMS and Nano Technology
33. U18OEMT002-Non-Destructive Testing
34. U18OEMT003-Bio Mechatronics
35. U18OEMT004-Artificial Intelligence for Robotics
36. U18OEAE001-Industrial Aerodynamics
37. U18OEAE002- Elements of Aeronautics and Astronautics
38. U18OEAE003- Unmanned Aerial Vehicle
39. U18OEAE004- Introduction to Avionics
40. U18OEAE005-Rocket Propulsion
41. U18OEEE001-Green Technologies
42. U18OEEE002-Electrical Safety and Quality Assurance
43. U18OEEE003-Energy Conservation Techniques
44. U18OEEE004-PLC and SCADA for Industrial
45. U18OEEC-001-Communication Systems

46. U18OEEC-002-VLSI circuits
47. U18OEEC-003-Image Processing Techniques
48. U18OEEC-004-Communication Networks
49. U18OEEC-005-An Introduction to DSP
50. U18OEEC-006-Basics of IoT
51. U18OEBM001-Medical Radiation Safety Engineering
52. U18OEBM002-Medical Waste Management
53. U18OEBM003-Quality Control in Healthcare
54. U18OEBM004-Wearable Technology
55. U18OEEI001-Analytical Methods and Instrumentation
56. U18OEEI002-Introduction to process Data Analytics
57. U18OEEI003-Reliability and Safety in Process industries
58. U18OEEI004-Multi sensor data fusion
59. U18OEBT001- Bioprocess Economics & Plant Design
60. U18OEBT002-Brewing technology
61. U18OEBT003-Biomining
62. U18OEBT004-Industrial Safety Engineering
63. U18OEAC001-Geoinformatics for Precision Farming
64. U18OEAC002-Livestock and poultry management
65. U18OEAC003-Extension methodologies and transfer of Agricultural Technologies
66. U18OEAC004-Soil and Water Conservation Engineering
67. U18OEIT001-BlockChain Technology
68. U18OEIT002-Semantic Web
69. U18OEIT003-Entrepreneurship Development
70. U18OEIT004-Ethical Hacking Techniques
71. U18OECS001-Mobile Application Development
72. U18OECS002-System Modelling and Simulation
73. U18OECS003-Web Programming
74. U18OECS004-Virtual Reality
75. U18OECS005- E-Commerce
76. U18OEGE001-Metagenomics and Epigenomics
77. U18OEGE002-Molecular Genetics and Genomics
78. U18OEGE003-Principles of Molecular cell biology
U18PCCS601 COMPILER DESIGN L T P C

Total Contact Hours - 45 3 0 0 3
Prerequisite –Data Structures, Discrete Mathematics
Course Designed by – Dept. of Computer Science and Engineering.
OBJECTIVES
The objective of this to learn the design of compiler Design, the various parsing techniques,
how to optimize and effectively generate machine codes
UNIT I OVERVIEW OF COMPILATION AND SYNTAX ANALYSIS 9

The structure of a compiler and applications of compiler technology; Lexical analysis - The role
of a lexical analyzer, specification of tokens, recognition of tokens, hand-written lexical
analyzers, LEX, examples of LEX programs. Introduction to syntax analysis -Role of a parser,
use of context-free grammars (CFG) in the specification of the syntax of programming
languages, techniques for writing grammars for programming languages (removal left recursion,
etc.), non- context-free constructs in programming languages, parse trees and ambiguity,
examples of programming language grammars.
UNIT II PARSING 9
Top-down parsing- FIRST & FOLLOW sets, LL(1) conditions, predictive parsing,
recursive descent parsing, error recovery. LR-parsing - Handle pruning, shift-reduce parsing,
viable prefixes, valid items, LR(0) automaton, LR-parsing algorithm, SLR(1), LR(1), and
LALR(1) parsing. YACC, error recovery with YACC and examples of YACC specifications.
Syntax-directed definitions (attribute grammars)-Synthesized and inherited attributes, examples
of SDDs, evaluation orders for attributes of an SDD, dependency graphs. S-attributed and L-
attributed SDDs and their implementation using LR-parsers and recursive- descent parsers
respectively.
UNIT III SEMANTIC ANALYSIS 9

Semantic analysis- Symbol tables and their data structures. Representation of“scope”. Semantic
analysis of expressions, assignment, and control-flow statements, declarations of variables and
functions, function calls, etc., using S- and L-attributed SDDs (treatment of arrays and structures
included). Semantic error recovery.
UNIT IV INTERMEDIATE CODE GENERATION 9

Intermediate code generation - Different intermediate representations –quadruples, triples, trees,
flow graphs, SSA forms, and their uses. Translation of expressions (including array references
with subscripts) and assignment statements. Translation of control-flow statements – it- then-
else, while-do, and switch. Short-circuit code and control-flow translation of Boolean
expressions. Back patching. Examples to illustrate intermediate code generation for all
constructs.
UNIT V RUN-TIME ENVIRONMENTS 9

Run-time environments:- Stack allocation of space and activation records. Access to non-local
data on the stack in the case of procedures with and without nesting of procedures. Introduction
to machine code generation and optimization- Simple machine code generation, examples of
machine-independent code optimizations.
TEXT BOOKS:
1. Compilers: Principles, Techniques, and Tools , by A.V. Aho, Monica Lam, Ravi Sethi, and
J.D. Ullman,(2nd ed.), Addison-Wesley, 2007 (main text book, referred to as ALSU in lab
assignments).
2. K.D. Cooper, and Linda Torczon, Engineering a Compiler, Morgan Kaufmann, 2011
REFERENCE BOOKS:
1. K.C. louden, compiler construction: principles and practice, cengage learning,1997
2.D. Brown, J. Levine, and T. Mason, LEX and YACC, O‟Reilly Media,1992
3.http://hjemmesider.diku.dk/~torbenm/Basics/basics_lulu2.pdf
4.http://ecomputernotes.com/compiler-design
COURSE OUTCOMES (COs)

CO1 Explain the phases of a Compiler
CO2 Illustrate the translation of regular expression into parse tree using
syntax analyzer.
Construct the intermediate representation considering the type systems
CO3
Apply the optimization techniques for the generated code
CO4
CO5 Use the different compiler construction tools to develop a simple compiler
CO6 To create Compiler using Lex and YACC tools.
Mapping of Course Outcomes with PROGRAMME OUTCOMES(POs)
(H/M/L indicates strength of correlation) H-High, M-Medium, L-Low
Programme Outcomes(POs)
COs
a b c d e f g h i j k l
H H
CO1 H M M
CO2 H H H M M
CO3 H H H M M
CO4 H H H M M
CO5 H H H M M
CO6 H H H M M
Category Professional Course (PC)
Approval 47th Academic Council Meeting held in Aug, 2018
U18PCCS602 OBJECT ORIENTED SOFTWARE L T P C

ENGINEERING
Total Contact Hours - 45 3 0 0 3
Prerequisite – Analysis of Algorithms, Discrete Mathematics
Course Designed by – Dept. of Computer Science and Engineering.
OBJECTIVES
The objective of this course is to learn the basic of object oriented analysis and design skills,
UML design diagrams and various testing techniques.
UNIT I OBJECT ORIENTED METHODOLOGIES 9

Introduction to System Concepts - Managing Complex Software –– Properties – Object Oriented
Systems Development – Object Basics – Systems Development Life Cycle - Rumbaugh
Methodology - Booch Methodology - Jacobson Methodology – Unified Process.
UNIT II UML 9
Unified Approach – Unified Modeling Language – Static behavior diagrams – Dynamic behavior
diagrams – Object Constraint Language.
UNIT III DESIGN CONCEPTS 9

Inception – Evolutionary Requirements – Domain Models – Operation Contracts - Requirements
to Design – Design Axioms – Logical Architecture - Designing Objects with Responsibilities –
Object Design – Designing for Visibility.
UNIT IV DESIGN PATTERNS 9

Patterns – Analysis and Design patterns – GoF Patterns - Mapping designs to code – Test Driven
development and refactoring – UML Tools and UML as blueprint.
UNIT V ARCHITECTURE ANALYSIS 9

More Patterns – Applying design patterns – Architectural Analysis – Logical Architecture
Refinement – Package Design – Persistence framework with patterns.
TEXT BOOKS
1. Booch, Grady. Object Oriented Analysis and Design. 2nd edition, Pearson Education.
2006.
2. Ali Bahrami, “ Object Oriented Systems Development”, Tata McGraw Hill, 2008.
REFERENCES
1. Craig Larman. “Applying UML and Patterns – An introduction to Object-Oriented
Analysis and Design and Iterative Development”, 3rd ed, Pearson Education, 2005.
2. Fowler, Martin. UML Distilled. 3rd edition. Pearson Education. 2004.
3. Michael Blaha and James Rumbaugh, “Object-oriented modeling and design with
UML”, Prentice-Hall of India, 2005.
4. 4.
5. https://www.cs.ucsb.edu/~mikec/cs48/project/ProcessLarman.pdf

CO1 Design and implement projects using OO concepts
CO2 Use the UML analysis and design diagrams
Apply appropriate design patterns.
CO3
Create code from design.
CO4
CO5 Compare and contrast various testing techniques.
CO6 To Applying design patterns.
COs
CO1 M H H H M M
CO2 M H H H M M
CO3 M H H H M M
CO4 M H H H M M
CO5 M H H H M M
CO6 M H H H M M
U18PCCS6L1 COMPILER DESIGN LABORATORY L T P C

Total Contact Hours - 45 0 0 3 1.5
Prerequisite – Compiler Design, C Programming
Lab Manual Designed by – Dept. of Computer Science and Engineering.
OBJECTIVES
This laboratory course is intended to make the students experiment on the basic techniques of
compiler construction and tools that can used to perform syntax-directed translation of a high-level
programming language into an executable code. Students will design and implement language
processors in C by using tools to automate parts of the implementation process. This will provide
deeper insights into the more advanced semantics aspects of programming languages, code
generation, machine independent optimizations, dynamic memory allocation, and object
orientation.
List of Experiments:
1. Design a lexical analyzer for given language and the lexical analyzer should ignore
redundant spaces, tabs and new lines. It should also ignore comments. Although the
syntax specification states that identifiers can be arbitrarily long, you may restrict the
length to some reasonable value. Simulate the same in C language.
2. Write a C program to identify whether a given line is a comment or not.
3. Write a C program to recognize strings under 'a', 'a*b+', 'abb'.
4. Write a C program to test whether a given identifier is valid or not.
5. Write a C program to simulate lexical analyzer for validating operators.
6. Implement the lexical analyzer using JLex, flex or other lexical analyzer generating tools
7. Write a C program for implementing the functionalities of predictive parser for the mini
language specified in Note 1.
8. a) Write a C program for constructing of LL (1) parsing.
b) Write a C program for constructing recursive descent parsing
9. Write a C program to implement LALR parsing
10. a) Write a C program to implement operator precedence parsing.
b)Write a C program to implement Program semantic rules to calculate the expression
that takes an expression with digits, + and * and computes the value
11.Convert the BNF rules into Yacc form and write code to generate abstract syntax tree
for the mini language specified in Note 1.
12. Write a C program to generate machine code from abstract syntax tree generated by
the parser. The instruction set specified in Note 2 may be considered as the target code.

CO1 To Understand the working of lex and yacc compiler for debugging of
programs.
CO2 To Understand and define the role of lexical analyzer, use of regular expression
and transition diagrams.
CO3 To Understand and use Context free grammar, and parse tree construction.
CO3
To Learn & use the new tools and technologies used for designing a compiler.
CO4
CO5 To Develop program for solving parser problems.

CO6 To generate machine code from abstract syntax tree generated by the parser.

COs
CO1 H H H M M
CO2 H H H M M
CO3 H H H M M
CO4 H H H M M
CO5 H H H M M
CO6 H H H M M
OOSE LABORATOTY
U18PCCS6L2 OBJECT ORIENTED SOFTWARE L T P C
ENGINEERING LABORATORY
Total Contact Hours - 45 0 0 3 1.5
Prerequisite – Software Engineering
Lab Manual Designed by – Dept. of Computer Science and Engineering.
OBJECTIVES
This laboratory course is intended to make the students know about basic concepts of Object
Oriented Analysis and Design.
LIST OF EXPERIMENTS:
1. Passport automation system.
2.Book bank
3.Exam Registration
4.Stock maintenance system.
5.Online course reservation system
6.E-ticketing
7.Software personnel management system
8.Credit card processing
9.E-book management system
10.Recruitment system
11. Foreign trading system
12.Conferencemanagement System
13. BPO management System
14. Library management system
15. Student information system

CO1 To capture the requirements specification for an intended software system
CO2 To draw the UML diagrams for the given specification
To Apply the design pattern properly in .
CO3
To test the software system thoroughly for all scenarios.
CO4
CO5 To improve the design by applying appropriate design patterns.
CO6 To analyze the concept of patterns for constructing software architectures.
COs
CO1 M H H H M M
CO2 M H H H M M
CO3 M H H H M M
CO4 M H H H M M
CO5 M H H H M M
CO6 M H H H M M
MACHINE LEARNING L T P C
U18PECS023 Total Contact Periods – 45 3 0 0 3
Prerequisite – Data structures and Algorithms
Course Designed by – Department of Computer Science & Engineering
OBJECTIVES  Ability to comprehend the concept of supervised and unsupervised learning
techniques.
 Differentiate regression, classification and clustering techniques and to implement
their algorithms.
 To analyze the performance of various machine learning techniques and to
selectappropriate features for training machine learning algorithms.
Unit 1- INTRODUCTION
Machine learning: What and why? Types of Machine Learning - Supervised Learning - Unsupervised
Learning - reinforcement - The Curse of dimensionality - Over fitting and linear regression Bias and
Variance. Learning Curve - Classification. Error and noise Parametric vs. non-parametric models-Linear
models
Unit 2 - CLUSTERING APPROACHES
Measuring (dis)similarity - Evaluating the output of clustering method - Hierarchical clustering -

Agglomerative clustering - Divisive clustering - Choosing the number of clusters - Clustering datapoints
and features. Bi-clustering. Multi-view clustering. K-Means clustering K-medoids clustering - Ensemble
methods: bagging and boosting
Unit 3 - NEURAL NETWORKS
Biological motivation for Neural Network - Neural network Representation Perceptrons- Feed forward
networks. - Multilayer Networks and Back Propagation Algorithms - Convergence and local minima and
Hidden layer representation in back propagation - Recurrent networks Application of neural network.
Unit 4 - LINEAR MODELS
Logistic Regression - Maximum Likelihood estimation (least squares)- Robust linear regression - Ridge
Regression - Principal Component Analysis - Bayesian Classifier - Support Vector Machines
Unit 5 - TREE LEARNING
Directed and Undirected trees - Decision tree representation - Basic decision tree learning algorithm -
Inductive bias in decision tree - Issues in decision tree Classification and regression trees (CART) -
Random forest.

CO1 Understand the concepts of machine learning
CO2 . Understand the clustering techniques and their utilization in machine learning
CO 3 Provide solution for classification and regression approaches in real-world applications.
CO 4 Study the neural network systems for machine learning
CO 5 Learn and understand the linear learning models in machine learning
CO 6 Study the tree based machine learning techniques and to appreciate their capability
TEXT BOOKS
1. Kevin P. Murphy, “Machine Learning: A Probabilistic Perspective”, MIT Press, 2012
2. Ethem Alpaydin, “Introduction to Machine Learning”, Prentice Hall of India, 2005
3. Tom Mitchell, "Machine Learning", McGraw-Hill, 1997.
4. Laurene Fausett, "Fundamentals of Neural Networks, Architectures, Algorithms and Applications”,

Pearson Education, 2008
REFERENCE BOOKS/OTHER READING MATERIAL
1. Hastie, Tibshirani, Friedman, “The Elements of Statistical Learning” (2nd ed)., Springer, 2008
2. Stephen Marsland, “Machine Learning –An Algorithmic Perspective”, CRC Press, 2009
3. Christopher Bishop, “Pattern Recognition and Machine Learning” Springer, 2006

U18PECS035 PARALLEL AND DISTRIBUTED COMPUTING L T P C

Total Contact Hours: 45 3 0 0 3
Prerequisite: – Computer Science Fundamentals
Course Designed by :Dept of computer science and Engineering
OBJECTIVES
 Principles of distributed simulation and applications using multiprocessor systems.
 Synchronization and time management for distributed environments.
 High-level architecture for distributed simulation.
UNIT I INTRODUCTION TO DISCRETE EVENT STIMULATION 9

Introduction - Why simulation -Why parallel and distributed simulation -Analytic simulation vs
virtual environment - Typical applications - Basic concepts: system attribute, state variables,
event list, simulation time - Basic mechanisms: time advance, event scheduling, inherent
parallelism - Modeling issues and logical processes - Data model, probability distributions,
statistics collection
UNIT II PARALLEL PROCESSING OVERVIEW 9

Brief introduction to parallel processing – Overview of cluster computing with MPI–
Underlying technologies - Concurrent simulation processes
UNI III CONSERVATIVE SYNCHRONIZATION ALGORITHM9

Synchronization problem - Deadlock avoidance using null messages - Lookahead and the
simulation model - Deadlock detection and recovery - Synchronous execution - Barriers
Synchronization, Transient Messages, Time Distance between Logical Processes - Performance
Issues - Pros and cons of conservative mechanism
UNIT IV DISTRIBUTED TRANSACTION PROCESSING 9

Transactions – Nested Transactions – Locks – Optimistic Concurrency Control – Timestamp
Ordering – Comparison – Flat and Nested Distributed Transactions – Atomic Commit Protocols
– Concurrency Control in Distributed Transactions – Distributed Deadlocks – Transaction
Recovery – Overview of Replication And Distributed Multimedia Systems.
UNIT V HYBRID PROTOCOLS, DISTRIBUTED COMPUTING STANDARDS 9

Moving time windows – Space time simulation - Breathing time buckets - Local time warp -
Distributed virtual environment – High level architecture, HLA - Overview, Rules, Object
Model, Run-Time Infrastructure, Communication Issues
TEXT BOOKS:
1. Ruchard, M.Fujitmoto,”Parallel and Distributed Simulation Systems 1st Edition”, Wiley-
Interscience (2000).
2. Brendan Burns,” Designing Distributed Systems”,'Reilly Media; 1st Edition (March 5,
2018)
REFERENCES:
1. Martin Kleppmann,“Designing Data-Intensive Applications”, 'Reilly Media; 1st Edition (April

11, 2017).
2. Maarten Van steen, Andrew S Tanenbaum, “Distributed Systems”, CreateSpace Independent

Publishing Platform; 3.01 Edition (February 1, 2017).
3. Andrew S. Tanenbaum, Maartenvan Steen, Distributed Systems, “Principles and Pardigms”,

Pearson Education, 2002.
CO1 Explain why distributed simulation is needed.
CO2 Understand the main differences between two synchronization methods
CO3 Describe how the conservative method works
CO4 Describe how the optimistic method works
CO5 Understand hybrid approaches for distributed simulation..
CO6 Describe the HLA standard overview for simulation.
Mapping of Course Outcomes with Program outcomes (POs)
1 COs/POs M H H H
2 CO1 H M H M M
CO2 L M H M M
CO3 L M
CO4 M H M H
CO5 M M H H
CO6 M H H H
3 Category
Internship (PR)
Engg Sciences
Basic Sciences
Core Elective
Social Studies
Open Elective
Humanities &
Elective (NE)
&Maths (BS)
Project/Term
Professional
Non-Major
Core (PC)
Seminar/
Paper/
(OE)
(CE)
(ES)
√
Image Processing Techniques L T P C

Total Contact Hours – 45 3 0 0 3
U18OEEC003 Prerequisite – Fourier Transform and Complex Variables or equivalent
Course Designed by – Dept. of Electronics And Communication
Engineering.
OBJECTIVES
 To study the image fundamentals and mathematical transforms necessary for image
processing.
 To study the image enhancement techniques
 To study image restoration procedures.
 To study the image compression procedures.
CO1 Review the fundamental concepts of a digital image processing system
CO2 Analyze images in the frequency domain using various transforms
CO3 Evaluate the techniques for image enhancement and image restoration
CO4 Categorize various compression techniques.
CO5 Interpret Image compression standards
CO6 Interpret image segmentation and representation techniques.
UNIT I DIGITAL IMAGE FUNDAMENTAL 9

Elements of digital image processing systems, Elements of Visual perception, Image sampling
and quantization, Matrix and Singular Value representation of discrete images.
UNIT II IMAGE TRANSFORMS 9

1D DFT, 2D DFT, Cosine, Sine Hadamard, Hear, Slant, KL, SVD transform and their
properties.
UNIT III IMAGE ENHANCEMENT 9

Histogram – Modification and specification techniques Image smoothing, Image sharpening,
generation of spatial masks from frequency domain specification, Nonlinear filters,
Homomorphism filtering, false color, Pseudo color and color image processing.
UNIT IV IMAGE RESTORATION AND RECOGNITION 9

Image DEGRADATION models, Unconstrained and Constrained restoration, inverse filtering,
Least mean square filter, Pattern Classes, optimal statistical classifiers, Neural networks and
associated training methods and use of neural networks in image processing.
UNIT V IMAGE COMPRESSION 9

Run length, Huffman coding, Shift codes, arithmetic coding, bit plane coding, transform coding,
JPEG Standard, wavelet transform, predictive techniques, Block truncation coding schemes,
Facet modeling.
TEXT BOOKS:
1. Rafael C. Gonzales, Richard E. Woods, “Digital Image Processing”, Third Edition,
Pearson Education, 2010
REFERENCE BOOKS:
1.Rafael C. Gonzalez, Richard E. Woods, Steven L. Eddins, “Digital Image Processing Using
MATLAB”, Third Edition Tata McGraw Hill Pvt. Ltd., 2011.
2. Anil Jain K. “Fundamentals of Digital Image Processing”, PHI Learning Pvt. Ltd., 2011.
3.Willliam K Pratt, “Digital Image Processing”, John Willey, 2002.
4.Malay K. Pakhira, “Digital Image Processing and Pattern Recognition”, First
Edition,HILearning Pvt. Ltd., 2
5.www.tutorialspoint.com/dip/

Semester Vi Syllabus

Uploaded by

Document Information

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

Semester Vi Syllabus

Uploaded by

Copyright:

Available Formats

ACADEMIC YEAR 2021-22

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

LIST OF ELECTIVES FOR THE SEMESTER-VI

PROGRAMME ELECTIVE –III (Semester VI)

LIST OF OPEN ELECTIVES COMMON TO ALL B.Tech PROGRAMMES

45. U18OEEC-001-Communication Systems

U18PCCS601 COMPILER DESIGN L T P C

UNIT I OVERVIEW OF COMPILATION AND SYNTAX ANALYSIS 9

UNIT III SEMANTIC ANALYSIS 9

UNIT IV INTERMEDIATE CODE GENERATION 9

UNIT V RUN-TIME ENVIRONMENTS 9

COURSE OUTCOMES (COs)

U18PCCS602 OBJECT ORIENTED SOFTWARE L T P C

UNIT I OBJECT ORIENTED METHODOLOGIES 9

UNIT III DESIGN CONCEPTS 9

UNIT IV DESIGN PATTERNS 9

UNIT V ARCHITECTURE ANALYSIS 9

COURSE OUTCOMES (COs)

U18PCCS6L1 COMPILER DESIGN LABORATORY L T P C

COURSE OUTCOMES (COs)

CO5 To Develop program for solving parser problems.

Mapping of Course Outcomes with PROGRAMME OUTCOMES(POs)

COURSE OUTCOMES (COs)

Unit 2 - CLUSTERING APPROACHES

Measuring (dis)similarity - Evaluating the output of clustering method - Hierarchical clustering -

Unit 3 - NEURAL NETWORKS

Unit 4 - LINEAR MODELS

Unit 5 - TREE LEARNING

COURSE OUTCOMES (COs)

CO 3 Provide solution for classification and regression approaches in real-world applications.

CO 4 Study the neural network systems for machine learning

CO 5 Learn and understand the linear learning models in machine learning

1. Kevin P. Murphy, “Machine Learning: A Probabilistic Perspective”, MIT Press, 2012

2. Ethem Alpaydin, “Introduction to Machine Learning”, Prentice Hall of India, 2005

3. Tom Mitchell, "Machine Learning", McGraw-Hill, 1997.

4. Laurene Fausett, "Fundamentals of Neural Networks, Architectures, Algorithms and Applications”,

REFERENCE BOOKS/OTHER READING MATERIAL

3. Christopher Bishop, “Pattern Recognition and Machine Learning” Springer, 2006

U18PECS035 PARALLEL AND DISTRIBUTED COMPUTING L T P C

UNIT I INTRODUCTION TO DISCRETE EVENT STIMULATION 9

UNIT II PARALLEL PROCESSING OVERVIEW 9

UNI III CONSERVATIVE SYNCHRONIZATION ALGORITHM9

UNIT IV DISTRIBUTED TRANSACTION PROCESSING 9

UNIT V HYBRID PROTOCOLS, DISTRIBUTED COMPUTING STANDARDS 9

1. Martin Kleppmann,“Designing Data-Intensive Applications”, 'Reilly Media; 1st Edition (April

2. Maarten Van steen, Andrew S Tanenbaum, “Distributed Systems”, CreateSpace Independent

3. Andrew S. Tanenbaum, Maartenvan Steen, Distributed Systems, “Principles and Pardigms”,

COURSE OUTCOMES (COs)

CO1 Explain why distributed simulation is needed.

CO2 Understand the main differences between two synchronization methods

CO3 Describe how the conservative method works

CO4 Describe how the optimistic method works

CO5 Understand hybrid approaches for distributed simulation..

CO6 Describe the HLA standard overview for simulation.

Mapping of Course Outcomes with Program outcomes (POs)

(H/M/L indicates strength of correlation) H-High, M-Medium, L-Low

Image Processing Techniques L T P C

UNIT I DIGITAL IMAGE FUNDAMENTAL 9

UNIT II IMAGE TRANSFORMS 9

UNIT III IMAGE ENHANCEMENT 9

UNIT IV IMAGE RESTORATION AND RECOGNITION 9

UNIT V IMAGE COMPRESSION 9

You might also like