Walchand College of Engineering, Sangli

(Government Aided Autonomous Institute)

AY 2022-23
Course Information
Programme B.Tech. (Computer Science and Engineering)
Class, Semester Final Year B. Tech., Sem VII
Course Code 5CS401
Course Name Cryptography and Network Security
Desired Requisites: Computer Networks

Teaching Scheme Examination Scheme (Marks)

Lecture 3 Hrs/week MSE ISE ESE Total
Tutorial - 30 20 50 100
Credits: 3

Course Objectives
1 Understand OSI security architecture and classical encryption techniques.
2 Acquire fundamental knowledge on the concepts of finite fields and number theory.
3 Understand various block cipher and stream cipher models.
4 Describe the principles of public key cryptosystems, hash functions and digital signature.
Course Outcomes (CO) with Bloom’s Taxonomy Level
At the end of the course, the students will be able to,
Bloom’s Bloom’s
CO Course Outcome Statement/s Taxonomy Taxonomy
Level Description
CO1 Apply the number theory concepts to different encryption and Apply
decryption techniques to solve problems related to confidentiality III
and authentication.
CO2 Analyze security of network protocols and systems IV Analyze
CO3 Justify various methods of authentication and access control for Evaluate
application of technologies to various sections of industry and V
society.
CO4 Identify and classify security threats and develop a security model Create
VI
to prevent, detect and recover from attack

Module Module Contents Hours

INTRODUCTION
Security trends – Legal, Ethical and Professional Aspects of Security, Need for
Security at Multiple levels, Security Policies – Model of network security –
I Security attacks, services and mechanisms – OSI security architecture – 8
Classical encryption techniques: substitution techniques, transposition
techniques, steganography- Foundations of modern cryptography: perfect
security – information theory – product cryptosystem – cryptanalysis
SYMMETRIC KEY CRYPTOGRAPHY
MATHEMATICS OF SYMMETRIC KEY CRYPTOGRAPHY: Algebraic
structures – Modular arithmetic-Euclid‟s algorithm- Congruence and matrices
II SYMMETRIC KEY CIPHERS: Block cipher Principles of DES – Strength of 6
DES – Differential and linear cryptanalysis – Block cipher design principles –
Block cipher mode of operation – Evaluation criteria for AES – Advanced
Encryption Standard – RC4

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 PUBLIC KEY CRYPTOGRAPHY
MATHEMATICS OF ASYMMETRIC KEY CRYPTOGRAPHY: Primes –
Primality Testing –Factorization – Euler‘s totient function, Fermat‘s and
III Euler‘s Theorem – Chinese Remainder Theorem – Exponentiation and 6
logarithm – ASYMMETRIC KEY CIPHERS: RSA cryptosystem – Key
distribution – Key management – Diffie Hellman key exchange -ElGamal
cryptosystem –Elliptic curve cryptography.
MESSAGE AUTHENTICATION AND INTEGRITY
Properties of hash functions, MD2, MD5 and SHA-1, keyed hash functions,
IV attacks on hash functions, Identity and Access Management (IAM), Digital 6
signature– Entity Authentication: Passwords, challenge-response algorithms,
zero-knowledge protocols, Authentication applications – Kerberos, X.509.
NETWORK SECURITY
Network security basics: TCP/IP vulnerabilities, Packet Sniffing, ARP
V spoofing, port scanning, IP spoofing, TCP syn flood, DNS Spoofing, Denial of 7
Service, Internet Security Protocols: SSL/TLS, IPSEC, Email Security:
PGP,S/MIME.
SYSTEM SECURITY
Intruders, IDS, Firewalls, Honey Pots, Software Vulnerabilities, Malicious
VI
software – Viruses, Worms, Trojans, Logic Bomb, Bots, Rootkits, Wireless 7
Security, Blockchain Cryptocurrencies and the Dark Web.

Textbooks
William Stallings, “Cryptography and Network Security: Principles and Practice”, Prentice
1
Hall of India.
Behrouz A. Forouzan “Cryptography And Network Security”. Tata Mcgraw-Hill, New Delhi
2
India.

References
1 “Applied Cryptography, Protocols Algorithms and Source Code in C”, Bruce Schneier, Wiley.
2 “Cryptography and Network Security”, Atul Kahate, Tata Mc Graw Hill.
Alfred J. Menezes, Paul C. van Oorschot and Scott A. Vanstone, “Handbook of Applied
3
Cryptography”, CRC Press.
4 Johannes A. Buchmann, “Introduction to Cryptography”, Springer.

Useful Links
1

CO-PO Mapping
Programme Outcomes (PO) PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 3 2 2
CO2 3 2 3 2
CO3 3 3 3 3
CO4 3 2 3 1
The strength of mapping is to be written as 1: Low, 2: Medium, 3: High
Each CO of the course must map to at least one PO.

Assessment

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 The assessment is based on MSE, ISE and ESE.
MSE shall be typically on modules 1 to 3.
ISE shall be taken throughout the semester in the form of teacher’s assessment. Mode of assessment can
be field visit, assignments etc. and is expected to map at least one higher order PO.
ESE shall be on all modules with around 40% weightage on modules 1 to 3 and 60% weightage on
modules 4 to 6.
For passing a theory course, Min. 40% marks in (MSE+ISE+ESE) are needed and Min. 40% marks in
ESE are needed. (ESE shall be a separate head of passing)

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Walchand College of Engineering, Sangli
(Government Aided Autonomous Institute)
AY 2022-23
Course Information
Programme B.Tech. (Computer Science and Engineering)
Class, Semester Final Year B. Tech., Sem VII
Course Code 5CS403
Course Name Humanities 4-Legal, IPR, Safety
Desired Requisites: Nil

Teaching Scheme Examination Scheme (Marks)

Lecture 1 Hrs/week MSE ISE ESE Total
Tutorial - 15 10 25 50
Credits: 1

Course Objectives
1 To introduce the students about Legal, IPR, Safety laws.
2 To disseminate knowledge on patents, patent regime in India and abroad and registration aspects.
3 To be aware about current trends in IPR and Govt. steps in fostering IPR.
Course Outcomes (CO) with Bloom’s Taxonomy Level
At the end of the course, the students will be able to,
Bloom’s Bloom’s
CO Course Outcome Statement/s Taxonomy Taxonomy
Level Description
CO1 Understand about Indian industry Legal, IPR, Safety laws. II Understanding
CO2 Interpret patent and copyright in innovative research work. III Applying
CO3 Illustrate the importance of Indian industry Legal, IPR, Safety Analyzing
IV
laws

Module Module Contents Hours

I Overview of Bureau of Indian Standards Act of 1986 2
The Right to Information Act of 2005, In order to promote public education
II 2
and public safety.
III Intellectual Property, Patents, Copyrights, Trademarks. 3
IV Other forms of IP, Current Contour. 2
V Information technology Act 2008,Cyber laws. 3
VI IT Laws and Regulations in Connection with IPR. 1

Textbooks
Nithyananda, K V. (2019). Intellectual Property Rights: Protection and Management. India,
1
IN:Cengage Learning India Private Limited.
2 Cyber Law by Duggal Pavan

References
1 Ahuja, V K. (2017). Law relating to Intellectual Property Rights. India, IN: Lexis Nexis.

Useful Links
1 Cell for IPR Promotion and Management (http://cipam.gov.in/)
2 https://law.resource.org/pub/in/bis/manifest.med.html
3 World Intellectual Property Organization (https://www.wipo.int/about-ip/en/)
4 Office of the Controller General of Patents, Designs & Trademarks (http://www.ipindia.nic.in/)

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 CO-PO Mapping
Programme Outcomes (PO) PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 1 1 1
CO2 2 1 1
CO3 1 2 1
The strength of mapping is to be written as 1: Low, 2: Medium, 3: High
Each CO of the course must map to at least one PO.

Assessment
The assessment is based on MSE, ISE and ESE.
MSE shall be typically on modules 1 to 3.
ISE shall be taken throughout the semester in the form of teacher’s assessment. Mode of assessment can
be field visit, assignments etc. and is expected to map at least one higher order PO.
ESE shall be on all modules with around 40% weightage on modules 1 to 3 and 60% weightage on
modules 4 to 6.
For passing a theory course, Min. 40% marks in (MSE+ISE+ESE) are needed and Min. 40% marks in
ESE are needed. (ESE shall be a separate head of passing)

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Walchand College of Engineering, Sangli
(Government Aided Autonomous Institute)
AY 2022-23
Course Information
Programme B.Tech. (Computer Science and Engineering)
Class, Semester Final Year B. Tech., Sem VII
Course Code 5CS453
Course Name Cryptography and Network Security Lab
Desired Requisites: Computer Networking

Teaching Scheme Examination Scheme (Marks)

Practical 2 Hrs/ Week LA1 LA2 Lab ESE Total
Interaction - 30 30 40 100
Credits: 1

Course Objectives
1 To learn different cipher techniques
2 To implement the algorithms DES, AES, RSA,MD5,SHA-1
3 To use network security tools and vulnerability assessment tools
Course Outcomes (CO) with Bloom’s Taxonomy Level
At the end of the course, the students will be able to,
Bloom’s Bloom’s
CO Course Outcome Statement/s Taxonomy Taxonomy
Level Description
CO1 Develop code for classical Encryption Techniques to solve the real Apply
III
life problems
CO2 Analyze the network security system using open source tools IV Analyze
CO3 Evaluate the securities of different security protocols V Evaluate
CO4 Build cryptosystems by applying symmetric and public key Create
VI
encryption algorithms

List of Experiments / Lab Activities/Topics

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 List of Topics(Applicable for Interaction mode ):

List of Lab Activities:

1. Perform encryption, decryption using the following substitution techniques

a. Ceaser cipher,
b. playfair cipher
c. Hill Cipher
d. Vigenere cipher
2. Perform encryption and decryption using following transposition techniques
a. Rail fence
b. row and Column Transformation
3. Implementation of Euclidean and Extended Euclidean Algorithm
4. Implementation of Chinese Remainder Theorem (CRT)
5. Apply DES algorithm for practical applications
6. Apply AES algorithm for practical applications
7. Implementation of RSA Algorithm
8. Implement the Diffie-Hellman Key Exchange algorithm for a given problem
9. Calculate the message digest of a text using the SHA-1 algorithm
10. Implement the SIGNATURE SCHEME – Digital Signature Standard
11. Demonstration of SSL using Wireshark
12. Automated Attack and Penetration Tools
Exploring a Vulnerability Assessment Tool

In case of mini-projects, drawing, presentations etc, write the relevant details of the same.

Textbooks
William Stallings, “Cryptography and Network Security: Principles and Practice”, Prentice Hall
1
of India.
Behrouz A. Forouzan “Cryptography And Network Security”. Tata Mcgraw-Hill, New Delhi
2
India.

References
1 “Applied Cryptography, Protocols Algorithms and Source Code in C”, Bruce Schneier, Wiley.
2 “Cryptography and Network Security”, Atul Kahate, Tata Mc Graw Hill.

Useful Links
1

CO-PO Mapping
Programme Outcomes (PO) PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 3 2
CO2 3 3 3 3 1
CO3 3 3 2 3 2
CO4 3 2 3 2
The strength of mapping is to be written as 1,2,3; where, 1: Low, 2: Medium, 3: High
Each CO of the course must map to at least one PO, and preferably to only one PO.

Assessment

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 There are three components of lab assessment, LA1, LA2 and Lab ESE.
IMP: Lab ESE is a separate head of passing.(min 40 %), LA1+LA2 should be min 40%
Assessment Based on Conducted by Typical Schedule Marks
Lab activities, During Week 1 to Week 8
LA1 attendance, Lab Course Faculty Marks Submission at the end of 30
journal Week 8
Lab activities, During Week 9 to Week 16
LA2 attendance, Lab Course Faculty Marks Submission at the end of 30
journal Week 16
Lab activities, Lab Course Faculty and During Week 18 to Week 19
Lab ESE journal/ External Examiner as Marks Submission at the end of 40
performance applicable Week 19
Week 1 indicates starting week of a semester. Lab activities/Lab performance shall include performing
experiments, mini-project, presentations, drawings, programming, and other suitable activities, as per the
nature and requirement of the lab course. The experimental lab shall have typically 8-10 experiments and
related activities if any.

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Walchand College of Engineering, Sangli
(Government Aided Autonomous Institute)
AY 2022-23
Course Information
Programme B.Tech. (Computer science and engineering)
Class, Semester Final Year B. Tech., Sem VII
Course Code 5CS454
Course Name Techno-Socio Activity
Desired Requisites: This is the audit course. No pre-requisite

Teaching Scheme Examination Scheme (Marks)

Practical - LA1 LA2 ESE Total
Interaction 1 Hrs/ Week 15 15 20 50
Credits: 1

Course Objectives
To nurture technical knowledge mainly through various participations and competitions during their
1
engineering study
2 To develop empathy by participating in social empowerment acts
Course Outcomes (CO) with Bloom’s Taxonomy Level
At the end of the course, the students will be able to,
Bloom’s Bloom’s
CO Course Outcome Statement/s Taxonomy Taxonomy
Level Description
CO1 To develop professional and soft skills to participations IV Analyse
CO2 To analyse real world problem, create and showcase the best solution Create
VI
of techno-socio domains

List of Experiments / Lab Activities/Topics

List of Topics(Applicable for Interaction mode ):

List of Lab Activities:

Open to students. Student can undertake any techno-socio activity as listed below but not limited to it :

1. Each student or group of students may participate in any social activity like “Swach Bharat
Abhiyan”,
2. “Blood Donation Camp”, or any social activity announced by Govt. / Corporation / Panchayat.
Each student or group of students participating in technical events / competition.
3. Awards / recognition received in techno-socio activity
4. Completing the on line courses (on topics beyond syllabus) / certification of any companies /
technologies (e.g. IBM / Oracle / CISCO etc.)
5. Developing any innovative gadget / solution / system and transfer in the interest of Nation / Society /
Institute (WCE)
6. Published a papers in national / international conferences / journals
7. Coordinating the students clubs / services
8. Organizing techno-socio activity for the students / community in rural areas, backward areas.

Textbooks
1 Nil

References
1 The students may refer/undergo on line courses required to undertake any techno-socio activity.

Useful Links
1 Nil

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 CO-PO Mapping
Programme Outcomes (PO) PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 -- -- -- -- -- -- -- -- -- -- 1 -- -- --
CO2 -- -- -- -- -- -- -- -- -- -- 2 -- -- --
CO3 -- -- -- -- -- -- -- -- -- -- -- -- -- --
The strength of mapping is to be written as 1,2,3; where, 1: Low, 2: Medium, 3: High
Each CO of the course must map to at least one PO, and preferably to only one PO.

Assessment
There are three components of lab assessment, LA1, LA2 and Lab ESE.
IMP: Lab ESE is a separate head of passing.(min 40 %), LA1+LA2 should be min 40%
Assessment Based on Conducted by Typical Schedule Marks
Lab activities, During Week 1 to Week 8
LA1 attendance, Lab Course Faculty Marks Submission at the end of 15
journal Week 8
Lab activities, During Week 9 to Week 16
LA2 attendance, Lab Course Faculty Marks Submission at the end of 15
journal Week 16
Lab activities, Lab Course Faculty and During Week 18 to Week 19
Lab ESE journal/ External Examiner as Marks Submission at the end of 20
performance applicable Week 19
Week 1 indicates starting week of a semester. Lab activities/Lab performance shall include performing
experiments, mini-project, presentations, drawings, programming, and other suitable activities, as per the
nature and requirement of the lab course. The experimental lab shall have typically 8-10 experiments and
related activities if any.

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Walchand College of Engineering, Sangli
(Government Aided Autonomous Institute)
AY 2022-23
Course Information
Programme B.Tech. (Computer science and engineering)
Class, Semester Final Year B. Tech., Sem VII
Course Code 5CS491
Course Name Project-1
Desired Requisites: Nil

Teaching Scheme Examination Scheme (Marks)

Practical 6 Hrs/ Week LA1 LA2 Lab ESE Total
Interaction - 30 30 40 100
Credits: 3

Course Objectives
To understand Software Development Life Cycle and prepare project proposal based on real life use
1
case
2 To utilize state of the art CASE tools especially for design, development and testing phases.
3 To experience project management techniques.
4 To acquaint the ability to map technical skills to real life applications from customers perspective.
Course Outcomes (CO) with Bloom’s Taxonomy Level
At the end of the course, the students will be able to,
Bloom’s Bloom’s
CO Course Outcome Statement/s Taxonomy Taxonomy
Level Description
CO1 demonstrate the state-of-art technological trends through Understanding
II
planning and design project aspects.
CO2 adopt agile methodology and mature team skills through various Applying
III
SDLC phases.
CO3 showcase the project working model with real life use case mainly to Creating
VI
potential customers.

List of Experiments / Lab Activities/Topics

List of Topics(Applicable for Interaction mode ):

List of Lab Activities:

1. Project work is to be carried out in two semesters with group size of maximum three to four students
2. In first semester project group will select a project topic with consent from guide and approval from
department and submit the brief document discussing the outline of the project with clear objectives.
3. Students should maintain a project log book containing weekly progress of the project.
4. At the end of the semester project group should complete the system design, Algorithm design and
present with suitable model. (CFD, DFD & Data structure layout, SRS & UML diagram using
project management tool)
5. Project report should be prepared using Latex and submitted in soft and hard form.

Textbooks
1 Nil

References
1 Nil

Useful Links
1 Nil

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 CO-PO Mapping
Programme Outcomes (PO) PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 -- 3 -- 2 -- -- -- -- 1 -- -- -- -- --
CO2 -- -- 3 -- -- -- -- -- -- 1 -- -- -- --
CO3 -- -- -- 3 -- -- -- -- -- -- -- -- -- --
The strength of mapping is to be written as 1,2,3; where, 1: Low, 2: Medium, 3: High
Each CO of the course must map to at least one PO, and preferably to only one PO.

Assessment
There are three components of lab assessment, LA1, LA2 and Lab ESE.
IMP: Lab ESE is a separate head of passing.(min 40 %), LA1+LA2 should be min 40%
Assessment Based on Conducted by Typical Schedule Marks
Lab activities, During Week 1 to Week 8
LA1 attendance, Lab Course Faculty Marks Submission at the end of 30
journal Week 8
Lab activities, During Week 9 to Week 16
LA2 attendance, Lab Course Faculty Marks Submission at the end of 30
journal Week 16
Lab activities, Lab Course Faculty and During Week 18 to Week 19
Lab ESE journal/ External Examiner as Marks Submission at the end of 40
performance applicable Week 19
Week 1 indicates starting week of a semester. Lab activities/Lab performance shall include performing
experiments, mini-project, presentations, drawings, programming, and other suitable activities, as per the
nature and requirement of the lab course. The experimental lab shall have typically 8-10 experiments and
related activities if any.

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Walchand College of Engineering, Sangli
(Government Aided Autonomous Institute)
AY 2022-23
Course Information
Programme B.Tech. (Computer Science Engineering)
Class, Semester Final Year B. Tech., Sem VII
Course Code 5CS455
Course Name Humanities 3-Project Management
Desired Requisites: Software Engineering

Teaching Scheme Examination Scheme (Marks)

Practical - LA1 LA2 ESE Total
Interaction 1 Hrs/ Week 15 15 20 50
Credits: 1

Course Objectives
1 To provide in-depth coverage of project management principles using tools.
2 To Understand the Project management tools practiced in the IT industry.
To Comprehend the hands-on exploration of project management tools used on Software
3
Development.
Course Outcomes (CO) with Bloom’s Taxonomy Level
At the end of the course, the students will be able to,
Bloom’s Bloom’s
CO Course Outcome Statement/s Taxonomy Taxonomy
Level Description
CO1 Be familiar with project management concepts used in software Understanding
II
development in industry.
CO2 Utilize project management tools for developing a variety of software Applying
applications. III

CO3 Get acquainted with the use of project management tools to achieve Creating
VI
quality and industry readiness.

List of Experiments / Lab Activities/Topics

List of Topics(Applicable for Interaction mode ):

List of Lab Activities:

1. Overview of Jira software.

2. Study of Project management using Jira.
3. Understanding Workflow management.
4. Managing Tasks using Jira.
5. Jira user and role management.
6. Project Monitoring and Reporting.
7. Issue management using.
8. Bug tracking and reporting.
9. Performing Project Integration.
10. Agile best practices using Jira.
11. Version management using Jira.

Textbooks
1 Jira Project Management A Complete Guide - 2019 by Gerardus Blokdyk . The Art of Service
2 Jira Quick Start Guide: Manage your projects efficiently using the all-new Jira by Ravi Sagar

References
1 JIRA Essentials, Third Edition, Patrick Li,Packt enterprise
Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Useful Links
1 https://www.atlassian.com/
2 https://www.javatpoint.com/jira-tutorial

CO-PO Mapping
Programme Outcomes (PO) PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 2
CO2 3
CO3 2 2 2
The strength of mapping is to be written as 1,2,3; where, 1: Low, 2: Medium, 3: High
Each CO of the course must map to at least one PO, and preferably to only one PO.

Assessment
There are three components of lab assessment, LA1, LA2 and Lab ESE.
IMP: Lab ESE is a separate head of passing.(min 40 %), LA1+LA2 should be min 40%
Assessment Based on Conducted by Typical Schedule Marks
Lab activities, During Week 1 to Week 8
LA1 attendance, Lab Course Faculty Marks Submission at the end of 30
journal Week 8
Lab activities, During Week 9 to Week 16
LA2 attendance, Lab Course Faculty Marks Submission at the end of 30
journal Week 16
Lab activities, Lab Course Faculty and During Week 18 to Week 19
Lab ESE journal/ External Examiner as Marks Submission at the end of 40
performance applicable Week 19
Week 1 indicates starting week of a semester. Lab activities/Lab performance shall include performing
experiments, mini-project, presentations, drawings, programming, and other suitable activities, as per the
nature and requirement of the lab course. The experimental lab shall have typically 8-10 experiments and
related activities if any.

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Walchand College of Engineering, Sangli
(Government Aided Autonomous Institute)
AY 2022-23
Course Information
Programme B.Tech. (Computer Science and Engineering)
Class, Semester Final Year B. Tech., Sem VII
Course Code 5CS411
Course Name Elective-5: High Performance Computing
Desired Requisites: Data structures, Basic Programming knowledge

Teaching Scheme Examination Scheme (Marks)

Lecture 3 Hrs/week MSE ISE ESE Total
Tutorial - 30 20 50 100
Credits: 3

Course Objectives
To be introduced with current trends in parallel computer architectures and programming
1
models (i.e. languages and libraries) for shared memory, many core/multicore architecture.
To understand parallel program design methodology. Also to calculate speedup and efficiency
2
of parallel algorithm.
3 To learn various parallel algorithms for matrices, graphs.
Course Outcomes (CO) with Bloom’s Taxonomy Level
At the end of the course, the students will be able to,
Bloom’s Bloom’s
CO Course Outcome Statement/s Taxonomy Taxonomy
Level Description
CO1 Describe different parallel paradigms, inter connection networks, Understand
II
and tools for parallel programming.
CO2 Demonstrate design methodology and performance measurement of Apply
III
parallel algorithms on various parallel platforms.
CO3 Analyze a given problem for possibilities of parallel computations. IV Analyze

Module Module Contents Hours

Introduction
What is parallel computing? The scope of parallel computing? Issues in
parallel computing. Taxonomy of parallel architecture, Memory bound vs
I 8
Compute bound problems, Dynamic interconnection networks, static
interconnection networks, Routing mechanism for static network.
Communication cost in static interconnection network.
Parallel programming models and paradigms
Introduction, parallel applications and development, code granularity and level
II of parallelism, parallel programming models and tools, methodical design of 6
parallel algorithm, parallel program paradigm, programming skeleton and
templates.
Performance and scalability of parallel systems
Performance Metrics for parallel systems. The effect of Granularity and Data
Mapping on Performance. The Scalability of parallel systems, Isoefficiency
III 8
metric of scalability, sources of parallel overhead, Minimum execution time
and minimum cost-optimal execution time, parallel work efficiency, amdahl
limiters, communication-computation overlap/pipelining.

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Parallel programming libraries
OpenMP, MPI, Thread basics ,Work Sharing constructs, Scheduling,
Reduction, Mutual Exclusion Synchronization & Barriers, The MPI
Programming Model, MPI Basics, Global Operations , Asynchronous
IV 6
Communication, Modularity, Other MPI Features, Performance Issues, Thread
programming C++11 Threads /OpenMP, MPI - two sided communication, one
side communication based programming model aka PGAS (Partitioned Global
Address Space) eg: OpenSHMEM/NVSHMEM.
Parallel programming using accelerators
V Introduction of CUDA/OpenCL, Chapel, etc. Basics of GPGPU, CUDA 6
Programming model, CUDA memory type, CUDA and/or OpenCL for
GPGPU hardware, case study.
Algorithms
Dense matrix algorithms, sorting, graph algorithms, prefix sum with decoupled
VI 6
lookback, parallel radix sort/batcher's sort

Textbooks
“Introduction to Parallel Computing”, (2nd ed.), by Ananth Grama, Anshul Gupta, George
1
Karypis, and Vipin Kumar.
“High Performance Cluster Computing : Programming and Applications”, Volume 2 By Buyya
2
Rajkumar.
“CUDA Programming: A Developer's Guide to Parallel Computing with GPUs”, by Shane
3
cook “Introduction to PARALLEL PROGRAMMING”, by Peter Pacheco.

References
1 “Parallel Programming in C with MPI and OpenMP”, Michael J. Quinn, McGraw-Hill, 2004.

Useful Links
Single-pass Parallel Prefix Scan with Decoupled Look-back
1
https://research.nvidia.com/publication/single-pass-parallel-prefix-scan-decoupled-look-back
parallel radix sort/batcher's sort.
2 https://developer.download.nvidia.com/video/gputechconf/gtc/2020/presentations/s21572-a-
faster-radix-sort-implementation.pdf
High Performance Computing, Charles Severance, 1998.
3
http://cnx.org/content/col11136/latest/
MPI: The Complete Reference, Marc Snir, Steve Otto, Steven Huss-Lederman, David Walker,
4
and Jack Dongarra, 1996. http://www.netlib.org/utk/papers/mpi-book/mpi-book.html

CO-PO Mapping
Programme Outcomes (PO) PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 1 1
CO2 3 3 1
CO3 2 2 2 1
The strength of mapping is to be written as 1: Low, 2: Medium, 3: High
Each CO of the course must map to at least one PO.

Assessment

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 The assessment is based on MSE, ISE and ESE.
MSE shall be typically on modules 1 to 3.
ISE shall be taken throughout the semester in the form of teacher’s assessment. Mode of assessment can
be field visit, assignments etc. and is expected to map at least one higher order PO.
ESE shall be on all modules with around 40% weightage on modules 1 to 3 and 60% weightage on
modules 4 to 6.
For passing a theory course, Min. 40% marks in (MSE+ISE+ESE) are needed and Min. 40% marks in
ESE are needed. (ESE shall be a separate head of passing)

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Walchand College of Engineering, Sangli
(Government Aided Autonomous Institute)
AY 2022-23
Course Information
Programme B.Tech. (Computer Science and Engineering)
Class, Semester Final Year B. Tech., Sem VII
Course Code 5CS412
Course Name Elective-5 : Data Mining
Desired Requisites: Database Engineering

Teaching Scheme Examination Scheme (Marks)

Lecture 3 Hrs/week MSE ISE ESE Total
Tutorial - 30 20 50 100
Credits: 3

Course Objectives
To gain the knowledge of theoretical background to several of the commonly used data mining
1
techniques.
2 To analyze data, choose relevant models and algorithms for respective applications.
3 To evaluate the different data mining algorithms and tools
4 To develop research interest towards advances in data mining
Course Outcomes (CO) with Bloom’s Taxonomy Level
At the end of the course, the students will be able to,
Bloom’s Bloom’s
CO Course Outcome Statement/s Taxonomy Taxonomy
Level Description
CO1 apply the data pre-processing and data mining algorithms to solve Apply
III
real world problems
CO2 analyze a complex data mining problem and different data mining Analyze
IV
algorithms to identify solutions.
CO3 measure the performance of different data mining algorithms/tools, Evaluate
V
evaluate and recommend the optimal solution.
CO4 Design and build a data mining tool/solution to meet the given set Create
of computing requirements in the context of the complex data VI
mining problem.

Module Module Contents Hours

Introduction
I Data mining and its need, Different kinds of data that can be mined, Various 5
patterns that can be mined, Technologies to be Used, Target applications,
Major Issues in Data Mining.
About Data and its pre-processing
Data objects and attribute types, basic statistical description of data, Data
II 7
visualization, Data pre-processing : Overview, data cleaning, data integration,
data transformation and data discretization.
Classification
Basic concepts, decision tree induction and rule based classification, Bayes
III 8
Classification, Artificial Neural Network (ANN) based classification, Metrics
for Evaluating Classifier Performance
Clustering
Basic concepts, measuring data similarity and dissimilarity, partitioning
IV 6
methods, Hierarchical Methods, Density-Based methods, Evaluation of
Clustering

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Association Rule Mining
V Basic concepts, Frequent itemset mining methods, interesting patterns and its 6
evaluation methods, Pattern Exploration and Application.
Web Mining
VI 7
Introduction, web content mining, web structure mining, web usage mining

Textbooks
Jiawei Han , Micheline Kamber and Jian Pei , “Data Mining - Concepts and Techniques” ,
1
Third Edition, Morgan Kaufmann, 2012, ISBN 978-0-12-381479-1
Dunham, Margaret H , “Data Mining: Introductory and Advanced Topics”, 1st Edition ,
2
PHI/Pearson, 2006 , ISBN 978-81-7758-785-2

References
Sumathi, S., Sivanandam, S.N. , “Introduction to Data Mining and its Applications”, Springer
1
, 2006 , ISBN 978-3-540-34351-6
P. Tan, M. Steinbach and V. Kumar, "Introduction to Data Mining", 2nd Edition, Addison
2
Wesley, 2019,
3 Related papers from various IEEE Transactions , Int. Journals / Conferences.

Useful Links
Data sets : https://archive.ics.uci.edu/ml/index.php
1
IEEE Transactions on Knowledge and Data Engineering :
2
https://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=69
Tools - Tableau : https://www.tableau.com/developer/tools , SPSS : https://www.ibm.com/in-
3
en/analytics/spss-statistics-software , Weka : https://www.cs.waikato.ac.nz/ml/weka/
4 Data Mining Resources : https://www.cs.purdue.edu/homes/ayg/CS590D/resources.html

CO-PO Mapping
Programme Outcomes (PO) PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2
CO2 3 2
CO3 3 3
CO4 3 3
The strength of mapping is to be written as 1: Low, 2: Medium, 3: High
Each CO of the course must map to at least one PO.

Assessment
The assessment is based on MSE, ISE and ESE.
MSE shall be typically on modules 1 to 3.
ISE shall be taken throughout the semester in the form of teacher’s assessment. Mode of assessment can
be field visit, assignments etc. and is expected to map at least one higher order PO.
ESE shall be on all modules with around 40% weightage on modules 1 to 3 and 60% weightage on
modules 4 to 6.
For passing a theory course, Min. 40% marks in (MSE+ISE+ESE) are needed and Min. 40% marks in
ESE are needed. (ESE shall be a separate head of passing)

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Walchand College of Engineering, Sangli
(Government Aided Autonomous Institute)
AY 2022-23
Course Information
Programme B.Tech. (Computer Science & Engineering)
Class, Semester Final Year B. Tech., Sem VII
Course Code 5CS413
Course Name Elective 6: Software Defined Network
Desired Requisites: Computer Network and Data Communication

Teaching Scheme Examination Scheme (Marks)

Lecture 3 Hrs/week MSE ISE ESE Total
Tutorial - 30 20 50 100
Credits: 3

Course Objectives
1 To understand SDN/NFV motivation and benefits.
2 To describe how SDN/Openflow work.
3 To understand mininet and some programming languages.
Course Outcomes (CO) with Bloom’s Taxonomy Level
At the end of the course, the students will be able to,
Bloom’s Bloom’s
CO Course Outcome Statement/s Taxonomy Taxonomy
Level Description
CO1 understand OpenFlow, challenges in SDN, and the recent Understanding
II
development in SDN
CO2 Analyse and apply implementation of SDN through Open Flow Analysing,
IV, III
Switches, SDN-Controllers. Applying
CO3 Evaluate the pros and cons of applying SDN, API approaches, Evaluating
V
Hypervisor overlays, and SDN Data Centre

Module Module Contents Hours

History and Evolution of Software Defined Networking (SDN)
Introduction, Traditional Vs. SDN network, Separation of Control Plane
I 8
and Data Plane, IETF Forces, Active Networking. Control and Data Plane
Separation: Concepts, Advantages and Disadvantages.
OpenFlow Protocol and Network Virtualization
Introduction to OpenFlow Protocol, OpenFlow Versions, OpenFlow with
multiple flow tables, Virtualization: Concepts, Applications of virtual
II networking, Existing Network Virtualization Framework (VMWare and 7
others), Open Virtual Switch (OVS), OpenFlow flow entries on OVS,
Monitoring tools: Mininet, OpenDaylight, etc., Mininet introduction,
Network virtualization with mininet and Mininet topologies.
Control Plane
Overview, Existing SDN Controllers including Floodlight and Open
III 6
Daylight projects. Customization of Control Plane: Switching and Firewall,
Implementation using SDN Concepts.
Data Plane
Software-based and Hardware-based; Programmable Network Hardware.
IV 6
Programming SDNs: Northbound Application Programming Interface,
Current Languages and Tools, Composition of SDNs.
Network Functions Virtualization (NFV) and Software Defined
Networks
V
Network architecture, NFV Infrastructure, NFV Management and 5
Orchestration (MANO), NFV and SDN
Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Data Centre Networks
Packet, Optical and Wireless Architectures, Network Topologies.
VI
Use Cases of SDNs: Data Centres, Internet Exchange Points, Backbone 7
Networks, Home Networks, Traffic Engineering.

Textbooks
SDN: Software Defined Networks, an Authoritative Review of Network Programmability
1 Technologies, By Thomas D. Nadeau, Ken Gray Publisher: O'Reilly Media, August 2013,
ISBN: 978-1-4493-4230-2, ISBN 10:1-4493-4230-2.
Software Defined Networks: A Comprehensive Approach, by Paul Goransson and Chuck
2 Black, Morgan Kaufmann, June 2014, Print Book ISBN: 9780124166752, eBook ISBN :
9780124166844

References
SDN and OpenFlow for Beginners by Vivek Tiwari, Sold by: Amazon Digital Services, Inc.,
1
ASIN: , 2013.
Network Innovation through OpenFlow and SDN: Principles and Design, Edited by Fei Hu,
2
CRC Press, ISBN-10: 1466572094, 2014
3 sdnhub.org

Useful Links
https://www.youtube.com/watch?v=dkUDUb9GtH0&list=PLpherdrLyny8YN4M24iRJBMCX
1
kLcGbmhY&ab_channel=NickFeamster

CO-PO Mapping
Programme Outcomes (PO) PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 3 1
CO2 3 2
CO3 2
The strength of mapping is to be written as 1: Low, 2: Medium, 3: High
Each CO of the course must map to at least one PO.

Assessment
The assessment is based on MSE, ISE and ESE.
MSE shall be typically on modules 1 to 3.
ISE shall be taken throughout the semester in the form of teacher’s assessment. Mode of assessment can
be field visit, assignments etc. and is expected to map at least one higher order PO.
ESE shall be on all modules with around 40% weightage on modules 1 to 3 and 60% weightage on
modules 4 to 6.
For passing a theory course, Min. 40% marks in (MSE+ISE+ESE) are needed and Min. 40% marks in
ESE are needed. (ESE shall be a separate head of passing)

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Walchand College of Engineering, Sangli
(Government Aided Autonomous Institute)
AY 2022-23
Course Information
Programme B.Tech. (Computer Science and Engineering)
Class, Semester Final Year B. Tech., Sem VII
Course Code 5CS414
Course Name Elective- 6: Computer Vision
Desired Requisites: Digital Image Processing

Teaching Scheme Examination Scheme (Marks)

Lecture 3 Hrs/week MSE ISE ESE Total
Tutorial - 30 20 50 100
Credits: 3

Course Objectives
1 To impart knowledge of advanced techniques in computer vision.
To acquaint students with the concepts of color image processing, texture analysis, object
2
recognition, video processing, 3D imaging etc. by applying the algorithms to build applications.
To allow students to compare various algorithms and select the one most appropriate for a
3
particular application.
Course Outcomes (CO) with Bloom’s Taxonomy Level
At the end of the course, the students will be able to,
Bloom’s Bloom’s
CO Course Outcome Statement/s Taxonomy Taxonomy
Level Description
CO1 Demonstrate the knowledge of the various concepts of III
Applying
computer vision.
CO2 Apply and Analyse different computer vision algorithms to solve Analyze
IV
real life problems
CO3 Illustrate and critique different techniques employed in Evaluate
V
computer vision

Module Module Contents Hours

Color Image Processing
Color Fundamentals, Color models, Gray level to color transformations,
I Basics of Color Image Processing, Color Transformations, Smoothing and 6
Sharpening, Color
Segmentation
Texture Analysis
Definition, Types of texture, Texels, Texture analysis – concept and
categories, Approaches to texture analysis, Statistics, Texture descriptors -
II 7
statistical - Auto-correlation, co-occurrence matrices
and features, edge density and direction, local binary partition, Law’s texture
energy measures, Wavelets and texture analysis.
Representation & Description
III Representation, Boundary Descriptors, Regional Descriptors, Use of Principal 6
components for description, Relational Descriptors
Object Recognition & Restoration
Object Recognition: Object Detection Vs recognition, Patterns and Pattern
Classes, Knowledge Representation, Statistical Pattern Recognition, Neural
IV
Nets, Syntactic Pattern Recognition,Optimization Techniques in Recognition.
Restoration: Image Restoration Model, Noise Models,Restoration using 8
spatial filtering, Reduction using frequency domain filtering.

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Moving Object Detection and Tracking
Introduction, Background Modeling, Connected Component Labeling,
V Shadow Detection, Single Object Tracking, Discrete Kalman Filtering, 6
Particle-filter based tracking, Mean-shift
tracking, Segmentation tracking via graph cuts
3D Vision
VI Introduction to 3D imaging ,applications. Case study based on the current
trends in 3D imaging 6

Textbooks
1 R. C. Gonzalez, R. E. Woods, Digital Image Processing, 4th Edition. 2018, PHI
2 A. K. Jain, Fundamentals of Digital Image Processing, PHI

References
Milan Sonka, Vaclav Hlavac, Boyle, Digital Image Processing and Computer Vision, Cengage
1
Learning
2 S. Jayaraman, S. Esakkirajan, T. Veerkumar, Digital Image Processing, Tata McGrawHill
Rafael C. Gonzalez, Richard E. Woods, Steven L. Eddins, Digital Image Processing Using
3
MATLAB, 2nd ed.

Useful Links
1 NPTEL course: Link
2 NPTEL course: Link

CO-PO Mapping
Programme Outcomes (PO) PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2
CO2 3 2
CO3 2 3
The strength of mapping is to be written as 1: Low, 2: Medium, 3: High
Each CO of the course must map to at least one PO.

Assessment
The assessment is based on MSE, ISE and ESE.
MSE shall be typically on modules 1 to 3.
ISE shall be taken throughout the semester in the form of teacher’s assessment. Mode of assessment can
be field visit, assignments etc. and is expected to map at least one higher order PO.
ESE shall be on all modules with around 40% weightage on modules 1 to 3 and 60% weightage on
modules 4 to 6.
For passing a theory course, Min. 40% marks in (MSE+ISE+ESE) are needed and Min. 40% marks in
ESE are needed. (ESE shall be a separate head of passing)

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Walchand College of Engineering, Sangli
(Government Aided Autonomous Institute)
AY 2022-23
Course Information
Programme B.Tech. (Computer Science and Engineering)
Class, Semester Final Year B. Tech., Sem VII
Course Code 5CS415
Course Name Elective-6: MOOC on AI ML: Reinforcement Learning
Desired Requisites: B.Tech. (Computer Science and Engineering)

Teaching Scheme Examination Scheme (Marks)

Lecture 3 Hrs/week MSE ISE ESE Total
Tutorial - 30 20 50 100
Credits: 3

Course Objectives
1 To illustrate and apply the algorithm Reinforcement techniques.
2 To explain and demonstrate different reinforcement techniques for real world problem
3 To analyse reinforcement algorithm while applying to computation problem
Course Outcomes (CO) with Bloom’s Taxonomy Level
At the end of the course, the students will be able to,
Bloom’s Bloom’s
CO Course Outcome Statement/s Taxonomy Taxonomy
Level Description
CO1 Discuss the fundamentals of Reinforcement Learning. II Understanding
CO2 Apply knowledge of formulation of reinforcement techniques to Applying
III
solve real word solution
CO3 Critically analyze the various reinforcement techniques for a given Analyzing
IV
problem.

Module Module Contents Hours

Introduction, Bandit algorithms – UCB, PAC
I 6
Bandit algorithms –Median Elimination, Policy Gradient Full RL & MDPs
II 7
Bellman Optimalit, Dynamic Programming & TD Methods
III 6
Eligibility Traces, Function Approximation
IV 7
Least Squares Methods,Fitted Q, DQN & Policy Gradient for Full RL 6
V
Hierarchical RL, POMDPs
VI
7

Textbooks
1 R. S. Sutton and A. G. Barto. Reinforcement Learning - An Introduction. MIT Press. 1998.

References
1 R. S. Sutton and A. G. Barto. Reinforcement Learning - An Introduction. MIT Press. 1998.

Useful Links
1 https://onlinecourses.nptel.ac.in/noc22_cs34/preview

CO-PO Mapping
Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Programme Outcomes (PO) PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 -- -- -- -- -- -- -- -- -- -- -- -- --
CO2 3 1 -- -- -- -- -- -- -- -- -- -- -- --
CO3 -- 3 -- 2 -- -- -- -- -- -- -- -- -- --
CO4 -- -- -- 2 -- -- -- -- -- -- -- -- -- --
CO5 -- -- 3 -- -- -- -- -- -- -- -- -- -- --
The strength of mapping is to be written as 1: Low, 2: Medium, 3: High
Each CO of the course must map to at least one PO.

Assessment
The assessment is based on MSE, ISE and ESE.
MSE shall be typically on modules 1 to 3.
ISE shall be taken throughout the semester in the form of teacher’s assessment. Mode of assessment can
be field visit, assignments etc. and is expected to map at least one higher order PO.
ESE shall be on all modules with around 40% weightage on modules 1 to 3 and 60% weightage on
modules 4 to 6.
For passing a theory course, Min. 40% marks in (MSE+ISE+ESE) are needed and Min. 40% marks in
ESE are needed. (ESE shall be a separate head of passing)

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Walchand College of Engineering, Sangli
(Government Aided Autonomous Institute)
AY 2022-23
Course Information
Programme B.Tech. (Computer Science and engineering)
Class, Semester Final Year B. Tech., Sem VII
Course Code 5CS451
Course Name Elective 5 Lab-High Performance Computing Lab
Desired Requisites: Data structures, Basic Programming knowledge

Teaching Scheme Examination Scheme (Marks)

Practical 2 Hrs/ week LA1 LA2 Lab ESE Total
Interaction - 30 30 40 100
Credits: 1

Course Objectives
1 To provide basics of parallel architectures
2 To provide basics of parallel algorithm design and analysis
3 To provide basics of parallel programming platforms
4
Course Outcomes (CO) with Bloom’s Taxonomy Level
At the end of the course, the students will be able to,
Bloom’s Bloom’s
CO Course Outcome Statement/s Taxonomy Taxonomy
Level Description
CO1 Comparison of different parallel architectures and performance Understand
I
evaluation
CO2 To measure performance of model using different metrics II Apply
CO3 To design a parallelization strategy for computing patterns on different Create
VI
hardware and using different parallel computing languages.

List of Experiments / Lab Activities/Topics

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 List of Topics(Applicable for Interaction mode ):

List of Lab Activities:

A. Implementation of following tasks using OpenMP.
1. Implementation of sum of two lower triangular matrices.
2. Implementation of Matrix-Matrix Multiplication.
3. Implementation of dot product
4. Implementation of Prefix sum
B. Implementation of following tasks using MPI.
5. Implementation of Matrix-Vector Multiplication.
6. Implementation of Matrix-Matrix Multiplication.
7. Implementation of 2D Convolution
8. Implementation of dot product
9. Implementation of Prefix sum
C. Implementation of following tasks using CUDA.
10. Implementation of Matrix-matrix Multiplication using global memory.
11. Implementation of Matrix-Matrix Multiplication using shared memory.
12. Implementation of Histogram
13. Implementation of Odd even sort
14. Implementation of Prefix sum
15. Implement 2D Convolution using shared memory
D. Performance evaluation of following computations using open source libraries or OpenACC compare
to sequential and explicit parallel implementation
16. Implementation of Matrix-Matrix multiplication using OpenACC MKL, and cuBLAS.
Compare their performance with OpenMP based implementation from assignment no.2, 10 and
11.

Textbooks
1 Zbigniew J. Czech, Introduction to Parallel Computing, Cambridge University Press, 2016.
Kumar, V., Grama, A., Gupta, A., & Karypis, G. (1994). Introduction to parallel computing (Vol.
2
110). Redwood City, CA: Benjamin/Cummings.
Chandra, R., Dagum, L., Kohr, D., Menon, R., Maydan, D., & McDonald, J. (2001). Parallel
3
programming in OpenMP. Morgan kaufmann.
Cheng, J., Grossman, M., & McKercher, T. (2014). Professional CUDA c programming. John
4
Wiley & Sons.

References
1 Michael Quinn, Parallel Computing: Theory and Practice, McGrawHill Publishers, July 2017.
Arch Robison, James Reinders, and Michael Macoul, Structured Parallel Programming: Patterns
2
for Efficient Computation, Morgan Kaufman, Elsevier, 2012.

Useful Links
1

CO-PO Mapping
Programme Outcomes (PO) PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 1 1 1 1
CO2 2 2 2 1
CO3 2 2 2 1
The strength of mapping is to be written as 1,2,3; where, 1: Low, 2: Medium, 3: High
Each CO of the course must map to at least one PO, and preferably to only one PO.

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Assessment
There are three components of lab assessment, LA1, LA2 and Lab ESE.
IMP: Lab ESE is a separate head of passing.(min 40 %), LA1+LA2 should be min 40%
Assessment Based on Conducted by Typical Schedule Marks
Lab activities, During Week 1 to Week 8
LA1 attendance, Lab Course Faculty Marks Submission at the end of 30
journal Week 8
Lab activities, During Week 9 to Week 16
LA2 attendance, Lab Course Faculty Marks Submission at the end of 30
journal Week 16
Lab activities, Lab Course Faculty and During Week 18 to Week 19
Lab ESE journal/ External Examiner as Marks Submission at the end of 40
performance applicable Week 19
Week 1 indicates starting week of a semester. Lab activities/Lab performance shall include performing
experiments, mini-project, presentations, drawings, programming, and other suitable activities, as per the
nature and requirement of the lab course. The experimental lab shall have typically 8-10 experiments and
related activities if any.

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Walchand College of Engineering, Sangli
(Government Aided Autonomous Institute)
AY 2022-23
Course Information
Programme B.Tech. (Computer Science and Engineering)
Class, Semester Final Year B. Tech., SemVII
Course Code 5CS452
Course Name Elective 5 lab- Data Mining Lab
Desired Requisites: Database Engineering

Teaching Scheme Examination Scheme (Marks)

Practical 2 Hrs/ Week LA1 LA2 Lab ESE Total
Interaction 30 30 40 100
Credits: 1

Course Objectives
The hands-on and practically implementation of the concepts/techniques studied in theory
1
course.
2 Exposure to real life data sets for analysis and prediction.
Learning performance evaluation of data mining algorithms in a supervised and an unsupervised
3
mode with different data mining tools.
4 Handling a mini data mining project for a given practical domain.
Course Outcomes (CO) with Bloom’s Taxonomy Level
At the end of the course, the students will be able to,
Bloom’s Bloom’s
CO Course Outcome Statement/s Taxonomy Taxonomy
Level Description
CO1 Interpret the data mining process and handle important issues around Apply
data III
cleaning, pre-processing and integration.
CO2 Analyse the real world problems using different data mining Analyze
IV
algorithms.
CO3 Measure the performance of different data mining algorithms / tools. V Evaluate
CO4 Design and build the data mining system for solving any complex Create
VI
problem.

List of Experiments / Lab Activities/Topic

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
List of Lab Activities:
1. For iris and breast cancer data set
a) Calculate the mean, median, and standard deviation of conditional attributes.
b) Draw histogram
c) Draw the boxplots for pairs of attributes.
d) Draw a scatter plot and a Quantile-Quantile (q-q) plot based on these two variables.

2. For iris and breast cancer data set, perform the

a) Correlation analysis
b) discretization using Binning and Histogram Analysis

3. Design and implementation of following classifiers :

a. Regression classifier.
b. Naïve Bayesian Classifier.
c. k-NN classifier (Take k = 1,3,5,7)
d. Three layer Artificial Neural Network (ANN) classifier (use back propagation)

4. Design and implementation of following clustering algorithms :

a) Hierarchical clustering - AGNES & DIANA. Plot Dendrogram.
b) k-Means
c) k-Medoids (PAM)
d) DBSCAN

5. Design and implementation of following Association Rule Mining algorithms :

a) Basic Association Rule Mining Algorithm
b) Apriori Algorithm

6. Design and implementation of following Web Mining algorithms :

a) Implement the PageRank algorithm to calculate the rank of each page in the file. The
outputshould be the 10 pages with the highest rank, together with their rank values.
b) Implement the HITS algorithm to calculate the hub and the authority weight of each web page
inthe data set. The output should be the 10 most authoritative pages and 10 most hubby pages.

7. Hands on with the state of the art data analytics tools like Tableau , Weka , SPSS, Oracle
DataMiner etc.

8. Mini-project : Group (2/3) of students should search any research journal / literature on data
miningand select small problem statement. Design and build the data mining system for chosen
problem. OR instructor may assign any problem statement for each group.

Instructions :

1. Use the standard data sets from UCI Machine Learning Repository
2. Follow the design, modelling and implementation/documentation methodology using standard
CASEtools.
3. Use Python as Programming Language. For database programming / scripting use PL/SQL T-
SQL,MySQL/Oracle 11g /IBM DB2 9.7 as backend database server. Follow the submission
guidelines.

Textbooks
Jiawei Han , Micheline Kamber and Jian Pei , “Data Mining - Concepts and Techniques” ,
1
Third Edition, Morgan Kaufmann, 2012, ISBN 978-0-12-381479-1
Dunham, Margaret H , “Data Mining: Introductory and Advanced Topics”, 1st Edition ,
2
PHI/Pearson, 2006 , ISBN 978-81-7758-785-2
3
4

References

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Sumathi, S., Sivanandam, S.N. , “Introduction to Data Mining and its Applications”, Springer ,
1
2006 , ISBN 978-3-540-34351-6
P. Tan, M. Steinbach and V. Kumar, "Introduction to Data Mining", 2nd Edition, Addison
2
Wesley, 2019,
3 Related papers from various IEEE Transactions , Int. Journals / Conferences.
4 Open source tools for data analytics and machine learning.

Useful Links
1 Data sets : https://archive.ics.uci.edu/ml/index.php
2 Tableau tool : https://www.tableau.com/developer/tools
3 SPSS tool : https://www.ibm.com/in-en/analytics/spss-statistics-software
4 Weka tool : https://www.cs.waikato.ac.nz/ml/weka/

CO-PO Mapping
Programme Outcomes (PO) PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 1
CO2 3 2
CO3 2 3
CO4 3 3
The strength of mapping is to be written as 1,2,3; where, 1: Low, 2: Medium, 3: High
Each CO of the course must map to at least one PO, and preferably to only one PO.

Assessment
There are three components of lab assessment, LA1, LA2 and Lab ESE.
IMP: Lab ESE is a separate head of passing.(min 40 %), LA1+LA2 should be min 40%
Assessment Based on Conducted by Typical Schedule Marks
Lab activities, During Week 1 to Week 8
LA1 attendance, Lab Course Faculty Marks Submission at the end of 30
journal Week 8
Lab activities, During Week 9 to Week 16
LA2 attendance, Lab Course Faculty Marks Submission at the end of 30
journal Week 16
Lab activities, Lab Course Faculty and During Week 18 to Week 19
Lab ESE journal/ External Examiner as Marks Submission at the end of 40
performance applicable Week 19
Week 1 indicates starting week of a semester. Lab activities/Lab performance shall include performing
experiments, mini-project, presentations, drawings, programming, and other suitable activities, as per the
nature and requirement of the lab course. The experimental lab shall have typically 8-10 experiments and
related activities if any.

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Walchand College of Engineering, Sangli
(Government Aided Autonomous Institute)
AY 2022-23
Course Information
Programme B. Tech. (Computer Science and Engineering)
Class, Semester Final Year B. Tech., Sem VII
Course Code 5OE471
Course Name Open Elective 5: Cyber Security
Desired Requisites:

Teaching Scheme Examination Scheme (Marks)

Lecture 3 Hrs/week MSE ISE ESE Total
Tutorial - 30 20 50 100
Credits: 3

Course Objectives
Exhibit knowledge to secure corrupted systems, protect personal data, and secure computer
1
networks in an Organization
2 Develop cyber security strategies and policies
Understand principles of web security and to guarantee a secure network by monitoring and
3
analyzing the nature of attacks through cyber/computer forensics software/tools.
Course Outcomes (CO) with Bloom’s Taxonomy Level
At the end of the course, the students will be able to,
Bloom’s Bloom’s
CO Course Outcome Statement/s Taxonomy Taxonomy
Level Description
CO1 Understand the concepts of cyber security and data privacy in Understand
II
today’s environment.
CO2 Perform fundamental incident response functions including Apply
III
detecting, responding, and recovering from security incidents.
CO3 Analyze and resolve security issues in networks and computer Analyze
IV
systems to secure an IT infrastructure
CO4 Evaluate and communicate the human role in security systems with Evaluate
an emphasis on ethics, social engineering vulnerabilities and V
training.
CO5 Design appropriate security technologies and policies to protect Create
VI
computers and digital information.

Module Module Contents Hours

Introduction to Cyber Space
Internet Architecture and the Protocol Layers- Basics of Internet, Layered
I architecture, OSI Reference Model, Protocol Data Unit(PDU), TCP/IP Model, 7
IP addressing, Layers of security, Cyber Crime, Information Security, CIA
Triad, Computer Ethics & Security Policies.
Web Browsers and Email Security
II Basics of Cryptography, Guidelines to choose Web Browsers, Security 7
measures for using Web Browsers, Antivirus, Email Security, IDS, Firewall.
Social Media and basic Windows Security
Guidelines for Social Media Security, Tips & best practices for Safer Social
III 6
Media Networking, Best Security Practices for Windows Desktops & Laptops,
Guidelines for generation of User Accounts & Passwords, Wi-Fi Security.
Smartphone Security
Introduction to Mobile Devices, Security Techniques for using Mobile
IV 6
Devices, Best Security Practices for Android Devices, Best Security Practices
for IOS Devices.
Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Online Banking, Credit Card & UPI Security, POS & ATM Security
Online Banking Security Techniques, Mobile Banking Security Techniques,
V
Security for Debit & Credit Cards, UPI & e-Wallet Security Guidelines, 7
Security for using Micro-ATMs & POS (Point of Sales).
Cyber Security Initiatives in India
Counter Cyber Security Initiatives in India, Cyber Security Incident Handling,
Information Destroying and Recovery Tools- Recovering from Information
VI
Loss, Destroying Sensitive Information, CCleaner for Windows, How Cyber 7
Criminal Works & Cyber Laws, IT ACT & how to prevent yourself from being
a victim of Cyber Crime, Cybercrime: Examples and Mini-Cases.

Textbooks
Nina Godbole and Sunit Belpure, “Cyber Security Understanding Cyber Crimes, Computer
1
Forensics and Legal Perspectives”, Wiley
B. B. Gupta, D. P. Agrawal, Haoxiang Wang, “Computer and Cyber Security: Principles,
2
Algorithm, Applications, and Perspectives”, CRC Press, ISBN 9780815371335, 2018

References
1 “Cyber Security Essentials”, James Graham, Richard Howard and Ryan Otson, CRC Press

Useful Links
1 https://onlinecourses.swayam2.ac.in/ugc19_hs25/preview m2.ac.in
2 https://www.classcentral.com/course/swayam-introduction-to-cyber-security-14116
3 https://www.youtube.com/watch?v=AU3sdN-ZPCQ

CO-PO Mapping
Programme Outcomes (PO) PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 3 2
CO2 3 2 3
CO3 3 3 3 3
CO4 2 3 3 1
CO5 3 2
The strength of mapping is to be written as 1: Low, 2: Medium, 3: High
Each CO of the course must map to at least one PO.

Assessment
The assessment is based on MSE, ISE and ESE.
MSE shall be typically on modules 1 to 3.
ISE shall be taken throughout the semester in the form of teacher’s assessment. Mode of assessment can
be field visit, assignments etc. and is expected to map at least one higher order PO.
ESE shall be on all modules with around 40% weightage on modules 1 to 3 and 60% weightage on
modules 4 to 6.
For passing a theory course, Min. 40% marks in (MSE+ISE+ESE) are needed and Min. 40% marks in
ESE are needed. (ESE shall be a separate head of passing)

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Walchand College of Engineering, Sangli
(Government Aided Autonomous Institute)
AY 2022-23
Course Information
Programme B.Tech. (Computer Science and Engineering)
Class, Semester Final Year B. Tech., Sem VIII
Course Code 5CS421
Course Name Industry Course : Data Management, Protection and Governance (By
Veritas)
Desired Requisites:

Teaching Scheme Examination Scheme (Marks)

Lecture 3 Hrs/week MSE ISE ESE Total
Tutorial - 30 20 50 100
Credits: 3

Course Objectives
1 Get acquainted with the high-level phases of data life cycle management.
2 Acquire knowledge about the various aspects of data storage, data availability, data protection.
3 Gain exposure to various solutions/reference architectures for various use-cases.
4 Understand the technical capabilities and business benefits of data protection.
Course Outcomes (CO) with Bloom’s Taxonomy Level
At the end of the course, the students will be able to,
Bloom’s Bloom’s
CO Course Outcome Statement/s Taxonomy Taxonomy
Level Description
CO1 Illustrate data management world and various types of data threats Understand
II
and approaches to ensure data center security.
CO2 Apply different standards for compliance and governance of data. III Apply
CO3 Analyze various types of data threats and approaches to ensure data Analyze
IV
centre security.
CO4 Discriminate various concepts and technologies for enabling data Evaluate
V
storage and high availability
CO5 Design data intensive enterprise applications and industry standard Create
VI
solutions in data management.

Module Module Contents Hours

Introduction to data life cycle management (DLM)
Goals of data life cycle management, Challenges involved- Volume of data
I source, Ubiquity of data locations, User demand for access, Stages of data life 4
cycle – creation, storage, usage, archival, destruction, Risks involved without
DLM, benefits, best practices.
Data storage and data availability
Storage technology: Hard Disk Device (HDD), Solid State Devices (SSD),
memory devices, Data access - block, files, object, Data center End to End
View – overview of complete stack including storage, network, host, cluster,
applications, virtual machines, cloud storage, Storage virtualization
technologies - RAID level, storage pooling, storage provisioning, Advance
II 8
topics in storage virtualization – storage provisioning, thin provisioning, Cloud
storage – S3, glacier, storage tiering, High Availability-Introduction to high
availability, clustering, failover, parallel access, Disaster Recovery -Need of
disaster recovery, Building blocks - global cluster, wide-area-connector
(WAC), heartbeat,
Split-brain – problem and solutions , Preparing for DR – firedrill.

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Data Threats and Data center security
Type of Threats-Denial of Service (DoS), man in the middle attacks,
Unintentional data loss, Repudiation, Malicious attacks to steal data,
III Understanding, Identification and Threat modelling tools, Introduction to 7
Ransomware, Security- Authorization and authentication - access control,
Transport Layer Security (TLS), key management, security in cloud,
Design and architecture considerations for security.
Introduction to data protection
Introduction-Need for data protection, basic of back-up/restore, Snapshots for
data protection, copy-data management (cloning, DevOps), De- duplication,
IV Replication, Long Term Retention – LTR, Archival, Design considerations- 8
System recovery, Solution architecture, Backup v/s Archival, media
considerations and management (tapes, disks, cloud),
challenges with new edge technology (cloud, containers).
Data regulation, compliance and governance
Regulations requirements and Privacy Regulations-General Data Protection
Regulation (GDPR), The Health Insurance Portability and Privacy Act of 1996
V 5
(HIPPA), PII (Personal Identity Information), Information Governance-
Auditing, Legal Hold, Data classification and
tagging (Natural Language Processing).
Applications uninterrupted
Understand data management aspects of traditional and new edge applications,
Reference architecture/best practices (pick 2-3 case studies from below topics)-
Transactional Databases (Oracle, MySQL, DB2), NoSQL Databases
VI 7
(MongoDB, Cassandra), Distributed applications (micro service architectures),
Cloud applications – Platform as Service (PaaS), Software as Service (SaaS),
Kubernetes, Multi-Tiered applications, ETL workloads, Data analytics
(AI/ML).

Textbooks
1 Robert Spalding, “Storage Networks: The complete Reference” Tata McGraw-Hill
Vic (J.R.) Winkler, “Securing The Cloud: Cloud Computing Security Techniques and Tactics”
2
(Syngress/Elsevier) - 978-1-59749-592-9.
3 TBD – online reference for each topic.

References
1 “Designing Data-Intensive Applications ” (O’Reilly, Martin Kleppmann).
TBD: provide more online material details and books (This can include some publicly
2
available white-paper, solution guides etc.)

Useful Links
1 https://www.enterprisestorageforum.com/storage-hardware/storage-virtualization.html
2 https://www.hitechnectar.com/blogs/three-goals-data-lifecycle-management/
3 https://www.bmc.com/blogs/data-lifecycle-management/
4 https://www.dataworks.ie/5-stages-in-the-data-management-lifecycle-process/

CO-PO Mapping
Programme Outcomes (PO) PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 2
CO2 3 3
CO3 3 2 3
CO4 3 1
CO5 3
The strength of mapping is to be written as 1: Low, 2: Medium, 3: High
Each CO of the course must map to at least one PO.
Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Assessment
The assessment is based on MSE, ISE and ESE.
MSE shall be typically on modules 1 to 3.
ISE shall be taken throughout the semester in the form of teacher’s assessment. Mode of assessment can
be field visit, assignments etc. and is expected to map at least one higher order PO.
ESE shall be on all modules with around 40% weightage on modules 1 to 3 and 60% weightage on
modules 4 to 6.
For passing a theory course, Min. 40% marks in (MSE+ISE+ESE) are needed and Min. 40% marks in
ESE are needed. (ESE shall be a separate head of passing)

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Walchand College of Engineering, Sangli
(Government Aided Autonomous Institute)
AY 2022-23
Course Information
Programme B.Tech. (Computer Science and engineering)
Class, Semester Final Year B. Tech., Sem VIII
Course Code 5CS492
Course Name Project-II
Desired Requisites: Nil

Teaching Scheme Examination Scheme (Marks)

Practical 12 Hrs/ week LA1 LA2 Lab ESE Total
Interaction - 30 30 40 100
Credits: 6

Course Objectives
1 To experience project management principles to become IT industry savvy.
2 To utilize state of the art CASE tools especially for design, development and testing phases.
3 To acquaint the ability to map technical skills to real life applications from customers perspective.
4 To practice of specifying & using artifacts as per quality standards.
Course Outcomes (CO) with Bloom’s Taxonomy Level
At the end of the course, the students will be able to,
Bloom’s Bloom’s
CO Course Outcome Statement/s Taxonomy Taxonomy
Level Description
CO1 demonstrate the state-of-art technological trends through Apply
III
planning and design project aspects.
CO2 adopt agile methodology and mature team skills through various Evaluate
V
SDLC phases.
CO3 showcase the project with real life use case mainly to potential Create
VI
customers.
CO4 analyse performance of developed product and write/publish Analyse
IV
technical artifacts

List of Experiments / Lab Activities/Topics

List of Topics(Applicable for Interaction mode ):

List of Lab Activities:

1. Preferably project work is to be continued from Project-I

2. Students should maintain a project log book containing weekly progress of the project
3. At the end of the semester project group should achieve all the proposed objectives of the
problem statement.
4. The work should be completed in all aspects of design, implementation and testing.
5. Project report and technical artifacts should be prepared, submitted in soft and hard form
along with all the code and datasets.
6. Group should demonstrate the work with various test cases and results obtained and explain
future scope.
7. The group should participate in technical symposiums, paper presentations to demonstrate their
work and findings in technical community.

Textbooks
1 Nil

References
1 Nil

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Useful Links
1

CO-PO Mapping
Programme Outcomes (PO) PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 -- -- -- -- -- -- -- 3 2 -- -- -- -- --
CO2 -- -- -- -- 3 -- -- -- 2 3 -- -- -- --
CO3 -- -- 2 3 -- -- -- -- -- -- 2 -- -- --
CO4 -- -- -- -- 2 -- -- -- 2 -- -- -- -- --
The strength of mapping is to be written as 1,2,3; where, 1: Low, 2: Medium, 3: High
Each CO of the course must map to at least one PO, and preferably to only one PO.

Assessment
There are three components of lab assessment, LA1, LA2 and Lab ESE.
IMP: Lab ESE is a separate head of passing.(min 40 %), LA1+LA2 should be min 40%
Assessment Based on Conducted by Typical Schedule Marks
Lab activities, During Week 1 to Week 8
LA1 attendance, Lab Course Faculty Marks Submission at the end of 30
journal Week 8
Lab activities, During Week 9 to Week 16
LA2 attendance, Lab Course Faculty Marks Submission at the end of 30
journal Week 16
Lab activities, Lab Course Faculty and During Week 18 to Week 19
Lab ESE journal/ External Examiner as Marks Submission at the end of 40
performance applicable Week 19
Week 1 indicates starting week of a semester. Lab activities/Lab performance shall include performing
experiments, mini-project, presentations, drawings, programming, and other suitable activities, as per the
nature and requirement of the lab course. The experimental lab shall have typically 8-10 experiments and
related activities if any.

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Walchand College of Engineering, Sangli
(Government Aided Autonomous Institute)
AY 2022-23
Course Information
Programme B.Tech. (Computer Science and Engineering)
Class, Semester Final Year B. Tech., Sem VIII
Course Code 5CS431
Course Name Elective-7:Search Engine Design and Optimization
Desired Requisites: Programming Laboratory – 3

Teaching Scheme Examination Scheme (Marks)

Lecture 3 Hrs/week MSE ISE ESE Total
Tutorial - 30 20 50 100
Credits: 3

Course Objectives
To inculcate understanding of detailed functions of search engines and different SEO
1
techniques.
2 To illustrate working of different search engine designs and different SEO techniques.
3 To emphasize on optimizing design of search engines and use of SEO techniques.
Course Outcomes (CO) with Bloom’s Taxonomy Level
At the end of the course, the students will be able to,
Bloom’s Bloom’s
CO Course Outcome Statement/s Taxonomy Taxonomy
Level Description
CO1 describe working of search engines and SEO techniques II Understand
CO2 illustrate various SEO techniques and use SEO tools III Apply
CO3 comprehend strengths and weaknesses of SEO techniques and use Analyze
appropriate SEO technique as per real life scenario and analyze the
IV
performance of a website on a search engine using tools and
analytical data

Module Module Contents Hours

Search Engines and SEO Overview
SEO – What is it, History, Evolution and Importance, Types of SEO
I Techniques, How Search Engines Work, SERP, Google Search Engine 5
Architecture and Algorithm, How Machine Learning in Search Works, Panda
Update, Other advanced Search Engine algorithms
Keyword Research and Analysis
What is keyword, Importance of Keyword, Keyword Phrases and Keyword
II Length, Keyword-Value Pyramid, where to start, Keyword Density, Finding 6
Keywords, Keyword Selection Tips, Common
Keyword Problems and Solutions, Keyword Analysis Tools
On-page Optimization Techniques
The difference – On-page and Off-page optimization,
On-page Optimization Techniques - The Page Title, Meta Descriptions & Meta
III Keywords, Headings, Bold Text, Domain Names & Suggestions, Canonical 9
Tag, Meta Tags, Images and Alt Text, Internal Link Building, The Sitemap,
Invisible Text, Server and Hosting Check, Robots Meta
Tag, Doorway Pages, 301 Redirects, 404 Error, Duplicate content

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Off-page Optimization Techniques
Local marketing of websites on the basis of locations, Social Media
optimization techniques, Introduction of link building and its types, Directory
submission, Blog and article submission, Forum posting, Forum signatures and
commenting, Free classifieds, Classifieds posting, Press release submission,
Video submission, Business listing submission, Guest blog, Detail knowledge
IV on Link building and backlinks, Social bookmarking, Photo & Video Sharing, 7
Infographics sharing, Document Sharing, Content Marketing and its
importance, Question and answers, Web 2.0 submission, Importance of
backlinks / Link building, Home page promoting tips and techniques,
Strategies to build qualitative and relevant backlinks, Competitors backlink
research and submission. Tracking the links, Submission to do follow websites,
RSS Feed submissions.
User Interface, Local and Social Media SEO
UX/UI, SEO and UX/UI, Best Practices.
Local SEO and its importance, Local Searches, NAP, Directories, Top Local
V 6
Search Signals, Reviews and Feedback.
Introduction to Social Media SEO and their importance, Social Media Impact
on SEO, Social Media and Local SEO.
SEO Tools, Reporting and Tracking
Keyword Research Tools, On-page SEO Tools, Link Building Tools,
VI 6
Technical SEO Tools, Rank Tracking Tools, Analytics Tools, and Local SEO
Tools.

Textbooks
Jessie Stricchiola, Stephan Spencer, Eric Enge, “The Art of SEO - Mastering Search Engine
1
Optimization”.
2 Moz, “Beginner's Guide to SEO”.

References
1 Adam Clarke, “SEO 2021: Learn search engine optimization with smart internet marketing”

Useful Links
1 https://analytics.google.com/analytics/academy/course/6

CO-PO Mapping
Programme Outcomes (PO) PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 1 1
CO2 2 2 3 2
CO3 3 2 3 2 1
The strength of mapping is to be written as 1: Low, 2: Medium, 3: High
Each CO of the course must map to at least one PO.

Assessment
The assessment is based on MSE, ISE and ESE.
MSE shall be typically on modules 1 to 3.
ISE shall be taken throughout the semester in the form of teacher’s assessment. Mode of assessment can
be field visit, assignments etc. and is expected to map at least one higher order PO.
ESE shall be on all modules with around 40% weightage on modules 1 to 3 and 60% weightage on
modules 4 to 6.
For passing a theory course, Min. 40% marks in (MSE+ISE+ESE) are needed and Min. 40% marks in
ESE are needed. (ESE shall be a separate head of passing)

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Walchand College of Engineering, Sangli
(Government Aided Autonomous Institute)
AY 2022-23
Course Information
Programme B.Tech. (Computer Science and Engineering)
Class, Semester Final Year B. Tech., Sem VIII
Course Code 5CS432
Course Name Elective-7: Computer Forensic
Desired Requisites: Cyber Security

Teaching Scheme Examination Scheme (Marks)

Lecture 3 Hrs/week MSE ISE ESE Total
Tutorial - 30 20 50 100
Credits: 3

Course Objectives
To understand the basic digital forensics and techniques for conducting the forensic examination
1
on different digital devices.
2 To understand how to examine digital evidence such as data acquisition, identification analysis.
3 To understand cyber related crimes and various investigative strategies
4 To understand various data storage methods, formats and computer forensic tools
Course Outcomes (CO) with Bloom’s Taxonomy Level
At the end of the course, the students will be able to,
Bloom’s Bloom’s
CO Course Outcome Statement/s Taxonomy Taxonomy
Level Description
CO1 Apply the methods for data recovery, evidence collection and data
III Applying
seizure.
CO2 Analyze a large amount of digital evidence and identify the most
IV Analysing
significant data.
CO3 Evaluate the different types of computer forensics technologies V Evaluating
CO4 Apply a number of different computer forensic tools to a given
III Applying
scenario.

Module Module Contents Hours

Introduction
Computer forensics fundamentals, Benefits of forensics, computer 6
I
crimes, computer forensics evidence and courts, legal concerns and
private issues.
Understanding Computing Investigations
II Procedure for corporate High-Tech investigations, understanding data 6
recovery workstation and software, conducting investigations.
Methods of Storing Data
Understanding the binary number system & Conversions, Encoding and
Decoding formats, Methods of storing data, Computer Memory,
III 6
Development of hard disk, physical construction, CHS & LBA
addressing, Understanding file system and file formats, Cloud storage
and forensics.

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-
23
 Storage Formats and Digital Evidence
Data acquisition- understanding storage formats and digital evidence,
IV determining the best acquisition method, acquisition tools, validating 7
data acquisitions, performing RAID data acquisitions, remote network
acquisition tools, other forensics acquisitions tools.
Cyber Crime and Incident Response
Processing crimes and incident scenes, securing a computer incident or
V 6
crime, seizing digital evidence at scene, storing digital evidence,
obtaining digital hash, reviewing case.
Computer Forensics Tools
Software, hardware tools, validating and testing forensic software,
VI addressing data-hiding techniques, performing remote acquisitions, E- 8
Mail investigations- investigating email crime and violations,
understanding E-Mail servers, Specialized E-Mail forensics tool.

Textbooks
Warren G. Kruse II and Jay G. Heiser, “Computer Forensics: Incident Response
1
Essentials”, Addison Wesley
B Nelson, B, Phillips, A, Enfinger, F, Stuart, C., “Guide to Computer Forensics and
2
Investigations”, 2nd ed., Thomson Course Technology
3
4

References
Vacca, J, “Computer Forensics, Computer Crime Scene Investigation”, 2nd Ed, Charles
1
River Media, ISBN: 1-58450-38
2
3
4

Useful Links
1
2
3
4

CO-PO Mapping
Programme Outcomes (PO) PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 3 2 2
CO2 1 1 2 3
CO3 3 3 2 3
CO4 3 2 3 2 1
The strength of mapping is to be written as 1: Low, 2: Medium, 3: High
Each CO of the course must map to at least one PO.

Assessment

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-
23
The assessment is based on MSE, ISE and ESE.
MSE shall be typically on modules 1 to 3.
ISE shall be taken throughout the semester in the form of teacher’s assessment. Mode of assessment can
be field visit, assignments etc. and is expected to map at least one higher order PO.
ESE shall be on all modules with around 40% weightage on modules 1 to 3 and 60% weightage on
modules 4 to 6.
For passing a theory course, Min. 40% marks in (MSE+ISE+ESE) are needed and Min. 40% marks in
ESE are needed. (ESE shall be a separate head of passing)

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-
23
 Walchand College of Engineering, Sangli
(Government Aided Autonomous Institute)
AY 2022-23
Course Information
Programme B.Tech. (Computer Science and Engineering)
Class, Semester Final Year B. Tech., Sem VIII
Course Code 5CS433
Course Name Elective-8: Human Computer Interaction
Desired Requisites: Nil

Teaching Scheme Examination Scheme (Marks)

Lecture 3 Hrs/week MSE ISE ESE Total
Tutorial - 30 20 50 100
Credits: 3

Course Objectives
1 To inculcate understanding of detailed functions of HCI and different HCI techniques.
2 To illustrate working of different HCI designs and different HCI techniques.
3 To emphasize on HCI evaluation and Implementation techniques.
Course Outcomes (CO) with Bloom’s Taxonomy Level
At the end of the course, the students will be able to,
Bloom’s Bloom’s
CO Course Outcome Statement/s Taxonomy Taxonomy
Level Description
CO1 Describe working of HCI and HCI basics. II Understand
CO2 Illustrate various HCI design principals. III Apply
CO3 Comprehend strengths and weaknesses of HCI design techniques Analyze
IV
and use appropriate HCI technique as per real life.

Module Module Contents Hours

Foundations of Human–Computer Interaction

What is HCI – design, models, evaluation, Need to understand people,

computers and methods. Basic human abilities - vision, hearing, touch,
memory. Computers – speed, interfaces, widgets, and effects on interaction.
I 07
Humans – Memory, Attention Span, Visual Perception, psychology,
ergonomics. Understanding Users. Methods for evaluation of interfaces with
users: goals of evaluation, approaches, ethics, introspection, extracting the
conceptual model, direct observation, constructive interaction, interviews and
questionnaires, continuous evaluation via user feedback and field studies,
choosing an evaluation method.

The Design Process

Interaction Design Basics, Interaction Styles. HCI in the Software Process.

II 06
HCI design principles and rules: design principles, principles to support
usability, golden rules and heuristics, HCI patterns, design rules, HCI design
standards. Universal Design, User-centered design, task analysis/GOMS,
Graphic Design, Real life scenario study in design process.
Implementation
Implementation Tools, Technology and change designing for the Web,
III designing for portable devices. Handling errors and Designing Help. 07
Prototyping and UI Software. Real life scenario study in implementation
process.
Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Evaluation and User Support
Evaluation of User Interfaces. Web Browsers - Fonts, Color Palette, Color
IV Depth, Resolution, Layout, Size, Orientation. Mobile devices issues – design, 07
limitations, what next. User Support, Real life scenario study in
implementation process.

Users Models

V Predictive Models, Cognitive Models. Interaction with Natural Languages, 06

Next Generation Interface. Socio-organizational Issues and Stakeholder
Requirements. Heuristic Evaluation, Evaluation with Cognitive Models,
Evaluation with Users, Real life scenario study in implementation process.
Case Study of Modern Systems
VI Group ware, Virtual Reality, Augmented Reality, Hypertext, Multimedia and 06
World Wide web, GUI design for a mobile phone based Matrimonial
application during emergency.

Textbooks
Alan J, Dix. Janet Finlay, Rusell Beale, "Human Computer Interaction", Pearson Education,
1
3rd Edition, 2004, ISBN 81-297-0409-9
Jenny Preece, Rogers, Sharp, “Interaction Design-beyond human-computer interaction”,
2
WILEY-INDIA, ISBN 81-265-0393-9

References
Jonathan Lazar, Jinjuan Feng, Harry Hochheiser, “Research Methods in Human-Computer
1
Interaction", Third Edition, Morgan Kaufmann, 2017, ISBN: 9780128053904.
Mary Beth Rosson and John M. Carroll, “Usability Engineering: Scenario-Based Development
2
of Human-Computer Interaction”, Morgan Kaufmann, 2001, ISBN-13: 978- 1558607125

Useful Links
1 https://nptel.ac.in/courses/106/103/106103115/
2 https://www.coursera.org/learn/human-computer-interaction

CO-PO Mapping
Programme Outcomes (PO) PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 1 1
CO2 2 2 3 2
CO3 3 2 3 2 1
The strength of mapping is to be written as 1: Low, 2: Medium, 3: High
Each CO of the course must map to at least one PO.

Assessment
The assessment is based on MSE, ISE and ESE.
MSE shall be typically on modules 1 to 3.
ISE shall be taken throughout the semester in the form of teacher’s assessment. Mode of assessment can
be field visit, assignments etc. and is expected to map at least one higher order PO.
ESE shall be on all modules with around 40% weightage on modules 1 to 3 and 60% weightage on
modules 4 to 6.
For passing a theory course, Min. 40% marks in (MSE+ISE+ESE) are needed and Min. 40% marks in
ESE are needed. (ESE shall be a separate head of passing)

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Walchand College of Engineering, Sangli
(Government Aided Autonomous Institute)
AY 2022-23
Course Information
Programme B.Tech. (Computer Science and Engineering)
Class, Semester Final Year B. Tech., Sem VIII
Course Code 5CS434
Course Name Elective-8: MOOC Course on Social Networks
Desired Requisites: Discrete Mathematics and Linear Algebra, Programming and
Algorithms

Teaching Scheme Examination Scheme (Marks)

Lecture 3 Hrs/week MSE ISE ESE Total
Tutorial - 30 20 50 100
Credits: 3

Course Objectives
1 To provide knowledge of the basics of social networks.
2 To describe various social network algorithms.
To demonstrate social network analysis applicable to real world data, with examples from today’s
3
most popular social networks
4 To understand real world problems for social network
Course Outcomes (CO) with Bloom’s Taxonomy Level
At the end of the course, the students will be able to,
Bloom’s Bloom’s
CO Course Outcome Statement/s Taxonomy Taxonomy
Level Description
CO1 Describe basic characteristics of social network and social network Understand
II
analysis
CO2 Illustrate different social network analyzing algorithms and Apply,Analy
III, IV
concepts ze
CO3 Evaluate different social networks with the help of real time datasets V Evaluate
CO4 Create social network for real world problems VI Create

Module Module Contents Hours

Introduction
Introduction to networkx, challenges of social networks, Searching in a
I 8
network, link prediction, the contagions, Importance of acquaintances,
marketing on social networks, handling real world network datasets.
Strength of weak ties and homophily
Granovetter’s Strength of weak ties, Triads, Clustering coefficient and
II neighborhood overlap, Structure of weak ties bridges and local bridges, 6
Embedeness, structural holes, Social capital, Finding communities in a graph,
Foci closure membership closure.
Positive negative relationships and link analysis
Structural balance, Characterising the structure of a balanced network, Balance
III theorem and its proof, Introduction to positive and negative edges, the web 6
graph, collecting the web graph, equal coin distribution, random coin dropping,
Introduction to hubs and authorities.
Cascading Behaviors in networks
IV Diffusion in networks, modelling diffusion, impact of communities on 6
diffusion, Cascade and clusters.

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Richer get richer phenomenon
Introduction to powerlaw, detection of powerlaw, forced vs random removal of
V 7
nodes, richer ger richer phenomenon, epidemics, spreading models, percolation
models.
Small world effect
VI Small world effect, milgram’s experiment, Generative model and decentralised 7
search, how to go viral on web.

Textbooks
Matthew A. Russell. Mining the Social Web: Data Mining Facebook, Twitter, Linkedin,
1
Google+, Github, and More, 2nd Edition, O'Reilly Media, 2013.
2 Jennifer Golbeck, Analyzing the social web, Morgan Kaufmann, 2013.

References
1 Charu Aggarwal (ed.), Social Network Data Analytics, Springer, 2011.

Useful Links
1 https://nptel.ac.in/courses/106106169
2 http://cse.iitkgp.ac.in/~pawang/courses/SC16.html

CO-PO Mapping
Programme Outcomes (PO) PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 1 2
CO2 1 3
CO3 3 3 3
CO4 2 1
The strength of mapping is to be written as 1: Low, 2: Medium, 3: High
Each CO of the course must map to at least one PO.

Assessment
The assessment is based on MSE, ISE and ESE.
MSE shall be typically on modules 1 to 3.
ISE shall be taken throughout the semester in the form of teacher’s assessment. Mode of assessment can
be field visit, assignments etc. and is expected to map at least one higher order PO.
ESE shall be on all modules with around 40% weightage on modules 1 to 3 and 60% weightage on
modules 4 to 6.
For passing a theory course, Min. 40% marks in (MSE+ISE+ESE) are needed and Min. 40% marks in
ESE are needed. (ESE shall be a separate head of passing)

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Walchand College of Engineering, Sangli
(Government Aided Autonomous Institute)
AY 2022-23
Course Information
Programme B.Tech. (Computer Science and Engineering)
Class, Semester Final Year B. Tech., Sem VIII
Course Code 5CS435
Course Name Elective-8: MOOC Course on Virtual Reality
Desired Requisites: Nil

Teaching Scheme Examination Scheme (Marks)

Lecture 3 Hrs/week MSE ISE ESE Total
Tutorial - 30 20 50 100
Credits: 3

Course Objectives
1 To inculcate understanding of detailed functions of VR and different VR techniques
2 To illustrate working of different VR designs and different VR techniques
3 To emphasize on VR evaluation and Implementation techniques
Course Outcomes (CO) with Bloom’s Taxonomy Level
At the end of the course, the students will be able to,
Bloom’s Bloom’s
CO Course Outcome Statement/s Taxonomy Taxonomy
Level Description
CO1 Describe working of VR and VR basics. II Understand
CO2 Illustrate various VR design principals III Apply
CO3 Comprehend strengths and weaknesses of VR design techniques and Analyze
IV
use appropriate VR technique as per real life
CO4

Module Module Contents Hours

Introduction
Course mechanics, Goals and VR definitions, Historical perspective, Birds-eye
I 4
view (general), Birds-eye view (general), Birds-eye view (hardware), Birds-
eye view (software) 8. Birds-eye view (sensation and perception)
Geometry of Virtual Worlds
Geometric modeling, Transforming models, Matrix algebra and 2D rotations,
3D rotations and yaw, pitch, and roll, 3D rotations and yaw, pitch, and roll,
II contd, Axis-angle representations, Quaternions, Converting and multiplying 5
rotations, Converting and multiplying rotations, contd, Homogeneous
transforms, The chain of viewing transforms, Eye transforms, Canonical view
transform, Viewport transform
Light and Optics
III Three interpretations of light, Refraction, Simple lenses, Diopters, Optical 5
system of eyes
Visual Physiology
IV 4
Photoreceptors, Sufficient resolution for VR, Light intensity, Eye movements
Visual Perception
V Depth perception, Depth perception, Motion perception, Frame rates and 4
displays, Frame rates and displays
Tracking Systems
VI Overview, Orientation tracking, Tilt drift correction, Tracking with a camera, 4
Perspective n-point problem, Filtering

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Textbooks
Doug A. Bowman,Ernst Kruijff, Joseph J. LaViola, and Ivan Poupyrev, 3D User Interfaces,
1
AddisonWesley, 2005
K.S. Hale and K. M.Stanney, Handbook on Virtual Environments, 2nd edition, CRC Press,
2
2015

References
1 George Mather, Foundations of Sensation and Perception:Psychology Press; 2 edition, 2009
Peter Shirley, MichaelAshikhmin, and Steve Marschner, Fundamentals of Computer
2
Graphics,A K Peters/CRC Press; 3 edition, 2009

Useful Links
1 http://msl.cs.uiuc.edu/vr/
2 http://nptel.iitm.ac.in/

CO-PO Mapping
Programme Outcomes (PO) PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 1 1
CO2 2 2 3 2
CO3 3 2 3 2 1
The strength of mapping is to be written as 1: Low, 2: Medium, 3: High
Each CO of the course must map to at least one PO.

Assessment
The assessment is based on MSE, ISE and ESE.
MSE shall be typically on modules 1 to 3.
ISE shall be taken throughout the semester in the form of teacher’s assessment. Mode of assessment can
be field visit, assignments etc. and is expected to map at least one higher order PO.
ESE shall be on all modules with around 40% weightage on modules 1 to 3 and 60% weightage on
modules 4 to 6.
For passing a theory course, Min. 40% marks in (MSE+ISE+ESE) are needed and Min. 40% marks in
ESE are needed. (ESE shall be a separate head of passing)

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Walchand College of Engineering, Sangli
(Government Aided Autonomous Institute)
AY 2022-23
Course Information
Programme B.Tech. (Computer Science and Engineering)
Class, Semester Final Year B. Tech., Sem VIII
Course Code 5CS436
Course Name Elective-8: MOOC Course on Blockchain and Its applications
Desired Requisites: Computer Networks; Operating Systems; Cryptography and Network
Security.

Teaching Scheme Examination Scheme (Marks)

Lecture 3 Hrs/week MSE ISE ESE Total
Tutorial - 30 20 50 100
Credits: 3

Course Objectives
1 Inculcate how blockchain systems (mainly Bitcoin and Ethereum) work,
2 Illustrate process of Design, build, and deploy smart contracts and distributed applications,
3 Inculcate how to Integrate ideas from blockchain technology into their own projects.
Course Outcomes (CO) with Bloom’s Taxonomy Level
At the end of the course, the students will be able to,
Bloom’s Bloom’s
CO Course Outcome Statement/s Taxonomy Taxonomy
Level Description
CO1 Describe basic principles of Blockchain II Understand
CO2 Illustrate the different techniques used in Blockchain III Apply
CO3 Analyse different Designs, security, privacy, and efficiency of a Analyse
IV
given blockchain system.
CO4

Module Module Contents Hours

I Introduction to Blockchain Technology and its Importance 4
Basic Crypto Primitives
II 7
Cryptographic Hash, Digital Signature
III Evolution of the Blockchain Technology, Elements of a Blockchain 8
Blockchain Consensus
IV 7
Permissionless Models, Permissioned Models
Smart Contract Hands On and Decentralized Identity Management
V Ethereum Smart Contracts (Permissionless Model), Hyperledger Fabric 8
(Permissioned Model)
VI Blockchain Interoperability and Applications 5

Textbooks
Mastering Blockchain: A deep dive into distributed ledgers, consensus protocols, smart
contracts, DApps, cryptocurrencies, Ethereum, and more, 3rd Edition, Imran Bashir, Packt
1
Publishing, 2020, ISBN: 9781839213199, book website:
https://www.packtpub.com/product/mastering-blockchain-third-edition/9781839213199

References
1 NPTEL course on Blockchain and its applications
2 Hyperledger Tutorials - https://www.hyperledger.org/use/tutorials
3 Ethereum Development Resources - https://ethereum.org/en/developers

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Useful Links
1 https://onlinecourses.nptel.ac.in/noc22_cs44/preview

CO-PO Mapping
Programme Outcomes (PO) PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 1
CO2 1 1
CO3 2 1
The strength of mapping is to be written as 1: Low, 2: Medium, 3: High
Each CO of the course must map to at least one PO.

Assessment
The assessment is based on MSE, ISE and ESE.
MSE shall be typically on modules 1 to 3.
ISE shall be taken throughout the semester in the form of teacher’s assessment. Mode of assessment can
be field visit, assignments etc. and is expected to map at least one higher order PO.
ESE shall be on all modules with around 40% weightage on modules 1 to 3 and 60% weightage on
modules 4 to 6.
For passing a theory course, Min. 40% marks in (MSE+ISE+ESE) are needed and Min. 40% marks in
ESE are needed. (ESE shall be a separate head of passing)

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Walchand College of Engineering, Sangli
(Government Aided Autonomous Institute)
AY 2022-23
Course Information
Programme B.Tech. (Computer Science and Engineering)
Class, Semester Final Year B. Tech., Sem VIII
Course Code 5CS437
Course Name Elective 8 : MOOC Course on Computing: Introduction to parallel
programming with OpenMP and MPI
Desired Requisites: Programming in C.

Teaching Scheme Examination Scheme (Marks)

Lecture 3 Hrs/week MSE ISE ESE Total
Tutorial - 30 20 50 100
Credits: 3

Course Objectives
To introduce concepts & programming principles involved in developing scalable parallel
1
applications
To apply knowledge of writing scalable programs for multi-core architectures using OpenMP and
2
C.
3 To analyze parallel architecture and discuss the performance metrics of HPC programs.
Course Outcomes (CO) with Bloom’s Taxonomy Level
At the end of the course, the students will be able to,
Bloom’s Bloom’s
CO Course Outcome Statement/s Taxonomy Taxonomy
Level Description
CO1 To introduce the concepts of high performance computing (HPC) Understanding
II
to science and engineering students
CO2 To apply different parallel computing tools like MPI, OpenMP Applying
and CUDA will be used in connection with domain specific III
problems.
CO3 To apply knowledge of Multi-CPU computing using both Applying
distributed and shared memory architecture using OpenMP and III
MPI based parallelization.
CO4

Module Module Contents Hours

Single Processor Architecture and Basic OpenMP Constructs and Functions, 8
I
More OpenMP constructs & functions
II Basic Linear Algebra using OpenMP and OpenMP tasks 8
III Critical Sections, locks and Matrix Factorization using OpenMP 7
IV Distributed Memory programming and Message Passing Interface (MPI) 6
MPI Collectives and Interconnection architectures, Some applications on 7
V
distributed memory architectures
VI Applications to Graph Algorithms 5

Textbooks
Ananth Grama, Anshul Gupta, George Karypis, Vipin Kumar, “Introduction to Parallel
1
Computing”, Addison-Wesely, 2nd Edition, 2003

References
Grama, A., Gupta, A., Karypis, G., and Kumar, V., Introduction to Parallel Computing,
1
Addison Wesley, 2003
Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Gropp, W, Ewing L, and Anthony S. Using MPI: portable parallel programming with the
2
message-passing interface. Vol. 1. MIT press, 1999.
Cook, S., CUDA Programming: A Developer's Guide to Parallel Computing with GPUs, M K
3
Publishers, 2012 NVIDIA, CUDA C Programming guide, 2012

Useful Links
1 https://onlinecourses.nptel.ac.in/noc20_me61/preview
2 OpenMP Tutorial from LLNL (https://computing.llnl.gov/tutorials/openMP

CO-PO Mapping
Programme Outcomes (PO) PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 1 1
CO2 3 3 1
CO3 2 2 2 1
The strength of mapping is to be written as 1: Low, 2: Medium, 3: High
Each CO of the course must map to at least one PO.

Assessment
The assessment is based on MSE, ISE and ESE.
MSE shall be typically on modules 1 to 3.
ISE shall be taken throughout the semester in the form of teacher’s assessment. Mode of assessment can
be field visit, assignments etc. and is expected to map at least one higher order PO.
ESE shall be on all modules with around 40% weightage on modules 1 to 3 and 60% weightage on
modules 4 to 6.
For passing a theory course, Min. 40% marks in (MSE+ISE+ESE) are needed and Min. 40% marks in
ESE are needed. (ESE shall be a separate head of passing)

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Walchand College of Engineering, Sangli
(Government Aided Autonomous Institute)
AY 2022-23
Course Information
Programme B.Tech. (Computer Science and Engineering)
Class, Semester Final Year B. Tech., Sem VIII
Course Code 5CS438
Course Name Elective 9 - Advanced Machine Learning
Desired Requisites: Introduction to Machine Learning

Teaching Scheme Examination Scheme (Marks)

Lecture 3 Hrs/week MSE ISE ESE Total
Tutorial - 30 20 50 100
Credits: 3

Course Objectives
1 Introduces various mathematical concepts required for machine learning.
Understand GAN components, build basic GANs using PyTorch and advanced DCGANs using
2
convolutional layers, control your GAN and build conditional GAN
Course Outcomes (CO) with Bloom’s Taxonomy Level
At the end of the course, the students will be able to,
Bloom’s Bloom’s
CO Course Outcome Statement/s Taxonomy Taxonomy
Level Description
CO1 Explain advanced mathematical concept required for machine Understand
II
learning
CO2 Understand the intuition behind the fundamental components of Understand
II
Transformers and Recommender system
CO3 Implement case studies on GAN, Transformers and Recommender Apply
III
systems.
CO4 Build conditional GANs capable of generating examples from Create
VI
determined categories

Module Module Contents Hours

Introduction
Backpropagation and automatic differentiation, Machine learning frameworks
I: the user interface, Overfitting, Generalization error, Early stopping, Our first
hyperparameters: step size/learning rate, minibatch size, Regularization,
I 8
Application-specific forms of regularization, The condition number,
Momentum and acceleration, Momentum for quadratic optimization,
Momentum for convex optimization.

Intro to GANs and Deep Convolutional GAN

Learn about GANs and their applications, understand the intuition behind the
basic components of GANs, and build your very own GAN using PyTorch,
Build a more sophisticated GAN using convolutional layers. Learn about
II 6
useful activation functions, batch normalization, and transposed convolutions
to tune your GAN architecture and apply them to build an advanced DCGAN
specifically for processing images.

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Specialized GANs
Wasserstein GANs with Normalization: Reduce instances of GANs failure
due to imbalances between the generator and discriminator by learning
advanced techniques such as WGANs to mitigate unstable training and mode
III collapse with a W-Loss and an understanding of Lipschitz Continuity. 8

Conditional and Controllable GANs: Understand how to effectively control

your GAN, modify the features in a generated image, and build conditional
GANs capable of generating examples from determined categories.
Transformers
IV Motivation, attention models, architecture types, BERT, Roberta, Albert 6

Recommender System
V Collaborative filtering, content-based filtering
6
VI Case Studies on GANs, Transformers and Recommender Systems 6

Textbooks
Jacub langr, “GANs in Action: Deep learning with Generative Adversarial Networks” 1st
1
Edition

References
1

Useful Links
1 https://nptel.ac.in/courses/106/106/106106198/
2 https://www.cs.cornell.edu/courses/cs6787/2019fa/
3 https://www.deeplearning.ai/program/generative-adversarial-networks-gans-specialization/

CO-PO Mapping
Programme Outcomes (PO) PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3
CO2 3
CO3 1 2
CO4 1 2
The strength of mapping is to be written as 1: Low, 2: Medium, 3: High
Each CO of the course must map to at least one PO.

Assessment
The assessment is based on MSE, ISE and ESE.
MSE shall be typically on modules 1 to 3.
ISE shall be taken throughout the semester in the form of teacher’s assessment. Mode of assessment can
be field visit, assignments etc. and is expected to map at least one higher order PO.
ESE shall be on all modules with around 40% weightage on modules 1 to 3 and 60% weightage on
modules 4 to 6.
For passing a theory course, Min. 40% marks in (MSE+ISE+ESE) are needed and Min. 40% marks in
ESE are needed. (ESE shall be a separate head of passing)

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 Walchand College of Engineering, Sangli
(Government Aided Autonomous Institute)
AY 2022-23
Course Information
Programme B.Tech. (Computer Science and Engineering)
Class, Semester Final Year Sem VIII
Course Code 5CS439
Course Name Elective 9- Big Data Computing
Desired Requisites: Data Structure & Algorithms, Computer Architecture, Operating
System, Database Management Systems

Teaching Scheme Examination Scheme (Marks)

Lecture 3 Hrs/week MSE ISE ESE Total
Tutorial - 30 20 50 100
Credits: 3

Course Objectives
1 To explain the fundamentals of Big data computing problems, applications and characteristics.
2 To discuss various enabling, storage and streaming ways of Big Data
3 To present Machine learning techniques for Big Data
Course Outcomes (CO) with Bloom’s Taxonomy Level
At the end of the course, the students will be able to,
Bloom’s Bloom’s
CO Course Outcome Statement/s Taxonomy Taxonomy
Level Description
CO1 Illustrate fundamentals of Big data computing terminology II Understanding
CO2 Demonstrate various Big Data enabling techniques IV Analyze
CO3 Discuss various Big data storage and streaming platform. III Apply

Module Module Contents Hours

Introduction to Big Data
I Why Big data computing, where did it come from, big data problems, 5
applications, Characteristics.
Introduction to Enabling Technologies for Big Data
Brief introduction of big data enabling techniques Hadoop HDFC, Hadoop
II 7
YARN MapReduce, Apache Cassandra, HBase, Big Data Streaming
Platforms: Apache Spark Streaming, Apache Kafka
Hadoop For Big Data
Hadoop distribution file system (HDFS), Goal of Hadoop, read/write
III 7
process of HDFS, Main configuration tuning parameters to control HDFS
performance and robustness, Hadoop 1.0, Hadoop 2.0
Spark
IV Overview of spark, fundamentals of scala & functional programming, spark 6
concepts. Spark operations, Job execution.
Introduction to Big Data Storage Platforms for Large Scale Data
Storage
V
Data placement strategies, CAP theorem, Consistency solution, Design of 7
Zookeeper, Cassandra Query Language. HBase
Big Data Streaming Platforms and Performance engine
VI Real-time Big data processing with Spark streaming and sliding window
8
analytics, Big data performance engine

Textbooks
1

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23
 References
1 NPTEL Course Big Data Computing, IIT Patna Dr. Rajiv Misra

Useful Links
1 https://nptel.ac.in/courses/106104189

CO-PO Mapping
Programme Outcomes (PO) PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2
CO2 2 2
CO3 2 3
CO4
The strength of mapping is to be written as 1: Low, 2: Medium, 3: High
Each CO of the course must map to at least one PO.

Assessment
The assessment is based on MSE, ISE and ESE.
MSE shall be typically on modules 1 to 3.
ISE shall be taken throughout the semester in the form of teacher’s assessment. Mode of assessment can
be field visit, assignments etc. and is expected to map at least one higher order PO.
ESE shall be on all modules with around 40% weightage on modules 1 to 3 and 60% weightage on
modules 4 to 6.
For passing a theory course, Min. 40% marks in (MSE+ISE+ESE) are needed and Min. 40% marks in
ESE are needed. (ESE shall be a separate head of passing)

Course Contents for BTech Programme, Department of Computer Science and Engineering, AY2022-23