HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20MA1103 Mathematical Foundation of CSE 3 1 0 4

1. To apply mathematical linear programming techniques to solve constrained problems.

2. To appreciate the use of simulation techniques.
3. To enable them to estimate the value of the parameters involved in the specific
distribution from a possible continuum of alternatives.
Course
4. To give an idea of testing the statistical hypothesis claimed based on a set of
Objective data points using standard sampling distributions.
5. To impart knowledge of handling random vectors which represent random
variables in multidimensional space.

Instructional
Unit Description
Hours

LINEAR PROGRAMMING
I 12
Formulation – Graphical solution – Simplex method – Two phase method –
Transportation and Assignment Problems
SIMULATION
II Discrete Event Simulation – Monte – Carlo Simulation – Stochastic Simulation – 12
Applications to real time problems
ESTIMATION THEORY
III Estimators: Unbiasedness, Consistency, Efficiency and Sufficiency – Maximum 12
Likelihood Estimation – Method of moments
TESTING OF HYPOTHESIS
Sampling distributions – Estimation of parameters – Statistical hypothesis –
IV Tests based on Normal, t, Chi-square and F distributions for mean, variance 12
and proportion, Tests for independence of attributes and goodness of fit.

MULTIVARIATE ANALYSIS
Random vectors and Matrices – Mean vectors and Covariance matrices –
V 12
Multivariate Normal density and its properties – Principal components: Population
principal components – Principal components from standardized variables
Total Instructional Hours 60

Course CO1: Formulate and find optimal solution in the real life optimizing/allocation/assignment
Outcome problems involving conditions and resource constraints.
CO2: Simulate appropriate application/distribution problems.
CO3: Obtain the value of the point estimators using the method of moments and method of
maximum likelihood.
CO4: Apply the concept of various test statistics used in hypothesis testing for mean and
variances of large and small samples.
CO5: Get exposure to the principal component analysis of random vectors and matrices.
 HICET – Department of Computer Science and Engineering

REFERENCE BOOKS:
R1: Jay L.Devore, “Probability and Statistics for Engineering and the Sciences”, Cengage Learning, 9th
Edition, Boston, 2016
R2: Johnson, R.A, Irwin Miller and John Freund., “Miller and Freund’s Probability and Statistics for
Engineers”, Pearson Education, 9th Edition, New York, 2016.
R3: Ross. S.M., “Probability Models for Computer Science”, Academic Press, SanDiego, 2002.
R4: Taha H.A.,, “Operations Research: An Introduction”, Prentice Hall of India Pvt. Ltd. 10th Edition, New
Delhi, 2017
R5: Winston, W.L., “Operations Research”, Thomson – Brooks/Cole, Fourth Edition, Belmont, 2003.

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20CP1201 Advance Data Structures 3 1 0 4

1. To extend the students’ knowledge of algorithms and data structures.

2. To enhance their expertise in algorithmic analysis and algorithm designtechniques.
Course 3. To understand various types of search and heap structures.
Objective 4. To study various types of geometric, randomized and approximation algorithms.
5. To extrapolate from them in order to apply those algorithms
andtechniquesto solve problems
Instructional
Unit Description
Hours

FUNDAMENTALS
I Properties of Big-oh Notation –Conditional Asymptotic Notation – Algorithm 12
Analysis – Amortized Analysis – Introduction to NP-Completeness/NP-Hard –
Recurrence Equations – Solving Recurrence Equations – Time-Space Tradeoff
SEARCH STRUCTURES
II Binary Search Trees – AVL Trees – Red-Black trees – Multi-way Search 12
Trees –B-Trees – Splay Trees – Tries.
HEAP STRUCTURES
III Min/Max heaps – Deaps – Leftist Heaps – Binomial Heaps – Fibonacci 12
Heaps – Skew Heaps – Lazy Binomial Heaps
GEOMETRIC ALGORITHMS
Segment Trees – 1-Dimensional Range Searching – k-d Trees – Line Segment
IV 12
Intersection – Computing the Overlay of Two Subdivisions – Range Trees –
Voronoi Diagram
ADDITIONAL TOPICS
Approximation Algorithms: Vertex Cover & Euclidean Travelling Salesperson
V 12
Problem – Randomized Algorithms: Closest Pair Problem & Minimum Spanning
Trees – Online Algorithm: Euclidean Spanning Tree
Total Instructional Hours 60

Course CO1: Analyze algorithms.

Outcome CO2: Determine algorithm correctness.
CO3: Choose appropriate data structures for the problems to be solved.
CO4: Design algorithms for problems from different domains.
CO5: Identify various research strategies on algorithmic design
 HICET – Department of Computer Science and Engineering

REFERENCE BOOKS:
R1: Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed, “Fundamentals of Data Structures in
C”,Second Edition, University Press, 2008
R2: Gilles Brassard, Paul Bratley, “Algorithmics: Theory and Practice”, Prentice Hall, 1988.
R3: Mark de Berg, Otfried Cheong, Marc van Kreveld, Mark Overmars, “Computational Geometry
Algorithms and Applications”, Third Edition, Springer, 2008.
R4: R.C.T Lee, S.S Tseng, R.C Chang and Y.T Tsai, “Introduction to the Design and Analysis of
Algorithms”, Tata McGraw-Hill Edition, 2012.
R5: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, “Introduction to
Algorithms”, MIT Press, 2009

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20CP1202 Advanced Database Management System 3 0 0 3

1. To comprehend the underlying principles of Relational Database Management

System..
2. To develop database models using parallel and distributed databases.
Course 3. To understand the concepts of XML and Web databases.
Objective 4. To apprehend the design and implementation of active temporal and deductive
databases.
5. To develop applications based on NoSQL database

Instructional
Unit Description
Hours
RELATIONAL MODEL
Entity Relationship Model – Relational Data Model – Mapping Entity
I Relationship Model to Relational Model – Relational Algebra – Structured 9
Query Language-Database Normalization – Transaction Management-
Recovery
PARALLEL AND DISTRIBUTED DATABASES
Parallel Databases– I/O Parallelism– Inter-Query and Intra-Query
Parallelism– Inter-Operation and Intra-operation Parallelism – Performance
II evaluation for Parallel DB Systems – Distributed Database Architecture- 9
Distributed Data Storage – Distributed Transactions – Distributed Query
Processing –Distributed Transaction Management – Load balancing tools for
DDB – DDB Security.
XML AND WEB DATABASES
XML Data Model – DTD – XML Schema – XML Querying – Web
III Databases – Open Database Connectivity-Java Database Connectivity– 9
Accessing Relational database using PHP – User Driven Querying – Writing
to Web Databases – Session Management
ACTIVE TEMPORAL AND DEDUCTIVE DATABASES
Event Condition Action Model – Design and Implementation Issues for
IV Active Databases – Termination, Confluence, Determination and 9
Modularization – Temporal Databases –Interpreting Time in Relational
Databases – Deductive Databases – Datalog Queries
NoSQL DATABASES
NoSQL database vs traditional RDBMS database – Migrating from RDBMS
V to NoSQL– CRUD operations – Querying NoSQL stores – Indexing and 9
Ordering Datasets – MongoDB-Database creation and Querying– Web
Application development using MongoDB
Total Instructional Hours 45

Course CO1: Design and implement relational databases

Outcome CO2: Design and implement parallel and distributed databases.
CO3: Design and implement XML databases, Active, Temporal and Deductive databases.
CO4: Implement the concept of database connectivity with the applications.
CO5: Design and implement NoSQL database.
 HICET – Department of Computer Science and Engineering

REFERENCE BOOKS:
R1: R. Elmasri, S.B. Navathe, “Fundamentals of Database Systems”, Addison-Wesley, 2011.
R2: Han, Jiawei, Jian Pei, and MichelineKamber. Data mining: Concepts and Techniques. 2011.
R3: Thomas Cannolly and Carolyn Begg, “Database Systems, A Practical Approach to Design,
Implementation and Management”, Third Edition, Pearson Education, 2007
R4: Henry F Korth, Abraham Silberschatz, S. Sudharshan, “Database System Concepts”, Fifth Edition,
McGraw Hill, 2006
R5: C. J. Date, A.Kannan and S. Swamynathan, “An Introduction to Database Systems”, Eighth Edition,
Pearson Education, 2006.

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20CP1203 Software Architecture 3 0 0 3

1. To understand the need, design approaches for software architecture to

bridge thedynamic requirements and implementation
2. To learn the design principles and to apply for large scale systems
Course 3. To design architectures for distributed heterogeneous systems
environment through brokerage interaction
Objective
4. To build design knowledge on service oriented and model driven architectures
and the aspect oriented architecture.
5. To develop appropriate architectures for various Case studies like semantic
web services, supply chain cloud services.
Instructional
Unit Description
Hours
INTRODUCTION TO SOFTWARE ARCHITECTURE
Introduction to Software Architecture-Bridging Requirements and
I Implementation, Design Guidelines, Software Quality attributes. Software 9
Architecture Design Space. Agile Approach to Software Architecture Design,
Models for Software Architecture Description Languages (ADL).
OBJECT-ORIENTED PARADIGM
Object-Oriented Paradigm -Design Principles. Data-Centered Software
II Architecture: Repository Architecture, Blackboard Architecture. Hierarchical 9
Architecture Main-Subroutine, Master-Slave, Layered, Virtual Machine.
Interaction-Oriented Software Architectures: Model-View-Controller (MVC),
Presentation-Abstraction-Control (PAC ).
DISTRIBUTED ARCHITECTURE
Distributed Architecture: Client-Server, Middleware, Multi-tiers, Broker
III Architecture – MOM,CORBA Message Broker Architecture- Service- 9
Oriented Architecture (SOA), SOAP, UDDI, SOA Implementation in Web
Services, Grid/cloud Service Computing. Heterogeneous Architecture-
Methodology of Architecture Decision, Quality Attributes
ARCHITECTURE OF USER INTERFACES
Architecture of User Interfaces containers, case study-web service. Product
Line Architectures - methodologies, processes and tools. Software Reuse and
IV Product Lines -Product Line Analysis, Design and implementation, 9
configuration Models. Model Driven Architectures (MDA) –why MDA-
Model transformation and software architecture, SOA and MDA. Eclipse
modeling framework.
ASPECT ORIENTED ARCHITECTURES
Aspect Oriented Architectures- AOP in UML,AOP tools, Architectural aspects and
V middleware Selection of Architectures, Evaluation of Architecture Designs, Case 9
Study: Online Computer Vendor, order processing, manufacture &shipping –
inventory, supply chain cloud service Management, semantic web services
Total Instructional Hours 45

Course CO1: Understand the need of software architecture for sustainable dynamic systems
Outcome CO2: Have a sound knowledge on design principles and to apply for large scale systems
 HICET – Department of Computer Science and Engineering

CO3: Design architectures for distributed heterogeneous systems

CO4: Have good knowledge on service oriented and model driven architectures and the aspect
oriented architecture
CO5: Have a working knowledge to develop appropriate architectures through various
case studies.

REFERENCE BOOKS:
R1: Essentials of software Architecture , Ion Gorton, Second Edition, Springer-verlag, 2011
R2: Software Architecture Design Illuminated, Kai Qian Jones and Bartlett Publishers Canada, 2010

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20RM1161 Research Methodology and IPR 2 0 0 2

1. Identify an appropriate research problem in their interesting domain.

2. Understand ethical issues Understand the Preparation of a research project thesis report.
Course 3. Understand the Preparation of a research project thesis report
Objective 4. Understand the law of patent and copyrights.
5. Understand the Adequate knowledge on IPR

Instructional
Unit Description
Hours

RESEARCH PROBLEM FORMULATION

Meaning of research problem- Sources of research problem, criteria
I characteristics of a good research problem, errors in selecting a research 06
problem, scope and objectives of research problem. Approaches of
investigation of solutions for research problem, data collection, analysis,
interpretation, necessary instrumentations
LITERATURE REVIEW
II 06
Effective literature studies approaches, analysis, plagiarism, and research ethics.
TECHNICALWRITING /PRESENTATION
Effective technical writing, how to write report, paper, developing a research
III 06
proposal, format of research proposal, a presentation and assessment by a review
committee
INTRODUCTION TO INTELLECTUAL PROPERTY RIGHTS (IPR)
Nature of Intellectual Property: Patents, Designs, Trade and Copyright.
IV Process of Patenting and Development: technological research, innovation, 06
patenting, development. International Scenario: International cooperation on
Intellectual Property. Procedure for grants of patents, Patenting under PCT.
INTELLECTUAL PROPERTY RIGHTS (IPR)
Patent Rights: Scope of Patent Rights. Licensing and transfer of technology.
Patent information and databases. Geographical Indications. New
V 06
Developments in IPR: Administration of Patent System, IPR of Biological
Systems, Computer Software etc. Traditional knowledge Case Studies, IPR
and IITs.
Total Instructional Hours 30

Course CO1: Ability to formulate research problem.

Outcome CO2: Ability to carry out research analysis.
CO3: Ability to follow research ethics.
CO4: Ability to understand that today’s world is controlled by Computer, Information
Technology, but tomorrow world will be ruled by ideas, concept, and creativity.
CO5: Ability to understand about IPR and filing patents in R & D.
 HICET – Department of Computer Science and Engineering

REFERENCE BOOKS:
R1: Asimov, “Introduction to Design”, Prentice Hall, 1962
R2: Halbert, “Resisting Intellectual Property”, Taylor & Francis Ltd ,2007
R3: Mayall, “Industrial Design”, McGraw Hill, 1992.
R4: Niebel, “Product Design”, McGraw Hill, 1974.
R5: Ranjit Kumar, 2nd Edition, “Research Methodology: A Step by Step Guide for beginners” 2010

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20CP1001 Advanced Data Structures Laboratory 0 0 4 2

1. To familiarize various data structure implementations.

2. To implement heap and various tree structures like AVL, Red-black, B-
Course Tree and segment trees.
Objective 3. To understand efficient implementation of line segment intersection.
4. To understand various search structures.
5. To get understanding of problem to program mapping.

S.No Description of the Experiments

1. Binary Search Trees
2. Min/Max Heaps
3. Leftist Heaps
4. AVL Trees
5. Red-Black Trees
6. B-Trees
7. Segment Trees
8. Line segment intersection
Total Practical Hours 60

Course CO1: Achieve programming skill to convert a problem to a programming logic.

Outcome CO2: Apply suitable data structure for the problem in hand.
CO3: Implement heap and various tree structures like AVL, Red-black, B-Tree and
segment trees.
CO4: Understand the usage of data structures for geometric problems.
CO5: Understand the importance of height balancing in search structures.

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20CP1002 Advanced Database Management System 0 0 4 2
Laboratory

1.To explore the features of a Database Management Systems

Course
2.To interface a database with front end tools
Objective
3.To understand the internals of a database system
Description of the Experiments
S.No
1. Basic SQL
2. Intermediate SQL
3. Advanced SQL
4. ER Modeling
5. Database Design and Normalization

6. Accessing Databases from Programs using JDBC

7. Building Web Applications using PHP & MySQL
8. Indexing and Query Processing
9. Query Evaluation Plans
10. Concurrency and Transactions
11. Big Data Analytics using Hadoop
Total Instructional Hours 60

Course CO1: Ability to use databases for building web applications

Outcome CO2: Gaining knowledge about the internals of a database system

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T PC

ME 20CP2201 Advanced algorithms 3 0 0 3

COURSE OUTCOMES:
Upon completion of this course, the students will be able to
CO 1: analyze the algorithm’s efficiency of any given problem.(K4)
CO 2: apply different algorithmic design techniques to solve the problem.(S2,K3)
CO 3: use various efficient optimization techniques and parallel algorithms to reduce space complexity. (S5,K2)
CO 4: develop different approximation algorithm for P and NP class Problems. (S3,A2)

UNIT I ANALYSIS OF ALGORITHMIC PERFORMANCE 9

Introduction of Analysis of algorithm - Average and worst case analysis- Probabilistic and Randomized algorithm
- Computation Analysis - Algorithm Redesign and Adaptation - Asymptotic Notation - Amortized Efficiency.

UNIT II ALGORITHMIC DESIGN TECHNIQUES 9

Divide and Conquer: Binary Search – Analysis - Greedy Method: Prim’s Algorithm – Analysis - Dynamic
Programming strategies: Computing Binomial Co-efficient – Analysis - Backtracking: Eight Queen’s Problem- Analysis -
Branch and Bound- 0 / 1 Knapsack Problem

UNIT III EFFICIENT DATA PROCESSING 9

Searching algorithms - Priority queues - Binary heaps - Binomial heaps - Dictionaries - Hash tables - String
Matching - Introduction to string-matching problem- Naïve algorithm - Rabin Karp - Knuth Morris Pratt - Boyer-Moore
algorithms and complexity analysis- Data compression algorithms - Huffman compression -Lempel-Ziv compression

UNIT IV PROBABILISTIC & PARALLEL ALGORITHMS 9

Probabilistic Algorithm - Numerical probabilistic algorithms - Monte Carlo algorithms-Las Vegas algorithms -
Parallel algorithms: Introduction - Complexity measure for a parallel algorithmparallel searching algorithm - parallel
sorting algorithm - parallel algorithm for matrix manipulation

UNIT V COMPUTATIONAL COMPLEXITY & APPROXIMATION ALGORITHMS 9

The class P and NP: NP- Completeness Problem, NP-Hard Problems - Approximation Algorithms: Introduction-
approximation factor- Polynomial Time Approximation Scheme (PTAS) - Fully Polynomial Time Approximation
Scheme (FPTAS) - Approximation algorithms: Travelling Salesman Problem – knapsack problem - Bin packing- subset
sum problem
TOTAL: 45 PERIODS

REFERENCES
1. Dave, Dave Parag Himanshu, “Design and Analysis of Algorithms”, 2nd Edition, Pearson Education India, 2007.
2. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, “Introduction To Algorithms “, 3rd
Edition, MIT Press, 2008.
3. Sara Baase, "Computer Algorithms: Introduction to Design and Analysis, Second Edition", Addison-Wesley, 2008.
4. Banachowski. L, Kreczmar. A, Wojciech. R, “Analysis of Algorithms and Data Structures”, 2nd Edition, Addison
Wesley, 2006.
5. Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, 2nd Edition, Pearson Education,
2011.
 HICET – Department of Computer Science and Engineering

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20CP2202 Cloud Computing Technologies 3 0 0 3

1. To understand the concept of cloud and utility computing.

2. To understand the various issues in cloud computing.
Course 3. To familiarize themselves with the lead players in cloud.
Objective 4. To appreciate the emergence of cloud as the next generation computingparadigm.
5. To be able to set up a private cloud.

Instructional
Unit Description
Hours
INTRODUCTION
Introduction- Historical Development – Cloud Computing Architecture – The
I Cloud Reference Model – Cloud Characteristics –Cloud Deployment Models: 09
Public, Private, Community, Hybrid Clouds- Cloud Delivery Models: IaaS,
PaaS, SaaS – Open Source Private Cloud Software: Eucalyptus, Open Nebula,
Open Stack.
VIRTUALIZATION
Data Center Technology – Virtualization – Characteristics of Virtualized
II Environments - Taxonomy of Virtualization Techniques – Virtualization and 09
Cloud Computing –Pros and Cons of Virtualization – Implementation Levels
of Virtualization – Tools and Mechanisms: Xen, VMWare, Microsoft Hyper-
V, KVM, Virtual Box
CLOUD COMPUTING MECHANISM
Cloud Infrastructure Mechanism: Cloud Storage, Cloud Usage Monitor,
Resource Replication – Specialized Cloud Mechanism: Load Balancer, SLA
III Monitor, Pay-per-use Monitor, Audit Monitor, Failover System, Hypervisor, 09
Resource Cluster, Multi Device Broker, State Management Database –
Cloud Management Mechanism: Remote Administration System, Resource
Management System, SLA Management System, Billing Management
System
HADOOP AND MAP REDUCE
Apache Hadoop – Hadoop Map Reduce –Hadoop Distributed File System-
IV Hadoop I/O- Developing a Map Reduce Application – Map Reduce Types 09
and Formats – Map Reduce Features– Hadoop Cluster Setup –Administering
Hadoop.
SECURITY IN THE CLOUD
Basic Terms and Concepts – Threat Agents – Cloud Security Threats –Cloud
V Security Mechanism: Encryption, Hashing, Digital Signature, Public Key 09
Infrastructure, Identity and Access Management, Single Sign-on, Cloud
Based Security Groups, Hardened Virtual Server Images.
Total Instructional Hours 45

Course CO1: Articulate the main concepts, key technologies, strengths and limitations of cloud
Outcome computing
CO2: Identify the architecture, infrastructure and delivery models of cloud computing.
CO3: Explain the core issues of cloud computing such as security, privacy and interoperability.
CO4: Choose the appropriate technologies, algorithms and approaches for the related issues.
CO5: Facilitate Service Level Agreements (SLA).
 HICET – Department of Computer Science and Engineering

REFERENCE BOOKS:
R1: Thomas Erl, Zaigham Mahood, Ricardo Puttini, “Cloud Computing, Concept, Technology &
Architecture”, Prentice Hall, 2013.
R2: Rajkumar Buyya, Christian Vecchiola, S. Thamarai Selvi, “Mastering Cloud Computing”, Tata
McGraw-Hill,2013.
R3: Toby Velte, Anthony Velte, Robert C. Elsenpeter, “Cloud Computing, A Practical Approach”, Tata
McGraw-Hill Edition, 2010.
R4: Arshdeep Bahga, Vijay Madisetti, “Cloud Computing: A Hands-On Approach”, Universities
Press(India) Private Limited, 2014.
R5: Tom White, “Hadoop: The Definitive Guide”, O’Reilly Media, 4th Edition, 2015.
James E Smith and Ravi Nair, “Virtual Machines”, Elsevier, 2005.

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20CP2251 Machine Learning Techniques 3 0 2 4

Course Objective
1. To understand the concepts of Machine Learning.
2. To appreciate supervised learning and their applications.
3. To appreciate the concepts and algorithms of unsupervised learning.
4. To understand the theoretical and practical aspects of Probabilistic Graphical
Models.
5. To appreciate the concepts and algorithms of advanced learning.

Instructional
Unit Description
Hours

I INTRODUCTION
Machine Learning–Types of Machine Learning –Machine Learning process- preliminaries, 8
testing Machine Learning algorithms, turning data intoProbabilities,
and Statistics for Machine Learning- Probability theory – Probability Distributions –
Decision Theory. Illustrative Programs: Simple Decision Tree.

II SUPERVISED LEARNING
Linear Models for Regression – Linear Models for Classification- DiscriminantFunctions,
Probabilistic Generative Models, Probabilistic Discriminative Models –
Decision Tree Learning – Bayesian Learning, Naïve Bayes – Ensemble Methods, Bagging, 15
Boosting, Neural Networks, Multi-layer Perceptron, Feed- forward Network,
Error Back propagation - Support Vector Machines .
Illustrative Programs: Solving Regression & Classification using Decision Trees,
Root Node Attribute Selection for Decision Trees using Information Gain,
Bayesian Inference in Gene Expression Analysis, Pattern Recognition Application
using Bayesian Inference, Bagging in Classification, Bagging,
Boosting applications using Regression Trees.

III UNSUPERVISED LEARNING

Clustering -K-means–EM Algorithm - Mixtures of Gaussians
– Dimensionality Reduction, Linear Discriminant Analysis, 13
Factor Analysis,Principal Components Analysis, Independent Components Analysis.
Illustrative Programs: Data & Text Classification using Neural Networks,
Data & Text Clustering using K-means algorithm, Data & Text Clustering
using Gaussian Mixture Models.

IV PROBABILISTIC GRAPHICAL MODELS

Graphical Models – Undirected Graphical Models – Markov Random Fields –
Directed Graphical Models –Bayesian Networks – Conditional Independence 9
properties – Markov Random Fields- Hidden Markov Models – Conditional
Random Fields(CRFs).
Illustrative Programs: Application of CRFs in Natural Language Processing

V ADVANCED LEARNING
Sampling-Basic Sampling methods, Monte Carlo, Gibbs Sampling – Computational
Learning Theory – Mistake Bound Analysis – Reinforcement learning –
Markov Decision processes, Deterministic and Non-deterministic Rewards and Actions, 15
Temporal Difference Learning Exploration. Illustrative Programs: Dimensionality
Reduction Algorithms in Image Processing applications, Using Weka tool for SVM
classification for chosen domain application.

Total Instructional Hours 60

 HICET – Department of Computer Science and Engineering

Course CO1: Design a learning model appropriate to the application.

Outcome CO2: Design a Neural Network for an application of your choice.
CO3: Implement Probabilistic Discriminative and Generative algorithms for an
application of your choice and analyze the results.
CO4: Use a tool to implement typical Clustering algorithms for different types of applications.
CO5: Design and implement an HMM for a Sequence Model type of application.

REFERENCE BOOKS:
R1: Christopher Bishop, “Pattern Recognition and Machine Learning” Springer, 2007.
R2: Stephen Marsland, “Machine Learning – An Algorithmic Perspective”, Chapman andHall, CRC
Press, Second Edition, 2014
R3: Kevin P. Murphy, “Machine Learning: A Probabilistic Perspective”, MIT Press, 2012.
R4: Ethem Alpaydin, “Introduction to Machine Learning”, MIT Press, Third Edition, 2014.
R5: Tom Mitchell, “Machine Learning”, McGraw-Hill, 1997.

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20CP2001 Advanced Algorithms Laboratory 0 0 4 2

1.To learn mathematical background for analysis of algorithm

Course 2.To learn various advanced data structures.
3.To understand the concept of designing analgorithm.
Objective
4.To understand the concept of pattern matching
5.To learn advanced tree and graphapplications.
Description of the Experiments
S.No
1. Singly linked list
2. Doubly linked list.
3. Write a Java program to implement priority queue ADT
Write a Java program to perform the following operations:
i.Construct a binary search tree of elements.
4.
ii.Search for a key element in the above binary search tree.
iii.Delete an element from the above binary search tree.
5. Write a Java program to implement all the functions of a dictionary (ADT) using Hashing.
6. Write a Java program to implement Dijkstra’s algorithm for Single source shortest path problem.
Write Java programs that use recursive and non-recursive functions to traverse the given
binary tree in
7. i. Preorder
ii. Inorder
iii.Postorder.
8. Write Java programs for the implementation of bfs and dfs for a given graph.
Write Java programs for implementing the following sorting methods:
i.Heap sort
9.
ii.Quick sort
iii.Radix sort
Write a Java program to perform the following operations:
i.Insertion into a B-tree
10.
ii.Searching in a B-tree

Write a Java program that implements Kruskal’s algorithm to generate minimum cost spanning
11. tree.
12. Write a Java program that implements KMP algorithm for pattern matching.
Total Instructional Hours 60

Course CO1: Students will be able to choose appropriate advanced data structure for given problem.
Outcome CO2: Students will be able to calculate complexity.
CO3: Students will be able to select appropriate design techniques to solve real world problems.
CO4: Students will able to apply the dynamic programming technique to solve the problems.
CO5: Students will be able to select a proper pattern matching algorithm for given problem

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20CP3301 Big Data Computing 3 0 0 3

1. Introduce Big Data and Hadoop

2. Introduce Big Data Platform
Course 3. Introduce Big data streaming platform for fast Data
Objective 4. To Learn about Machine learning
5. To understand the Application of Big Data.

Instructional
Unit Description
Hours
INTRODUCTION TO BIG DATA
Introduction to Big Data-Big Data enabling Technologies- Hadoop Stack for Big
I 9
Data-Hadoop Distributed File System-Hadoop Map Reduce 1.0- Hadoop Map
Reduce 2.0-Map Reduce examples.
BIG DATA PLATFORM
Parallel Programming with spark-Introduction to Spark- Spark Built-in Libraries-
II 9
Design of Key Value stores-Data placement Strategies-CAP Theorem-Consistency
Solutions-Design of Zookeeper-CQL(Cassandra Query Language)
BIG DATA STREAMING PLATFORMS FOR FAST DATA
Introduction to Big Data Streaming Platforms for Fast Data-Introduction to Big Data
III Streaming Systems-Big Data Pipelines for Real-Time computing -Design of HBase- 9
Spark Streaming and Sliding Window Analytics- Sliding Window Analytics-
Introduction to Kafka.
MACHINE LEARNING
Big Data Machine Learning-Machine Learning Algorithm K-Means Using Map
IV Reduce for Big Data Analytics -Parallel K-Means Using Map Reduce On Big Data 9
Cluster Analysis-Decision Trees for Big Data Analytics-Big Data Predictive
Analytics .
BIG DATA APPLICATIONS
Introduction to Big Data Applications (Graph Processing-Introduction to Pregel-
V 9
Parameter Servers-PageRank Algorithm in Big Data-Spark GraphX & Graph
Analytics-Case Study: Flight Data Analysis Using Spark GraphX
Total Instructional Hours 45

Course CO1: Understand the Big Data and Hadoop

Outcome CO2: Understand the Big Data Platform
CO3: Understand the Big data streaming platform for fast Data
CO4: Explore the Machine learning
CO5: Illustrate Various Big Data applications
 HICET – Department of Computer Science and Engineering

TEXT BOOK :
T1: Bart Baesens, Analytics in a Big Data World: The Essential Guide to Data Science and its
Applications, Wiley, 2014

REFERENCE BOOKS:
R1: https://nptel.ac.in/courses/106/104/106104189/
R2: Dirk Deroos et al., Hadoop for Dummies, Dreamtech Press, 2014.
R3: Chuck Lam, Hadoop in Action, December, 2010.

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20CP2301 Agent Based Intelligent System 3 0 0 3

1. Demonstrate good knowledge of basic theoretical foundations of the following

common intelligent systems methodologies: Rule-based systems, Fuzzy inferencing
and artificial neural networks.
2. Determine which type of intelligent system methodology would be suitable for a given
type of application problem.
Course 3. Demonstrate, in the form of a major project work, the ability to design and
Objective Develop an intelligent system for a selected application.
4. Demonstrate, in the form of a major project work, the ability to design and develop an
intelligent system for a selected application The learning mechanisms of agents
5. Demonstrate, in the form of a major project work, the ability to design and develop an
the communication and cooperation within agents

Instructional
Unit Description
Hours

INTRODUCTION
I Definitions - Foundations - History - Intelligent Agents-Problem Solving- 9
Searching -Heuristics -Constraint Satisfaction Problems - Game playing.

KNOWLEDGE REPRESENTATION AND REASONING

II Logical Agents-First order logic-First Order Inference-Unification-Chaining- 9
Resolution Strategies-Knowledge Representation-Objects-Actions-Events
PLANNING AGENTS
III Planning Problem-State Space Search-Partial Order Planning-Graphs- 9
Nondeterministic
Domains-Conditional Planning-Continuous Planning-MultiAgent Planning.
AGENTS AND UNCERTAINITY
Acting under uncertainty – Probability Notation-Bayes Rule and use –
IV Bayesian 9
Networks-Other Approaches-Time and Uncertainty-Temporal Models- Utility
Theory -
Decision Network – Complex Decisions.
HIGHER LEVEL AGENTS
V Knowledge in Learning-Relevance Information-Statistical Learning Methods 9
Reinforcement Learning-Communication-Formal Grammar-Augmented
Grammars Future of AI.
Total Instructional Hours 45

Course CO1: Students will gain deep understanding of the basic artificial intelligence techniques.
Outcome CO2: Students will apply their knowledge to design solutions to different problems.
CO3: Students will have the ability to design and develop an intelligent system for a selected
application.
CO4: An ability to work individually or as a member with responsibility to function on
multidisciplinary teams.
CO5: Ability to understand and apply computational platforms and software tools for
Information Technology applications
 HICET – Department of Computer Science and Engineering

TEXT BOOKS:
T1: Stuart Russell and Peter Norvig, “Artificial Intelligence - A Modern Approach”,2nd Edition, Prentice
Hall, 2002

REFERENCE BOOKS:
R1: Michael Wooldridge, “An Introduction to Multi Agent System”, John Wiley, 2002.
R2: Patrick Henry Winston, Artificial Intelligence, 3rd Edition, AW, 1999.
R3: Nils.J.Nilsson, Principles of Artificial Intelligence, Narosa Publishing House, 1992

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20CP2302 Multicore Architectures 3 0 0 3

1. To introduce the students to the recent trends in the field of Computer

Architecture and identify performance related parameters.
Course 2. To understand the different multiprocessor issues.
Objective 3. To expose the different types of multicore architectures.
4. To understand the design of the memory hierarchy.
5. To understand how the various forms of parallelism are exploited by thearchitecture.

Instructional
Unit Description
Hours

FUNDAMENTALS OF COMPUTER DESIGN AND ILP

I Fundamentals of Computer Design – Measuring and Reporting Performance – 9
Instruction Level Parallelism and its Exploitation – Concepts and Challenges
– Limitations of ILP – Multithreading – SMT and CMP Architectures – The
Multicore era.

MEMORY HIERARCHY DESIGN

II Introduction – Optimizations of Cache Performance – Memory Technology 9
and Optimizations – Protection: Virtual Memory and Virtual Machines –
Design of Memory Hierarchies – Case Studies.

MULTIPROCESSOR ISSUES
III Symmetric and Distributed Shared Memory Architectures – Cache Coherence 9
Issues – Performance Issues – Synchronization Issues – Models of Memory
Consistency – Interconnection Networks – Buses, Crossbar and Multi-stage
Interconnection Networks.

MULTICORE ARCHITECTURES
Homogeneous and Heterogeneous Multi-core Architectures – Intel Multicore
IV 9
Architectures – SUN CMP architecture – IBM Cell Architecture. Introduction
to Warehouse-Scale computers, Cloud Computing – Architectures and Issues
– Case Studies.

VECTOR, SIMD AND GPU ARCHITECTURES

V Vector Architecture – SIMD Extensions for Multimedia – Graphics 9
Processing Units – Case Studies – GPGPU Computing – Detecting and
Enhancing Loop Level Parallelism – Introduction to Domain Specific
Architectures.
Total Instructional Hours 45

Course CO1: Identify the limitations of ILP and the need for multicore architectures.
Outcome CO2: Discuss the issues related to multiprocessing and suggest solutions.
CO3: Point out the salient features of different multicore architectures and how they exploit
parallelism.
CO4: Point out the various optimizations that can be performed to improve the memory
hierarchy design.
CO5: Point out the salient features of vector, GPU and domain specific architectures.
 HICET – Department of Computer Science and Engineering

REFERENCE BOOKS:
R1: John L. Hennessey and David A. Patterson, “Computer Architecture – A Quantitative Approach”,
Morgan Kaufmann / Elsevier, 5th edition, 2012.
R2: Darryl Gove, “Multicore Application Programming: For Windows, Linux, and Oracle Solaris”,
Pearson, 2011.
R3: David B. Kirk, Wen-mei W. Hwu, “Programming Massively Parallel Processors”, Morgan
Kauffman, 2010.
R4: Wen–mei W.Hwu,“GPU Computing Gems”, Morgan Kaufmann / Elsevier, 2011.

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20CP2303 Software Design Patterns 3 0 0 3

1. Demonstration of patterns related to object

oriented design.
2. Describe the design patterns that are common in softwareapplications.
Course 3.Analyze a software development problem and express it.
Objective 4. Design a module structure to solve a problem, and evaluate alternatives.
5. Implement a module so that it executes efficiently and correctly.

Instructional
Unit Description
Hours
INTRODUCTION TO DESIGN PATTERN
What is a Design Pattern?, Design Patterns in Smalltalk MVC, Describing Design
I Patterns, The Catalogue of Design Patterns, Organizing The Cato log, How Design 9
Patterns solve Design Problems, How to Select a Design pattern, How to Use a
Design Pattern.
A CASE STUDY OF DESIGN PATTERN
A Case Study: Designing a Document Editor, Design Problems , Document
Structure, Formatting , Embellishing the User Interface, Supporting Multiple
II Look-and-Feel Standards, Supporting Multiple Window Systems, User 9
Operations Spelling Checking and Hyphenation, Summary, Creational
Patterns, Abstract Factory, Builder , Factory Method, Prototype, Singleton,
Discussion of Creational Patterns
STRUCTURAL PATTERN PART-I & II
III Structural Pattern Part-I, Adapter, Bridge, Composite. Structural Pattern Part-II, 9
Decorator, Facade, Flyweight, Proxy.
BEHAVIORAL PATTERNS PART: I & II
IV Behavioral Patterns Part: I, Chain of Responsibility, Command, Interpreter, Iterator. 9
Behavioral Patterns Part: II, Mediator, Memento, Observer, Discussion of
Behavioral Patterns.
BEHAVIORAL PATTERNS PART:III
V Behavioral Patterns Part: III, State, Strategy, Template Method, Visitor, Discussion 9
of Behavioral Patterns. What to Expect from Design Patterns, A Brief History, The
Pattern Community, An Invitation, A Parting Thought
Total Instructional Hours 45

Course CO1: Construct a design consisting of a collection of modules.

Outcome CO2: Exploit well-known design patterns (such as Iterator, Observer, Factory and Visitor).
CO3: Distinguish between different categories of design patterns.
CO4: Ability to understand and apply common design patterns to incremental/iterative
development.
CO5: Ability to identify appropriate patterns for design of given problem.
CO6: Design the software using Pattern Oriented Architectures.
 HICET – Department of Computer Science and Engineering

TEXT BOOKS:
T1: Design Patterns By Erich Gamma, Pearson Education

REFERENCE BOOKS:
R1: Patterns in JAVA Vol-I (or) Vol-II By Mark Grand, Wiley Dream Tech.
R2: Java Enterprise Design Patterns Vol-III By Mark Grand Wiley Dream Tech

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20CP2304 Compiler Optimization Techniques 3 0 0 3

1. To understand different forms of intermediate languages and analyzing

programs.
Course 2. To understand optimizations techniques for single program blocks.
Objective 3.To apply optimizations on procedures and low level code.
4.To explore and enhance inter procedural optimizations.
5.To enhance resource utilization.

Instructional
Unit Description
Hours
INTERMEDIATE REPRESENTATION OF PROGRAMS AND ANALYSIS
Structure of an Optimizing Compiler – Compiler Construction tools – LIR, MIR,
I HIR, DAG, SyntaxTree and Postfix. Analysis: Control Flow Analysis, Iterative Data 9
Flow Analysis, Static Single Assignment – A Linear Time Algorithm for Placing φ-
Nodes, Basic Block Dependence, Alias Analysis. Introduction to LLVM –
Compiling a language
LOCAL AND LOOP OPTIMIZATIONS
Early Optimizations: Constant-Expression Evaluation – Scalar Replacement
of Aggregates – Algebraic Simplifications and Re-association – Value
Numbering – Copy Propagation – Sparse Conditional Constant Propagation.
II Redundancy Elimination: Common – Subexpression Elimination – Loop- 9
Invariant Code Motion – Partial-Redundancy Elimination – Redundancy
Elimination and Reassociation – Code Hoisting. Loop Optimizations:
Induction Variable Optimizations – Unnecessary Bounds Checking
Elimination. LLVM pass –LLVM Test Infrastructure.
PROCEDURE OPTIMIZATION AND SCHEDULING
Procedure Optimizations: Tail-Call Optimization and Tail-Recursion
Elimination – Procedure Integration – In-Line Expansion – Leaf-Routine
Optimization and Shrink Wrapping. Code Scheduling: Instruction Scheduling
– Speculative Loads and Boosting – Speculative Scheduling – Software
III Pipelining – Trace Scheduling – Percolation Scheduling. Control-Flow and 9
Low-Level Optimizations: Unreachable-Code Elimination – Straightening –
If Simplifications – Loop Simplifications –Loop Inversion Un-switching –
Branch Optimizations – Tail Merging or Cross Jumping – Conditional Moves
– Dead-Code Elimination – Branch Prediction – Machine Idioms and
Instruction Combining. LLVM API procedure optimization.
INTER PROCEDURAL OPTIMIZATION
Symbol table Runtime Support – Interprocedural Analysis and Optimization:
Interprocedural Control- Flow Analysis – The Call Graph – Interprocedural
IV Data-Flow Analysis – Interprocedural Constant Propagation – Interprocedural 9
Alias Analysis – Interprocedural Optimizations – Interprocedural Register
Allocation – Aggregation of Global References. LLVM – Interprocedural
Analyses.
OPTIMIZING FOR MEMORY
Register Allocation: Register Allocation and Assignment – Local Methods – Graph
V Coloring Priority Based Graph Coloring. Computations on Iteration Spaces- 9
Optimization for the Memory Hierarchy: Impact of Data and Instruction Caches –
Instruction-Cache Optimization – Scalar Replacement of Array Elements – Data-
Cache Optimization – Scalar vs. Memory-Oriented Optimizations. Software
 HICET – Department of Computer Science and Engineering

Prefetching – Parallelization – Instruction Level Parallelism – Automatic

Parallelization
Total Instructional Hours 45

Course CO1: Identify the different optimization techniques that are possible for a sequence ofcode.
Outcome CO2: Design performance enhancing optimization techniques.
CO3: Manage procedures with optimal overheads.
CO4: Understand modern programming language features and constructs.
CO5: Learn to work on a larger software project

CO6:

REFERENCE BOOKS:
R1: Steven.S. Muchnick, Advanced Compiler Design and Implementation, Morgan Kaufman Publishers,
1997.
R2: Alfred V. Aho, Monica S. Lam, Ravi Sethi, Jeffrey D. Ullman, “Compilers: Principles, Techniques,
and Tools”, Addison Wesley, Second Edition, 2007.
R3: Y.N.Srikant, Priti Shankar, “The Compiler Design Handbook – Optimizations and Machine Code
Generation”, CRC Press, Second Edition, 2008.
R4: Andrew W. Appel, Jens Palsberg, “Modern Compiler Implementation in Java”, Cambridge
University Press, Second Edition, 2002.
R5: Keith Cooper, Linda Torczon, “Engineering a Compiler”, Morgan Kaufmann, Second Edition, 2011.
R6: Randy Allen and Ken Kennedy, Optimizing Compilers for Modern Architectures: A Dependence
based Approach, Morgan Kaufman, 2001.

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20CP2305 Distributed Operating Systems 3 0 0 3

1. To understand the concepts of distributed systems.

2.To get an insight into the various issues and solutions in distributed operating
Course systems.
Objective 3.To learn about real-time operating systems.
4.To gain knowledge on the design concepts of mobile operating systems.
5.To understand cloud operating systems
Instructional
Unit Description
Hours
INTRODUCTION
I Distributed Operating Systems – Issues – Communication Primitives – 9
Limitations of a Distributed System – Lamport’s Logical Clocks – Vector
Clocks – Causal Ordering of Messages
DISTRIBUTED OPERATING SYSTEMS
Distributed Mutual Exclusion Algorithms – Classification – Preliminaries –
Simple Solution – Lamport’s Algorithm – Ricart-Agrawala Algorithm –
Suzuki-Kasami’s Broadcast Algorithm – Raymond’s Tree-Based Algorithm –
II Distributed Deadlock Detection – Preliminaries – Centralized Deadlock 9
Detection Algorithms – Distributed Deadlock Detection Algorithms – Path
Pushing Algorithm – Edge Chasing Algorithm – Hierarchical Deadlock
Detection Algorithms – Agreement Protocols – Classification – Solutions to
the Byzantine Agreement Problem – Lamport-Shostak- Pease Algorithm
DISTRIBUTED RESOURCE MANAGEMENT
Distributed File Systems – Design Issues – Google File System – Hadoop
III Distributed File System-Distributed Shared Memory – Algorithms for 9
Implementing Distributed Shared Memory – Load Distributing Algorithms –
Synchronous and Asynchronous Check Pointing and Recovery – Fault Tolerance –
Two-Phase Commit Protocol – Nonblocking Commit Protocol
REAL TIME OPERATING SYSTEMS
IV Basic Model of Real - Time Systems – Characteristics – Application of Real - 9
Time Systems – Real - Time Task Scheduling – Handling Resource Sharing
MOBILE AND CLOUD OPERATING SYSTEMS
V Android – Overall Architecture – Linux Kernel – Hardware Support – Native 9
User-Space – Dalvik and Android’s Java – System Services – Introduction to
Cloud Operating Systems.
Total Instructional Hours 45

Course CO1: Identify the features of distributed operating systems.

Outcome CO2: Demonstrate the various protocols of distributed operating systems.
CO3: Identify the different features of real time operating systems.
CO4: Discuss the features of mobile operating systems.
CO5: Discuss the features of cloud operating systems.
 HICET – Department of Computer Science and Engineering

REFERENCE BOOKS:
R1: Mukesh Singhal and Niranjan G. Shivaratri, “Advanced Concepts in Operating Systems – Distributed,
Database and Multiprocessor Operating Systems”, Tata MC Graw-Hill, 2001
R2: Rajib Mall, “Real-Time Systems: Theory and Practice”, Pearson Education India, 2006.
R3: Karim Yaghmour, “Embedded Android”, O’Reilly, First Edition, 2013.
R4: Nikolay Elenkov, “Android Security Internals: An In-Depth Guide to Android’s Security
Architecture”, No Starch Press, 2014.

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20CP2306 Software Process And Project Management 3 0 0 3

1. To understand overall SDLC and adopt suitable processes

2.To elicite, analyze, prioritize, and manage both functional and quality
requirements
Course
3.To estimate efforts required, plan, and track the plans
Objective
4.To understand and apply configuration and quality managementtechniques
5.To evaluate, manage, and design processes

Instructional
Unit Description
Hours
DEVELOPMENT LIFE CYCLE PROCESSES
Overview of software development life cycle – introduction to processes –
I Personal Software Process (PSP) – Team software process (TSP) – Unified 9
processes – agile processes – choosing the right process Tutorial: Software
development using PSP
REQUIREMENTS MANAGEMENT
Functional requirements and quality attributes – elicitation techniques – Quality
Attribute Workshops (QAW) – analysis, prioritization, and trade-off –
II Architecture Centric Development Method (ACDM) – requirements 9
documentation and specification – change management – traceability of
requirements Tutorial: Conduct QAW, elicit, analyze, prioritize, and document
requirements using ACDM
ESTIMATION, PLANNING, AND TRACKING
Identifying and prioritizing risks – risk mitigation plans – estimation techniques –
use case points – function points – COCOMO II – top-down estimation – bottom-
III 9
up estimation – work breakdown structure – macro and micro plans – planning
poker – wideband delphi – documenting the plan – tracking the plan – earned
value method (EVM) Tutorial: Estimation, planning, and tracking exercises
CONFIGURATION AND QUALITY MANAGEMENT
identifying artifacts to be configured – naming conventions and version control –
configuration control – quality assurance techniques – peer reviews – Fegan
IV 9
inspection – unit, integration, system, and acceptance testing – test data and test
cases – bug tracking – causal analysis Tutorial: version control exercises,
development of test cases, causal analysis of defects
SOFTWARE PROCESS DEFINITION AND MANAGEMENT Process
elements – process architecture – relationship between elements – process
V modeling – process definition techniques – ETVX (entry-task-validation-exit) – 9
process baselining – process assessment and improvement – CMMI – Six Sigma
Tutorial: process measurement exercises, process definition using ETVX
Total Instructional Hours 45

Course CO1: Explain software development life cycle

Outcome CO2: Elicit functional and quality requirements
 HICET – Department of Computer Science and Engineering

CO3: Perform trade-off among conflicting requirements

CO4: Estimate the efforts required for software development
CO5: Control the artifacts during software development

REFERENCE BOOKS:
R1: Pankaj Jalote, “Software Project Management in Practice”, Pearson, 2002.
R2: Chris F. Kemerer, “Software Project Management – Readings and Cases”, McGraw Hill, 1997.
R3: Watts S. Humphrey, “PSP: A self-improvement process for software engineers”, Addison- Wesley, 2005.
R4: Watts S. Humphrey, “Introduction to the Team Software Process”, Addison-Wesley, 2000.
R5: Orit Hazzan and Yael Dubinsky, “Agile software engineering”, Springer, 2008.
R6: James R. Persse, “Process Improvement Essentials”, O’Reilly, 2006.
R7: Roger S. Pressman, “Software Engineering – A Practitioner’s Approach”, Seventh Edition, McGraw Hill,
2010.

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20CP3302 Image Processing And Analysis 3 0 0 3

1. Describe and explain basic principles of digital image

processing.
2. Design and implement algorithms that perform basic image
processing (e.g. noise removal and image enhancement).
Course 3. Design and implement algorithms for advanced imageanalysis
(e.g. image compression, image segmentation).
Objective
4. Assess the performance of image processing algorithms and
systems
5. Assess image processing algorithms in practical
applications.

Instructional
Unit Description
Hours
IMAGE PROCESSING FUNDAMENTALS
Introduction – Elements of visual perception, Steps in Image Processing Systems –
I Digital Imaging System - Image Acquisition – Sampling and Quantization – Pixel 9
Relationships – File Formats – colour images and models - Image Operations –
Arithmetic, logical, statistical and spatial operations.
IMAGE ENHANCEMENT AND RESTORATION
Image Transforms -Discrete and Fast Fourier Transform and Discrete Cosine
II Transform ,Spatial Domain - Gray level Transformations Histogram Processing 9
Spatial Filtering – Smoothing and Sharpening. Frequency Domain: Filtering in
Frequency Domain – Smoothing and Sharpening filters – Homomorphic Filtering.,
Noise models, Constrained and Unconstrained restoration models.
IMAGE SEGMENTATION AND MORPHOLOGY
Detection of Discontinuities – Edge Operators – Edge Linking and Boundary
Detection – Thresholding – Region Based Segmentation – Motion Segmentation,
III Image Morphology: Binary and Gray level morphology operations - Erosion, 9
Dilation, Opening and Closing Operations Distance Transforms- Basic
morphological Algorithms. Features – Textures - Boundary representations and
Descriptions- Component Labeling – Regional descriptors and Feature Selection
Techniques.
IMAGE ANALYSIS AND CLASSIFICATION
Image segmentation- pixel based, edge based, region based segmentation. Active
IV contour models and Level sets for medical image segmentation, Image 9
representation and analysis, Feature extraction and representation, Statistical, Shape,
Texture, feature and statistical image classification
IMAGE REGISTRATION AND VISUALIZATION
Rigid body visualization, Principal axis registration, Interactive principal axis
V registration, Feature based registration, Elastic deformation based registration, 9
Image visualization – 2D display methods, 3D display methods, virtual reality
based interactive visualization
Total Instructional Hours 45

Course CO1: Analyze general terminology of digital image processing.

Outcome CO2: Examine various types of images, intensity transformations and spatial filtering.
 HICET – Department of Computer Science and Engineering

CO3: Develop Fourier transform for image processing in frequency domain.

CO4: Evaluate the methodologies for image segmentation, restoration etc.
CO5: Implement image process and analysis algorithms.

REFERENCE BOOKS:
R1: Alasdair McAndrew, ―Introduction to Digital Image Processing with Matlab‖, Cengage Learning 2011,India

R2: Anil J Jain, ―Fundamentals of Digital Image Processing‖, PHI, 2006

R3: Kavyan Najarian and Robert Splerstor,‖ Biomedical signals and Image processing‖,CRC – Taylor and
Francis, New York, 2006
R4: Rafael C.Gonzalez and Richard E.Woods, ―Digital Image Processing‖, Third Edition, Pearson Education,
2008, New Delhi

R5: S.Sridhar, ―Digital Image Processing‖, Oxford University Press, 2011

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20CP3303 Data Mining Techniques 3 0 0 3

1. To understand data mining principles and techniques and Introduce

DM as a cutting edge business intelligence.
2. To expose the students to the concepts of data warehousing architecture
and implementation.
Course 3. To learn various Data Mining techniques such asclassification,
Objective clustering & Association rule mining
4. To study the overview of developing areas – web mining, text mining
and ethical aspects of data mining.
5. To identify business applications and trends of data mining.

Instructional
Unit Description
Hours
INTRODUCTION TO DATA WAREHOUSING
Evolution of Decision Support Systems- Data warehousing Components –
I Building a Data warehouse, Data Warehouse and DBMS, Data marts, 9
Metadata, Multidimensional data model, OLAP vs OLTP, OLAP operations,
Data cubes, Schemas for Multidimensional Database: Stars, Snowflakes and
Fact constellations
DATA WAREHOUSE PROCESS AND ARCHITECTURE
Types of OLAP servers, 3–Tier data warehouse architecture, distributed and
virtual data warehouses. Data warehouse implementation, tuning and testing
II of data warehouse. Data Staging (ETL) Design and Development, data 9
warehouse visualization, Data Warehouse Deployment, Maintenance,
Growth, Business Intelligence Overview- Data Warehousing and Business
Intelligence Trends - Business Applications- tools-SAS
INTRODUCTION TO DATA MINING
Data mining-KDD versus data mining, Stages of the Data Mining Process-
task primitives, Data Mining Techniques -Data mining knowledge
III representation – Data mining query languages, Integration of a Data Mining 9
System with a Data Warehouse – Issues, Data preprocessing – Data cleaning,
Data transformation, Feature selection, Dimensionality reduction,
Discretization and generating concept hierarchies-Mining frequent patterns-
association-correlation
CLASSIFICATION AND CLUSTERING
Decision Tree Induction - Bayesian Classification – Rule Based
Classification – Classification by Back propagation – Support Vector
Machines – Associative Classification – Lazy Learners – Other Classification
IV Methods – Clustering techniques – Partitioning methods- k-means- 9
Hierarchical Methods – distance based agglomerative and divisible clustering,
Density-Based Methods – expectation maximization -Grid Based Methods –
Model-Based Clustering Methods – Constraint – Based Cluster Analysis –
Outlier Analysis
PREDICTIVE MODELING OF BIG DATA AND TRENDS IN DATA
MINING
Statistics and Data Analysis – EDA – Small and Big Data –Logistic
V Regression Model - Ordinary Regression Model-Mining complex data objects 9
– Spatial databases – Temporal databases – Multimedia databases – Time
series and sequence data – Text mining – Web mining – Applications in Data
mining
 HICET – Department of Computer Science and Engineering

Total Instructional Hours 45

Course CO1: Evolve multidimensional intelligent model from typical system.

Outcome CO2: Discover the knowledge imbibed in the high dimensional system and gain
knowledge on dataware house process.
CO3: Acquire knowledge of data processing and data quality.
CO4: Design and deploy classification and clustering techniques.
CO5: Evaluate various mining techniques on complex data objects.

REFERENCE BOOKS:
R1: Jiawei Han, Micheline Kamber, “Data Mining: Concepts and Techniques”, Morgan Kaufmann, Third
edition, 2011.
R2: Alex Berson, Stephen J. Smith, “Data Warehousing, Data Mining & OLAP”, Tata McGraw Hill,
Tenth Reprint, 2007.
R3: G. K. Gupta, “Introduction to Data Mining with Case Studies”, Eastern Economy Edition, Prentice
Hall of India, Third Edition, 2014.
R4: Ian.H.Witten, Eibe Frank and Mark.A.Hall, “Data Mining: Practical Machine
Learning Tools and Techniques”, Morgan Kaufmann, Third edition, 2011
R5: Bruce Ratner, “Statistical and Machine - Learning Data Mining: Techniques for
Better Predictive Modeling and Analysis of Big Data”, CRC Press, Second Edition,
2012
R6: Mehmed kantardzic, “Data mining: Concepts, Models, Methods, and Algorithms”, Wiley-
Blackwell, Second Edition, 2011.
R7: Ian Witten, Eibe Frank, “Data Mining: Practical Machine Learning Tools and Techniques”,
ThirdEdition, Morgan Kaufmann, 2011.
R8: George M Marakas, “Modern Data Warehousing, Mining and Visualization: Core Concepts”,
Prentice Hall, 2002.

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20CP3304 Deep Learning Techniques 3 0 0 3

1. 1. To understand the basic ideas and principles of Neural Networks

2. To understand the basic concepts of Big Data and Statistical Data Analysis
Course 3. To familiarize the student with The Image Processing facilities like Tensorflow
and Keras
Objective
4. To appreciate the use of Deep Learning Applications
5. To understand and implement Deep Learning Architectures

Instructional
Unit Description
Hours
BASICS OF NEURAL NETWORKS
Basic concept of Neurons – Perceptron Algorithm – Feed Forward and Back
Propagation Networks.
I Suggested Activities: Discussion of role of Neural Networks, External learning – 9
Boltzmann Machine and Perceptron, Practical – Installation of Tensor Flow and
Keras.
Suggested Evaluation Methods: Tutorial – Perceptron,Assignment problems on
backpropagation networks, Quizzes on Neural Networks.

INTRODUCTION TO DEEP LEARNING

Feed Forward Neural Networks – Gradient Descent – Back Propagation Algorithm –
Vanishing Gradient problem – Mitigation – RelU Heuristics for Avoiding Bad Local
Minima – Heuristics for Faster Training – Nestors Accelerated Gradient Descent –
Regularization – Dropout.
Suggested Activities:
II 9
Discussion of role of Gradient Descent in Deep Learning, External learning –
Feature extraction and feature learning, Survey of Deep Learning Development
Frameworks,Discussion of Gradient Descent Problem.
Suggested Evaluation Methods
Tutorial – Gradient descent in deep learning, Assignment problems in optimization.
Quizzes on deep learning regularization and optimization.

CONVOLUTIONAL NEURAL NETWORKS

CNN Architectures – Convolution – Pooling Layers – Transfer Learning – Image
Classification using Transfer Learning
Suggested Activities:
III Discussion of role of Convolutional Networks in Machine Learning, External 9
learning – Concept of convolution and need for Pooling.
Suggested Evaluation Methods: Tutorial – Image classification and recurrent
nets,Assignment problems in image classification performances,Quizzes on
Convolutional Neural Networks.

MORE DEEP LEARNING ARCHITECTURES

IV LSTM, GRU, Encoder/Decoder Architectures – Autoencoders – Standard- 9
Sparse – Denoising – Contractive- Variational Autoencoders – Adversarial
 HICET – Department of Computer Science and Engineering

Generative Networks – Autoencoder and DBM

Suggested Activities: Discussion of role of Deep Learning architectures,External
learning – Compression of features using Autoencoders.
Suggested Evaluation Methods: Tutorial – LSTM and Autoencoders,Assignment
problems in deep generative models, Deep Belief Networks,Quizzes on deep
learning architectures.
APPLICATIONS OF DEEP LEARNING
Image Segmentation – Object Detection – Automatic Image Captioning – Image
generation with Generative Adversarial Networks – Video to Text with LSTM
Models – Attention Models for Computer Vision – Case Study: Named Entity
Recognition – Opinion Mining using Recurrent Neural Networks – Parsing and
Sentiment Analysis using Recursive Neural Networks – Sentence Classification
using Convolutional Neural Networks – Dialogue Generation with LSTMs.
V 9
Suggested Activities:
Discussion of role of Deep Learning in Image and NLP applications,External
learning – NLP concepts.
Suggested Evaluation Methods:
Tutorial – Image segmentation,Assignment problems in parsing and sentiment
analysis,Quizzes on deep learning architectures.

Total Instructional Hours 45

Course CO1: Understand the role of Deep learning in Machine Learning Applications.
Outcome CO2: To get familiar with the use of TensorFlow/Keras in Deep Learning Applications.
CO3: To design and implement Deep Learning Applications.
CO4: Critically Analyse Different Deep Learning Models in Image Related Projects.
CO5: To design and implement Convolutional Neural Networks, To know about
applications of Deep Learning in NLP and Image Processing.

REFERENCE BOOKS:
R1: Ian Good Fellow, Yoshua Bengio, Aaron Courville, “Deep Learning”, MIT Press, 2017.
R2: Francois Chollet, “Deep Learning with Python”, Manning Publications, 2018.
R3: Phil Kim, “Matlab Deep Learning: With Machine Learning, Neural Networks and Artificial
Intelligence”, Apress , 2017.
R4: Ragav Venkatesan, Baoxin Li, “Convolutional Neural Networks in Visual Computing”, CRC Press,
2018.
R5: Navin Kumar Manaswi, “Deep Learning with Applications Using Python”, Apress,
2018
R6: Joshua F. Wiley, “R Deep Learning Essentials”, Packt Publications, 2016.

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20CP3305 Soft Computing Techniques 3 0 0 3

1. To learn the key aspects of Soft computing and Neural networks.

2. To study the fuzzy logic components.
Course 3. To gain insight onto neuro fuzzy modeling and control.
Objective 4. To know about the components and building block hypothesis of genetic
algorithm.
5. To gain knowledge in machine learning through neural networks
Instructional
Unit Description
Hours
INTRODUCTION TO SOFT COMPUTING
I Evolution of Computing – Soft Computing Constituents – From Conventional AI to 9
Computational Intelligence – Machine Learning Basics
GENETIC ALGORITHMS
II Introduction to Genetic Algorithms (GA) – Applications of GA – Building 9
Block Hypothesis- Representation– Fitness Measures – Genetic Operators-.
GA based Machine Learning
NEURAL NETWORKS
Machine Learning using Neural Network, Adaptive Networks – Feed
III Forward Networks – Supervised Learning Neural Networks – Radial Basis 9
Function Networks – Reinforcement Learning – Unsupervised Learning
Neural Networks – Adaptive Resonance Architectures – Advances in Neural
Networks
FUZZY LOGIC
IV Fuzzy Sets – Operations on Fuzzy Sets – Fuzzy Relations – Membership 9
Functions-Fuzzy Rules and Fuzzy Reasoning – Fuzzy Inference Systems –
Fuzzy Expert Systems – Fuzzy Decision Making.
NEURO-FUZZY MODELING
V Adaptive Neuro-Fuzzy Inference Systems – Coactive Neuro-Fuzzy Modeling 9
– Classification and Regression Trees – Data Clustering Algorithms – Rule
based Structure Identification – Neuro- Fuzzy Control – Case Studies.
Total Instructional Hours 45

Course CO1: Differentiate Conventional AI and Computational Intelligence.

Outcome CO2: Discuss on machine learning through neural networks.
CO3: Apply knowledge in developing a Fuzzy expert system.
CO4: Model Neuro Fuzzy system for clustering and classification.
CO5: Discover knowledge to develop Genetic Algorithm and Support vector machine
based machine learning system

REFERENCE BOOKS:
R1: Jyh-Shing Roger Jang, Chuen-Tsai Sun, EijiMizutani, “Neuro-Fuzzy and Soft Computing”, Prentice-
Hall of India, 2002.
R2: KwangH.Lee, “First course on Fuzzy Theory and Applications”, Springer, 2005.
R3: George J. Klir and Bo Yuan, “Fuzzy Sets and Fuzzy Logic-Theory and Applications”, Prentice Hall,
1996.
 HICET – Department of Computer Science and Engineering

R4: James A. Freeman and David M. Skapura, “Neural Networks Algorithms, Applications, and
Programming Techniques”, Addison Wesley, 2003.
R5: David E.Goldberg, “Genetic Algorithms in Search, Optimization and Machine Learning”, Addison
Wesley, 1989.
R6: Mitchell Melanie, “An Introduction to Genetic Algorithm”, MIT Press, 1996
R7: S.N.Sivanandam, S.N.Deepa, “Introduction to Genetic Algorithms”, Springer, 2008
edition

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20CP3306 Linguistic Computing 3 0 0 3

1. To learn the fundamentals of natural language processing

Course 2. To appreciate the use of CFG and PCFG in NLP
3.To understand the role of semantics and pragmatics
Objective 4.To Understanding semantics and pragmatics of English language for processing
5.To Writing programs in Python to carry out natural Language processing
Instructional
Unit Description
Hours
INTRODUCTION
I Words - Regular Expressions and Automata - Words and Transducers - N-grams - 9
Part-ofSpeech – Tagging - Hidden Markov and Maximum Entropy Models.
SPEECH
II Speech – Phonetics - Speech Synthesis - Automatic Speech Recognition – Speech 9
Recognition: - Advanced Topics - Computational Phonology
SYNTAX
III Formal Grammars of English - Syntactic Parsing - Statistical Parsing - Features 9
and Unification - Language and Complexity.
SEMANTICS AND PRAGMATICS
IV The Representation of Meaning - Computational Semantics - Lexical 9
Semantics - Computational Lexical Semantics - Computational Discourse
APPLICATIONS
V Information Extraction - Question Answering and Summarization - Dialogue 9
and Conversational Agents - Machine Translation
Total Instructional Hours 45

Course CO1: To tag a given text with basic Language features

Outcome CO2: To design an innovative application using NLP components
CO3: To implement a rule based system to tackle morphology/syntax of a language
CO4: To design a tag set to be used for statistical processing for real-time applications
CO5: To compare and contrast use of different statistical approaches for different types
of NLP applications
TEXT BOOKS:

T1: Daniel Jurafsky, ―Speech and Language Processing: An Introduction to Natural Language
Processing, Computational Linguistics and Speech‖, Pearson Publication, 2014.
T2: Steven Bird, Ewan Klein and Edward Loper, ―Natural Language Processing with Python‖, First
Edition, O‘Reilly Media, 2009

REFERENCE BOOKS:
R1: Breck Baldwin, ―Language Processing with Java and LingPipe Cookbook‖, Atlantic Publisher, 2015.
R2: Richard M Reese, ―Natural Language Processing with Java‖, O‘Reilly Media, 2015.
R3: Nitin Indurkhya and Fred J. Damerau, ―Handbook of Natural Language Processing‖,
Second Edition, Chapman and Hall/CRC Press, 2010
 HICET – Department of Computer Science and Engineering

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20CP3307 Advanced Cryptography Techniques 3 0 0 3

1.To understand the mathematical foundations of security principles.

2.To appreciate the different aspects of encryption techniques.
Course 3. To understand various attacks present over encryption and authentications
techniques.
Objective
4. To understand the role played by authentication insecurity.
5.To appreciate the current trends of security practices.

Instructional
Unit Description
Hours
CLASSICAL ENCRYPTION AND BLOCKCIPHERS
Classical Encryption – Substitution Cipher – One-time-pad Encryption – Block
I 9
Ciphers – DES – Key Recovery Attacks on Block Ciphers – Iterated-DES and
DESX – AES – Limitations of Key- recovery based Security
PSEUDO RANDOM FUNCTIONS AND SYMMETRIC ENCRYPTION
Random Functions – Permutations – Pseudo Functions – Pseudo-random
II Permutations – Modelling Blockciphers – Security Against Key Recovery – 9
The Birthday Attack – Symmetric Encryption Schemes – Chosen Plaintext
Attacks – Semantic Security – Security of CTR and CBC-Chosen Ciphertext
Attack.
HASH FUNCTIONS AND MESSAGE AUTHENTICATION
Hash Function SHA1 – Collision resistant Hash Functions – Collision
III Finding Attacks – Onewayness of Collision resistant Hash Functions – MD 9
Transform – Syntax for message Authentication – PRF as a MAC Paradigm –
CBC MAC – Universal-hashing Approach – Authenticated Encryption.
NUMBER THEORY AND ASYMMETRIC ENCRYPTION
Computational Number Theory – Number Theoretic Primitives – Diffie Hellman
IV 9
Problem – Asymmetric Encryption Schemes – Hybrid Encryption – ElGamal
Scheme and its Variants – Homomorphic Encryption – Digital Signatures
SECURITY PRACTICES AND ADVANCED TOPICS
Electronic Mail Security – IP Security – Digital Cash – Schnorr’s
V Identification Protocol and Signature – Blind Signature – Distributed Ledger 9
and Bitcoin –– Secret Sharing – Shamir Threshold Scheme – Security in
Routing – Mixnet
Total Instructional Hours 45

Course CO1: Demonstrate the various classical encryption techniques and the adversary
Outcome capabilities.
CO2: Apply computational secrecy and semantic security to find out the probability of
how strong are the security schemes.
CO3: Illustrate the various MAC and HASH functions and apply the Birthday attack
over Hash.
CO4: Apply number theory in public key encryption techniques.
CO5: Analyze the application of cryptography for secure E-Commerce and other secret
transactions.
 HICET – Department of Computer Science and Engineering

REFERENCE BOOKS:
R1: MihirBellare and Phillip Rogaway, “Introduction to Modern Cryptography”, 2005.
R2: Jonathan Katz and Yehuda Lindell, “Introduction to Modern Cryptography ”,Chapman and
Hall/CRC Press Second Edition,2015.
R3: Hans Delfts and Helmut Knebl, “Introduction to Cryptography – Principles and
Applications”, Springer, Third Edition by,2015.

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20CP3401 Data Science for Engineers 3 0 0 3

1. Introduce R as a programming language

2. Introduce the mathematical foundations required for data science
Course 3. Introduce the first level data science algorithms
Objective 4. Introduce a data analytics problem solving framework
5. Introduce a practical capstone case study

Instructional
Unit Description
Hours
INTRODUCTION TO R
Introduction to R– Variables and Data types in R-Data Frames-Recasting and
I joining of data frames-Arithmetic, Logical and Matrix operations in R-advanced 9
programming in R:Functions-Control structures-Data visualization in R basic
graphics.
LINEAR ALGEBRA AND STATISTICS
Solving Linear Equations-Linear Algebra-Distances ,Hyper planes and Half space,
II 9
Eigen values, Eigen vectors-Statistical Modeling-Random variables and probability
Mass/Density functions-Sample Statistics-hypotheses Testing
OPTIMIZATION
Optimization for Data science-Unconstrained Multivariate Optimization-Gradient
III Descent (Learning Rule)- Multivariate Optimization with Equality constraints- 9
Multivariate Optimization with Inequality constraints-Introduction to Data science-
Solving Data Analysis problems –A Guided Thought process-
REGRESSION
Module: Predictive Modeling-Linear Regression-Model Assessment-Diagnostics to
IV Improve linear model Fit-Simple Linear Regression Model building- Simple Linear 9
Regression Model Assessment -Multiple Linear Regression- assessing importance of
different variables-subset selection
CLASSIFICATION AND CLUSTERING
Cross Validation- Multiple Linear Regression modeling Building and selection-
V Classification- Logistic Regression –Performance Measures- Logistic Regression 9
implementation in R- K-Nearest Neighbors- K-Nearest Neighbors implementation in
R-K-means Clustering-K-Means implementation in R
Total Instructional Hours 45

Course CO1: Describe a flow process for data science problems

Outcome CO2: Classify data science problems into standard typology
CO3: Develop R codes for data science solutions
CO4: Correlate results to the solution approach followed
CO5: Assess the solution approach
 HICET – Department of Computer Science and Engineering

REFERENCE BOOKS:
R1: Https://Nptel.Ac.In/Courses/106/106/106106179/
R2: Introduction To Linear Algebra - By Gilbert Strang.
R3: Applied Statistics And Probability For Engineers – By Douglas Montgomery

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20CP3402 Cyber Security 3 0 0 3

OBJECTIVES:
1. Students should be able to understand.
2. The difference between threat, risk, attack and vulnerability.
3. How threats materialize into attacks.
4. Where to find information about threats, vulnerabilities and attacks.
5. Typical threats, attacks and exploits and the motivations behind them.

UNIT I INTRODUCTION TO CYBER SECURITY

9
Introduction -Computer Security - Threats -Harm - Vulnerabilities - Controls -
Authentication - Access Control and Cryptography - Web—User Side - Browser
Attacks - Web Attacks Targeting Users - Obtaining User or Website Data - Email
Attacks.

UNIT II SECURITY IN OPERATING SYSTEM & NETWORKS

9
Security in Operating Systems - Security in the Design of Operating Systems -
Rootkit - Network security attack- Threats to Network Communications - Wireless
Network Security - Denial of Service - Distributed Denial-of-Service.

UNIT III DEFENCES: SECURITY COUNTERMEASURES

9
Cryptography in Network Security - Firewalls - Intrusion Detection and Prevention
Systems - Network Management - Databases - Security Requirements of Databases
- Reliability and Integrity - Database Disclosure - Data Mining and Big Data.

UNIT IV PRIVACY IN CYBERSPACE

9
Privacy Concepts -Privacy Principles and Policies -Authentication and Privacy -
Data Mining -Privacy on the Web - Email Security - Privacy Impacts of Emerging
Technologies - Where the Field Is Headed.

UNIT V MANAGEMENT AND INCIDENTS

9
Security Planning - Business Continuity Planning - Handling Incidents - Risk
Analysis - Dealing with Disaster - Emerging Technologies - The Internet of Things
- Economics - Electronic Voting - Cyber Warfare- Cyberspace and the Law -
International Laws - Cyber crime - Cyber Warfare and Home Land Security.

TOTAL : 45 PERIODS
 HICET – Department of Computer Science and Engineering

OUTCOMES:
1. Analytical skills
2. Group / team working
3. Innovation / creativity
4. Problem solving skills
5. Research

REFERENCES:
1. Charles P. Pfleeger Shari Lawrence Pfleeger Jonathan Margulies, Security in
Computing, 5th Edition , Pearson Education , 2015.
2. George K.Kostopoulous, Cyber Space and Cyber Security, CRC Press, 2013.
3. Martti Lehto, Pekka Neittaanmäki, Cyber Security: Analytics, Technology and
Automation edited, Springer International Publishing Switzerland 2015
4. Nelson Phillips and Enfinger Steuart, ―Computer Forensics and Investigations‖,
Cengage Learning, New Delhi, 2009

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20AC1091 English For Research Paper Writing 2 0 0 0

1. Teach how to improve writing skills and level of readability

2.Tell about what to write in each section
Course 3.Summarize the skills needed when writing a Title
Objective 4.Infer the skills needed when writing the Conclusion
5.Ensure the quality of paper at very first-time submission

Instructional
Unit Description
Hours
INTRODUCTION TO RESEARCH PAPER WRITING
Planning and Preparation, Word Order, Breaking up long sentences, Structuring
I 06
Paragraphs and Sentences, Being Concise and Removing Redundancy, Avoiding
Ambiguity and Vagueness
PRESENTATION SKILLS
II Clarifying Who Did What, Highlighting Your Findings, Hedging and Criticizing, 06
Paraphrasing and Plagiarism, Sections of a Paper, Abstracts, Introduction
TITLE WRITING SKILLS
Key skills are needed when writing a Title, key skills are needed when
III writing an Abstract, key skills are needed when writing an Introduction, skills 06
needed when writing a Review of the Literature, Methods, Results,
Discussion, Conclusions, The Final Check
RESULT WRITING SKILLS
IV Skills are needed when writing the Methods, skills needed when writing the 06
Results, skills are needed when writing the Discussion, skills are needed when
writing the Conclusions
VERIFICATION SKILLS
V Useful phrases, checking Plagiarism, how to ensure paper is as good as it 06
could possibly be the first- time submission
Total Instructional Hours 30

Course CO1: Understand that how to improve your writing skills and level of readability
Outcome CO2: Learn about what to write in each section
CO3: Understand the skills needed when writing a Title
CO4: Understand the skills needed when writing the Conclusion
CO5: Ensure the good quality of paper at very first-time submission

REFERENCE BOOKS:
R1: Adrian Wallwork , English for Writing Research Papers, Springer New York Dordrecht Heidelberg
London, 2011
R2: Day R How to Write and Publish a Scientific Paper, Cambridge University Press 2006
R3: Goldbort R Writing for Science, Yale University Press (available on Google Books) 2006
R4: Highman N, Handbook of Writing for the Mathematical Sciences, SIAM. Highman’s
book 1998.
 HICET – Department of Computer Science and Engineering

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20AC1092 Disaster Management 2 0 0 0

1. Summarize basics of disaster

2. Explain a critical understanding of key concepts in disaster risk reduction
and humanitarian response.
Course 3.Illustrate disaster risk reduction and humanitarian response policy and
Objective practice from multiple perspectives.
4. Describe an understanding of standards of humanitarian response and
practical relevance in specific types of disasters and conflict situations.
5.Develop the strengths and weaknesses of disaster management approaches
Instructional
Unit Description
Hours
INTRODUCTION
Disaster: Definition, Factors and Significance; Difference between Hazard
I 06
And Disaster; Natural and Manmade Disasters: Difference, Nature, Types
and Magnitude.
REPERCUSSIONS OF DISASTERS AND HAZARDS
Economic Damage, Loss of Human and Animal Life, Destruction Of
II Ecosystem. Natural Disasters: Earthquakes, Volcanisms, Cyclones, Tsunamis, 06
Floods, Droughts And Famines, Landslides And Avalanches, Man-made
disaster: Nuclear Reactor Meltdown, Industrial Accidents, Oil Slicks And
Spills, Outbreaks Of Disease And Epidemics, War And Conflicts.
DISASTER PRONE AREAS IN INDIA
Study of Seismic Zones; Areas Prone To Floods and Droughts, Landslides
III 06
And Avalanches; Areas Prone To Cyclonic and Coastal Hazards with Special
Reference To Tsunami; Post-Disaster Diseases and Epidemics
DISASTER PREPAREDNESS AND MANAGEMENT
Preparedness: Monitoring Of Phenomena Triggering a Disaster or Hazard;
IV Evaluation of Risk: Application of Remote Sensing, Data from 06
Meteorological And Other Agencies, Media Reports: Governmental and
Community Preparedness.
RISK ASSESSMENT
Disaster Risk: Concept and Elements, Disaster Risk Reduction, Global and
V National Disaster Risk Situation. Techniques of Risk Assessment, Global Co- 06
Operation in Risk Assessment and Warning, People’s Participation in Risk
Assessment. Strategies for Survival
Total Instructional Hours 30

Course CO1: Ability to summarize basics of disaster

Outcome CO2: Ability to explain a critical understanding of key concepts in disaster risk reduction and
humanitarian response
CO3: Ability to illustrate disaster risk reduction and humanitarian response policy and practice
from multiple perspectives.
CO4: Ability to describe an understanding of standards of humanitarian response and practical
relevance in specific types of disasters and conflict situations
CO5: Ability to develop the strengths and weaknesses of disaster management approaches
 HICET – Department of Computer Science and Engineering

REFERENCE BOOKS:
R1: Goel S. L., Disaster Administration And Management Text And Case Studies”,Deep & Deep
Publication Pvt. Ltd., New Delhi,2009.
R2: NishithaRai, Singh AK, “Disaster Management in India: Perspectives, issues and strategies
“’NewRoyal book Company,2007.
R3: Sahni, PardeepEt.Al. ,” Disaster Mitigation Experiences And Reflections”, Prentice Hall OfIndia,
New Delhi,2001.

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20AC1093 Sanskrit for Technical Knowledge 2 0 0 0

1. Illustrate the basic sanskrit language.

2. Recognize sanskrit, the scientific language in the world.
Course 3.Appraise learning of sanskrit to improve brain functioning.
4.Relate sanskrit to develop the logic in mathematics, science & other
Objective
subjects enhancing the memory power.
5.Extract huge knowledge from ancient literature.

Instructional
Unit Description
Hours
ALPHABETS
I 06
Alphabets in Sanskrit
II TENSES AND SENTENCES 06
Past/Present/Future Tense - Simple Sentences
ORDER AND ROOTS
III 06
Order - Introduction of roots
IV SANSKRIT LITERATURE 06
Technical information about Sanskrit Literature
TECHNICAL CONCEPTS OF ENGINEERING
V Technical concepts of Engineering-Electrical, Mechanical, Architecture, 06
Mathematics
Total Instructional Hours 30

Course CO1: Understanding basic Sanskrit language

Outcome CO2: Write sentences.
CO3: Know the order and roots of Sanskrit.
CO4: Know about technical information about Sanskrit literature.
CO5: Understand the technical concepts of Engineering.

REFERENCE BOOKS:
R1: “Abhyaspustakam” – Dr. Vishwas, Samskrita-Bharti Publication, New Delhi

R2: “Teach Yourself Sanskrit” Prathama Deeksha-Vempati Kutumbshastri, Rashtriya Sanskrit

Sansthanam, New Delhi Publication
R3: “India’s Glorious Scientific Tradition” Suresh Soni, Ocean books (P) Ltd., New Delhi, 2017.

`
BOS-Chairman Dean-Academics PRINCIPAL
 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20AC1094 Pedagogy Studies 2 0 0 0

1. Review existing evidence on there view topic to inform programme design and
policy
Course 2. Making under taken by the DfID, other agencies and researchers.
Objective 3.Identify critical evidence gaps to guide the development.
4. Identify their Professional Development.
5. Improve the Research and Future Direction.
Instructional
Unit Description
Hours
INTRODUCTION AND METHODOLOGY
Aims and rationale, Policy background, Conceptual framework and
I terminology - Theories of learning, Curriculum, Teacher education - 06
Conceptual framework, Research questions - Overview of methodology and
Searching.
THEMATIC OVERVIEW
II Pedagogical practices are being used by teachers in formal and informal 06
classrooms in developing countries - Curriculum, Teacher education.
EVIDENCE ON THE EFFECTIVENESS OF PEDAGOGICAL PRACTICES
Methodology for the in depth stage: quality assessment of included studies -
How can teacher education (curriculum and practicum) and the school
III curriculum and guidance materials best support effective pedagogy? - Theory 06
of change - Strength and nature of the body of evidence for effective
pedagogical practices - Pedagogic theory and pedagogical approaches -
Teachers’ attitudes and beliefs and Pedagogic strategies.
PROFESSIONAL DEVELOPMENT
Professional development: alignment with classroom practices and follow up
IV support - Peer support - Support from the head teacher and the community - 06
Curriculum and assessment - Barriers to learning: limited resources and large
class sizes
RESEARCH GAPS AND FUTURE DIRECTIONS
V Research design – Contexts – Pedagogy - Teacher education - Curriculum and 06
assessment - Dissemination and research impact.
Total Instructional Hours 30

Course CO1: What pedagogical practices are being used by teachers informal and informal
Outcome classrooms in developing countries?
CO2: What is the evidence on the effectiveness of these pedagogical practices, in what
conditions, and with what population of learners?
CO3: How can teacher education (curriculum and practicum) and the school curriculum
and guidance materials best support effective pedagogy?
CO4: How can teacher to develop their Professional development support effective pedagogy?
CO5: How can improve the Research and Future Direction using effective pedagogy.
 HICET – Department of Computer Science and Engineering

REFERENCE BOOKS:
R1: Ackers J, HardmanF (2001) Classroom interaction in Kenyan primary schools, Compare, 31(2): 245-
261.
R2: Agrawal M (2004)Curricular reform in schools: The importance of evaluation, Journal of Curriculum
Studies, 36(3):361-379.
R3: Akyeampong K (2003) Teacher training in Ghana-does it count? Multi-site teacher education research
project (MUSTER) country report 1.London:DFID
R4: Akyeampong K, Lussier K, Pryor J, Westbrook J (2013) Improving teaching and learning of basic
maths and reading in Africa: Does teacher preparation count? International Journal Educational
Development, 33(3): 272–282.
R5: Alexander RJ(2001) Culture and pedagogy: International comparisons in primary education. Oxford
and Boston: Blackwell.
R6: Chavan M(2003) Read India: Amass scale, rapid, ‘learning to read’ campaign.

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20AC1095 Constitution of India 2 0 0 0

1. Understand the premises informing the twin themes of liberty andfreedom

from a civil rights perspective.
2. To address the growth of Indian opinion regarding modern Indianintellectuals’
constitutional
Course 3. Role and entitlement to civil and economic rights as well as the emergence
Objective nation hood in the early years of Indian nationalism.
4. To address the role of socialism in India after the commencement of the Bolshevik
Revolutionin1917and its impact on the initial drafting of the Indian Constitution
5. To understand the central and state relation, financial and administrative.

Instructional
Unit Description
Hours
HISTORY OF MAKING OF THE INDIAN CONSTITUTION &
I PHILOSOPHY OF THE INDIAN CONSTITUTION 06
History, Drafting Committee, (Composition & Working), Preamble, Salient Features
CONTOURS OF CONSTITUTIONAL RIGHTS AND DUTIES
Fundamental Rights, Right to Equality, Right to Freedom, Right against
II Exploitation, Right to Freedom of Religion, Cultural and Educational Rights, Right 06
to Constitutional Remedies, Directive Principles of State Policy, Fundamental
Duties.
ORGANS OF GOVERNANCE
III Parliament, Composition, Qualifications and Disqualifications, Powers and 06
Functions, Executive, President, Governor, Council of Ministers, Judiciary,
Appointment and Transfer of Judges, Qualifications, Powers and Functions
LOCAL ADMINISTRATION
District’s Administration head: Role and Importance Municipalities:
Introduction, Mayor and role of Elected Representative, CEO, Municipal
IV Corporation. Pachayati raj: Introduction, PRI: Zila Pachayat. Elected officials 06
and their roles, CEO Zila Pachayat: Position and role. Block level:
Organizational Hierarchy(Different departments), Village level:Role of
Elected and Appointed officials, Importance of grass root democracy
ELECTION COMMISSION
V Election Commission: Role and Functioning. Chief Election Commissioner 06
and Election Commissioners - Institute and Bodies for the welfare of
SC/ST/OBC and women.
Total Instructional Hours 30

Course CO1: Discuss the growth of the demand for civil rights in India for the bulk of Indians
Outcome before the arrival of Gandhi in Indian politics.
CO2: Discuss the intellectual origins of the framework of argument that informed the
conceptualization of social reforms leading to revolution in India.
CO3: Discuss the circumstances surrounding the foundation of the Congress Socialist
Party[CSP] under the leadership of Jawaharlal Nehru
CO4: The eventual failure of the proposal of direct elections through adult suffrage in the Indian
Constitution.
CO5: Discuss the passage of the Hindu Code Bill of 1956.
 HICET – Department of Computer Science and Engineering

REFERENCE BOOKS:
R1: The Constitution of India,1950(Bare Act),Government Publication.
R2: Dr.S.N.Busi, Dr.B. R.Ambedkar framing of Indian Constitution,1st Edition, 2015.
R3:
M.P. Jain, Indian Constitution Law, 7th Edn., Lexis Nexis,2014.
R4: D.D. Basu, Introduction to the Constitution of India, Lexis Nexis, 2015.

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20AC2091 Value Education 2 0 0 0

1. Understand value of education and self-development

Course 2.Imbibe good values in students
3. Let the should know about the importance of character
Objective
4. To teach and inculcate the importance of value basedliving.
5. To give students a deeper understanding about the purpose of life.
Instructional
Unit Description
Hours
VALUES AND SELF-DEVELOPMENT
I Values and self-development–Social values and individual attitudes. Work ethics, 7
Indian vision of humanism. Moral and non-moral valuation. Standards and
principles. Value judgements
IMPORTANCE OF CULTIVATION OF VALUES
Importance of cultivation of values. Sense of duty. Devotion, Self-reliance.
II 7
Confidence, Concentration. Truthfulness, Cleanliness. Honesty, Humanity.
Power of faith, National Unity. Patriotism. Love for nature, Discipline
PERSONALITY AND BEHAVIOR DEVELOPMENT
Personality and Behavior Development-Soul and Scientific attitude. Positive
Thinking. Integrity and discipline. Punctuality, Love and Kindness. Avoid
III fault Thinking. Free from anger, Dignity of labour. Universal brother hood 8
and religious tolerance. True friendship. Happiness Vs suffering, love for
truth. Aware of self-destructive habits. Association and Cooperation. Doing
best for saving nature
CHARACTER AND COMPETENCE
Character and Competence–Holy books vs Blind faith. Self-management and
IV Good health. Science of reincarnation. Equality, Nonviolence, Humility, Role 8
of Women. All religions and same message. Mind your Mind, Self-control.
Honesty, Studying effectively.

Total Instructional Hours 30

Course CO1: Students will understand the importance of value based living.
Outcome CO2: Students will gain deeper understanding about the purpose of their life.
CO3: Students will understand and start applying the essential steps to become good leaders.
CO4: Students will emerge as responsible citizens with clear conviction to practice values and
ethics in life.
CO5: Students will become value based professionals and building a healthy nation
 HICET – Department of Computer Science and Engineering

REFERENCE BOOKS:
R1: Chakroborty, S.K.“Values and Ethics for organizations Theory and practice”, Oxford University
Press, New Delhi

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20AC2092 Stress Management By Yoga 2 0 0 0

1. To achieve overall health of body and mind

Course 2.To overcome stress
3. To possess emotional stability.
Objective

Instructional
Unit Description
Hours
INTRODUCTION TO YOGA
I 10
Definitions of Eight parts of yoga.(Ashtanga)
DO`S AND DON’T’S IN LIFE
Yam and Niyam - Do`s and Don’t’s in life - i) Ahinsa, satya, astheya,
II 10
bramhacharya and aparigraha, ii) Ahinsa, satya, astheya, bramhacharya and
aparigraha.
ASAN AND PRANAYAM
III Asan and Pranayam - Various yog poses and their benefits for mind & body 10
- Regularization of breathing techniques and its effects-Types of pranayam

Total Instructional Hours 30

Course CO1: Develop healthy mind in a healthy body thus improving social health also
Outcome CO2: Improve efficiency
CO3: The student will apply forces and exert themselves using rarely used muscle groups

REFERENCE BOOKS:
R1: Yogic Asanas for Group Tarining-Part-I”:Janardan Swami Yoga bhyasi Mandal
R2: “Rajayoga or conquering the Internal Nature” by Swami Vivekananda, Advaita Ashrama
(Publication Department), Kolkata

BOS-Chairman Dean-Academics PRINCIPAL

 HICET – Department of Computer Science and Engineering

Programme Course Code Name of the Course L T P C

ME 20AC2093 Personality Development Through Life 2 0 0 0
Enlightenment Skills

1. To learn to achieve the highest goal happily

11 2. To become a person with stable mind, pleasing personality and determination
3.To awaken wisdom in students

Instructional
Unit Description
Hours
NEETISATAKAM-HOLISTIC DEVELOPMENT
Neetisatakam-holistic development of personality - Verses- 19,20,21,22
I 10
(wisdom) - Verses- 29,31,32 (pride & heroism) – Verses- 26,28,63,65 (virtue)
- Verses- 52,53,59 (dont’s) - Verses- 71,73,75,78 (do’s)
DAY TO DAY WORK AND DUTIES
Approach to day to day work and duties - Shrimad Bhagwad Geeta: Chapter 2-
II 10
Verses 41, 47,48 - Chapter 3-Verses 13, 21, 27, 35 Chapter 6-Verses 5,13,17,23, 35
- Chapter 18-Verses 45, 46, 48.
STATEMENTS OF BASIC KNOWLEDGE
Statements of basic knowledge - Shrimad Bhagwad Geeta: Chapter2-Verses
III 56, 62, 68 Chapter 12 -Verses 13, 14, 15, 16,17, 18 - Personality of role 10
model - shrimad bhagwad geeta - Chapter2-Verses 17, Chapter 3-Verses
36,37,42 -Chapter 4-Verses 18, 38,39 Chapter18 – Verses 37,38,63

Total Instructional Hours 30

Course CO1: Study of Shrimad-Bhagwad-Geeta will help the student in developing his personality and
Outcome achieve the highest goal in life
CO2: The person who has studied Geeta will lead the nation and mankind to peace and
prosperity
CO3: Study of Neet is hatakam will help in developing versatile personality of students.

REFERENCE BOOKS:
R1: Gopinath, Rashtriya Sanskrit Sansthanam P, Bhartrihari’s Three Satakam, Niti-sringar-vairagya,
New Delhi,2010
R2: Swami Swarupananda , Srimad Bhagavad Gita, Advaita Ashram, Publication Department, Kolkata,
2016.

BOS-Chairman Dean-Academics PRINCIPAL