VIDEO TUTORIAL FOR INSTRUMENTATION ENGINEERING

Lecture Series on Electronics for Analog Signal Processing I by Prof. K. Radhakrishna Rao, Department of Electrical Engineering, IIT Madras.

1 - INTRODUCTION
2 - DIODE
3 - Amplifiers
4 - Bipolar Junction Transistor
5 - Metal Oxide Semiconductor
6 - Cascading Amplifiers
7 - The Differential Amplifiers
8 - Current Source and Current Sink
9 - NMOS Inverters and CMOS Inverters
10 - Active Components used in Electronics

SEQUENTIAL CIRCUIT DESIGN VIDEO TUTORIAL

21 - Synchronous Sequential Circuit Design [59:54]
22 - Design of Sequential Modules [59:56]
23 - Design of Registers and Counter [01:00:02]
24 - Finite State Machine Design [59:54]
25 - Finite State Machine Design and Optimization [59:58]

Video Lecture Series on Mathematics - III by Dr.P.N.Agrawal, Department of Mathematics, IIT Roorkee.

1 - Solution of ODE of First Order and First Degree [53:50]
2 - Linear Differential Equations of the First Order [50:03]
3 - Approximate Solution of An Initial Value [49:50]
4 - Series Solution of Homogeneous Linear [1:01:15]
5 - Series Solution of Homogeneous Linear [50:56]
6 - Bessel Functions and Their Properties [51:10]
7 - Bessel Functions And Their Properties(Contd..) [52:31]
8 - Laplace Transformation [53:26]
9 - Laplace Transformation(contd..) [55:58]
10 - Applications Of Laplace Transformation [59:53]
11 - Applications Of Laplace Transformation(Contd.) [59:23]
12 - One Dimensional Wave Equation [54:08]
13 - One Dimensional Heat Equation [55:28]


These video lectures are delivered by Prof P.N.Agrawal, Department of Mathematics, IIT Roorkee as a part of NPTEL project. After listening to these videos courses kindly post your comments and doubts.

Detailed Syllabus

COURSE OUTLINE

Sl no.	Topics and Contents	No of lectures	No of Modules
1	Complex Numbers and Complex Algebra: Geometry of complex numbers, Polar form, Powers and roots of complex numbers.	1	1
2	Complex Functions: Limits of Functions, Continuity, Differentiability, Analytic functions, Cauchy-Riemann Equations, Necessary and Sufficient condition for analyticity, Properties of Analytic Functions, Laplace Equation, Harmonic Functions, Finding Harmonic Conjugate functions	5	1
3	Elementary Analytic Functions: Exponential, Trigonometric, Hyperbolic functions and its properties. Multiple valued function and its branches - Logarithmic function and Complex Exponent function.	4	1
4	Complex Integration: Curves, Line Integrals (contour integral) and its properties. Line integrals of single valued functions, Line integrals of multiple valued functions (by choosing suitable branches). Cauchy-Goursat Theorem, Cauchy Integral Formula, Liouville, FTA, Max/Min Modulus Theorems.	5	1
5	Power Series: Convergence (Ordinary, Uniform, Absoulte) of power series, Taylor and Laurent Theorems, Finding Laurent series expansions.	2	1
6	Zeros, Singularities, Residues: Zeros of analytic functions, Singularities and its properties, Residues, Residue Theorem, Rouche’s Theorem, Argument Principle.	2	1
7	Applications of Contour Integration: Evaluating various type of indefinite real integrals using contour integration method.	4	1
8	Conformal Mapping and its applications: Mappings by elementary functions, Mobius transformations, Schwarz-Christofel transformation, Poisson formula, Dirichlet and Neumann Problems.	5	1
9	Solution in Series: Second order linear equations with ordinary points, Legendre equation, Second order equations with regular singular points, The method of Frobenius, Bessel equation.	4	1
10	Properties of Legendre Polynomials and Bessel Functions	2	1
11	Fourier Series: Orthogonal Family, Fourier Series of 2? periodic functions, Formula for Fourier Coefficients, Fourier series of Odd and Even functions, Half-range series, Fourier series of a T-periodic function, Convergence of Fourier Series, Gibb’s Phenomenon, Differentiation and Integration of Fourier series, Complex form of Fourier series.	4	1
12	Fourier Transforms: Fourier Integral Theorem, Fourier Transforms, Properties of Fourier Transform, Convolution and its physical interpretation, Statement of Fubini’s theorem, Convolution theorems, Inversion theorem, Laplace Transform.	4	1
13	Second order PDE: Second order PDE and classification of 2nd order quasi-linear PDE (canonical form)	1	1
14	Wave Equation: Modeling a vibrating string, D’Alembert’s solution, Duhamel’s principle for one-dimensional wave equation.	2	1
15	Heat Equation: Heat equation, Solution by separation of variables.	2	1
16	Laplace Equation: Laplace Equation in Cartesian, Cylindrical polar and Spherical polar coordinates, Solution by separation of variables.	3	1
17	Solution by Transform Methods: Solutions of PDEs by Fourier and Laplace Transform methods.	2	1

Video Lecture Series on Mathematics - II by Dr.Tanuja Srivastava, Department of Mathematics, IIT Roorkee

1 -Differential Equation Part - 1
2 -Differential Equation Part - 2
3 - Differential Equation of First Order
4 - Linear Differential Equation of Second Order Part - 1
5 - Linear Differential Equation of Second Order Part - 2
6 - Euler Cauchy Equation
7 - Higher Order Linear Differential Equations
8 - Higher Order Non Homogeneous Linear Differential Equation
9 - Boundary Value Problems
10 - Strum Liouville Boundary Value Problem
11 - Fourier Series Part - 1
12 - Fourier Series Part - 2
13 - Convergence and Sum of Fourier Series
14 - Fourier Integrals
15 - Fourier Transforms
16 - First Order Partial Differential Equations
17 - Partial Differential Equations
18 - Second Order Partial Differential Equations
19 - Second Order Partial Differential Equations
20 - Solution of One Dimensional Wave Equation

21 - Complex Integration
22 - Solution of Homogeneous and Non Homogeneous
23 - Contour Integration
24 - Fourier Integral and Transform Method
25 - Three Dimensional Laplace Equation
26 - Numerical Method for Laplace and Poisson
27 - Solution of Dirichlet Problem
28 - ADI Method for Laplace and Poisson Equation

29 - Cauchy's Integral Theorem

30 - Cauchy's Integral Formula
31 - Application of Cauchy Integral Formula
32 - Residue Integration Method
33 - Zeros, Singularities and Poles
34 - Residue Theorem
35 - Evaluation of Real Integrals
36 - Evaluation of Real Improper Integrals
37 - Evaluation of Real Improper Integrals - 2
38 - Evaluation of Real Improper Integrals - 3
39 - Evaluation of Real Improper Integrals - 4
40 - Evaluation of Real Integrals - Revision
41 - Matrix Algebra Part - 1
42 - Matrix Algebra Part - 2

43 - Determinants Part - 1
44 - Determinants Part - 2
45 - Lec 5 Solution of System Equation

46 - Linear Algebra Part-1
47 - Linear Algebra part - 2

Video Lecture series on Mathematics-1 by Prof S.K.Ray, Department of Mathematics and Statistics IIT Kanpur

1 - Real Number [56:59]

2 - Sequences I [54:48]
3 - Sequences II [44:02]
4 - Sequences III [52:02]
5 - Continuous Function [55:09]
6 - Properties of Continuous Function [01:01:04]
7 - Uniform Continuity [59:46]
8 - Differntiable Functions [55:21]
9 - Mean Value Theorem [50:18]
10 - Maxima - Minima [54:44]
11 - Taylor's Theorem [53:09]
12 - Curve Sketching [46:04]
13 - Infinite Series I [53:52]
14 - Infinite Series II [51:25]
15 - Tests of Convergence [55:48]

16 - Power Series [53:19]
17 - Riemann Integral [53:43]
18 - Riemann Integrable Functions [59:42]
19 - Applications of Riemann Integral [52:05]

20 - Length of a curve [57:52]
21 - Line Integrals [56:20]
22 - Functions of Several Variables [56:22]
23 - Differentiation [01:00:19]
24 - Derivatives [55:20]
25 - Mean Value Theorem [52:01]
26 - Maxima Minima [57:10]
27 - Method of Lagrange Multipliers [50:02]
28 - Multiple Integrals [52:16]
29 - Surface Integrals [59:53]
30 - Green's Theorem [52:34]
31 - Stokes Theorem [53:56]
32 - Guass Divergence Theorem [36:41]

Video lecture for Design and Analysis of Algorithms

Design and Analysis of Algorithms

1 - Overview of the course [51:51]
2 - Framework for Algorithms Analysis [56:21]
3 - Algorithms Analysis Framework - II [53:11]
4 - Asymptotic Notations [53:25]
5 - Algorithm Design Techniques : Basics [46:23]
6 - Divide And Conquer-I [52:09]
7 - Divide And Conquer -II Median Finding [52:55]
8 - Divide And Conquer -III Surfing Lower Bounds [56:48]
9 - Divide And Conquer -IV Closest Pair [1:03:38]
10 - Greedy Algorithms -I [51:18]
11 - Greedy Algorithms - II [53:58]
12 - Greedy Algorithms - III [50:43]
13 - Greedy Algorithms - IV [36:44]
14 - Pattern Matching - I [54:08]
15 - Pattern Matching - II [45:02]
16 - Combinational Search and Optimization I [54:40]
17 - Combinational Search and Optimization II [54:08]
18 - Dynamic Programming [52:18]
19 - Longest Common Subsequences [58:58]
20 - Matric Chain Multiplication [51:25]
21 - Scheduling with Startup and Holding Costs [54:01]
22 - Average case Analysis of Quicksort [48:16]
23 - Bipartite Maximum Matching [51:29]
24 - Lower Bounds for Sorting [48:39]
25 - Element Distinctness Lower Bounds [54:26]
26 - NP-Completeness-I -Motivation [58:15]
27 - NP - Compliteness - II [1:16:38]
28 - NP-Completeness - III [57:23]
29 - NP-Completeness - IV [1:10:10]
30 - NP-Completeness - V [41:18]
31 - NP-Completeness - VI [40:57]
32 - Approximation Algorithms [55:02]
33 - Approximation Algorithms [58:12]
34 - Approximation Algorithms for NP [53:38]

Video lecture for Database Design

Database Design

1 - Introduction to Database Management System [53:32]
1a - Conceptual Designs [53:40]
2 - Conceptual Designs [54:00]
3 - Relational Model [51:34]
4 - Relational Model [54:09]
5 - Structured Query Language [52:13]
6 - Structured Query Language II [54:57]
7 - ER Model to Relational Mapping [51:06]
8 - Functional Dependencies and Normal Form [57:52]
9 - ER Model to Relational Model Mapping [50:52]
10 - Storage Structures [54:55]
11 - Indexing Techniques Single Level [56:52]
12 - Indexing Techniques Multi-Level [56:25]
13 - Constraints and Triggers [57:30]
14 - Query Processing and Optimization [56:41]
15 - Query Processing and Optimization II [56:55]
16 - Query Processing and Optimization - III [57:19]
17 - Transaction Processing Concepts [55:31]
18 - Transaction Processing and Database Manager [51:47]
19 - Foundation for Concurrency Control [57:45]
20 - Concurrency Control Part - I [58:25]
21 - Concurrency Control Part - 2 [59:08]
22 - Concurrency Control Part - 3 [57:48]
23 - Concurrency Control Part - 4 [58:58]
24 - Distributed Transaction Models [58:25]
25 - Basic 2-Phase and 3-phase commit protocol [57:12]
26 - Concurrency Control for Distributed Transaction [58:23]
27 - Introduction to Transaction Recovery [55:23]
28 - Recovery Mechanisms II [57:10]
29 - Recovery Mechanisms III [55:43]
30 - Introduction to Data Warehousing and OLAP [57:49]
31 - Introduction to Data Warehousing and OLAP [58:11]
32 - Case Study : MYSQL [57:55]
33 - Case Study ORACLE and Microsoft Access [57:52]
34 - Data Mining and Knowledge Discovery [54:46]
35 - Data Mining and Knowledge Discovery Part II [57:59]
36 - Object Oriented Databases [57:49]
37 - Object Oriented Databases II [56:39]
38 - XML - Introductory Concepts [57:51]
39 - XML Advanced Concepts [57:40]
40 - XML Databases [58:12]
41 - Case Study - Part One Database Design [53:43]
42 - Case Study - Part 2 Database Design [58:36]

Video lecture for Operating System

Operating System

1 - Introduction to Operating System [51:42]
2 - Mutual Exclusion with Busy Wait [51:42]

Video Lecture Series on Computer Networks by Prof. S.Ghosh,Department of Computer Science & Engineering, I.I.T.,Kharagpur.

1 - Emergence of Networks & Reference Models [59:48]
2 - Network Topology [59:49]
3 - Physical Medium - I [59:52]
4 - Physical Medium - II [59:55]
5 - Multiplexing (Sharing a Medium) [59:53]
6 - Telecom Networks [59:54]
7 - Switches - I [59:50]
8 - Pocket Switches [59:44]
9 - SONET/SDH [59:59]
10 - Fiber Optic Components [59:51]
11 - Routing and Wavelength Assignment [59:53]
12 - Protection and Restoration [59:48]
13 - Multiple Access [59:50]
14 - Token Based Mac [59:52]
15 - Data Link Protocols [59:53]
16 - Error Control [59:49]
17 - Stop & Wait Protocol [59:50]
18 - Satellite Communication [59:51]
19 - Ethernet - CSMA/CD [59:46]
20 - Modern Ethernet [59:52]
21 - Local Internetworking [59:49]
22 - Cellular Networks [59:51]
23 - Wireless Network [59:54]
24 - ATM : Asynchronous Transfer Mode [59:49]
25 - ATM Signaling, Routing and LAN Emulation [59:41]
26 - Introduction to Routing [59:47]
27 - RIP - Distance Vector Routing [59:45]
28 - IP version 4 [59:39]
29 - IP Version 6 & Mobile IP [59:46]
30 - UDP & Client Server [59:53]
31 - TCP [59:51]
32 - IP Multicasting [59:55]
33 - DHCP and ICMP [59:53]
34 - DNS & Directory [59:49]
35 - Congestion Control [59:48]
36 - QOS & Multimedia [59:55]
37 - Network Management [59:55]
38 - Security [59:50]
39 - FTP - SMTP [59:40]
40 - HTTP [59:48]
These video lectures are delivered by IIT professors as a part of NPTEL project.

Detailed Syllabus

Overview of OSI reference model. Topology design, Media Access Control Level, Services, Problems and protocols, Practical local area network design and implementation. IEEE LAN Standards, Logical Link Control protocols, HDLC, ALOHA, SLOTTED ALOHA, FDDI, Client Server model and related softwares.

Network Layer level services, problems and protocols. WAN, MAN, interconnection networks related softwares, TCP/IP, Novel NetWare, Routers, Bridges and Gateways their Practical implementation aspects. X.25, Internet and related softwares NETSCAPE and MOSAIC.

Transport layer, services, problems and their protocol.

Brief functioning of upper layers, E-mail and other application.

Video Lecture Series on Data Structures and Algorithms by Dr. Naveen Garg, Department of Computer Science and Engineering ,IIT Delhi

Lecture Series on Data Structures and Algorithms by Dr. Naveen Garg, Department of Computer Science and Engineering ,IIT Delhi

1 - Introduction to Data Structures and Algorithms [53:31]
2 - Stacks [01:04:09]
3 - Queues and Linked Lists [01:00:35]
4 - Dictionaries [53:43]
5 - Hashing [01:01:22]
6 - Trees [43:14]
7 - Tree Walks / Traversals [51:10]
8 - Ordered Dictionaries [56:17]
9 - Deletion [58:32]
10 - Quick Sort [58:44]
11 - AVL Trees [53:41]
12 - AVL Trees [01:00:19]
13 - Trees [49:11]
14 - Red Black Trees [01:04:33]
15 - Insertion in Red Black Trees [48:34]
16 - Disk Based Data Structures [42:36]
17 - Case Study: Searching for Patterns [01:02:01]
18 - Tries [01:01:35]
19 - Data Compression [45:46]
20 - Priority Queues [49:46]
21 - Binary Heaps [41:52]
22 - Why Sorting [48:27]
23 - More Sorting [58:00]
24 - Graphs [56:45]
25 - Data Structures for Graphs [57:48]
26 - Two Applications of Breadth First Search [53:24]
27 - Depth First Search [53:46]
28 - Applications of DFS [59:32]
29 - DFS in Directed Graphs [53:08]
30 - Applications of DFS in Directed Graphs [38:45]
31 - Minimum Spanning Trees [58:51]
32 - The Union [55:14]
33 - Prims Algorithm for Minimum Spanning Trees [01:01:15]
34 - Single Source Shortest Paths [58:58]
35 - Correctness of Dijkstras Algorithm [55:59]
36 - Single Source Shortest Paths [57:42]
These video lectures are delivered by IIT professors as a part of NPTEL project.

Detailed Syllabus

Data Structures

Course objective: The objective of the course is to familiarize students with basic data structures and their use in fundamental algorithms.

Course contents:
Introduction to object oriented programming through stacks,
queues and linked lists.
Dictionaries: skip-lists, hashing, analysis of collision resolution techniques.
Trees, traversals, binary search trees, optimal and average BST’s. 2-4 trees and red-black trees. Tries and pattern matching.
Priority queues and binary heaps. Sorting: merge, quick, radix, selection, heap.
Graphs, Breadth first search and connected components. Depth first search in
directed and undirected graphs and strongly connected components.
Spanning trees: Prim's and Kruskal’s algorithm, union-find data structure. Dijkstra’s
algorithm for shortest paths, shortest path tree.
Directed acyclic graphs: topological sort and longest path.

Lecture outline with topics	no. of lectures
Introduction to object oriented programming through stacks, queues and linked lists	4
Dictionaries: skip-lists, hashing, analysis of collision resolution techniques Trees, traversals, binary search trees, optimal and average BST’s trees and red-black trees	5 6 4
Tries and pattern matching. Priority queues and binary heaps	5
Sorting: merge, quick, radix, selection, heap	3
Introduction to Graphs, Breadth first search and connected components	3
Depth first search in directed and undirected graphs and strongly connected components	3
Spanning trees: Prim's and Kruskal's algorithm, union-find datastructure.	4
Dijkstra's algorithm for shortest path. shortest path tree. Shortest and longest paths in directed acyclic graphs	5

Video Lecture Series on Digital Systems Design by Prof.D.Roychoudhury, Department of Computer Science and Engineering,IIT Kharagpur.

1 - Introduction to Digital Systems Design
------------------------------------------
1 - Introduction to Digital Systems Design [59:57]
2 - Introduction [59:55]
3 - Digital Logic - I [59:55]
4 - Digital Logic - II [59:55]
5 - Digital Logic - III [1:00:00]

2.- Digital Logic
-------------------
6 - Boolean Algebra [59:56]
7 - Boolean Algebra [1:00:03]
8 - Boolean Function Minimization [59:56]
9 - Boolean Function Minimization [59:50]
10 - Boolean Function Minimization [59:58]
11 - Hazzard Covers by K - Map [59:55]

3 - Combinational Circuit Design
---------------------------------------
12 - Combinational Circuit Design [59:51]
13 - Design of ADDER Circuits [1:00:00]
14 - Design of Subtractor Circuits [1:00:05]
15 - Digital of Common Digital Elements [59:51]
16 - Design of Complex Combinational Circuits [1:00:03]
17 - Design of Combinational Circuits [59:56]
18 - Combinational Logic Problem Design [59:54]
19 - Combinational Logic Design [59:57]
20 - Logic Design with PLA [59:55]

4 - Sequential Circuit Design
-----------------------------
21 - Synchronous Sequential Circuit Design [59:54]
22 - Design of Sequential Modules [59:56]
23 - Design of Registers and Counter [01:00:02]
24 - Finite State Machine Design [59:54]
25 - Finite State Machine Design and Optimization [59:58]

5 - Design of Programmable Logic
----------------------------------------
26 - Programmable Logic Devices [59:50]
27 - Programmable Logic Devices [59:57]
28 - Programmable Logic Devices [59:58]
29 - Design of Arithmetic Circuits [58:28]
30 - Design of Arithmetic Circuits [59:54]
31 - Design of Memory Circuits [01:00:02]

6 - Digital Computing
--------------------------

32 - Algorithmic State Machines Chart [59:55]
33 - Design of Computer Instruction Set and the CPU [59:55]
34 - Design of Computer Instruction Set and the CPU [01:00:02]
35 - Design of Computer Instruction Set and the CPU [01:00:02]
36 - Design of Computer Instruction Set and the CPU [59:59]
37 - Design of Computer Instruction Set and the CPU [59:55]
38 - Design of Computer Instruction Set and the CPU [59:58]
39 - Design of a Micro Programmed CPU [59:55]
40 - Digital System Design Current State of the Art [59:51]

Lecture Series on Computer Architecture by Prof. Anshul Kumar, Department of Computer Science & Engineering ,IIT Delhi.

COMPUTER ARCHITECTURE
--------------------------------
--------------------------------
1.INTRODUCTION TO COMPUTER
------------------------------------
1 - Introduction to Computer Architecture [53:20]
2 - History of Computers [35:14]

2.INSTURCTION SET ARCHITECTURE
-----------------------------------------

3 - Instruction Set Architecture - I [52:17]
4 - Instruction Set Architecture - II [51:42]
5 - Instruction Set Architecture - III [52:43]
6 - Recursive Programs [47:02]
7 - Architecture Space [48:40]
8 - Architecture Examples [50:48]
9 - Performance [50:29]
10 - Performance [52:58]

3.BINARY ARITHMETIC,ALU DESIGN
-----------------------------------------
11 - Binary Arithmetic, ALU Design [50:30]
12 - ALU Design, Overflow [49:48]
13 - Multiplier Design [51:36]
14 - Divider Design [54:37]
15 - Fast Addition , Multiplication [1:01:21]
16 - Floating Point Arithmetic [51:39]

4.PROCESSOR DESIGN 4
---------------------------
17 - Processor Design - Introduction [40:03]
18 - Processor Design [45:49]
19 - Processor Design - Simple Design [50:03]
20 - Processor Design - Multi Cycle Approach [40:56]
21 - Processor Design - Control for Multi Cycle [56:43]
22 - Processor Design Micro programmed Control [33:11]
23 - Processor Design Exception Handling [56:01]

5.PIPELINED PROCESSOR DESIGN
--------------------------------------
24 - Pipelined Processor Design Basic Idea [54:15]
25 - Pipelined Processor Design: Data path [48:37]
26 - Pipelined Processor Design: Handling Data [37:27]
27 - Pipelined Processor Design [55:41]

6.MEMORY HIERARCHY
---------------------------
28 - Memory Hierarchy : Basic Idea [48:10]
29 - Memory Hierarchy : Cache Organization [53:34]
30 - Memory Hierarchy : Cache Organization [49:08]
31 - Memory Hierarchy : Virtual Memory [45:41]
32 - Memory Hierarchy : Virtual Memory [50:11]

7.INPUT/OUTPUT SUBSYSTEM
----------------------------------
33 - Input / Output Subsystem: Introduction [49:53]
34 - Input / Output Subsystem: Interfaces and buses [54:21]
35 - Input / Output Subsystem: Interfaces and buses [55:03]
36 - Input / Output Subsystem: I/O Operations [50:18]
37 - Input / Output Subsystem: Designing I/O Systems [51:30]
38 - Concluding Remarks [45:10]