B.E Syllabus For DL
B.E Syllabus For DL
Home
Savitribai Phule Pune University
Fourth Year of Computer Engineering (2019 Course)
410251: Deep Learning
Teaching Scheme: Examination Scheme:
Credit
In-Sem (Paper): 30 Marks
TH: 03 Hours/Week 03
End-Sem (Paper): 70 Marks
Prerequisite Courses: Machine Learning (410242)
Companion Course: Laboratory Practice V(410254)
Course Objectives:
● To understand the basics of neural networks.
● Comparing different deep learning models.
● To understand the Recurrent and Recursive nets in Deep Learning
● To understand the basics of deep reinforcement Learning models.
● To analyze Types of Networks.
● To Describe Reinforcement Learning.
Course Outcomes:
On completion of the course, student will be able to–
CO1: Understand the basics of Deep Learning and apply the tools to implement deep
learningapplications
CO2: Evaluate the performance of deep learning models (e.g., with respect to the bias-variance trade-
off, overfitting and underfitting, estimation of test error).
CO3: To apply the technique of Convolution (CNN) and Recurrent Neural Network (RNN)
forimplementing Deep Learning models
CO4: To implement and apply deep generative models.
CO5: Construct and apply on-policy reinforcement learning algorithms
CO6:To Understand Reinforcement Learning Process
Course Contents
Unit I Foundations of Deep learning 07 Hours
What is machine learning and deep learning?,Supervised and Unsupervised Learning, bias variance
tradeoff, hyper parameters, under/over fitting regularization, Limitations of machine learning, History of
deep learning, Advantage and challenges of deep learning. Learning representations from data ,
Understanding how deep learning works in three figures, Common Architectural Principles of Deep
Network, Architecture Design, Applications of Deep learning, Introduction and use of popular industry
tools such as TensorFLow,
Keras, PyTorch, Caffe, Shogun.
e-Books :
1. http://csis.pace.edu/ctappert/cs855-18fall/DeepLearningPractitionersApproach.pdf
2. https://www.dkriesel.com/_media/science/neuronalenetze-en-zeta2-1col-dkrieselcom.pdf
MOOC Courses Links:
https://www.my-mooc.com/en/categorie/deep-learning
CO\PO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3 - - 3 - - - - - - 2
CO2 3 2 2 2 1 - - - - - - 1
CO3 3 2 2 2 2 - 1 - - - - 1
CO4 1 2 1 1 2 - 1 - - - - 1
CO5 2 2 3 2 2 - - - - - - 1
CO6 1 2 2 2 2 - - - - - 2 -
Home
Savitribai Phule Pune University
Fourth Year of Computer Engineering (2019 Course)
Elective V
410252(A): Natural Language Processing
Teaching Scheme: Examination Scheme:
Credit
In-Sem (Paper): 30 Marks
TH: 03 Hours/Week 03
End-Sem (Paper): 70 Marks
Prerequisite Courses: Discrete Mathematics (210241), Theory of Computation (310242),
Data Science and Big Data Analytics (310251)
Companion Course: Laboratory Practice VI(410255)
Course Objectives:
To be familiar with fundamental concepts and techniques of natural language
processing (NLP)
To acquire the knowledge of various morphological, syntactic, and semantic NLP
tasks
To develop the various language modeling techniques for NLP
To use appropriate tools and techniques for processing natural languages
To comprehend the advance real world applications in NLP domain.
To Describe Applications of NLP and Machine Translations.
Course Outcomes:
On completion of the course, student will be able to–
CO1: Describe the fundamental concepts of NLP, challenges and issues in NLP
CO2: Analyze Natural languages morphologically, syntactical and semantically OR
Describe the concepts of morphology, syntax, semantics of natural language
CO3: Illustrate various language modelling techniques
CO4: Integrate the NLP techniques for the information retrieval task
CO5: Demonstrate the use of NLP tools and techniques for text-based processing of natural
languages
CO6: Develop real world NLP applications
Course Contents
Unit I Introduction to Natural Language Processing 07 Hours
Introduction: Natural Language Processing, Why NLP is hard? Programming languages Vs
Natural Languages, Are natural languages regular? Finite automata for NLP, Stages of NLP,
Challenges and Issues(Open Problems) in NLP
Basics of text processing: Tokenization, Stemming, Lemmatization, Part of Speech Tagging
#Exemplar/Case Studies Why English is not a regular language:
http://cs.haifa.ac.il/~shuly/teaching/08/nlp/complexity.pdf#page=20