QEEE COURSES OFFERED Jan - Apr 2018

Event Calendar Registration Steps
These courses are offered by NPTEL. A Q&A live session is offered by respective IIT Faculty during the middle of the course. Students can take NPTEL proctored examination(paid) as per given dates to get NPTEL certificate or QEEE proctored quiz (in Coursepack) to get QEEE certificate. For course outline and other information, please click on the 'Description' link below the course.
Advanced Fluid Mechanics
Advanced Fluid Mechanics
Advanced Fluid Mechanics
Start Date : 21/02/2018 17:19:55
End Date :
Topic Outline Advanced Fluid Mechanics
Session Schedule
Quiz
Assignment
Delivered by
Dr.Suman Chakraborty IIT Kharagpur
Matlab Programming for Numerical Computation
Matlab Programming for Numerical Computation
Matlab Programming for Numerical Computation
Start Date : 26/03/2018 10:00:00
End Date : 09/04/2018 12:00:00
Topic Outline Matlab Programming for Numerical Computation
Session Schedule
Name Start End
Session 1 20/03/2018 10:00:00 20/03/2018 12:00:00
Quiz
Assignment
Delivered by
Prof. Niket Kaisare IIT Madras
Power System Engineering
Power System Engineering
Power System Engineering
Start Date : 21/03/2018 10:15:00
End Date : 04/04/2018 12:00:00
Topic Outline Power System Engineering
Session Schedule
Name Start End
Session 1 15/03/2018 10:15:00 15/03/2018 12:00:00
Quiz
Assignment
Delivered by
Prof. Debapriya Das IIT Kharagpur
Programming Data Structures and Algorithms Using Python
Programming Data Structures and Algorithms Using Python
Programming Data Structures and Algorithms Using Python
Start Date : 21/02/2018 17:19:55
End Date :
Topic Outline Programming Data Structures and Algorithms Using Python
Session Schedule
Quiz
Assignment
Delivered by
Real Time Operators
Real Time Operators
Real Time Operators
Start Date : 21/02/2018 17:19:55
End Date :
Topic Outline Real Time Operators
Session Schedule
Quiz
Assignment
Delivered by
Prof.Rajib Mall IIT Kharagpur
Data Sciences
Note : These courses are already delivered in QEEE and available as Coursepack. Thus Live Classes will not be available. The college to schedule and deliver the course using Coursepack and students should attend the proctored quiz and assignment to be eligible for certificates.
Advanced Learning - Machine Learning
Advanced Learning - Machine Learning
Advanced Learning - Machine Learning
Start Date : 22/03/2018 05:29:00
End Date : 30/04/2018 22:00:00
Topic Outline
Session Schedule
Quiz
Name Start End
Quiz For Session 1 09/08/2017 00:00:00 -
Quiz For Session 2 09/08/2017 00:00:00 -
Quiz For Session 3 09/08/2017 00:00:00 -
Proctored Quiz 13/03/2018 09:00:00 30/04/2018 22:00:00
Assignment
Name Start End
Assignment 09/08/2017 00:00:00 -
Assignment - Proctored 13/03/2018 09:00:00 -
Algebra - Algebra
Algebra - Algebra
Algebra - Algebra
Start Date : 22/03/2018 05:29:00
End Date : 30/04/2018 22:00:00
Topic Outline

Relevant Course: Algebra

Relevant Department: All Engineering Department

Relevant Semester: 1st Semester

Pre- requisite : None

Course Description & outline:

Linear Algebra provides a very useful language that has being constantly used in all parts of pure and applied mathematics and engineering. The lecture series aims at introducing the most basic notions of the subject in the setting of R n . We shall touch upon the following:

1. Lecture - I: The notion of linear independence, linear span and dimension. To prove that the dimension is meaningful notion we shall prove a basic lemma that is of immense use throughout.

2. Lecture - II: The rank of a matrix. Some basic notions on row operations and its equivalence with premultiplication by elementary matrices. We shall prove that the row and column ranks are equal.

3. Lecture III: The Kronecker Capelli theorem, Gaussian elimiation, pivots and free variables. The rank-Nullity theorem.

4. Tutorial: We shall discuss several examples.

Session Schedule
Quiz
Name Start End
Proctored Quiz 13/03/2018 09:00:00 30/04/2018 22:00:00
Assignment
Delivered by
Foundation of Machine Learning
Foundation of Machine Learning
Foundation of Machine Learning
Start Date : 22/03/2018 05:29:00
End Date : 30/04/2018 22:00:00
Topic Outline

Relevant Course: Machine Learning

Relevant Department : Computer Science & Engineering

Relevant Semester: 3rd & higher

Pre-requisite: A course on Probability and Statistics is Preferable

Course Description & Outline :

  • Introduction to supervised learning -- classification and regression
  • Features, Hypothesis space.
  • Underfitting and overfitting
  • Inductive Bias, The Bias-Variance tradeoff and decomposition
  • Feature Selection, Dimensionality Reduction
  • Learnability: Basic introduction to Computational Learning Theory, VC dimension
Session Schedule
Quiz
Name Start End
Proctored Quiz 13/03/2018 09:00:00 30/04/2018 22:00:00
Assignment
Delivered by
Prof.Sudeshna Sarkar IIT Kharagpur
Introduction to Data Sciences
Introduction to Data Sciences
Introduction to Data Sciences
Start Date : 15/02/2018 17:19:55
End Date : 30/04/2018 22:00:00
Topic Outline
1-2 hours - Introduction, Typical Activities, Real-life Examples
2-4 hours - Mathematical Foundations of Data Science
4-6 hours - Framework, Brief Introduction to Selected Techniques and a Case Study
Session Schedule
Quiz
Name Start End
Proctored Quiz 13/03/2018 09:00:00 30/04/2018 22:00:00
Assignment
Delivered by
Linear Data Structures and Applications - Data Structures and Algorithms
Linear Data Structures and Applications - Data Structures and Algorithms
Linear Data Structures and Applications - Data Structures and Algorithms
Start Date : 22/03/2018 05:29:00
End Date :
Topic Outline

Relevant Course:Data Structures and Algorithms

Relevant Department :Computer Engineering; Information Technology

Relevant Semester:Ideally in Semester 3rd of 4 year B E / B Tech

Pre-requisite:Familiarity with Programming in C / C++; basics of algorithms

Course Description & Outline :

Introduction to stack and queue data structures. Basic operations on these data structures; array implementation; problem solving using these structures.

  • Linear list data structure, basic operations on a singly linked list: traversal(), length(), insertion(), deletion(), merge(); search(); sort(); time complexity of each operation.
  • Dynamic memory based implementation : concepts of pointer, array of pointers, structure,class and dynamic memory allocation. Designing programs in C and C++ for representation and manipulation of stack, queue and list using singly linked data structure.
  • Applications of stacks, queues and lists in problem solving – (a) balanced parentheses, (b)expression evaluation, (c) scheduling of processes, (d) sparse polynomial manipulation : addition and multiplication, and (e) arithmetic with long positive integers.
Session Schedule
Quiz
Assignment
Delivered by
Non-linear Data Structures and Applications - Data Structures and Algorithms
Non-linear Data Structures and Applications - Data Structures and Algorithms
Non-linear Data Structures and Applications - Data Structures and Algorithms
Start Date : 22/03/2018 05:29:00
End Date :
Topic Outline

Relevant Course:Data Structures and Algorithms

Relevant Department :Computer Engineering; Information Technology

Relevant Semester:Ideally in Semester 3rd of 4 year B E / B Tech

Pre-requisite:Material covered in Module 1-Linear Data Structures and Applications or equivalent

Course Description & Outline :

  • Hash table data structure with basic operations; hashing function and collision resolution; implementation using array and linked list; comparison of hash table with other searching algorithms.
  • Doubly and multiply linked data structures with basic operations; use in implementating binary tree and graph data structures. Comparison of linked data structures with space and time cost for basic operations.
  • Implementation of multiply linked lists in C++; template class implementation of a linked list.
  • Applications of nonlinear data structures in problem solving – (a) search application using hash tables, (b) sparse polynomial manipulation : addition; subtraction; multiplication, (c) design of buffer cache for disk blocks.
Session Schedule
Quiz
Assignment
Delivered by
Project Activity - Data Sciences
Project Activity - Data Sciences
Project Activity - Data Sciences
Start Date : 15/02/2018 17:19:55
End Date :
Topic Outline Case Study in Data Sciences: Three experiments, 3 techniques, 10 missing values to be found out.. Readings from five sensors (F1, F2, F3, F4, F5) will be made available to you (for 100 different tests, in a csv file). The readings are not arranged according to any order. There are some records, though, where there are a few missing readings that are marked NA. You should find out if there are any ideas that can be employed to rationally fill the missing values. Can you develop a data analytic approach to answer this question ?
Session Schedule
Quiz
Assignment
Delivered by
Random Variables and Distribution Functions - Mathematics
Random Variables and Distribution Functions - Mathematics
Random Variables and Distribution Functions - Mathematics
Start Date : 22/03/2018 05:29:00
End Date : 30/04/2018 22:00:00
Topic Outline

Relevant Course: All Engineering Departments

Relevant Department : Mathematics

Relevant Semester: 1st

Pre-requisite: Knowledge on Basic Calculus is Preferable

Course Description & Outline :

Random experiment, sample space, random events, axioms of probability, properties of probability, conditional probability, Bayes’ Formula, random variables, cumulative distribution function, probability mass function, probability density function, standard distribution functions such as Binomial, Poisson, Geometric, Negative Binomial, Normal, uniform, exponential, gamma and Weibull.

Session Schedule
Quiz
Name Start End
Proctored Quiz 13/03/2018 09:00:00 30/04/2018 22:00:00
Assignment
Delivered by
Prof.Sanjeev Sabnis IIT Bombay
Statistics and Probability Distribution - Engineering Mathematics
Statistics and Probability Distribution - Engineering Mathematics
Statistics and Probability Distribution - Engineering Mathematics
Start Date : 22/03/2018 05:29:00
End Date :
Topic Outline

Relevant Course: Statistics and Probability

Relevant Department : Engineering Departments

Relevant Semester: Spring 2016

Pre-requisite:  1st course in Calculus

Course Description & Outline :

Basic Laws of Probability, Review of most commonly occurring discrete and continuous distributions and their applications.

Session Schedule
Quiz
Assignment
Delivered by
Prof.Sanjeev Sabnis IIT Bombay
Regular Core Engineering Topics for Students
Arches and Suspension Bridges - Structural Analysis
Arches and Suspension Bridges - Structural Analysis
Arches and Suspension Bridges - Structural Analysis
Start Date : 15/03/2018 14:00:00
End Date : 26/04/2018 22:00:00
Topic Outline Arches and Suspension Bridges
Session Schedule
Name Start End
Session 1 15/03/2018 14:00:00 15/03/2018 16:00:00
Session 2 22/03/2018 10:00:00 22/03/2018 12:00:00
Session 3 23/03/2018 10:00:00 23/03/2018 12:00:00
Quiz
Name Start End
Proctored Quiz 12/04/2018 09:00:00 26/04/2018 22:00:00
Assignment
Name Start End
Assignment - Proctored 12/04/2018 09:00:00 -
Delivered by
Digital Signaling for Fading Channels - Wireless Communication
Digital Signaling for Fading Channels - Wireless Communication
Digital Signaling for Fading Channels - Wireless Communication
Start Date : 07/02/2018 10:00:00
End Date : 26/02/2018 22:00:00
Topic Outline

Outline of topics:

1. Basics of Fading Channels

• Small and Large Scale fading

• Delay spread and Doppler spread

• Time selective and Frequency selective channels

• Rayleigh and Rician fading

• Communication in fading channels

• Error Performance in fading channels


2. Basics of OFDM

• Frequency selective channels and Equalization

• OFDM concept

• OFDM spectrum

• OFDM implementation

• OFDM efficiency


3. Diversity Techniques for Fading Channels

• Concept of diversity

• Time, Frequency and Spatial diversity

• Error performance with diversity

• Introduction to MIMO


Prerequisites:


• Basics of Digital Communication, PSK and QAM constellations, Probability of Error analysis in AWGN

Session Schedule
Name Start End
Session 1 07/02/2018 10:00:00 07/02/2018 12:00:00
Session 2 08/02/2018 10:00:00 08/02/2018 12:00:00
Session 3 09/02/2018 10:00:00 09/02/2018 12:00:00
Quiz
Name Start End
Quiz - I 12/02/2018 09:00:00 -
Quiz - II 12/02/2018 09:00:00 -
Proctored Quiz 12/02/2018 09:00:00 26/02/2018 22:00:00
Assignment
Name Start End
Assignment - Proctored 12/02/2018 09:00:00 -
Delivered by
Discrete Time Signals - Digital Signal Processing
Discrete Time Signals - Digital Signal Processing
Discrete Time Signals - Digital Signal Processing
Start Date : 05/03/2018 10:00:00
End Date : 11/04/2018 22:00:00
Topic Outline

Relevant Dept – EE, CSE

(Any student who has completed UG level DSP)

Relevant Semester – 6, 7, or 8

Pre-requisites to attend this topic – Digital Signal Processing (DSP) 

Unit 1 (6 hours)

INTRODUCTION

  • Periodic Sampling (2 hours)
    • Frequency domain representation of sampling
    • Nyquist criterion, oversampling, aliasing
  • Reconstruction (1 hour)
  • Discrete-time processing of continuous time signals ( 1 hour)
  • Up-sampling, and interpolation (2 hours)
    • Sampling rate change by integer value

Unit 2 (6 hours)

  • Down-sampling, Nyquist criterion, Aliasing (2.5 hours)
  • Fractional sampling rate change (0.5 hours)
  • Interconnection of Multirate blocks ( 1hour)
  • Fundamentals of Multi-rate Systems (2 hours)
    • Polyphase decomposition, Noble Identities

Text books

  1. Discrete-Time Signal Processing by Alan V. Oppenheim, Ronald W. Schafer, 3rd edition, 2016, Pearson, ISBN 978-93-325-3503-9

Reference

  1. P. Vaidyanathan, “Multirate Systems and Filter Banks,” Pearson, 2004, ISBN 81-297-0685-7
Session Schedule
Name Start End
Session 1 05/03/2018 10:00:00 05/03/2018 12:00:00
Session 2 12/03/2018 10:00:00 12/03/2018 12:00:00
Session 3 13/03/2018 10:00:00 13/03/2018 12:00:00
Quiz
Name Start End
Proctored Quiz 27/03/2018 09:00:00 11/04/2018 22:00:00
Assignment
Name Start End
Assignment - Proctored 27/03/2018 09:00:00 -
Delivered by
Fits and Tolerance - Computer Aided Machine Drawing
Fits and Tolerance - Computer Aided Machine Drawing
Fits and Tolerance - Computer Aided Machine Drawing
Start Date : 28/02/2018 10:00:00
End Date : 28/03/2018 22:00:00
Topic Outline

Relevant Department : Mechanical Engineering

Relevant semester: Jan-June

Pre requisite: Nil

Course Description & Outline:

Limits fits and Tolerances: Standards of Measurement; systems of limits, fits and tolerances; Tolerance Control; Selection of tolerance grades; Gauging- GO and NO Gauges; Numerical problem

Session Schedule
Name Start End
Session 1 28/02/2018 10:00:00 28/02/2018 12:00:00
Session 2 01/03/2018 10:00:00 01/03/2018 12:00:00
Session 3 06/03/2018 14:00:00 06/03/2018 16:00:00
Quiz
Name Start End
Proctored Quiz 12/03/2018 09:00:00 28/03/2018 22:00:00
Assignment
Name Start End
Assignment - Proctored 12/03/2018 09:00:00 -
Delivered by
Prof. Samuel GL IIT Madras
Fundamentals of Air - Conditioning - Thermal Engineering - 2
Fundamentals of Air - Conditioning - Thermal Engineering - 2
Fundamentals of Air - Conditioning - Thermal Engineering - 2
Start Date : 20/02/2018 14:00:00
End Date : 24/03/2018 23:00:00
Topic Outline

1.Relevant Semester: 6th or 7th Semester

2. Relevant departments: 1. Mechanical, 2. Energy, and 3. Architecture

3. Pre-requisites: Basic understanding of 1) Engineering Thermodynamics, 2) Fluid Mechanics, and 3) Heat Transfer

Course Outline

The course covers all the basic aspects of air conditioning starting with introduction and applications of air conditioning, introduction to psychrometry and psychrometric processes, introduction to human thermal comfort and comfort standards, cooling load calculations, air conditioning systems and system selection criteria and introduction to air transmission and air distribution inside the conditioned space. Sources where more information and data can be obtained along with details of some popular building simulation and load calculation software will be provided. It is expected that at the end of the course, the student is able to select a suitable air conditioning system based on design inputs and perform simple energy consumption calculations.

Session Schedule
Name Start End
Session 1 20/02/2018 14:00:00 20/02/2018 16:00:00
Session 2 27/02/2018 14:00:00 27/02/2018 16:00:00
Session 3 28/02/2018 14:00:00 28/02/2018 16:00:00
Quiz
Name Start End
Proctored Quiz 09/03/2018 18:00:00 24/03/2018 23:00:00
Assignment
Name Start End
Assignment Proctored 09/03/2018 18:00:00 -
Delivered by
Prof. Ramgopal M IIT Kharagpur
Fuzzy Logic System - AI Applications to Power Systems
Fuzzy Logic System - AI Applications to Power Systems
Fuzzy Logic System - AI Applications to Power Systems
Start Date : 07/03/2018 10:00:00
End Date : 20/04/2018 23:00:00
Topic Outline
  1. Basics of Fuzzy Theory:

Crisp and Fuzzy Sets, Operations, alpha- cuts,

  1. Fuzzy Relations:

Basic Properties of Fuzzy relations and fuzzy Reasoning

  1. Fuzzy Regression Models:

Linear Possibility Systems

  1. Fuzzy Decision Making:

Feedback Extension and Intension

  1. Fuzzy Mathematical Programming

Fuzzy Linear Programming

  1. Fuzzy Optimization

Multi Factorial evaluation, multi factorial decision making

  1. Applications of Fuzzy Systems

Diagnosis, Control, Decision Making, Information retrieval

Power Systems Examples: Fuzzy Load Flow, Fuzzy Logic Power Systems Stabilizer,

Fuzzy Optimization, Uncertainty Handling.

References:

  1. Toshiro Terano, Kiyoji Asai, Michio Sugeno, “Fuzzy Systems Theory and its Applications”, Academic Press, 1995.
  2. Hong Xing Li and Vincent C. Yen “Fuzzy Sets and Fuzzy Decision Making”, CRC Press 1995
  3. El-Hawary “Electric Power Applications of Fuzzy Systems”, , IEEE Press,1998
Session Schedule
Name Start End
Session 1 07/03/2018 10:00:00 07/03/2018 12:00:00
Session 2 09/03/2018 14:00:00 09/03/2018 16:00:00
Session 3 16/03/2018 14:00:00 16/03/2018 16:00:00
Quiz
Name Start End
Proctored Quiz 05/04/2018 09:00:00 20/04/2018 23:00:00
Assignment
Delivered by
Prof. Shanti Swarup IIT Madras
Gas Power Cycles - Thermal Engineering - 1
Gas Power Cycles - Thermal Engineering - 1
Gas Power Cycles - Thermal Engineering - 1
Start Date : 26/03/2018 10:00:00
End Date : 17/04/2018 22:00:00
Topic Outline

Pre-requisite: Undergraduate engineering thermodynamics (required).
Session I
Revision of air-standard cycles. Practical realization of air standard cycles. Real
effects.


Applications: I.C. engines – Transportation: Road – automobiles, motor cycles, bus,
etc.), Rail: Locomotives, Water: boats and ships (tankers); Stationary applications –
Generator sets (power generation); Prime movers for compressors (gas, air);
pumps, machinery; Others (lawn mower, construction machinery, ). Gas turbines:
Propulsion applications: Aircraft engines, ship propulsion, tank drives, rail
locomotives. Stationary applications power generation, and co-generation and trigeneration.


Engineering analysis and design: Transition from air standard cycle to real cycles.
Heat input and rejection processes. Use of fuel or other energy source. Efficiency
and impact of cycle parameters on efficiency.


Otto cycle: its processes and analysis. Practical realization of the cycle. Limitations
and environmental impact, especially emissions and their control.


Diesel cycle: its processes and analysis. Practical realization of the cycle. Limitations
and environmental impact, especially emissions and their control.

Session II
Dual fuel cycle: its processes and analysis. Practical realization of the cycle.
Limitations and environmental impact.


Brayton cycle, Sterling cycle: its processes and analysis. Practical realization of the
cycle. Limitations and environmental impact. Thermodynamic cycle for stationary
applications – major considerations and its engineering realization (stationary gas
turbines for power generation and ship/surface propulsion). Thermodynamic cycle
for aircraft propulsion applications – major considerations and engineering
realizations Typical configurations of aircraft engines.

Session III
Integrating gas power cycles for co-generation of power. Combined gas and steam
power plants.


Integrating gas power cycles for waste heat recovery for process purposes:
Integration with vapour absorption cycle for air-conditioning. Hot water/steam
generation for heating applications.


Challenges in design – flow, turbulence management, combustion and pollutant
formation, stresses and vibrations, long term thermal cycling, manufacturing,
operation related wear and tear.


Historical trends and on-going R & D on IC engines and aero-engines – higher inlet
temperatures, materials, environmental impact (NOX, CO2, soot, noise).

Session Schedule
Name Start End
Session 1 26/03/2018 10:00:00 26/03/2018 12:00:00
Session 2 27/03/2018 10:00:00 27/03/2018 12:00:00
Session 3 28/03/2018 14:00:00 28/03/2018 16:00:00
Quiz
Name Start End
Pre Quiz 22/03/2018 09:00:00 26/03/2018 22:00:00
Proctored Quiz 03/04/2018 09:00:00 17/04/2018 22:00:00
Assignment
Name Start End
Assignment - Proctored 03/04/2018 09:00:00 -
Delivered by
Prof.S.R. Kale IIT Delhi
Gas Turbines - Thermal Engineering -1
Gas Turbines - Thermal Engineering -1
Gas Turbines - Thermal Engineering -1
Start Date : 06/03/2018 14:00:00
End Date : 27/03/2018 22:00:00
Topic Outline

Relevant Department : Mechanical Engineering and Aerospace Engineering

Relevant Semester: 5th or 6th

Pre-requisite: Basic thermodynamics

Course Description & Outline :

Introduction, Air Standard Brayton cycle, Methods to improve Gas Turbine efficiency, Gas Turbine for air craft propulsion, Numerical problems, Gas Turbine Combustion Chambers

Session Schedule
Name Start End
Session 1 06/03/2018 14:00:00 06/03/2018 16:00:00
Session 2 07/03/2018 14:00:00 07/03/2018 16:00:00
Session 3 09/03/2018 14:00:00 09/03/2018 16:00:00
Quiz
Name Start End
Proctored Quiz 12/03/2018 09:00:00 27/03/2018 22:00:00
Assignment
Name Start End
Assignment - Proctored 12/03/2018 09:00:00 -
Delivered by
Heat Treatments - Engineering Materials and Metallurgy
Heat Treatments - Engineering Materials and Metallurgy
Heat Treatments - Engineering Materials and Metallurgy
Start Date : 06/02/2018 14:00:00
End Date : 08/03/2018 23:00:00
Topic Outline

Topic Name: Heat Treatments

Relevant Course Name: Engineering Materials and Metallurgy

Relevant Department: Metallurgical Engineering and Materials Science

Relevant Semester: II

IIT Faculty Name: Prof. M.P. Gururajan

IIT: Bombay

Topic Description and Outline:

Preliminaries: phase diagrams, TTT and CCT diagrams, diffusion

Annealing: Stress relief, Recrystallization, Spheroidizing

Aging: precipitation hardenable systems

Normalising, Hardening and Tempering of steel: Austempering, martempering, case hardening, carburizing / decarburizing, nitriding, cyaniding, carbonotriding, flame and induction hardening, vacuum and plasma hardening

Hardenability, Jominy end quench test

Thermo-mechanical treatments

Elementary ideas on sintering

Pre- requisites: Materials or Metallurgical Thermodynamics Preferred: Phase transformations and diffusion

Session Schedule
Name Start End
Session 1 06/02/2018 14:00:00 06/02/2018 16:00:00
Session 2 13/02/2018 14:00:00 13/02/2018 16:00:00
Session 3 16/02/2018 14:00:00 16/02/2018 16:00:00
Quiz
Name Start End
Proctored Quiz 22/02/2018 09:00:00 08/03/2018 23:00:00
Assignment
Name Start End
Assignment Proctored 22/02/2018 09:00:00 -
Delivered by
Dr.Gururajan MP IIT Bombay
Input and Output Systems - Operating Systems
Input and Output Systems - Operating Systems
Input and Output Systems - Operating Systems
Start Date : 12/03/2018 14:00:00
End Date : 09/04/2018 22:00:00
Topic Outline

Relevant Course Name: Operating Systems

Relevant Department: Computer science and Engineering

Pre- requisites: Basics of Operating Systems

Topic Description and Outline:

Secondary storage structure – Disk structure, disk scheduling, disk manager, swap space management, RAID structure, scalable storage implementation

IO systems – IO hardware, application IO interface, Kernel IO subsystems, IO Performance

IO system examples – UNIX based systems

Session Schedule
Name Start End
Session 1 12/03/2018 14:00:00 12/03/2018 16:00:00
Session 2 14/03/2018 14:00:00 14/03/2018 16:00:00
Session 3 20/03/2018 14:00:00 20/03/2018 16:00:00
Quiz
Name Start End
Proctored Quiz 26/03/2018 09:00:00 09/04/2018 22:00:00
Assignment
Name Start End
Assignment - Proctored 26/03/2018 09:00:00 -
Delivered by
Introduction to Fluid Mechanics and Applications
Introduction to Fluid Mechanics and Applications
Introduction to Fluid Mechanics and Applications
Start Date : 21/02/2018 17:19:55
End Date :
Topic Outline Introduction to Fluid Mechanics and Applications
Session Schedule
Quiz
Assignment
Delivered by
Limit State Design of Reinforced Concrete Beams - Design of Reinforced RCC Structures
Limit State Design of Reinforced Concrete Beams - Design of Reinforced RCC Structures
Limit State Design of Reinforced Concrete Beams - Design of Reinforced RCC Structures
Start Date : 31/01/2018 14:00:00
End Date : 20/02/2018 22:00:00
Topic Outline

Relevant Course: Design of RC Structures

Relevant Department: Civil Engineering, Architecture

Relevant Semester: 5th

Pre- requisites: Analysis of Structures

Topic Description and Outline:

The purpose of this course is to establish a basic understanding of design of reinforced concrete structures through Limit State Method. As many structural components (slab, staircase, retaining wall, footing, pile cap etc.) may be idealized as beam, the main emphasis in this course will be given on analysis and design of reinforced concrete beams. The following topics will be covered.

Lecture 1:

Concept of Limit State Method

Characteristic load and characteristic strength

Partial safety factors

Stress strain behaviour steel and concrete

Failure of concrete beam

Balanced, under-reinforced and over-reinforced section

Singly reinforced section and doubly reinforced section

Examples

Lecture 2:

Analysis and design of singly reinforced beam

Introduction to IS codes

Examples

Lecture 3:

Analysis and design of doubly reinforced beam Examples

Extension of beam design philosophy to other structural components (illustration)

Session Schedule
Name Start End
Session 1 31/01/2018 14:00:00 31/01/2018 16:00:00
Session 2 01/02/2018 10:00:00 01/02/2018 12:00:00
Session 3 02/02/2018 10:00:00 02/02/2018 12:00:00
Quiz
Name Start End
Proctored Quiz 06/02/2018 09:00:00 20/02/2018 22:00:00
Assignment
Name Start End
Assignment - Proctored 06/02/2018 09:00:00 -
Delivered by
Prof. Amit Shaw IIT Kharagpur
Limit State Design of Reinforced Concrete Columns - Design of Reinforced RCC Structures
Limit State Design of Reinforced Concrete Columns - Design of Reinforced RCC Structures
Limit State Design of Reinforced Concrete Columns - Design of Reinforced RCC Structures
Start Date : 07/03/2018 10:00:00
End Date : 28/03/2018 23:00:00
Topic Outline

Relevant Course: Design of RC Structures

Relevant Department: Civil Engineering, Architecture

Relevant Semester: 5th

Pre- requisites: Analysis of Structures, Concept of limit state design of beam

Topic Description and Outline:

The purpose of this course is to establish a basic understanding of design of reinforced concrete structures through Limit State Method. Column is an important structural component and its understanding its design philosophy is important. The main emphasis in this course will be given on analysis and design of reinforced concrete columns. The following topics will be covered.

Lecture 1:

Introduction

Classification of columns

Unsupported and effective length

Assumptions in limit state design for comuns

Design of axially loaded short column

Examples

Lecture 2:

Design of column with axial load and uni-axial moment

Derivation of basic equation

Interaction diagram

Examples

Lecture 3:

Design of column with axial load and bi-iaxial moment

Derivation of basic equation

Examples

Long columns (just introduction)

Session Schedule
Name Start End
Session 1 07/03/2018 10:00:00 07/03/2018 12:00:00
Session 2 08/03/2018 10:00:00 08/03/2018 12:00:00
Session 3 09/03/2018 10:00:00 09/03/2018 12:00:00
Quiz
Name Start End
Proctored Quiz 12/03/2018 09:00:00 28/03/2018 23:00:00
Assignment
Name Start End
Assignment Proctored 12/03/2018 09:00:00 -
Delivered by
Prof. Amit Shaw IIT Kharagpur
Power Semiconductor Device and Associated Gate Driving Technology - Power Electronics
Power Semiconductor Device and Associated Gate Driving Technology - Power Electronics
Power Semiconductor Device and Associated Gate Driving Technology - Power Electronics
Start Date : 18/01/2018 14:00:00
End Date : 22/02/2018 23:59:00
Topic Outline

Relevant Dept- Electrical Dept Students

Any pre requisites to attend this topic-Nil (Lecture from Basics)

Syllabus as follows:

  • Power transistors
  • Fast recovery diodes
  • Thyristors
  • Power TRIAC, MOSFET, IGBT, IGCT - characteristics, rating, Protection circuits, Driver Circuits.
Session Schedule
Name Start End
Session 1 18/01/2018 14:00:00 18/01/2018 16:00:00
Session 2 19/01/2018 14:00:00 19/01/2018 16:00:00
Session 3 22/01/2018 14:00:00 22/01/2018 16:00:00
Quiz
Name Start End
Proctored Quiz 08/02/2018 09:00:00 22/02/2018 23:59:00
Assignment
Name Start End
Assignment Proctored 08/02/2018 09:00:00 -
Delivered by
Process Management - Operating Systems
Process Management - Operating Systems
Process Management - Operating Systems
Start Date : 19/03/2018 14:00:00
End Date : 19/04/2018 22:00:00
Topic Outline

Topic Name: Process Management

Relevant Course Name: Operating Systems

Relevant Department: Computer science and Engineering

Relevant Semester: 5th

IIT Faculty Name: Prof. Chester Rebeiro

IIT: Madras

Topic Description and Outline:

Class 1: Processes, Process life cycle, Interrupts,

Class 2: context switching, scheduling

Class 3: Synchronization primitives,

Pre- requisites:

Data Structures

Computer Organization / Architecture

Session Schedule
Name Start End
Session 1 19/03/2018 14:00:00 19/03/2018 16:00:00
Session 2 23/03/2018 14:00:00 23/03/2018 16:00:00
Session 3 28/03/2018 14:00:00 28/03/2018 16:00:00
Quiz
Name Start End
Proctored Quiz 04/04/2018 09:00:00 19/04/2018 22:00:00
Assignment
Name Start End
Assignment - Proctored 04/04/2018 09:00:00 -
Delivered by
Runtime Environments - Principles of Compiler Design
Runtime Environments - Principles of Compiler Design
Runtime Environments - Principles of Compiler Design
Start Date : 09/03/2018 10:00:00
End Date : 02/05/2018 23:00:00
Topic Outline

Topic Name: Runtime Environments

Relevant Course Name: Principles of Complier Design

Relevant Department: Computer science and Engineering

Relevant Semester:

Topic Description and Outline:

Lecture 1: Quick review of semantic analysis of declarations in C/C++. Basic issues in Runtime Environments. Data types supported by PL – scalars, arrays, records, unions, classes. PL Support for recursion and creation of dynamic data structures. Organization of data objects, such as globals, locals, parameters, non- locals so that their addresses can be resolved at compile time. Illustration of data layout using gcc for various data and code segments.

Lecture 2: Issues of PLs that support programs with non-trivial nesting. Compilation of dynamic data sructures. Division of memory; structure of activation records (AR); accessing information in AR. Implementation of access to non-local variables; static link and dynamic link and their role in handling lifetime and scope of data objects. Issues in compiling function calls with recursion and the role of AR. Parameter passing mechanisms with examples and their compilation issues.

Lecture 3: Issues for compiling call to a function with parameters and return value. Intermediate code sequences to be generated for call by value and call by reference parameter passing mechanisms. Division of labor between caller and callee functions and prolog and epilogue code fragments to be inserted by the compiler. Tutorial on illustration of runtime environments by compare C source code and generated 64 bit X64 assembly code.

Pre- requisites: This module assumes familiarity with LALR(1) parser, Semantics Directed Translation Scheme (SDTS) particularly for declaration processing and function calls. The earlier QEEE modules delivered under Compiler Design : LR Parsing : Theory and practice, have the relevant pre-requisite material.

Session Schedule
Name Start End
Session 1 09/03/2018 10:00:00 09/03/2018 12:00:00
Session 2 16/03/2018 10:00:00 16/03/2018 12:00:00
Session 3 23/03/2018 10:00:00 23/03/2018 12:00:00
Quiz
Name Start End
Proctored Quiz 18/04/2018 09:00:00 02/05/2018 23:00:00
Assignment
Name Start End
Assignment Proctored 18/04/2018 09:00:00 -
Delivered by
Software Aspects - Microprocessor and Microcontroller - 8086
Software Aspects - Microprocessor and Microcontroller - 8086
Software Aspects - Microprocessor and Microcontroller - 8086
Start Date : 05/02/2018 10:00:00
End Date : 05/03/2018 22:00:00
Topic Outline

Relevant Dept – EEE, ECE, Computer Science, Information Technology, Instrumentation.

Pre-requisite – Nil

Session-1:

8086 Architecture – Internal block diagram, Register organization, stack structure. 8086 pin diagram and pin descriptions. Addressing modes, Instruction Formats. Timing diagrams- Minimum mode and Maximum mode.

Session-2

Instruction set: Data transfer instructions, Arithmetic instructions, Logical instructions, String instructions, Branch instructions and processor control instructions. Assembler directives. I/O programming and multi programming.

Session-3

Assembly language programming, Procedures, Macros, Interrupts and interrupt service routines, BIOS function calls.

Session Schedule
Name Start End
Session 1 05/02/2018 10:00:00 05/02/2018 12:00:00
Session 2 07/02/2018 14:00:00 07/02/2018 16:00:00
Session 3 12/02/2018 10:00:00 12/02/2018 12:00:00
Quiz
Name Start End
Quiz - I 19/02/2018 09:00:00 -
Quiz - II 19/02/2018 09:00:00 -
Proctored Quiz 19/02/2018 09:00:00 05/03/2018 22:00:00
Assignment
Name Start End
Assignment - Proctored 19/02/2018 09:00:00 -
Delivered by
Prof. Venkatesh TG IIT Madras
Space Trussess - Structural Analysis
Space Trussess - Structural Analysis
Space Trussess - Structural Analysis
Start Date : 15/02/2018 17:19:55
End Date :
Topic Outline Space Trussess
Session Schedule
Quiz
Assignment
Delivered by
Steam Turbines - Thermal Engineering - 2
Steam Turbines - Thermal Engineering - 2
Steam Turbines - Thermal Engineering - 2
Start Date : 19/02/2018 14:00:00
End Date : 30/03/2018 23:00:00
Topic Outline

Pre-requisite: Undergraduate engineering thermodynamics (required). Fluid
mechanics basic course (preferable).


Session I


An overview of steam turbine as an engineered product – typical construction and
components (incl. photographs).


Applications: fossil fuelled thermal power plants, nuclear power plants, solar thermal
power plants, captive power generation, co-generation, marine propulsion (ships and
submarines).


Steam turbine systems: steam system, lubricating oil system, sealing system, controland governing system, instrumentation and control systems.
Construction features: Casing, rotor, stator and rotor blades, bearings, seals,
mountings and foundation.


Principles related to turbines: Fundamental principles of turbines – conservation of
mass, conservation of momentum (2nd law of motion), conservation of energy (1
st law of thermodynamics), 2nd law of thermodynamics. Turbines as a component of a
thermodynamic cycle – intake and exhaust conditions. Isentropic efficiency – typical
values and the trends.


Classification based on working substance: Water: hydraulic turbines or hydroturbines;Steam: steam turbine; Gas (hot gas from oil/gas combustion in air) gas
turbine, aero-engine, turbo-charger; Air wind turbine. Oil: hydraulic coupling, torque
converter. How the substance and parameters (pressure, density, temperature, etc.)
influence the mechanical design of a turbine.


Engineering analysis and design: Basic principle of conversion of fluid flow into
mechanical shaft power. Concept of a flow passage and conservation laws. Flow
through a moving passage and conservation laws. Real flow passages in a steam
turbine – HP, IP and LP turbines. The idea of a blade. Blades arranged on a shaft –
resulting passages. Features of the flow through the passages and methodology to
understand the working. Typical questions posed by designers and operating
personnel. Some trends in the development of steam turbines (pressures,
temperatures, capacity, materials, efficiency

Session II


Converting the real flow passage to an idealized linear cascade. Major assumptions.


The concept of fixed blades and rotating blades and their modeling as fixed and
moving linear cascades. Definition of a stage.


Basic analysis: Assumptions – 1-dimensional flow, no friction, internally reversible
flow through the passage.


Thermodynamic processes occurring during flow through a stage T – s and h – s
diagrams.


Fixed cascade: Thermodynamic process – flow without enthalpy change vs. flow with
enthalpy drop. Flow directions at inlet and outlet of passage. Accelerating flow –
subsonic and super-sonic conditions. Forces on the passage, forces on a set of
parallel identical passages.


Moving cascade: Blade velocity assumption (uniform over blade height). Choice of
reference frame. Thermodynamic processes – without, or with enthalpy drop. Forces
on the passage – axial and radial forces. Power produced by a passage and by a set
of passages in parallel. Inlet and exit velocity diagrams (triangles). Blade efficiency.

Session III


Extension of linear cascade theory to a set of rotating blades. Real effects – height
of blade, variation of blade local velocity from hub to tip. Need for twisted blades.


Stage design concepts: Impulse principle. Reaction principle.


Matching stator and rotor blades characteristics.


Inlet and exhaust pressures of a steam turbine and related specific volume changes.
Condensing and back-pressure turbines. Extraction turbines.


Compounding of stages. Multi-stage blading in a turbine (casing and rotor).
Limitations of turbine size for multi-staging. Multi-cylinder turbines – series
connection. Cross-compounding of turbines. Pictures.


Typical parameters in turbines: Inlet pressure and temperature, reheat turbines,
turbines handling wet steam.


Challenges in turbine design – flow, turbulence management, stresses and
vibrations, long term thermal cycling, manufacturing, operation related (erosion,
deposition, corrosion).


Historical trends and on-going R & D on turbines – higher inlet temperatures.

Session Schedule
Name Start End
Session 1 19/02/2018 14:00:00 19/02/2018 16:00:00
Session 2 20/02/2018 14:00:00 20/02/2018 16:00:00
Session 3 21/02/2018 14:00:00 21/02/2018 16:00:00
Quiz
Name Start End
Proctored Quiz 14/03/2018 18:00:00 30/03/2018 23:00:00
Assignment
Name Start End
Assignment Proctored 14/03/2018 18:00:00 -
Delivered by
Prof.S.R. Kale IIT Delhi
Storage Management - Operating Systems
Storage Management - Operating Systems
Storage Management - Operating Systems
Start Date : 29/01/2018 14:00:00
End Date : 20/02/2018 23:00:00
Topic Outline

Relevant Course Name: Operating Systems

Relevant Department: Computer science and Engineering

Relevant Semester: Spring 2018

Pre- requisites: Basics of Operating Systems

Topic Description and Outline:

File System – Basic concepts of file systems and access technologies, Directory and disk structures, File system mounting, Protection of file systems

File System implementation – File system structure and directory implementation, Allocation methods, free space management, File system performance, Recovery

Distributed file system – Naming and transparency, Remote file access, stateful versus stateless services

Example file system – UNIX based file system architecture

Session Schedule
Name Start End
Session 1 29/01/2018 14:00:00 29/01/2018 16:00:00
Session 2 31/01/2018 10:00:00 31/01/2018 12:00:00
Session 3 02/02/2018 14:00:00 02/02/2018 16:00:00
Quiz
Name Start End
Proctored Quiz 05/02/2018 09:00:00 20/02/2018 23:00:00
Assignment
Name Start End
Assignment Proctored 05/02/2018 09:00:00 -
Delivered by
With an objective to enhance the faculty’s pedagogical and intellectual exposure, senior IIT Faculty will train the local faculty on the topics which were delivered in QEEE so that local faculty can deliver the topic to students using Coursepack. The training is a remote session for 2 hrs. A certificate is awarded to local faculty who delivers the topic and administers the proctored exam to students
Note : These courses are already delivered in QEEE and available as Coursepack. Thus Live Classes will not be available. The college to schedule and deliver the course using Coursepack and students should attend the proctored quiz and assignment to be eligible for certificates.
Basic Graph Algorithms - Design and Analysis of Algorithms
Basic Graph Algorithms - Design and Analysis of Algorithms
Basic Graph Algorithms - Design and Analysis of Algorithms
Start Date : 20/02/2018 09:57:15
End Date : 30/04/2018 23:00:00
Topic Outline

Relevant Course: Analysis and Design of Algorithms

Relevant Department : Computer Science and Engg /MCA

Relevant Semester: Typically 4th- 5th Sem of 4 year B.Tech Program.

Pre-requisite: A course in Basic Programming (any language) and Data Structures.Balanced binary search trees and heaps.

Course Description & Outline :

1. Basic Graph Algorithms like Topological sort, Strong connectivity

2. Greedy algorithms with Minimum Spanning trees and Union Find

3. Shortest Path algorithms like Dijkstra, Floyd Warshall

Session Schedule
Name Start End
Session 1 20/02/2018 10:00:00 20/02/2018 12:00:00
Quiz
Name Start End
Proctored Quiz 21/02/2018 18:00:00 30/04/2018 23:00:00
Assignment
Name Start End
Assignment - Proctored 21/02/2018 09:00:00 -
Delivered by
Prof. Sandeep Sen IIT Delhi
BJT, MOSFET And Amplifiers - Analog Electronic Circuits
BJT, MOSFET And Amplifiers - Analog Electronic Circuits
BJT, MOSFET And Amplifiers - Analog Electronic Circuits
Start Date : 20/02/2018 09:57:15
End Date : 30/04/2018 22:00:00
Topic Outline

Relevant Course: Analog Electronics

Relevant Department: EE/ECE/Instrumentation

Relevant Semester: III/IV semester

Pre- requisite : Basic Network Analysis

Course Description & Outline :

Lecture: 1 (2 hours)

  • Overview on the working principle of BJT and MOSFET
  • Characteristics equations of BJT and MOSFET, Comparison between BJT and MOSFET
  • Deriving the small-signal model for BJT and MOSFET using two port Y-parameter network
  • Second order effects associated with BJT and MOSFET, inclusion of second order effects in the small-signal model
  • Small-signal and large-signal signal understanding
  • Ideal specifications for the voltage-voltage amplifier

Lecture: 2 (2 hours)

  • DC biasing techniques across process, voltage and temperature (PVT) corners
  • Role of coupling and decoupling capacitors
  • Input impedance, output impedance and loading effects
  • Small-signal AC gain analysis for common emitter (CE), common collector (CC) and common base (CB) amplifiers for BJT and common drain (CD), common source (CS) and common gate (CG) amplifiers for MOSFET

Lecture: 3 [2 hours]

  • Single ended, pseudo differential and fully differential amplifier configurations
  • Advantage of differential over single ended amplifier
  • Small-signal differential AC gain analysis for CE, CC and CB amplifiers for BJT and CD, CS and CG amplifiers for MOSFET
  • Common-mode gain analysis for CE, CC and CB amplifiers for BJT and CD, CS and CG amplifiers for MOSFET, Common-mode rejection ratio

Text book:

  • “Fundamentals of microelectronics” by Behzad Razavi.
Session Schedule
Name Start End
Session 1 13/02/2018 10:00:00 13/02/2018 12:00:00
Quiz
Name Start End
Proctored Quiz 22/02/2018 09:00:00 30/04/2018 22:00:00
Assignment
Delivered by
Design of Feedback in Control Systems
Design of Feedback in Control Systems
Design of Feedback in Control Systems
Start Date : 20/02/2018 09:57:15
End Date : 30/04/2018 23:00:00
Topic Outline

Relevant Course: Control Systems

Relevant Department: B.Tech (EE/ECE/ME)

Relevant Semester: Final Year 

Pre- requisite : Network analysis / Signals and systems

Preamble: Control Systems Engineering plays an important part in modern technological systems. The scope and benefits of an improved control strategy in the industry can be immense. However, a difficulty with this subject is perhaps that some of the more advanced aspects depend on sophisticated mathematical background. I intend to keep the mathematics at a reasonable basic level, thereby focusing on an application of the control theoretic tools. This short course covers two topics, which comprise a total of 8 hours of
lectures and 2 hours of tutorials.

Course Description & Outline :

Module 1: [2 hours]

  • Feedback structures
  • Nominal sensitivity functions
  • Closed-loop stability based on the characteristics polynomial
  •  Root locus
  •  Nominal and relative stability

Module 2: [2 hours]

  • PID structure and Empirical tuning
  • Ziegler-Nichols (Z-N) Oscillation Method
  • Reaction Curve Based Methods
  • PI and PID Synthesis Revisited using Pole Assignment
  • Smith Predictor

Textbook:

1. G.C. Goodwin, S.F. Graebe, M.E. Salgado, Control system design, Prentice Hall, 2001.

Session Schedule
Name Start End
Session 1 12/02/2018 14:00:00 12/02/2018 16:00:00
Quiz
Name Start End
Proctored Quiz 21/02/2018 18:00:00 30/04/2018 23:00:00
Assignment
Name Start End
Assignment Proctored 22/02/2018 18:00:00 -
Delivered by
Heat Transfer
Heat Transfer
Heat Transfer
Start Date : 20/02/2018 09:57:15
End Date : 30/04/2018 23:00:00
Topic Outline

Relevant Course: Heat Transfer

Relevant Department : Mechanical Engineering

Relevant Semester: 3rd year

Pre-requisite: None

Course Description & Outline :

Introduction – Steady State Conduction in one and two - dimensional systems - One dimensional unsteady state conduction; analytical and numerical methods

Convection: Basic equations, Boundary layers; Forced convection: External and internal flows, correlations, Natural convection

Radiation heat transfer: Basic laws, Properties of surfaces, view factors, network method and enclosure analysis for gray – diffuse enclosures containing transparent media

Boiling and condensation

Analysis of heat exchangers

1) Radiation: Fundamental concepts 

2) Radiation: View factor and calculation

3) Radiation exchange between surfaces and enclosures

Session Schedule
Name Start End
Session 1 15/02/2018 14:00:00 15/02/2018 16:00:00
Quiz
Name Start End
Proctored Quiz 21/02/2018 16:00:00 30/04/2018 23:00:00
Assignment
Delivered by
Object Oriented Concepts Classes and Data Abstraction - Operator Overloading Inheritance
Object Oriented Concepts Classes and Data Abstraction - Operator Overloading Inheritance
Object Oriented Concepts Classes and Data Abstraction - Operator Overloading Inheritance
Start Date : 20/02/2018 09:57:15
End Date : 30/04/2018 22:00:00
Topic Outline

Relevant Course: Object Oriented Programming

Relevant Department : Computer Science and Engineering, Information Technology, Electrical Engineering, Electrical Communication Engineering, other departments who may be interested in learning object-oriented methodology.

Relevant Semester: Third to Sixth

Pre-requisite: Basic programming course (Fortran or C or Python).

Course Description & Outline :

This module would introduce solving a problem by thinking about objects and the associated methods, rather than by merely splitting it into procedural steps. Students would learn about how to organize various objects into a common form of classes, how to define the interface to access its members, and how to hide unwanted details. To ease programmability, some languages support redefining an operator or a function; students would learn about this as operator overloading. Finally, reusing class definitions, we would learn about inheriting properties of an existing class to define a new one. Together, this would form a solid base in kickstarting OOP

Session Schedule
Name Start End
Session 1 15/02/2018 10:00:00 15/02/2018 12:00:00
Quiz
Name Start End
Proctored Quiz 22/02/2018 09:00:00 23/02/2018 09:00:00
Proctored Quiz 22/02/2018 09:00:00 30/04/2018 22:00:00
Assignment
Name Start End
Assignment - Proctored 22/02/2018 09:00:00 -
Delivered by
Prof. Rupesh Nasre IIT Madras
Pointers - Programming in C and Data Structures
Pointers - Programming in C and Data Structures
Pointers - Programming in C and Data Structures
Start Date : 22/03/2018 05:29:00
End Date : 27/08/2017 16:00:00
Topic Outline

Relevant Course: Programming in C and Data Structures

Topic Name: Pointers

Relevant Department: Computer Science

Relevant Semester: 

Pre- requisites: Basic programming skills in C; basics of algorithms

Topic Description and Outline:

  • Introduction to pointers as a data type; declaration and use; pointer arithmetic; expression evaluation involving pointers, chain of pointers, structure and pointers.
  • Pointers and multi-dimensional arrays; Function definition and call using pointers; static and dynamic memory allocation; introduction to heap memory; use of malloc() and free() for dynamic memory;
  • Introducion of a singly list data structure; Basic operations on a singly linked list: traversal(), length(), insertion(), deletion(), merge(); search(); sort(); etc.; intuitive algorithm and worst case time complexity of each operation.
  • Implementation of linked lists using struct and pointers; Common runtime errors with use of pointers and their redressal. Use of debuggers to detect pointer related run-time errors. Problem solving using singly linked lists.
Session Schedule
Name Start End
Faculty Training Session 07/08/2017 14:00:00 07/08/2017 16:00:00
Quiz
Assignment
Delivered by
Signals, Systems and Communications
Note : These courses are already delivered in QEEE and available as Coursepack. Thus Live Classes will not be available. The college to schedule and deliver the course using Coursepack and students should attend the proctored quiz and assignment to be eligible for certificates.
Classification of Signals and System - Introduction to Signals and Systems
Classification of Signals and System - Introduction to Signals and Systems
Classification of Signals and System - Introduction to Signals and Systems
Start Date : 22/03/2018 05:29:00
End Date :
Topic Outline

Relevant Course:Introduction to Signals and Systems

Relevant Department :

Relevant Semester:3rd

Pre-requisite:Familiarity with basic mathematics (functions, exponential and sinusoidal functions)

Course Description & Outline :

  • Discrete and Continuous Signals
  • Signals of Significance (Sinusoids, Exponentials, Step and Impulse Signals)
  • Basic Operations on Signals
  • Discrete and Continuous Systems
  • Classification of Systems
    • Linear and Non-linear
    • Stable and Unstable
    • Causal and Non-causal
    • Time-varying and Time-invariant
  • LTI Systems and Convolution
Session Schedule
Quiz
Assignment
Name Start End
Assignment - Proctored 13/03/2018 09:00:00 -
Delivered by
Convolution and Frequency Domain Analysis - Signals and Systems
Convolution and Frequency Domain Analysis - Signals and Systems
Convolution and Frequency Domain Analysis - Signals and Systems
Start Date : 22/03/2018 05:29:00
End Date :
Topic Outline

Relevant Course: Signals and Systems

Relevant Department : ECE & EE Instrumentation branches 

Relevant Semester: 3th / 4th Semester 

Pre-requisite: Understanding of Calculus

Course Description & Outline :

Linear time-invariant systems and their processing by convolution.

Session Schedule
Quiz
Assignment
Delivered by
Digital Communication Systems
Digital Communication Systems
Digital Communication Systems
Start Date : 22/03/2018 05:29:00
End Date :
Topic Outline

Relevant Course : Digital Communication Systems

Relevant Department : Electrical Engineering

Relevant Semester : 6

Pre- requisite : Capitalization

1. Why digital modulation? Baseband vsPassband signals, Signal representation using orthonormal basis, signal constellation, definitions for energy per symbol, energy per bit, noise power

2. Symbol-by-symbol signaling using rectangular (infinite bandwidth) signals, Matched Filter (MF) receiver, definition of SNR, Nyquist pulse-shaping for band-limited signals, timing recovery and inter-symbol interference (ISI), definition of excess bandwidth factor, symbol rate, bit-rate, Computing probability of symbol error for band-limited AWGN channels for important linear modulation schemes (PAM, PSK, and QAM), Orthogonal signaling and FSK

3. Communication through ISI channels optimal receiver based on sequence estimation, MAP and ML criteria , sub-optimal receiver using equalization, linear MMSE criteria based equalization, linear and decision-feedback equalization, defining equalizer using second order statistics the Wiener filter

4. Introduction to adaptive equalization, introduction to block modulation and OFDM

5. Tutorial session

Session Schedule
Quiz
Assignment
Delivered by
Prof.Giridhar K IIT Madras
Frequency Domain Analysis - Control System Design
Frequency Domain Analysis - Control System Design
Frequency Domain Analysis - Control System Design
Start Date : 22/03/2018 05:29:00
End Date :
Topic Outline
Session Schedule
Quiz
Assignment
Delivered by
Frequency Domain Representation of Continuous Time Signals - Signal and Systems
Frequency Domain Representation of Continuous Time Signals - Signal and Systems
Frequency Domain Representation of Continuous Time Signals - Signal and Systems
Start Date : 22/03/2018 05:29:00
End Date :
Topic Outline

Relevant Department: Electrical

Relevant course: Signal & Systems

Relevant Semester: 4th Sem

Relevant Topics: Frequency Domain Representation of Continuous-time Signals

Prerequisites: Impulse and Step functions, Complex exponential functions, Linear time-invariant systems

Course Outline:

Brief review of LTI sytems and Convolution
Eigen functions of LTI systems
Motivation for Frequency domain representation
Fourier Series
Properties of Fourier Series
Linearity
Convolution
Multiplication
Duality
Parsevals Theorem
Fourier transforms and Properties
Application of Fourier Transforms
Amplitude Modulation in Communication Systems

Reference:

A.V. Oppenheim and A.S. Willksy, "Signals and Systems", 2nd edition, Prentice Hall India, 1996.

Session Schedule
Quiz
Assignment
Delivered by
Introduction to Signal and Systems
Introduction to Signal and Systems
Introduction to Signal and Systems
Start Date : 22/03/2018 05:29:00
End Date : 30/04/2018 22:00:00
Topic Outline
Session Schedule
Quiz
Name Start End
Proctored Quiz 13/03/2018 09:00:00 30/04/2018 22:00:00
Assignment
Name Start End
Assignment-I 09/08/2017 00:00:00 -
Assignment-II 09/08/2017 00:00:00 -
Delivered by
Modern Wireless Communication Systems - Wireless Communication
Modern Wireless Communication Systems - Wireless Communication
Modern Wireless Communication Systems - Wireless Communication
Start Date : 22/03/2018 05:29:00
End Date :
Topic Outline

Relevant Course:

Relevant Department :

Relevant Semester:

Pre-requisite:

Course Description & Outline :

Wireless broadband access is the only solution to provide high-speed internet and data connections in many regions of the world. Cellular networks developed for supporting mobile users is increasingly seen as the bedrock of broadband access, with wireless LAN networks playing a supporting role, especially indoors.

Cellular mobile networks have evolved from 2G (TDMA based GSM with 200KHz bandwidth), to 3G (spread spectrum W-CDMA with 5MHz bandwidth), and currently to 4G (OFDM/OFDMA based LTE with 20MHz bandwidth). The key issue that we would like to address in our talks is: Why did the bits-to-waveform mapping scheme change from TDMA to CDMA to OFDM when the bandwidth (and hence the bit-rate) of the wireless signal was increased?

We motivate the reason for this evolution to OFDMA by focusing on four aspects of a modern cellular system: (a) Ability to handle time-of-flight differences between different mobile uplink signals connected to the base-station, (b) Complexity of the optimal receiver in multipath channels, (c) Ability to manage co-channel interference, and (d) Flexibility of resource allocation. We will interpret the above three mapping schemes using a “channel coding based framework” to show why OFDMA has become the scheme of choice for modern wireless communications. The five lectures will be done with minimal mathematics and notation, but will instead use simple figures, relevant properties of linear systems, and common sense, to bring home the main learnings. 

Session Schedule
Quiz
Assignment
Delivered by
Prof.Giridhar K IIT Madras
Project Activity - Signals Systems and Communications
Project Activity - Signals Systems and Communications
Project Activity - Signals Systems and Communications
Start Date : 15/02/2018 17:19:55
End Date :
Topic Outline

Lab assignment 1

 

 

Goal of the assignment: To teach the simulation of the performance of basic digital communication system and compare it with theoretical performance learned in the course.

 

Pre requisite modules: Digital Communication Systems by Dr. K. Giridhar

 

Time required: 2 hours

 

 

Description: A fundamental goal of digital communications is to transmit bits from one point to other. However, the transfer of information is made difficult by the presence of thermal noise. Noise introduces errors in the transmission of information and the goal of the exercise is to compute the bit error rate and symbol error rate through a computer simulation. The basic block diagram of a basic communication system with unlimited-bandwidth  is as follows

We first look at BPSK modulation. The first block generates bits {0,1} uniformly randomly. In the second block the bits are mapped to the BPSK constellation, i.e., 0à -1 and 1à1.  These values are passed through a channel. In this lab assignment, we will assume an Additive White Gaussian Noise Channel (AWGN). In this channel, Gaussian noise is added to the transmitted symbols. For the demodulation, the received point is mapped to the closest point in the constellation and hence the bits are obtained.

 

We are interested in simulating the bit error rate (BER) and symbol error rate (SER) of the system. Observe that the randomness comes from two sources: 1) The randomness in the bits. 2)The randomness in the channel.  To find the BER and SER of the system, we use Monte-Carlo simulation. In Monte-Carlo simulation, we continuously (in a loop) transmit bits, map to constellation, add noise and then demodulate. The pseudo code for BPSK simulation is as follows

 

 

N=1000 //No of times it should be simulated

For a given SNR, find the noise to be added.

 

Errors =0;

For k=1 to N

Step 1: Generate a bit

Step 2: Map the bit to a constellation

Step 3: Add noise to the generated constellation point

 

Step 4: Demodulate the received point to the nearest constellation point and hence obtain the bit.

 

Step 5: See if an bit error occurred by comparing the transmitted bit to the demodulated bit.

If (error occurred)

Errors =Errors +1;

End if

 

 

End for

 

SER = BER = Errors/N;

 

N should be large enough so that the simulation converges.  The thumb rules is N should approximately be 100/BER;

 

 

 

Lab Assignment:

 

  • Find the BER of the BPSK system with SNR=20dB (THIS PARAMETER CAN be CHANGED). What is the corresponding SER (symbol error rate).
  • Find the BER of the 4-QAM system with SNR=10dB. For 4-QAM modulation, the bits have to be mapped to QAM constellation points [ (1+i)/sqrt(2), (1-i)/sqrt(2), (-1+i)/sqrt(2), (-1-i)/sqrt(2)]. Since there are four constellation points, each point corresponds to two bits. Also Complex Gaussian noise have to be added in the channel. ). What is the corresponding SER (symbol error rate)?

 

 

 

Additional Bonus

 

  1. Plot the BER (and SER) for SNR = 0dB to 12 dB in increments of 1 dB for BPSK constellation. Also plot the theoretical BER obtained in your class. What do you observe?

 

 

 

 

 

 

 

 

 

Lab assignment 2

 

Goal of the assignment:  To understand the concept of matched filtering and RRC filtering.

 

Pre requisite modules: Digital Communication Systems by Dr. K. Giridhar

 

Time required: 2 hours

 

 

In assignment 1, we have assumed no limit on the bandwidth of the system. However, the channel acts like a bandlimited filter and this limits the rate at which we can transfer information. In this exercise, for ease of understanding, we assume an IDEAL bandlimited filter of bandwidth W=1/T. We use an filter (excess bandwidth) at both the transmitter and the receiver from BW –W to +W. We will look at the BER performance of the system.

We look at BPSK transmission over this channel. We will be using Root-Raised-Cosine filter. So the simulation is very similar to Assignment 1. However, since filtering operation is necessary, the sequence of constellation points have to be oversampled at a factor K>1. Similarly the RRC filter has to be oversampled to the same factor before  filtering (convolution). Also you should make sure undersample after the receive filtering and before demodulation. The delay of the filter has to be carefully taken into account so that the sampling instant is correct and inter symbol interference does not occur.

 

Lab Assignment:

 

  • Find the BER of the BPSK system with SNR=20dB (THIS PARAMETER CAN be CHANGED) and excess bandwidth factor of 0.3 (30% excess bandwidth).
  • Find the BER of the BPSK system with SNR=20dB (THIS PARAMETER CAN be CHANGED) and excess bandwidth factor of 0 (0% excess bandwidth).

 

 

 

 

 

Lab assignment 3

Goal of the assignment:  To understand the effect of a channel filter and inter-symbol-interference.

 

Pre requisite modules: Digital Communication Systems by Dr. K. Giridhar

 

 

In the previous assignment, we looked at the effect of Bandlimited signalling and Nyquist pulses. Also in the previous assignment, the channel was a flat and an ideal channel in the frequency domain. In this assignment, we will look at non-ideal channels and their effect on performance. We will look at a simple concept of zero-forcing receiver when the channel is known at the receiver.  We will focus on the 1+0.9D filter (i.e., a two-tap filter with taps (1, 0.9)) and look at how to equalize it. We will also assume that this filter is known at the receiver.

In the discrete domain, we have y[k] = x[k]+0.9 x[k-1] + z[n], where x[k] is the input to the channel, y[k] is the output of the channel and z[n] is the additive white Gaussian noise with variance sigma^2. We will also assume that the power of the input symbols is unity, i.e.,  E[|x[k]|^2]=1. The goal of the exercise is to recover x[k] from the channel outputs y[k].  The ideal way of doing this is to use a Sequence ML receiver (Viterbi). However, such a receiver has high complexity and in this exercise, we will look at simpler sub-optimal algorithms to recover the data.  We look at two solutions: The simplest is the zero forcing filter. A slightly more complex filter is the MMSE filter. Both these filters are simple filters that equalize the channel. In both these cases, we want to design a filter of length L,  W = [w[L], W[L-1], …, W[1]]. Let Y_k  be the vector Y_k =[y[k], y[k-1], …., y[k-L+1]].  We want to design the filter W such that

 

     x[k-m] = W*(Y_k)^T,

i.e., the inner product of W and Y_k gives the symbol x[k-m] for some m>0. This can also be thought of as filtering the sequence with the filter W.  The output of the filter is the equalized data.

 

We first begin with the simple zero-forcing equalizer.

 

  • Determine a zero forcing based linear filter for the (1,0.9) to equalize and obtain the data. Find the filter for m=4 and L=8;
    1. What is the performance for sigma^2 = 10dB.
    2. What is the performance for sigma^2 = 30dB

 

 

 

 

 

Session Schedule
Quiz
Assignment
Name Start End
Assignment 13/11/2017 09:00:00 -
Delivered by
Space Time Codes, MIMO and Massive MIMO Part 1 - Wireless Communication
Space Time Codes, MIMO and Massive MIMO Part 1 - Wireless Communication
Space Time Codes, MIMO and Massive MIMO Part 1 - Wireless Communication
Start Date : 22/03/2018 05:29:00
End Date : 30/04/2018 22:00:00
Topic Outline

Relevant Course: Wireless Communication

Relevant Department : Electrical Engineering

Relevant Semester: Nil 

Pre-requisite: The knowledge of Digital Communication and Wireless Communication is Preferable

Course Description and Outline :

Space-Time Codes and MIMO

Part I – Introduction

  • Diversity to combat erasures and fadings
  • The multiple antenna channel model. 
  • Coding gain and diversity in MIMO channels

Part II - Information Theory

  •  Capacity when channel is unknown at transmitter
  •  Outage probability for non-ergodic channels.

Part III - Coding 

  • Quick introduction to STBC.
  • Code design criteria for block fading channels.
  • Example of an LDPC code for MIMO channels.

Massive MIMO

Part 1

  • Motivation and Case Studies 
  • Models and Fundamental Assumptions 
  • Favorable Propagation 
  • Single-Cell Operation

Part 2 

  • Uniform User Performance
  • Impact of Hardware Impairments
  • Energy Efficiency
  • Myths around Massive MIMO
Session Schedule
Quiz
Name Start End
Proctored Quiz 13/03/2018 09:00:00 30/04/2018 22:00:00
Assignment
Delivered by
Time domain analysis of first and second order system - Control Systems
Time domain analysis of first and second order system - Control Systems
Time domain analysis of first and second order system - Control Systems
Start Date : 22/03/2018 05:29:00
End Date :
Topic Outline

Relevant Course: Control Systems

Relevant Department: B.Tech (EE/ECE/ME)

Relevant Semester: 2nd and 3rd year 

Pre- requisite : Network analysis / Signals and systems

Course Description & Outline :

Module 1: [2 hours]

  •  Transfer function and state-space model
  •  Standard process inputs
  •  Response of first-order systems
  •  Response of integrating systems

Module 2: [2 hours]

  •  Response of second-order systems
  •  Poles and zeros and their e ffects on system response
  •  Systems with time-delays
  •  Approximation of higher-order transfer functions

Textbook:

1. D.E. Seborg, T.E. Edgar, D.A. Mellichamp, Process Dynamics and Control, John Wiley & sons, second edition, 2004.

Session Schedule
Quiz
Assignment
Name Start End
Assignment - Proctored 13/03/2018 09:00:00 -
Delivered by
Language Processors
Note : These courses are already delivered in QEEE and available as Coursepack. Thus Live Classes will not be available. The college to schedule and deliver the course using Coursepack and students should attend the proctored quiz and assignment to be eligible for certificates.
Compiler Design
Compiler Design
Compiler Design
Start Date : 22/03/2018 05:29:00
End Date : 30/04/2018 22:00:00
Topic Outline

Relevant Course: Compiler Design

Relevant Department: Computer Science and Engineering

Relevant Semester: Semester 5 or 6 in 8 semester program 

Pre- requisite : Programming Languages,Data Structure and Algorithms,Computer Architecture & Discrete Structure or Theory of computation

 Course Description and Outline

1. Grammars for Programming Language constructs : sample grammars for following lingistic constructs found in languages such as C, C++, Java :

  • Declaration processing – scalar data types; derived data types arrays, pointers, functions, class
  • Assignment; expressions involving common operators on integers, chars, strings, floats; complex expressions involving other operators (unary, bits, logical, etc)
  • Control statements : if-then-else, switch, loops, break, continue, function calls, etc.
  • Function definitions

2. Basics of LR Parsers :

  • Principles of Bottom-up parsing, context free grammar, rightmost derivation and parse trees
  • Structure of a LR parser : parsing table, stack, driver routine; FIRST and FOLLOW information
  • Illustration of working of a manually constructed LR parser
  • LR(0) item, states of an LR() automaton, relation between and LR automaton and parsing table
  • key concepts of viable prefixes and valid items, conflicts in LR parser : shift-reduce and reduce- reduce

3. LALR(1) Parser construction

  • LALR(1) items, lookaheads attached, split of SLR(1) states based on lookahead,
  • Properties of LALR(1) parser : size advantage of SLR; as powerful as canonical LR(1) with respect to shift-reduce conflicts; wit respect to reduce-reduce conflicts - less powerful than LR(1) but better than SLR(1); proof outlines only
  • Manual construction of a few LALR(1) parsers for small grammars

4. Using YACC for generating Parsers

  • YACC syntax for writing CFGs – purpose of the different sections; skip LEX hence hardcoded tokens only
  • Generating a parser using YACC : how to read the important generated files – y.output;y.tab.c; y.tab.h
  • Correlate the LALR(1) automaton with the concepts learned; interpret the conflicts, if any.
  • Use the generated parser to parse sample inputs.
  • Using the debugging option to show the parser working in ints entire glory.

5. Tutorial on the problem solving aspects including writing grammars, constructing few states of a parser, FIRST and FOLLOW sets, given a state write viable prefixes corresponding to it, given a viable prefix write all the items of the associated state.

6. Experiments on YACC as detailed in Item 4 above.

Session Schedule
Quiz
Name Start End
Proctored Quiz 13/03/2018 09:00:00 30/04/2018 22:00:00
Assignment
Delivered by
Introduction to Compilers - Compiler Design
Introduction to Compilers - Compiler Design
Introduction to Compilers - Compiler Design
Start Date : 22/03/2018 05:29:00
End Date :
Topic Outline

Relevant Course: Compiler Design

Relevant Department : Computer Science

Relevant Semester: 5th& 7th 

Pre-requisite: Discrete Mathematics, Automata Theory

Course Description & Outline :

The lectures would introduce students to the process of compiling programs. Students would know various phases of a compiler and would learn the brief functionality of each phase. The lectures would also introduce a few concepts useful for understanding the rest of the topics.

Session Schedule
Quiz
Assignment
Delivered by
Prof. Rupesh Nasre IIT Madras
Operator Overloading - Object Oriented Programming
Operator Overloading - Object Oriented Programming
Operator Overloading - Object Oriented Programming
Start Date : 22/03/2018 05:29:00
End Date :
Topic Outline

Relevant Course: Object Oriented Programming

Topic Name: Operator Overloading

Relevant Department: Computer Science

Relevant Semester: Fourth to Eighth

Pre- requisites: Programming Experience (C / C++ / Java / Python)

Topic Description and Outline: Overloading operators, rules for overloading operators, overloading of various operators, Overloading the >> and << Operators,Overloading the new and the delete Operators, Overloading the Array Subscript Operator, Overloading the Pointer-to-member(->) Operator (Smart Pointer)

 

 

Session Schedule
Quiz
Assignment
Delivered by
Prof. Rupesh Nasre IIT Madras
Syntax Directed Translation - Compiler Design
Syntax Directed Translation - Compiler Design
Syntax Directed Translation - Compiler Design
Start Date : 22/03/2018 05:29:00
End Date :
Topic Outline

Relevant Course: Compiler Design

Relevant Department : Computer Science

Relevant Semester: 5th/6th

Pre-requisite: 

Data Structures, Formal Methods, Programming, C programming, Computer Organization.

Course Description & Outline :

- Syntax Directed Definition (Briefly)

- Syntax Directed Translation Scheme (main focus)

- Attribute grammars

- Implementing SDDs and SDTs

- Evaluating SDTs

- Using SDTs to generate three address code.

Plan:

Quiz at the end of the module

Programming assignment.

Session Schedule
Quiz
Assignment
Delivered by

Networking and Security Minor:

Networking and Security Minor provides a broad understanding of the data communication networks and information security principles. The hands-on activity covers the comprehensive applications of the concepts in networks and security.

Note : These courses are already delivered in QEEE and available as Coursepack. Thus Live Classes will not be available. The college to schedule and deliver the course using Coursepack and students should attend the proctored quiz and assignment to be eligible for certificates.
Computer Networks
Computer Networks
Computer Networks
Start Date : 22/03/2018 05:29:00
End Date :
Topic Outline

Relevant Course : loosely organized along the Internet protocol stack

Relevant Department : Computer Science Engineering 

Relevant Semester : 3 to 8

Prerequisite : Data Structures and Algorithms 

The content of the course is loosely organized along the Internet protocol stack. The course will cover all the five layers of the stack: Physical, Data-Link, Network, Transport and Application layers in depth. Actual content as covered as part of the layers is detailed below. Where necessary, the principle behind the concepts, the thought process that goes behind along with real-world examples are emphasized. Plenty of practice problems to help you apply what you learn.

Course Content

  1. Introduction, history and Layering
  2. Physical Layer: Theory, Encoding techniques
  3. Link Layer: Framing, Error detection and recovery, Reliability, Multiple Access, Ethernet, Token Ring, Switching
  4. Network Layer: Addressing, Routing, IP
  5. Transport Layer: Reliability and Congestion Control
  6. Application Layer: DNS, Web/HTTP, Email, FTP

The Computer Networks course require that you watch VIDEO LECTURES of the material,BEFORE the interactive session. This is MANDATORY. The interactive session will involve Q&A as well as problem solving. You have been provided a login on http://bodhitree3.cse.iitb.ac.in/ which has the videos. If you have trouble accessing this, write to bodhitree@cse.iitb.ac.in with the subject line "[QEEE: BodhiTree Login Issue]"

Session Schedule
Quiz
Assignment
Delivered by
Information Security and Cryptography
Information Security and Cryptography
Information Security and Cryptography
Start Date : 22/03/2018 05:29:00
End Date :
Topic Outline

Relevant Course: Cryptography and Network Security

Relevant Department :  Computer Science and Engineering 

Relevant Semester: Final year

Pre-requisite: Discrete Mathematics, Basic probabilty theory

Course Description & Outline :

The content of the course

  •  Classical Cryptography
  •  Block Ciphers (design, linear cryptanalysis, differential cryptanalysis, DES, AES)
  •  Public Key Ciphers (and RSA)
Session Schedule
Quiz
Assignment
Delivered by
Input and Output Streams -Interfaces, Packages Collections and Vectors,Files- OOPS
Input and Output Streams -Interfaces, Packages Collections and Vectors,Files- OOPS
Input and Output Streams -Interfaces, Packages Collections and Vectors,Files- OOPS
Start Date : 22/03/2018 05:29:00
End Date :
Topic Outline

Relevant Course:OOPS

Relevant Department :Computer Science

Relevant Semester:3rd & 5th

Pre-requisite:Introduction to C++

Course Description & Outline :

This module would introduce students to perform input / output functions using C++. The I/O functions are organized such that the same interface can be used to output on standard output device, files on disk, for writing to strings etc. We will explore these interfaces and learn how to implement your own interface -- such as writing to a socket or to a database.

Session Schedule
Quiz
Assignment
Delivered by
Prof. Rupesh Nasre IIT Madras
Network Layer - Computer Networks
Network Layer - Computer Networks
Network Layer - Computer Networks
Start Date : 22/03/2018 05:29:00
End Date :
Topic Outline

Routing' is a very generic concept and is concerned with finding path(s) from the source to the destination(s) , Often, one wants to nd the `best' path ,
Routing layer issues : To determine best path, we need to know detailed network structure.Organisation of the module :Addressing in link layers and in the Internet.
Link layer `routing' because there is some routing in this layer.
Routing algorithms

Session Schedule
Quiz
Assignment
Name Start End
Assignment-Proctored 13/03/2018 09:00:00 -
Delivered by
Prof. Manjunath D IIT Bombay
Project Activity - Networking Security
Project Activity - Networking Security
Project Activity - Networking Security
Start Date : 15/02/2018 17:19:55
End Date :
Topic Outline In this practical module, students are exposed to writing and executing networking code through three small programming micro-projects. Each student is assigned unique data sets to work on for their individual micro-projects, and their code is automatically evaluated by scripts that provides immediate feedback whether their code has correct functionality. The first micro-project introduces the packet, which is at the core of networking. Students have to use the Wireshark tool to examine packets generated during file transfer done through an ftp application which uses tcp/ip for transport over a (wired or wireless) ethernet connection. Students will report the values of some of the fields that are central to networking, such as source and destination IP address, source and destination MAC address etc. A large portion of networking code is implemented using socket programming. The second micro-project will help the student explore socket programming through simple client-server applications. This has two parts. In the first part, a simple TCP client is to be written. The server it will have to "talk" to will be running in the institute server, which can be used to verify the client written by students. The second part, would require the student to write a TCP server that responds to queries from a client. The client will be provided to the students so that they can verify the server that they have written. The third micro-project will take the student to the world of UDP socket programming(with broadcast) and cryptography. It will demonstrate how a simple virtual currency application that uses a distributed ledger implemented using peer to peer programming through broadcasts and public key encryption. Students have to write an agent that will work with other given agents to receive coins from a bank, exchange coins with others based on common truth formed by consensus about the number of coins possessed by each agent (in the presence of potentially malicious agents).
Session Schedule
Quiz
Assignment
Delivered by
Prof. G. Venkatesh IIT Madras
Public Key Cryptography - Information Security and Cryptography
Public Key Cryptography - Information Security and Cryptography
Public Key Cryptography - Information Security and Cryptography
Start Date : 22/03/2018 05:29:00
End Date :
Topic Outline

Relevant Department: Computer Science

Course Name: Information Security and Cryptography

Topic Name: Public Key Cryptography

 

Topic Outline

Day 1 : RSA, and primality checking algorithms

Day 2 : Attacks on RSA

Day 3 : Digital signatures, side channel analysis, and ECC

 

Session Schedule
Quiz
Assignment
Delivered by
Routing Algorithms - Computer Network
Routing Algorithms - Computer Network
Routing Algorithms - Computer Network
Start Date : 22/03/2018 05:29:00
End Date :
Topic Outline

Course Name: Computer Network

Topic Name: Routing Algorithms

Relevant Dept: CSC

TOPIC OUTLINE:

Routing protocols - both wired and wireless - latest developments

  1. Standard Stuff- IP Addresses
  2. Practical Deployment (Sockets)
  3. Issues related to mobile /wireless system and its latest developments
  4. Algorithms and congestion control its interactions with algorithm.
  5. Sockets
  6. End to end idea how a packet traverse
Session Schedule
Quiz
Assignment
Delivered by
Prof.Niloy Ganguly IIT Kharagpur