Scheme of Instruction and Syllabi

of
V - VIII SEMESTERS

of
FOUR YEAR DEGREE COURSE

in
BE-COMPUTER SCIENCE AND ENGINEERING
(AICTE Model Curriculum with effect from AY 2021-22)

R-20 Regulation

CHAITANYABHARATHIINSTITUTEOFTECHNOLOGY
(An Autonomous Institution)
Affiliated to Osmania U niversity
Kokapet Village, Gandipet Mandal, Hyderabad–500075.Telangana
E-Mail:[email protected];Website:www.cbit.ac.in;PhoneNos.:040-24193276/277/279
CBIT (A) With effect from the Academic Year 2022-23

CHAITANYA BHARATHI INSTITUTE OF TECHNOLOGY(A)

SCHEME OF INSTRUCTIONS AND EXAMINATION
Model Curriculum(R-20)

B.E. (Computer Science and Engineering)

SEMESTER - V
Scheme of
Scheme of Examination
Instruction
S. Course
Title of the Course Hours per Duration Maximum Credits
No Code
Week of SEE Marks
L T P/D in Hours CIE SEE
THEORY
Formal Language and Automata
1. 20CSC19 3 1 - 3 40 60 4
Theory
2. 20CSC20 Operating Systems 3 - - 3 40 60 3
Data Communication and
3. 20CSC21 3 - - 3 40 60 3
Computer Networks
4. 20CSC22 Software Engineering 3 - - 3 40 60 3
5. 20CSEXX Professional Elective-I 3 - - 3 40 60 3
6. 20XXXXX Open Elective-I 3 - - 3 40 60 3
PRACTICAL
7. 20CSC23 Operating Systems Lab - - 3 3 50 50 1.5
Data Communication and
8. 20CSC24 - - 3 3 50 50 1.5
Computer Networks Lab
9. 20CSC25 Case Studies using UML Lab - - 2 3 50 50 1
Internship-II 3 to 4 weeks /
10. 20CSI02 - 50 - 2
(Industrial / Rural Internship) 90 Hours
Total 18 1 8 - 440 510 25
L: Lecture T: Tutorial D: Drawing P: Practical
CIE - Continuous Internal Evaluation SEE - Semester End Examination

Professional Elective – I Open Elective - I

20CSE01 Image Processing and Computer Vision 20ECO10 Fundamentals of Wireless Communication
20CSE02 Advanced Databases 20EEO05 Waste Management
20CSE03 System Modelling and Simulation 20MEO09 Organizational Behaviour
20CSE04 Free and Open Source Technologies 20MTO03 Quantum Computing
20CSE05 Optimization Techniques 20BTO04 Bioinformatics
CBIT (A) With effect from the Academic Year 2022-23

20CSC19
FORMAL LANGUAGE AND AUTOMATA THEORY
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Discrete Mathematics, Data Structures, Design and analysis of algorithms

Course Objectives: The objectives of this course are,

1. To identify the hierarchy of formal languages, grammars, and Design finite automata to accept a set of
strings of a language.
2. Should be able to prove that a given language is regular and able to apply the closure properties of
languages and design context free grammars, conversions into normal forms.
3. To find equivalence of languages accepted by Push down Automata and distinguishes between
computability Vs non-computability and Decidability Vs Undecidability.

Course Outcomes: On successful completion of the course, students will be able to,
1. Describe language basics like Alphabet, strings, grammars, productions, derivations, and Chomsky
hierarchy.
2. Recognize regular expressions, formulate, and build equivalent finite automata for various languages.
3. Identify closure, decision properties of the languages and prove the membership.
4. Demonstrate context-free grammars, check the ambiguity of the grammars and design equivalent PDA
to accept.
5. Use mathematical tools and abstract machine models to solve complex problems.
6. Analyze and distinguish between decidable and undecidable problem.

UNIT - I
Introduction: Alphabet, languages and grammars, productions and derivation, Chomsky hierarchy of
languages. Regular languages and finite automata: Regular expressions and languages, Deterministic Finite
Automata (DFA) and equivalence with regular expressions, Nondeterministic Finite Automata (NFA) and
equivalence with DFA. Equivalence and Minimization of Automata.

UNIT - II
Regular Expressions and Finite Automata: Converting DFA’s to Regular Expressions by Eliminating States,
Converting Regular Expressions to Automata, Applications of Regular Expressions, and Algebraic Laws for
Regular Expressions.
Properties of Regular Languages: The pumping lemma for Regular Languages, Applications of Pumping
Lemma, Closure Properties and Decision Properties of Regular Languages.

UNIT - III
Context-free Languages and Pushdown Automata: Context-free grammars (CFG) and languages (CFL),
Chomsky and Greibach normal forms, nondeterministic pushdown automata (PDA) and equivalence with CFG,
parse trees, ambiguity in CFG, pumping lemma for context-free languages, deterministic pushdown automata,
Closure properties of CFLs.

UNIT - IV
Context-sensitive Languages: Context-sensitive grammars (CSG), linear bounded automata and equivalence
with CSG.
Turing Machines: The basic model for Turing machines (TM), Turing recognizable (recursively enumerable)
and Turing-decidable (recursive) languages and their closure properties, variants of Turing machines,
nondeterministic TMs and equivalence with deterministic TMs.

UNIT - V
Unrestricted grammars and equivalence with Turing machines, TMs as enumerators.
Undecidability: universal Turing machine, reduction between languages and Rice s theorem, PCP and Modified
PCP, Various translators.
CBIT (A) With effect from the Academic Year 2022-23

Text Books:
1. John E. Hopcroft, Rajeev Motwani, Jeffery D Ullman, “Introduction to Automata Theory Languages
and Computation”, Third edition, Pearson Education, 2011.

Suggested Reading:
1. John C Martin. “Introduction to Language and Theory of Computation”, 3 rd edition, TMH, 2003.
2. Daniel Cohen, “Introduction to Computer Theory”, 2ndedition, Wiley Publications, 2007.
3. Mishra K., Chandrasekaran N., “Theory of Computer Science (Automata, Languages and
Computation)”, 3rd edition, Prentice Hall of India 2008.
4. Shyamalendra Kandar, “Introduction to Automata Theory, Formal Languages and Computation”,
Pearson, 2013.
5. Kamala Krithivasan, Rama R. “Introduction to Automata Theory, and Computation”, Pearson 2009.

Online Resources:
1. http://courses.cs.vt.edu/cs4114/spring2012/index.php
2. www.pearsoned.co.in/KamalaKrithivasan
CBIT (A) With effect from the Academic Year 2022-23

20CSC20
OPERATING SYSTEMS
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Prerequisites: Computer Architecture and Programming Fundamentals.

Course Objectives: The objectives of this course are,

1. Should be able to describe the operating system service, and the design of an operating system.
2. To understand the structure and organization of the file system, process synchronization, process
scheduling, system calls and different approaches to memory management.
3. To understand about the cloud infrastructures and technologies.

Course Outcomes: On successful completion of the course, students will be able to,
1. Identify the basics of an operating systems and its major components.
2. Understand the concepts related to process synchronization and deadlocks.
3. Distinguish various memory management techniques.
4. Interpret various threats and defense mechanisms used to protect the system.
5. Evaluate various file allocation methods.
6. Apply security as well as recovery features in the design of algorithms.

UNIT - I
Concepts of Operating Systems: Computer System over view, concept of an operating system, Types of
operating systems, general system architecture, system components, operating system services, system calls,
system programs, approaches to OS design and implementation: Micro-kernel, Layered, Kernel Approach.

UNIT - II
Processes and Threads: Concept of process, process states, process state transitions, process control block,
operations on processes, concurrent processes, mutual exclusion and synchronization, principles of deadlocks,
integrated deadlocks strategy, scheduling levels, scheduling criteria, algorithms, Inter Process Synchronization,
Inter Process Communication, Linux IPC Mechanisms, RPC, RPC exception handling, Security issues.

UNIT - III
Memory Management and Data Management: Logical and physical address space, storage allocation and
management techniques, swapping concept of multi-programming, paging, segmentation, virtual storage
management strategies, demand paging, page replacement algorithms, thrashing, File organization, record
blocking, access methods, directory structure, protection file system structure, allocation methods, free space
management, directory implementation, disk structure, disk scheduling, disk management, buffering, swap space
management, RAID levels.

UNIT - IV
OS Security: Types of threats in OS, basic security mechanisms, understanding the threats, malware taxonomy,
viruses, worms, rootkits; Defense: overview, logging, auditing, and recovery, OS-level memory protection.

UNIT - V
Case studies and OS Abstractions: Linux/Unix OS design and architecture, Unix shell, Unix OS services, user
perspective, representation of files in Unix, system processes and their structure, I/O system, memory
management in Unix. Processes management, file management, IPC and network related system calls,

Text Books:
1. Galvin, Silberschatz, “Operating system”, 7th Edition, John Wiley & Sons, 7th Edition, 2005.
2. Dhananjay Dhamdhare, “Operating Systems-A Concept Based Approach”, 3rd Edition, McGraw Hill
Education, 2017.

Suggested Reading:
1. Ekta Walia, “Operating System Concepts”, Khanna Book Publishing, 2020.
CBIT (A) With effect from the Academic Year 2022-23

2. William Stallings, “Operating Systems Internals and Design Principles”, Pearson Edition, 2012.
3. Charles Crowley, “Operating Systems –A Design Oriented Approach”, McGraw Hill Education, 2017.
4. Andrew S. Tanenbaum, Albert S Woodhull, “Operating systems Design and Implementation”, Pearson
Edition, 2009.
CBIT (A) With effect from the Academic Year 2022-23

20CSC21
DATA COMMUNICATION AND COMPUTER NETWORKS
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Programming for problem solving and data structures.

Course Objectives: The objectives of this course are,

1. To understand the principles of data communication and organization of computer networks,
2. To analyze various routing protocols and congestion control algorithms.
3. To study the functions of the transport layer and to understand application layer protocols.

Course Outcomes: On Successful completion of this course, student will be able to,
1. Learn the communication protocol suites like ISO-OSI and TCP/IP.
2. Illustrate and explain Data Communications System and its components.
3. Identify and analyze various congestion control algorithms.
4. Distinguish the internet protocols like IP, ARP, ICMP, IGMP, routing protocols and DHCP.
5. Understand the transport layer protocols like TCP, UDP, RTCP.
6. Identify various application layer protocols like HTTP, WWW, DNS, Email Protocols, FTP and
the underlying protocols.

UNIT - I
Introduction: Data communication, network types and models, TCP/IP and OSI Protocol Suite,
transmission media (wired and wireless), switching.

UNIT - II
Data Link Layer: Design issues, error detection and correction, elementary data link protocols, sliding
window protocols, HDLC, point to point protocols, multiple access protocols.
LAN: Wired LAN, wireless LAN, connecting devices and Virtual LAN.

UNIT - III
Network Layer: Network layer design issues, routing algorithms, congestion control algorithms, Quality
of service, IPV4, IPV6, network layer protocols: ARP, RARP, ICMP, IGMP and DHCP.

UNIT - IV
Transport Layer: Process to Process Communication, User Datagram Protocol (UDP), Transmission
Control Protocol (TCP), SCTP, congestion control, quality of service.

UNIT - V
Application Layer: DNS, DDNS, SMTP, POP, IMAP, S S H, S FTP, WWW, HTTP, SNMP, Firewalls.

Text Books:
1. Behrouz A. Forouzan, “Data communication and Networking”, Tata McGraw Hill, Fifth Edition,
2017.
2. S. Tanenbaum, "Computer Networks", Pearson Education, Fifth Edition, 2013.
3. William Stallings, “Data and Computer Communication”, Eighth Edition, Pearson Education, 2007.

Suggested Reading:
1 . Larry L.Peterson, Peter S. Davie, “Computer Networks”, Elsevier, Fifth Edition, 2012.
2. James F. Kurose, Keith W. Ross, “Computer Networking: A Top–Down Approach Featuring the
Internet”, Pearson Education, 2005.

Online Resources:
1. https://nptel.ac.in/courses/106/105/106105081/
2. https://nptel.ac.in/courses/106/106/106106091/
CBIT (A) With effect from the Academic Year 2022-23

20CSC22
SOFTWARE ENGINEERING
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Object oriented programming, Programming for problem solving, database management systems.

Course Objectives: The objectives of this course are,

1. To understand the Software Engineering Practice and Process Models.
2. To understand Design Engineering and Project Management in Software Development.
3. To gain knowledge in software testing and overall project activities.

Course Outcomes: On Successful completion of this course, student will be able to,
1. State the software process and explain perspective process model, evolutionary process models.
2. Understand the agile Software process models and demonstrate the skills necessary to specify the
requirements of software product so as to prepare SRS document.
3. Recall the modeling concepts and estimate the cost of software using empirical models
4. Enlist the design principles and construct a product using coding principles and standards.
5. Develop test cases and apply software testing methods in conventional and O-O approaches and
estimates software quality of SW.

UNIT - I
Introduction to Software Engineering: The nature of Software, Software Engineering, Software Engineering
Practice, The Software Process, Software Engineering Practice Process Models: A Generic Process Model,
Process assessment and Improvement, Prescriptive Process Models: Waterfall Model, Incremental Process
Models, RAD Model, Evolutionary Process Models - Prototyping, The Spiral Model, Concurrent Models,
Specialized Process Models.

UNIT - II
An Agile Development: Agility, Agile Process, and Agile Process Models- Extreme Programming (XP),
Adaptive Software Development (ASD), Scrum, Dynamic Systems Development Method (DSDM), Feature
Driven Development (FDD), Agile Modeling (AM), Requirement Engineering, Establishing the groundwork,
Eliciting Requirements, Negotiating Requirements, and Validating Requirements. Software Requirements
Analysis and Specification: Value of a Good SRS, Problem Analysis, Requirements Specification, Components
SRS, Structure of a Requirements Document

UNIT - III
Flow-Oriented Modeling, Planning a software Project: Effort Estimation, Project Schedule and Staffing,
Quality Planning, Risk Management, Estimation for Software Projects: Decomposition Techniques - Software
Sizing, Problem-Based Estimation, An Example of LOC-Based Estimation, An Example of FP-Based
Estimation.

UNIT - IV
Design Concepts: Coupling, Cohesion, The Open-Closed Principle, Function-Oriented Design - Structure
Charts, Structured Design Methodology, An Example, Software Architecture, A Brief Taxonomy of
Architectural Styles, Component-Level Design: Definition, Basic Design Principles, Design Guidelines,
Designing Traditional Components, Coding Principles and guidelines, Incremental Development of Code, Code
Inspection – Planning, Self-Review, Group Review Meeting.

UNIT - V
Testing - Testing Concepts, Testing Process, Testing Strategies: A Strategic approach to software testing,
strategic issues, test strategies for Conventional Software, Validation Testing, System Testing, White Box
Testing, Black Box. Software Review Techniques - Informal Reviews Formal Technical Reviews, Quality
Concepts - What is Quality, Software Quality

Text Books:
CBIT (A) With effect from the Academic Year 2022-23

1. Roger S. Pressman “Software Engineering: A practitioner's approach”, McGraw Hill, 7th Edition, 2010.
2. Pankaj Jalote “A concise Introduction to Software Engineering”, Springer, Kindle Edition, 2008.

Suggested Reading:
1. Sommerville “Software Engineering”, 10th Edition, Pearson, 2016.
2. Rajib Mal “Fundamental of Software Engineering”, 4th Edition, PHI Learning, 2014.

Online Resources:
1. https://nptel.ac.in/courses/106101061/
CBIT (A) With effect from the Academic Year 2022-23

20CSE01
IMAGE PROCESSING AND COMPUTER VISION
(Professional Elective – I)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Linear Algebra and calculus.

Course Objectives: The objectives of this course are,

1. To understand the Fundamental Concepts Related To Multi-Dimensional Signal Processing.
2. To understand Feature Extraction algorithms.
3. To understand Visual Geometric Modeling and Stochastic Optimization.

Course Outcomes: On successful completion of the course, students will be able to,
1. Understand basic principles of image processing and its significance in real world.
2. Interpret and evaluate various approaches for image. Transformation, segmentation, and restoration.
3. Determine and compute object, scene recognition and categorization algorithms for real time images.
4. Analyze images and videos for problems such as tracking and structure from motion.
5. Appraise recovery of 3D structure of ill-posed scenes.
6. Apply various techniques to build computer vision applications.

UNIT - I
Image Formation and Description: Fundamental steps of image processing, the image model and Image
acquisition, Sampling and quantization, Relationship between pixels. Sampling and Quantization, Elements of
Digital Image Processing Systems.
Image Transforms: Digital Image Transforms - Fourier Transform, Extension to 2D.Properites of Fourier
transformations.

UNIT - II
Image Enhancements: Histogram Equalization, Image Smoothing, Image Sharpening, Edge Detection.
Segmentation: Active contours, Split and merge, Mean shift and mode finding, Normalized cuts.
Feature-based alignment: 2D and 3D feature-based alignment, Pose estimation.

UNIT - III
Structure from motion: Triangulation, Two-frame structure from motion, Factorization, Bundle adjustment,
constrained structure and motion
Dense motion estimation: Translational alignment, parametric motion, Spline-based motion, Optical flow,
Layered motion.

UNIT - VI
Recognition: Object detection, Face recognition, Instance recognition, Category recognition, Context and scene
understanding.

UNIT - V
3D Reconstruction: Shape from X, Active range finding, Surface representations, Point-based representations,
volumetric representations, Model-based reconstruction.

Text Books:
1. R. C. Gonzalez, R. E. Woods “Digital Image Processing” Addison Wesley, 2008.
2. Richard Szeliski “Computer Vision: Algorithms and Applications” Springer-Verlag London Limited
2011.

Suggested Reading:
1. Robert J. Schallkoff “Pattern Recognition: Statistical. Structural and Neural Approaches”, John Wiley
& Sons, 1992.
2. D. A. Forsyth, J. Ponce. “Computer Vision: A Modern Approach”, Pearson Education; 2003.
CBIT (A) With effect from the Academic Year 2022-23

3. Richard Hartley, Andrew Zisserman, “Multiple View Geometry in Computer Vision”, Second Edition,
Cambridge University Press, 2004.
4. K. Fukunaga, "Introduction to Statistical Pattern Recognition", Second Edition, Academic Press,
Morgan Kaufmann, 1990.

Online Resources:
1. https://onlinecourses.nptel.ac.in/noc18_ee40.
2. CV online: http://homepages.inf.ed.ac.uk/rbf/CVonline.
3. Computer Vision Homepage: http://www2.cs.cmu.edu/afs/cs/project/cil/ftp/html/vision.html.
CBIT (A) With effect from the Academic Year 2022-23

20CSE02
ADVANCED DATABASES
(Professional Elective – I)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Programming for problem solving, Database management systems.

Course Objectives: The objectives of this course are,

1. To design high-quality relational databases and database applications.
2. To translate complex conceptual data models into logical and physical database designs.
3. To gain an understanding of Oracle11g and XML.
4. To perceive knowledge about Parallel and Distributed Databases.
5. To get exposed in Performance Tuning.

Course Outcomes: On Successful completion of this course, student will be able to,
1. Analyze and evaluate modeling and development methods/techniques in Object-based Databases.
2. Understand and analyze query processing and optimization.
3. Understand how distributed and parallel databases are implemented, and how applications can be
designed for those databases.
4. Develop applications for mobility and personal databases.
5. Understand and implement cloud-based databases.
6. Gain insight into some advanced topics in database such as Performance Tuning, spatial
databases, temporal databases.

UNIT - I
Object Based Databases: Overview, complex Data Types, Structured Types and Inheritance in SL, table
Inheritance, Array and Multiset Types in SQL, Object –Identity and Reference Types in SQL, Implementing O-
R features, Persistent Programming Languages, Object Relational Mapping, Object Oriented versus Object
Relational.

UNIT - II
XML: Motivation, Structure of XML data, XML Document schema, Querying and Transformation, Application
Program Interface to XML, Storage of XML data, XML applications.

UNIT - III
Query processing: Overview, Measures of Query Cost, Selection operating, sorting, Join Operation, Other
Operations, Evaluation of Expressions.
Query Optimization: Overview, Transformation of Relational Expressions, Estimating Statistics of
Expressing Results, Choice of Evaluation plans, Materialized Views.

UNIT - IV
Parallel Databases: Introduction, I/O Parallelism, Inter-query Parallelism, Intra-query Parallelism,
Interoperation Parallelism Query Optimization, and Design of Parallel Systems.
Distributed Databases: Homogenous and Heterogeneous Databases, distributed data storage, Distributed
Transactions, Commit Protocols, concurrency Control in Distributed Databases, Availability, Distributed Query
Processing, Heterogeneous Distributed Databases, cloud Based Databases, Directory systems.

UNIT - V
Advanced Application development: Performance Tuning, Performance Benchmarks Other Issues in
Application Development, Standardization.
Spatial and Temporal Data and Mobility: Motivation, Time in Databases, spatial and Geographical Data,
Multimedia Databases, Mobility and Personal databases.

Test Books:
1. Abraham Silbershatz, Henry F Korth, S Sudharshan, “Database System Concepts”, McGraw Hill
CBIT (A) With effect from the Academic Year 2022-23

International Edition, Sixth Edition, 2010.

2. ElmasriNavathe, Somayajulu, Gupta, “Fundamentals of Database Systems”, Pearson Education,
Fourth Edition, 2006.

Suggested Reading:
1. CJ Date, A Kannan, S Swamynathan, “An Introduction to database Systems”, Pearson
Education, Eight Edition, 2006
2. Ramakrishna, Gehrke, “Database Management”, International Edition, Third Edition, 2003.
CBIT (A) With effect from the Academic Year 2022-23

20CSE03
SYSTEM MODELLING AND SIMULATION
(Professional Elective – I)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Objectives: The objectives of the course are as follows:

1. Review the cost-effectiveness and the time-effect of modeling with industry-related examples of
modeling in science and engineering
2. Estimate essential inputs of the model and respective outcomes from the simulation
3. Analyze different models and simulations, describe the iterative development process of a
model, and explain how models link the physical and virtual worlds.

Outcomes: The outcomes of the course are as follows:

1. Create a computer simulation based on the physical characteristics of the system.
2. Solve ordinary and partial differential equations with computational methods
3. Display insight into the uncertainties in a system and how they can be characterized.
4. Manipulate the data structures of numerical computing; matrices, and vectors, and visually
represent data sets coming from computer simulations

UNIT – I
Introduction to Modeling; Modeling Concepts and Definitions; Introduction to MATLAB; MATLAB Scripts;
MATLAB Arrays

UNIT – II
Aspects of discrete event simulation; Random number/variate generation; Linear models; Graphing data in
MATLAB; MATLAB Array Math

UNIT – III
Graphing in MATLAB; Nonlinear Functions and Modeling; Curve fitting; MATLAB I/O

UNIT – IV
Stochastic models; Accuracy and precision in modeling; MATLAB conditional statements; MATLAB loops;
MATLAB functions

UNIT – IV
Simulation models validation methods; Read/write simulation data from/to external files

Textbooks: The textbooks of the course are as follows:

1. Introduction to Modeling and Simulation with MATLAB® and Python. By Steven I.

Gordon, Brian Guilfoos. 2017
2. Simulation Modeling and Analysis, Law and Kelton, Third Edition, McGraw Hill, Boston,
MA, 2000
CBIT (A) With effect from the Academic Year 2022-23

20CSE04
FREE AND OPEN SOURCE TECHNOLOGIES
(Professional Elective – I)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Programming for problem solving, Object Oriented Programming.

Course Objectives: The objectives of this course are,

1. To familiarize the students with Open Source Technologies.
2. To expose students with OSS Projects, Advantages of Open Source.
3. To make the students understand the principles, methodologies, policies, licensing procedures and
ethics of FOSS.

Course Outcomes: On Successful completion of this course, student will be able to,
1. Identify various FOSS tools, platforms, licensing procedures and development models, ethics
2. Describe various FOSS projects, development models and project management
3. Adapt to the usage of FOSS tools and technologies.
4. Distinguish between Proprietary and Open Source tools, development methods
5. Practice Open Source principles, ethics, and models and to evaluate various Open Source projects like
Linux, Apache, GIT, etc.

UNIT - I
Introduction to Open Source: Open Source, need and principles of OSS, Open Source Standards,
Requirements for Software, OSS success, Free Software, Examples, Free Vs. Proprietary Software, Public
Domain software, Historyof free software, Proprietary Vs Open Source, uses and advantages of Free and Open
Source Software.

UNIT - II
Principles and Open Source Methodology: Open Source Initiatives, Open Standards Principles,
Methodologies, Software freedom, Open Source Software Development, Licenses, Copyright vs. Copy left,
Patents, zero marginal cost, income-generation Opportunities, Internationalization.

UNIT - III
Case Studies: Apache, BSD, Linux, Mozilla Firefox, Wikipedia, GIT, GNU CC, LibreOffice.

UNIT - IV
Open Source Project: Starting and Maintaining an Open Source Project, Open Source Hardware, Open Source
Design, Open Source Teaching (OST), Open Source Media.
How to create your own Licenses, Important FOSS Licenses (Apache, BSD, GPL and LGPL).

UNIT - V
Open Source Ethics: Open Source Government, Ethics of Open Source, Social and Financial Impact of
Open Source Technology, Shared Software, Shared Source, Open Source as a Business Strategy.

Text Books:
1. Kailash Vadera, Bhavyesh Gandhi “Open Source Technology”, University Science Press, 1st Edition,
2009.
2. Fadi P. Deek, James A. M. McHugh, “Open Source Technology and Policy”, Cambridge University
Press.

Suggested Reading:
1. Wale Soyinka, “Linux Administration- A beginner’s Guide”, Tata McGraw Hills.
2. Andrew M. St. Laurent, “Understanding Open Source and Free Software Licensing”, O'Reilly Media.
3. Dan Woods, Gautam Guliani, “Open Source for the Enterprise”, O'Reilly Media.
4. Bernard Golden, “Succeeding with Open Source”, Addison-Wesley Professional.
CBIT (A) With effect from the Academic Year 2022-23

5. Clay Shirky, Michael Cusumano, “Perspectives on Free and Open Source Software”, MIT press.
Online Resources:
1. https://fossee.in/
2. https://opensource.com
3. https://www.gnu.org/
CBIT (A) With effect from the Academic Year 2022-23

20CSE05
OPTIMIZATION TECHNIQUES
(Professional Elective - I)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Linear Algebra and Calculus, Mathematical Foundation for Data Science and Security.

Course Objectives: The objectives of this course are,

1. Identifying and to develop optimization techniques from the verbal description of real system.
2. Should able to learn different techniques to get optimum solution LPP.
3. Should able to understand the Mathematical representations that are needed to solve optimization
problem.
4. Should able to analyze the results of the different real-world problems.
5. Should able to construct network and find critical path using network scheduling technique

Course Outcomes: On Successful completion of this course, student will be able to,
1. Calculate the optimum values for given objective function by LPP.
2. Solve the solution for maximize the profit with minimum cost by Transportation problem.
3. Determine the optimum feasible solution for assignment and travelling salesman problems and
computing the optimal solution for Job sequencing models.
4. Compute the optimum values for given objective function by IPP and optimal strategy for games.
5. Identify critical path using network scheduling.

UNIT - I
Introduction to Operations Research: Basics definitions, objectives, models, application and limitations.
Linear Programming (LP) - Mathematical Formulation of LP problem, Graphical Method, Some Exceptional
Cases, Simplex Method - Introduction, computational procedure, artificial variables technique - big-M method
and 2-phase method.

UNIT - II
Introduction, Mathematical Formulation of transportation Problem, Balanced / Unbalanced, Minimization /
Maximization, Determination of the initial basic feasible solution using (i) North-West Corner Rule (ii) Least
cost method & (iii) Vogel’s approximation method for balanced & unbalanced transportation problems.
Optimality Test & obtaining of optimal solution (Considering per unit transportation cost) using MODI method
and steppingstone method

UNIT - III
Introduction, Mathematical Formulation of Assignment Problem, Hungarian method for optimal solution,
Solving unbalanced problem, Traveling salesman problem, Sequencing models, Solution of Sequencing
Problem – Processing n Jobs through 2 Machines – Processing n Jobs through 3 Machines – Processing 2 Jobs
through m machines – Processing n Jobs through m Machines.

UNIT - IV
Integer Programming Problem: Introduction, Types of Integer Programming Problems, Gomory’s All-IPP
Method, All IPP Algorithm, Branch and Bound Technique Game and strategies: Introduction, Game with
maximin-minimax principle (Pure Strategies), Game with Mixed Strategies, Dominance Property, Graphical
Method for 2 X n or m x 2 Games, Linear Programming Approach for Game Theory.

UNIT - V
Construction of Network – Rules & Precautions, C.P.M. & P.E.R.T. Networks, Obtaining of Critical Path, Time
estimates for activities, Probability of completion of project, Determination of floats (total, free, independent)

Text Books:
1. Kanti Swarup, P. K. Gupta, Man Mohan, “Operations Research”, Sultan Chand Publications, 2010.
2. R. Pannerselvam, “Operations Research”, PHI, 2nd Edition, 2016.
CBIT (A) With effect from the Academic Year 2022-23

Suggested Reading:
1. Deb K. “Optimization for Engineering Design Algorithms and Examples”, PHI, 2000.
2. Arora J. “Introduction to Optimization Design”, Elsevier Academic Press, New Delhi, 2004.
3. Saravanan R. “Manufacturing Optimization through Intelligent Techniques”, Taylor & Francis (CRC
Press), 2006.
4. Hardley G. “Linear Programming”, Narosa Book Distributors Private Ltd., 2002.

Online Resources:
1. https://nptel.ac.in/courses/111105039
2. https://nptel.ac.in/courses/105108127
CBIT (A) With effect from the Academic Year 2022-23

20ECO10
FUNDAMENTALS OF WIRELESS COMMUNICATION
(Open Elective – I)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Prerequisite: A course on basics of electronics is required.

Course Objectives: The objectives of this course are,

1. To familiarize the concepts related to cellular communication and its capacity.
2. To teach students the fundamentals of propagation models and multipath fading.
3. To describe diversity schemes applied in wireless communication and understand the latest Wireless
technologies

Course Outcomes: On Successful completion of this course, student will be able to,
1. Understand the overview of Wireless Communication.
2. Relate the cellular concepts like frequency reuse, hand off, coverage and capacity.
3. Analyse the mobile radio propagation with large scale and small scale fading.
4. Select the suitable diversity technique to combat the multipath fading effects.
5. Compare the multiple access techniques and apply to wireless standards.

UNIT - I
An overview of wireless communications: Roadmap of cellular communications. First-Generation systems.
Second-Generation systems. Third-Generation systems, Fourth-Generation systems and Fifth-Generation
Systems.

UNIT - II
The Cellular Concept-System Design Fundamentals: Introduction, Frequency Reuse, Channel Assignment
Strategies. Handoff Strategies. Interference and System Capacity. Power Control for Reducing Interference.

UNIT - III
Mobile Radio Propagation: Large-Scale Path Loss, Introduction to Radio Wave Propagation, Free Space
Propagation Model, the Three Basic Propagation Mechanisms, Small-Scale Fading and Multipath: Small-
Scale Multipath Propagation, Factors Influencing Small-Scale Fading, Doppler Shift, Types of Small-Scale
Fading.

UNIT - IV
Diversity Techniques: Practical Space Diversity Considerations- Selection Diversity, Feedback or Scanning,
Maximal Ratio Combining Diversity Equal Gain Combining. Orthogonal frequency division multiplexing:
Introduction, Principle of OFDM. OFDM transceivers Cyclic prefix, Spectrum of OFDM, Fading mitigation in
OFDM. Intercarrier interference.

UNIT - V
Multiple access techniques: Duplexing: FDD versus TDD. FDMA. TDMA. CDMA. OFDMA. SDMA
Wireless Standards: Global System for Mobile (GSM). GSM Services and Features, GSM System
Architecture, GSM Radio Subsystem. GPRS and EDGE- features.

Text Books:
1. Theodore S. Rappaport - Wireless Communications Principles and Practice, 2nd Edition, Pearson
Education, 2003.
2. Andrea Goldsmith, “Wireless Communications”, Cambridge University Press, First Edition, 2005.
3. Ke-Lin Du, Concordia University, Montréal,M. N. S. Swamy- Wireless Communication Systems.From
RF Subsystems to 4G Enabling Technologies. April 2010.

Suggested Reading:
CBIT (A) With effect from the Academic Year 2022-23

1. Sanjay Kumar, “Wireless Communication the Fundamental and Advanced Concepts” River Publishers,
Denmark, 2015
2. Andreas F.Molisch - Wireless Communications John Wiley, 2nd Edition, 2006.
3. Wireless Communications and Networking, Vijay Garg, Elsevier Publications, 2007.
CBIT (A) With effect from the Academic Year 2022-23

20EEO05
WASTE MANAGEMENT
(Open Elective – I)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Course Objectives: The objectives of this course are,

1. To imbibe the concept of effective utilization of any scrap
2. To become familiar with the processes of all disciplines of engineering.
3. To learn the technique of connectivity from waste to utility.

Course Outcomes: On Successful completion of this course, student will be able to,
1. Categorize the waste based on the physical and chemical properties.
2. Explain the Hazardous Waste Management and Treatment process.
3. Illustrate the Environmental Risk Assessment, methods, mitigation and control.
4. Interpret the Biological Treatment of Solid and Hazardous Waste.
5. Identify the waste disposal options, describe the design and construction, Operation, Monitoring,
Closure of Landfills

UNIT - I
Introduction to waste management and Municipal Solid Waste Management: Classification of waste:
Agro based, Forest residue, Industrial waste, e-Waste, Municipal Solid Waste Management: Fundamentals
Sources, composition, generation rates, collection of waste, separation, transfer and transport of waste,
treatment and disposal options.

UNIT - II
Hazardous Waste Management and Treatment: Hazardous Waste Identification and Classification,
Hazardous Waste Management: Generation, Storage and collection, Transfer and transport, Processing,
Disposal, Hazardous Waste Treatment: Physical and Chemical treatment, Thermal treatment, Biological
treatment, Pollution Prevention and Waste Minimisation, Hazardous Wastes Management in India.

UNIT - III
Environmental Risk Assessment: Defining risk and environmental risk, Parameters for toxicity quantification,
Types of exposure, Biomagnifications, Effects of exposure to toxic chemicals, risk analysis and risk matrix,
methods of risk assessment, mitigation and control of the risk, case studies.

UNIT - IV
Biological Treatment: Solid and Hazardous Waste Composting; bioreactors; anaerobic decomposition of solid
waste; principles of biodegradation of toxic waste; inhibition; co-metabolism; oxidative and reductive
processes; slurry phase bioreactor; in-situ remediation.

UNIT - V
Waste Disposal: Key Issues in Waste Disposal, Disposal Options and Selection Criteria: Disposal options,
Selection criteria, Sanitary Landfill: Principle, Landfill processes, Landfill Gas Emission: Composition and
properties, Hazards, Migration, Control, Leach ate Formation: Composition and properties. Leach ate
migration, Control, Treatment, Environmental Effects of Landfill, Landfill Operation Issues, Design and
construction, Operation, Monitoring, Closure of Landfills - Landfill Remediation, national and International
Waste management programs.

Text Books:
1. John Pichtel “Waste Management Practices”, CRC Press, Taylor and Francis Group 2005.
2. LaGrega, M.D.Buckingham,P.L. and Evans, J.C. Hazardous “Waste Management”, McGraw Hill
International Editions, New York, 1994.
3. Richard J. Watts, Hazardous “Wastes - Sources, Pathways, Receptors”, John Wiley and Sons, New
York, 1997.
CBIT (A) With effect from the Academic Year 2022-23

Suggested Reading:
1. Basics of Solid and Hazardous Waste Mgmt. Tech. by KantiL.Shah 1999, Prentice Hall.
2. Solid and Hazardous Waste Management 2007 by S.C.Bhatia Atlantic Publishers & Dist.
CBIT (A) With effect from the Academic Year 2022-23

20MEO09
ORGANIZATIONAL BEHAVIOUR
(Open Elective – I)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Course Objectives: The objectives of this course are,

1. Define basic organizational behavior principles and analyze how these influence behavior in the work
place.
2. Analyze the influence of perceptions and personality on individual human behavior in the work place.
3. Discuss the theories of Motivation and Leadership.
4. Provide knowledge on different organizational structures; and concepts of culture, climate and
organizational development and make the students familiarize with individual behavior.
5. Describe the interpersonal and their intrapersonal reactions within the context of the group and also
demonstrate effective communication and decision making skills in small group settings.

Course Outcomes: On successful completion of the course, students will be able to

1. Understand Organizational Behavioral principles and practices.
2. Compare various organizational designs and cultures enabling organizational development.
3. Apply motivational theories and leadership styles in resolving employee‘s problems and decision
makingprocesses.
4. Understand the group dynamics, communication network, skills needed to resolve organizational
conflicts.
5. Analyze the behavior, perception and personality of individuals and groups in organizations in terms of
the key factors that influence organizational behavior.

UNIT – I
Introduction: Organizational behaviour, nature and levels of organizational behavior, individuals in
organization, individual differences , personality and ability, the big 5 model of personality , organizationally
relevant personality traits, the nature of perception , characteristics of the perceiver, target and situation,
perceptual problems.

UNIT – II
Organization structure: Organizational designs and structures, traditional and contemporary organizational
designs, organizational culture and ethical behavior , factors shaping organizational culture, creating an ethical
culture, concepts, organizational climate, organization conflict, and organization development.

UNIT – III
Motivation and leadership: Motivation, early and contemporary theories of motivation, leadership, early and
contemporary approaches to leadership.

UNIT – IV
Group dynamics: Groups and group development, turning groups into effective teams, managing change ,
process, types and challenges, communicating effectively in organizations, communication process, barriers to
communication, overcoming barriers to communication, persuasive communication, communication in crisis
situations.

UNIT – V
Power, Politics, Conflict and Negotiations: Power, politics, conflict and negotiations, sources of individual,
functional and divisional power, organizational politics conflict, causes and consequences, Pondy‘s model of
organizational conflict, conflict resolution strategies.

Text Books:
1. Jennifer George and Gareth Jones, “Understanding and Managing Organizational Behavior”, Pearson
Education Inc., 2012.
2. Jon L Pierce and Donald G. Gardner, “Management and Organizational behavior”, Cengage Learning
CBIT (A) With effect from the Academic Year 2022-23

India (P) Limited, 2001.

3. Richard Pettinger, “Organizational Behaviour”, Routledge, 2010.

Suggested Reading:
1. Stephen P. Robbins, Jennifer George and Gareth Jones, “Management and Organizational Behaviour”,
Pearson Education Inc., 2009.
2. John Schermerhorn, Jr., James G. Hunt and Richard N. Osborn, “Organizational Behaviour”, 10th
edition, Wiley India Edition, 2009.
CBIT (A) With effect from the Academic Year 2022-23

20MTO03
QUANTUM COMPUTING
(Open Elective – I)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Course Objectives: The objectives of this course are,

1. To learn Quantum bits and compute mathematical foundation
2. To understand the evaluation of the quantum bits.
3. To learn Quantum operations by building blocks of Quantum programming
4. To know the basics of Quantum logic gates and circuits
5. To learn Quantum Algorithms by various Techniques.

Course Outcomes: On successful completion of the course, students will be able to

1. Compute basic mathematical operations on Quantum bits.
2. Execute Quantum operations of Quantum computing
3. Built quantum programs
4. Develop quantum Logical gates and circuits.
5. Develop the quantum algorithm

UNIT - I
Math Foundation for Quantum Computing: Introduction of Vector Space, Subspaces, Basis and Finite
Dimensions. Vectors and orthogonality, inner product and Outer product and Hilbert Spaces. Formation of
Matrices by Linear Transformation. Linear Independent and dependent Vectors. Unitary operators and
projectors, Eigen values and Eigen Vectors.

UNIT – II
Introduction to Quantum Computing: Quantum Mechanics (Huygens wave theory ,Photo electric effect De-
Broglie hypothesis and Heisenberg’s uncertainty Principle), Origin of Quantum Computing, Overview of major
concepts in Quantum Commuting ,Qubits and multi-qubits states, Bra-ket notation, Quantum Superposition
Motivation for Studying Quantum Computing, Major players in the industry (IBM, Microsoft, Rigetti, D-Wave

UNIT – III
Building Blocks for Quantum Program: Block sphere representations, Multi-qubits, Inner and outer product
of Multiple of qubits, Tensor product, Quantum Entanglement, Quantum Teleporation (EPR Model) and Bell
State.

UNIT – IV
Quantum Logical gates and Circuits: Pauli, Hadamard, Phase shift, controlled gates, AND, OR and NAND
gate, C-Not, CCNOT gate Introduction of Fourier Transform and Discrete Fourier transform.

UNIT – V
Quantum Algorithms: Z-Transform. Basic techniques exploited by quantum algorithms (Amplitude
amplification, Quantum Fourier Transform, Quantum Phase estimation, Quantum walks), Major Algorithms
(Shore’s Algorithm, Grover’s Algorithm, Deutsch’s Algorithm, Deutsch-Jozsa Algorithm).

Text Books:
1. David McMahon, “Quantum Computing Explained”, Wiley-IEEE Computer Society Pr., 2008.

Suggested Reading:
1. Michael A. Nielsen, “Quantum Computation and Quantum Information”, Cambridge University Press,
2010.
CBIT (A) With effect from the Academic Year 2022-23

20BTO04
BIOINFORMATICS
(Open Elective – I)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Prerequisites: The school level basic knowledge in Fundamental science is required.

Course Objectives: The objectives of this course are,

1. To provide elementary knowledge in biology and bioinformatics and biological information available
to a biologist on the web and learn how to use these resources on their own.
2. To learn the fundamentals of biological databases, Sequence analysis, data mining, sequence alignment
and phylogenetics.
3. To learn methods for determining the predictinggene and protein.

Course Outcomes: On successful completion of the course, students will be able to,
1. Explain the basic concepts of biology and bioinformatics.
2. Identify various types of biological databases used for the retrieval and analysis of the information
3. Explain the sequence analysis and data mining.
4. Discuss the methods used for sequence alignment and construction of the phylogenetic tree.
5. Describe the methods used for gene and protein structure prediction.

UNIT - I
Introduction And Basic Biology: Bioinformatics- Introduction, Scope and Applications of Bioinformatics;
Basics of DNA, RNA, Gene and its structure, Protein and metabolic pathway; Central dogma of molecular
biology; Genome sequencing, Human Genome Project.

UNIT - II
Biological Databases: Introduction to Genomic Data and Data Organization, types of databases, biological
databases and their classification, Biological Databases - NCBI, SWISS PROT/Uniport, Protein Data Bank,
Sequence formats; Information retrieval from biological databases; Data mining of biological databases

UNIT - III
Sequence Analysis and Data Mining: Scoring matrices, Amino acid substitution matrices- PAM and
BLOSUM; Gap, Gap penalty; Database similarity searching - BLAST, FASTA algorithms to analyze sequence
data, FASTA and BLAST algorithms comparison; Data Mining- Selection and Sampling, Pre-processing and
Cleaning, Transformation and Reduction, Data Mining Methods, Evaluation, Visualization, Designing new
queries, Pattern Recognition and Discovery, Text Mining Tools

UNIT - IV
Sequence Alignment And Phylogentics: Sequence Alignment – Local and Global alignment; Pairwise
sequence alignment – Dynamic Programming method for sequence alignment - Needleman and Wunsch
algorithm and Smith Waterman algorithm. Multiple sequence alignment - Methods of multiple sequence
alignment, evaluating multiple alignments, applications of multiple sequence alignment. Concept of tree,
terminology, Methods of phylogenetic analysis, tree evaluation – bootstrapping, jackknifing

UNIT - V.
Macromolecular Structure Prediction:
Gene prediction, - neural networks method, pattern discrimination methods, conserved domain analysis; Protein
structure basics, protein structure visualization, Secondary Structure predictions; prediction algorithms; Chou-
Fasman and GOR method, Neural Network models, nearest neighbor methods, Hidden-Markov model, Tertiary
Structure predictions; prediction algorithms; homology modeling, threading and fold recognition, ab initio
prediction.

Text Books:
1. David Mount, “Bioinformatics Sequence and Genome Analysis”, 2nd edition, CBS Publishers and
CBIT (A) With effect from the Academic Year 2022-23

Distributors Pvt. Ltd., 2005

2. Rastogi SC, Mendiratta N and Rastogi P, “Bioinformatics: Methods and Applications Genomics,
Proteomics and Drug discovery”, 3rdedition, PHI Learning Private Limited, New Delhi, 2010

Suggested Reading:
1. Baxebanis AD and Francis Ouellette BF, “Bioinformatics a practical guide the analysis of genes and
proteins”, 2nd edition, John Wiley and Sons, Inc., Publication, 2001
2. Vittal R Srinivas, “Bioinformatics: A modern approach. PHI Learning Private Limited”, New Delhi,
2009
3. JiXiong, “Essential Bioinfomatics”, Cambridge University Press, 2006.
CBIT (A) With effect from the Academic Year 2022-23

20CSC23
OPERATING SYSTEMS LAB
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 50 Marks
Continuous Internal Evaluation 50 Marks
Credits 1.5

Pre-requisites: Operating systems, Programming for problem solving.

Course Objectives: The objectives of this course are,

1. To explore Unix/Linux operating system.
2. To analyze various system calls available in Linux/Unix.

Course Outcomes: On Successful completion of this course, student will be able to,
1. Understand Linux/Unix environment.
2. Identify and interpret various system programs.
3. Understand and implement shell programming.
4. Simulate memory management and file allocation techniques.
5. Analyze process and file management system calls by creating and/or modifying concurrent programs.
6. Build network-oriented applications using system calls.

List of Experiments:
1. To perform shell programming
2. Implement memory management techniques like paging and segmentation
3. Implement the file allocation techniques of Linked, Indexed and Contiguous.
4. Use the following system calls of Linux/Unix OS: mkdir, link, unlink, mount, unmount, users+, chown,
chmod, getuid, setuid.
5. Use the following Linux/Unix system calls: fork, wait, exec, exit, getpid, brk, nice, sleep, open, close,
read, write, lseek, stat, sync.
6. Develop applications using Linux/Unix system calls: signal, socket, accept, snd, recv, connect.

Text Books:
1. Galvin, Silberschatz, “Operating system”, 7th Edition, John Wiley & Sons, 7th Edition, 2005.
2. Dhananjay Dhamdhare, “Operating Systems-A Concept Based Approach”, 3rd Edition, McGraw Hill
Education, 2017.

Suggested Reading:
1. Ekta Walia, “Operating System Concepts”, Khanna Book Publishing, 2020.
2. William Stallings, “Operating Systems Internals and Design Principles”, Pearson Ed., 2012.
3. Charles Crowley, “Operating Systems –A Design Oriented Approach”, McGraw Hill Education, 2017.
4. Andrew S. Tanenbaum, Albert S Woodhull, “Operating systems Design and Implementation”, Pearson
Ed., 2009.
CBIT (A) With effect from the Academic Year 2022-23

20CSC24
DATA COMMUNICATION AND COMPUTER NETWORKS LAB
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 50 Marks
Continuous Internal Evaluation 50 Marks
Credits 1.5

Pre-requisites: Operating Systems, Data Communication and Computer Networks.

Course Objectives: The objectives of this course are,

1. To familiarize students with the communication media, devices, and protocols.
2. To expose students to gain practical knowledge of computer networks an d it s configuration.
3. To create simple network topologies using simulation tools.

Course Outcomes: On successful completion of the course, students will be able to,
1. Identify the different types of wiring equipment’s used in the networks lab.
2. Understand the various network devices like repeater, hub, switch, and routers.
3. Practice the basic network configuration commands like ifconfig, ping, traceroute, nslookup, dig, arp,
netstat, nmap.
4. Design and demonstrate network topologies using GNS3.
5. Examine the packet transfer using tcpdump.
6. Analyze the network performance using Wireshark or any tool.

List of Experiments:
1. Study of Network media, cables, and devices and Cable Construction.
2. Demonstration of basic network commands/utilities (both in Windows and Linux).
3. PC Network Configuration.
4. Building a switch-based network / Configuration of Cisco Switch CBS250-24T-4G 24-Port.
5. Configuration of Cisco Router ISR-4331.
6. Configuration of VLAN in Cisco switch.
7. Develop different local area networks using GNS3. Connect two or more Local area networks. Explore
various sub-netting options.
8. Configure Static routing using GNS3 tool.
9. Basic OSPF configuration using GNS3 tool.
10. Basic EIGRP Configuration using GNS3 tool.
11. Analysis of network traces using tcpdump.
12. Analysis of network traces using Whireshark.

Text Books:
1. S. Tanenbaum, "Computer Networks", Pearson Education, Fifth Edition, 2013.

Online Resources:
1. https://learningnetwork.cisco.com/s/question/0D53i00000Kt7EkCAJ/tools-for-ccnp-network-
simulator-lab-tasks
2. https://www.packettracernetwork.com/
3. https://www.ghacks.net/2019/11/13/gns3-is-an-open-source-graphical-network-simulator-for-
windows-linux-and- macos/
4. https://www.imedita.com/blog/top-10-list-of-network-simulation-tools/
5. https://www.gns3.com/
CBIT (A) With effect from the Academic Year 2022-23

20CSC25
CASE STUDIES USING UML LAB
Instruction 2 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 50 Marks
Continuous Internal Evaluation 50 Marks
Credits 1

Prerequisites: Object Oriented Programming, Software Engineering.

Course Objectives: The objectives of this course are,

1. To identify Project Scope, Objectives and infrastructure.
2. To understand Software Engineering methodologies for project development
3. To gain knowledge about Computer Aided Software Engineering (CASE) tools.
4. To use effective communication and technical skills for building quality software.

Course Outcomes: On successful completion of the course, students will be able to,
1. Identify the problem scope and constraints in the problem.
2. Prepare software requirements specifications (SRS) for the system according to standards.
3. Apply the design notations of structured approach to develop ER and Data Flow Diagrams.
4. Apply/Use the design notations of OO approach to develop UML diagrams using rational tools.
5. Implement, analyze and prepare the documentation for the proposed system.

Select one large Information System/Approach and device the following using UML tool:
1. Structured Diagrams (Data Flow Diagrams, Entity-Relationship Diagrams etc.)
2. Preparation of Software Requirement Specification Document for a given Case Study.

UML Diagrams
1. Use Case Diagrams
2. Class Diagrams
3. Sequence Diagrams
4. Activity Diagrams
5. State Chart Diagrams
6. Component Diagrams
7. Deployment Diagrams

Text Books:
1. Grady Booch, James Rumbaugh, Ivar Jacobson: “The Unified Modeling Language User Guide”,
Pearson Education, 2007.
2. Roger S. Pressman, “Software Engineering - A Practitioners Approach”, 7th Edition, Pearson
Education, India, 2010.
CBIT (A) With effect from the Academic Year 2022-23

20CSI02
INTERNSHIP – II
(Industrial / Rural Internship)
Instruction 3 to 4 weeks / 90 Hours
Continuous Internal Evaluation 50 Marks
Credits 2
CBIT (A) With effect from the Academic Year 2022-23

CHAITANYA BHARATHI INSTITUTE OF TECHNOLOGY(A)

SCHEME OF INSTRUCTIONS AND EXAMINATION
Model Curriculum(R-20)

B.E. (Computer Science and Engineering)

SEMESTER - VI
Scheme of
Scheme of Examination
Instruction
S. Maximum
Course Code Title of the Course Hours per Week Duration Credits
No
of SEE Marks
L T P/D in Hours CIE SEE
THEORY
1. 20CSC26 Compiler Design 3 - - 3 40 60 3
2. 20CSC27 Artificial Intelligence 3 - - 3 40 60 3
3. 20CSEXX Professional Elective – II 3 - - 3 40 60 3
4. 20CSEXX Professional Elective – III 3 - - 3 40 60 3
5. 20XXXXX Open Elective-II 3 - - 3 40 60 3
6. 20EGM03 Universal Human Values 2.0 3 - - 3 40 60 3
PRACTICAL
7. 20CSC28 Compiler Design Lab - - 3 3 50 50 1.5
8. 20CSC29 Artificial Intelligence Lab - - 3 3 50 50 1.5
9. 20CSEXX Professional Elective – II Lab - - 2 3 50 50 1

10. 20EGC03 Employability Skills - - 2 3 50 50 1

TOTAL 18 - 10 - 440 560 23
L: Lecture T: Tutorial D: Drawing P: Practical
CIE - Continuous Internal Evaluation SEE - Semester End Examination

Professional Elective - II Professional Elective - II Lab

20CSE06 Soft Computing 20CSE15 Soft Computing Lab
20CSE07 Internet of Things 20CSE16 Internet of Things Lab
20CSE08 Full Stack Development 20CSE17 Full Stack Development Lab
20CSE09 Machine Learning 20CSE18 Machine Learning Lab
20CSE10 DevOps 20CSE19 DevOps Lab

Professional Elective - III Open Elective - II

20CSE11 Natural Language Processing 20ECO01 Remote Sensing and GIS
20CSE12 Embedded Systems 20MTO01 Financial Mathematics
20CAE04 Algorithmic Game Theory 20EEO02 Energy Management Systems
20CSE13 Adhoc Sensor Networks 20EGO01 Technical Writing Skills
20CSE14 Software Quality Testing 20CEO02 Disaster Risk Reduction And
Management
20CHO04 Environmental and Sustainable
Development
CBIT (A) With effect from the Academic Year 2022-23

20CSC26
COMPILER DESIGN
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Formal Language and Automata Theory, Data Structures, Computer Architecture and
Microprocessor.

Course Objectives: The objectives of this course are,

1. To understand the different stages in the process of compilation.
2. To identify various methods of lexical analysis and design top-down and bottom-up parsers.
3. To implement syntax directed translation schemes and develop algorithms to generate code for a target
machine.

Course Outcomes: On successful completion of the course, students will be able to,
1. Identify the concepts related to translator, tokens, bootstrapping porting and phases of the compiler.
2. Use grammar specifications and implement lexical analyzer by the help of compiler tools.
3. Explore the techniques of Top down, Bottom up Parsers and apply parsing methods for various
grammars.
4. Implement syntax directed translation schemes and relate Symbol table organization
5. Explain the algorithms to generate code for a target machine code and evaluate.
6. Recognize the errors and their recovery strategies and understanding advance topics

UNIT - I
Introduction to compilers – Analysis of the source program, Phases of a compiler, grouping of phases,
compiler writing tools: bootstrapping, data structures.
Lexical Analysis: The role of Lexical Analyzer, Input Buffering, Specification of Tokens using Regular
Expressions, Review of Finite Automata, Recognition of Tokens, scanner generator(lex, flex).

UNIT - II
Syntax Analysis: Top-Down Parsing: Recursive Descent parsing, Predictive parsing, LL (1) Grammars.
Bottom-Up Parsing: Shift Reduce parsing – Operator precedence parsing (Concepts only).
LR parsing: Constructing SLR parsing tables, Constructing, Canonical LR parsing tables and Constructing
LALR parsing tables. Parser generator (YACC, BISON).

UNIT - III
Syntax directed translation: Syntax directed definitions, Bottom- up evaluation of S -attributed definitions, L-
attributed definitions, Top-down translation, Bottom-up evaluation of inherited attributes.
Type Checking: Type systems, Specification of a simple type checker, overview of Symbol Table

UNIT - IV
Intermediate Code Generation (ICG): Intermediate languages – Graphical representations, Three Address
code, Quadruples, Triples.
Code Optimization: Principal sources of optimization, Optimization of Basic blocks.

UNIT - V
Code generation: Issues in the design of a code generator. The target machine, A simple code generator.
Overview of machine-dependent and independent optimizations .Error recovery in various phases.
Advanced topics: Review of Compiler Structure, Advanced elementary topics, Structure of optimizing
compilers.

Text Books:
1. Alfred V Aho, Monica S Lam, Ravi Sethi, Jeffrey D Ullman, “Compilers: Principles Techniques &
Tools”, Pearson Education 2nd Edition, 2013.
2. Steven Muchnik, “Advanced Compiler Design and Implementation”, Kauffman, 1998.
CBIT (A) With effect from the Academic Year 2022-23

Suggested Reading:
1. Kenneth C Louden, “Compiler Construction: Principles and Practice”, Cengage Learning, 2005.
2. John R Levine,”Lex&Yacc”, Oreilly Publishers, 2nd Edition, 2009.
3. Keith D Cooper & Linda Tarezon, “Engineering a Compiler”, Morgan Kafman, Second edition, 2004.
4. John R Levine, Tony Mason, Doug Brown “Lex &Yacc”, 3rd Edition Shroff Publisher, 2007.

Online Resources:
1. http://www.nptel.ac.in/courses/106108052
2. https://web.stanford.edu/class/archive/cs/cs143/cs143.1128/
3. http://en.wikibooks.org/wiki/Compiler_Construction
4. http://dinosaur.compilertools.net/
5. http://epaperpress.com/lexandyacc/
CBIT (A) With effect from the Academic Year 2022-23

20CSC27
ARTIFICIAL INTELLIGENCE
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Data structures, Discrete Mathematics.

Course Objectives: The objectives of this course are,

1. To become familiar with basic principles of AI and its fundamentals.
2. To discuss the knowledge and application of intelligent systems and their practical applications.
3. To analyze the various knowledge representation schemes, reasoning and learning techniques of AI.

Course Outcomes: On successful completion of the course, students will be able to,
1. Define the role of agents and interaction with the environment to establish goals.
2. Identify and formulate search strategies to solve problems by applying suitable search strategy.
3. Understand probabilistic reasoning and Markov decision process to solve real world problems.
4. Design applications using Reinforcement Learning.
5. Apply AI concepts to solve the real-world problems.

UNIT - I
Introduction: Concept of AI, history, current status, scope, agents, environments, Problem Formulations, Review of
tree and graph structures.
Intelligent agents: Classification, Working of an agent, single agent and multi agent systems, multi agent
application.

UNIT - II
Search Algorithms: State space representation, Search graph and Search tree. Random search, Search with closed
and open list, Depth first and Breadth first search. Heuristic search, Best first search. A* algorithm, problem
reduction, constraint satisfaction, Game Search, minmax algorithm, alpha beta pruning, constraint satisfaction
problems.

UNIT - III
Knowledge & Reasoning: Knowledge-Based Agents, Logic, First-Order Logic, Syntax-Semantics in FOL, Simple
usage, Inference Procedure, Inference in FOL, Reduction, Inference Rules, Forward Chaining, Backward Chaining,
Resolution.

UNIT - IV
Probabilistic Reasoning: Probability, conditional probability, Bayes Rule, Bayesian Networks- representation,
construction and inference, temporal model, hidden Markov model.
Markov Decision Process: MDP formulation, utility theory, utility functions, value iteration, policy iteration and
partially observable MDPs.

UNIT - V
Reinforcement Learning: Passive reinforcement learning, direct utility estimation, adaptive dynamic programming,
temporal difference learning, active reinforcement learning- Q learning.

Text Books:
1. Stuart Russell, Peter Norvig, “Artificial Intelligence: A Modern Approach”, 3rd Ed., Prentice Hall,
2010.
2. Elaine Rich and Kevin Knight, “Artificial Intelligence”, Tata McGraw Hill, 3rd Edition, 2018.

Suggested Reading:
1. Trivedi M.C., “A Classical Approach to Artificial Intelligence”, Khanna Publishing House, Delhi,
2018.
2. Saroj Kaushik, “Artificial Intelligence”, Cengage Learning India, 2011.
CBIT (A) With effect from the Academic Year 2022-23

Online Resources:
1. https://nptel.ac.in/courses/106105077
2. https://nptel.ac.in/courses/106106126
3. https://aima.cs.berkeley.edu
CBIT (A) With effect from the Academic Year 2022-23

20CSE06
SOFT COMPUTING
(Professional Elective – II)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Fundamental Mathematics, Artificial Intelligence.

Course Objectives: The objectives of this course are,

1. To learn various types of soft computing techniques and their applications.
2. To acquire the knowledge of neural network architectures, learning methods and algorithms.
3. To understand Fuzzy logic, Genetic algorithms and their applications.

Course Outcomes: On Successful completion of this course, student will be able to,
1. Understand various soft computing concepts and techniques.
2. Analyze and design various learning models.
3. Apply the neural network architecture for various real time applications.
4. Examine and approximate reasoning using fuzzy logic.
5. Design genetic algorithms for various applications.
6. Develop soft computing techniques to solve different applications.

UNIT - I
Soft computing vs. Hard computing, Various types of soft computing techniques.
Artificial Neural Networks: Fundamental concepts, Evolution of neural networks, Basic models of artificial
neural network, important terminologies of ANNs. McCulloch-Pitts neuron, linear separability, Hebb network.

UNIT - II
Supervised Learning Neural Networks: Perceptron networks, Adaptive linear neuron (Adaline), Multiple
Adaptive linear neuron (Madaline), Back propagation network.

UNIT - III
Unsupervised Learning Neural Networks: Kohonen Self Organizing networks, Adaptive resonance theory.
Associate Memory Networks: Bidirectional associative memory network, Hopfield networks.

UNIT - IV
Fuzzy Logic: Introduction to classical sets and Fuzzy sets, Fuzzy relations, Tolerance and equivalence relations,
Membershipfunctions, Defuzzification.

UNIT - V
Genetic Algorithms: Introduction, Basic operators and terminology, Traditional algorithm vs. genetic
algorithm, Simple genetic algorithm, General genetic algorithm, Classification of genetic algorithm, Genetic
programming, Applications of genetic algorithm.

Text Books:
1. S.N. Sivanandam, S.N. Deepa, “Principles of soft computing”, Wiley publications, 2nd Edition, 2011.

Suggested Reading:
1. S. Rajasekaran, G.A. Vijayalakshmipai, “Neural Networks, Fuzzy logic & Genetic Algorithms,
Synthesis & Applications”, PHI publication, 2008.
2. LiMin Fu, “Neural Networks in Computer Intelligence”, McGraw-Hill edition, 1994.
3. K.L.Du& M.N.S Swamy, “Neural Networks in a Soft Computing Framework”, Springer International
edition, 2008.
4. Simon Haykins, “Neural Networks a Comprehensive Foundation”, PHI, second edition.
5. Goldberg, David E., “Genetic Algorithms in Search, Optimization and Machine Learning”, Addison
Wesley, New Delhi, 2002.
6. N.P. Padhy and S.P. Simon,”Soft Computing: With Matlab Programming”, Oxford University Press,
2015.
CBIT (A) With effect from the Academic Year 2022-23

Online Resources:
1. https://onlinecourses.nptel.ac.in/noc18_cs13/preview.
2. https://archive.nptel.ac.in/courses/106/105/106105173/
CBIT (A) With effect from the Academic Year 2022-23

20CSE07
INTERNET OF THINGS
(Professional Elective – II)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Computer architecture and microprocessor, Programming for problem solving.

Course Objectives: The objectives of this course are,

1. To understand the architecture, basics and applications of IoT.
2. To impart practical knowledge on components of IoT.
3. To develop skills required for building real-time IIoT based projects.

Course Outcomes: On successful completion of the course, students will be able to,
1. Understand IoT, its hardware and software components.
2. Comprehend I/O interface and programming APIs.
3. Analyze the use of communication protocols in IoT.
4. Explore Solution framework for IoT applications.
5. Illustrate unstructured data storage.
6. Develop real time IoT based projects.

UNIT - I
Introduction to IoT: Architectural Overview, Design principles and requirements of IoT, IoT Applications.
Elements of IoT: Basics of networking, sensors, actuators, computing devices, software, data management and
processing environment and Security issues.

UNIT - II
IoT Hardware Components: Computing (Arduino, Raspberry Pi), Communication modules, Sensors,
Actuators, I/O interfaces, Programming API's.

UNIT - III
IoT Data Protocols: MQTT, CoAP, AMQP, DDS, HTTP, WebSocket
Network Protocols for IoT: 6LowPAN, RPL, IPV6, WiFi, Bluetooth, ZigBee, Z-Wave, LoRaWan, MQTT,
XMPP

UNIT - IV
IoT Application Development: Solution framework for IoT applications- Implementation of Device
integration, Data acquisition and integration, Device data storage- Unstructured data storage on cloud/local
server, Authentication, authorization of devices.

UNIT - V
IoT Case Studies: IoT case studies based on Industrial automation, Transportation, Agriculture, Healthcare,
Home Automation.

Text Books:
1. Jan Holler, VlasiosTsiatsis, Catherine Mulligan, Stefan Avesand, StamatisKarnouskos, David
Boyle,“From Machine-to-Machine to the Internet of Things: Introduction to a New Age of
Intelligence”,1st Edition, Academic Press, 2014.
2. Jeeva Jose, "Internet of Things", Khanna Publishing House, Delhi, 2018.
3. Arshdeep Bahga and Vijay Madisetti, "Internet of Things: A Hands-on Approach", Universities Press,
2014.

Suggested Reading:
1. Dr. SRN Reddy, Rachit Tirnkral and Manasi Mishra, "Introduction to Internet of Things: A practical
Approach", ETI Labs, 2018.
2. Adrian McEwen, "Designing the Internet of Things", Wiley, 2013.
3. Raj Kamal, “Internet of Things: Architecture and Design”, McGraw Hill, 2017.
CBIT (A) With effect from the Academic Year 2022-23

4. Cuno Pfister, "Getting Started with the Internet of Things", 0’ Reilly Media, 2011.

Online Resources / Weblinks / NPTEL Courses:

1. Li Da Xu, Wu He, and Shancang Li, “Internet of Things in Industries: A Survey “, IEEE Transactions
on Industrial Informatics, Vol. 10, No. 4, Nov. 2014.
2. T. Winter, P. Thubert, A. Brandt, J. Hui, R. Kelsey, P. Levis, K. Pister, R. Struik , JP. Vasseur, R.
Alexander, “RPL: IPv6 Routing Protocol for Low‐Power and Lossy Networks”, IETF, Standards
Track, Mar. 2012.
3. Z. Shelby, K. Hartke, C. Bormann, “The Constrained Application Protocol (CoAP)”, Internet
Engineering Task Force (IETF), Standards Track, 2014.
4. L.Fenzel, “What’s The Difference Between IEEE 802.15.4 And ZigBee Wireless?”,Electronic Design
(Online), Mar. 2013.
5. S. N. Das and S. Misra, "Information theoretic self‐management of Wireless Sensor Networks",
Proceedings of NCC 2013.
6. F. Luo et al., "A Distributed Gateway Selection Algorithm for UAV Networks," in IEEE Transactions
on Emerging Topics in Computing, vol. 3, no. 1, pp. 22‐33, March 2015.
7. https://onlinecourses.nptel.ac.in/noc19_cs31/
8. https://www.nabto.com/guide-iot-protocols-standards/
CBIT (A) With effect from the Academic Year 2022-23

20CSE08
FULL STACK DEVELOPMENT
(Professional Elective – II)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Internet and web technologies, OOPs, Database management systems.

Course Objectives: The objectives of this course are,

1. To provide good understanding of latest web technologies on client side components like ReactJS and
Angular2
2. To acquire knowledge on web frameworks, develop server side web applications like Node.js and
Express
3. To develop innovative web applications using various technologies.

Course Outcomes: On successful completion of the course, students will be able to,
1. Understand the database connectivity and application servers.
2. Explore the type of forms with validations using ReactJS.
3. Utilize Express framework to develop responsive web applications.
4. Demonstrate the architecture and file system of NodeJs.
5. Identify the significance of component intercommunication with Angular2.
6. Adapt MEAN or MERN stack to implement a real-time web application.

UNIT - I
Introduction to Full stack development and NoSQL
MongoDB: Basics, Configuring Server and Client, MongoDB Compass, Creating Database, MongoDB
Commands, MongoDB CRUD Operations.
REST: Introduction to REST and API, REST Constraints, Representations, Resource Identifier, REST Actions,
Status Codes.

UNIT - II
NodeJs: Introduction, NodeJS Features and Drawbacks, setup Environment for NodeJs, NodeJS Program
architecture, NodeJS Web Server, NodeJS Global Objects, NodeJS OS Objects, NodeJS Error Handling, Node
JS Event Loop, NodeJS File System, Async and Sync, Connecting with Database, Handling CRUD Operations.

UNIT - III
Building an Express web application: Introduction to Express, Installation of Express, Create first Express
application, the application request and response objects, configuring an Express application, rendering views,
Authentication, Authorization.

UNIT - IV
Introduction to ReactJS: React Components, React State and Props
Component intercommunication: Component Composition, pass data from parent to child, pass data from
child to parent, Fetching data API using axioms, Types of forms, Form Validations, Posting Data, React Router,
Building & Deploying React App.

UNIT - V
Introduction to Angular2: Angular2 Architecture (Component-Based Architecture), Consuming API, State
Management, Validation, Routing. Passing data from parent to child and Passing data between siblings.
Angular2 Specific: Directives, Modules, Components, Observables, Binding, Pipes, Dependency Injection.

Text Books:
1. Amos Q. Haviv, MEAN Web Development, Second Edition, Packt Publications, November 2016.
2. Vasan Subramanian, “Pro MERN Stack, Full Stack Web App Development with Mongo, Express,
React, and Node”, 2nd Edition, APress.
3. Fernando Doglio, “REST API Development with Node.js”, 2nd Edition, APress.
CBIT (A) With effect from the Academic Year 2022-23

Suggested Reading:
1. Shelly Powers, “Learning Node: Moving to the Server-Side”, 2nd Edition, O’REILLY, 2016.
2. Simon D. Holmes and Clive Harber, “Getting MEAN with Mongo, Express, Angular, and Node”,
Second Edition, Manning Publications, 2019
3. Brad Dayley, “Node.js, MongoDB and Angular Web Development”, 2nd Edition, Addison-Wesley
Professional, 2017.

Online Resources:
1. https://www.mongodbtutorial.org/mongodb-crud/
2. https://reactjs.org/tutorial/tutorial.html
3. https://www.javatpoint.com/expressjs-tutorial
4. https://www.javatpoint.com/nodejs-tutorial
5. https://angular-training-guide.rangle.io/
CBIT (A) With effect from the Academic Year 2022-23

20CSE09
MACHINE LEARNING
(Professional Elective – II)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Linear Algebra and Calculus, Artificial Intelligence.

Course Objectives: The objectives of this course are,

1. To understand the need and elements of Machine Learning
2. To study various machine learning techniques.
3. To design solutions for real world problems using machine learning techniques.

Course Outcomes: On successful of the course student will be able to,

1. Classify the types of machine learning techniques.
2. Recognize the underlying mathematical relationships within and across ML algorithms and their
paradigms.
3. Determine the various applications of Machine Learning.
4. Model the problems using appropriate machine learning techniques.
5. Design and develop solutions to real world problems using Machine Learning Algorithms.
6. Evaluate and interpret the results of the various machine learning technique.

UNIT - I
Introduction to Machine Learning: Introduction, Classic and Adaptive machines, learning Types-Supervised,
Unsupervised, deep learning, bio-inspired adaptive systems, Machine Learning, and big data.
Elements of Machine Learning: Data formats, Learnability, Statistical learning concepts, Class balancing,
Elements of Information theory.

UNIT - II
Feature Selection and Feature Engineering: Data sets, creating training and test sets, managing categorical
data, missing features, data scaling and normalization, whitening, Feature selection and filtering, PCA,
Visualization of high-dimensional datasets.
Regression Algorithms: Linear models for regression, Regression types.

UNIT - III
Classification Algorithms: KNN, Linear classification, logistic regression, grid search, classification metrics,
ROC curve.
Naïve Bayes and Discriminant Analysis: Bayes theorem, Naïve Bayes classifiers, Discriminant analysis.
Decision Trees and Ensemble Learning: Binary Decision trees, Introduction, to Ensemble Learning-Random
Forests, AdaBoost, Gradient Tree Boosting, Voting classifier.

UNIT - IV
Support Vector Machines: Linear SVM, Kernel based Classification.
Clustering Fundamentals: Basics, K-means, Evaluation methods, DBSCAN, Spectral Clustering, and
Hierarchical Clustering.

UNIT - V
Machine Learning Architectures: Data collection, Normalization and regularization, Dimensionality
reduction, Data augmentation, Modeling/Grid Search/Cross-validation, Visualization, GPU support,
introduction to distributed architectures, Scikit-learn tools for ML architectures.

Text Books:
1. Giuseppe Bonaccorso, “Machine Learning Algorithms”, 2nd Edition, Packt, 2018,
2. Tom Mitchel “Machine Learning”, Tata McGraW Hill, 2017.

Suggested Reading:
1. Abhishek Vijavargia “Machine Learning using Python”, BPB Publications, 1 st Edition, 2018
CBIT (A) With effect from the Academic Year 2022-23

2. ReemaThareja “Python Programming”, Oxford Press, 2017

3. Yuxi Liu, “Python Machine Learning by Example”, 2nd Edition, PACT, 2017

Online Resources:
1. https://www.guru99.com/machine-learning-tutorial.htm
2. https://www.tutorialspoint.com/machine_learning_with_python/index.htm
CBIT (A) With effect from the Academic Year 2022-23

20CSE10
DEVOPS
(Professional Elective – II)

Instruction 3 Hours per week

Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Database management systems, Operating systems, OOPs.

Course Objectives: The objectives of this course are,

1. To describe the agile relationship between development and IT operations.
2. To understand the skill sets and high-functioning teams involved in DevOps and related methods
to reach a continuous delivery capability.
3. To implement automated system update and DevOps lifecycle.

Course Outcomes: On successful completion of this course, students will be able to,
1. Identify components of Devops environment.
2. Describe Software development models and architectures of DevOps.
3. Apply different project management, integration, testing and code deployment tools.
4. Investigate different DevOps Software development models.
5. Assess various Devops practices.
6. Collaborate and adopt Devops in real-time projects.

UNIT - I
Introduction: Software development models, Introduction to DevOps, Why DevOps, DevOps process and
Continuous Delivery, Delivery pipeline, Release management, Scrum, Kanban DevOps Architecture, DevOps
Workflow DevOps Lifecycle for Business Agility, and Continuous Testing.

UNIT - II
Introduction to project management: The need for source code control, the history of source code
management, Git - A version control tool, Version Control System and Types, CVCS and DVCS.
Git Essentials: Creating repository, Cloning, check-in and committing, Fetch pull and remote, Branching.

UNIT - III
Jenkins - Continuous integration: Introduction to Continuous Integration, Build & Release and relation with
DevOps Why continuous integration, Nodes/Salves, Managing plugins, Managing Software Versions.
Build Tools: Overview of Maven, Virtualization, and Virtualization in DevOps Understand Containers Dockers
- A containerization technology.

UNIT - IV
Testing Tools and automation: Testing Tools and automation: Various types of testing, Automation of
testing Pros and cons, Selenium -Introduction, Selenium features, Testing backend integration points, Test-
driven development, REPL-driven development.
Deployment Tools: Deployment systems, Virtualization stacks, code execution at the client, Puppet master and
agents, Ansible, Deployment tools: Chef, SaltStack.

UNIT - V
Code monitoring and Issue Tracking: Code monitoring tools Nagios, Munin, Ganglia, Log handling.
Introduction to issue trackers, Need of issue tracker: Workflows and issues.
Trackers tools: Bugzilla, GitLab tracker, and Jira.

Text Books:
1. Joakim Verona, “Practical Devops”, Second Edition. Ingram short title; 2nd edition, 2018.
2. Deepak Gaikwad, Viral Thakkar, “DevOps Tools from Practitioner's Viewpoint”. Wiley publications,
2019.
CBIT (A) With effect from the Academic Year 2022-23

Suggested Reading:
1. Len Bass, Ingo Weber, Liming Zhu, “DevOps: A Software Architect's Perspective”. Addison Wesley,
1st Edition, 2015.

Online Resources:
1. https://www.coursera.org/learn/intro-to-devops
2. hhttps://www.tutorialspoint.com/introduction-to-devops/index.asp
CBIT (A) With effect from the Academic Year 2022-23

20CSE11
NATURAL LANGUAGE PROCESSING
(Professional Elective – III)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Artificial Intelligence, Compiler Design.

Course Objectives: The objectives of this course are,

1. To learn the fundamentals of natural language processing.
2. To understand the various text processing techniques in NLP.
3. To understand the role Text Classification Deep Learning for Text Classification techniques of NLP
4. To use Topic Modelling, Case Studies and apply the NLP techniques to IR applications.

Course Outcomes: On successful completion of the course, students will be able to,
1. Understand the basic concepts of Natural language processing pipeline and applications of NLP.
2. Illustrate various text representation techniques in NLP.
3. Analyse text classification techniques and deep learning basics to process natural language text.
4. Explore text summarization methods and example systems.
5. Demonstrate levels of NLP for several case studies.
6. Apply NLP Pipe lines to solve real world applications.

UNIT - I
NLP: A Primer, NLP in the Real World, NLP Tasks, NLP Levels, What Is Language? Building Blocks of
Language, Why Is NLP Challenging? Machine Learning and Overview Approaches to NLP, Heuristics-Based,
Machine Learning, Deep Learning for NLP.
NLP Pipeline: Data Acquisition, Pre-Processing Preliminaries Frequent Steps, Advanced Processing Feature
Engineering Classical NLP/ML Pipeline DL Pipeline Modeling, Evaluation of Models, Post-Modeling Phases.

UNIT - II
Text Representation Vector Space Models Basic Vectorization Approaches, One-Hot Encoding Bag of Words,
Bag of N-Grams, TF-IDF, Distributed Representations, Word Embedding, Going Beyond Words, Distributed
Representations.

UNIT - III
Text Classification Applications One Pipeline, Many Classifiers, Using Neural Embeddings in Text
Classification Deep Learning for Text Classification Interpreting Text Classification Models.
Deep Learning for Text Classification CNNs for Text Classification, LSTMs for Text Classification

UNIT - IV
Topic Modelling Text Summarization, Use Cases Setting Up a Summarizer: An Example Recommender
Systems for Textual Data Machine Translation Question-Answering Systems, Social Media, E-Commerce and
Retail, Healthcare, Finance, and Law.

UNIT - V
Case Study on NLP Pipeline, Text Classification: Ticketing, Ecommerce, Social media, health care,
Recommender systems and other applications of NLP

Text Books:
1. Sowmya Vajjala, Bodhisattwa Majumder, Anuj Gupta & Harshit Surana “Practical Natural Language
Processing: A Comprehensive Guide to Building Real world NLP Systems”, O’Reilly Media, Inc., 1 st
Edition, 2020.
2. James Allen, “Natural Language Understanding”, Bejamin Cummings, 2nd edition, 1995.

Suggested Reading:
1. Tanveer Siddiqui, U.S. Tiwary, “Natural Language Processing and Information Retrieval”, Oxford
University Press, 2008.
CBIT (A) With effect from the Academic Year 2022-23

Online Resources:
1. https://nptel.ac.in/courses/106101007/
2. http://www.cs.colorado.edu/~martin/sp2.html
3. https://web.standford.edu/~jurafsky/sp3/
CBIT (A) With effect from the Academic Year 2022-23

20CSE12
EMBEDDED SYSTEMS
(Professional Elective – III)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Computer architecture and microprocessor, Digital logic design, Programming for problem
solving.

Course Objectives: The objectives of this course are,

1. To be aware of general computing system, embedded system and classification of embedded system.
2. To analyze the core concepts of embedded system and its architecture.
3. To analyze the RTOS for embedded systems.
4. To learn embedded system development environment.
5. To learn to use tools in embedded software development process.

Course Outcomes: On successful of the course student will be able to,

1. Understand the basics of embedded systems.
2. Analyze the core concepts of Embedded System and Embedded System Architecture.
3. Design and develop Embedded System hardware and software using Embedded C.
4. Analyze the operating system for embedded systems.
5. Analyze the embedded system development environment and tools used in embedded software
development process.

UNIT - I
Introduction to Embedded Systems: Embedded Systems, Processor embedded into a system, Embedded
hardware units and devices in a system, Embedded software in a system, Examples of embedded systems,
Design process in Embedded system, Formalization of system design, Design process and design
examples(smart card, digital camera, mobile phone), Classification of Embedded Systems, Skills required for
embedded system designer.

UNIT - II
Inter process communication and synchronization of processes, Threads and Tasks. Multiple processes in an
application, Multiple threads in an application, Tasks, Task states, Task and data, Clear cut distinction between
functions, ISRs and tasks and their characteristics. Concept of semaphores, Shared data, Inter process
communication, Signal function, Semaphore functions, Message queue functions, Mailbox functions, Pipe
functions, Socket functions, RPC functions.

UNIT - III
Real time operating systems: OS services, Process management, Timer functions, Event functions, Memory
management, Device , File, IO subsystems management, Interrupt routine in RTOS environment and handling of
Interrupt source calls, RTOS, RTOS task scheduling models, Interrupt latency, Response of tasks as
performance metrics, OS security issues.

UNIT - IV
8051 interfacing with displays (LED, 7 segment display, LCD), Switch, Relay, Buzzer, D/A and A/D converters,
Stepper motor.
Networked Embedded systems, Serial communication protocols, I2C bus, CAN bus, RS232, Introduction to
advanced architectures: ARM and SHARC.

UNIT - V
Embedded software Development process tools: Introduction to embedded software development process and
tools, Host and Target machines, linking and locating software, Getting embedded software into target system,
Issues in hardware - software design and Co-design.
Testing, simulation and debugging techniques and tools: Testing on host machine, Simulators, Laboratory
tools.
CBIT (A) With effect from the Academic Year 2022-23

Text Books:
1. Raj Kamal, “Microcontrollers: Architecture, Programming, Interfacing and System Design”, Pearson
Education India, 2009.

Suggested Reading:
1. David E. Simon, “An Embedded Software Primer”, Pearson Education, 1999.
2. Wayne Wolf, “Computers as Components: Principles of Embedded Computing System Design”,
Elsevier, 2008.
CBIT (A) With effect from the Academic Year 2022-23

20CAE04
ALGORITHMIC GAME THEORY
(Professional Elective – III)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Linear Algebra and Calculus, Design and analysis of algorithms.

Course Objectives: The objectives of this course are,

1. To understand how to design systems with strategic participants that has good performance guarantees.
2. To understand the study of games from the perspective of algorithms and theoretical computer science.
3. To study the complexity-theoretic hardness of computing equilibria, focusing on Nash equilibria.
4. To study the categories of topics at a basic level: combinatorial games, zero-sum games, non-zero sum
games and cooperative games.
5. To obtain familiarity how to Model and analyze conflicting situations using game theory.

Course Outcomes: On successful of this course student will be able to,

1. Acquire knowledge about the real world problems and formulate mathematical models of these
problems.
2. Identifying the algorithmic Models for finding the optimal solutions for real world examples.
3. Analyze the major limitations and capabilities of game theory problems.
4. Design and analyze problems using game theory approaches.
5. Explore the real world scenarios of economic and algorithmic interactions using game theory solutions.

UNIT - I
Introduction to Stable Matchings, Men-Optimality of the Men-Proposing Gale-Shapley Algorithm, GS:
Cheating, Strategies for Men, GS: Cheating Strategies for Women, Problem, Popular, Strategic Behavior in
Popular Matchings, Stable Roommates: Matchings in the Non-bipartite Setting.

UNIT - II
An Introduction to Voting, The Game of Trust - Nicky Case's Interactive Essay, Arrow's Theorem, Gibbard-
Satterethwaite Theorem, Domain Restrictions and Multi-winner Elections, Incentive Design in Crowd sourcing
Applications, Adversarial Approaches in Deep Learning.

UNIT - III
Algorithmic for computing Market Equilibrium, Tournament fixing and superkings, Tournament Fixing
Parameterized by FAS, Tournament Fixing with Bribery, An Introduction to Cake-Cutting, Envy-Freenes and
Approximate EF, Sperner's Lemma and Applications, Cake Cutting with a Secret Agent, Fairness Notions for
Indivisible Goods.

UNIT - IV
Combinatorial Games: Introduction and examples: N and P positions, Zermelo's Theorem, The game of Hex,
Nim games, Sprague-Grundy Theorem, The Sylver Coinage Game, Zero-Sum Games: Introduction and
examples, Saddle Point Equilibria & the Minimax Theorem, Zero, Mixed Strategies, Properties of Saddle Point
Equilibria.

UNIT - V
Iterated elimination of strictly dominated strategies, Lemke-Howson Algorithm, , Evolutionary Stable Strategies,
Fictitious Play, Brown-Von Neumann-Nash Dynamics, The Nash Bargaining Problem, Transferable Utility
Games, The Core, Characterization of Games with non-empty Core, Shapley Value, The Nucleolus.

Text Books:
1. Noam Nisan, Tim Roughgarden, Eva Tardos, Vijay V. Vazirani (eds), “Algorithmic Game Theory”,
Cambridge University, 2007.
2. Michael Maschler, Eilon Solan, and Shmuel Zamir “Game Theory”, Cambridge University Press, 2013.
3. Y. Narahari “Game Theory and Mechanism Design”, World Scientific, 2015.
4. Martin Osborne, “An Introduction to Game Theory”, Oxford University Press, 2003.
CBIT (A) With effect from the Academic Year 2022-23

5. T. Ferguson, “Game Theory”, Web Notes.

6. Karlin and Peres, “Game Theory”, Alive, AMS.
7. DeVos and Kent, “Game Theory: A Playful Introduction”, AMS

Suggested Reading:
1. Robert Duncan Luce “Games and Decisions: Introduction and Critical Survey” (Dover Books on
Mathematics), Howard Raiffa, 1989.
2. William Spaniel “Game Theory 101: The Complete Textbook”, 2011.
3. John von Neumann, Oskar Morgenstern, “Theory of Games and Economic Behavior”, Princeton Univ.
Press. 2007.

Online Resources:
1. https://nptel.ac.in/courses/128106007
2. https://nptel.ac.in/courses/110101133
3. https://arxiv.org/list/cs.GT/1703
4. https://dl.acm.org/doi/book/10.1145/3241304#secAuthors
CBIT (A) With effect from the Academic Year 2022-23

20CSE13
ADHOC SENSOR NETWORKS
(Professional Elective – III)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Data Communication and Computer Networks, IoT.

Course Objectives: The objectives of this course are,

1. To understand the design issues in ad hoc and sensor networks.
2. To learn the different types of MAC protocols.
3. To be familiar with different types of adhoc routing protocols.
4. To get exposure to the TCP issues in adhoc networks.
5. To learn the architecture and protocols of wireless sensor networks.

Course Outcomes: On successful of the course student will be able to,

1. Explain the concepts, network architectures and applications of ad hoc and WSN.
2. Identify different issues in wireless adhoc and sensor networks.
3. Analyze the protocol design issues of adhoc and sensor networks
4. Design routing protocols for adhoc and WSN with respect to protocol design issues.
5. Evaluate the QoS related performance measurements of adhoc and sensor networks.

UNIT - I
Introduction: Fundamentals of Wireless Communication Technology – The Electromagnetic Spectrum – Radio
propagation Mechanisms – Characteristics of the Wireless Channel -mobile ad hoc networks (MANETs) and
wireless sensor networks (WSNs): concepts and architectures. Applications of Ad Hoc and Sensor networks.
Design Challenges in Ad hoc and Sensor Networks.

UNIT - II
MAC Protocols for AdHoc Wireless Networks: Issues in designing a MAC Protocol- Classification of MAC
Protocols- Contention based protocols-Contention based protocols with Reservation Mechanisms- Contention
based protocols with Scheduling Mechanisms – Multi channel MAC-IEEE 802.11.

UNIT - III
Routing Protocols and Transport Layer In AdHoc Wireless Networks : Issues in designing a routing and
Transport Layer protocol for Ad hoc networks- proactive routing, reactive routing on-demand), hybrid routing-
Classification of Transport Layer solutions-TCP over Ad hoc wireless Networks.

UNIT - IV
Wireless Sensor Networks (WSN) and MAC Protocols: Single node architecture: hardware and software
components of a sensor node – WSN Network architecture: typical network architectures-data relaying and
aggregation strategies -MAC layer protocols: self-organizing, Hybrid TDMA/FDMA and CSMA based MAC-
IEEE 802.15.4.

UNIT - V
WSN Routing, Localization & QoS: Issues in WSN routing – OLSR- Localization – Indoor and Sensor
Network Localization-absolute and relative localization, triangulation-QOS in WSN-Energy Efficient Design-
Synchronization-Transport Layer issues.

Text Books:
1. C. Siva Ram Murthy, and B. S. Manoj, “Ad Hoc Wireless Networks: Architectures and Protocols “,
Prentice Hall Professional Technical Reference, 2008.

Suggested Reading:
1. Carlos De Morais Cordeiro, Dharma Prakash Agrawal “Ad Hoc & Sensor Networks: Theory and
Applications”, World Scientific Publishing Company, 2006.
2. Feng Zhao and Leonides Guibas, “Wireless Sensor Networks”, Elsevier Publication, 2002.
CBIT (A) With effect from the Academic Year 2022-23

3. Holger Karl and Andreas Willig “Protocols and Architectures for Wireless Sensor Networks”, Wiley,
2005.
4. Kazem Sohraby, Daniel Minoli, & Taieb Znati, “Wireless Sensor Networks-Technology, Protocols, and
Applications”, John Wiley, 2007.
5. Anna Hac, “Wireless Sensor Network Designs”, John Wiley, 2003.
CBIT (A) With effect from the Academic Year 2022-23

20CSE14
SOFTWARE QUALITY TESTING
(Professional Elective – III)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Software engineering.

Course Objectives: The objectives of this course are,

1. To understand the basics of testing, test planning &design and test team organization.
2. To study the various types of tests in the life cycle of the software product.
3. To build design concepts for system testing and execution.
4. To learn the software quality assurance, metrics and defect prevention techniques.

Course Outcomes: On successful completion of the course, students will be able to,
1. Perform white-box and black-box tests in the life cycle of the software product.
2. Understand system testing and significance of software reliability.
3. Identify defect prevention techniques and SQA metrics.
4. Apply various techniques and standards of SQA.
5. Reduce potential risks to an acceptable level before they occur.

UNIT - I
Software Testing - Concepts, Issues, and Techniques
Quality Revolution, Verification and Validation, Failure, Error, Fault, and Defect, Objectives of Testing, Testing
Activities, Test Case Selection White-Box and Black ,test Planning and design, Test Tools and Automation,
Power of Test. Test Team Organization and Management-Test Groups, Software Quality Assurance Group,
System Test Team Hierarchy, Team Building.

UNIT - II
System Testing
System Testing - System Integration Techniques-Incremental, Top Down Bottom Up Sandwich and Big Bang,
Software and Hardware Integration, Hardware Design Verification Tests, Hardware and Software Compatibility
Matrix Test Plan for System Integration. Built- in Testing. Functional testing - Testing a Function in Context.
Boundary Value Analysis, Decision Tables. acceptance testing - Selection of Acceptance Criteria, Acceptance
Test Plan, Test Execution Test. software reliability - Fault and Failure, Factors Influencing Software, Reliability
Models

UNIT - III
System Test Categories
System test categories Taxonomy of System Tests, Interface Tests Functionality Tests. GUI Tests, Security
Tests Feature Tests, Robustness Tests, Boundary Value Tests Power Cycling Tests Interoperability Tests,
Scalability Tests, Stress Tests, Load and Stability Tests, Reliability Tests, Regression Tests, Regulatory Tests.
Test Generation from FSM models- State-Oriented Model. Finite-State Machine Transition Tour Method,
Testing with State Verification. Test Architectures-Local, distributed, Coordinated, Remote. System test design-
Test Design Factors Requirement Identification, modeling a Test Design Process Test Design Preparedness,
Metrics, Test Case Design Effectiveness. System test execution- Modeling Defects, Metrics for Monitoring Test
Execution .Defect Reports, Defect Causal Analysis, Beta testing, measuring Test Effectiveness.

UNIT - IV
Software Quality
Software quality - People‘s Quality Expectations, Frameworks and ISO-9126, McCall‘s Quality Factors and
Criteria – Relationship. Quality Metrics. Quality Characteristics ISO 9000:2000 Software Quality Standard.
Maturity models- Test Process Improvement, Testing Maturity Model.

UNIT - V
Software Quality Assurance
CBIT (A) With effect from the Academic Year 2022-23

Quality Assurance - Root Cause Analysis, modeling, technologies, standards and methodologies for defect
prevention. Fault Tolerance and Failure Containment - Safety Assurance and Damage Control, Hazard analysis
using fault-trees and event-trees. Comparing Quality Assurance Techniques and Activities. QA Monitoring and
Measurement, Risk Identification for Quantifiable Quality Improvement. Case Study: FSM-Based Testing of
Web-Based Applications.

Text Books:
1. Kshirasagar Nak Priyadarshi Tripathy, “Software Testing and Quality Assurance-Theory and Practice”,
John Wiley & Sons Inc, 2008.
2. Jeff Tian, “Software Quality Engineering: Testing, Quality Assurance, and Quantifiable Improvement”,
John Wiley & Sons, Inc., Hoboken, New Jersey. 2005.

Suggested Reading:
1. Daniel Galin “Software Quality Assurance - From Theory to Implementation”, Pearson Education Ltd.
UK, 2004.
2. Milind Limaye “Software Quality Assurance”, TMH, New Delhi, 2011.
CBIT (A) With effect from the Academic Year 2022-23

20ECO01
REMOTE SENSING AND GIS
(Open Elective - II)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Prerequisite: Basic knowledge of Geography is required

Course Objectives:
1. Explain the fundamental concepts of remote sensing and digital imaging techniques.
2. Make the students to understand the principles of thermal and microwave remote sensing.
3. Make the students understand the significance of GIS and the process of GIS.

Course Outcomes:
1. Demonstrate the understanding of basic concepts of remote sensing and interpret energy interactions.
2. Choose an appropriate technique for a given scenario by appreciating the types of remote sensing.
3. Distinguish the principle behind the working of microwave and LiDAR sensing.
4. Apply Microwave remote sensing techniques
5. Explain the procedure for encoding data and geospatial data analysis.

UNIT - I
Concept of Remote Sensing: Remote sensing definition, data, process, EM bands used in remote sensing,
Interactions and recording of energy: interaction with atmosphere, interaction with earth surface features (soil,
water, vegetation), recording of energy by sensors, Transmission, reception and processing, Image interpretation
and analysis, Applications, Advantages and limitations of Remote sensing, Orbits of Remote sensing satellites,
Indian remote sensing satellites.

UNIT - II
Digital Imaging: Types of Remote sensing, Sensor resolutions, Digital Image, Sensor components, Principle of
a long-track and across-track scanning, Hyperspectral Imaging, Thermal Remote Sensing.

UNIT - III
Microwave Remote Sensing: Active and Passive Microwave Remote Sensing, Radar Imaging: Key
components of imaging radar, viewing geometry, spatial resolution, principle of RAR, SAR and their range
resolution, Satellite Radar Imaging, LIDAR.

UNIT - IV
Concept of Geographic Information Systems: Key components of GIS, joining spatial and attribute data,
functions, advantages and applications of GIS, Spatial data model, Raster data model, Vector data model.

UNIT - V
Process of GIS and Geospatial analysis: Data sources, encoding raster data, encoding vector data, encoding
attribute data, linking spatial and attribute data, Geospatial data analysis methods database query, geospatial
measurement, overlay operations, network analysis and surface analysis. Integration of GIS and remote sensing.

Text Books:
1. Basudeb Bhatta, “Remote Sensing and GIS”, 2/e, Oxford University Press, 2012.
2. Lillesand T.M., and Kiefer R.W. “Remote Sensing and Image Interpretation”, 6/e, John Wiley &Sons,
2000.

Suggested Reading:
1. James B. Campbell and Randolph H. Wynne, “Introduction to Remote Sensing”, the Guilford Press,
2011.
2. Michael N DeMers, “Fundamentals of GIS”, 2/e, John Wiley, 2008.
CBIT (A) With effect from the Academic Year 2022-23

20MTO01
FINANCIAL MATHEMATICS
(Open Elective - II)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Course Objectives: The objectives of this course are,

1. To explain the terms of financial market and its derivatives including options and futures.
2. To explain the modern portfolio theory.
3. To discuss the pricing theory in discrete time.
4. To explain the stochastic calculus.
5. To discuss the pricing theory in continuous theory.

Course Outcomes: On successful completion of the course, students will be able to

1. Calculate the internal rate of return, annuity and amortization.
2. Apply the portfolio theory.
3. Examine the binomial model of pricing.
4. Analyze the stochastic differential equations.
5. Solve the BSM partial differential equations.

UNIT - I
Introduction to financial markets: Introduction to financial markets, financial instruments, bonds, stocks,
futures & forwards, swaps and options. Time value of money, simple and compound interest rate, net present
value, annuities, Amortization, Bond yield, internal rate of return and annuities. Markowitz portfolio theory, risk
and return, two and multi-asset portfolio theory, minimum variance portfolio, efficient frontier.

UNIT - II
Modern portfolio theory: Capital Asset Pricing Model and portfolio performance analysis. No arbitrage
principle, pricing of forwards and futures, properties of options. Derivative pricing by replication in single and
multi-period binomial model.

UNIT - III
Risk neutral pricing in discrete time: Discrete probability spaces, filtration, conditional expectation. Discrete
time martingales, Markov chain, risk-neutral pricing in binomial model for European and American derivatives.

UNIT - IV
Stochastic Calculus: General probability spaces, conditional expectation, Brownian motion and its properties.
Ito integral, Ito formula, Girsanov’s theorem, martingale representation theorem, stochastic differential equation.

UNIT - V
Risk neutral pricing in continuous time:-Black Scholes-Merton (BSM) model, pricing of European
derivatives in BSM framework. Valuation of European options in BSM model, BSM formula, BSM partial
differential equation, hedging, model completeness, and fundamental theorems of asset pricing.

Text Books:
1. Ales Cerny “Mathematical Techniques in Finance: Tools for Incomplete Markets”. Princeton
University Press, 2009.
2. Luenberger, David G. “Investment Science”, Oxford University Press. Delhi, 1998.

Suggested Reading:
1. Hull, J. C., &Basu, S. “Options, Futures and Other Derivatives” 7th Edition Pearson Education. New
Delhi, 2010.
2. S. R. Pliska “Introduction to Mathematical Finance: Discrete Time Models”. Blackwell Publishers Inc.,
2002.
3. Ross, Sheldon M. “An elementary Introduction to Mathematical Finance” 3rd Edition, Cambridge
University Press. USA, 2011.
CBIT (A) With effect from the Academic Year 2022-23

20EEO02
ENERGY MANAGEMENT SYSTEMS
(Open Elective - II)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Prerequisites: Students should have prior knowledge on different energy generation systems, basic idea about
audit instruments.

Course Objectives: The objectives of this course are,

1. To know the concept of Energy Management.
2. To understand the formulation of efficiency for various Engineering Systems
3. To enable the students to develop managerial skills to assess feasibility of alternative approaches and
drive strategies regarding Energy Management

Course Outcomes: After completion of this course, students will be able to,
1. Know the current Energy Scenario and importance of Energy Conservation.
2. Understand the concepts of Energy Management, Energy Auditing.
3. Interpret the Energy Management methodology, Energy security and Energy Strategy.
4. Identify the importance of Energy Efficiency for Engineers and explore the methods of improving
Energy Efficiency in mechanical systems, Electrical Engineering systems
5. Illustrate the Energy Efficient Technologies in Civil and Chemical engineering systems

UNIT - I
Various form of Energy and its features: Electricity generation methods using different energy sources such
as Solar energy, wind energy, Bio-mass energy, and Chemical energy such as fuel cells. Energy Scenario in
India, Impact of Energy on economy, development, and environment sectors of national and international
perspective.

UNIT - II
Energy Management-I: Defining Energy Management, need for Energy Management, Energy management
techniques, importance of Energy Management, managing the Energy consumption, Energy Audit and Types,
Energy Audit Instruments.

UNIT - III
Energy Management-II: understanding Energy costs, bench marking, Energy performance, matching energy
use to requirement, optimizing the input, fuel & Energy substitution, material and Energy balance diagrams,
Energy pricing, Energy and Environment, Energy Security.

UNIT - IV
Energy Efficient Technologies-I:Importance of Energy Efficiency for Engineers, Energy Efficient Technology
in Mechanical engineering: Compressed Air System, Heating, ventilation and air- conditioning, Fans and
blowers, Pumps and Pumping Systems,
Energy Efficient Technology in Electrical engineering: Automatic Power Factor Controllers, Energy Efficient
Motors, soft starters with energy saver, variable speed drives, energy efficient transformers, electronic ballast,
occupancy sensors, energy efficient lighting controls, space cooling, energy efficiency of lifts and escalator,
energy saving potential of each technology.

UNIT - V
Energy Efficient Technologies-II: Energy Efficient Technology in Civil Engineering: Intelligent Buildings,
And Various Energy Efficiency Rating Systems for Buildings, Green Buildings Energy Efficiency: management
of green buildings, importance of embodied energy in selection of sustainable materials, green building design,
waste reduction/recycling, rainwater harvesting, maintenance of the green buildings, green building certification,
Renewable energy applications.
Energy Efficient Technology in Chemical Engineering: Green chemistry, Low carbon cements, recycling
paper.
CBIT (A) With effect from the Academic Year 2022-23

Text Books:
1. Umesh Rathore, 'Energy Management', Kataria publications, 2nd ediiton, 2014.
2. G Hariharaiyer, “Green Building Fundamentals”, Notion press.com.
3. K V Shama, P Venkataseshaiah, "Energy management and conservation", I. K. International
Publishing agency pvt. ltd., 2011.

Suggested Reading:
1. Guide books for National Certification Examination for Energy Manager / Energy Auditors Book-1,
General Aspects.
2. Hargroves, K., Gockowiak, K., Wilson, K., Lawry, N., and Desha, C. (2014) An Overview of Energy
Efficiency Opportunities in Mechanical/civil/electrical/chemical Engineering, The University of
Adelaide and Queensland University of Technology.
3. Success stories of Energy Conservation by BEE, New Delhi (www.bee-india.org).
CBIT (A) With effect from the Academic Year 2022-23

20EGO01
TECHNICAL WRITING SKILLS
(Open Elective - II)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Course Objectives: The objectives of this course are,

1. Process of communication and channels of communication in general writing and technical writing in
particular.
2. Learn Technical Writing including sentence structure and be able to understand and use technology
specific words.
3. Write business letters and technical articles.
4. Write technical reports and technical proposals.
5. Learn to write agenda, record minutes of a meeting, draft memos. Understand how to make technical
presentations.

Course Outcomes: On successful completion of the course, students will be able to

1. Communicate effectively, without barriers and understand aspects of technical communication.
2. Differentiate between general writing and technical writing and write error free sentences using
technology specific words
3. Apply techniques of writing in business correspondence and in writing articles.
4. Draft technical reports and technical proposals.
5. Prepare agenda and minutes of a meeting and demonstrate effective technical presentation skills.

UNIT - I
Communication – Nature and process.
Channels of Communication – Downward, upward and horizontal communication. Barriers to communication.
Technical Communication – Definition, oral and written communication. Importance and need for Technical
communication. Nature of Technical Communication. Aspects and forms of Technical communication.
Technical communication Skills – Listening, Speaking, Reading & Writing.

UNIT - II
Technical Writing – Techniques of writing. Selection of words and phrases in technical writing. Differences
between technical writing and general writing. Abstract and specific words. Sentence structure and requisites of
sentence construction. Paragraph length and structure.

UNIT - III
Business correspondence – Sales letters, letters of Quotation, Claim and Adjustment letters.
Technical Articles: Nature and significance, types. Journal articles and Conference papers, elements of
technical articles.

UNIT - IV
Technical Reports: Types, significance, structure, style and writing of reports. Routine reports, Project reports.
Technical Proposals: Definition, types, characteristics, structure and significance.

UNIT - V
Mechanics of Meetings: Preparation of agenda, participation, chairing and writing minutes of a meeting.
Memorandum. Seminars, workshops and conferences.
Technical Presentations : Defining purpose, audience and locale, organizing content, preparing an outline, use
of Audio Visual Aids, nuances of delivery, importance of body language and voice dynamics.

Text Books:
1. Meenakshi Raman & Sangeeta Sharma, “Technical Communications-Principles and Practice”, Oxford
University Press, Second Edition, 2012.
2. M Ashraf Rizvi, “Effective Technical Communication”, Tata McGraw Hill Education Pvt Ltd, 2012.
CBIT (A) With effect from the Academic Year 2022-23

Suggested Reading:
1. Kavita Tyagi, Padma Misra, “Basic Technical Communication”, PHI Learning Pvt Ltd, 2012.
2. R.C Sharma, Krishna Mohan, “Business Correspondence and Report Writing”, Tata McGraw Hill,
2003

Online Resources:
1. https://onlinecourses.nptel.ac.in/noc18_mg13/preview
2. https://www.technical-writing-training-and-certification.com/
3. https://academy.whatfix.com/technical-writing-skills
CBIT (A) With effect from the Academic Year 2022-23

20CEO02
DISASTER RISK REDUCTION AND MANAGEMENT
(Open Elective - II)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Course Outcomes: On successful completion of the course, students will be able to

1. Identify and understand the concepts of hazards, causes and impacts of disasters.
2. Develop a critical capacity to evaluate the principles and practices of disaster risk reduction and
management;
3. Develop a deep awareness of disaster resilience, risk mitigation, and recovery policies as they arise
from natural hazards around the globe;
4. Apply knowledge about existing global frameworks and existing agreements and role of community in
successful Disaster Risk Reduction
5. Evaluate DM study including data search, analysis and presentation as a case study.

UNIT - I
- Hazard and disaster-concepts, vulnerability and risk.
- Hazard and disaster type – Natural, Water- related, pandemic and Human induced hazards disasters.
- Causes and Impacts of disasters – Impacts on natural eco systems: physical, psychological and social
impact.
- Disaster and financial resilience.
- GIS and remote sensing.
- Disaster vulnerability profile of India –Specific to geographical regions and states (as per regional
significance).

UNIT - II
- Disaster Management Cycle –Rescue, Relief, Rehabilitation, Prevention, Mitigation and Preparedness.
- Disaster risk reduction {DRR) –Community based DRR, institutions concerned with safety, disaster
mitigation and construction techniques as per Indian standards.
- Early warning systems.

UNIT - II
- Trauma and stress management.
- First aid and emergency procedures.
- Awareness generation strategies for the community on safe practises in disaster (as per regional
significance).

UNIT - II
- Components of disaster management –preparedness of rescue and relief, mitigation, rehabilitation
&reconstruction.
- Institutional frame work of disaster management in India (NDMA-SDMA, NDRF, Civic volunteers,
NIDM).
- Phases of disaster/risk management and post-disaster responses.
- Compensation and insurance.
- Applications of remote sensing and GIS in disaster management.

UNIT - V
- Capacity building for disaster/damage mitigation (structural and non-structural measures).
- Disaster risk reduction strategies and national disaster management guidelines.
- Disaster management Act -2005.
- Regional issues as per regional requirement/university can take minimum two topics as per high
powered committee.

Text Books:
1. Singh R. “Disaster management Guidelines for Earth quakes, Landslides, Avalanches and Tsunami”.
Horizon Press publications, (2017).
CBIT (A) With effect from the Academic Year 2022-23

2. Taimpo, “Disaster management and preparedness”. CRC Press Publications, 2016.

3. Nidhi, G.D., “Disaster management preparedness” .CBS Publications Pvt. Ltd, 2014.
4. Gupta, A.K.,Nair, S.S., Shiraz, A. and Dey, S., “Flood Disaster Risk Management-CBS Publications
Pvt Ltd., 2013.
5. Singh, R., “Disaster management Guidelines for Natural Disasters” Oxford University Press Pvt. Ltd.,
2016.
CBIT (A) With effect from the Academic Year 2022-23

20EGMO3
UNIVERSAL HUMAN VALUES-II: UNDERSTANDING HARMONY
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Introduction
This course discusses the role of human values in one’s family, in society and in nature. In the Induction
Program, students would get an initial exposure to human values through Universal Human Values–I. This
exposure is to be augmented by this compulsory full semester foundation course.

Course Objectives: The objectives of this course are,

1. Development of a holistic perspective based on self-exploration about themselves (human being),
family, society and nature/existence.
2. Understanding (or developing clarity) of the harmony in human being, family, society and
nature/existence.
3. Strengthening of self-reflection.
4. Development of commitment and courage to act.

Course Outcomes: On successful completion of the course, students will be able to

1. Students are expected to become more aware of themselves, and their surroundings (family, society,
nature)
2. They would become more responsible in life, and in handling problems with sustainable solutions,
while keeping human relationships and human nature in mind.
3. They would have better critical ability.
4. They would also become sensitive to their commitment towards what they have understood (human
values, human relationship and human society).
5. It is hoped that they would be able to apply what they have learnt to their own self in different day-to-
day settings in real life, at least a beginning would be made in this direction.

The course has 28 lectures and 14 practice sessions:

UNIT - I
Course Introduction - Need, Basic Guidelines, Content and Process for Value Education
 Purpose and motivation for the course, recapitulation from Universal Human Values-I
 Self-Exploration–what is it? - Its content and process; ‘Natural Acceptance’ and Experiential
Validation- as the process for self-exploration
 Continuous Happiness and Prosperity- A look at basic Human Aspirations
 Right understanding, Relationship and Physical Facility- the basic requirements for fulfilment of
aspirations of every human being with their correct priority
 Understanding Happiness and Prosperity correctly- A critical appraisal of the current Scenario
 Method to fulfil the above human aspirations: understanding and living in harmony at various levels.

Include practice sessions to discuss natural acceptance in human being as the innate acceptance for living with
responsibility (living in relationship, harmony and co-existence) rather than as arbitrariness in choice based on
liking-disliking.

UNIT – II
Understanding Harmony in the Human Being - Harmony in Myself
 Understanding human being as a co-existence of the sentient ‘I’ and the material ‘Body’
 Understanding the needs of Self (‘I’) and ‘Body’ - happiness and physical facility
 Understanding the Body as an instrument of ‘I’ (I being the doer, seer and enjoyer)
 Understanding the characteristics and activities of ‘I’ and harmony in ‘I’
 Understanding the harmony of I with the Body: Sanyam and Health; correct appraisal of Physical
needs, meaning of Prosperity in detail
 Programs to ensure Sanyam and Health.
CBIT (A) With effect from the Academic Year 2022-23

Include practice sessions to discuss the role others have played in making material goods available to me.
Identifying from one’s own life. Differentiate between prosperity and accumulation. Discuss program for
ensuring health vs dealing with disease

UNIT – III
Understanding Harmony in the Family and Society- Harmony in Human- Human Relationship
 Understanding values in human-human relationship; meaning of Justice (nine universal values in
relationships) and program for its fulfilment to ensure mutual happiness; Trust and Respect as the
foundational values of relationship
 Understanding the meaning of Trust; Difference between intention and competence
 Understanding the meaning of Respect, Difference between respect and differentiation; the other salient
values in relationship
 Understanding the harmony in the society (society being an extension of family): Resolution,
Prosperity, fearlessness (trust) and co -existence as comprehensive Human Goals
 Visualizing a universal harmonious order in society- Undivided Society, Universal Order- from family
to world family.

Include practice sessions to reflect on relationships in family, hostel and institute as extended family, real life
examples, teacher-student relationship, goal of education etc.
Gratitude as a universal value in relationships. Discuss with scenarios. Elicit examples from students’ lives

UNIT – IV
Understanding Harmony in the Nature and Existence - Whole existence as Coexistence
 Understanding the harmony in the Nature
 Interconnectedness and mutual fulfilment among the four orders of nature - recyclability and self-
regulation in nature
 Understanding Existence as Co-existence of mutually interacting units in all - pervasive space
 Holistic perception of harmony at all levels of existence.

Include practice sessions to discuss human being as cause of imbalance in nature (film “Home” can be used),
pollution, depletion of resources and role of technology etc.

UNIT – V
Implications of the above Holistic Understanding of Harmony on Professional Ethics
 Natural acceptance of human values
 Definitiveness of Ethical Human Conduct
 Basis for Humanistic Education, Humanistic Constitution and Humanistic Universal Order
 Competence in professional ethics: a. Ability to utilize the professional competence for augmenting
universal human order b. Ability to identify the scope and characteristics of people friendly and eco-
friendly production systems, c. Ability to identify and develop appropriate technologies and
management patterns for above production systems.
 Case studies of typical holistic technologies, management models and production systems
 Strategy for transition from the present state to Universal Human Order: a. At the level of individual: as
socially and ecologically responsible engineers, technologists and managers b. At the level of society:
as mutually enriching institutions and organizations.

Include practice Exercises and Case Studies will be taken up in Practice (tutorial) Sessions eg. To discuss the
conduct as an engineer or scientist etc.

Mode of Conduct (L-T-P-C 2-1-0-3)

 Lecture hours are to be used for interactive discussion, placing the proposals about the topics at hand
and motivating students to reflect, explore and verify them. Tutorial hours are to be used for practice
sessions.
 While analysing and discussing the topic, the faculty mentor’s role is in pointing to essential elements
to help in sorting them out from the surface elements. In other words, help the students explore the
important or critical elements.
 In the discussions, particularly during practice sessions (tutorials), the mentor encourages the student to
connect with one’s own self and do self-observation, self-reflection and self- exploration.
CBIT (A) With effect from the Academic Year 2022-23

 Scenarios may be used to initiate discussion. The student is encouraged to take up “ordinary” situations
rather than” extra-ordinary” situations. Such observations and their analyses are shared and discussed
with other students and faculty mentor, in a group sitting.
 Tutorials (experiments or practical) are important for the course. The difference is that the laboratory is
everyday life, and practicals are how you behave and work in real life. Depending on the nature of
topics, worksheets, home assignments and/or activities are included.
 The practice sessions (tutorials) would also provide support to a student in performing actions
commensurate to his/her beliefs. It is intended that this would lead to development of commitment,
namely behaving and working based on basic human values.

This course is to be taught by faculty from every teaching department, including HSS faculty.

Teacher preparation with a minimum exposure to at least one 8-day FDP on Universal Human Values
is deemed essential.

Assessment:
This is a compulsory credit course. The assessment is to provide a fair state of development of the student,
so participation in classroom discussions, self- assessment, peer assessment etc. will be used in evaluation.

Example:
Assessment by faculty mentor: 10 marks
Self-assessment/Assessment by peers: 10 M
Socially relevant project/Group Activities/Assignments: 20 marks
Semester End Examination: 60 marks
The overall pass percentage is 40%. In case the student fails, he/she must repeat the course.

Text Books:
1. R R Gaur, R Asthana, G P Bagaria, “A Foundation Course in Human Values and Professional Ethics”,
2nd Revised Edition, Excel Books, New Delhi, 2019. ISBN 978-93-87034-47-1

The Teacher’s Manual:

1. R R Gaur, R Asthana, G P Bagaria, “Teachers’ Manual for A Foundation Course in Human Values and
Professional Ethics”, 2nd Revised Edition, Excel Books, New Delhi, 2019. ISBN 978-93-87034-53-2

Suggested Reading:
1. A Nagaraj Jeevan Vidya: Ek Parichaya, Jeevan Vidya Prakashan, Amar kantak, 1999.
2. A. N. Tripathi, “Human Values”, New Age Intl. Publishers, New Delhi, 2004.
3. Cecile Andrews, Slow is Beautiful
4. Gandhi - Romain Rolland (English)
5. Dharampal, “Rediscovering India”
6. E. FSchumacher. “Small is Beautiful”
7. J. C. Kumarappa “Economy of Permanence”
8. Pandit Sunderlal “Bharat Mein Angreji Raj”
9. Mohandas Karamchand Gandhi “The Story of My Experiments with Truth”
10. 10.Mohandas K. Gandhi, “Hind Swaraj or Indian Home Rule”
11. Maulana Abdul Kalam Azad, India Wins Freedom.
12. Vivekananda - Romain Rolland (English)
13. The Story of Stuff
CBIT (A) With effect from the Academic Year 2022-23

20CSC28
COMPILER DESIGN LAB
Instruction 2 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 50 Marks
Continuous Internal Evaluation 50 Marks
Credits 1

Pre-requisites: Data Structures, Design and analysis of algorithms, Formal language and automata theory.

Course Objectives: The objectives of this course are,

1. To define the rules for implementing lexical analyzer and to understand the concepts behind the
working of compiler tools: Lex, Turbo C, Yacc.
2. To analyze and apply regular grammar for various source statements expression.
3. To implement front end of the compiler by means of generating intermediate codes, implement code
optimization techniques and error handling.

Course Outcomes: On successful completion of the course, students will be able to

1. Implement the rules for the analyzing phases of a compiler.
2. Apply various Syntax techniques on grammars to build the parsers.
3. Generate various intermediate code representations for source code.
4. Explore error recovery strategies and implement code optimization, code generation phases.
5. Examine the concepts of compiler tools: Lex, FlexVision, Yacc, Turbo C.

List of Programs:
1. Tokenization – By constructing DFA of Lexical Analyzer.
2. Writing a scanner application using (Tools: Jlex / JFlex / Lex).
3. Implementing parser for small language.
4. Implementing Parser with scanner or Without Scanner.
5. Implementing parser with Scanner, without Scanner or with yacc/byson generators.
6. Program to generate predictive LL1 parsing table for the Expression grammar.
7. Implementation of the language to an intermediate form (e.g. three-address code).
8. Generation of target code (in assembly language).
9. Target Code improvement with help of optimization techniques.
10. Implement Mini Compiler with Phases.

Text Books:
1. Keith D Cooper & Linda Tarezon, “Engineering a Compiler”, Morgan Kafman, Second edition, 2004.
2. John R Levine, Tony Mason, Doug Brown “Lex &Yacc”, 3rd Edition Shroff Publisher, 2007.

Suggested Reading:
1. Kenneth C Louden, “Compiler Construction: Principles and Practice”, Cengage Learning, 2005.
2. John R Levine,”Lex&Yacc”, Oreilly Publishers, 2nd Edition, 2009.
CBIT (A) With effect from the Academic Year 2022-23

20CSC29
ARTIFICIAL INTELLIGENCE LAB
Instruction 2 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 50 Marks
Continuous Internal Evaluation 50 Marks
Credits 1

Pre-requisites: Artificial Intelligence.

Course Objectives: The objectives of this course are,

1. To design and analyze various computing algorithms and techniques using Python.
2. To apply different learning algorithms to solve real time problems.
3. To recognize the underlying mathematical models and logics behind various AI techniques.

Course Outcomes: On successful completion of the course, students will be able to,
1. Understand the basic components of library environment and installations.
2. Analyze the design heuristics and apply various techniques to solve real world problems.
3. Apply variety of algorithms to solve problems.
4. Identify how to use GitHub and submit back genuine contributions.
5. Implement problems using game search algorithms.

Lab Experiments:
1. Design/construct the workflow of a general AI project using draw.io
2. Implement Water Jug Problem using A* search
3. Implement an 8-puzzle solver using Heuristic search technique.
4. Implement the Constraint Satisfaction problem using backtracking.
5. Implement a program for game search.
6. Implement a Bayesian network from a given data and infer the data from that Bayesian network.
7. Implement a MDP to run value and policy iteration in any environment.
8. Understanding of GitHub and conda environments.
9. Use the GitHub packages and libraries to frame a standard project and commit back to GitHub.

Text Books:
1. Stuart Russell and Peter Norvig, “Artificial Intelligence: A Modern Approach”, 3rd Edition, Prentice Hall,
2010.
2. Elaine Rich and Kevin Knight, “Artificial Intelligence”, Tata McGraw Hill, 3rd Edition, 2017.

Suggested Reading:
1. Trivedi, M.C., “A Classical Approach to Artificial Intelligence”, Khanna Publishing House, Delhi, 2018.
2. Saroj Kaushik, “Artificial Intelligence”, Cengage Learning India, 2011.

Online Resources:
1. https://nptel.ac.in/courses/106105077
2. https://nptel.ac.in/courses/106106126
3. https://aima.cs.berkeley.edu
4. https://ai.berkeley,edu/project_overview.html
CBIT (A) With effect from the Academic Year 2022-23

20CSE15
SOFT COMPUTING LAB
(Professional Elective – II)
Instruction 2 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 50 Marks
Continuous Internal Evaluation 50 Marks
Credits 1

Pre-requisites: Fundamental Mathematics, Artificial Intelligence, soft computing.

Course Objectives: The objectives of this course are,

1. To illustrate the concepts of simple neuron.
2. To learn the fundamentals of Neural Networks, Feed Forward Networks, Associative Memories &
ANN.
3. To understand the basic concepts and its design of Fuzzy Logic Systems and Genetic Algorithms.

Course Outcomes: On successful completion of the course, students will be able to,
1. Implement McCulloh-Pitts model for Boolean operations.
2. Apply perceptron learning algorithm for a given problem.
3. Design and analyze various Neural Networks Architectures.
4. Apply concepts of fuzzy sets on real-time applications.
5. Implement Genetic Algorithms with its operators.
6. Apply soft computing strategies for various real time applications.

List of Experiments:
1. Implementation of Simple Neural Network (McCulloh-Pitts model) for realizing AND Operation and
OR operation.
2. Implementation of Perceptron network for realizing OR and NAND operation.
3. Implementation of ANDNOT using ADALINE network.
4. Implementation of XOR problem using MADALINE network.
5. Design and implementing the Back Propagation Algorithm for training a non-linear network.
6. Implementation of Bidirectional Associative Memory (BAM) network.
7. Implementation of Hopfield Network.
8. Implementation of Membership Functions in Fuzzy Sets.
9. Implementation of Kohonen Self-Organizing Feature Maps (KSOFM) network for Clustering.
10. Implement the Genetic Algorithm for Traveling Salesman Problem.

Textbooks:
1. S.N. Sivanandam & S.N. Deepa, “Principles of soft computing”, Wiley publications, 2nd Edition, 2011.

Suggested Reading:
1. D.K Prathikar, “Soft Computing”, Narosa Publishing House, New Delhi, 2008.
2. S.N.Sivanandam, S.N.Deepa “Principles of Soft Computing” Second Edition, Wiley Publication 2016.
3. Satish Kumar, "Neural Networks -A classroom approach"; Second Edition, TMH, 2017.

Online Resources:
1. https://onlinecourses.nptel.ac.in/noc22_cs54/preview
CBIT (A) With effect from the Academic Year 2022-23

20CSE16
INTERNET OF THINGS LAB
(Professional Elective – II)
Instruction 2 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 50 Marks
Continuous Internal Evaluation 50 Marks
Credits 1

Pre-requisites: Computer architecture and microprocessor, Programming for problem solving.

Course Objectives: The objectives of this course are,

1. To understand the basics of IoT and its components.
2. To impart practical knowledge on IoT applications.
3. To develop skills required for building real-time IoT based projects.

Course Outcomes: On successful completion of the course, students will be able to,
1. Use of various hardware and software IoT components.
2. Perform experiments by Interfacing I/O devices, sensors to Raspberry Pi/Arduino.
3. Understand and analyze communication protocols in IoT.
4. Monitor data and controlling of devices.
5. Develop Real time IoT based projects.

List of Experiments:
1. Introduction to IoT equipments and perform necessary software installation.
2. Write a program to interface LED/Buzzer with Arduino and to turn ON LED for 1sec after every 2
seconds.
3. Write a program to interface Digital sensor PIR with Arduino and to turn ON LED when motion
detected.
4. Write a program to interface DHT22 sensor with Arduino and display temperature and humidity
readings.
5. Write a program to interface motor using relay with Raspberry Pi. Turn ON motor when the
temperature is high.
6. Write a program to interface LCD with Raspberry Pi and print temperature and humidity readings on it.
7. Write a program to interface flame/smoke sensor with Arduino /Raspberry Pi and give an alert message
when flame/smoke is detected.
8. Implement any case study using Arduino/Raspberry Pi.

Text Books:
1. Arshdeep Bahga and Vijay Madisetti, "Internet of Things: A Hands-on Approach", Universities Press,
2014.

Suggested Reading:
1. Dr. SRN Reddy, Rachit Tirnkral and Manasi Mishra, "Introduction to Internet of Things: A practical
Approach", ETI Labs, 2018.
2. Adrian McEwen, "Designing the Internet of Things", Wiley, 2013.
3. Raj Kamal, “Internet of Things:Architecture and Design”, McGraw Hill, 2017.
4. Cuno Pfister, "Getting Started with the Internet of Things", 0 Reilly Media, 2011.
5. O. Vermesan, P. Friess, “Internet of Things – Converging Technologies for Smart Environments and
Integrated Ecosystems”, River Publishers, Series in Communications, 2013.

Online Resources / Weblinks / NPTEL Courses:

1. Li Da Xu, Wu He, and Shancang Li, “Internet of Things in Industries: A Survey “, IEEE Transactions
on Industrial Informatics, Vol. 10, No. 4, Nov. 2014.
2. T. Winter, P. Thubert, A. Brandt, J. Hui, R. Kelsey, P. Levis, K. Pister, R. Struik, JP. Vasseur, R.
Alexander, “RPL: IPv6 Routing Protocol for Low‐Power and Lossy Networks”, IETF, Standards
Track, Mar. 2012.
3. Z. Shelby, K. Hartke, C. Bormann, “The Constrained Application Protocol (CoAP)”, Internet
Engineering Task Force (IETF), Standards Track, 2014.
CBIT (A) With effect from the Academic Year 2022-23

4. L.Fenzel, “What’s The Difference Between IEEE 802.15.4 And ZigBee Wireless?”,Electronic Design
(Online), Mar. 2013.
5. S. N. Das and S. Misra, "Information theoretic self‐management of Wireless Sensor Networks",
Proceedings of NCC 2013.
6. F. Luo et al., "A Distributed Gateway Selection Algorithm for UAV Networks," in IEEE Transactions
on Emerging Topics in Computing, vol. 3, no. 1, pp. 22‐33, March 2015.
CBIT (A) With effect from the Academic Year 2022-23

20CSE17
FULL STACK DEVELOPMENT LAB
(Professional Elective – II)
Instruction 2 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 50 Marks
Continuous Internal Evaluation 50 Marks
Credits 1

Pre-requisites: Internet and web technologies, OOPs, Database management systems.

Course Objectives: The objectives of this course are,

1. To acquire knowledge on MongoDB, ReactJS, Express, Node.js and Angular2 to develop web
applications.
2. Ability to develop dynamic web content using web frameworks.
3. To understand the design and development process of a complete web application.

Course Outcomes: On successful completion of the course, students will be able to,
1. Prepare database connections with application servers.
2. Design user interfaces using ReactJS.
3. Construct strong expertise on Express framework to develop responsive web applications.
4. Create server side applications using Node.js
5. Develop SPA using Angular 2.
6. Invent next culture-shifting web applications.

List of Programs:
1. Installation, configuration and connection establishment of MongoDB.
2. CRUD operations on MongoDB.
3. Building and Deploying React App.
4. Demonstration of component intercommunication using ReactJS
5. Create Express application,
6. Demonstration of authentication and authorization using Express.
7. Data access using Node.js
8. Create a form to edit the data using Angular2
9. A case study on a single platform for all financial data for NSE India.

Textbook:
1. Amos Q. Haviv, MEAN Web Development, Second Edition, Packt Publications, November 2016
2. Vasan Subramanian, “Pro MERN Stack, Full Stack Web App Development with Mongo, Express,
React, and Node”, 2nd Edition, APress.

Suggested Reading:
1. Shelly Powers, “Learning Node: Moving to the Server-Side”, 2nd Edition, O’REILLY, 2016.
2. Simon D. Holmes and Clive Harber, “Getting MEAN with Mongo, Express, Angular, and Node”,
Second Edition, Manning Publications, 2019.
3. Brad Dayley, “Node.js, MongoDB and Angular Web Development”, 2nd Edition, Addison-Wesley
Professional, 2017.

Online Resources:
1. https://www.mongodbtutorial.org/mongodb-crud/
2. https://reactjs.org/tutorial/tutorial.html
3. https://www.javatpoint.com/expressjs-tutorial
4. https://www.javatpoint.com/nodejs-tutorial
5. https://angular-training-guide.rangle.io/
CBIT (A) With effect from the Academic Year 2022-23

20CSE18
MACHINE LEARNING LAB
(Professional Elective – II)
Instruction 2 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 50 Marks
Continuous Internal Evaluation 50 Marks
Credits 1

Pre-requisites: Artificial Intelligence, Machine learning.

Course Objectives: The main objectives of this course are,

1. To make use of Data sets in implementing the machine learning algorithms.
2. To implement the machine learning concepts and algorithms.
3. Make use of real world data to implement machine learning models.

Course Outcomes: On Successful completion of this course, student will be able to,
1. Identify the fundamental issues and challenges of machine learning: data, model selection, model
complexity, etc.
2. Identify and utilize modern tools that are useful for data analysis
3. Recognize and implement appropriate model parameters for machine learning techniques.
4. Implement and evaluate various Machine Learning approaches.
5. Apply Keras and Tensorflow to implement ML algorithms.
6. Design and develop solutions to real world problems using ML algorithms.

List of Experiments:
1. Identification and Installation of python environment towards the machine learning, installing python
modules/Packages Import scikitlearn, keras and tensorflows etc.
2. Build linear regression model using gradient descent, least squares, polynomial, LASSO and RIDGE
approaches also compare all the algorithms and draw a table for all the metrics.
3. Demonstration of decision tree based ID3 algorithm. Use an appropriate data set for building the
decision tree and apply this knowledge to classify a new sample.
4. Demonstration of Logistic Regression for a sample training data set stored as a .CSV file. Calculate the
accuracy, precision, and recall for your dataset.
5. Demonstration of Naïve Bayesian classifier for a sample training data set stored as a .CSV file.
Calculate the accuracy, precision, and recall for your dataset.
6. Build the decision tree classifier compare its performance with ensemble techniques like random forest,
bagging, boosting and voting Demonstrate it with different decision trees.
7. Implementation of Gradient Descent Algorithm using Tensorflow.
8. Case study on supervised learning algorithms.
9. Demonstration of clustering algorithms - k-Means, Agglomerative and DBSCAN to classify for the
standard datasets.

Text Books:
1. Giuseppe Bonaccorso, “Machine Learning Algorithms”, Packt Publishing, 2017.
CBIT (A) With effect from the Academic Year 2022-23

20CSE19
DEVOPS LAB
(Professional Elective – II)
Instruction 2 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 50 Marks
Continuous Internal Evaluation 50 Marks
Credits 1

Pre-requisites: Database management systems, Operating systems, OOPs.

Course Objectives: The objectives of this course are,

1. To explore the fundamental concepts in Project Life Cycle.
2. To develop skills using tools of DevOps.
3. To examine the application development with different automation tools.

Course Outcomes: On successful completion of this course, students will be able to,
1. Understand the phases of the software development life cycle.
2. Examine the different version control systems.
3. Recognize the importance of the build and deployment tools and test the software application.
4. Deployment of application in production environment.
5. Summaries the software configuration management.
6. Synchronize and provisioning using Puppet and Ansible.

List of Experiments:
1. Git installation and create a repository and perform fetch, pull, branching operations.
2. Jenkins Installation and implement continues Integration and Continues deployment, build a job using
Jenkins.
3. To install and configure Docker for creating containers of different Operating System (Virtualization
Concept)
4. Deployment Tool (Team City /Ansible) Install Docker and execute commands in a Docker and deploy
the application in to Docker file
5. Test the Application using selenium tool.
6. Configuring and establish Connection between Agent and Master using Puppet
7. Install code monitoring tools ex: Nagios..Perform operations
8. Install issue tracker and monitor the workflow of any application and track the issues JIRA tool (Agile
management tool)

Text Books:
1. Joakim Verona. “Practical Devops”, Second Edition. Ingram short title; 2nd edition, 2018.
2. Deepak Gaikwad, Viral Thakkar, “DevOps Tools from Practitioner's Viewpoint”. Wiley publications,
2019.

Suggested Reading:
1. Len Bass, Ingo Weber, Liming Zhu, “DevOps: A Software Architect's Perspective”. Addison Wesley,
1st Edition, 2015.

Online Resources:
1. https://www.coursera.org/learn/intro-to-devops
2. https://www.tutorialspoint.com/introduction-to-devops/index.asp
CBIT (A) With effect from the Academic Year 2022-23

20EGCO3
EMPLOYABILITY SKILLS
Instruction 2 Hours per week
Duration of End Examination 2 Hours
Semester End Examination 50 Marks
Continuous Internal Evaluation 50 Marks
Credits 1

Course Objectives: The objectives of this course are,

1. Learn the art of communication, participate in group discussions and case studies with confidence and
to make effective presentations.
2. With- resume packaging, preparing them to face interviews.
3. Build an impressive personality through effective time management, leadership qualities, self-
confidence and assertiveness.
4. Understand professional etiquette and to make them learn academic ethics and value system.
5. To be competent in verbal aptitude.

Course Outcomes: On successful completion of this course, students will be able to,
1. Become effective communicators, participate in group discussions with confidence and be able to make
presentations in a professional context.
2. Write resumes, prepare and face interviews confidently.
3. Be assertive and set short term and long term goals, learn to manage time effectively and deal with
stress.
4. Make the transition smoothly from campus to work, use media with etiquette and understand the
academic ethics.
5. Enrich their vocabulary, frame accurate sentences and comprehend passages confidently.

UNIT - I
Verbal Aptitude: Error Detection, Articles, Prepositions, Tenses, Concord and Transformation of Sentences-
Jumbled Words/Sentences- Vocabulary, Synonyms, Antonyms, One Word Substitutes, Idioms and Phrases,
Word/Sentence/Text Completion- Reading Comprehension.

UNIT - II
Group Discussion & Presentation Skills: Dynamics of Group Discussion-Case Studies- Intervention,
Summarizing, Modulation of Voice, Body Language, Relevance, Fluency and Accuracy, Coherence.
Elements of Effective Presentation – Structure of a Presentation – Presentation tools – Body language -
Preparing an Effective PPT

UNIT - III
Behavioural Skills: Personal strength analysis-Effective Time Management- Goal Setting- Stress management-
Corporate Culture – Grooming and etiquette-Statement of Purpose (SOP).

UNIT - IV
Mini Project: Research-Hypothesis-Developing a Questionnaire-Data Collection-Analysis-General and
Technical Report - Writing an Abstract –Technical Report Writing-Plagiarism-Project Seminar.

UNIT -V
Interview Skills: Cover Letter andRésumé writing – Structure and Presentation, Planning, Defining the Career
Objective, Projecting ones Strengths and Skill-sets – Interviews: Concept and Process, Pre-Interview Planning,
Opening Strategies, Answering Strategies, Mock Interviews.

Suggested Reading:
1. Leena Sen, “Communication Skills”, Prentice-Hall of India, 2005.
2. Dr. Shalini Verma, “Body Language - Your Success Mantra”, S Chand, 2006.
3. Edgar Thorpe and ShowickThorpe , “Objective English”, 2nd edition, Pearson Education, 2007.
4. Ramesh, Gopalswamy, and Mahadevan Ramesh, “The ACE of Soft Skills”, New Delhi: Pearson, 2010.
5. Gulati and Sarvesh, “Corporate Soft Skills”, New Delhi: Rupa and Co., 2006.
6. Van Emden, Joan, and Lucinda Becker, “Presentation Skills for Students”, New York: Palgrave
Macmillan, 2004.
7. A Modern Approach to Verbal & Non-Verbal Reasoning by R S Aggarwal, 2018.
CBIT (A) With effect from the Academic Year 2022-23

8. Covey and Stephen R, “The Habits of Highly Effective People”, New York: Free Press, 1989.
CBIT (A) With effect from the Academic Year 2023-24

CHAITANYA BHARATHI INSTITUTE OF TECHNOLOGY(A)

SCHEME OF INSTRUCTIONS AND EXAMINATION
Model Curriculum(R-20)

B.E. (Computer Science and Engineering)

SEMESTER - VII
Scheme of
Scheme of Examination
Instruction
S. Maximum
Course Code Title of the Course Hours per Week Duration Credits
No
of SEE Marks
L T P/D in Hours CIE SEE
THEORY
Cryptography and Network
1. 20CSC30 3 - - 3 40 60 3
Security
2. 20CSEXX Professional Elective-IV 3 - - 3 40 60 3
3. 20CSEXX Professional Elective-V 3 - - 3 40 60 3
4. 20XXXXX Open Elective-III 3 - - 3 40 60 3
Indian Constitution and
5. 20EGM01 Fundamental Principles 2 - - 2 - 50 -
Principles
PRACTICAL
Cryptography and Network
6. 20CSC31 - - 2 3 50 50 1
Security Lab
7. 20CSEXX Professional Elective-IV Lab - - 2 3 50 50 1
8. 20CSC32 Technical Seminar - - 2 - 50 - 1
9. 20CSC33 Project Part- I - - 4 - 50 - 2
10. 20CSI03 Internship - III 3 to 4 weeks / - 50 - 3
90 Hours
TOTAL 14 - 10 - 410 390 20
L: Lecture T: Tutorial D: Drawing P: Practical
CIE - Continuous Internal Evaluation SEE - Semester End Examination

Professional Elective – IV Professional Elective – IV Lab

20CSE21 Deep Learning 20CSE30 Deep Learning Lab
20CSE22 Big Data Analytics 20CSE31 Big Data Analytics Lab
Mobile Application Development
20CSE23 Mobile Application Development 20CSE32
Lab
20CSE24 Block Chain Technology 20CSE33 Block Chain Technology Lab
Planning and Estimation of Autonomous Planning and Estimation of
20CAE09 20CAE14
Systems Autonomous Systems Lab
Professional Elective – V Open Elective-III
20CSE25 Social Computing 20PYO01 History of Science and Technology
20CSE26 Human Computer Interaction 20MEO03 Research Methodologies
20CAE10 Computational Neuroscience 20MEO04 Entrepreneurship
20CSE27 Distributed Systems 20ECO05 Systems Automation and Control
20CSE28 Software Project Management 20EEO03 Energy Auditing
20CSE29 Design Patterns
CBIT (A) With effect from the Academic Year 2023-24

20CSC30
CRYPTOGRAPHY AND NETWORK SECURITY
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Data Communication and computer networks.

Course Objectives: The objectives of this course are,

1. To understand the importance of confidentiality, integrity, availability and authentication.
2. To understand various cryptographic algorithms.
3. To understand categories of threats to computer networks.
4. To describe public-key cryptosystem, key generation and distribution.
5. To understand implementation of Firewalls and web security.

Course Outcomes: On Successful completion of this course, student will be able to,
1. Analyze and design classical encryption techniques and block ciphers.
2. Analyze and design hash and MAC algorithms, and digital signatures.
3. Design network application security schemes like PGP, S/MIME, IPSec, SSL, TLS, HTTPS, SSH, etc.
4. Evaluate the authentication and hash algorithms.
5. Create and configure simple firewall architectures.
6. Understand digital sign in emails and files.

UNIT - I
Security Concepts: Introduction, The need for security, Security approaches, Principles of security, Types of
Security attacks, Security services, Security Mechanisms, A model for Network Security.
Cryptography Concepts and Techniques: Introduction, plain text and cipher text, substitution techniques,
transposition techniques, encryption and decryption, symmetric and asymmetric key cryptography,
steganography, key range and key size, possible types of attacks.

UNIT - II
Symmetric key Ciphers: Block Cipher principles, DES, AES, Blowfish, RC5, IDEA, Block cipher operation,
Stream ciphers, RC4.
Asymmetric key Ciphers: Principles of public key cryptosystems, RSA algorithm, Elgamal Cryptography,
Diffie-Hellman Key Exchange, Knapsack Algorithm.

UNIT - III
Cryptographic Hash Functions: Message Authentication, Secure Hash Algorithm (SHA-512).
Message authentication codes: Authentication requirements, HMAC, CMAC, Digital signatures, Elgamal
Digital Signature Scheme.
Key Management and Distribution: Symmetric Key Distribution Using Symmetric & Asymmetric
Encryption, Distribution of Public Keys, Kerberos, X.509 Authentication Service, Public – Key Infrastructure.

UNIT - IV
Transport-level Security: Web security considerations, Secure Socket Layer and Transport Layer Security,
HTTPS, Secure Shell (SSH).
Wireless Network Security: Wireless Security, Mobile Device Security, IEEE 802.11 Wireless LAN, IEEE
802.11i Wireless LAN Security

UNIT - V
E-Mail Security: Pretty Good Privacy, S/MIME.
IP Security: IP Security overview, IP Security architecture, Authentication Header, Encapsulating security
payload, combining security associations, Internet Key Exchange.
Case Studies on Cryptography and security: Secure Multiparty Calculation, Virtual Elections, Single sign
On, Ransomware.
CBIT (A) With effect from the Academic Year 2023-24

Text Books:
1. Cryptography and Network Security - Principles and Practice: William Stallings, Pearson Education,
6th Edition.
2. Cryptography and Network Security: Atul Kahate, Mc Graw Hill, 3rd Edition

Suggested Reading:
1. Cryptography and Network Security: C K Shyamala, N Harini, Dr T R Padmanabhan, Wiley India, 1st
Edition.
2. Cryptography and Network Security: Forouzan Mukhopadhyay, Mc Graw Hill, 3rd Edition.
3. Information Security, Principles, and Practice: Mark Stamp, Wiley India.
4. Principles of Computer Security: WM. Arthur Conklin, Greg White, TMH.
5. Introduction to Network Security: Neal Krawetz, CENGAGE Learning.
6. Network Security and Cryptography: Bernard Menezes, CENGAGE Learning.

Online resources
1. https://onlinecourses.nptel.ac.in/noc21_cs16/
CBIT (A) With effect from the Academic Year 2023-24

20CSE21
DEEP LEARNING
(Professional Elective – IV)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Artificial Intelligence, Machine Learning.

Course Objectives: The objectives of this course are,

1. To learn Deep learning techniques and their applications.
2. To acquire the knowledge of neural network architectures, Deep learning methods, models and
algorithms.
3. To understand CNN and RNN algorithms and their applications.

Course Outcomes: On successful completion of the course, students will be able to,
1. Understand various deep learning models.
2. Design and develop various Neural Network Architectures.
3. Understand approximate reasoning using Convolution Neural Networks.
4. Analyze and design deep learning algorithms for different applications.
5. Ability to apply CNN and RNN techniques to solve various applications.
6. Evaluate the Performance of different models of deep learning networks.

UNIT - I
Introduction: Historical Trends in Deep Learning, McCulloch Pitts Neuron, Thresholding Logic, Perceptron’s,
Perceptron Learning Algorithm. Representation Power of MLPs, Sigmoid Neurons, Feedforward Neural
Networks, Representation Power of Feedforward Neural Networks, Backpropagation, Historical Trends in Deep
Learning.
Optimization: Gradient Descent (GD), Momentum Based GD, Nesterov Accelerated GD, Stochastic GD,
AdaGrad, RMSProp, Adam.

UNIT - II
Autoencoders: Relation to PCA, Regularization in auto encoders, Denoising autoencoders, Sparse
autoencoders, Contractive autoencoders, Regularization: Bias Variance Tradeoff, L2 regularization, Early
stopping, Dataset augmentation, Parameter sharing and tying, Injecting noise at input, Ensemble methods,
Dropout, Greedy Layer wise Pre-training, Better activation functions, Better weight initialization methods,
Batch Normalization

UNIT - III
Convolutional Neural Network: The Convolution Operation, Motivation, Pooling, Convolution and Pooling as
an Infinitely Strong Prior, Variants of the Basic Convolution Function, Structured Outputs, Data Types.
LeNet, AlexNet, ZF-Net, VGGNet, GoogLeNet, ResNet, Visualizing Convolutional Neural Networks, Guided
Backpropagation, Deep Dream, Deep Art, Fooling Convolutional Neural Networks

UNIT – IV
Recurrent Neural Networks, Backpropagation through time (BPTT), Vanishing and Exploding Gradients,
Truncated BPTT, GRU, LSTMs
Encoder Decoder Models, Attention Mechanism, Attention over images, Introduction to Transformers.

UNIT – V
Generative Adversarial Networks (GANs): Introduction, Discriminator, Generator, Activation, Common
activation functions for GANs, BCE loss, Conditional GANs, Controllable generation, real life GANs

Text Books:
1. Goodfellow. I., Bengio. Y. and Courville. A., “Deep Learning “, MIT Press, 2016.
2. Josh Patterson, Adam Gibson "Deep Learning: A Practitioner's Approach", O'Reilly Media, 2017.
3. Ganguly Kuntal, “Learning generative adversarial networks: next-generation deep learning
simplified”, Packt Publishing, 2017.
CBIT (A) With effect from the Academic Year 2023-24

Suggested Reading:
1. Tom M. Mitchell, "Machine Learning ",MacGraw Hill, 1997.
2. LiMin Fu, “Neural Networks in Computer Intelligence”, McGraw-Hill edition, 1994.
3. Umberto Michelucci “Applied Deep Learning. A Case-based Approach to Understanding Deep Neural
Networks” Apress, 2018.
4. Giancarlo Zaccone, Md. RezaulKarim, Ahmed Menshawy "Deep Learning with TensorFlow: Explore
neural networks with Python", Packt Publisher, 2017.
5. Rothman, Denis, “Transformers for Natural Language Processing: Build innovative deep neural
network architectures for NLP with Python, PyTorch, TensorFlow, BERT, RoBERTa, and more”,
Packt Publishing Ltd, 2021.

Online Resources:
1. https://onlinecourses.nptel.ac.in/noc18_cs41/
2. https://onlinecourses.nptel.ac.in/noc22_cs22/
3. https://onlinecourses.nptel.ac.in/noc19_cs85/
CBIT (A) With effect from the Academic Year 2023-24

20CSE22
BIG DATA ANALYTICS
(Professional Elective – IV)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Database management systems, Programming for problem solving, OOPs.

Course Objectives: The objectives of this course are,

1. To understand the need of Big Data, challenges and different analytical architectures.
2. To understand Hadoop Architecture and its ecosystems.
3. To understand processing of Big Data with advanced architectures like Spark.

Course Outcomes: On successful completion of the course, students will be able to,
1. Demonstrate knowledge of Big Data, Data Analytics, challenges and their solutions in Big Data.
2. Discuss about Hadoop Framework and eco systems.
3. Understand and work on NoSQL environment and MongoDB.
4. Explain and Analyse the Big Data using Map-reduce programming in Both Hadoop and Spark
framework.
5. Demonstrate spark programming with Python/R programming languages.
6. Explain and Analyse the data Analytics algorithms in Spark

UNIT - I
Introduction to big data: Data, Characteristics of data and Types of digital data: Unstructured, Semi-structured
and Structured - Sources of data. Big Data Evolution -Definition of big data-Characteristics and Need of big
data-Challenges of big data.
Big data analytics: Overview of business intelligence, Data science and Analytics– Big Data Analytics -
Typical Analytical Architecture – Classification of analytics.

UNIT - II
Big data technologies and Databases: Hadoop – Requirement of Hadoop Framework - Design principle of
Hadoop –Comparison with other system (SQL,RDBMS) - Hadoop Components – Architecture -Hadoop 1 vs
Hadoop 2 – HDFS.
MapReduce and YARN framework: Introduction to MapReduce , Processing data with Hadoop using
MapReduce, Introduction to YARN, Architecture, Managing Resources and Applications with Hadoop YARN.

UNIT – III
Big data technologies and Databases: NoSQL: Introduction to NoSQL - Features and Types- Advantages
&Disadvantages -Application of NoSQL. NewSQL: Overview of NewSQL - Comparing SQL, NoSQL and
NewSQL.
Mongo DB: Introduction – Features – Data types – Mongo DB Query language – CRUD operations – Arrays –
Functions: Count – Sort – Limit – Skip – Aggregate – Map Reduce. Cursors – Indexes – Mongo Import –
Mongo Export. Cassandra: Introduction – Features – Data types – CQLSH – Key spaces – CRUD operations –
Collections – Counter – TTL – Alter commands – Import and Export – Querying System tables.

UNIT - IV
(Big Data Frame Works for Analytics)
Hadoop Frame Work: Map Reduce Programming: I/O formats, Map side join-Reduce Side Join-Secondary
Sorting-Pipelining MapReduce jobs
Spark Frame Work: Introduction to Apache spark-How spark works, Programming with RDDs: Create RDD-
spark Operations-Data Frame.

UNIT - V
(Data Analytics using ML)
Data Analysis with Spark
Data Exploration: Univariate and Multivariate Analysis. Data Manipulation: Feature Extraction- Feature
Transform-Feature Selection-Regression: Linear Regression
CBIT (A) With effect from the Academic Year 2023-24

Classification: Decision Trees-Naïve Bayes Classification- Clustering: K-means

Text Books:
1. Seema Acharya and Subhashini Chellappan, “Big Data and Analytics”, Wiley India Pvt. Ltd., 2016.
2. Mike Frampton, “Mastering Apache Spark”, Packt Publishing, 2015.

Suggested Reading:
1. TomWhite, “Hadoop: The Definitive Guide”, O’Reilly, 4th Edition, 2015.
2. Mohammed Guller, “Big Data Analytics with Spark”, Apress, 2015
3. Donald Miner, Adam Shook, “Map Reduce Design Pattern”, O’Reilly, 2012
CBIT (A) With effect from the Academic Year 2023-24

20CSE23
MOBILE APPLICATION DEVELOPMENT
(Professional Elective – IV)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Programming for Problem solving, OOPs.

Course Objectives: The objectives of this course are,

1. To demonstrate their understanding of the fundamentals of Android operating systems.
2. To demonstrate their skills in using Android software development tools.
3. To demonstrate their ability to develop software with reasonable complexity on mobile platform.

Course Outcomes: On successful completion of the course, student will be able to,
1. Interpret and analyze Android platform architecture and features to learn best practices in android
programming.
2. Design the User Interface for mobile applications.
3. Apply Intents, Broadcast receivers and Internet services in Android App.
4. Develop database management system to retrieve and/or store data for mobile application.
5. Evaluate and select appropriate android solutions to the mobile computing platform.
6. Build Flutter applications for complex problems.

UNIT - I
Introduction to Android Operating System: Android SDK Features, Developing for Android, Best practices
in Android programming, Android Development Tools. Android application components – Android Manifest
file, Externalizing resources, The Android Application Lifecycle, A Closer Look at Android Activities.

UNIT - II
Android User Interface: Introducing Layouts, User Interface (UI) Components – Editable and Non Editable
Text Views, Buttons, Radio and Toggle Buttons, Checkboxes, Spinners, Dialog and pickers. Event Handling –
Handling clicks or changes of various UI components. Introducing Fragments, Multi-screen Activities.

UNIT - III
Intents and Broadcasts: Introducing Intents: Using Intents to Launch Activities. Using Intent to dial a number
or to send SMS. Broadcast Receivers –Creating Intent Filters and Broadcast Receivers: Using Intent Filters to
Service Implicit Intents. Finding and using Intents received within an Activity. Customizing the Action Bar,
Using the Action Bar for application navigation, Notifications – Creating and Displaying notifications,
Displaying Toasts.

UNIT - IV
Persistent Storage: Files – Reading data from files, listing contents of a directory, Creating and Saving Shared
Preferences, Retrieving Shared Preferences. Database –Introducing Android Databases, Introducing SQLite,
Content Values and Cursors, Working with SQLite Databases. Registering Content Providers, Using content
Providers (insert, delete, retrieve and update).

UNIT - V
Advanced Topics: Alarms –Using Alarms. Using Internet Resources – Connecting to internet resource, using
download manager. Location Based Services –Using Location-Based Services, Using the Emulator with
Location-Based Services. Introduction to Flutter, Dart introduction, Data Types and Variables, String
interpolation, Operators, Control Flow Statements, Functions, Classes, Read and write with Dart IO: Setup,
Read and write with Dart IO: Final code.

Text Books:
1. Reto Meier, “Professional Android 4 Application Development”, Wiley India, (Wrox), 2012.
2. O'Reilly Dawn Griffiths, David Griffiths “Head First Android Development”, O'Reilly Media, Inc.,
2015.
CBIT (A) With effect from the Academic Year 2023-24

3. Dieter Meiller, “Modern App Development with Dart and Flutter 2”, Walter de Gruyter GmbH,
Berlin/Boston, 2021.

Suggested Reading:
1. Wei-Meng Lee, “Beginning Android 4 Application Development”, Wiley India (Wrox), 2013.
2. David Wolber, Hal Abelson, Ellen Spertus & Liz Looney, “App Inventor-Create your own Android
Apps”, O’Reilly, 2011.

Online Resources:
1. https://developer.android.com/studio?gclid=Cj0KCQjwyN-
DBhCDARIsAFOELTkESs57QOqIUktCOBZKgk8NkVT5OhpCnxUx4V6yDMPt6c-Ot7j4-
sEaAiasEALw_wcB&gclsrc=aw.ds
2. https://onlinecourses.nptel.ac.in/noc20_cs52/preview
3. https://onlinecourses.swayam2.ac.in/nou21_ge41/preview
CBIT (A) With effect from the Academic Year 2023-24

20CSE24
BLOCK CHAIN TECHNOLOGY
(Professional Elective – IV)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Data Structures, Cryptography and Network Security, Distributed Systems.

Course Objectives: The objectives of this course are,

1. To provide understanding and significance of Blockchain.
2. To familiarize with platforms such as Ethereum, Hyperledger Fabric involved in building Blockchain
applications.
3. To impart knowledge about the applications of Blockchain in various sectors.

Course Outcomes: On successful completion of the course, students will be able to,
1. Understand the significance of Blockchain technology and its associated components.
2. Understand the need for consensus protocols in Blockchain.
3. Experience the Ethereum and Hyperledger Fabric Platforms.
4. Incorporate Blockchain in financial software Systems and supply chain environments.
5. Devise the need for Blockchain in Government sectors.

UNIT - I
Introduction: Overview of distributed systems; Introduction to Blockchain; Properties of Blockchain; Evolution
of Blockchain, Hash Functions, Merkle Trees; Components of Blockchain Ecosystem; Types of Blockchain;
Blockchain Platforms.

UNIT - II
Distributed consensus: Consensus algorithms, Consensus in a Bitcoin network, Proof of Work (PoW), Proof
of Stake, Proof of Burn, Proof of Elapsed Time; Consensus models for permissioned block chain, Distributed
consensus in closed environment, Paxos, RAFT Consensus, Byzantine general problem, Byzantine fault tolerant
system, BFT over Asynchronous systems.

UNIT - III
Ethereum: Introduction to Ethereum Smart Contracts; Mining in Ethereum; Consensus mechanism in
Ethereum; Technologies that support Ethereum; Ethereum Programming Languages; Hyperledger Fabric:
Introduction to Hyperledger Fabric; Hyperledger Fabric architecture; Consensus in Hyperledger Fabric;
Hyperledger API and Application Model; Hyperledger Composer tool.

UNIT - IV
Use Case I: Blockchain in Financial Software and Systems (FSS): -Settlements, -KYC, -Capital markets-
Insurance.
Use case II: Blockchain in trade/supply chain: Provenance of goods, visibility, trade/supply chain finance,
invoice management/discounting.

UNIT - V
Use Case III: Blockchain for Government: Digital identity, land records and other kinds of record keeping
between government entities, Blockchain
Cryptography: Privacy and Security on Blockchain.

Text Books:
1. Imran Bashir, "Mastering Blockchain : A deep dive into distributed ledgers, consensus protocols, smart
contracts, DApps, cryptocurrencies, Ethereum, and more", Packt Publishing,Third Edition, 2020,
2. Mark Gates, “Blockchain: Ultimate guide to understanding blockchain, bitcoin, cryptocurrencies,
smart contracts and the future of money”, Wise Fox Publishing and Mark Gates, 2017.
3. Salman Baset, Luc Desrosiers, Nitin Gaur, Petr Novotny, Anthony O'Dowd, Venkatraman
Ramakrishna, “Hands-On Blockchain with Hyperledger: Building decentralized applications with
Hyperledger Fabric and Composer”, 2018.
CBIT (A) With effect from the Academic Year 2023-24

4. ArshdeepBahga, Vijay Madisetti, “Blockchain Applications: A Hands-On Approach”, ArshdeepBahga,

Vijay Madisetti publishers 2017.

Suggested Reading:
1. Andreas Antonopoulos, “Mastering Bitcoin: Unlocking Digital Cryptocurrencies”, O'Reilly Media,
Inc., 2014.
2. Melanie Swa, “Blockchain”, O'Reilly Media, 2014.

Online Resources:
1. https://onlinecourses.nptel.ac.in/noc18_cs47/preview
2. Hyperledger Fabric - https://www.hyperledger.org/projects/fabric
3. Zero to Blockchain - An IBM Redbooks course, by Bob Dill, David Smits, 2017
https://www.redbooks.ibm.com/Redbooks.nsf/RedbookAbstracts/crse0401.htm
4. https://www.udemy.com/blockchain-and-bitcoin-fundamentals/
CBIT (A) With effect from the Academic Year 2023-24

20CAE09
PLANNING AND ESTIMATION OF AUTONOMOUS SYSTEMS
(Professional Elective – IV)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Linear algebra and calculus, Design and Analysis of Algorithms, Artificial Intelligence,
Machine Learning, Deep Learning.

Course Objectives: The objectives of this course are,

1. To cover the basics of decision-making under partially known or uncertain environments.
2. To introduce decision theory and reinforcement learning.

Course Outcomes: On successful completion of the course, students will be able to,
1. Identify different motion planning schemas under different environments.
2. Define different states and have mathematical knowledge on drop-off and estimation algorithms.
3. Analyze different planning and decision techniques.
4. Appraise different methods to solve finite Markov decision problem.
5. Distinguish different decision making techniques under uncertain environment.
6. Apply different information gathering techniques and associate Human-robot interaction.

UNIT - I
Introduction, Autonomous Robots, Robot Arm Manipulators, Mobile Robots, Multi-Robot Systems and
Swarms, Perception, Planning, Control, and Coordination for Autonomous Vehicles, Motion-Planning Schemes:
Known Configuration Spaces: Potential-Field Algorithms, Grid-Based Algorithms, Sampling-Based Algorithms;
Motion-Planning Schemes: Partially Known Configuration Spaces: BUG0, BUG1, and BUG2

UNIT - II
State Estimation: Least Square Estimation (Linear, Weighted, Non-linear); Probability Basics; RANSAC for
Outlier Rejection; State Estimation Problem; Bayes Filter; Gaussian Filters; Kalman Filter; Extended Kalman
Filter; Unscented Kalman Filter; Information Filter

UNIT - III
Planning: STRIPS-planning; Planning domain description language (PDDL); Graph search - A* ; Markov
Decision process-Uncertainty in Action Selection, Value Iteration, Finite Environments, POMDPs ; Dynamic
Programming, Monte Carlo Approximation, Temporal difference learning

UNIT - IV
Decision making under Uncertainty: Introduction to Reinforcement learning, Imitation Learning, Bayesian
reinforcement learning- Acting on Unknown MDPs, Bayesian method in Continuous spaces, solving POMDPs;
Bandit Problem-Introduction; Finite Stochastic Bandit problem; Reinforcement learning in MDPs

UNIT - V
Information Gathering and Exploration: Gaussian Processes and exploration algorithms; Human-robot
interaction: Introduction, Design in HRI, Design methods, Spatial Interaction, Verbal and nonverbal
Interactions; Research methods in HCI

Text Books:
1. Eugene Kagan, Nir Shvalb, Irad Ben-Gal, "Autonomous Mobile Robots and Multi-Robot Systems:
Motion-Planning, Communication, and Swarming", Wiley, 2019
2. Pendleton S.D., Andersen H., Du X., Shen X., Meghjani M., Eng Y. H., Rus D., Ang M.H. “Perception,
Planning, Control, and Coordination for Autonomous Vehicles. Machines” 2017.
https://doi.org/10.3390/machines5010006

Suggested Reading:
1. Sebastian Thrun, Wolfram Burgard, Dieter Fox, “Probabilistic robotics", MIT Press, 2005.
2. Richard S. Sutton, Andrew G. Barto, "Reinforcement Learning: An Introduction", 2018, MIT Press.
CBIT (A) With effect from the Academic Year 2023-24

3. Christos Dimitrakakis, Ronald Ortner, "Decision Making Under Uncertainty and Reinforcement
Learning", 2021.
4. Bartneck, C., Belpaeme, T., Eyssel, F., Kanda, T., Keijsers, M., & Sabanovic, S, “Human-Robot
Interaction – An Introduction”, Cambridge University Press, 2020.
5. Todd Litman, "Autonomous Vehicle Implementation Predictions: Implications for Transport Planning",
Victoria Transport Policy Institute, 2022.
6. Mykel J. Kochenderfer, "Decision Making Under Uncertainty: Theory and Application”, MIT Press,
2015.
7. Wen Yu, Adolfo Perrusquia, "Human-Robot Interaction Control Using Reinforcement Learning",
Wiley, 2021.
8. Vincent A. W. J. Marchau, Warren E. Walker, Pieter J. T. M. Bloemen, Steven W. Popper , "Decision
Making under Deep Uncertainty: From Theory to Practice", Springer, 2019.
9. Victor Becerra, "Autonomous Control of Unmanned Aerial Vehicles", MDPI, 2019.

Online Resources:
1. Autonomous Systems, https://www.udacity.com/school-of-autonomous-systems
CBIT (A) With effect from the Academic Year 2023-24

20CSE25
SOCIAL COMPUTING
(Professional Elective – V)

Instruction 3 Hours per week

Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Data Structures, Machine Learning, Programming for problem solving.

Course Objectives: The objectives of this course are,

1. To familiarize social networks and their representation.
2. To understand the impact of social networks on society.
3. To study and analyze the social network search models.
4. To plan and execute network analytical computations.
5. To collect network data in different ways from different sources.

Course Outcomes: On Successful completion of this course, student will be able to,
1. Identify the significance of social networks, representation, ranking techniques and challenges.
2. Understand a broad range of social networks concepts and theories.
3. Ascertain the network analysis knowledge in a diversified aspect of society.
4. Analyze social network links and web search.
5. Differentiate between centralized and decentralized search models.
6. Generate and communicate the analysis results and impact of social networks.

UNIT - I
Introduction to Social Networks: Challenges, Google page rank, searching on network, link prediction,
contagious, marketing on social networks.
Graphs: Basic definitions, paths and connectivity, distance and breadth first search, network datasets.
Strong and Weak Ties: Triadic closure, strength of weak Ties, Tie strength and network structure in large-scale
data, social media and passive engagement, closure, structured holes and social capital.

UNIT - II
Networks in surrounding contexts: Homophily, selection and social influence, affiliation, tracking link
formation in online data, spatial model of segregation.
Positive and negative relationships: Structural balance, characterizing the structure of balanced networks,
applications of structured balance.

UNIT - III
Link analysis and Web search: Searching the web, ranking, link analysis using hubs and authorities, page
rank, link analysis in modern web search, applications beyond web.
Cascading behavior in networks: Diffusion in networks, modeling diffusion, cascades and clusters, thresholds
and role of weak Ties, extensions of cascade model, knowledge, thresholds and collective actions.

UNIT - IV
Power Laws and Rich-get-Richer Phenomena: Popularity as a network phenomenon, power laws, rich-get-
richer models, unpredictability of rich-get-richer effects, effects of search tools and recommender systems,
analysis of rich-get-richer processes. Pseudo core- how to go viral on the web. Case study on rich-get-richer.

UNIT - V
Small world phenomenon: Six degrees of separation, structured and randomness, decentralized search,
modeling the process of decentralization search, empirical analysis and generalized models, core-peiphery
structures and difficulties in decentralized search, analysis of decentralized search. Case Study on small world
phenomenon.

Text Books:
1. David Eas ley, Jon Kleinberg, “Networks, Crowds and Markets”, Cambridge Press, 2010.
2. Mathew O Jackson “Social and Economic Networks”, Princeton University, 2010.
CBIT (A) With effect from the Academic Year 2023-24

Suggested Reading:
1. Stephen P Borgatti, Martin G. Everett, Jeffrey C. Johnson, "Analyzing Social Networks", 2018, Second
edition, SAGE Publications Ltd.
2. Krishna Raj P.M., Ankith Mohan, K.G. Srinivasa, "Practical Social Network Analysis with Python",
Computer Communications and Networks, Springer; 1st Edition, 2018.

Online Resources:
1. https://nptel.ac.in/downloads/106106169/
CBIT (A) With effect from the Academic Year 2023-24

20CSE26
HUMAN COMPUTER INTERACTION
(Professional Elective – V)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Programming for problem solving, Internet and web technologies.

Course Objectives: The objectives of this course are,

1. To learn the foundations of Human Computer Interaction.
2. To be familiar with the design technologies for computer interaction and guidelines for web user
interface.
3. To learn the ecosystem and tools of mobile HCI.

Course Outcomes: On successful completion of the course, students will be able to,
1. Understand the structure of models and theories of human computer interaction.
2. Understand the vision of a computer user.
3. Understand the recognition and remembrance limitations of a computer user.
4. Understand and analyze the mobile ecosystem and tools for mobile design.
5. Design an interactive mobile interfaces for mobile applications and widgets.
6. Design an interactive web interface for web applications.

UNIT - I
Foundations and Introduction: The human, the computer, The Interaction, Paradigms, Our perception is
biased; our vision is optimized to see structure. Perception Biased by Experience, Perception Biased by Current
Context, Perception Biased by Goals, Design implications

UNIT - II
Vision and Memory: Our Vision is Optimized to See Structure, We Seek and Use Visual Structure, Our Color
Vision is Limited, Our Peripheral Vision is Poor, Reading is Unnatural, Our Attention is Limited; Our Memory
is Imperfect, Limits on Attention Shape Our Thought and Action.

UNIT - III
Recognition, Recall and Decision Making: Recognition is Easy, Recall is Hard, Problem Solving and
Calculation are Hard, Many Factors Affect Learning, Human Decision Making is Rarely Rational.

UNIT - IV
Mobile Ecosystem: Platforms, Application frameworks- Types of Mobile Applications: Widgets, Applications,
Games- Mobile Information Architecture, Mobile Design: Elements of Mobile Design, Tools.

UNIT - V
Designing Web Interfaces: Drag & Drop, Direct Selection, Contextual Tools, Overlays, Inlays and Virtual
Pages, Process Flow.
Case Study - 1: Design a Mobile App interface or Widget interface by following designing rules
Case Study - 2: Design a Web application interface by following designing rules

Text Books:
1. Jeff Johnson "Designing with the Mind in Mind: Simple Guide to Understanding", 2nd edition,
Elsevier Inc., 2014.
2. Alan Dix, Janet Finlay, Gregory D. Abowd, Russell Beale, "Human Computer Interaction", 3rd
edition, Pearson Education Limited, 2004.
3. Brian Fling, "Mobile Design and Development", First Edition, O’Reilly Media Inc., 2009.
4. Bill Scott and Theresa Neil, "Designing Web Interfaces", First Edition, O’Reilly, 2009.

Suggested Readings:
1. Ben Shneiderman, Catherine Plaisant, Maxine Cohen, Steven Jacobs, "Designing the User Interface", 5th
Edition, Pearson Education Limited, 2013.
CBIT (A) With effect from the Academic Year 2023-24

2. John Haugeland, "Mind Design II”, 2nd Edition, Revised and enlarged edition, The MIT Press, 1997.
CBIT (A) With effect from the Academic Year 2023-24

20CAE10
COMPUTATIONAL NEUROSCIENCE
(Professional Elective – V)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Neural Networks, Machine Learning.

Course Objectives: The objectives of this course are,

1. To learn computational neuroscience models and their applications.
2. To explore the computational principles governing various aspects of vision, sensory-motor control,
learning, and memory.
3. To learn representation of information by spiking neurons, processing of information in neural
networks, and algorithms for adaptation and learning.

Course Outcomes: On successful completion of the course, students will be able to,
1. Understand the fundamentals of computational neuroscience
2. Analyse the Neural Encoding Models.
3. Make use of Neurons & Neural coding to extract information.
4. Analyse the Computing in Carbon and Computing with Networks.
5. Analyse the various learning methodologies.
6. Evaluate the Performance of different neurological models.

UNIT - I
Introduction: Introduction and Basic Neurobiology Computational Neuroscience: Descriptive Models,
Computational Neuroscience: Mechanistic and Interpretive Models, the Electrical Personality of Neurons,
Making Connections: Synapses, Time to Network: Brain Areas and their Function.

UNIT - II
Neural Encoding Models: Neural Encoding, Simple Models, Feature Selection, Variability, Vectors and
Functions, Convolutions and Linear Systems, Change of Basis and PCA.

UNIT - III
Extracting Information from Neurons & Neural coding: Neural Decoding and Signal Detection Theory,
Population Coding and Bayesian Estimation, Reading Minds: Stimulus Reconstruction, Information and
Entropy, Calculating Information in Spike Trains, Coding Principles.

UNIT - IV
Computing in Carbon and Computing with Networks: Modelling Neurons, Spikes, Simplified Model
Neurons, A Forest of Dendrites, modelling Connections Between Neurons, Introduction to Network Models,
The Fascinating World of Recurrent Networks.

UNIT - V
Plasticity in the Brain & Learning: Synaptic Plasticity, Hebb's Rule, and Statistical Learning, Introduction to
Unsupervised Learning, Sparse Coding and Predictive Coding.
Learning from Supervision and Rewards: Neurons as Classifiers and Supervised Learning, Reinforcement
Learning: Predicting Rewards, Reinforcement Learning: Time for Action

Text Books:
1. Thomas Trappenberg, “Fundamentals of Computational Neuroscience”, OUP Oxford, 2nd edition,
2009.
2. Paul Miller, “An Introductory Course in Computational Neuroscience”, The MIT Press; 1st edition,
2018.
3. Paul Miller, “An Introductory Course in Computational Neuroscience”, The MIT Press, 2018.

Suggested Reading:
CBIT (A) With effect from the Academic Year 2023-24

1. Britt-Anne Anderson, “Computational Neuroscience and Cognitive Modelling: A Student's

Introduction to Methods and Procedures”, SAGE Publications Ltd, 2014.
2. Ranu Jung, Dieter Jaeger, “Encyclopedia of Computational Neuroscience”, Springer, 2015.
3. Trappenberg, Thomas, “Fundamentals of computational neuroscience”, OUP Oxford, 2009.
4. Arbib, Michael A., and James J. Bonaiuto, eds, “From neuron to cognition via computational
neuroscience”, MIT Press, 2016.

Online Resources:
1. https://nptel.ac.in/courses/102106023
2. https://onlinecourses.nptel.ac.in/noc22_ee66
3. https://www.coursera.org/learn/computational-neuroscience#syllabus
4. https://www.edx.org/course/computational-neuroscience-neuronal-dynamics-of-co
CBIT (A) With effect from the Academic Year 2023-24

20CSE27
DISTRIBUTED SYSTEMS
(Professional Elective - V)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Operating Systems, Computer Networks.

Course objectives: The objectives of this course are,

1. To provide students with contemporary knowledge in distributed systems.
2. To equip students with skills to analyze and design distributed applications.
3. To provide skills to measure the performance of distributed synchronization algorithms.

Course outcomes: On successful completion of the course, students will be able to,
1. Understand the basic elements and concepts related to distributed systems.
2. Illustrate the middleware technologies such as RPC, RMI and Object based middleware that support
distributed applications.
3. Analyze the various techniques used for clock synchronization and mutual exclusion.
4. Demonstrate the concepts of resource and process management and synchronization algorithms,
consistency and replication management.
5. Apply the knowledge of distributed file system for analysing various file systems like NFS, AFS and
the experience in building large-scale distributed applications.

UNIT - I
Introduction to Distributed Systems: Characterization of Distributed Systems: Issues, goals, and types of
distributed systems, Distributed System Models, Hardware concepts, Software Concept.
Middleware: Models of Middleware, Services offered by middleware, Client Server model.

UNIT - II
Communication: Stream Oriented Communication, Group Communication.
Synchronization: Clock Synchronization, Logical Clocks, Election Algorithms, Mutual Exclusion, Distributed
Mutual Exclusion-Classification of mutual Exclusion Algorithm, Requirements of Mutual Exclusion
Algorithms, Performance measure.
Non Token based Algorithms: Lamport Algorithm, Ricart–Agrawala‘s Algorithm, Maekawa‘s Algorithm
Token Based Algorithms: Suzuki-Kasami‘s Broadcast Algorithms, Singhal‘s Heuristic Algorithm, Raymond‘s
Tree based Algorithm, Comparative Performance Analysis.

UNIT - III
Resource and Process Management: Desirable Features of global Scheduling algorithm, Task assignment
approach, Load balancing approach, load sharing approach, Introduction to process management, process
migration, Threads, Virtualization, Clients, Servers, Code Migration.

UNIT - IV
Consistency, Replication and Fault Tolerance, Introduction to replication and consistency, Data-Centric and
Client Centric Consistency Models, Replica Management.
Fault Tolerance: Introduction, Process resilience, Reliable client-server and group communication, Recovery.

UNIT - V
Distributed File Systems and Name Services: Introduction and features of DFS, File models, File Accessing
models, File-Caching Schemes, File Replication.
Case Study: Distributed File Systems (DSF), Network File System (NFS), Andrew File System (AFS)
Introduction to Name services and Domain Name System, Directory Services,
Case Study: The Global Name Service, the X.500 Directory Service.
Designing Distributed Systems: Google Case Study
CBIT (A) With effect from the Academic Year 2023-24

Text Books:
1. Andrew S. Tanenbaum and Maarten Van Steen, “Distributed Systems: Principles and Paradigms”, 3rd
edition, Pearson Education, 2017.
2. George Coulouris, Jean Dollimore, Tim Kindberg, “Distributed Systems: Concepts and Design”, 5th
Edition, Pearson Education, 2012.

Suggested Reading:
1. Kleppmann, Martin, “Designing data-intensive applications: the big ideas behind reliable, scalable, and
maintainable systems”, 1st Edition, O'Reilly Media, 2018.
2. M. L. Liu, “Distributed Computing Principles and Applications”, Pearson Addison Wesley, 2004.
CBIT (A) With effect from the Academic Year 2023-24

20CSE28
SOFTWARE PROJECT MANAGEMENT
(Professional Elective – V)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Software Engineering, Organizational behaviour.

Course Objectives: The objectives of this course are,

1. To learn the importance of software process maturity & understand related concepts.
2. To understand the specific roles within a software organization related to project and process
management.
3. To understand the basic infrastructure competences.
4. To understand the basic steps of project and process planning, management, quality assurance and their
relationships.

Course Outcomes: On successful completion of the course, students will be able to,
1. Apply suitable CMM for specific scenarios and determine the effectiveness.
2. Describe and determine the purpose and importance of project management from the perspectives of
planning, tracking and completion of project.
3. Compare and differentiate organization and project structures.
4. Implement a project to manage project schedule, expenses and resource with the application of suitable
project management tools.

UNIT - I
Software Process Maturity: Software maturity Framework, Principles of Software Process Change, Software
Process Assessment, The Initial Process, The Repeatable Process, The Defined Process, The Managed Process,
The Optimizing Process. Process Reference Models Capability Maturity Model (CMM), CMMI, PCMM, PSP,
TSP.

UNIT - II
Software Project Management Renaissance Conventional Software Management, Evolution of Software
Economics, Improving Software Economics, The old way and the new way. Life-Cycle Phases and Process
artifacts Engineering and Production stages, inception phase, elaboration phase, construction phase, transition
phase, artifact sets, management artifacts, engineering artifacts and pragmatic artifacts, model based software
architectures.

UNIT - III
Workflows and Checkpoints of process: Software process workflows, Iteration workflows, Major milestones,
Minor milestones, Periodic status assessments. Process Planning Work break down structures, Planning
guidelines, cost and schedule estimating process, iteration planning process, Pragmatic planning.

UNIT - IV
Project Organizations: Line-of- business organizations, project organizations, evolution of organizations,
process automation.
Project Control and process instrumentation: The seven core metrics, management indicators, quality
indicators, life-cycle expectations, Pragmatic software metrics, and metrics automation.

UNIT - V
CCPDS-R Case Study and Future Software Project Management Practices
Modern Project Profiles, Next-Generation software Economics, Modern Process Transitions.

Text Books:
1. Watts S. Humphrey, “Managing the Software Process”, Pearson Education, 2002.
2. Walker Royce, “Software Project Management”, Pearson Education.
CBIT (A) With effect from the Academic Year 2023-24

Suggested Reading:
1. Robert Wysocki, “Effective Project Management: Traditional, Agile, Extreme”, Sixth edition, Wiley
India, 2011.
2. Watts S. Humphrey, “An Introduction to the Team Software Process”, Pearson Education, 2000.
3. James R. Persse, “Process Improvement essentials”, O’Reilly, 2006.
4. Bob Hughes, Mike Cotterell “Software Project Management”, fourth edition, TMH, 2006.
5. Andrew Stellman, Jennifer Greene, “Applied Software Project Management”, O’Reilly, 2006.
6. Jennifer Greene & Andrew Stellman “Head First PMP”, O’Reilly, 2007.
7. Richard H. Thayer & Edward Yourdon, “Software Engineering Project Management”, 2nd edition,
Wiley India, 2004.
8. Scott Berkun “The Art of Project Management”, SPD, O’Reilly, 2011.
9. Andrew Stellman & Jennifer Greene, “Applied Software Project Management”, SPD, O’Reilly, 2011.
10. Jim Highsmith, “Agile Project Management”, Pearson education, 2004.
CBIT (A) With effect from the Academic Year 2023-24

20CSE29
DESIGN PATTERNS
(Professional Elective – V)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Database management systems, OOPs, UML.

Course Objectives: The main objectives of this course are,

1. To understand the fundamental concepts of C++ and the design patterns,
2. To learn user interfaces, standards of designing a document editor.
3. To understand the structural and behavioral patterns.
4. To learn about the dynamics of the design patterns.

Course Outcomes: On Successful completion of this course, student will be able to,
1. Apply formal notations of C++ and develop patterns of user choice to accomplish user interface design.
2. Interpret document structure, formatting, look and feel standards and Multiple Window Systems to
design document editor for a case study.
3. Demonstrate abstract factory to design and develop catalog pattern and Adapter, Bridge, Composite,
Decorator of Structural Patterns.
4. Outline Façade, Flyweight, Proxy of behavioral patterns.
5. Discuss the Iterator, Mediator, Observer, State, Strategy, Template Method, Visitor of Behavioral
Patterns-2 and its consequences.
6. State, Strategy, Template Method, Visitor of Behavioral Patterns-3 and its consequences.

UNIT - I
Review of Formal Notations and Foundation Classes in C++: Class Diagram, Object Diagram, Interaction
Diagram Examples, List, Iterator, List Iterator, Point, Rect, Coding in C++.
Introduction to Design Patterns: Design Pattern Definition, Design Patterns in Small Talk MVC, Describing
Design Patterns, Catalog of Design Patterns, Organizing The Catalog, Solving of Design Problems Using Design
Patterns, Selection of A Design Pattern, Use of Design Patterns.

UNIT - II
Designing a Document Editor: A Case Study: Design Problems, Document Structure, Formatting,
Embellishing the User Interface, Supporting Multiple Look and Feel Standards, Supporting Multiple Window
Systems, User Operations, Spelling Checking and Hyphenation.

UNIT - III
Design Patterns Catalog: Creational Patterns, Abstract Factory, Builder, Factory Method, Prototype, Singleton,
Discussion of Creational Patterns.
Structural Patterns-1: Adapter, Bridge, Composite, Decorator. Structural Patterns-2 and Behavioral Patterns-1:
Structural Patterns: Façade, Flyweight, Proxy, Discuss of Structural Patterns.

UNIT – IV
Behavioral Patterns: Chain of Responsibility Command, Interpreter.
Behavioral Patterns-2: Iterator, Mediator, Observer, State, Strategy, Template Method, Visitor, Discussion of
Behavioral Patterns.

UNIT - V
Behavioral Patterns-3: State, Strategy, Template Method, Visitor, Discussion of Behavioral Patterns,
Expectations from Design Patterns.

Text Books:
1. Gamma, Belm, Johnson, “Design Patterns: Elements of Reusable Object Oriented Software”, Pearson
Education, 1995.
2. Eric Freeman, “Head First Design Patterns”, O’reilly-SPD.
CBIT (A) With effect from the Academic Year 2023-24

Suggested Reading:
1. Cooper, “Java Design Patterns”, Pearson Education.
2. Horstmann, “Object Oriented Design and Patterns”, Wiley.

Online Resources:
1. shop.oreilly.com/product/9780596007126.do
2. ww.amazon.com/Design-Patterns-Elements.../dp/0201633612
CBIT (A) With effect from the Academic Year 2023-24

20PYO01
HISTORY OF SCIENCE AND TECHNOLOGY
(Open Elective – III)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Course Objectives: The objectives of the course is to make the student

1. Gains the knowledge about origin of science in the Stone Age and its progress during Antiquity
period.
2. Familiar with scientific views in the medieval period and during the Industrial revolution. .
3. Aware of modern scientific developments from 19th century onwards.

Course Outcomes: After completion of the course, the students will be able to,
1. Demonstrate the process of beginning of science and civilization, knowledge acquisition and
philosophical approach of science and its advancements in the Stone Ages and Antiquity period.
2. Illustrate the advancements in science and technology in the medieval period across Asia and Arab
countries and decline and revival of science in Europe.
3. Explain the scientific approach and its advances of the Europeans and how the role of engineer during
the industrial revolution and the major advancements.
4. Make use of the advancements in the field of science and technology by adopting new philosophies of
19th and first half of 20th century in finding ethical solutions to the societal problems.
5. Interpret the changes in specializations of science and the technology and build the relation between
information and society from second half of 20th century onwards.

UNIT - I
Science - The Beginning (through 599 BCE): The Stone Ages, Knowledge among hunter gatherers,
Agricultural Revolution and other revolutions, Civilization, Major advances.
Science in Antiquity (600 BCE - 529 CE): Philosophy- a precursor to science, Hellenistic world and the
Roman Empire, Other cultures of the period, major advances.

UNIT - II
Medieval Science (530 CE - 1452 CE): The decline of science in Europe, Science in China, Science and
mathematics in India, Arab science, Revival of science in Europe, Technology revolution of the Middle ages,
Major advances.
The Renaissance and the Scientific Revolution (1453 CE – 1659 CE): Renaissance, Scientific Revolution,
Technology, Major advances.

UNIT - III
Scientific Method: Measurement and Communication (1660 CE – 1734 CE): European domination, the
scientific method, Major advances.
The Industrial Revolution (1735 CE – 1819 CE): Industrial Revolution, Rise of the engineer, Major
Advances.

UNIT - IV
Science and Technology in the 19th Century (1820 CE – 1894 CE): Philosophical basis of 19th-century
science, Science and the public, Science and technology, Major advances.
Rise of Modern Science and Technology (1895 CE – 1945 CE): The growth of 20thcentury science, new
philosophies, Quantum reality, Energy sources, Electricity: a revolution in technology, Major advances.

UNIT - V
Big Science and the Post-Industrial Society (1946 CE – 1972 CE): Big science, Specialization and changing
categories, Technology changes society, Major advances.
The Information Age (1973 CE – 2015 CE): Information and society, Globalization, The post-industrial
society, Problems of the Information age, Major Advances

Text Books:
CBIT (A) With effect from the Academic Year 2023-24

1. Bryan Bunch and Alexander Hellemans, “The History of Science and Technology”, Houghton Mifflin
Company (New York), 2004.
2. JD Bernal, “Science in History”, 4 Volumes, Eklavya Publishers, 2012.

Suggested Readings:
1. “The 100 Most Influential Scientists of All Time”, Edited by Kara Rogers, Britannica Educational
Publishing, 2010.
2. Alberto Hernandez, “A Visual History of Science and Technology”, The Rosen Publishing Group,
2016.
CBIT (A) With effect from the Academic Year 2023-24

20MEO03
RESEARCH METHODOLOGIES
(Open Elective – III)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Course Objectives: The main objectives of this course are

1. To make the students to formulate the research problem.
2. To identify various sources for literature review and data collection.
3. To prepare the research design.
4. To equip the students with good methods to analyze the collected data.
5. To explain how to interpret the results and report writing.

Course Outcomes: On Successful completion of this course, student will be able to,
1. Define research problem.
2. Review and assess the quality of literature from various sources.
3. Understand and develp various sresearch designs.
4. Analyze problem by sttistical techniques: ANOVA, F-test, Chi-square.
5. Improve the style and ormat of writing a report for technical paper/Journal report.

UNIT – I
Research methodology: Objectives and motivation of research, types of research- descriptive vs. analytical,
applied vs. fundamental, quantitative vs. qualitative, conceptual vs. empirical, research approaches, significance
of research, research methods vs. methodology, research process, criteria of good research, problems
encountered by researchers in India, technique involved in defining a problem.

UNIT – II
Literature survey: Importance of literature survey, sources of information-primary, secondary, tertiary,
assessment of quality of journals and articles, information through internet.

UNIT – III
Research design: Meaning of research design, need of research design, feature of a good design important
concepts related to research design, different research designs, basic principles of experimental design, steps in
sample design.

UNIT – IV
Data collection: Collection of primary data, Secondary data, measures of central tendency-mean, mode, median,
measures of dispersion- range, mean deviation, standard deviation, measures of asymmetry (skewness),
important parametric tests -z, t, F, Chi-Square, ANOVA significance.

UNIT – V
Research report formulation and presentation: Synopsis, dissertation, technical paper and journal paper,
writing research grant proposal, making presentation with the use of visual aids, writing a proposal for research
grant.

Text Books:
1. C.R Kothari “Research Methodology Methods & Technique”, New Age International Publishers, 2004.
2. R. Ganesan “Research Methodology for Engineers”, MJP Publishers, 2011.
3. Vijay Upagade and AravindShende “Research Methodology”, S. Chand & Co. Ltd., New Delhi, 2009.

Suggested Reading:
1. G. NageswaraRao “Research Methodology and Quantitative methods”, BS Publications, Hyderabad,
2012.
2. Naval Bajjai “Business Research Methods”, Pearson Education, 2011.
CBIT (A) With effect from the Academic Year 2023-24

20MEO04
ENTREPRENEURSHIP
(Open Elective – III)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Course Objectives: The main objectives of this course are

1. Concept and procedure of idea generation.
2. The nature of industry and related opportunities and challenges.
3. Elements of business plan and it’s procedure.
4. Project management and its techniques.
5. Behavioural issues and Time management.

Course Outcomes: On Successful completion of this course, student will be able to,
1. Understand the concept and essence of entrepreneurship.
2. Identify business opportunities and nature of enterprise.
3. Analyze the feasibility of new business plan.
4. Apply project management techniques like PERT and CPM for effective planning and execution of
projects.
5. Use behavioral, leadership and time management aspects in entrepreneurial journey.

UNIT - I
Entrepreneurship: Definition, functions of entrepreneurship, qualities of entrepreneurs, identification and
characteristics of entrepreneurs, entrepreneur vs. intrapreneur, first generation entrepreneurs, women
entrepreneurs, conception and evaluation of ideas and their sources.

UNIT - II
Indian industrial environment: Competence, opportunities and challenges, entrepreneurship and economic
growth, small scale industry in India, objectives, linkage among small, medium and heavy industries, types of
enterprises, corporate social responsibility.

UNIT - III
Business plan: Introduction, elements of business plan and its salient features, business model canvas, technical
analysis, profitability and financial analysis, marketing analysis, feasibility studies, executive summary,
selection of technology and collaborative interactions.

UNIT - IV
Project management: During construction phase, project organization, project planning and control using CPM,
PERT techniques, human aspects of project management, assessment of tax burden.

UNIT - V
Behavioral aspects of entrepreneurs: Personality, determinants, attributes and models, leadership concepts and
models, values and attitudes, motivation aspects, time management: approaches of time management, their
strengths and weaknesses. Time management matrix and the urgency addiction.

Text Books:
1. Vasant Desai, “Dynamics of Entrepreneurial Development and Management”, Himalaya Publishing
House, 1997.
2. Prasanna Chandra, “Project-Planning, Analysis, Selection, Implementation and Review”, Tata Mcgraw-
Hill Publishing Company Ltd, 1995.
3. S.S. Khanka, “Entrepreneurial Development”, S. Chand & Co. Pvt. Ltd., New Delhi, 2015.

Suggested Reading:
1. Robert D. Hisrich, Michael P. Peters, “Entrepreneurship”, 5th edition, Tata Mc Graw Hill Publishing
Company. Ltd., 2005.
2. Stephen R. Covey and A. Roger Merrill, “First Things First”, Simon and Schuster Publication, 1994.
CBIT (A) With effect from the Academic Year 2023-24

20ECO05
SYSTEMS AUTOMATION AND CONTROL
(Open Elective – III)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Prerequisite: Knowledge about physical parameters in industry is required

Course Objectives: The objectives of this course are,

1. Learn the concepts industrial control systems.
2. Learn how to measure the physical parameters in industry.
3. Learn the applications of Robots in industry.

Course Outcomes: On Successful completion of this course, student will be able to,
1. Understand the features of various automatic and process control systems.
2. Define and analyze various measuring parameters in the industry.
3. Compare performance of various controllers (P, PD, PI, and PID).
4. Illustrate the role of digital computers in automation.
5. Develop various robot structures for different applications.

UNIT - I
Introduction to Automatic Control Systems: Purpose of Automatic Control, How an Industrial Control
System is implemented, Introduction to Automatic Control theory.
Sensors: Sensor definition, Different types of Sensors: Motion, Position, Force, Level sensors, and Thermo
couples.

UNIT - II
Theory of Measurements: Measurement goals and concepts, Scale factor, Linearity, accuracy, Range,
Resolution, Precision and repeatability.
Measurement Techniques and Hardware: Typical Sensor outputs, Bridge measurements: General equation
for bridge balance, Resistance balanced Wheatstone bridge, Variable voltage type measurements, Frequency
type measurements.

UNIT - III
Process Controllers: What is a Controller, uses of Controllers, Open loop and closed loop Control,
proportional, PD, PI, PID Controllers, Analog and Digital methods of Control.
Controller Hardware: Analog and Digital Controllers.

UNIT - IV
Digital Computers as Process Controllers: Use by Digital Computer for process control, Information required
by the computer, Information required by the process, Computer Interface electronics, Digital Computer input-
output, computer processing of data, Digital Process control computer design, Computer programming.
Actuators: Electro mechanical - Linear motion and rotary motion solenoids, DC motors, AC motors and
Stepped motors.

UNIT - V
Robots: What are robots, Robots and process Control systems, Degrees of freedom, factories of the future,
Delivery, Disposal and transport systems, Sensing elements, Robot Classifications and Applications. Trouble
shooting System failures: Preliminary steps and other troubleshooting aids.

Text Books:
1. Ronald P. Hunter, “Automated process control systems – concepts and Hardware”, 2/e, PHI, 1987.
2. Norman A. Anderson, “Instrumentation for process measurement and Control”, 3/e, CRC Press, 2005.

Suggested Reading:
1. Kuo B. C, “Automatic Control Systems”, 9th edition
CBIT (A) With effect from the Academic Year 2023-24

2. A.K Sawhney, “A course on Electrical and Electronic Measurements and Instrumentation”.

CBIT (A) With effect from the Academic Year 2023-24

20EEO03
ENERGY AUDITING
(Open Elective – III)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Prerequisites: Students should have prior knowledge on different Electrical Energy Generation systems,
measuring instruments and basics of power systems

Course objectives: The objectives of this course are,

1. To know the concept of Energy auditing
2. To understand the formulation of efficiency for various engineering systems
3. To explore the different ways to design various technologies for efficient engineering systems.

Course Outcomes: After completion of this course, students will be able to,
1. Know the current energy scenario and various energy sources
2. Understand the concepts of energy auditing.
3. Evaluate the performance of existing engineering systems
4. Explore the methods of improving energy efficiency in different engineering systems
5. Design different energy efficient appliances.

UNIT - I
Basics of Energy and its various forms: Overview of Engineering, elements Solar energy, electricity
generation methods using solar energy, PV cell, elements of wind energy, electricity generation using wind
energy, elements of Bio energy, Bio mass energy conservation, elements of Geothermal energy, sources of Geo
thermal energy, sources of Chemical energy, fuel cells, Energy Scenario in India

UNIT - II
Energy Auditing-I: Introduction, Need for energy audit, types of energy audit: Preliminary audit, General/mini
Audit, Investment-grade/ Comprehensive audit. Major energy consuming equipment and systems, Energy audit
team, energy Auditing methodology: preliminary and detailed. Process flow diagram, Energy Audit report
format

UNIT - III
Energy Auditing-II: For buildings: Energy Auditing Instruments, Energy Efficiency, Energy Auditing for
buildings- stages in programs, surveying, measurements, and model analysis. Energy audit form of commercial
buildings such as Hotel, checklist for Energy saving measures.

UNIT - IV
Energy Efficient Technologies-I: Energy Efficient Technology in Mechanical Engineering: Heating,
ventilation, and air-conditioning; Evaporative coolers, Air conditioners -types such as Portable; Central AC,
Window AC and Split AC.
Energy Efficient Technology in Electrical Engineering: Electricity billing, Power Factor Improvement-
Regenerated Energy in Lifts and Escalators.

UNIT-V
Energy Efficient Technologies-II: Energy Efficient Technology in Civil Engineering: Green building-
features- concept of Embodied energy -Building design-Green construction-Net Zero Energy Building - Energy
Efficient Technology in Chemical Engineering: Green chemistry, - Battery Management systems – concept
and salient features -topologies

Text Books:
1. Umesh Rathore, 'energy management', Kataria publications, 2nd ediiton, 2014.
2. G.Hari hara Iyer : Green Building – Fundamentals , Notion Press .com2022
3. Hargroves, K., Gockowiak, K., Wilson, K., Lawry, N., and Desha, C. (2014) An Overview of Energy
Efficiency Opportunities in Mechanical/civil/electrical/chemical Engineering, The University of
CBIT (A) With effect from the Academic Year 2023-24

Adelaide and Queensland University of Technology.

Suggested reading:
1. Success stories of Energy Conservation by BEE, New Delhi (www.bee-india.org)
2. Guide books for National Certification Examination for Energy Manager / Energy Auditors Book-1,
General Aspects
CBIT (A) With effect from the Academic Year 2023-24

20EGM01
INDIAN CONSTITUTION AND FUNDAMENTAL PRINCIPLES
Instruction 2 Hours per week
Duration of End Examination 2 Hours
Semester End Examination 50 Marks
Continuous Internal Evaluation -
Credits -

Course Objectives: The main objectives of this course are

1. History of Indian Constitution and how it reflects the social, political and economic perspectives of the
Indian society.
2. Growth of Indian opinion regarding modern Indian intellectual’s constitutional role and entitlement to
civil and economic rights as well as the emergence of nationhood in the early years of Indian
nationalism.
3. Various Organs of Governance and Local Administration.

Course Outcomes: On Successful completion of this course, student will be able to,
1. Understand the making of the Indian Constitution and its features.
2. Identify the difference among Right To equality, Right To freedom and Right to Liberty.
3. Analyze the structuring of the Indian Union and differentiate the powers between Union and States.
4. Distinguish between the functioning of Lok Sabha and Rajya Sabha while appreciating the importance
of Judiciary.
5. Differentiate between the functions underlying Municipalities, Panchayats and Co-operative Societies.

UNIT - I
Constitution of India: Constitutional history-Govt of India Act 1909, 1919 and 1935, Constitution making and
salient features. Directive Principles of State Policy - Its importance and implementation.

UNIT - II
Scheme of the Fundamental Rights & Duties: The Fundamental Rights - To Equality, to certain Freedom
under Article 19, to Life and Personal Liberty under Article 21. Fundamental Duties - the legal status.

UNIT - III
Union Government and its Administration: Structure of the Indian Union: Federalism, distribution of
legislative and financial powers between the Union and the States.
Parliamentary form of government in India: Executive-President’s role, power and position.

UNIT - IV
Legislature and Judiciary: Central Legislature-Powers and Functions of Lok Sabha and Rajya Sabha.
Judiciary: Supreme Court-Functions, Judicial Review and Judicial Activism.

UNIT - V
Local Self Government: District’s Administration Head (Collector): Role and Importance. Municipalities &
Municipal Corporations: Introduction, Chairperson/Mayor, Commissioner and Role of Elected
Representatives. Panchayati Raj: Introduction, Zilla Panchayat, Chairperson, CEO, Elected Officials and their
roles. Block/Mandal level: Organizational Hierarchy (Different departments). Village level: Role of Elected
and Officials.

Text Books:
1. Ed Prof V Ravindra Sastry, “Indian Government & Politics”, Telugu Akademy, 2nd edition, 2018.
2. “Indian Constitution at Work”, NCERT, First edition 2006, Reprinted- January 2020.

Suggested Reading:
1. “The Constitution of India”, 1950 (Bare Act), Government Publication.
2. Dr. S. N. Busi, Dr. B. R. Ambedkar, “Framing of Indian Constitution”, 1st Edition, 2015.
3. M. P. Jain, “Indian Constitution Law”, 7th Ed. Lexis Nexis, 2014.
4. D.D. Basu, “Introduction to the Constitution of India”, Lexis Nexis, 2015.

Online Resources:
1. http://www.nptel.ac.in/courses/103107084 /Script.pdf
CBIT (A) With effect from the Academic Year 2023-24

20CSC31
CRYPTOGRAPHY AND NETWORK SECURITY LAB
Instruction 2 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 50 Marks
Continuous Internal Evaluation 50 Marks
Credits 1

Pre-requisites: Data communication and computer networks.

Course Objectives: The objectives of this course are,

1. To provide practical understanding of cryptography and its application to network security.
2. To learn various approaches on encryption techniques, strengths of Traffic Confidentiality, Message
Authentication Codes.
3. To familiarize with symmetric and asymmetric cryptography.
4. Able to understand the significant functionalities of secure communication.

Course Outcomes: On successful completion of the course, students will be able to,
1. Identify basic security attacks and services
2. Design symmetric and asymmetric key algorithms for cryptography
3. Create and use of Authentication functions
4. Identify and investigate network security threat
5. Analyze and design network security protocols

List of Experiments:
1. Write a C program that contains a string (char pointer) with a value ‘Hello world’. The program should
XOR each character in this string with 0 and displays the result.
2. Write a C program that contains a string (char pointer) with a value ‘Hello world’. The program should
AND or and XOR each character in this string with 127 and display the result.
3. Write a Java program to perform encryption and decryption using the following algorithms
a. Ceaser cipher
b. Substitution cipher
c. Hill Cipher
d. Play fair Cipher
4. Write a C/JAVA program to implement the DES algorithm logic.
5. Write a C/JAVA program to implement the Blowfish algorithm logic.
6. Write a C/JAVA program to implement the Rijndael algorithm logic.
7. Write the RC4 logic in Java Using Java cryptography; encrypt the text “Hello world” using Blowfish.
Create your own key using Java key tool.
8. Write a Java program to implement RSA algorithm.
9. Implement the Diffie-Hellman Key Exchange mechanism using HTML and JavaScript.
10. Calculate the message digest of a text using the SHA-1 algorithm in JAVA.
11. Calculate the message digest of a text using the MD5 algorithm in JAVA.
12. Implement Simple Columner Transposition technique and Advanced Columner Transposition
technique
13. Implement Euclidean Algorithm and Advanced Euclidean Algorithm
14. Familiarize the cryptographic tools (opencv)

Text Books:
1. William Stallings, “Cryptography and Network Security: Principles and Practice” Pearson Education,
6th Edition.
2. Chris Brenton, “Mastering Network Security” Bk & Cd-Rom Edition 2017.

Suggested Reading:
1. J.W. Rittiaghouse and William M.Hancok “Cyber Security Operations Handbook” Elseviers.
2. Eric Chou, “Mastering Python Networking” 3rd Edition, 2020.
3. Jean-Philippe Aumasson “Serious Cryptography: A Practical Introduction to Modern
Encryption”, 2017.
CBIT (A) With effect from the Academic Year 2023-24

Online Resources:
1. https://onlinecourses.nptel.ac.in/noc21_cs16/preview
CBIT (A) With effect from the Academic Year 2023-24

20CSE30
DEEP LEARNING LAB
(Professional Elective – IV)
Instruction 2 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 50 Marks
Continuous Internal Evaluation 50 Marks
Credits 1

Pre-requisites: Artificial Intelligence, Machine Learning.

Course Objectives: The objectives of this course are,

1. To learn Deep learning techniques and their applications.
2. To acquire the knowledge of neural network architectures, Deep learning methods, models and
algorithms.
3. To understand CNN and RNN algorithms and their applications.

Course Outcomes: On successful completion of the course, students will be able to,
1. Understand various deep learning models.
2. Design and develop various Neural Network Architectures.
3. Understand approximate reasoning using Convolution Neural Networks.
4. Analyze and design deep learning algorithms for different applications.
5. Ability to apply CNN and RNN techniques to solve various applications.
6. Evaluate the Performance of different models of deep learning networks.

List of Experiments:
1. Implementation of Classification with Multilayer Perceptron using Scikit-learn (MNIST Dataset).
2. Understanding of Deep learning Packages Basics: Tensorflow, Keras, Theano and PyTorch.
3. Improve the performance of Deep Learning models with Hyper-Parameter Tuning.
4. Illustrate the Performance of various Optimization techniques of Gradient Descent (GD), Momentum
Based GD, Nesterov Accelerated GD, Stochastic GD, AdaGrad, RMSProp, Adam.
5. Implementation of Denoising, Sparse and Contractive autoencoders
6. Evaluate the Performance of the model using various Regularization Techniques.
7. Train a Deep learning model to classify a given image using pre trained model of AlexNet, ZF-Net,
VGGNet, GoogLeNet, ResNet.
8. Implementation of deep learning model using Guided Backpropagation
9. Implementation of Language Modelling using RNN
10. Implementation of Encoder Decoder Models

Text Books:
1. Goodfellow. I., Bengio. Y. and Courville. A., “Deep Learning “, MIT Press, 2016.
2. Giancarlo Zaccone, Md. RezaulKarim, Ahmed Menshawy "Deep Learning with TensorFlow: Explore
neural networks with Python", Packt Publisher, 2017.
3. Huang, Shih-Chia, and Trung-Hieu Le. “Principles and labs for deep learning”. Academic Press, 2021.

Online Resources:
1. https://onlinecourses.nptel.ac.in/noc18_cs41/
2. https://onlinecourses.nptel.ac.in/noc22_cs22/
3. https://onlinecourses.nptel.ac.in/noc19_cs85/
CBIT (A) With effect from the Academic Year 2023-24

20CSE31
BIG DATA ANALYTICS LAB
(Professional Elective – IV)
Instruction 2 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 50 Marks
Continuous Internal Evaluation 50 Marks
Credits 1

Pre-requisites: Database management systems, Programming for problem solving, OOPs.

Course Objectives: The objectives of this course are,

1. To implement MapReduce programs for processing big data.
2. To realize storage of big data using MongoDB.
3. To analyze big data using machine learning techniques such as Decision tree classification and
clustering.

Course Outcomes: On successful completion of the course, students will be able to,
1. Understand Configuration of various Bigdata Frame Works.
2. Apply various visualization techniques to explore data.
3. Demonstrate data base operations using MongoDB.
4. Process big data using Hadoop framework.
5. Build and apply Map-Reduce & NoSql Concepts.
6. Perform data analysis with machine learning methods.

List of Experiments:
1. Install, configure and run python, numPy and Pandas.
2. Install, configure and run Hadoop and HDFS.
3. Visualize data using basic plotting techniques in Pyhton.
4. Implement NoSQL Database Operations: CRUD operations, Arrays using MongoDB.
5. Implement Functions: Count – Sort – Limit – Skip – Aggregate using MongoDB.
6. Implement word count / frequency programs using MapReduce.
7. Implement a MapReduce program that processes a dataset.
8. Implement Linear Regression using SPARK
9. Implement Decision tree / Naïve base classification techniques using SPARK
10. Implement clustering techniques using SPARK

Case Studies:
1. Implement an application that stores big data in MongoDB / Pig using Hadoop / R.
2. Map Reduce I/O Formats-Text, key-value Map ReduceI/O Formats –Nline, Multiline
3. Map Side Join, Reduce side Join Building and Running a Spark Application Word count in Hadoop
and Spark Manipulating RDD.

Text Books:
1. Mike Frampton, “Mastering Apache Spark”, Packt Publishing, 2015.
2. TomWhite, “Hadoop:TheDefinitiveGuide”, O’Reilly, 4thEdition, 2015.
3. NickPentreath, “Machine Learning with Spark”, PacktPublishing, 2015.
4. Mohammed Guller, “Big Data Analytics with Spark”, Apress, 2015
5. Donald Miner, Adam Shook, “Map Reduce Design Pattern”, O’Reilly, 2012
CBIT (A) With effect from the Academic Year 2023-24

20CSE32
MOBILE APPLICATION DEVELOPMENT LAB
(Professional Elective – IV)
Instruction 2 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 50 Marks
Continuous Internal Evaluation 50 Marks
Credits 1

Pre-requisites: Programming for problem solving.

Course Objectives: The objectives of this course are,

1. To learn how to develop Applications for android environments.
2. To learn how to develop user interface applications.
3. To learn how to develop URL related applications.

Course Outcomes: On successful completion of the course, students will be able to,
1. Analyze all the components and their properties of various Emulators for selecting suitable emulator.
2. Apply essential Android programming concepts for developing efficient mobile app.
3. Develop Android applications related to various layouts.
4. Design Flutter applications with rich user interactive interfaces.
5. Develop Android applications related to mobile related server-less database like SQLite.
6. Extend event handling to develop various mobile applications.

List of Experiments:
1. Create an Android application that shows Hello + name of the user and run it on an emulator. (b)
Create an application that takes the name from a text box and shows hello message along with the name
entered in text box, when the user clicks the OK button.
2. Create a screen that has input boxes for User Name, Password, Address, Gender (radio buttons for male
and female), Age (numeric), Date of Birth (Date Picket), State (Spinner) and a Submit button. On
clicking the submit button, print all the data below the Submit Button. Use (a) Linear Layout, (b)
Relative Layout and (c) Grid Layout or Table Layout.
3. Develop an application that shows names as a list and on selecting a name it should show the details of
the candidate on the next screen with a “Back” button. If the screen is rotated to landscape mode (width
greater than height), then the screen should show list on left fragment and details on right fragment
instead of second screen with back button. Use Fragment transactions and Rotation event listener.
4. Develop an application that uses a menu with 3 options for dialing a number, opening a website and to
send an SMS. On selecting an option, the appropriate action should be invoked using intents.
5. Develop an application that inserts some notifications into Notification area and whenever a
notification is inserted, it should show a toast with details of the notification.
6. Create an application that uses a text file to store user names and passwords (tab separated fields and
one record per line). When the user submits a login name and password through a screen, the details
should be verified with the text file data and if they match, show a dialog saying that login is
successful. Otherwise, show the dialog with Login Failed message.
7. Create a user registration application that stores the user details in a database table.
8. Create a database and a user table where the details of login names and passwords are stored. Insert
some names and passwords initially. Now the login details entered by the user should be verified with
the database and an appropriate dialog should be shown to the user.
9. Create an application for Alarm clock with Snooze ability, i.e., if user don’t off the alarm when it rings,
then alarm should repeat for every 10 minutes until user turns it off.
10. Create an App to demonstrate ActionBar for application navigation.
11. Create Flutter and iOS Apps using Dart language for UI Building, Basic widget exploration, Material
components exploration, Widgets catalog exploration.
12. Flutter and iOS apps for Adding interactivity, Routing and navigation, Read and write with Dart IO:
Setup, Read and write with Dart IO: Final code.

Text Books:
1. David Wolber, Hal Abelson, Ellen Spertus & Liz Looney, “App Inventor-Create your own Android
Apps”, O’Reilly, 2011.
CBIT (A) With effect from the Academic Year 2023-24

2. Dieter Meiller, “Modern App Development with Dart and Flutter 2”, Walter de Gruyter GmbH, Berlin/
Boston, 2021

Tools:
1. Android Studio 4.1.3

Online Resources:
1. https://developer.android.com/studio?gclid=Cj0KCQjwyN-
DBhCDARIsAFOELTkESs57QOqIUktCOBZKgk8NkVT5OhpCnxUx4V6yDMPt6c-Ot7j4-
sEaAiasEALw_wcB&gclsrc=aw.ds
2. https://onlinecourses.nptel.ac.in/noc20_cs52/preview
3. https://onlinecourses.swayam2.ac.in/nou21_ge41/preview
CBIT (A) With effect from the Academic Year 2023-24

20CSE33
BLOCKCHAIN TECHNOLOGY LAB
(Professional Elective – IV)
Instruction 2 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 50 Marks
Continuous Internal Evaluation 50 Marks
Credits 1

Pre-requisites: Data Structures, Cryptography and Network Security, Distributed Systems.

Course Objectives: The objectives of this course are,

1. To introduce the fundamental primitives of Blockchain and consensus protocols.
2. To explore various blockchain platforms.
3. To understand and develop smart contracts.
4. To understand the significance of Hyperledger Fabric.
5. To apply blockchain securely in various sectors ranging from Financial to Government.

Course Outcomes: On successful completion of the course, students will be able to

1. Understand the fundamental primitives of Blockchain and consensus protocols.
2. Explore various blockchain platforms such as ethereum, fabric.
3. Identify the significance and working of Ethereum Platform.
4. Work with the smart contracts.
5. Implement the blockchain applications with Hyperledger Fabric.S
6. Apply blockchain in different application domains such as financial and supply chain sectors.

List of Programs:
1. Understanding Blockchain Foundations: Elements of Distributed Computing, Elements of
Cryptography, digital signature.
2. Introduction to Solidity Programming with basic syntax's.
3. Getting Familiar with Development environments like: MIX (The DApp IDE), Ether.camp, and Truffle
etc.
4. Working with tools like Remix, Ganache, MetaMask etc to build and deploy the smart contracts.
5. Setup a MetaMask Ethereum wallet in the web browser to create wallets (User Accounts) and use it to
send and receive Ethers.
6. Create a genesis block to set up the private blockchain network using Go Ethereum (Geth) and Mist,
start mining with miner.start() command.
7. Use EtherScan to view the transaction details, explore Blockchain test networks to perform
transactions, execute smart contracts.
8. Hyperledger Fabric Demo.
9. Deploy any real world applications in various sectors such as Financial, Digital identity, Education,
Healthcare, Agriculture, Land registrations etc.on a suitable Blockchain platform.

Text Books:
1. Bettina Warburg, Bill Wanger and Tom Serres, “Basics of Blockchain” 1st Edition, independently
published, 2019.
2. Reed, Jeff, Smart contracts: “The essential guide to using blockchain smart contracts for cryptocurrency
exchange” 1st Edition,, CreateSpace Independent Publishing Platform, 2016.

Suggested Reading:
1. Diedrich Henning, Ethereum: “blockchains, digital assets, smart contracts, decentralized autonomous
organizations” 1st Edition, Wildfire Publishing, 2016.
2. Antonopoulos and Andreas M., “Mastering Bitcoin: unlocking digital cryptocurrencies” 1st Edition,
O’Reilly Media, Inc., 2015.

Online Resources:
1. Hyperledger Tutorials - https://www.hyperledger.org/use/tutorials
6. Ethereum Development Resources - https://ethereum.org/en/developers
CBIT (A) With effect from the Academic Year 2023-24

20CAE14
PLANNING AND ESTIMATION OF AUTONOMOUS SYSTEMS LAB
(Professional Elective – IV)
Instruction 2 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 50 Marks
Continuous Internal Evaluation 50 Marks
Credits 1

Pre-requisites: Probability, Calculus, Design and Analysis of Algorithms, Artificial Intelligence, Machine
Learning, Deep Learning, Python

Course Objectives: The objectives of this course are,

1. To cover the concepts, principles and methods for decision-making under partially known or uncertain
environments.
2. To learn decision theory and reinforcement learning.

Course Outcomes: On successful completion of the course, students will be able to,
1. Identify different motion planning schemas under different environments.
2. Implement different planning and decision techniques.
3. Appraise and implement methods to solve finite Markov decision problem under uncertain situation.
4. Understand different decision making techniques under uncertain environment.
5. Programming different autonomous system and interaction with environment.
6. Identify and explore autonomous system in real-life situations.

List of experiments:
1. State Estimation implementation using Bayes Filter
2. State Estimation implementation using Kalman Filter
3. Implement path planning algorithms - Search-based Planning
4. Implement path planning algorithms - Sampling-based Planning
5. Implement Markov Decision process-Uncertainty
6. Implement POMDPs: Partially Observable Markov Decision Processes
7. Simulate the movement of the Drone
8. Simulate the movement of the Car
9. Simulate the movement of the multiple autonomous systems
10. Case study on Simulation of Real-time scenarios

Text Books:
1. Eugene Kagan, Nir Shvalb, Irad Ben-Gal, "Autonomous Mobile Robots and Multi-Robot Systems:
Motion-Planning, Communication, and Swarming", Wiley, 2019.
2. Enes Bilgin, "Mastering Reinforcement Learning with Python", Packt Publishing, 2020.

Suggested Reading:
1. Todd Litman, "Autonomous Vehicle Implementation Predictions: Implications for Transport Planning",
Victoria Transport Policy Institute, 2022.

Online Resources:
1. Autonomous Systems, https://www.udacity.com/school-of-autonomous-systems
2. AirmSim simulation, https://microsoft.github.io/AirSim/
CBIT (A) With effect from the Academic Year 2023-24

20CSC32
TECHNICAL SEMINAR
Instruction 2 Hours per week
Duration of End Examination -
Semester End Examination -
Continuous Internal Evaluation 50 Marks
Credits 1

The goal of a seminar is to introduce students to critical reading, understanding, summarizing, explaining and
preparing report on state of the art topics in a broad area of his/her specialization. Seminar topics may be chosen
by the students with advice from the faculty members and the student shall read further relevant articles in the
domain.
The seminar must be clearly structured and the power point presentation shall include following aspects:
1. Introduction to the topic
2. Literature survey
3. Consolidation of available information
4. Summary and Conclusions
5. References
Each student is required to:
1. Submit a one page synopsis of the seminar talk for display on the notice board.
2. Deliver the seminar for a maximum duration of 30 minutes, where the presentation should be for 20
minutes in PowerPoint, followed by Question and Answers session for 10 minutes.
3. Submit the detailed report of the seminar in spiral bound in a précised format as suggested by the
department.
Course Outcomes: At the end of the course, students will be able to:
1. Study and review research papers of new field/areas and summarize them.
2. Identify promising new directions of various cutting edge technologies in Computer Science and
Engineering
3. Impart skills to prepare detailed report describing the selected topic/area.
4. Acquire skills to write technical papers/articles for publication.
5. Effectively communicate by making an oral presentation before the evaluating committee.

Seminars are to be scheduled from 3rd week to the last week of the semester and any change in schedule
shall be discouraged. For the award of sessional marks students are judged by three (3) faculty members
and are based on oral and written presentations as well as their involvement in the discussions during the
oral presentation.
Note: Topic of the seminar shall preferably be from any peer reviewed recent journal publications.

Guidelines for awarding Marks

S. No. Description Max. Marks
1 Contents and Relevance 10
2 Presentation Skills 10
3 Preparation of Presentation slides 05
4 Question and Answers 05
5 Report in prescribed format 20
CBIT (A) With effect from the Academic Year 2023-24

20CSC33
PROJECT PART - I
Instruction 4 Hours per week
Duration of End Examination -
Semester End Examination -
Continuous Internal Evaluation 50 Marks
Credits 2

The objective of ‘Project Phase – I’ is to enable the student take up an investigative study in the broad field of
Computer Science and Engineering, either fully theoretical/practical or involving both theoretical and practical
work to be assigned by the Department on an individual basis or two/three students in a group, under the
guidance of a supervisor. This is expected to provide a good initiation for the student(s) towards R&D. The work
shall include:
1. Survey and study of published literature on the assigned topic;
2. Working out a preliminary Approach to the Problem relating to the assigned topic;
3. Conducting preliminary Analysis/ Modelling / Simulation / Experiment / Design /Feasibility;
4. Preparing a Written Report on the Study conducted for Presentation to the Department;
5. Final Seminar, as oral Presentation before the Department Review Committee.

Course Outcomes: By the end of course, students will be able to:

1. Review the literature related to the problem area / selected topic.
2. Undertake problem identification, formulation and solution.
3. Prepare synopsis of the selected topic.
4. Gather the required data and Set up the environment for the implementation.
5. Conduct preliminary analysis/modelling/simulation experiment.
6. Communicate the work effectively in both oral and written forms.

Guidelines for awarding CIE (Max. Marks: 100)

Max.
Evaluation by Evaluation Criteria / Parameter
Marks
20 Project Status / Review
Supervisor
5 Report Submission
5 Relevance of the Topic
Department 5 Presentation Slide Preparation
Review
5 Presentation
Committee
(DRC) 5 Question and Answers
5 Quality of Report
CBIT (A) With effect from the Academic Year 2023-24

20CSI03
INTERNSHIP - III
Instruction 3 to 4 weeks / 90
Continuous Internal Evaluation 50
Credits 3
CBIT (A) With effect from the Academic Year 2023-24

CHAITANYA BHARATHI INSTITUTE OF TECHNOLOGY(A)

SCHEME OF INSTRUCTIONS AND EXAMINATION
Model Curriculum(R-20)

B.E. (Computer Science and Engineering)

SEMESTER –VIII
Scheme of
Scheme of Examination
Instruction
S.
Course Code Title of the Course Duration Maximum Credits
No Hours per Week
of SEE Marks
L T P/D in Hours CIE SEE
THEORY
1. 20CSEXX PEC – VI 3 - - 3 40 60 3

2. 20EGM04 Gender sensitization 2 - - 2 - 50 -

3. 20CEM01 Environmental Science 2 - - 2 - 50 -

PRACTICAL
4. 20CSC39 Project Part - II - - 8 - 100 100 4
TOTAL 7 - 8 - 140 260 7
L: Lecture T: Tutorial D: Drawing P: Practical
CIE - Continuous Internal Evaluation SEE - Semester End Examination

Professional Elective - VI
20CAE05 Multi Agent Intelligent Systems
20CSE34 Cloud Computing
20CSE35 Augmented Reality and Virtual Reality
20CSE36 Cyber Security
20CSE37 High Performance Computing
CBIT (A) With effect from the Academic Year 2023-24

20CAE05
MULTI AGENT INTELLIGENT SYSTEMS
(Professional Elective – VI)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Linear Algebra and Calculus, Artificial Intelligence.

Course Objectives: The objectives of this course are,

1. To learn various types of multi agent systems and their applications.
2. To acquire the knowledge of various multi agent system architectures and their learning methods.
3. To understand multi agent decision making systems and their applications.

Course Outcomes: On Successful completion of this course, student will be able to,
1. Understand various aspects of multi agent systems and architecture of intelligent agents.
2. Understand of various types of reasoning Agents.
3. Acquire knowledge of multi agent systems communication and cooperation methods.
4. Classify various types of decision making processes for multi agent systems.
5. Use appropriate framework for agent communication and information sharing processes.
6. Explore different kinds of Auctions for multi agent environment and applications.

UNIT - I
Introduction: The Vision Thing, Some Views of the Field, Agents as a paradigm for software engineering,
Agents as a tool for understanding human societies
Intelligent Autonomous Agents: Intelligent Agents, agent and objects, agents and expert systems, agents as
intentional systems, Abstract Architectures for Intelligent Agents.

UNIT - II
Deductive Reasoning agents: Agents as theorem Provers, Agent-Oriented programming.
Practical Reasoning Agents: Practical Reasoning equals Deliberation plus Means-Ends Reasoning, Means-
Ends Reasoning, HOMER, The Procedural reasoning System.
Reactive and Hybrid Agents: Reactive Agents -The subsumption architecture, PENGI, Limitations of reactive
agents. Hybrid agents -Touring Machines.

UNIT - III
Understanding Each Other: Ontology Fundamentals, Ontology Languages, RDF.
Communicating: Speech Acts – Austin, Searle, Speech acts as rational action, Agent Communication
Languages -KQML.
Working Together: Cooperative Distributed Problem Solving, Task sharing and Result sharing-Task sharing in
the Contract Net. Result Sharing, Combining Task and Result Sharing, Handling Inconsistency, coordination.

UNIT - IV
Multi agent Decision Making - Multi Agent Interactions: Utilities and Preferences, Setting the Scene, The
Prisoner’s Dilemma.
Making Group Decisions: Social welfare Functions and Social Choice Functions, Voting Procedures- Plurality,
Sequential majority elections.
Forming Coalitions: cooperative Games

UNIT - V
Allocating Scarce Resources: Classifying Auctions, Auctions for Single items - English auctions, Dutch
auctions. Combinatorial auctions - Bidding Languages. Auctions in Practice-Online auctions, Adwords auctions
Applications: Agents for Workflow and Business Process Management, Agents for Distributed Sensing, Agents
for Information Retrieval and Management, Agents for Electronic Commerce, Agents for Human - Computer
Interfaces, Agents for Virtual Environments, Agents for Social Simulation, Agents for X.

Text Books:
1. Michae L Wooldridg E, “An Introduction to Multi Agent Systems”, Wiley publications, 2nd Edition,
CBIT (A) With effect from the Academic Year 2023-24

2009.

Suggested Reading:
1. Stuart Russell and Peter Norvig, “Artificial Intelligence: A Modern Approach”, 4th Global edition,
2021.
2. Gerhard Weiss, “Multiagent Systems”, Second Edition, 2016.

Online Resources:
1. https://www.coursera.org/lecture/modeling-simulation-natural-processes/multi-agent-systems-kAKyC
CBIT (A) With effect from the Academic Year 2023-24

20CSE34
CLOUD COMPUTING
(Professional Elective – VI)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Data communication and computer networks.

Course Objectives: The objectives of this course are,

1. To understand the significance services of cloud computing.
2. To understand about the cloud infrastructure and Technologies.
3. To learn the security implementation features in cloud computing.

Course Outcomes: On Successful completion of this course, student will be able to,
1. Understand the need of cloud technology and terminology.
2. Identify and understand the cloud infrastructure.
3. Write scripts for the automation of infrastructure and software deployment
4. Design solutions for the automation and migration of manual data centers.
5. Develop scripts for the automation of cloud services

UNIT – I
Era of Cloud Computing – Motivation, Elastic Computing and advantages- Multi-Tenant clouds, Elastic
computing, Virtualized servers uses, Business model for Cloud Providers. Types of Clouds and Cloud Providers,
Multi-Cloud, Hyperscalers, advantages of clouds; Data Centre Infrastructure- racks, aisles, pods, power and
cooling, air cooling, thermal containment and hot/cold aisles, exhaust Ducts, lights-out data centers, smart
network interfaces.

UNIT – II
Virtualization and Containers -Virtual machines, hypervisor, approaches to virtualization, advantages and
disadvantages of VMs, Virtual I/O devices, VM migration; Traditional apps and elasticity on demand, isolation
facilities in an OS, Linux namespaces for isolation, container approaches, Docker.

UNIT – III
Virtual Networks – Goals of a data center network, Network hierarchies, capacity, Fat Tree Designs. Link
aggregation, VLANS, VXLAN, NAT, Managing virtualization and mobility, SDNs, openflow protocol,
Programming networks; Virtual Storage: NAS, SAS, mapping virtual disks to physical disks.

UNIT – IV
Automation and Cloud Programming - Need of automation, levels, AIops, automation tools, automation of
manual data center practices, evolution of automation; Orchestration: legacy of automating procedures, larger
scope of automation, Kubernetes MapReduce, Microservices, Serverless computing, event processing, DevOps,
Edge Computing and IIoT.

UNIT – V
Cloud security and Privacy – cloud specific problems, zero trust security model, identity management,
privileged access management(PAM), AI technologies and their effects on their security,
Protection of remote access and privacy in a cloud environment, back doors, side channels and other concerns,
firewalls.

Text Books:
1. Douglas Comer “The Cloud Computing Book: The Future of Computing Explained”, Chapman and
Hall/CRC, 1st Edition Kindle Edition, 2021.
2. Anthony T Velte, Toby J, Robert Elenpeter, “Cloud Computing – A Practical Approach”, McGra Hill,
2010.
3. https://www.amazon.in/Cloud-Computing-Book-Future-
Explained/dp/0367706806?asin=B097N7NKJD&revisionId=&format=4&depth=1
CBIT (A) With effect from the Academic Year 2023-24

20CSE35
AUGMENTED REALITY AND VIRTUAL REALITY
(Professional Elective – VI)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Programming for problem solving, Internet and web technologies, machine learning, deep
learning.

Course Objectives: The objectives of this course are,

1. To explore the history of spatial computing and design interactions.
2. To understand the fundamental principles describing how hardware, computer vision algorithms
functions.
3. To learn Virtual reality animation and 3D Art optimization.
4. To demonstrate Virtual reality.
5. To develop visualization tools.

Course Outcomes: On successful completion of the course, students will be able to,
1. Explain how the humans interact with computers.
2. Apply technical and creative approaches to make successful applications and experiences.
3. Design audio and video interaction paradigms.
4. Understand AR and VR best practices.
5. Apply VR/MR/AR in various fields in industry.

UNIT - I
How Humans interact with Computers: Introduction, modalities through the ages, types of common HCI
modalities, new modalities, the current state of modalities for spatial computing devices, current controllers for
immersive computing systems, hand tracking and hand pose recognition.
Designing for Senses: Envisioning a future, sensory technology explained, Sensory design, five sensory
principles, Adobe’s AR story.

UNIT - II
Virtual Reality for Art: A more natural way of making 3D art, VR for animation.
3D art optimization: Introduction, draw calls, using VR tools for creating 3D art, acquiring 3D models vs
making them from scratch.
How augmented reality works: a brief history of AR, how and why to select an AR platform, mapping,
platforms, other development considerations, the AR cloud.

UNIT - III
Virtual reality and augmented reality: cross platform theory, the role of game engines, understanding 3D
graphics, portability lessons from video game design, simplifying the controller input.
Virtual reality toolkit: open source framework for the community.

UNIT - IV
Virtual Reality and Augmented Reality Development Best Practices: Handling Locomotion in VR and AR,
Effective Use of Audio in VR and AR, Common Interactions Paradigms.
Character AI and Behaviors: Introduction, behaviors, current practice: Reactive AI, more intelligence in the
system, Deliberative AI, machine learning.

UNIT - V
Use Cases in Embodied Reality
The virtual and augmented reality health technology ecosystem: VR/AR health technology application
design, case studies.
Key Principles of AR and VR for Sports
Virtual Reality Enterprise Training Use Cases and Ideal Training Scenarios.
CBIT (A) With effect from the Academic Year 2023-24

Text Books:
1. Erin Pangilinan, Steve Lukas and Vasanth Mohan, “Creating Augmented & Virtual Realities: Theory
and Practice for Next-Generation Spatial Computing”, 1st edition, O’REILLY, 2019.
2. Steve Aukstakalnis, “Practical Augmented Reality: A Guide to the Technologies, Applications, and
Human Factors for AR and VR”, Pearson Education, 2017.
3. Schmalstieg and Hollerer, “Augmented Reality: Principles & Practice”, Pearson Education, 2016.
4. Paul Mealy, “Virtual & Augmented Reality”, John Wiley & Sons, 2018.

Suggested Reading:
1. Greengard, Samuel, "Virtual Reality", MIT Press, 2019.
2. Robert Scoble, Shel Israel, "The Fourth Transformation: How Augmented Reality & Artificial
Intelligence Will Change Everything", Patrick Brewster Press, 1st Edition, 2016.
3. Tony Parisi, "Learning Virtual Reality: Developing Immersive Experiences and Applications for
Desktop, Web, and Mobile", O’Reilly Media; 1st Edition, 2015.
4. Tony Parisi, “Programming 3D Applications with HTML5 and WebGL: 3D Animation and
Visualization for Web Pages", O’Reilly Media; 1 Edition, 2014.
5. Jos Dirksen, “Learning Three.js: The JavaScript 3D Library for WebGL", 2nd Revised Edition, Packt
Publishing, 2015.
6. Jos Dirksen, "Learning Three.js : programming 3D animations and visualizations for the web with
HTML5 and WebGL”, 3rd Edition, 2018
CBIT (A) With effect from the Academic Year 2023-24

20CSE36
CYBER SECURITY
(Professional Elective – VI)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Operating Systems, Data communications and computer networks, Cryptography and network
security.

Course Objectives: The objectives of this course are,

1. To identify and understand methods and tools used in cybercrimes.
2. To collect, process, analyze and present Computer Forensics Evidence.
3. To understand the legal perspectives and organizational implications of cyber security.

Course Outcomes: On Successful completion of this course, student will be able to,
1. List the different types of cybercrimes and analyze legal frameworks to handle cybercrimes.
2. Discuss the cyber offence and vulnerabilities in programming languages.
3. Identify the Tools and Methods used in cybercrimes.
4. Analyze and resolve cyber security issues and laws governing Cyberspace.
5. Describe the need of Digital Forensics and the importance of digital evidence in prosecution.
6. Interpret the commercial activities in the event of significant information security incidents in the
Organization.

UNIT - I
Introduction to Cyber Crime: Cyber Crime: Definition and Origins of the Word, Cybercrime and Information
Security, Classification of Cyber Crimes, Cyber Crime: The Legal Perspective, Cyber Crime: An Indian
Perspective.

UNIT - II
Cyber Offenses: Introduction, How Criminals plan the Attacks, Social Engineering, Cyber stalking, Cyber Cafe
and Cybercrimes, Botnets: The Fuel for Cybercrime, Attack Vector, Buffer Overflow, How Browsers Work,
Google Dorking, Scanning the Entire Internet: Masscan and Shodan.
Building Secure Software: Memory corruption attack, Vulnerability in programming language, Virtual
memory layout of C Program, Buffer overflow attack in C and C++, Pointer attacks, Heap Overflow, Integer
Overflow.

UNIT - III
Tools and Methods Used in Cybercrime: Introduction, Proxy Servers and Anonymizers, Phishing, Password
Cracking, Keyloggers and Spywares, Virus and Worms, Trojan Horse and Backdoors, Steganography, DoS and
DDoS attacks, Injection Attacks, SQL Injection, Ransomware, Cross-Site Scripting Attacks, ARP Spoofing
Attacks, SYN Floods and detecting SYN Scans.

UNIT – IV
Cyber Security: The Legal Perspectives: Cyber Crime and the Legal Landscape around the World, Need of
Cyber laws: the Indian Context, The Indian IT Act, Amendments to IT Act, Positive and week areas of IT Act,
Challenges to Indian Law and Cyber Crime Scenario in India, Digital Signatures and the Indian IT Act, Data
Protection Act 2019.

UNIT – V
Understanding Cyber Forensics: Introduction, Need for Computer Forensics, Cyber Forensics and Digital
Evidence, Forensics Analysis of Email, Digital Forensics Life Cycle, Chain of Custody Concept, Network
Forensics, Challenges in Computer Forensics.
Cyber Security: Organizational Implications: Introduction, Cost of Cybercrimes and IPR issues, Software
Piracy, Web threats for Organizations, Security and Privacy Implications, Social media marketing: Security
Risks and Perils for Organizations, Social Computing and the associated challenges for Organizations.
CBIT (A) With effect from the Academic Year 2023-24

Text Books:
1. Sunit Belpre and Nina Godbole, “Cyber Security: Understanding Cyber Crimes, Computer Forensics
and Legal Perspectives”, Wiley India Pvt. Ltd, 2011.
2. Malcolm McDonald “Web Security for Developers” Starch Press, June 2020.
3. Daniel G. Graham “Ethical Hacking: A Hands-on Introduction to Breaking in” Starch Press, 2021.
4. Kevin Mandia, Chris Prosise, “Incident Response and computer forensics”, Tata McGraw Hill, 2006.

Suggested Reading:
1. Alfred Basta, Nadine Basta, Mary Brown, Ravinder Kumar, “Cyber Security and Cyber Laws”,
Paperback, 2018.
2. Mark F Grady, Fransesco Parisi, “The Law and Economics of Cyber Security”, Cambridge university
press, 2006.

Online Resources:
1. https://onlinecourses.swayam2.ac.in/nou19_cs08/preview
2. https://onlinecourses.swayam2.ac.in/cec20_cs15/preview
CBIT (A) With effect from the Academic Year 2023-24

20CSE37
HIGH PERFORMANCE COMPUTING
(Professional Elective – VI)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Prerequisites: Computer architecture and microprocessor, Operating systems, Data Structures, Programming
for problem solving, OOPs, Design and analysis of algorithms.

Course Objectives: The objectives of this course are,

1. To become good at parallel computing algorithm design.
2. To learn modeling and problem solving using different types of parallel computing architectures.
3. To measure the performance of parallel algorithms and arrive at reasonable estimates of cost tradeoffs.
4. To learn various paradigms in algorithm design for computationally intensive applications.
5. To understand the use of modern multi-processor and multi-core architectures.

Course Outcomes: On successful completion of the course, students will be able to,
1. Understand different parallel computing architectures and networks.
2. Ability to design parallel algorithms and measure their performance.
3. Understand vector processing, memory bottlenecks, data and thread-level parallelism.
4. Understand the various programming frameworks like MPI, OpenMP and CUDA.
5. Understand cache coherence protocols and read-write semantics of parallel programs.
6. Gain knowledge of writing efficient parallel programs.

UNIT - I
Modern Processors: Stored-Program Computer Architecture, General-Purpose cache-based Microprocessor
Architecture, Memory Hierarchies, Multicore processors, Multithreaded processors, Vector processors.
Basic optimization techniques for serial code: Scalar profiling, Common sense optimizations, Simple
measures, large impact, the role of compilers, Data access optimization.

UNIT - II
Parallel computers: Taxonomy of parallel computing paradigms, Shared-memory computers, Distributed-
memory computers, Hierarchical (hybrid) systems, Networks.
Basics of parallelization: Why parallelize? Parallelism, Parallel scalability

UNIT - III
Shared-memory parallel programming with OpenMP: Introduction to OpenMP, Profiling OpenMP
programs, Performance pitfalls, Case study: OpenMP-parallel Jacobi algorithm.

UNIT - IV
Distributed-memory parallel programming with MPI: Message passing, Introduction to MPI, MPI
performance tools, Communication parameters, Synchronization, serialization, contention, Reducing
communication overhead, Case study: Parallel sparse matrix-vector multiply.

UNIT - V
CUDA: Understanding the CUDA computing model and the API using nvcc compiler, Introduction to modern
super computing architectures featuring NVIDIA processors

Text Books:
1. Georg Hager, Gerhard Wellein, “Introduction to High Performance Computing for Scientists and
Engineers”, Chapman & Hall / CRC Computational Science series, 2011.
2. Ananth Grama, George Karypis, Vipin Kumar, Anshul Gupta, “Introduction to Parallel Computing”,
Second Edition, Addison-Wesley, 2003.
3. Shane Cook, Morgan “CUDA Programming a Developer’s Guide to Parallel Computing with GPUs”
Kaufman Publishers.
CBIT (A) With effect from the Academic Year 2023-24

Suggested Reading:
1. Michaek J. Quinn, “Parallel Computing: Theory and Practice”, Second Edition, Tata McGraw-Hill
Edition.
2. V. Rajaraman, C. Siva Ram Murthy, “Parallel Computers: Architectures and Programming”, PHI.
3. Michael Quinn, “Parallel Programming in C with MPI and OpenMP”, McGraw-Hill Publisher.
4. John Hennessey and David Patterson, “Computer Architecture A Quantitative Approach”, Morgan
Kaufman Publishers.
CBIT (A) With effect from the Academic Year 2023-24

20EGMO4
GENDER SENSITIZATION
Instruction 2 Hours per week
Duration of End Examination 2 Hours
Semester End Examination 50 Marks
Continuous Internal Evaluation -
Credits -

Course Objectives: The objectives of this course are,

1. Sensibility regarding issues of gender in contemporary India.
2. A critical perspective on the socialization of men and women.
3. Popular debates on the politics and economics of work while helping them reflect critically on gender
violence.

Course Outcomes: On Successful completion of this course, student will be able to,
1. Understand the difference between “Sex” and “Gender” and be able to explain socially constructed
theories of identity.
2. Recognize shifting definitions of “Man” and “Women” in relation to evolving notions of “Masculinity”
and “Femininity”.
3. Appreciate women’s contributions to society historically, culturally and politically.
4. Analyze the contemporary system of privilege and oppressions, with special attention to the ways
gender intersects with race, class, sexuality, ethnicity, ability, religion, and nationality.
5. Demonstrate an understanding of personal life, the workplace, the community and active civic
engagement through classroom learning.

UNIT – I
Understanding Gender:
Gender: Why Should We Study It? (Towards a World of Equals: Unit -1)
Socialization: Making Women, Making Men (Towards a World of Equals: Unit -2)
Introduction. Preparing for Womanhood. Growing up Male. First lessons in Caste. Different Masculinities.

UNIT – II
Gender and Biology:
Missing Women: Sex Selection and Its Consequences (Towards a World of Equals: Unit -4)
Declining Sex Ratio. Demographic Consequences.
Gender Spectrum: Beyond the Binary (Towards a World of Equals: Unit -10)
Two or Many? Struggles with Discrimination.

UNIT – III
Gender and Labour:
Housework: the Invisible Labour (Towards a World of Equals: Unit -3)
“My Mother doesn’t Work.” “Share the Load.”
Women’s Work: Its Politics and Economics (Towards a World of Equals: Unit -7)
Fact and Fiction. Unrecognized and Unaccounted work. Additional Reading: Wages and Conditions of Work.

UNIT - IV
Issues of Violence
Sexual Harassment: Say No! (Towards a World of Equals: Unit -6)
Sexual Harassment, not Eve-teasing- Coping with Everyday Harassment- Further Reading: “Chupulu”.
Domestic Violence: Speaking Out (Towards a World of Equals: Unit -8)
Is Home a Safe Place? -When Women Unite [Film]. Rebuilding Lives. Additional Reading: New Forums for
Justice.
Thinking about Sexual Violence (Towards a World of Equals: Unit -11)
Blaming the Victim-“I Fought for my Life….” - Additional Reading: The Caste Face of Violence.

UNIT – V
Gender: Co - Existence
Just Relationships: Being Together as Equals (Towards a World of Equals: Unit -12)
Mary Kom and Onler. Love and Acid just do not Mix. Love Letters. Mothers and Fathers.
CBIT (A) With effect from the Academic Year 2023-24

Additional Reading: Rosa Parks-The Brave Heart.

Text Books:
1. Suneetha, Uma Bhrugubanda, DuggiralaVasanta, Rama Melkote,VasudhaNagaraj, AsmaRasheed,
GoguShyamala, DeepaSreenivas and Susie Tharu “Towards a World of Equals: A Bilingual Textbook
on Gender” published by Telugu Akademi, Hyderabad, Telangana State, 2015.

Suggested Reading:
1. Menon, Nivedita. Seeing like a Feminist. New Delhi: Zubaan-Penguin Books, 2012.
2. Abdulali Sohaila. “I Fought For My Life…and Won.” Available online at:
http://www.thealternative.in/lifestyle/i-fought-for-my-lifeand-won-sohaila-abdulal/

Online Resources:
1. https://aifs.gov.au/publications/gender-equality-and-violence-against-women/introduction
2. https://theconversation.com/achieving-gender-equality-in-india
CBIT (A) With effect from the Academic Year 2023-24

20CEM01
ENVIRONMENTAL SCIENCE
Instruction 2 Hours per week
Duration of End Examination 2 Hours
Semester End Examination 50 Marks
Continuous Internal Evaluation -
Credits -

Course Objectives: The objectives of this course are,

1. Identify environmental problems arising due to over utilization of natural resources and understand the
importance of use of renewable energy sources
2. Become aware about the importance of eco system and interlinking of food chain.
3. Identify the importance of biodiversity in maintaining ecological balance.
4. Learn about various attributes of pollution management and waste management practices.
5. Contribute for capacity building of nation for arresting and/or managing environmental disasters.

Course Outcomes: On Successful completion of this course, student will be able to,
1. Identify the natural resources and realise the importance of water, food, forest, mineral, energy, land
resources and affects of over utilisation.
2. Understand the concept of ecosystems and realise the importance of interlinking of food chains.
3. Contribute for the conservation of bio-diversity.
4. Suggest suitable remedial measure for the problems of environmental pollution and contribute for the
framing of legislation for protection of environment.
5. Follow the environmental ethics and contribute to the mitigation and management of environmental
disasters.

UNIT - I
Environmental Studies: Definition, Scope and importance, need for public awareness.
Natural resources: Use and over utilization of Natural Resources - Water resources, Food resources, Forest
resources, Mineral resources, Energy resources, Land resources.

UNIT – II
Ecosystems: Concept of an ecosystem, structure and function of an ecosystem, role of producers, consumers
and decomposers, energy flow in an ecosystem, food chains, food webs, ecological pyramids, Nutrient cycling,
Bio-geo chemical cycles, Terrestrial and Aquatic ecosystems.

UNIT – III
Biodiversity: Genetic, species and ecosystem biodiversity, Bio-geographical classification of India, India as a
Mega diversity nation. Values of biodiversity, hot-spots of biodiversity, threats to biodiversity, endangered and
endemic species of India, methods of conservation of biodiversity.

UNIT – IV
Environmental Pollution: Cause, effects and control measures of air pollution, water pollution, marine
pollution, soil pollution, noise pollution and Solid waste management, nuclear hazards
Environmental Legislations: Environment protection Act, Air, Water, Forest & Wild life Acts, issues involved
in enforcement of environmental legislation, responsibilities of state and central pollution control boards

UNIT – V
Social Issues and the Environment: Water conservation methods: Rain water harvesting and watershed
management, Environmental ethics, Sustainable development and Climate change: Global warming, Ozone
layer depletion, forest fires, and Contemporary issues.

Text Books:
1. Y. Anjaneyulu, “Introduction to Environmental Science”, B S Publications, 2004.
2. Suresh K. Dhameja, “Environmental Studies”, S. K. Kataria& Sons, 2009.

Suggested Reading:
1. C. S. Rao,” Environmental Pollution Control Engineering”, Wiley, 1991.
2. S. S. Dara, “A Text Book of Environmental Chemistry &Pollution Control”, S. Chand Limited, 2006.
CBIT (A) With effect from the Academic Year 2023-24

20CSC39
PROJECT PART - II
Instruction 8 Hours per week
Duration of End Examination -
Semester End Examination 100 Marks
Continuous Internal Evaluation 100 Marks
Credits 6

The objective of 'Project: Part Phase - 2' is to enable the student extend further the investigative study taken up,
either fully theoretical/practical or involving both theoretical and practical work, under the guidance of a
Supervisor from the Department alone or jointly with a Supervisor drawn from R&D laboratory/Industry. This is
expected to provide a good training for the student(s) in R&D work and technical leadership. The assignment to
normally include:

1. In depth study of the topic assigned;

2. Review and finalization of the Approach to the Problem relating to the assigned topic;
3. Preparing an Action Plan for conducting the investigation, including team work;
4. Detailed Analysis/Modelling/Simulation/Design/Problem Solving/Experiment as needed;
5. Final development of product/process, testing, results, conclusions and future directions;
6. Preparing a paper for Conference presentation/ Publication in Journals, if possible;
7. Preparing a Dissertation in the standard format for being evaluated by the Department.
8. Final Seminar presentation before Department Review Committee.

Course Outcomes: On Successful completion of this course, student will be able to,
1. Demonstrate a sound technical knowledge of their selected topic.
2. Design engineering solutions to complex problems utilizing a systematic approach.
3. Conduct investigations by using research-based knowledge and methods to provide valid conclusions.
4. Create/select/use modern tools for the modelling, prediction and understanding the limitation of
complex engineering solutions.
5. Communicate with engineers and the community at large in written and oral forms.
6. Demonstrate the knowledge, skills and attitudes of a professional engineer.

Guidelines for awarding CIE (Max. Marks: 100)

Evaluation by Max. Marks Evaluation Criteria / Parameter
10 Review 1
Department Review
15 Review 2
Committee (DRC)
25 Report Submission
10 Regularity and Punctuality
10 Work Progress
Supervisor 10 Quality of the work which may lead to Publication
10 Report Preparation
10 Analytical/ Programming/Experimentation Skills

Guidelines for awarding SEE (Max. Marks: 100)

Evaluation by Max. Marks Evaluation Criteria/Parameter
20 Power Point Presentation
40 Thesis Evaluation
Quality of the Project
External and  Innovation,
Internal Examiners  Applications,
20
together  Live Research Projects,
 Scope for further study,
 Applications to Society
20 Viva-Vice
CBIT (A) With effect from the Academic Year 2022-23

CHAITANYA BHARATHI INSTITUTE OF TECHNOLOGY(A)

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
Model Curriculum(R-20)

OPEN ELECTIVE FOR OTHER PROGRAMME

Scheme of
Scheme of Examination
Instruction
S. Course
Title of the Course Duration Maximum Credits
No Code Hours per Week
of SEE Marks
L T P/D in Hours CIE SEE
ODD SEMESTER
Fundamentals of Virtual
1. 20CSO01 3 - - 3 40 60 3
Reality
Introduction to Web
2. 20CSO02 3 - - 3 40 60 3
Technology
Introduction to Soft
3. 20CSO03 3 - - 3 40 60 3
Computing
4. 20CSO04 Open Source Technologies 3 - - 3 40 60 3

5. 20CSO05 Basics of Artificial Intelligence 3 - - 3 40 60 3

Fundamentals of Blockchain
6. 20CSO06 3 - - 3 40 60 3
Technology
Fundamentals of Software
7. 20CSO07 3 - - 3 40 60 3
Engineering
EVEN SEMESTER
8. 20CSO08 Basics of Machine Learning 3 - - 3 40 60 3

9. 20CSO09 Fundamentals of DBMS 3 - - 3 40 60 3

10. 20CSO10 Basics of Cyber Security 3 - - 3 40 60 3

11. 20CSO11 Data Visualization Models 3 - - 3 40 60 3

Introduction to Mobile
12. 20CSO12 3 - - 3 40 60 3
Application Development
13. 20CSO13 Basics of Cloud Computing 3 - - 3 40 60 3
Fundamentals of Computer
14. 20CSO14 3 - - 3 40 60 3
Vision
L: Lecture T: Tutorial D: Drawing P: Practical
CIE - Continuous Internal Evaluation SEE - Semester End Examination
CBIT (A) With effect from the Academic Year 2022-23

20CSO01
FUNDAMENTALS OF VIRTUAL REALITY
(Open Elective)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Fundamentals of C++.

Course Objectives: The main objectives of this course are,

1. To introduce hardware and software components of virtual reality.
2. To provide knowledge about geometry of virtual worlds.
3. To give an overview of visual physiology, perception and audio in VR.
4. To explore the applications of VR in areas like defense and education.

Course Outcomes: On Successful completion of this course, student will be able to,
1. Define Virtual Reality and describe the components of a VR system, input and output devices of virtual
reality systems.
2. Apply geometric modeling to model real world scenarios.
3. Develop interfaces by using visual physiology, visual perception and audio.
4. Evaluate virtual reality systems for usability.
5. Explore the applications of VR systems in defense and telerobotics.

UNIT - I
Introduction: The three I’s of virtual reality, commercial VR technology and the five classic components of a
VR system.
Input Devices: Trackers, Navigation and Gesture Interfaces: Three-dimensional position trackers, navigation
and manipulation interfaces, Gesture interfaces.
Output Devices: Graphics displays, sound displays and haptic feedback.

UNIT - II
Modeling: Geometric modeling, kinematics modeling, physical modeling, behaviour modeling, model
management.
Human Factors: Methodology and terminology, user performance studies, VR health and safety issues, VR and
Society.

UNIT - III
Light and Optics: Basic Behaviour of light, Lenses, Optical aberrations, The Human eye, Cameras, Displays.
Physiology of Human Vision: From the Cornea to Photoreceptors, From Photoreceptors to the Visual Cortex,
Eye movements, Implications for VR. Visual Perception: Depth perception, Motion perception, Color
Perception.

UNIT - IV
Audio: The Physics of Sound, the Physiology of Human Hearing, Auditory Perception, Auditory Rendering.
Evaluating VR Systems and Experiences: Perceptual Training, Recommendations for Developers, Comfort
and VR Sickness, Experiments on Human Subjects.

UNIT – V
Applications of Augmented and Virtual Reality: Gaming and Entertainment, Architecture and Construction,
Science and Engineering, Health and Medicine, Aerospace and Defense, Education, Information control and Big
Data Visualization, Telerobotics and Telepresence. Human Factors Considerations, Legal and Social
Considerations, the Future: Short-term Outlook and Long-term Outlook

Text Books:
1. Gregory C. Burdea and Philippe Coiffet, “Virtual Reality Technology”, Second Edition, John Wiley &
Sons, Inc., 2003.
2. Steven M. LaVelle, “Virtual Reality”, Cambridge University Press, 2019.
3. Steve Aukstakalnis, “Practical Augmented Reality”, Addison-Wesley, 2016.
CBIT (A) With effect from the Academic Year 2022-23

Suggested Reading:
1. George Mather,”Foundations of Sensation and Perception”, Second Edition, Psychology Press, 2009.
2. Peter Shirley, Michael Ashikhmin, and Steve Marschner, “Fundamentals of Computer Graphics”, Third
Edition, A K Peters/CRC Press, 2009.
3. K. S. Hale and K. M. Stanney, “Handbook on Virtual Environments”, 2nd edition, CRC Press, 2015.

Online Resources:
1. http://msl.cs.uiuc.edu/vr/
2. https://nptel.ac.in/courses/106106139/
CBIT (A) With effect from the Academic Year 2022-23

20CSO02
INTRODUCTION TO WEB TECHNOLOGY
(Open Elective)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Course Objectives: The objectives of this course are,

1. To acquire knowledge on XHTML, Java Script and XML to develop client side web applications.
2. To learn developing web applications using PHP.
3. To understand the database access through the web.

Course Outcomes: On successful completion of the course, students will be able to,
1. Understand the technologies required for developing web application.
2. Identify and choose XHTML tags, CSS and java scripts to develop well-structured and easily
maintained web pages.
3. Design and Develop interactive and innovative web pages using various platforms/technologies like
XHTML, CSS, XML, JAVASCRIPT.
4. Create and deploy web applications in web server by using server-side programming concepts like
PHP
5. Build a data driven web site using Databases.
6. Evaluate different web applications to implement optimal solutions for real time problems

UNIT - I
Fundamentals: Introduction to the Internet, WWW Browsers, Web Servers, URL, MIME, HTTPS.
Introduction XHTML: Basic Syntax Standard XHTML Document Structure, Basic Text Markup, Images,
Hypertext Links, Lists Tables, Forms, Cascading Style Sheets.

UNIT - II
Bootstrap: Introduction to bootstrap.
XML: Introduction, uses of XML, the Syntax of XML, XML Document Structure, DTD, Namespaces, XML
schemas, displaying Raw XML Documents, displaying XML documents with CSS, XSLT style Sheets.

UNIT - III
The Basics of Java script: Primitive operations and Expressions, Arrays, Functions, Pattern Matching Using
Regular Expressions, Document Object Model, Element Access in JavaScript, Events and Event Handling,
Handling Events from Body, Button, Text Box and Password Elements.
Dynamic Documents with Java Script: Positioning Elements, Moving Elements, Changing Colors and Fonts,
Dynamic Content.

UNIT - IV
Introduction to PHP: Overview of PHP, General Syntactic Characteristics, Primitives, Operations, and
Expressions, Output, Control Statements. Arrays, Functions, Pattern Matching, Form Handling, Cookies,
Session Tracking.

UNIT - V
Database Access through the Web: Relational Databases, an Introduction to the Structured Query Language,
Architectures for Database Access, the MySQL Database System.
Introduction to PHP MyAdmin, connection to MySQL server from PHP, execution of MySQL queries from
PHP, receiving data from database server and processing it on webserver using PHP.

Text Books:
1. M. Deitel, P.J. Deitel, A. B. Goldberg, “Internet and World Wide Web How to program”, Pearson
Education, 3rd edition, 2003.
2. Robert W. Sebesta, “Programming the World Wide Web”, Pearson Education, 4th Edition, 2008.
3. Adams, “PHP Programming the Complete Guide”, 2022.

Suggested Reading:
CBIT (A) With effect from the Academic Year 2022-23

1. Chris Bates, “Web Programming: building internet applications”, Wiley, Second edition, 2002.
2. Steven Holzner, “The Complete Reference PHP”, McGraw Hill Education; Raunak PHP study edition,
2017.
CBIT (A) With effect from the Academic Year 2022-23

20CSO03
INTRODUCTION TO SOFT COMPUTING
(Open Elective)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Linear algebra and calculus.

Course Objectives: The objectives of this course are,

1. To learn various types of soft computing techniques and their applications.
2. To acquire the knowledge of neural network architectures, learning methods and algorithms.
3. To understand Fuzzy logic, Genetic algorithms and their applications.

Course Outcomes: On Successful completion of this course, student will be able to,
1. Illustrates various soft computing techniques.
2. Analyze and design various learning models.
3. Apply the Neural Network Architecture for various Real time applications.
4. Apply approximate reasoning using fuzzy logic.
5. Analyze and design Genetic algorithms in different applications.
6. Apply soft computing techniques to solve different applications.

UNIT - I
Soft computing vs. Hard computing, Various types of soft computing techniques.
Artificial Neural Networks: Fundamental concepts, Evolution of neural networks, Basic models of artificial
neural network, important terminologies of ANNs. McCulloch-Pitts neuron, linear separability, Hebb network.

UNIT - II
Supervised Learning Neural Networks: Perceptron networks, Adaptive linear neuron (Adaline), Multiple
Adaptive linear neuron (Madaline), Back propagation network.

UNIT - III
Unsupervised Learning Neural Networks: Kohonen Self Organizing networks, Adaptive resonance theory.
Associate Memory Networks: Bidirectional associative memory network, Hopfield networks.

UNIT - IV
Fuzzy Logic: Introduction to classical sets and Fuzzy sets, Fuzzy relations, Tolerance and equivalence relations,
Membershipfunctions, Defuzzification.

UNIT - V
Genetic Algorithms: Introduction, Basic operators and terminology, Traditional algorithm vs. genetic
algorithm, Simple genetic algorithm, General genetic algorithm, Classification of genetic algorithms.

Text Books:
1. S.N. Sivanandam& S.N. Deepa, “Principles of soft computing”, Wiley publications, 2nd Edition, 2011.

Suggested Reading:
1. S. Rajasekaran& G.A. Vijayalakshmipai, “Neural Networks, Fuzzy logic & Genetic
Algorithms, Synthesis & Applications”, PHI publication, 2008.
2. LiMin Fu, “Neural Networks in Computer Intelligence”, McGraw-Hill edition, 1994.
3. K.L.Du& M.N.S Swamy, “Neural Networks in a Soft Computing Framework”, Springer International
edition, 2008.
4. Simon Haykins, “Neural Networks a Comprehensive Foundation”, PHI, second edition.
5. Goldberg, David E., “Genetic Algorithms in Search, Optimization and Machine Learning”, Addison
Wesley, New Delhi, 2002.
6. N.P. Padhy and S.P. Simon,”Soft Computing: With Matlab Programming”, Oxford University Press,
2015.
CBIT (A) With effect from the Academic Year 2022-23

Online Resources:
1. https://onlinecourses.nptel.ac.in/noc18_cs13/preview.
2. https://archive.nptel.ac.in/courses/106/105/106105173/
CBIT (A) With effect from the Academic Year 2022-23

20CSO04
OPEN SOURCE TECHNOLOGIES
(Open Elective)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Course Objectives: The objectives of this course are,

1. To become familiar with Open Source Technologies.
2. To understand the principles and methodologies of OSS.
3. To understand the policies, licensing procedures and ethics of OSS.

Course Outcomes: On Successful completion of this course, student will be able to,
1. Differentiate between Open Source and Proprietary software and Licensing.
2. Identify the applications, benefits and features of Open Source Technologies.
3. Evaluate open source project and management tools like Linux, Apache, and GIT.
4. Adapt to the usage of Open source tools and technologies.
5. Analyze the Social and Financial impact of Open source technology on Governance, Teaching and
Business
6. Practice Open Source principles, ethics and models.

UNIT - I
Introduction to Open Source: Open Source, need of Open Source, Open Source Principles, Open Source
Standards Requirements for Software, OSS success, Free Software, Examples, Licensing, Free Software Vs.
Proprietary Software, Public Domain software, History of free software, Proprietary Vs Open Source Licensing
Model, use of Open Source Software.

UNIT - II
Fault Tolerant Design: Principles and Open Source Methodology- History, Open Source Initiatives, Open
Standards Principles, Methodologies, Philosophy, Software freedom, Open Source Software Development,
Licenses, Copyright vs. Copyleft, Patents, zero marginal cost, income-generation Opportunities,
Internationalization.

UNIT - III
Case Studies: Apache, BSD, Linux, Mozilla Firefox, Wikipedia, Git, GNU CC, Libre Office.

UNIT - IV
Open Source Project: Starting and Maintaining an Open Source Project, Open Source Hardware, Open Source
Design, Open Source Teaching (OST), Open Source Media, What Is A License, How to create your own
Licenses. Important FOSS Licenses (Apache, BSD, PL, LGPL), copyrights and copy lefts, Patent.

UNIT - V
Open Source Ethics- Open Source Vs. Closed Source, Open Source Government, Ethics of Open Source,
Social and Financial Impact of Open Source Technology, Shared Software, Shared Source, Open Source as a
Business Strategy.

Text Books:
1. KailashVadera, Bjhavesh Gandhi “Open Source Technology”, University Science Press, 1st Edition,
2009.
2. Fadi P. Deek and James A. M. McHugh, “Open Source Technology and Policy”, Cambridge University
Press.

Suggested Reading:
1. Wale Soyinka, “Linux Administration- A beginner‟s Guide”, Tata McGraw Hills.
2. Andrew M. St. Laurent, “Understanding Open Source and Free Software Licensing”, O'Reilly Media.
3. Dan Woods, Gautam Guliani, “Open Source for the Enterprise”, O'Reilly Media.
4. Bernard Golden, “Succeeding with Open Source”, Addison-Wesley Professional.
5. Clay Shirky and Michael Cusumano, “Perspectives on Free and Open Source Software”, MIT press
CBIT (A) With effect from the Academic Year 2022-23

Online Resources:
1. https://fossee.in/
2. https://opensource.com
3. https://www.gnu.org/
CBIT (A) With effect from the Academic Year 2022-23

20CSO05
BASICS OF ARTIFICIAL INTELLIGENCE
(Open Elective)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Course Objectives: The objectives of this course are,

1. To learn fundamental concepts in Artificial Intelligence.
2. To explore various paradigms involved in solving AI problems involving perception, reasoning and
learning.
3. To apply AI concepts for building an expert system to solve the real-world problems.

Course Outcomes: On Successful completion of this course, student will be able to,
1. Differentiate between a rudimentary Problem and an AI problem, its Characteristics and problem-
solving Techniques.
2. Compare and contrast the various knowledge representation schemes of AI.
3. Appraise knowledge in Uncertainty and Probabilistic reasoning approaches.
4. Understand the different learning techniques.
5. Apply the AI techniques to solve the real-world problems.

UNIT - I
Introduction: History Intelligent Systems, Foundations of Artificial Intelligence, Sub areas of Al, Applications.
Problem Solving - State - Space Search and Control Strategies: Introduction, General Problem Solving
Characteristics of problem, Exhaustive Searches, Heuristic Search Techniques, Iterative - Deepening A*, Constraint
Satisfaction.

UNIT - II
Logic Concepts and Logic Programming: Introduction, Propositional Calculus Propositional Logic, Natural
Deduction System, Axiomatic System, Semantic Table, A System in Propositional Logic, Resolution, Refutation in
Propositional Logic, Predicate Logic, Logic Programming.
Knowledge Representation: Introduction, Approaches to knowledge Representation, Knowledge Representation
using Semantic Network, Extended Semantic Networks for KR, Knowledge Representation using Frames.

UNIT - III
Uncertainty Measure - Probability Theory: Introduction, Probability Theory, Bayesian Belief Networks,
Certainty Factor Theory, Dempster - Shafer Theory.

UNIT - IV
Intelligent Agents: Agents vs Software programs, classification of agents, Multi- agent systems, Architecture of
intelligent agents, Multi-agent application.
Expert System and Applications: Introduction, Phases in Building Expert Systems Expert System Architecture,
Expert Systems Vs Traditional Systems, Truth Maintenance Systems, Application of Expert Systems, List of Shells
and tools.

UNIT - V
Machine - Learning Paradigms: Introduction, Machine learning System, Supervised and Unsupervised Learning,
Inductive Learning, Learning Decision Trees, Deductive Learning, Clustering, Support Vector Machines

Text Books:
1. Saroj Kaushik, “Artificial Intelligence”, Cengage Learning India, First Edition, 2011.
2. Russell, Norvig, “Artificial Intelligence: A Modern Approach”, Pearson Education, 3rd Edition, Prentice
Hall.

Suggested Reading:
1. Rich, Knight, Nair, “Artificial Intelligence”, Tata McGraw Hill, 3rd Edition, 2009.
2. Trivedi, M.C., “A Classical Approach to Artificial Intelligence”, Khanna Publishing House, Delhi.
CBIT (A) With effect from the Academic Year 2022-23

Online Resources:
1. https://nptel.ac.in/courses/106105077
2. https://nptel.ac.in/courses/106106126
CBIT (A) With effect from the Academic Year 2022-23

20CSO06
FUNDAMENTALS OF BLOCKCHAIN TECHNOLOGY
(Open Elective)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Course Objectives: The objectives of this course are,

1. To provide the basic concepts and architecture of Blockchain.
2. To interpret the working of Ethereum and Hyperledger Fabric.
3. To explore the applications of Blockchain in financial and government sectors.

Course Outcomes: On Successful completion of this course, student will be able to,
1. Understand the concepts of distributed systems and Blockchain properties.
2. Learn about the significance of bitcoin ecosystem.
3. Understand consensus mechanisms and technologies that support ethereum.
4. Learn about Hyperledger Fabric and its architecture.
5. Analyze blockchain use cases in financial software systems and government sectors.

UNIT - I
Introduction: Overview of distributed systems; Introduction to Blockchain; Properties of Blockchain; Evolution
of Blockchain.
Cryptocurrency and Block chain: Anonymity and Pseudonymity in Cryptocurrency; Programmable Money;
Hash Functions and Merkle Trees; Components of Blockchain Ecosystem; Cryptography and Consensus
Algorithms; Types of Blockchain; Blockchain Platforms.

UNIT - II
Bitcoin Platform: Bitcoin and its uses; Bitcoin Ecosystem; Structure of a Bitcoin Transaction; Nodes in a
Bitcoin Network; Bitcoin Mining, Bitcoin Economics; Types of bitcoin Mining; Consensus mechanism in
bitcoin.

UNIT - III
Introduction to Ethereum: What is Ethereum; Introducing Smart Contracts; Cryptocurrency in Ethereum;
Mining in Ethereum; Consensus mechanism in Ethereum; Technologies that support Ethereum; Ethereum
Programming Language; Ethereum Test Networks.

UNIT - IV
Hyperledger Fabric: Introduction to Hyperledger Fabric; Hyperledger Fabric architecture; Consensus in
Hyperledger Fabric; Hyperledger API and Application Model; Setting up Development Environment using
Hyperledger Composer tool.

UNIT - V
Blockchain in Financial Software Systems (FSS): Settlements, KYC; Blockchain for Government: Digital
identity, land records and other kinds of record keeping between government entities.

Text Books:
1. Andreas M. Antonopoulos, “Mastering Bitcoin. Programming the Open Blockchain”, O’Reilly, 2017.
2. Ghassan Karame, Elli Androulaki, “Bitcoin and Blockchain Security”, Artech House, 2016.
3. Vikram Dhillon, “Blockchain Enabled Applications”, et al, Apress, 2019.

Suggested Reading:
1. Mark Gates, “Blockchain: Ultimate guide to understanding blockchain, bitcoin, cryptocurrencies, smart
contracts and the future of money”, Wise Fox Publishing and Mark Gates, 2017.
2. Melanie Swan, “Blockchain “, O’Reilly Media Inc., 2015.

Online Resources:
1. Blockchain Applications- https://www.blockchain-books.com
2. Hyperledger Fabric - https://www.hyperledger.org/projects/fabric
CBIT (A) With effect from the Academic Year 2022-23

3. Zero to Blockchain - An IBM Redbooks course, by Bob Dill, DavidSmits, 2017.

(https://www.redbooks.ibm.com/Redbooks.nsf/RedbookAbstracts/crse0401.html)
4. https://onlinecourses.nptel.ac.in/noc18_cs47/preview
5. https://www.udemy.com/blockchain-and-bitcoin-fundamentals/
CBIT (A) With effect from the Academic Year 2022-23

20CSO07
FUNDAMENTALS OF SOFTWARE ENGINEERING
(Open Elective)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Programming for problem solving.

Course Objectives: The objectives of this course are,

1. To learn the fundamental concepts in software development.
2. To impart knowledge on various phases of software development.
3. To impart knowledge on software testing strategies and quality assurance activities.

Course Outcomes: On Successful completion of this course, student will be able to,
1. State the software process and the perspective process models and agile process models.
2. Interpret the Requirements of Software Product and demonstrate the skills necessary to specify the
requirements of software product.
3. Recall the software architecture and design principles of software product.
4. Construct a product using coding principles and Outline the testing strategies for conventional and O-O
Software.
5. Apply software testing methods like White Box, Black box and explore the corrective, adaptive, and
enhancive software maintenance categories.

UNIT - I
The Software Problem, Software Processes- Process and Project, Components of software Processes. Software
Development Process Models: Waterfall, Prototyping, Iterative Development, RUP, Time Boxing Model.
Agile Process: Agility, Agile Process Model – Extreme Programming, Using Process Models in a Project.

UNIT - II
Software Requirements Analysis Specification: Value of a Good SRS, Requirements Process, Requirements
Specification, Functional Specification with Use-cases, other approaches for Analysis- DFD, E-R. Planning a
Software Project: Project schedule and staffing, Quality Planning, Risk Management Planning, Project
Monitoring Planning.

UNIT - III
Software Architecture: Architecture views, Component and Connector views, Architecture Styles for C&C
views. Design: Design Concepts, Function Oriented Design, Object Oriented Design, Detailed Design.

UNIT - IV
Coding: Programming Principles and Guidelines, Incrementally developing code, Managing Evolving code,
Code Inspection. Testing Strategies: A Strategic approach to software testing, strategic issues, test strategies for
Conventional and O-O Software, Validation Testing, System Testing.

UNIT - V
Testing Tactics: Software Testing Fundamentals, White Box Testing: Basis Path Testing, Control Structure
Testing. Black Box Testing. Software Maintenance: Categories of Maintenance.

Text Books:
1. Pankaj Jalote, “A concise introduction to software Engineering”, Springer, 2008.
2. Roger S.Pressman, “Software Engineering: A Practitioner’s Approach”, 7th Edition, McGraw Hill,
2009.
3. Nasib Singh Gill, “Software Engineering”, Khanna Publishing House, 2007.

Suggested Reading:
1. Roger S.Pressman, “Software Engineering: A Practitioner’s Approach”, 7th Edition, McGraw Hill,
2009.
CBIT (A) With effect from the Academic Year 2022-23

2. Ali Behforooz and Frederick J.Hudson, “Software Engineering Fundamentals”, Oxford University
Press, 1996.

Online Resources:
1. https://nptel.ac.in/courses/106101061/
CBIT (A) With effect from the Academic Year 2022-23

20CSO08
BASICS OF MACHINE LEARNING
(Open Elective)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Course Objectives: The objectives of this course are,

1. To learn Machine Learning algorithms.
2. To learn to work with data’s, preparing datasets for real world problems
3. To study various machine learning algorithms.
4. To analyze data using machine learning techniques.
5. To become familiar with usage of time series and deep learning approaches.

Course Outcomes: On Successful completion of this course, student will be able to,
1. Define the basic concepts related to Python and Machine Learning
2. Describe the feature engineering methods, regression techniques and classification methods
3. Apply Python packages for data visualization, text and time series data analysis using NLP toolkit
4. Evaluate and interpret the results of the various machine learning techniques
5. Solve real world problems using deep learning framework.

UNIT - I
Introduction to Machine Learning: Introduction, types of learning, Machine Learning process.
Introduction to Python: Features, sources and installation of Python, IDEs, Basics of Python, Data Structures
and loops.

UNIT - II
Feature Engineering: Introduction to Features and need of feature Engineering, Feature extraction and
selection, Feature Engineering Methods, Feature Engineering with Python. Principal component analysis (PCA).
Data Visualization: Various charts, histograms, plots.

UNIT - III
Regression: Simple and multiple regressions, Model assessment, various types of errors, errors, ridge
regression, Lasso regression, non-parameter regression.
Classification: Linear classification, logistic regression, Decision Trees, Random Forest, Naïve Bayes, Support
Vector Machines (SVM).

UNIT - IV
Unsupervised Learning: Clustering, types of clustering, K-Means clustering, Hierarchical clustering.
Text Analysis: Basic text analysis with Python, regular expressions, NLP, text classification.
Time Series Analysis: Date and time handling, window functions, correlation, time series forecasting

UNIT - V
Neural Network and Deep Learning: Neural network- gradient descent, activation functions, parameter
initialization, optimizer, loss function, deep learning, deep learning architecture, memory, deep learning
framework.
Recommender System: Recommendation engines, collaborative filtering.

Text Books:
1. Abhishek Vijavargia “Machine Learning using Python”, BPB Publications, 1st Edition, 2018.
2. Tom Mitchel “Machine Learning”, Tata McGraw Hill, 2017.

Suggested Reading:
1. Marsland, S. “Machine Learning: An Algorithmic Perspective” 1st Edition, Chapman and Hall/CRC,
2009. https://doi.org/10.1201/9781420067194
2. Yuxi Liu, “Python Machine Learning by Example”, 2nd Edition, PACT, 2017.
CBIT (A) With effect from the Academic Year 2022-23

Online Resources:
1. https://www.guru99.com/machine-learning-tutorial.html
2. https://www.tutorialspoint.com/machine_learning_with_python/index.htm
3. https://www.tutorialspoint.com/python/
4. https://docs.python.org/3/tutorial/
5. https://www.geeksforgeeks.org/machine-learning/
CBIT (A) With effect from the Academic Year 2022-23

20CSO09
FUNDAMENTALS OF DATABASE MANAGEMENT SYSTEMS
(Open Elective)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Course Objectives: The objectives of this course are,

1. To learn data models, conceptualize and depict a database system using E-R diagrams.
2. To understand the internal storage structures in a physical DB design.
3. To learn the fundamental concepts of transaction processing techniques.

Course Outcomes: On Successful completion of this course, student will be able to,
1. Classify the difference between FMS and DBMS; describe the roles of different users and the
structure of the DBMS. Design the database logically using ER modeling
2. Outline the schema of the relational database and key constraints. Develop queries using DDL, DML
and DCL of SQL.
3. Identify the inference rules for functional dependencies and apply the principles of normal forms to
decompose the relations in a database.
4. Summarize the concepts of dense, sparse, ISAM and B+ tree indexing and get familiar with states and
properties of transactions.
5. Interpret the locking, time stamp, graph and validation-based protocols for concurrency control.
6. Summarize log-based recovery techniques to increase the robustness of the database, identify to
resolve the deadlocks in the transactions.

UNIT - I
Introduction: Database System Applications, Purpose of Database Systems, View of Data, Database
Languages, Database Users and Administrators Database System Architecture, Application Architectures.
Database Design and E-R Model: Basic concepts, Constraints, E-R Diagrams, E-R Design Issues, Extended E-
R Features, Specialization and Generalization.

UNIT - II
Relational Model: Structure of Relational Databases, Database Schema, Keys.
Structured Query Language: Overviews, SQL Data Types, SQL Queries, Data Manipulation Language Set
Operations, Aggregate Functions, Data Definition Language, Integrity Constraints, Null Values, Views, Join
Expression. Index Definition in SQL.

UNIT - III
Relational Database Design: Undesirable Properties in Relational Database Design, Functional Dependencies,
Trivial and Nontrivial Dependencies, Closure of Set of Functional Dependencies, Closure of Set of Attributes,
Irreducible Set of Functional Dependencies, Normalization – 1NF, 2NF, and 3NF, Dependency Preservation,
BCNF, Comparison of BCNF and 3NF.

UNIT - IV
Indexing: Basic concepts, Dense and Sparse Indices, Secondary Indices, Tree-Structured Indexing, Indexed
Sequential Access Method (ISAM), B+ Tree Index Files.
Transaction Management: Transaction Concept – ACID Properties, States of Transaction, Implementation of
Atomicity and Durability, Serializability, Recoverability.

UNIT - V
Concurrency Control: Lock-Based Protocols, Timestamp-Based Protocols, Validation-Based Protocols.
Deadlocks Handling: Deadlock Prevention, Deadlock Detection and Recovery.
Recovery System: Failure Classification, Storage Structure, Recovery and Atomicity, Log-Based Recovery.

Text Books:
1. Abraham Silberschatz, Henry F Korth, S Sudarshan, “Database System Concepts”, Sixth Edition,
McGraw-Hill International Edition, 2011.
CBIT (A) With effect from the Academic Year 2022-23

2. Date CJ, Kannan A, Swamynathan S, “An Introduction to Database Systems”, Eight Edition, Pearson
Education, 2006.

Suggested Reading:
1. Raghu Ramakrishnan, JohnnesGehrke, “Database Management Systems”, Third Edition, McGraw Hill,
2003.
2. RamezElmasri, Durvasul VLN Somayazulu, Shamkant B Navathe, Shyam K Gupta, “Fundamentals of
Database Systems”, Fourth Edition, Pearson Education, 2006.
CBIT (A) With effect from the Academic Year 2022-23

20CSO10
BASICS OF CYBER SECURITY
(Open Elective)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Pre-requisites: Programming for problem solving.

Course Objectives: The objectives of this course are,

1. To understand how to identify, analyze and remediate computer security breaches by learning and
implementing the real-world scenarios in Cyber Investigations
2. To exhibit knowledge to secure corrupted systems, protect personal data, and secure computer networks
in an organization.
3. To practice with an expertise in academics to design and implement security solutions.
4. To understand key terms and concepts in Cryptography, Governance and Compliance and Develop
cyber security strategies and policies.
5. To understand principles of web security and to guarantee a secure network by monitoring and
analyzing the nature of attacks through cyber/computer forensics software/tools.

Course Outcomes: On Successful completion of this course, student will be able to,
1. Analyze and evaluate the cyber security needs of an organization.
2. Determine and analyze software vulnerabilities and security solutions to reduce the risk of exploitation.
3. Measure the performance and troubleshoot cyber security systems.
4. Implement cyber security solutions and use of cyber security, information assurance, and
cyber/computer forensics software/tools.
5. Applying operational and cyber security strategies and policies.

UNIT - I
Introduction to Cyber Crime: Cyber Crime: Definition and Origins of the Word, Cyber crime and
Information Security, Classification of Cyber Crimes, Cyber Crime: The Legal Perspective, Cyber Crime: An
IndianPerspective, A Global Perspective of Cyber Crime.

UNIT - II
Cyber offenses: How Criminals Plan Them · Introduction · How Criminals Plan the Attacks · Social
Engineering · Cyber stalking · Cybercafé and Cybercrimes. Cloud Computing Cybercrime: Mobile and
Wireless Devices · Introduction · Proliferation of Mobile and Wireless Devices · Trends in Mobility · Credit
Card Fraudsin Mobile and Wireless Computing Era ·

UNIT - III
Tools and Methods Used in Cybercrime: Introduction, Proxy Servers and Anonymizers, Phishing, Password
Cracking, Keyloggers and Spywares, Virus and Worms, Trojan Horse and Backdoors.
Steganography · DoS and DDoS Attacks · SQL Injection · Buffer Overflow · Attacks on Wireless Networks
Phishing and Identity Theft · Introduction · Phishing · Identity Theft (ID Theft) Cybercrimes and
Cybersecurity: The Legal Perspectives.

UNIT - IV
Cyber Security: The Legal Perspectives: Cyber Crime and the Legal Landscape around the World, Need of
Cyber laws: the Indian Context, The Indian IT Act, Challenges to Indian Law and Cyber Crime Scenario in
India, Digital Signatures and the Indian IT Act, Cyber Crime and Punishment, Cyber Law, Technology and
Students: The Indian Scenario.

UNIT – V
Understanding Cyber Forensics: Introduction ,Digital Forensics Science, Need for Computer Forensics, Cyber
Forensics and Digital Evidence, Forensics Analysis of Email, Digital Forensics Life Cycle, Chain of Custody
Concept, Network Forensics, Approaching a Cyber Forensics Investigation, Challenges in Computer Forensics.
Introduction · Cost of Cybercrimes and IPR Issues: Lessons for Organizations · Web Threats for Organizations:
The Evils and Perils.
CBIT (A) With effect from the Academic Year 2022-23

Text Books:
1. Sunit Belapure Nina gobole, “Cyber Security”, Wiley, 2011.
2. Lester Evans, “Cyber security: An Essential Guide to Computer and Cyber Security for Beginners”,
Bravex Publications, 2020.

Suggested Reading:
1. Prof Amit Garg, Dr Krishan Kumar Goyal, “Cyber Security”, Laxmi Publications, 2022.
2. Zach Codings, “Cyber Security: Hacking with Kali Linux, Ethical Hacking”, 2019.
3. Noah Zhang, Dana Onyshko, “Cyber Security: The Beginners Guide to Learning the Basics of
Information Security and Modern Cyber Threats”, Kindle Edition.

Online Resources:
1. https://nptel.ac.in/courses/106106129
2. https://uou.ac.in/foundation-course
3. https://nptel.ac.in/courses/106105162
CBIT (A) With effect from the Academic Year 2022-23

20CSO11
DATA VISUALIZATION MODELS
(Open Elective)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Course Objectives: The objectives of this course are,

1. To learn various types of data.
2. To acquire the knowledge on Non-spatial and spatial data visualization
3. To understand visualization fundamentals and web data visualization.

Course Outcomes: On Successful completion of this course, student will be able to,
1. Illustrate the modeling of various types of data.
2. Understand the visualization fundamentals.
3. Apply methods and tools for Non – spatial Data Visualization.
4. Apply methods for spatial data visualization.
5. Apply methods for web data visualization.

UNIT - I
Data Modeling: Conceptual models, Spread sheet models, Relational Data Models, object oriented models, semi
structured data models, unstructured data models.

UNIT - II
Visualization Fundamentals, Design principles, The Process of Visualization, Data Abstraction, Visual
Encodings, Use of Color, Perceptual Issues, Designing Views, Interacting with Visualizations, Filtering and
Aggregation, Design Studies Information.

UNIT - III
Non-Spatial Data Visualization, Tabular Data, Tree Data, Graph Data, Text Data, Flow Data, Time-Series Data,
Topological Visualization, Uncertainty, Visual Analytics.

UNIT - IV
Scientific /Spatial Data Visualization, Scalar Volumes, Isosurfacing, Volume Rendering, Transfer Function
Design, Vector Fields, Maps, Spatial Uncertainty.

UNIT - V
Web data visualization: web structure data, web usage data, web content data multimedia data visualization.

Text Books:
1. Ben Fry, “Visualizing Data” O'Reilly Media, Inc., 2007.
2. Tamara Munzner, “Visualization Analysis and Design”, A K Peters/CRC Press, 2014.
3. Colin Ware, “Information Visualization: Perception for Design”, Morgan Kaufmann; 3rd edition, 2012.

Suggested Reading:
1. Paulraj Ponniah, “Data Modeling Fundamentals”, a Practical Guide for IT Professionals, Wiley-Inter
science; 1st edition, 2007.

Online Resources:
1. https://www.coursera.org/learn/datavisualization/home/welcome
2. https://www.coursera.org/learn/data-visualization-tableau/home/welcome
3. https://www.udemy.com/course/learning-python-for-data-analysis-and-
visualization/learn/lecture/2345238?start=0#overview
4. https://onlinecourses.nptel.ac.in/noc16_cs03/preview
CBIT (A) With effect from the Academic Year 2022-23

20CSO12
INTRODUCTION TO MOBILE APPLICATION DEVELOPMENT
(Open Elective)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Course Objectives: The objectives of this course are,

1. To learn the fundamentals of Android operating systems.
2. To apply skills using Android software development tools.
3. To be able to develop software with reasonable complexity on mobile platform.

Course Outcomes: On Successful completion of this course, student will be able to,
1. Interpret and analyze android platform architecture and features to learn best practices in android
programming.
2. Design the User Interface for mobile applications.
3. Apply Intents, broadcast receivers and Internet services in android app.
4. Develop database management system to retrieve and/or store data for mobile application.
5. Evaluate and select appropriate android solutions to the mobile computing platform.
6. Build android applications for complex problems.

UNIT - I
Introduction to Android Operating System: Android SDK Features, Developing for Android, Best practices
in Android programming, Android Development Tools. Android application components – Android Manifest
file, Externalizing resources, The Android Application Lifecycle, A Closer Look at Android Activities.

UNIT - II
Android User Interface: Introducing Layouts, User Interface (UI) Components – Editable and Non Editable
Text Views, Buttons, Radio and Toggle Buttons, Checkboxes, Spinners, Dialog and pickers. Event Handling –
Handling clicks or changes of various UI components. Introducing Fragments, Multi-screen Activities.

UNIT - III
Intents and Broadcasts: Introducing Intents: Using Intents to Launch Activities. Using Intent to dial a number
or to send SMS. Broadcast Receivers –Creating Intent Filters and Broadcast Receivers: Using Intent Filters to
Service Implicit Intents. Finding and using Intents received within an Activity. Customizing the Action Bar,
Using the Action Bar for application navigation, Notifications – Creating and Displaying notifications,
Displaying Toasts.

UNIT - IV
Persistent Storage: Files – Reading data from files, listing contents of a directory, Creating and Saving Shared
Preferences, Retrieving Shared Preferences. Database –Introducing Android Databases, Introducing SQLite,
Content Values and Cursors, Working with SQLite Databases. Registering Content Providers, Using content
Providers (insert, delete, retrieve and update).

UNIT - V
Advanced Topics: Alarms –Using Alarms. Using Internet Resources – Connecting to internet resource, using
download manager. Location Based Services –Using Location-Based Services, Using the Emulator with
Location-Based Services.

Text Books:
1. Reto Meier, “Professional Android 4 Application Development”, Wiley India, (Wrox), 2012
2. O'Reilly Dawn Griffiths, David Griffiths “Head First Android Development” , O'Reilly Media, Inc.,
2015.

Suggested Reading:
1. Wei-Meng Lee, “Beginning Android 4 Application Development”, Wiley India (Wrox), 2013.
2. David Wolber, Hal Abelson, Ellen Spertus & Liz Looney, “App Inventor-Create your own Android
Apps”, O’Reilly, 2011.
CBIT (A) With effect from the Academic Year 2022-23

20CSO13
BASICS OF CLOUD COMPUTING
(Open Elective)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits 3

Course Objectives: The objectives of this course are,

1. To understand the concept of cloud computing.
2. To appreciate the evolution of the cloud from the existing technologies.
3. To have knowledge of the various issues in cloud computing.
4. To be familiar with the lead players in the cloud.
5. To appreciate the emergence of the cloud as the next-generation computing paradigm.

Course Outcomes: On Successful completion of this course, student will be able to,
1. Define the main concepts, key technologies, strengths, and limitations of cloud computing.
2. Develop the ability to understand and use compute and storage cloud architecture, service, and delivery
models.
3. Understanding the virtualization and enabling technologies that help develop the cloud.
4. Explain the core issues of cloud computing such as resource management and security.
5. Evaluate and choose the appropriate technologies, and approaches for implementing and using the
cloud.

UNIT - I
Introduction To Cloud: Introduction to Cloud Computing – Definition of Cloud – Evolution of Cloud
Computing -Underlying Principles of Parallel and Distributed Computing – Cloud Characteristics – Elasticity in
Cloud – On-demand Provisioning.

UNIT - II
Cloud Architecture and Services: Layered Cloud Architecture Design – NIST Cloud Computing Reference
Architecture – Public, Private and Hybrid Clouds - laaS – PaaS – SaaS – Architectural Design Challenges

UNIT - III
Virtualization: Basics of Virtualization – Types of Virtualization – Implementation Levels of Virtualization –
Virtualization Structures – Tools and Mechanisms – Virtualization of CPU -Memory – I/O Devices –
Virtualization Support and Disaster Recovery.

UNIT - IV
Resource Management and Security in Cloud: InterCloud Resource Management – Resource Provisioning
and Resource Provisioning Methods– Cloud Security Challenges –Software-as-a-Service Security – Security
Governance – Virtual Machine Security

UNIT - V
Cloud Technologies and Advancements: Hadoop – MapReduce – Virtual Box -- Google App Engine –
Programming Environment for Google App Engine –– Open Stack – Federation in the Cloud – Four Levels of
Federation –Federated Services and Applications – Future of Federation.

Test Books:
1. Kai Hwang, Geoffrey C. Fox, Jack G. Dongarra, "Distributed and Cloud Computing, From Parallel
Processing to the Internet of Things", Morgan Kaufmann Publishers, 2012.
2. Rittinghouse, John W., and James F. Ransome,”Cloud Computing: Implementation, Management and
Security”, CRC Press, 2017.
3. Jaden Locus “cloud Computing for Beginners with Examples”, Kindle Edition, 2019.

Suggested Reading:
1. Lisdorf, Anders “Cloud computing Basics: A Non-Technical Introduction” published 2021.
2. Rajkumar Buyya, Christian Vecchiola, S. ThamaraiSelvi, “Mastering Cloud Computing”, Tata
McGraw Hill, 2013.
CBIT (A) With effect from the Academic Year 2022-23

3. Thomas Erl and Zaigham Mohamood “Cloud Computing: Concepts, Technology & Architecture”, The
Pearson Service Technology Series, published 2013.
4. Toby Velte, Anthony Velte, Robert Elsenpeter, "Cloud Computing - A Practical Approach”, Tata
McGraw Hill, 2009.

Online Resources:
1. https://1library.net/document/ozl74rry-mastering-cloud-computing-rajkumar-buyya-pdf.html
2. Mastering Cloud Computing Rajkumar Buyya pdf (1library.net)
3. Distributed and Cloud Computing: From Parallel Processing to the Internet of Things by Kai Hwang
(goodreads.com)
4. https://www.goodreads.com/book/show/19649262-distributed-and-cloud-computing
CBIT (A) With effect from the Academic Year 2022-23

20CSO14
FUNDAMENTALS OF COMPUTER VISION
(Open Elective)
Instruction 3 Hours per week
Duration of End Examination 3 Hours
Semester End Examination 60 Marks
Continuous Internal Evaluation 40 Marks
Credits

Course Objectives: The objectives of this course are,

1. To understand the Fundamental Concepts Related to Multi-Dimensional Signal Processing.
2. To understand Feature Extraction algorithms.
3. To understand Visual Geometric Modeling and Stochastic Optimization.

Course Outcomes: On Successful completion of this course, student will be able to,
1. Recognize the basic fundamentals of vision and describe the scope of challenges.
2. Develop algorithms to analyze feature detection and feature alignment.
3. Analyze images and videos for problems such as tracking and structure from motion.
4. Choose object, scene recognition and categorization algorithms for real time images.
5. Apply various techniques to build computer vision applications.

UNIT - I
Introduction to Computer Vision and Image Formation: Introduction, Geometric primitives and
transformations, Photometric image formation, Digital Camera image formation.
Image Processing: Point operators, linear filtering, more neighborhood operators, Fourier transforms, Pyramids
and wavelets, Geometric transformations.

UNIT - II
Feature detection and matching: Points and patches, Edges, Lines.
Segmentation: Active contours, Split and merge, Mean shift and mode finding, Normalized cuts.
Feature-based alignment: 2D and 3D feature-based alignment, Pose estimation.

UNIT - III
Structure from motion: Triangulation, Two-frame structure from motion, Factorization, Bundle adjustment,
constrained structure and motion.
Dense motion estimation: Translational alignment, parametric motion, Spline-based motion, Optical flow,
Layered motion.

UNIT - IV
Image Stitching: Motion Models, Global alignment, Sparse and dense corresponding, Global Optimization.

UNIT – V
Recognition: Object detection, Face recognition, Instance recognition, Category recognition, Context and scene
understanding.

Text Books:
1. Richard Szeliski “Computer Vision: Algorithms and Applications”, Springer-Verlag London Limited,
2011.
2. R. C. Gonzalez and R. E. Woods, “Digital Image Processing”; Addison Wesley, 2008.

Suggested Reading:
1. Robert J. Schallkoff, “Pattern Recognition: Statistical. Structural and Neural Approaches”, John Wiley
and Sons; 1992+.
2. D. A. Forsyth and J. Ponce, “Computer Vision: A Modern Approach”, Pearson Education, 2003.
3. R. Hartley and A. Zisserman, “Multiple View geometry”, Cambridge university Press, 2002.
4. Richard Hartley and Andrew Zisserman, “Multiple View Geometry in Computer Vision”, Second
Edition, Cambridge University Press, March 2004.
5. K. Fukunaga; “Introduction to Statistical Pattern Recognition”, Second Edition, Academic Press,
Morgan Kaufmann, 1990.
CBIT (A) With effect from the Academic Year 2022-23

Online Resources / Weblinks / NPTEL Courses:

1. CV online: http://homepages.inf.ed.ac.uk/rbf/CVonline
2. Computer Vision Homepage:
3. http://www2.cs.cmu.edu/afs/cs/project/cil/ftp/html/vision.html