Documente Academic
Documente Profesional
Documente Cultură
Item 4.27
UNIVERSITY OF MUMBAI
Bachelor of Engineering
Revised course
Course Code
Course
Name
Teaching Scheme
(Contact Hours)
Theory
Pract Tut
CPC701
CPC703
Artificial Intelligence
CPP701
Project I
CPC702
CPE7042X
CPL701
Course Code
CPC701
CPC702
CPC703
CPE7042X
CPP701
CPL701
Elective-II
6#
Theory
1
1
3
Tut
-
Total
5
5
3
18
16
25
oral
Total
Examination Scheme
Internal Assesment
Internal Assesment
End Sem
Exam
TW
Test 1
Test 2 Avg
Exam
Duration
( in Hrs)
20
20
20
80
03
25
20
20
20
80
03
80
20
20
Project I
Course Name
16
Total
TW/
Prac
1
Credits Assigned
20
20
20
20
25
25
125
25
25
150
50
50
100
25
50
75
320
175
175
750
80
80
03
03
# Indicate workload for Learner and not for Faculty in semester VII and VIII
25
25
150
150
Course Code
CPC701
Course/Subject Name
Credits
5
Objectives:
1. To learn the fundamental concepts of Digital Signal Processing.
2.
To explore the properties of DFT in mathematical problem solving.
3.
To illustrate FFT calculations mathematically and develop FFT based DSP algorithms.
4.
3.1 Introduction to DTFT, DFT, Relation between DFT and DTFT, Properties of
DFT without mathematical proof (Scaling and Linearity, Periodicity, Time
Shift and Frequency Shift, Time Reversal, Convolution Property and
Parsevals Energy Theorem). DFT computation using DFT properties.
08
05
06
08
List of Experiments:
Objective:
Develop a program to sample a continuous time signal and convert it to Discrete Time Signal.
Problem Definition:
1. Sample the input signal and display first 50 samples. Calculate data rate and bit rate.
2. Reconstruct the original signal and display the original and reconstructed
signals. 3.Vary the sampling frequency and observe the change in the quality
of reconstructed signal.
2.
To perform Discrete Correlation
Aim:
To study mathematical operation Correlation and measure degree of similarity between two signals
Objective:
Input Specifications:
Problem Definition:
1. Find auto correlation of input signal. What is the significance of value of output
signal value at n=0?.
2. Find auto correlation of delayed input signal.
3. Find cross correlation of input signal and delayed input signal,
4. Find cross correlation of input signal and scaled delayed input signal.
5. Compare the resultant signals. Give your conclusion.
6. Take two input finite length DT signals and develop a function to find Carls Correlation
Coefficient value. Determine the degree of similarity of two signals from the calculated Carls
Correlation Coefficient value.
3.
Aim:
The aim of this experiment is to study mathematical operation such as Linear convolution,
Circular convolution, Linear convolution using circular convolution.
Objective:
1. Develop a function to find Linear Convolution and Circular Convolution
2. Calculate Linear Convolution, Circular Convolution, Linear Convolution using Circular
Convolution and verify the results using mathematical formulation.
3. Conclude on aliasing effect in Circular convolution
Input Specifications:
1.
Length of first Signal L and signal values.
2.
Length of second Signal M and signal values.
Problem Definition:
1. Find Linear Convolution and Circular Convolution of L point sequence x[n] and M point
sequence h[n].
2. Find Linear Convolution of L point sequence x[n] and M point sequence h[n] using
Circular convolution.
3. Give your conclusion about No of values in linearly convolved signal, and Aliasing effect
in Circular Convolution.
4.
Aim:
The aim of this experiment is to study magnitude spectrum of the DT signal.
Objective:
1. Develop a function to perform DFT of N point signal
2. Calculate DFT of a DT signal and Plot spectrum of the signal.
3. Conclude the effect of zero padding on magnitude spectrum.
4. Calculate the number of real multiplications and real additions required to find DFT.
Input Specifications:
1. Length of Signal N
2. Signal values
Problem Definition:
1. Take any four-point sequence x[n].
Find DFT X[k].
Compute number of real multiplications and real additions required to find X[k].
Plot Magnitude Spectrum of the signal.
2. Append the input sequence by four zeros. Find DFT and plot magnitude spectrum.
Repeat the same by appending the sequence by eight zeros. Observe and compare the
magnitude spectrum. Give your conclusion.
5. To perform Fast Fourier
Transform Aim:
To implement computationally fast algorithms.
Objective:
1. Develop a program to perform FFT of N point signal.
2. Calculate FFT of a given DT signal and verify the results using mathematical formulation.
3. Illustrate the computational efficiency of FFT.
Input Specifications:
Length of Signal N
Signal values
Problem
Definition:
2) Filter it by convolving input signal with the impulse response of FIR filter using
Fast Overlap Add filtering Algorithm OR Fast Overlao Save Filtering Algorithm.
Aim:
2. Decide one DSP application of your choice. Collect the information related to
the application from the published granted patents. Download the related
published papers from the standard refereed journals and conferences.
4.
5.
Prepare the three to four pages report on the mini project in IEEE paper format.
Term Work:
Text Books :
(15)
(05)
(05)
(25)
ISBN : 978-81-315-0179-5.
Marks.
Marks.
Marks
Marks.
Reference Books :
2. Sanjit Mitra, Digital Signal Processing : A Computer Based Approach , TataMcGraw Hill,
Third Edition
3. Dr, Shaila Apte, Digital Signal Processing,, Wiley India, Second Edition,2013
ISBN : 978-81-2652142-5
Monson H. Hayes, Schaums Outline of Digital Signal Processing McGraw Hill International
second edition. ISBN : 978-00-7163509-7
Course Code
CPC702
Objectives:
1.
Course/Subject Name
Credits
5
2.
To understand how crypto can be used as an effective tools in providing
assurance concerning privacy and integrity of information.
3.
To provide skills to design security protocols for recognize security problems.
Outcomes: Learner will be able to
1.
Understand the principles and practices of cryptographic techniques.
2.
Understand a variety of generic security threats and vulnerabilities, and
identify & analyze particular security problems for given application.
3.
Appreciate the application of security techniques and technologies in
solving real-life security problems in practical systems.
4.
Apply appropriate security techniques to solve security problem
5.
6.
Module
01
02
03
04
05
06
Design security protocols and methods to solve the specific security problems.
Introduction
1.1 Security Attacks, Security Goals, Computer criminals, Methods of
defense, Security Services, Security Mechanisms
Basics of Cryptography
2.1 Symmetric Cipher Model, Substitution Techniques, Transportation
Techniques, Other Cipher Properties- Confusion, Diffusion, Block and
Stream Ciphers.
Secret Key Cryptography
3.1 Data Encryption Standard(DES), Strength of DES, Block Cipher
Design Principles and Modes of Operations, Triple DES, International
Data Encryption algorithm, Blowfish, CAST-128.
Public Key Cryptography
4.1 Principles of Public Key Cryptosystems, RSA Algorithm, DiffieHellman Key Exchange
Cryptographic Hash Functions
5.1 Applications of Cryptographic Hash Functions, Secure Hash
Algorithm, Message Authentication Codes Message Authentication
Requirements and Functions, HMAC, Digital signatures, Digital
Signature Schemes, Authentication Protocols, Digital Signature
Standards.
Authentication Applications
6.1 Kerberos, Key Management and Distribution, X.509 Directory
Authentication service, Public Key Infrastructure, Electronic Mail
Security: Pretty Good Privacy, S/MIME.
Hrs
06
06
06
04
06
06
07
08
8.1 IP Security
06
Overview, Architecture, Authentication Header, Encapsulating Security
Payload, Combining security Associations, Internet Key Exchange, Web
Security: Web Security Considerations, Secure Sockets Layer and
Transport Layer Security, Electronic Payment.
8.2 Non-cryptographic protocol Vulnerabilities
DoS, DDoS, Session Hijacking and Spoofing, Software VulnerabilitiesPhishing, Buffer Overflow, Format String Attacks, SQL Injection.
Term Work:
Practical/Oral examination:
3. IPSec
4. Spoofing
5. PGP(Pretty Good Privacy)
6. Port Scanning
7. Vulnerability scanner
8. Buffer Overflow
9. Intrusion Detection System
10. Password cracking
11. Firewall
12. SSL
Theory Examination:
Text Books:
2. Network Security and Cryptography 2nd edition, Bernard Menezes, Cengage Learning.
Reference Books:
1. Cryptography and Network Security by Behrouz A. Forouzan, TMH
2. Security in Computing by Charles P. Pfleeger, Pearson Education.
3. Computer Security Art and Science by Matt Bishop, Addison-Wesley.
Course Code
CPC703
Course/Subject Name
Credits
Artificial Intelligence
Objectives:
1. To conceptualize the basic ideas and techniques underlying the design of
intelligent systems.
2. To make students understand and Explore the mechanism of mind that enable
intelligent thought and action.
3. To make students understand advanced representation formalism and search techniques.
4. To make students understand how to deal with uncertain and incomplete information.
Hrs
04
04
14
Genetic algorithms.
3.4 Adversarial Search: Games, Optimal strategies,
The minimax algorithm , Alpha-Beta Pruning.
04
05
06
Applications
6.1 Natural Language Processing(NLP), Expert Systems.
12
10
04
Term Work:
(15)
(05)
(05)
(25)
Marks.
Marks.
Marks
Marks.
Practical/Oral examination:
based
papers
published
in
Any other practical covering the syllabus topics and subtopics can be conducted.
Text Books:
1. Stuart J. Russell and Peter Norvig, "Artificial Intelligence A Modern Approach Second
Edition" Pearson Education.
2. Saroj Kaushik Artificial Intelligence , Cengage Learning.
3. George F Luger Artificial Intelligence Low Price Edition , Pearson Education., Fourth edition.
Reference Books:
Course Code
CPE7025
Course/Subject Name
Credits
Soft Computing
Objectives:
1. To Conceptualize the working of human brain using ANN.
2. To become familiar with neural networks that can learn from available
examples and generalize to form appropriate rules for inference systems.
3. To introduce the ideas of fuzzy sets, fuzzy logic and use of heuristics based
on human experience.
4. To provide the mathematical background for carrying out the optimization and
familiarizing genetic algorithm for seeking global optimum in self-learning situation.
Neural Networks
2.1 Basics of Neural Networks:
Introduction to Neural Networks, Biological
Neural Networks, McCulloch Pitt model,
2.2 Supervised Learning algorithms:
14
03
14
04
Hybrid system
4.1 Introduction to Hybrid Systems, Adaptive Neuro
Fuzzy Inference System(ANFIS).
Introduction to Optimization Techniques
5.1 Derivative based optimization- Steepest Descent,
Newton method.
5.2 Derivative free optimization- Introduction to
Evolutionary Concepts.
Genetic Algorithms and its applications:
04
05
06
06
06
Term Work:
(15)
(05)
(05)
(25)
Marks.
Marks.
Marks
Marks.
Practical/Oral examination:
PRACTICALS:
based
papers
published
in
Text Books:
Reference Books:
Zimmermann H.S "Fuzzy Set Theory and its Applications" Kluwer Academic Publishers.
Course Code
Course/Subject Name
CPL701
Credits
02
Technology: Networking
2.1 Title: Study of packet sniffer tools like wireshark, ethereal, tcpdump
etc. You should be able to use the tools to do the following
1.
2.
Technology: Networking
3.1 Title: Download and install nmap. Use it with different options to scan open
ports, perform OS fingerprinting, do a ping scan, tcp port scan, udp port scan, etc.
Objective: objective of this module to learn nmap installation & use this
to scan different ports.
Scope: used for ip spoofing and port scanning
Technology: Networking
04
4.1 Title: Detect ARP spoofing using open source tool ARPWATCH.
Objective: Objective of the module to find ARP spoofing using open source.
Scope: Ip spoofing using arp packaging tool
05
Technology: Networking
5.1 Title: Use the Nessus tool to scan the network for vulnerabilities.
Objective: Objective of the module is scan system and network analysis.
Scope: It used for system analysis, security and process analysis
06
Technology: Networking
07
Technology: Networking
7.1 Title: Set up IPSEC under LINUX
08
Technology: Networking
8.1 Title: Install IDS (e.g. SNORT) and study the logs.
Objective: Simulate intrusion detection system using tools such as snort
Scope: It is used for intrusion detection system vulnerability scans
Technology: Networking
9.1 Title: Use of iptables in linux to create firewalls.
Technology: Networking
10.1 Title: Mini project
Term Work:
The distribution of marks for term work shall be as follows:
Lab Assignments:........................................................
Mini project:.
Attendance ....
TOTAL: .
(10)
(10) Marks.
(05) Marks
(25) Marks.
Oral examination:
References:
Course Code
CP701 / CP802
Course/Subject Name
Project I/ II
Credits
3/6
Validation of results
Quality of Written and Oral Presentation
o Report should be prepared as per the guidelines issued by the University of
Mumbai.
o Project II should be assessed through a presentation by the student project
group to a panel of Internal and External Examiners approved by the University of
Mumbai
competitions