NPTEL Video Lecture Topic List - Created by LinuXpert ... · Lecture 4 - Asymptotic Notations...

NPTEL Video Course - Computer Science and Engineering - Natural Language Processing

Subject Co-ordinator - Prof. Pushpak Bhattacharya

Co-ordinating Institute - IIT - Bombay

Sub-Titles - Available / Unavailable | MP3 Audio Lectures - Available / Unavailable

Lecture 1 - IntroductionLecture 2 - Stages of NLPLecture 3 - Stages of NLP Continue...Lecture 4 - Two approaches to NLPLecture 5 - Sequence Labelling and Noisy ChannelLecture 6 - Noisy ChannelLecture 7 - Argmax Based ComputationLecture 8 - Noisy Channel Application to NLPLecture 9 - Brief on Probabilistic Parsing & Start of Part of Speech TaggingLecture 10 - Part of Speech TaggingLecture 11 - Part of Speech Tagging counted ...Lecture 12 - Part of Speech Tagging counted ... and Indian Language in Focus; Morphology AnalysisLecture 13 - PoS Tagging contd... , Indian Language Consideration; Accuracy MeasureLecture 14 - PoS Tagging; Fundamental Principle; Why Challenging; accuracyLecture 15 - PoS Tagging; Accuracy Measurement; Word categoriesLecture 16 - AI and Probability; HMMLecture 17 - HMMLecture 18 - HMM, Viterbi, Forward Backward AlgorithmLecture 19 - HMM, Viterbi, Forward Backward Algorithm (Continued...)Lecture 20 - HMM, Forward Backward Algorithms, Baum Welch AlgorithmLecture 21 - HMM, Forward Backward Algorithms, Baum Welch Algorithm (Continued...)Lecture 22 - Natural Language Processing and Informational RetrievalLecture 23 - CLIA; IR BasicsLecture 24 - IR ModelsLecture 25 - IR ModelsLecture 26 - NLP and IRLecture 27 - Least Square Method; Recap of PCA; Towards Latent Semantic Indexing (LSI)Lecture 28 - PCA; SVD; Towards Latent Semantic Indexing (LSI)Lecture 29 - Wordnet and Word Sense Disambiguation

NPTEL Video Lecture Topic List - Created by LinuXpert Systems, Chennai---------------------------------------------------------------------------------------------------

---------------------------------------------------------------------------------------------------------------------------------------------Get Digi-MAT (Digital Media Access Terminal) For High-Speed Video Streaming of NPTEL and Educational Video Courses in LAN

www.digimat.in

Lecture 30 - Wordnet and Word Sense Disambiguation (Continued...)Lecture 31 - Wordnet; Metonymy and Word Sense DisambiguationLecture 32 - Word Sense DisambiguationLecture 33 - Word Sense Disambiguation; Overlap Based Method; Supervised MethodLecture 34 - Word Sense DisambiguationLecture 35 - Word Sense DisambiguationLecture 36 - Resource Constrained WSD; ParsingLecture 37 - ParsingLecture 38 - Parsing AlgorithmLecture 39 - Parsing Ambiguous Sentences; Probabilistic ParsingLecture 40 - Probabilistic Parsing Algorithms



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Design and Analysis of Algorithms

Subject Co-ordinator - Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade



Lecture 1 - Overview of the courseLecture 2 - Framework for Algorithms AnalysisLecture 3 - Algorithms Analysis Framework - IILecture 4 - Asymptotic NotationsLecture 5 - Algorithm Design TechniquesLecture 6 - Divide And Conquer - ILecture 7 - Divide And Conquer - II Median FindingLecture 8 - Divide And Conquer - III Surfing Lower BoundsLecture 9 - Divide And Conquer - IV Closest PairLecture 10 - Greedy Algorithms - ILecture 11 - Greedy Algorithms - IILecture 12 - Greedy Algorithms - IIILecture 13 - Greedy Algorithms - IVLecture 14 - Pattern Matching - ILecture 15 - Pattern Matching - IILecture 16 - Combinational Search and Optimization - ILecture 17 - Combinational Search and Optimization - IILecture 18 - Dynamic ProgrammingLecture 19 - Longest Common SubsequencesLecture 20 - Matrix Chain MultiplicationLecture 21 - Scheduling with Startup and Holding CostsLecture 22 - Average case Analysis of QuicksortLecture 23 - Bipartite Maximum MatchingLecture 24 - Lower Bounds for SortingLecture 25 - Element Distinctness Lower BoundsLecture 26 - NP-Completeness - I - MotivationLecture 27 - NP-Completeness - IILecture 28 - NP-Completeness - IIILecture 29 - NP-Completeness - IV



www.digimat.in

Lecture 30 - NP-Completeness - VLecture 31 - NP-Completeness - VILecture 32 - Approximation AlgorithmsLecture 33 - Approximation AlgorithmsLecture 34 - Approximation Algorithms for NP



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Software Engineering

Subject Co-ordinator - Prof. N.L. Sarda, Prof. Umesh Bellur, Prof. Rushikesh K Joshi



Lecture 1 - Introduction to Software Engineering - ChallengesLecture 2 - Introduction to Software EngineeringLecture 3 - Overview of PhasesLecture 4 - Overview of PhasesLecture 5 - Requirements Engineering / SpecificationLecture 6 - Formal SpecificationLecture 7 - Algebraic Specification MethodsLecture 8 - Systems Modeling OverviewLecture 9 - Process Modeling - DFD , Function DecompLecture 10 - Process Modeling - DFD, Function DecompLecture 11 - Data Modeling - ER Diagrams, MappingLecture 12 - Data Modeling - ER Diagrams, MappingLecture 13 - Production Quality Software - IntroductionLecture 14 - Software Design - Primary ConsiderationLecture 15 - Design PatternsLecture 16 - Class and Component Level DesignLecture 17 - Architectural DesignLecture 18 - Software Testing - ILecture 19 - Software Testing - IILecture 20 - Structural Programming and Some implementationLecture 21 - Software Metrics and QualityLecture 22 - Verification and ValidationLecture 23 - Case StudyLecture 24 - Case StudyLecture 25 - Software EvolutionLecture 26 - Agile DevelopmentLecture 27 - Software Reuse CBSELecture 28 - Reuse ContinuedLecture 29 - Introduction to Project Management



www.digimat.in

Lecture 30 - Project Scope ManagementLecture 31 - Project Time ManagementLecture 32 - Estimation - ILecture 33 - Estimation - IILecture 34 - Project Quality ManagementLecture 35 - Quality Management Systems - ILecture 36 - Quality Management SystemsLecture 37 - Project Configuration ManagementLecture 38 - Project Risk ManagementLecture 39 - Other PM Processes



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Computational Geometry

Subject Co-ordinator - Prof. Sandeep Sen

Co-ordinating Institute - IIT - Delhi


Lecture 1 - IntroductionLecture 2 - Visibility ProblemsLecture 3 - 2D MaximaLecture 4 - Line Sweep MethodLecture 5 - Segment Intersection ProblemLecture 6 - Line SweepLecture 7 - Convex HullLecture 8 - Convex Hull ContdLecture 9 - Quick HullLecture 10 - More Convex Hull AlgorithmsLecture 11 - Intersection of Half Planes and DualityLecture 12 - Intersection of Half Planes and Duality ContdLecture 13 - Lower BoundsLecture 14 - Planar Point LocationLecture 15 - Point Location and Triangulation Contd...Lecture 16 - Triangulation of Arbitrary PolygonLecture 17 - Voronoi DiagramLecture 18 - Voronoi Diagram ConstructionLecture 19 - Delaunay TriangulationLecture 20 - Quick sort and Backward AnalysisLecture 21 - Generalized RICLecture 22 - RIC ContinuedLecture 23 - ArrangementsLecture 24 - Zone Theorem and ApplicationLecture 25 - LevelsLecture 26 - Range SearchingLecture 27 - Orthogonal Range searchingLecture 28 - Priority Search TreesLecture 29 - Non - Orthogonal Range Searching



www.digimat.in

Lecture 30 - Half - Plane Range QueryLecture 31 - Well Separated PartitioningLecture 32 - Quadtrees Epsilon -WSPDLecture 33 - Construction of Epsilon - WSPDLecture 34 - Epsilon - WSPD to Geometric SpannerLecture 35 - Epsilon-Nets & VC DimensionLecture 36 - Epsilon-Nets & VC Dimension contdLecture 37 - Geometric Set CoverLecture 38 - Geometric Set Cover (with Bounded VC Dimension)Lecture 39 - Shape RepresentationLecture 40 - Shape Comparison



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Logic for CS

Subject Co-ordinator - Prof. S. Arun Kumar



Lecture 1 - IntroductionLecture 2 - Propositional Logic SyntaxLecture 3 - Semantics of Propositional LogicLecture 4 - Logical and Algebraic ConceptsLecture 5 - Identities and Normal formsLecture 6 - Tautology CheckingLecture 7 - Propositional UnsatisfiabilityLecture 8 - Analytic TableauxLecture 9 - Consistency and CompletenessLecture 10 - The Completeness TheoremLecture 11 - Maximally Consistent SetsLecture 12 - Formal TheoriesLecture 13 - Proof TheoryLecture 14 - Derived RulesLecture 15 - The Hilbert SystemLecture 16 - The Hilbert SystemLecture 17 - Introduction to Predicate LogicLecture 18 - The Semantic of Predicate LogicLecture 19 - SubsitutionsLecture 20 - ModelsLecture 21 - Structures and SubstructuresLecture 22 - First-Order TheoriesLecture 23 - Predicate LogicLecture 24 - Existential QuantificationLecture 25 - Normal FormsLecture 26 - SkalemizationLecture 27 - Substitutions and InstantiationsLecture 28 - UnificationLecture 29 - Resolution in FOL



www.digimat.in

Lecture 30 - More on Resolution in FOLLecture 31 - ResolutionLecture 32 - Resolution and TableauxLecture 33 - Completeness of Tableaux MethodLecture 34 - Completeness of the Hilbert SystemLecture 35 - First-Order TheoriesLecture 36 - Towards Logic ProgrammingLecture 37 - Verification of Imperative ProgramsLecture 38 - Verification of WHILE ProgramsLecture 39 - References



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Computer Architecture (Prof. Anshul Kumar)

Subject Co-ordinator - Prof. Anshul Kumar



Lecture 1 - Introduction to Computer ArchitectureLecture 2 - History of ComputersLecture 3 - Instruction Set Architecture - ILecture 4 - Instruction Set Architecture - IILecture 5 - Instruction Set Architecture - IIILecture 6 - Recursive ProgramsLecture 7 - Architecture SpaceLecture 8 - Architecture ExamplesLecture 9 - PerformanceLecture 10 - PerformanceLecture 11 - Binary Arithmetic, ALU DesignLecture 12 - ALU Design, OverflowLecture 13 - Multiplier DesignLecture 14 - Divider DesignLecture 15 - Fast Addition , MultiplicationLecture 16 - Floating Point ArithmeticLecture 17 - Processor Design - IntroductionLecture 18 - Processor DesignLecture 19 - Processor Design - Simple DesignLecture 20 - Processor Design - Multi Cycle ApproachLecture 21 - Processor Design - Control for Multi CycleLecture 22 - Processor Design - Micro programmed ControlLecture 23 - Processor Design - Exception HandlingLecture 24 - Pipelined Processor Design Basic IdeaLecture 25 - Pipelined Processor DesignLecture 26 - Pipelined Processor DesignLecture 27 - Pipelined Processor DesignLecture 28 - Memory HierarchyLecture 29 - Memory Hierarchy



www.digimat.in

Lecture 30 - Memory HierarchyLecture 31 - Memory HierarchyLecture 32 - Memory HierarchyLecture 33 - Input / Output SubsystemLecture 34 - Input / Output SubsystemLecture 35 - Input / Output SubsystemLecture 36 - Input / Output SubsystemLecture 37 - Input / Output SubsystemLecture 38 - Concluding Remarks



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Data Structures And Algorithms

Subject Co-ordinator - Prof. Naveen Garg



Lecture 1 - Introduction to Data Structures and AlgorithmsLecture 2 - StacksLecture 3 - Queues and Linked ListsLecture 4 - DictionariesLecture 5 - HashingLecture 6 - TreesLecture 7 - Tree Walks / TraversalsLecture 8 - Ordered DictionariesLecture 9 - DeletionLecture 10 - Quick SortLecture 11 - AVL TreesLecture 12 - AVL TreesLecture 13 - TreesLecture 14 - Red Black TreesLecture 15 - Insertion in Red Black TreesLecture 16 - Disk Based Data StructuresLecture 17 - Case StudyLecture 18 - TriesLecture 19 - Data CompressionLecture 20 - Priority QueuesLecture 21 - Binary HeapsLecture 22 - Why SortingLecture 23 - More SortingLecture 24 - GraphsLecture 25 - Data Structures for GraphsLecture 26 - Two Applications of Breadth First SearchLecture 27 - Depth First SearchLecture 28 - Applications of DFSLecture 29 - DFS in Directed Graphs



www.digimat.in

Lecture 30 - Applications of DFS in Directed GraphsLecture 31 - Minimum Spanning TreesLecture 32 - The UnionLecture 33 - Prims Algorithm for Minimum Spanning TreesLecture 34 - Single Source Shortest PathsLecture 35 - Correctness of Dijkstras AlgorithmLecture 36 - Single Source Shortest Paths



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Introduction to Computer Graphics

Subject Co-ordinator - Prof. Prem K Kalra



Lecture 1 - IntroductionLecture 2 - Raster GraphicsLecture 3 - Raster Graphics (Continued...)Lecture 4 - ClippingLecture 5 - Polygon Clipping and Polygon Scan ConversionLecture 6 - TransformationsLecture 7 - Transformations (Continued...)Lecture 8 - 3D ViewingLecture 9 - 3D Viewing (Continued...)Lecture 10 - CurvesLecture 11 - Assignment - ILecture 12 - Curves (Continued...)Lecture 13 - Curves (Continued...)Lecture 14 - Curves (Continued...)Lecture 15 - Curves (Continued...)Lecture 16 - SurfacesLecture 17 - Surfaces (Continued...)Lecture 18 - Surfaces (Continued...)Lecture 19 - Surfaces (Continued...)Lecture 20 - Hierarchical ModelsLecture 21 - RenderingLecture 22 - Rendering (Continued...)Lecture 23 - Rendering (Continued...)Lecture 24 - Ray TracingLecture 25 - Ray Tracing (Continued...)Lecture 26 - Ray Tracing (Continued...)Lecture 27 - AssignmentLecture 28 - Hidden Surface EliminationLecture 29 - Hidden Surface Elimination (Continued...)



www.digimat.in

Lecture 30 - Hidden Surface Elimination (Continued...)Lecture 31 - FractalsLecture 32 - Fractals (Continued...)Lecture 33 - Computer AnimationLecture 34 - Animation (Continued...)Lecture 35 - Animation (Continued...)



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Principles of Programming Languages

Subject Co-ordinator - Prof. S. Arun Kumar



Lecture 1 - IntroductionLecture 2 - SyntaxLecture 3 - GrammarsLecture 4 - AmbiguityLecture 5 - PLOLecture 6 - SemanticsLecture 7 - Syntactic ClassesLecture 8 - Transition SystemsLecture 9 - PL0Lecture 10 - BindingLecture 11 - EnvironmentsLecture 12 - DeclarationsLecture 13 - CommandsLecture 14 - StoresLecture 15 - SummaryLecture 16 - Declarations and CommandsLecture 17 - BlocksLecture 18 - QualificationLecture 19 - PragmaticsLecture 20 - DataLecture 21 - Structured DataLecture 22 - SequencesLecture 23 - ControlLecture 24 - Non-DeterminacyLecture 25 - Programming LanguagesLecture 26 - Programming LanguagesLecture 27 - Programming LanguagesLecture 28 - Data as FunctionsLecture 29 - Data and Fixpoints



www.digimat.in

Lecture 30 - Normal FormsLecture 31 - Programming LanguagesLecture 32 - MonomorphismLecture 33 - PolymorphismLecture 34 - Type CheckingLecture 35 - ContextsLecture 36 - AbstractsLecture 37 - ProceduresLecture 38 - MeaningsLecture 39 - ParametersLecture 40 - The Future



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Parallel Computing

Subject Co-ordinator - Dr. Subodh Kumar



Lecture 1 - IntroductionLecture 2 - Parallel Programming ParadigmsLecture 3 - Parallel ArchitectureLecture 4 - Parallel Architecture (case studies)Lecture 5 - Open MPLecture 6 - Open MP (Continued.)Lecture 7 - Open MP (Continued..)Lecture 8 - Open MP & PRAM Model of ComputationLecture 9 - PRAMLecture 10 - Models of Parallel Computation, ComplexityLecture 11 - Memory ConsistencyLecture 12 - Memory Consistency & Performance IssuesLecture 13 - Parallel Program DesignLecture 14 - Shared Memory & Message PassingLecture 15 - MPILecture 16 - MPI (Continued.)Lecture 17 - MPI (Continued..)Lecture 18 - Algorithmic TechniquesLecture 19 - Algorithmic Techniques (Continued.)Lecture 20 - Algorithmic Techniques (Continued..)Lecture 21 - CUDALecture 22 - CUDA (Continued.)Lecture 23 - CUDA (Continued..)Lecture 24 - CUDA (Continued...)Lecture 25 - CUDA (Continued....)Lecture 26 - CUDA (Continued.....)Lecture 27 - CUDA (Continued......)Lecture 28 - Algorithms, Merging & SortingLecture 29 - Algorithms, Merging & Sorting (Continued.)



www.digimat.in

Lecture 30 - Algorithms, Merging & Sorting (Continued..)Lecture 31 - Algorithms, Merging & Sorting (Continued...)Lecture 32 - Algorithms, Merging & Sorting (Continued....)Lecture 33 - Lower Bounds Lock Free Synchronization, Load StealingLecture 34 - Lock Free Synchronization, Graph Algorithms



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Design Verification and Test of Digital VLSI Circuits

Subject Co-ordinator - Dr. Santosh Biswas, Prof. Jatindra Kumar Deka

Co-ordinating Institute - IIT - Guwahati


Lecture 1 - Introduction to Digital VLSI Design FlowLecture 2 - High Level Design RepresentationLecture 3 - Transformations for High Level SynthesisLecture 4 - Introduction to HLSLecture 5 - Scheduling Algorithms - 1Lecture 6 - Scheduling Algorithms - 2Lecture 7 - Binding and Allocation AlgorithmsLecture 8 - Two level Boolean Logic Synthesis - 1Lecture 9 - Two level Boolean Logic Synthesis - 2Lecture 10 - Two level Boolean Logic Synthesis - 3Lecture 11 - Heuristic Minimization of Two-Level CircuitsLecture 12 - Finite State Machine SynthesisLecture 13 - Multilevel ImplementationLecture 14 - Introduction to formal methods for design verificationLecture 15 - Temporal LogicLecture 16 - Syntax and Semantics of CTLLecture 17 - Syntax and Semantics of CTL â�� ContinuedLecture 18 - Equivalence between CTL FormulasLecture 19 - Introduction to Model CheckingLecture 20 - Model Checking Algorithms - ILecture 21 - Model Checking Algorithms - IILecture 22 - Model Checking with FairnessLecture 23 - Binary Decision DiagramLecture 24 - Ordered Binary Decision DiagramLecture 25 - Operation on Ordered Binary Decision DiagramLecture 26 - Ordered Binary Decision Diagram for State Transition SystemsLecture 27 - Symbolic Model CheckingLecture 28 - Introduction to Digital VLSI TestingLecture 29 - Functional and Structural Testing



www.digimat.in

Lecture 30 - Fault EquivalenceLecture 31 - Fault Simulation - 1Lecture 32 - Fault Simulation - 2Lecture 33 - Fault Simulation - 3Lecture 34 - Testability Measures (SCOAP)Lecture 35 - Introduction to Automatic Test Pattern Generation (ATPG) and ATPG AlgebrasLecture 36 - D-Algorithm - 1Lecture 37 - D-Algorithm - 2Lecture 38 - ATPG for Synchronous Sequential CircuitsLecture 39 - Scan Chain based Sequential Circuit Testing - 1Lecture 40 - Scan Chain based Sequential Circuit Testing - 2Lecture 41 - Built in Self Test - 1Lecture 42 - Built in Self Test - 2Lecture 43 - Memory Testing - 1Lecture 44 - Memory Testing - 2



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Computer Algorithms - 2

Subject Co-ordinator - Prof. Shashank K. Mehta

Co-ordinating Institute - IIT - Kanpur


Lecture 1 - Graph_BasicsLecture 2 - Breadth_First_SearchLecture 3 - Dijkstra_AlgoLecture 4 - All Pair Shortest PathLecture 5 - MatriodsLecture 6 - Minimum Spanning TreeLecture 7 - Edmond's Matching Algo ILecture 8 - Edmond's Matching Algo IILecture 9 - Flow NetworksLecture 10 - Ford Fulkerson MethodLecture 11 - Edmond Karp AlgoLecture 12 - Matrix InversionLecture 13 - Matrix DecompositionLecture 14 - Knuth Morris Pratt AlgoLecture 15 - Rabin Karp AlgoLecture 16 - NFA SimulationLecture 17 - Integer-Polynomial Ops-ILecture 18 - Integer-Polynomial Ops-IILecture 19 - Integer-Polynomial Ops-IIILecture 20 - Chinese Remainder-ILecture 21 - Chinese Remainder-IILecture 22 - Chinese Remainder-IIILecture 23 - Discrete Fourier Transform-ILecture 24 - Discrete Fourier Transform-IILecture 25 - Discrete Fourier Transform-IIILecture 26 - Schonhage Strassen AlgoLecture 27 - Linear Programming-ILecture 28 - Linear Programming-IILecture 29 - Geometry-I



www.digimat.in

Lecture 30 - Geometry-IILecture 31 - Geometry-IIILecture 32 - Approximation Algo-ILecture 33 - Approximation Algo-IILecture 34 - Approximation Algo-IIILecture 35 - General



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Theory of Computation

Subject Co-ordinator - Prof. Somenath Biswas



Lecture 1 - Theory of ComputationLecture 2 - Theory of ComputationLecture 3 - Theory of ComputationLecture 4 - Theory of ComputationLecture 5 - Theory of ComputationLecture 6 - Theory of ComputationLecture 7 - Theory of ComputationLecture 8 - Theory of ComputationLecture 9 - Theory of ComputationLecture 10 - Theory of ComputationLecture 11 - Theory of ComputationLecture 12 - Theory of ComputationLecture 13 - Theory of ComputationLecture 14 - Theory of ComputationLecture 15 - Theory of ComputationLecture 16 - Theory of ComputationLecture 17 - Theory of ComputationLecture 18 - Theory of ComputationLecture 19 - Theory of ComputationLecture 20 - Theory of ComputationLecture 21 - Theory of ComputationLecture 22 - Theory of ComputationLecture 23 - Theory of ComputationLecture 24 - Theory of ComputationLecture 25 - Theory of ComputationLecture 26 - Theory of ComputationLecture 27 - Theory of ComputationLecture 28 - Theory of ComputationLecture 29 - Theory of Computation



www.digimat.in

Lecture 30 - Theory of ComputationLecture 31 - Theory of ComputationLecture 32 - Theory of ComputationLecture 33 - Theory of Computation



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Introduction to Problem Solving and Programming

Subject Co-ordinator - Prof. D. Gupta



Lecture 1Lecture 2Lecture 3Lecture 4Lecture 5Lecture 6Lecture 7Lecture 8Lecture 9Lecture 10Lecture 11Lecture 12Lecture 13Lecture 14Lecture 15Lecture 16Lecture 17Lecture 18Lecture 19Lecture 20Lecture 21Lecture 22Lecture 23Lecture 24



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Riemann Hypothesis and its Applications

Subject Co-ordinator - Prof. Manindra Agrawal



Lecture - 1Lecture - 2Lecture - 3Lecture - 4Lecture - 5Lecture - 6Lecture - 7Lecture - 8Lecture - 9Lecture - 10Lecture - 11Lecture - 12Lecture - 13Lecture - 14Lecture - 15Lecture - 16Lecture - 17Lecture - 18Lecture - 19Lecture - 20Lecture - 21Lecture - 22Lecture - 23Lecture - 24Lecture - 25Lecture - 26Lecture - 27Lecture - 28Lecture - 29



www.digimat.in

Lecture - 30



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Biometrics

Subject Co-ordinator - Prof. Phalguni Gupta



Lecture 1 - BiometricsLecture 2 - BiometricsLecture 3 - BiometricsLecture 4 - BiometricsLecture 5 - BiometricsLecture 6 - BiometricsLecture 7 - BiometricsLecture 8 - BiometricsLecture 9 - BiometricsLecture 10 - BiometricsLecture 11 - BiometricsLecture 12 - BiometricsLecture 13 - BiometricsLecture 14 - BiometricsLecture 15 - BiometricsLecture 16 - BiometricsLecture 17 - BiometricsLecture 18 - BiometricsLecture 19 - BiometricsLecture 20 - BiometricsLecture 21 - BiometricsLecture 22 - BiometricsLecture 23 - BiometricsLecture 24 - BiometricsLecture 25 - BiometricsLecture 26 - Biometrics



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Parallel Algorithm

Subject Co-ordinator - Prof. Phalguni Gupta



Lecture 1 - Parallel AlgorithmLecture 2 - Parallel AlgorithmLecture 3 - Parallel AlgorithmLecture 4 - Parallel AlgorithmLecture 5 - Parallel AlgorithmLecture 6 - Parallel AlgorithmLecture 7 - Parallel AlgorithmLecture 8 - Parallel AlgorithmLecture 9 - Parallel AlgorithmLecture 10 - Parallel AlgorithmLecture 11 - Parallel AlgorithmLecture 12 - Parallel AlgorithmLecture 13 - Parallel AlgorithmLecture 14 - Parallel AlgorithmLecture 15 - Parallel AlgorithmLecture 16 - Parallel AlgorithmLecture 17 - Parallel AlgorithmLecture 18 - Parallel AlgorithmLecture 19 - Parallel AlgorithmLecture 20 - Parallel AlgorithmLecture 21 - Parallel AlgorithmLecture 22 - Parallel AlgorithmLecture 23 - Parallel AlgorithmLecture 24 - Parallel AlgorithmLecture 25 - Parallel Algorithm



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Computer Architecture (Dr. Mainak Chaudhuri)

Subject Co-ordinator - Dr. Mainak Chaudhuri



Lecture 1 - Introduction, Amdahl's law, CPI equationLecture 2 - CPI equation, research practices, instruction set architectureLecture 3 - Instruction set architectureLecture 4 - Instruction set architectureLecture 5 - Instruction set architecture, case study with MIPS-ILecture 6 - Case study with MIPS-ILecture 7 - Case study with MIPS-ILecture 8 - Binary instrumentation for architectural studiesLecture 9 - Binary instrumentation for architectural studiesLecture 10 - Basic pipelining, branch predictionLecture 11 - Basic pipelining, branch predictionLecture 12 - Basic pipelining, branch predictionLecture 13 - Basic pipelining, branch predictionLecture 14 - Basic pipelining, branch predictionLecture 15 - Basic pipelining, branch predictionLecture 16 - Basic pipelining, branch predictionLecture 17 - Basic pipelining, branch predictionLecture 18 - Basic pipelining, branch predictionLecture 19 - Basic pipelining, branch predictionLecture 20 - Dynamic scheduling, speculative executionLecture 21 - Dynamic scheduling, speculative executionLecture 22 - Dynamic scheduling, speculative executionLecture 23 - Dynamic scheduling, speculative executionLecture 24 - Dynamic scheduling, speculative executionLecture 25 - Virtual memory and cachesLecture 26 - Virtual memory and cachesLecture 27 - Virtual memory and cachesLecture 28 - Topics in memory system, DRAM and SRAM technologyLecture 29 - Topics in memory system, DRAM and SRAM technology



www.digimat.in

Lecture 30 - Topics in memory system, DRAM and SRAM technologyLecture 31 - Case studyLecture 32 - Case studyLecture 33 - Case studyLecture 34 - Case studyLecture 35 - Input/OutputLecture 36 - Simultaneous multithreading, multi-cores



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Compiler Design (Prof. Sanjeev K Aggarwal)

Subject Co-ordinator - Prof. Sanjeev K Aggarwal



Lecture 1 - Compiler DesignLecture 2 - Compiler DesignLecture 3 - Compiler DesignLecture 4 - Compiler DesignLecture 5 - Compiler DesignLecture 6 - Compiler DesignLecture 7 - Compiler DesignLecture 8 - Compiler DesignLecture 9 - Compiler DesignLecture 10 - Compiler DesignLecture 11 - Compiler DesignLecture 12 - Compiler DesignLecture 13 - Compiler DesignLecture 14 - Compiler DesignLecture 15 - Compiler DesignLecture 16 - Compiler DesignLecture 17 - Compiler DesignLecture 18 - Compiler DesignLecture 19 - Compiler DesignLecture 20 - Compiler DesignLecture 21 - Compiler DesignLecture 22 - Compiler DesignLecture 23 - Compiler DesignLecture 24 - Compiler DesignLecture 25 - Compiler DesignLecture 26 - Compiler DesignLecture 27 - Compiler DesignLecture 28 - Compiler DesignLecture 29 - Compiler DesignLecture 30 - Compiler Design



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - NOC:Introduction to programming in C

Subject Co-ordinator - Prof. Satyadev Nandakumar


Lecture 1 - Intro - Process of programmingLecture 2 - Intro - GCDLecture 3 - Intro - Programming cycleLecture 4 - Intro - Tracing a simple programLecture 5 - Intro - VariablesLecture 6 - Intro - OperatorsLecture 7 - Loops - WhileLecture 8 - Loops - While exampleLecture 9 - Loops - While GCD exampleLecture 10 - Loops - Longest 1Lecture 11 - Loops - Longest 2Lecture 12 - Loops - Longest 3Lecture 13 - Loops - Do-whileLecture 14 - Loops - Matrix using nested loopsLecture 15 - Loops - ForLecture 16 - Loops - Matrix using nested for loopsLecture 17 - Loops - Break statementLecture 18 - Loops - Continue statementLecture 19 - Loops - Continue statement exampleLecture 20 - Data types in CLecture 21 - ASCII codeLecture 22 - Operators Expressions AssociativityLecture 23 - Precedence of operatorsLecture 24 - Expression evaluationLecture 25 - Functions - IntroductionLecture 26 - Functions - How functions are executedLecture 27 - Functions - Examples - 1Lecture 28 - Functions - Examples - 2Lecture 29 - Arrays in CLecture 30 - Initializing arraysLecture 31 - Initializing character arraysLecture 32 - Pointers in CLecture 33 - Pointer arithmetic



www.digimat.in

Lecture 34 - Function with pointer argumentsLecture 35 - Example - copy a subarrayLecture 36 - Programming using arrays and pointersLecture 37 - Sizeof operatorLecture 38 - Returning pointers from functionsLecture 39 - Example - return duplicate of a stringLecture 40 - Recursion - Linear RecursionLecture 41 - Recursion - Linear Recursion - 2Lecture 42 - Recursion - Two-way RecursionLecture 43 - Multidimensional ArraysLecture 44 - Multidimensional Arrays and PointersLecture 45 - Multidimensional Arrays and Pointers - continued (2)Lecture 46 - Multidimensional Arrays and Pointers - continued (3)Lecture 47 - Multidimensional ArraysLecture 48 - Multidimensional Arrays and PointersLecture 49 - Multidimensional Arrays and Pointers - 2Lecture 50 - Multidimensional Arrays and Pointers - 3Lecture 51 - File HandlingLecture 52 - Some other file-handling functions



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - NOC:Fundamentals of Database Systems

Subject Co-ordinator - Dr. Arnab Bhattacharya



Lecture 1 - Introduction to DatabasesLecture 2 - Relational Data ModelLecture 3 - Relational Algebra Basic OperatorsLecture 4 - Relational Algebra Composition of OperatorsLecture 5 - Relational Algebra Additional OperatorsLecture 6 - Relational Algebra Extended Relational AlgebraLecture 7 - Relational AlgebraLecture 8 - SQLLecture 9 - SQLLecture 10 - SQLLecture 11 - SQLLecture 12 - Normalization TheoryLecture 13 - Normalization TheoryLecture 14 - Normalization TheoryLecture 15 - Normalization TheoryLecture 16 - Normalization TheoryLecture 17 - Physical DesignLecture 18 - Database IndexingLecture 19 - Database IndexingLecture 20 - Query ProcessingLecture 21 - Query ProcessingLecture 22 - Query ProcessingLecture 23 - Query ProcessingLecture 24 - Query OptimizationLecture 25 - Query OptimizationLecture 26 - Query OptimizationLecture 27 - Query OptimizationLecture 28 - Database TransactionsLecture 29 - Database Transactions



www.digimat.in

Lecture 30 - Recovery SystemsLecture 31 - Recovery SystemsLecture 32 - Recovery SystemsLecture 33 - SchedulesLecture 34 - SchedulesLecture 35 - SchedulesLecture 36 - SchedulesLecture 37 - SchedulesLecture 38 - Concurrency ControlLecture 39 - Concurrency ControlLecture 40 - Concurrency ControlLecture 41 - Concurrency ControlLecture 42 - Concurrency ControlLecture 43 - Concurrency ControlLecture 44 - Concurrency ControlLecture 45 - NoSQLLecture 46 - NoSQLLecture 47 - NoSQLLecture 48 - Big Data



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - NOC:Theory of Computation

Subject Co-ordinator - Prof. Raghunath Tewari



Lecture 1 - Introduction to Finite AutomataLecture 2 - Basic Notation and Convention, DFA Edit LessonLecture 3 - Example of DFAsLecture 4 - Computation by DFA and Regular operationLecture 5 - Introduction to NondeterminismLecture 6 - NFA, definition and examplesLecture 7 - Equivalence of NFA and DFA, Closure propertiesLecture 8 - Regular expressionsLecture 9 - Algebraic properties, RE to NFA conversionLecture 10 - GNFA to RE conversionLecture 11 - More closure properties of regular languagesLecture 12 - Non-regular languages and pumping lemmaLecture 13 - Examples of non-regular languagesLecture 14 - DFA minimizationLecture 15 - Introduction to CFGsLecture 16 - Examples of CFGs, Reg subset of CFLLecture 17 - Parse tree, derivation, ambiguityLecture 18 - Normal forms, Chomsky normal formLecture 19 - Non-CFLs, pumping lemmaLecture 20 - Examples of non- CFLsLecture 21 - Pushdown AutomataLecture 22 - Pushdown Automata - Definition and ExampleLecture 23 - Pushdown Automata - Examples and Relation with CFGsLecture 24 - Closure Properties of CFLsLecture 25 - Deterministic Context Free LanguagesLecture 26 - Turing MachineLecture 27 - More on Turing MachineLecture 28 - Non deterministic Turing Machine Edit LessonLecture 29 - Configuration Graphs



www.digimat.in

Lecture 30 - Closure Properties of Decidable and Turing recognizable languagesLecture 31 - Decidability properties of Regular and Context Free LanguagesLecture 32 - UndecidabilityLecture 33 - More on UndecidabilityLecture 34 - ReductionLecture 35 - Applications of ReductionLecture 36 - Rice's theoremLecture 37 - Introduction to Computational Complexity TheoryLecture 38 - More on the class NPLecture 39 - NP-CompletenessLecture 40 - More on NP-Completeness



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - NOC:Modern Algebra

Subject Co-ordinator - Prof. Manindra Agrawal



Lecture 1 - GroupsLecture 2 - GroupsLecture 3 - GroupsLecture 4 - GroupsLecture 5 - GroupsLecture 6 - GroupsLecture 7 - RingsLecture 8 - RingsLecture 9 - RingsLecture 10 - RingsLecture 11 - RingsLecture 12 - RingsLecture 13 - RingsLecture 14 - FieldsLecture 15 - Cauchy sequences and real numbersLecture 16 - Properties of FieldsLecture 17 - Finite FieldsLecture 18 - Application of Fields



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Cryptography and Network Security

Subject Co-ordinator - Dr. Debdeep Mukhopadhyay

Co-ordinating Institute - IIT - Kharagpur


Lecture 1 - IntroductionLecture 2 - Overview on Modern CryptographyLecture 3 - Introduction to Number TheoryLecture 4 - Probability and Information TheoryLecture 5 - Classical CryptosystemsLecture 6 - Cryptanalysis of Classical CiphersLecture 7 - Shannons TheoryLecture 8 - Shannons Theory (Continued...1)Lecture 9 - Shannons Theory (Continued...2)Lecture 10 - Symmetric Key CiphersLecture 11 - Block Cipher Standards (DES)Lecture 12 - Block Cipher Standards (AES)Lecture 13 - Block Cipher Standards (AES) (Continued...)Lecture 14 - Linear CryptanalysisLecture 15 - Differential CryptanalysisLecture 16 - Few other Cryptanalytic TechniquesLecture 17 - Overview on S-Box Design PrinciplesLecture 18 - Modes of Operation of Block CiphersLecture 19 - Stream CiphersLecture 20 - Stream Ciphers (Continued...1)Lecture 21 - Stream Ciphers (Continued...2)Lecture 22 - PseudorandomnessLecture 23 - Cryptographic Hash FunctionsLecture 24 - Cryptographic Hash Functions (Continued...1)Lecture 25 - Cryptographic Hash Functions (Continued...2)Lecture 26 - Message Authentication CodesLecture 27 - More Number Theoretic ResultsLecture 28 - The RSA CryptosystemLecture 29 - Primality Testing



www.digimat.in

Lecture 30 - Factoring AlgorithmsLecture 31 - Some Comments on the Security of RSALecture 32 - Discrete Logarithm Problem (DLP)Lecture 33 - The Diffie-Hellman Problem and Security of ElGamal SystemsLecture 34 - An Introduction to Elliptic Curve CryptographyLecture 35 - Application of Elliptic Curves to CryptographyLecture 36 - Implementation of Elliptic Curve CryptographyLecture 37 - Secret Sharing SchemesLecture 38 - A Tutorial on Network ProtocolsLecture 39 - System SecurityLecture 40 - Firewalls and Intrusion Detection SystemsLecture 41 - Side Channel Analysis of Cryptographic Implementations



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - High Performance Computer Architecture

Subject Co-ordinator - Prof. Ajit Pal



Lecture 1 - Introduction & Course OutlineLecture 2 - PerformanceLecture 3 - Instruction Set ArchitectureLecture 4 - MIPS ISA and ProcessorLecture 5 - MIPS ISA and Processor (Continued...)Lecture 6 - Pipelining - IntroductionLecture 7 - Instruction PipeliningLecture 8 - Pipeline HazardsLecture 9 - Data HazardsLecture 10 - Software PipeliningLecture 11 - In Quest of Higher ILPLecture 12 - In Quest of Higher ILP (Continued...)Lecture 13 - Dynamic Instruction SchedulingLecture 14 - Dynamic Instruction Scheduling (Continued...)Lecture 15 - Control HazardsLecture 16 - Branch PredictionLecture 17 - Branch Prediction (Continued...)Lecture 18 - Dynamic Instruction Scheduling with Branch PredictionLecture 19 - Hardware-based SpeculationLecture 20 - Tutorial - ILecture 21 - Hierarchical Memory OrganizationLecture 22 - Hierarchical Memory Organization (Continued...1)Lecture 23 - Hierarchical Memory Organization (Continued...2)Lecture 24 - Hierarchical Memory Organization (Continued...3)Lecture 25 - Cache Optimization Techniques (Continued...1)Lecture 26 - Cache Optimization Techniques (Continued...2)Lecture 27 - Main Memory OrganizationLecture 28 - Main Memory OptimizationsLecture 29 - Virtual Memory



www.digimat.in

Lecture 30 - Virtual Memory (Continued...)Lecture 31 - Virtual MachinesLecture 32 - Storage TechnologyLecture 33 - Storage Technology (Continued...)Lecture 34 - Case StudiesLecture 35 - Case Studies (Continued...1)Lecture 36 - Case Studies (Continued...2)Lecture 37 - Multithreading & MultiprocessingLecture 38 - Simultaneous MultithreadingLecture 39 - Symmetric MultiprocessorsLecture 40 - Distributed Memory MultiprocessorsLecture 41 - Cluster, Grid and Cloud Computing



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Low Power VLSI Circuits and Systems




Lecture 1 - Introduction & Course OutlineLecture 2 - MOS Transistors - ILecture 3 - MOS Transistors - IILecture 4 - MOS Transistors - IIILecture 5 - MOS Transistors - IVLecture 6 - MOS Inverters - ILecture 7 - MOS Inverters - IILecture 8 - MOS Inverters - IIILecture 9 - MOS Inverters - IVLecture 10 - Static CMOS Circuits - ILecture 11 - Static CMOS Circuits - IILecture 12 - MOS Dynamic Circuits - ILecture 13 - MOS Dynamic Circuits - IILecture 14 - Pass Transistor Logic Circuits - ILecture 15 - Pass Transistor Logic Circuits - IILecture 16 - MOS MemoriesLecture 17 - Finite State MachinesLecture 18 - Switching Power DissipationLecture 19 - Tutorial - ILecture 20 - Dynamic Power DissipationLecture 21 - Leakage Power DissipationLecture 22 - Supply Voltage Scaling - ILecture 23 - Supply Voltage Scaling - IILecture 24 - Supply Voltage Scaling - IIILecture 25 - Supply Voltage Scaling - IVLecture 26 - Tutorial - IILecture 27 - Minimizing Switched Capacitance - ILecture 28 - Minimizing Switched Capacitance - IILecture 29 - Minimizing Switched Capacitance - III



www.digimat.in

Lecture 30 - Minimizing Switched Capacitance - IVLecture 31 - Minimizing Switched Capacitance - VLecture 32 - Minimizing Leakage Power - ILecture 33 - Minimizing Leakage Power - IILecture 34 - Minimizing Leakage Power - IIILecture 35 - Variation Tolerant DesignLecture 36 - Adiabatic Logic CircuitsLecture 37 - Battery-Driven System DesignLecture 38 - CAD Tools for Low PowerLecture 39 - Tutorial - IIILecture 40 - Course Summary



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Real Time Systems

Subject Co-ordinator - Prof. Rajib Mall



Lecture 1 - IntroductionLecture 2 - Real - Time System CharacteristicsLecture 3 - Few Basic IssuesLecture 4 - Modelling Timing ConstraintsLecture 5 - Modelling Timing Constraints (Continued.)Lecture 6 - Basics of Real - Time Task SchedulingLecture 7 - Cyclic SchedulerLecture 8 - Event - Driven SchedulingLecture 9 - Rate Monotonic SchedulerLecture 10 - RMA SchedulingLecture 11 - Deadline Monotonic Scheduling and Other IssuesLecture 12 - Few Issues in Use of RMALecture 13 - Resource Sharing Among Real-Time TasksLecture 14 - Highest Locker and Priority Ceiling ProtocolsLecture 15 - An Analysis of Priority Ceiling ProtocolLecture 16 - Handling Task DependenciesLecture 17 - Real-Time Task Scheduling on Multiprocessors and Distributed SystemsLecture 18 - Real-Time Task Scheduling on Multiprocessors and Distributed Systems (Continued.)Lecture 19 - Clock Synchronization in Distributed Real-Time SystemsLecture 20 - Internal Clock Synchronization in Presence of Byzantine ClocksLecture 21 - A Few Basic Issues in Real-Time Operating SystemsLecture 22 - Tutorial - ILecture 23 - A Few Basic Issues in Real-Time Operating Systems (Continued.)Lecture 24 - Unix and Windows as RTOSLecture 25 - Real - Time POSIXLecture 26 - Real - Time POSIX (Continued.)Lecture 27 - Open Source and Commercial RTOSLecture 28 - Open Source and Commercial RTOS (Continued.)Lecture 29 - Benchmarking Real - Time Computer & Operating Systems



www.digimat.in

Lecture 30 - Benchmarking Real - Time Computer & Operating Systems (Continued.)Lecture 31 - Real - Time CommunicationsLecture 32 - Few Basic Issues in Real - Time CommunicationsLecture 33 - Review of Computer NetworkingLecture 34 - Real - Time Communication in a LANLecture 35 - Real - Time Communication in a LAN (Continued.)Lecture 36 - Performance of Two Real -Time Communication ProtocolsLecture 37 - Real - Time Communication over Packet Switched NetworksLecture 38 - Real - Time Communication over Packet Switched Networks (Continued.)Lecture 39 - Real - Time Communication over Packet Switched Networks (Continued.)Lecture 40 - Real - Time Databases



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Artificial Intelligence (Prof. Anupam Basu)

Subject Co-ordinator - Prof. Sudeshna Sarkar, Prof. Anupam Basu



Lecture 1 - Introduction to Artificial IntelligenceLecture 2 - Intelligent AgentsLecture 3 - State Space SearchLecture 4 - Uninformed SearchLecture 5 - Informed SearchLecture 6 - Informed Search - 2Lecture 7 - Two Players Games - ILecture 8 - Two Players Games - IILecture 9 - Constraint Satisfaction Problems - 1Lecture 10 - Constraint Satisfaction Problems - 2Lecture 11 - Knowledge Representation and LogicLecture 12 - Interface in Propositional LogicLecture 13 - First Order LogicLecture 14 - Reasoning Using First Order LogicLecture 15 - Resolution in FOPLLecture 16 - Rule Based SystemLecture 17 - Rule Based Systems IILecture 18 - Semantic NetLecture 19 - Reasoning in Semantic NetLecture 20 - FramesLecture 21 - Planning - 1Lecture 22 - Planning - 2Lecture 23 - Planning - 3Lecture 24 - Planning - 4Lecture 25 - Rule Based Expert SystemLecture 26 - Reasoning with Uncertainty - ILecture 27 - Reasoning with Uncertainty - IILecture 28 - Reasoning with Uncertainty - IIILecture 29 - Reasoning with Uncertainty - IV



www.digimat.in

Lecture 30 - Fuzzy Reasoning - ILecture 31 - Fuzzy Reasoning - IILecture 32 - Introduction to Learning - ILecture 33 - Introduction to Learning - IILecture 34 - Rule Induction and Decision Trees - ILecture 35 - Rule Induction and Decision Trees - IILecture 36 - Learning Using neural Networks - ILecture 37 - Learning Using Neural Networks - IILecture 38 - Probabilistic LearningLecture 39 - Natural Language Processing - ILecture 40 - Natural Language Processing - II



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Artificial Intelligence (Prof. P. Dasgupta)

Subject Co-ordinator - Prof. P. Dasgupta



Lecture 1 - Introduction to Artificial IntelligenceLecture 2 - Problem Solving by SearchLecture 3 - Searching with CostsLecture 4 - Informed State Space SearchLecture 5 - Heuristic SearchLecture 6 - Problem Reduction SearchLecture 7 - Searching Game TreesLecture 8 - Knowledge Based SystemsLecture 9 - First Order LogicLecture 10 - Inference in First Order LogicLecture 11 - Resolution - Refutation ProofsLecture 12 - Resolution Refutation ProofsLecture 13 - Logic ProgrammingLecture 14 - Prolog ProgrammingLecture 15 - PrologLecture 16 - Additional TopicsLecture 17 - Introduction to PlanningLecture 18 - Partial Order PlanningLecture 19 - GraphPLAN and SATPlanLecture 20 - SATPlanLecture 21 - Reasoning under uncertaintyLecture 22 - Bayesian NetworksLecture 23 - Reasoning with Bayes NetworksLecture 24 - Reasoning with Bayes networks (Contd.)Lecture 25 - Reasoning under uncertaintyLecture 26 - LearningLecture 27 - LearningLecture 28 - Back Propagation Learning



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Computer Networks

Subject Co-ordinator - Prof. Sujoy Ghosh



Lecture 1 - Emergence of Networks & Reference ModelsLecture 2 - Network TopologyLecture 3 - Physical Medium - ILecture 4 - Physical Medium - IILecture 5 - Multiplexing (Sharing a Medium)Lecture 6 - Telecom NetworksLecture 7 - Switches - ILecture 8 - Pocket SwitchesLecture 9 - SONET/SDHLecture 10 - Fiber Optic ComponentsLecture 11 - Routing and Wavelength AssignmentLecture 12 - Protection and RestorationLecture 13 - Multiple AccessLecture 14 - Token Based MacLecture 15 - Data Link ProtocolsLecture 16 - Error ControlLecture 17 - Stop & Wait ProtocolLecture 18 - Satellite CommunicationLecture 19 - Ethernet - CSMA/CDLecture 20 - Modern EthernetLecture 21 - Local InternetworkingLecture 22 - Cellular NetworksLecture 23 - Wireless NetworkLecture 24 - ATMLecture 25 - ATM Signaling, Routing and LAN EmulationLecture 26 - Introduction to RoutingLecture 27 - RIP - Distance Vector RoutingLecture 28 - IP version 4Lecture 29 - IP Version 6 & Mobile IP



www.digimat.in

Lecture 30 - UDP & Client ServerLecture 31 - TCPLecture 32 - IP MulticastingLecture 33 - DHCP and ICMPLecture 34 - DNS & DirectoryLecture 35 - Congestion ControlLecture 36 - QOS & MultimediaLecture 37 - Network ManagementLecture 38 - SecurityLecture 39 - FTP - SMTPLecture 40 - HTTP



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Data Communication




Lecture 1 - Introduction and Course Outline - Data CommunicationLecture 2 - Layered ArchitectureLecture 3 - Data and SignalLecture 4 - Transmission Impairments and Channel CapacityLecture 5 - Guided Transmission MediaLecture 6 - Unguided MediaLecture 7 - Transmission of Digital Signal - ILecture 8 - Transmission of Digital Signal - IILecture 9 - Transmission of Analog Signal - ILecture 10 - Transmission of Analog Signal - IILecture 11 - MultiplexingLecture 12 - MultiplexingLecture 13 - Multiplexing Applications - ILecture 14 - Multiplexing Applications - IILecture 15 - Interfacing to the MediaLecture 16 - Error Detection and CorrectionLecture 17 - Flow and Error ControlLecture 18 - Data Link ControlLecture 19 - Switching Techniques Circuit SwitchingLecture 20 - Switching Techniques Packet SwitchingLecture 21 - Routing - ILecture 22 - Routing - IILecture 23 - Congestion ControlLecture 24 - X.25 and Frame RelayLecture 25 - ATMLecture 26 - Medium Access Control - ILecture 27 - Medium Access Control - IILecture 28 - Medium Access Control - IIILecture 29 - IEEE 802 LANs



www.digimat.in

Lecture 30 - High Speed LANsLecture 31 - Wireless LANsLecture 32 - Cellular Telephone SystemsLecture 33 - Satellite CommunicationsLecture 34 - Internet and InternetworkingLecture 35 - TCP/IP - ILecture 36 - TCP/IP - IILecture 37 - Multimedia NetworksLecture 38 - Audio and Video CompressionLecture 39 - Multimedia ServicesLecture 40 - Secured Communication - ILecture 41 - Secured Communication - II



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Electronic Design Automation

Subject Co-ordinator - Prof. Indranil Sengupta



Lecture 1 - IntroductionLecture 2 - VerilogLecture 3 - VerilogLecture 4 - VerilogLecture 5 - VerilogLecture 6 - VerilogLecture 7 - VerilogLecture 8 - SynthesisLecture 9 - SynthesisLecture 10 - SynthesisLecture 11 - SynthesisLecture 12 - SynthesisLecture 13 - SynthesisLecture 14 - SynthesisLecture 15 - Backend DesignLecture 16 - Backend DesignLecture 17 - Backend DesignLecture 18 - Backend DesignLecture 19 - Backend DesignLecture 20 - Backend DesignLecture 21 - Backend DesignLecture 22 - Backend DesignLecture 23 - Backend DesignLecture 24 - Backend DesignLecture 25 - Backend DesignLecture 26 - Backend DesignLecture 27 - Backend DesignLecture 28 - Backend DesignLecture 29 - Backend Design



www.digimat.in

Lecture 30 - Testing Part - ILecture 31 - Testing Part - IILecture 32 - Testing Part - IIILecture 33 - Testing Part - IVLecture 34 - Testing Part - VLecture 35 - Testing Part - VI



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Internet Technology

Subject Co-ordinator - Prof. Indranil Sengupta



Lecture 1 - Introduction To InternetLecture 2 - Review Of Network TechnologiesLecture 3 - TCP/IP - Part-ILecture 4 - TCP/IP - Part-IILecture 5 - TCP/IP - Part-IIILecture 6 - IP Subnetting and AddressingLecture 7 - Internet Routing Protocol - Part-ILecture 8 - Internet Routing Protocol - Part-IILecture 9 - Client Server Concepts DNS, Telnet, FTPLecture 10 - Electronic MailLecture 11 - World Wide Web - Part-ILecture 12 - World Wide Web - Part-IILecture 13 - HTMLLecture 14 - HTMLLecture 15 - HTMLLecture 16 - Extensible Markup Language (XML)Lecture 17 - HTML FormsLecture 18 - Image MapsLecture 19 - CGI ScriptsLecture 20 - Other TechnologiesLecture 21 - PERL - Part-ILecture 22 - PERL - Part IILecture 23 - PERL - Part IIILecture 24 - PERL - Part IVLecture 25 - JavascriptLecture 26 - Javascript Examples (Continued)Lecture 27 - Using CookiesLecture 28 - Java AppletsLecture 29 - Java Applets



www.digimat.in

Lecture 30 - Client-Server Programming In JavaLecture 31 - Intranet, Extranet, FirewallLecture 32 - Basic Cryptographic Concepts Part - ILecture 33 - Basic Cryptographic Concepts Part - IILecture 34 - Basic Cryptographic Concepts Part - IIILecture 35 - Electronic CommerceLecture 36 - Streaming Multimedia ApplicationsLecture 37 - Internet TelephonyLecture 38 - Search Engine And Web CrawlersLecture 39 - Search Engine And Web CrawlersLecture 40 - Course Summary And Conclusion



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Programming and Data Structure

Subject Co-ordinator - Dr. P.P. Chakraborty



Lecture 1 - IntroductionLecture 2 - C Programming - ILecture 3 - C Programming - IILecture 4 - C Programming - IIILecture 5 - Data StructuringLecture 6 - Data StructuringLecture 7 - Data StructuringLecture 8 - Problem Decomposition By Recursion - ILecture 9 - Problem Decomposition By Recursion - IILecture 10 - Problem Decomposition By Recursion - IIILecture 11 - Merge sort And Quick sortLecture 12 - Characters And StringsLecture 13 - ArraysLecture 14 - Structures - ILecture 15 - Structures - IILecture 16 - Dynamic Allocation Part - ILecture 17 - Linked Lists - ILecture 18 - Complexity (Efficiency) of AlgorithmsLecture 19 - Asymptotic Growth FunctionsLecture 20 - Asymptotic Analysis of AlgorithmsLecture 21 - Data StructuringLecture 22 - Search TreesLecture 23 - Search Trees - IILecture 24 - Search Trees - IIILecture 25 - 2-3 TreesLecture 26 - Algorithm Design - ILecture 27 - Algorithm Design - IILecture 28 - Algorithm Design - IIILecture 29 - Graphs - I



www.digimat.in

Lecture 30 - Graphs - IILecture 31 - Graphs - IIILecture 32 - Conclusions



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - NOC:Software Testing

Subject Co-ordinator - Prof. Rajib Mall



Lecture 1 - IntroductionLecture 2 - Levels of TestingLecture 3 - Basic Concepts in TestingLecture 4 - Basic Concepts in Testing (Continued...)Lecture 5 - Unit TestingLecture 6 - Equivalence and BV TestingLecture 7 - Special Value TestingLecture 8 - Combinatorial TestingLecture 9 - Pairwise TestingLecture 10 - White Box TestingLecture 11 - MC/DC TestingLecture 12 - MC/DC Testing (Continued...)Lecture 13 - Path TestingLecture 14 - Dataflow and Mutation TestingLecture 15 - Mutation TestingLecture 16 - Integration TestingLecture 17 - System TestingLecture 18 - Regression TestingLecture 19 - Testing Object-Oriented Program - Part 1Lecture 20 - Testing Object-Oriented Program - Part 2



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - NOC:Programming in C++

Subject Co-ordinator - Prof. Partha Pratim Das



Lecture 1 - Module 1Lecture 2 - Module 1Lecture 3 - Module 1Lecture 4 - Module 2Lecture 5 - Module 3Lecture 6 - Module 4Lecture 7 - Module 5Lecture 8 - Module 6Lecture 9 - Module 6Lecture 10 - Module 7Lecture 11 - Module 7Lecture 12 - Module 8Lecture 13 - Module 8Lecture 14 - Module 8Lecture 15 - Module 9Lecture 16 - Module 9Lecture 17 - Module 10Lecture 18 - Module 10Lecture 19 - Module 11Lecture 20 - Module 11Lecture 21 - Module 12Lecture 22 - Module 12Lecture 23 - Module 13Lecture 24 - Module 13Lecture 25 - Module 13Lecture 26 - Module 14Lecture 27 - Module 14Lecture 28 - Module 14Lecture 29 - Module 15



www.digimat.in

Lecture 30 - Module 15Lecture 31 - Module 16Lecture 32 - Module 17Lecture 33 - Module 18Lecture 34 - Module 19Lecture 35 - Module 20Lecture 36 - Module 21Lecture 37 - Module 22Lecture 38 - Module 23Lecture 39 - Module 24Lecture 40 - Module 25Lecture 41 - Module 26Lecture 42 - Module 27Lecture 43 - Module 28Lecture 44 - Module 29Lecture 45 - Module 30Lecture 46 - Module 31Lecture 47 - Module 32Lecture 48 - Module 33Lecture 49 - Module 34Lecture 50 - Module 35Lecture 51 - Module 35Lecture 52 - Module 36Lecture 53 - Module 37Lecture 54 - Module 38Lecture 55 - Module 39Lecture 56 - Module 40



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - NOC:Introduction to Machine Learning

Subject Co-ordinator - Prof. S. Sarkar



Lecture 1 - IntroductionLecture 2 - Different Types of LearningLecture 3 - Hypothesis Space and Inductive BiasLecture 4 - Evaluation and Cross-ValidationLecture 5 - Tutorial - ILecture 6 - Linear RegressionLecture 7 - Introduction to Decision TreesLecture 8 - Learning Decision TreeLecture 9 - OverfittingLecture 10 - Python Exercise on Decision Tree and Linear RegressionLecture 11 - Tutorial - IILecture 12 - k-Nearest NeighbourLecture 13 - Feature SelectionLecture 14 - Feature ExtractionLecture 15 - Collaborative FilteringLecture 16 - Python Exercise on kNN and PCALecture 17 - Tutorial - IIILecture 18 - Bayesian LearningLecture 19 - Naive BayesLecture 20 - Bayesian NetworkLecture 21 - Python Exercise on Naive BayesLecture 22 - Tutorial - IVLecture 23 - Logistic RegressionLecture 24 - Introduction Support Vector MachineLecture 25 - SVMLecture 26 - SVMLecture 27 - Nonlinear SVM and Kennel FunctionLecture 28 - SVMLecture 29 - Python Exercise on SVM



www.digimat.in

Lecture 30 - IntroductionLecture 31 - Multilayer Neural NetworkLecture 32 - Neural Network and Backpropagation AlgorithmLecture 33 - Deep Neural NetworkLecture 34 - Python Exercise on Neural NetworkLecture 35 - Tutorial - VILecture 36 - Introduction to Computational Learning TheoryLecture 37 - Sample ComplexityLecture 38 - VC DimensionLecture 39 - Introduction to EnsemblesLecture 40 - Bagging and BoostingLecture 41 - Introduction to ClusteringLecture 42 - Kmeans ClusteringLecture 43 - Agglomerative Hierarchical ClusteringLecture 44 - Python Exercise on kmeans clustering



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - NOC:Object-Oriented Analysis and Design

Subject Co-ordinator - Prof. Partha Pratim Das



Lecture 1 - Challanges in Software EngineeringLecture 2 - Complexity of SoftwareLecture 3 - Complexity of Software (Continued...)Lecture 4 - Structure and Attributes of a Complex SystemLecture 5 - Structure and Attributes of a Complex System (Continued...)Lecture 6 - Object-Oriented Analysis and DesignLecture 7 - Bringing Order to ChaosLecture 8 - Bringing Order to Chaos (Continued...)Lecture 9 - Evolution of Object Models - Programming Languages and ParadigmsLecture 10 - Foundations of the Object Model - OOA, OOD and OOPLecture 11 - Foundations of the Object Model - OOA, OOD and OOP (Continued...)Lecture 12 - Elements of Object Model (Major)Lecture 13 - Elements of Object Model (Major)Lecture 14 - Elements of the Object Model (Major)Lecture 15 - Elements of the Object Model (Major)Lecture 16 - Elements of the Object Model (Minor)Lecture 17 - Elements of the Object Model (Minor)Lecture 18 - Nature of an objectLecture 19 - Nature of an objectLecture 20 - Relationships among objectsLecture 21 - Relationships among objects (Continued...)Lecture 22 - Nature of a classLecture 23 - Nature of a classLecture 24 - Relationships among classesLecture 25 - Relationships among classes (Continued...)Lecture 26 - How to Build Quality Classes and ObjectsLecture 27 - TutorialLecture 28 - How to Identify Classes and Objects ?Lecture 29 - Identification of Classes, Objects and Relationship in LMS



www.digimat.in

Lecture 30 - Identification of Classes, Objects and Relationship in LMS (Continued...)Lecture 31 - Identification of Classes, Objects and Relationship in LMS (Continued...)Lecture 32 - Identification of Classes, Objects and Relationship in LMS (Continued...)Lecture 33 - Overview of UMLLecture 34 - SDLC Phases and UML DiagramsLecture 35 - Use-Case Diagrams - Part ILecture 36 - Use-Case Diagrams - Part IILecture 37 - Use-Case Diagrams - Part IIILecture 38 - Class Diagrams - Part 1 (Class, Property and Operation)Lecture 39 - Class Diagrams - Part 2 (Association, Weak and Strong Aggregation)Lecture 40 - Class Diagrams - Part 3 (Generalization, Dependency and Constraints)Lecture 41 - Sequence Diagrams - Part 1Lecture 42 - Sequence Diagrams - Part 2Lecture 43 - Communication DiagramLecture 44 - Activity Diagrams - Part IILecture 45 - Activity Diagrams - Part IILecture 46 - Activity Diagrams - Part IIILecture 47 - Interaction Overview DiagramLecture 48 - State Machine Diagrams - Part ILecture 49 - State Machine Diagrams - Part IILecture 50 - State Machine Diagrams - Part IIILecture 51 - Various UML DiagramsLecture 52 - Closing Comments



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - NOC:Complex Network : Theory and Application

Subject Co-ordinator - Prof. Animesh Mukherjee



Lecture 1 - IntroductionLecture 2 - Network Analysis - ILecture 3 - Network Analysis - IILecture 4 - Network Analysis - IIILecture 5 - Network Analysis - IVLecture 6 - Network Analysis - VLecture 7 - Network Analysis - VILecture 8 - Social Network Principles - ILecture 9 - Social Network Principles - IILecture 10 - Social Network Principles - IIILecture 11 - Social Network Principles - IVLecture 12 - Community Analysis - ILecture 13 - Community Analysis - IILecture 14 - Community Analysis - IIILecture 15 - Community Analysis - IVLecture 16 - Community Analysis - VLecture 17 - Community Analysis - VILecture 18 - Citation Analysis - ILecture 19 - Citation Analysis - IILecture 20 - Citation Analysis - IIILecture 21 - Citation Analysis - IV



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Fundamental Algorithms:Design and Analysis

Subject Co-ordinator - Prof.Sourav Mukhopadhyay



Lecture 1 - Insertion Sort and Asymptotic AnalysisLecture 2 - Solving RecurrencesLecture 3 - Divide and Conquer ParadigmLecture 4 - Quick SortLecture 5 - Heap SortLecture 6 - Decision TreeLecture 7 - Linear Time SortingLecture 8 - Order StatisticsLecture 9 - HashingLecture 10 - Universal Hashing, BST SortLecture 11 - Red-Black TreeLecture 12 - Augmenting Data StructureLecture 13 - Computational GeometryLecture 14 - Van Emde Boas Data StructureLecture 15 - Dynamic ProgrammingLecture 16 - Graph AlgorithmLecture 17 - BFS and DFSLecture 18 - DijkstraLecture 19 - Bellman FordLecture 20 - Floyd Marshall



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Pattern Recognition

Subject Co-ordinator - Prof. Sukhendu Das, Prof. C.A. Murthy

Co-ordinating Institute - IIT - Madras | Indian Statistical Institute


Lecture 1 - Principles of Pattern Recognition I (Introduction and Uses)Lecture 2 - Principles of Pattern Recognition II (Mathematics)Lecture 3 - Principles of Pattern Recognition III (Classification and Bayes Decision Rule)Lecture 4 - Clustering vs. ClassificationLecture 5 - Relevant Basics of Linear Algebra, Vector SpacesLecture 6 - Eigen Value and Eigen VectorsLecture 7 - Vector SpacesLecture 8 - Rank of Matrix and SVDLecture 9 - Types of ErrorsLecture 10 - Examples of Bayes Decision RuleLecture 11 - Normal Distribution and Parameter EstimationLecture 12 - Training Set, Test SetLecture 13 - Standardization, Normalization, Clustering and Metric SpaceLecture 14 - Normal Distribution and Decision Boundaries ILecture 15 - Normal Distribution and Decision Boundaries IILecture 16 - Bayes TheoremLecture 17 - Linear Discriminant Function and PerceptronLecture 18 - Perceptron Learning and Decision BoundariesLecture 19 - Linear and Non-Linear Decision BoundariesLecture 20 - K-NN ClassifierLecture 21 - Principal Component Analysis (PCA)Lecture 22 - Fisherâ��s LDALecture 23 - Gaussian Mixture Model (GMM)Lecture 24 - AssignmentsLecture 25 - Basics of Clustering, Similarity/Dissimilarity Measures, Clustering Criteria.Lecture 26 - K-Means Algorithm and Hierarchical ClusteringLecture 27 - K-Medoids and DBSCANLecture 28 - Feature SelectionLecture 29 - Feature Selection



www.digimat.in

Lecture 30 - Feature SelectionLecture 31 - Cauchy Schwartz InequalityLecture 32 - Feature Selection Criteria FunctionLecture 33 - Feature Selection Criteria FunctionLecture 34 - Principal ComponentsLecture 35 - Comparison Between Performance of ClassifiersLecture 36 - Basics of Statistics, Covariance, and their PropertiesLecture 37 - Data Condensation, Feature Clustering, Data VisualizationLecture 38 - Probability Density EstimationLecture 39 - Visualization and AggregationLecture 40 - Support Vector Machine (SVM)Lecture 41 - FCM and Soft-Computing TechniquesLecture 42 - Examples of Uses or Application of Pattern Recognition; And When to do clusteringLecture 43 - Examples of Real-Life Dataset



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Performance Evaluation of Computer Systems

Subject Co-ordinator - Prof. Krishna Moorthy Sivalingam

Co-ordinating Institute - IIT - Madras


Lecture 1 - Introduction to performance evaluation of computer systemsLecture 2 - How to avoid common mistakesLecture 3 - Selection of techniques and metricsLecture 4 - Case studyLecture 5 - Random Variables and probability distributionsLecture 6 - Probability distributions - ILecture 7 - Probability distributions - IILecture 8 - Probability distributions - IIILecture 9 - Stochastic processLecture 10 - Markov ChainLecture 11 - Slotted Aloha protocol model and discrete-time birth death processLecture 12 - Continuous time Markov chain and queuing theory - ILecture 13 - Queuing theory - I (Continued)Lecture 14 - Queuing theory - IILecture 15 - Queuing theory - IIILecture 16 - Queuing theory - IVLecture 17 - Queuing theory - VLecture 18 - Queuing theory - VILecture 19 - Queuing networks - ILecture 20 - Queuing networks - IILecture 21 - Slotted Aloha Markov modelLecture 22 - Simulations - ILecture 23 - Simulations - IILecture 24 - Simulations - IIILecture 25 - Operational laws - ILecture 26 - Operational laws - IILecture 27 - Open and closed queuing networksLecture 28 - Approximate MVALecture 29 - Convolution algorithm - I



www.digimat.in

Lecture 30 - Convolution algorithm - IILecture 31 - Load-dependent service centersLecture 32 - Hierarchical decompositionLecture 33 - Balanced Job BoundsLecture 34 - Confidence interval for propotions and introduction to experimental designLecture 35 - 2k factorial designLecture 36 - 2k r factorial design and 2k-p fractional factorial designLecture 37 - Programming aspects of discrete-event simulations - ILecture 38 - Programming aspects of discrete-event simulations - IILecture 39 - Discrete-event simulations - IIILecture 40 - PetriNets - ILecture 41 - PetriNets - IILecture 42 - PetriNets - III



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Theory of Automata, Formal Languages and Computation

Subject Co-ordinator - Prof. Kamala Krithivasan



Lecture 1 - Grammars and Natural Language ProcessingLecture 2 - Grammars and Languages GeneratedLecture 3 - Grammars and Languages Generated (Continued.)Lecture 4 - Ambiguity in CFGLecture 5 - Simplication of CFGLecture 6 - Removal of Unit Productions, Chomsky Normal Form for CFGLecture 7 - Greibach Normal Form for CFGLecture 8 - Final State AutomataLecture 9 - Non Deterministic FSALecture 10 - Non Deterministic FSA (Continued.)Lecture 11 - Non Deterministic FSA with E(Epsilon)- MovesLecture 12 - Equivalence Between FSA and Type 3 GrammarsLecture 13 - Regular Expressions, Regular Expressions to NFSALecture 14 - DFSA to Regular ExpressionsLecture 15 - Problems and Solutions - ILecture 16 - Pumping Lemmas for Regular Sets and CFLLecture 17 - MYHILL - Nerode TheoremLecture 18 - Minimization of DFSALecture 19 - FSA with output Moore and Mealy MachinesLecture 20 - Pushdown AutomataLecture 21 - Pushdown Automata, Equivalence Between Acceptance by Empty Store and Acceptance by Final StateLecture 22 - Pushdown Automata CFG to PDALecture 23 - Pushdown Automata PDA to CFGLecture 24 - Problems and Solutions - IILecture 25 - Problems and Solutions - IIILecture 26 - Turing MachinesLecture 27 - Turing Machines (Continued.)Lecture 28 - Turing Machine as Acceptor, Techniques for TM ConstructionLecture 29 - Generalized Versions of Turing Machines



www.digimat.in

Lecture 30 - Turing Machine as a Generating DeviceLecture 31 - Recursive Sets, Recursively Innumerable Sets, Encoding of TM, Halting ProblemLecture 32 - Problems and Instances, Universal TM, DecidabilityLecture 33 - RICE'S Theorem, Linear Bounded Automata, Properties of TMLecture 34 - POST'S Correspondence ProblemsLecture 35 - POST'S Correspondence Problems (Continued.), Time and Tape Complexity of TMLecture 36 - NP - Complete Problems, Cook's TheoremLecture 37 - NP - Complete Problems (Continued.)Lecture 38 - Regulated RewritingLecture 39 - L-SystemsLecture 40 - Grammar SystemsLecture 41 - DNA ComputingLecture 42 - Membrane Computing



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Computer Graphics

Subject Co-ordinator - Prof. Sukhendu Das



Lecture 1 - DefinitionLecture 2 - Basic ElementsLecture 3 - HistoryLecture 4 - ApplicationLecture 5 - Graphic rendering pipelineLecture 6 - Input devicesLecture 7 - Line Drawing AlgorithmLecture 8 - Midpoint Circle AlgorithmLecture 9 - Ellipse drawing algoritmLecture 10 - Point ClippingLecture 11 - Line ClippingLecture 12 - Polygon ClippingLecture 13 - Two - DimensionalLecture 14 - Three - DimensionalLecture 15 - 3D ViewingLecture 16 - Parametric CurvesLecture 17 - IntroductionLecture 18 - Generation of FractalsLecture 19 - Geometric fractalsLecture 20 - RecapitulationLecture 21 - Random FractalsLecture 22 - ApplicationsLecture 23 - Conventional AnimationLecture 24 - Real time vs ImageLecture 25 - Animation TechniquesLecture 26 - RotoscopyLecture 27 - Key FramingLecture 28 - Spline Driven AnimationLecture 29 - Morphing



www.digimat.in

Lecture 30 - Particle SystemsLecture 31 - Illumination ModelLecture 32 - Polygon ShadingLecture 33 - Solid Models



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Computer Organization

Subject Co-ordinator - Prof. S. Raman



Lecture 1 - Introduction To ComputingLecture 2 - Introduction To SystemLecture 3 - Introduction To SystemLecture 4 - Processor ActivitiesLecture 5 - Processor As a State MachineLecture 6 - Data Path ArchitectureLecture 7 - Data Path ControllerLecture 8 - State Machine DesignLecture 9 - Controller DesignLecture 10 - Controller Design (Contd)Lecture 11 - Typical Micro InstructionsLecture 12 - Addressing ModesLecture 13 - Problem ExerciseLecture 14 - Problem ExerciseLecture 15 - Introduction to memory systemLecture 16 - CPU - Memory InteractionLecture 17 - Cache OrganizationLecture 18 - Cache OrganizationLecture 19 - Virtual MemoryLecture 20 - Virtual MemoryLecture 21 - Performance CalculationLecture 22 - SegmentationLecture 23 - Address Translation and ProtectionLecture 24 - Programmed I/OLecture 25 - Interrupt Driven I/OLecture 26 - DMALecture 27 - Device Service RoutinesLecture 28 - Evolution Of I/OLecture 29 - I/O Devices



www.digimat.in

Lecture 30 - I/O Devices - ContdLecture 31 - BusesLecture 32 - Buses ContdLecture 33 - Conclusion



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Database Design

Subject Co-ordinator - Dr. S. Srikanth, Prof. D. Janaki Ram

Co-ordinating Institute - IIT - Madras | IIIT - Bangalore


Lecture 1 - Introduction to Database Management SystemLecture 2 - Conceptual DesignsLecture 3 - Conceptual DesignsLecture 4 - Relational ModelLecture 5 - Relational ModelLecture 6 - Structured Query Language - ILecture 7 - Structured Query Language - IILecture 8 - ER Model to Relational MappingLecture 9 - Functional Dependencies and Normal FormLecture 10 - ER Model to Relational Model MappingLecture 11 - Storage StructuresLecture 12 - Indexing Techniques Single LevelLecture 13 - Indexing Techniques Multi LevelLecture 14 - Constraints and TriggersLecture 15 - Query Processing and OptimizationLecture 16 - Query Processing and Optimization - IILecture 17 - Query Processing and Optimization - IIILecture 18 - Transaction Processing ConceptsLecture 19 - Transaction Processing and Database ManagerLecture 20 - Foundation for Concurrency ControlLecture 21 - Concurrency Control Part - 1Lecture 22 - Concurrency Control Part - 2Lecture 23 - Concurrency Control Part - 3Lecture 24 - Concurrency Control Part - 4Lecture 25 - Distributed Transaction ModelsLecture 26 - Basic 2-Phase and 3-phase commit protocolLecture 27 - Concurrency Control for Distributed TransactionLecture 28 - Introduction to Transaction RecoveryLecture 29 - Recovery Mechanisms - II



www.digimat.in

Lecture 30 - Recovery Mechanisms - IIILecture 31 - Introduction to Data Warehousing and OLAPLecture 32 - Introduction to Data Warehousing and OLAPLecture 33 - Case StudyLecture 34 - Case Study ORACLE and Microsoft AccessLecture 35 - Data Mining and Knowledge DiscoveryLecture 36 - Data Mining and Knowledge Discovery Part - IILecture 37 - Object Oriented DatabasesLecture 38 - Object Oriented Databases - IILecture 39 - XML - Introductory ConceptsLecture 40 - XML - Advanced ConceptsLecture 41 - XML - DatabasesLecture 42 - Case Study - Part One - Database DesignLecture 43 - Case Study - Part Two - Database Design



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Discrete Mathematical Structures

Subject Co-ordinator - Prof. Kamala Krithivasan



Lecture 1 - Propositional LogicLecture 2 - Propositional Logic (Continued)Lecture 3 - Predicates & QuantifiersLecture 4 - Predicates & Quantifiers (Continued)Lecture 5 - Logical InferenceLecture 6 - Resolution Principles & Application to PROLOGLecture 7 - Methods of ProofLecture 8 - Normal FormsLecture 9 - Proving Programs Correct (Continued)Lecture 10 - SetsLecture 11 - InductionLecture 12 - Set Operations On StringsLecture 13 - RelationsLecture 14 - GraphsLecture 15 - Graphs (Continued)Lecture 16 - TreesLecture 17 - Trees And GraphsLecture 18 - Special Properties Of RelationsLecture 19 - Closure Of RelationsLecture 20 - Closure Properties Of RelationsLecture 21 - Order RelationsLecture 22 - Order Relations And Equivalence RelationsLecture 23 - Equivalence Relations And PartitionsLecture 24 - FunctionsLecture 25 - Functions (Continued)Lecture 26 - Functions (Continued)Lecture 27 - Pigeonhole PrincipleLecture 28 - Permutations And CombinationsLecture 29 - Permutations And Combinations (Continued)



www.digimat.in

Lecture 30 - Generating FunctionsLecture 31 - Generating Functions (Continued)Lecture 32 - Recurrence RelationsLecture 33 - Recurrence Relations (Continued)Lecture 34 - Recurrence Relations (Continued)Lecture 35 - AlgebrasLecture 36 - Algebras (Continued)Lecture 37 - Algebras (Continued)Lecture 38 - Finite State AutomatonLecture 39 - Finite State Automaton (Continued)Lecture 40 - Lattices



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Artificial Intelligence (Prof. Deepak Khemani)

Subject Co-ordinator - Prof. Deepak Khemani



Lecture 1 - Artificial IntelligenceLecture 2 - Introduction to AILecture 3 - AI IntroductionLecture 4 - AI IntroductionLecture 5 - IntroductionLecture 6 - State Space Search - IntroductionLecture 7 - Search - DFS and BFSLecture 8 - Search DFIDLecture 9 - Heuristic SearchLecture 10 - Hill ClimbingLecture 11 - Solution Space Search, Beam SearchLecture 12 - TSP Greedy MethodsLecture 13 - Tabu SearchLecture 14 - Optimization - I (Simulated Annealing)Lecture 15 - Optimization - II (Genetic Algorithms)Lecture 16 - Population based methods for OptimizationLecture 17 - Population Based Methods IILecture 18 - Branch and Bound, Dijkstra's AlgorithmLecture 19 - A* AlgorithmLecture 20 - Admissibility of A*Lecture 21 - A* Monotone Property, Iterative Deeping A*Lecture 22 - Recursive Best First Search, Sequence AllignmentLecture 23 - Pruning the Open and Closed listsLecture 24 - Problem Decomposition with Goal TreesLecture 25 - AO* AlgorithmLecture 26 - Game PlayingLecture 27 - Game Playing - Minimax SearchLecture 28 - Game Playing - AlphaBetaLecture 29 - Game Playing - SSS *



www.digimat.in

Lecture 30 - Rule Based SystemsLecture 31 - Inference EnginesLecture 32 - Rete AlgorithmLecture 33 - PlanningLecture 34 - Planning FSSP, BSSPLecture 35 - Goal Stack Planning. Sussman's AnomalyLecture 36 - Non-linear planningLecture 37 - Plan Space PlanningLecture 38 - GraphPlanLecture 39 - Constraint Satisfaction ProblemsLecture 40 - CSP continuedLecture 41 - Knowledge-based systemsLecture 42 - Knowledge-based Systems, PLLecture 43 - Propositional LogicLecture 44 - Resolution Refutation for PLLecture 45 - First-order Logic (FOL)Lecture 46 - Reasoning in FOLLecture 47 - Backward chainingLecture 48 - Resolution for FOL



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - NOC:Programming, Data Structures and Algorithms

Subject Co-ordinator - Prof. Hema A Murthy, Prof. Shankar Balachandran, Dr. N.S. Narayanaswamy


Lecture 1 - Introduction to Computers and ProgrammingLecture 2 - Writing your first programLecture 3 - Variables, Operators and ExpressionsLecture 4 - Variable declarations, more operators and precedenceLecture 5 - Input and Output StatementsLecture 6 - ConditionalsLecture 7 - LoopsLecture 8 - Video Solution to Digital Root Programming AssignmentLecture 9 - Introduction to arraysLecture 10 - Working with 1D arraysLecture 11 - Find prime numbersLecture 12 - Debugging demoLecture 13 - Multi-dimensional arraysLecture 14 - PointersLecture 15 - More on pointersLecture 16 - Arrays and pointer arithmeticLecture 17 - Introduction to StringsLecture 18 - More on StringsLecture 19 - Video Solution to Print Elements of a Matrix in Spiral Order Programming AssignmentLecture 20 - Introduction to functionsLecture 21 - More details on functionsLecture 22 - Arguments, variables and parametersLecture 23 - Pass parameters by referenceLecture 24 - Recursive functionsLecture 25 - Running time of a programLecture 26 - Computing time complexityLecture 27 - Video Solution to Palindrome Checker Programming AssignmentLecture 28 - Algorithms and PoweringLecture 29 - Polynomial evaluation and multiplicationLecture 30 - Linear and Binary Search AnalysisLecture 31 - Analysis of minimum and maximum in an arrayLecture 32 - Sorting ILecture 33 - Sorting II



www.digimat.in

Lecture 34 - Finding i-th smallest numberLecture 35 - Video Solution to Sorting words Programming AssignmentLecture 36 - StructuresLecture 37 - More on structuresLecture 38 - Using structures and pointers to structuresLecture 39 - Dynamic memory allocationLecture 40 - Linked ListsLecture 41 - Brief introduction to C++Lecture 42 - Data StructuresLecture 43 - ListsLecture 44 - Supplementary LessonLecture 45 - Video Solution to Implementing a Hash Table ADT Programming AssignmentLecture 46 - StacksLecture 47 - QueuesLecture 48 - TreesLecture 49 - Tree traversalLecture 50 - Binary Search TreesLecture 51 - HeapsLecture 52 - Graphs and RepresentationLecture 53 - Supplementary LessonLecture 54 - Video Solution to the Queue in a Hospital Programming AssignmentLecture 55 - Greedy AlgorithmsLecture 56 - Dynamic ProgrammingLecture 57 - Matrix Chain MultiplicationLecture 58 - Dijkstra's AlgorithmLecture 59 - Boyer-Moore String Matching AlgorithmLecture 60 - File I/OLecture 61 - Modular Programming



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - NOC:Introduction to Information Security I

Subject Co-ordinator - Prof. V. Kamakoti


Lecture 1 - Module 1 - Part 0 - Introduction to the CourseLecture 2 - Module 1 - Part 1 - Definition of Information SecurityLecture 3 - Module 1 - Part 2 - Information Security TerminologiesLecture 4 - Module 1 - Part 3 - Goals of Information SecurityLecture 5 - Module 1 - Part 4 - Implementation Issues of the Goals of Information Security - ILecture 6 - Module 1 - Part 5 - Implementation Issues of the Goals of Information Security - IILecture 7 - Module 1 - Part 6 - Control Mechanisms for Information Security - ILecture 8 - Module 1 - Part 7 - Access Control - Administrative and TechnicalLecture 9 - Module 1 - Part 8 - Passwords - Are they secure? - ILecture 10 - Module 1 - Part 9 - Access Control - Administrative and TechnicalLecture 11 - Module 1 - Part 10 - Passwords - Are they secure? - IIILecture 12 - Module 1 - Part 11 - Multifactor Authentication - ChallengesLecture 13 - Module 1 - Part 12 - Application Level Control and Information Security PlanningLecture 14 - Module 1 - Part 13 - Information Security - Policy, Standard and PracticeLecture 15 - Module 1 - Part 14 - Policies governing Issues, Roles and ResponsibilitiesLecture 16 - Module 1 - Part 15 - Managing changes in Information Security PoliciesLecture 17 - Module 1 - Part 16 - Spheres of Information SecurityLecture 18 - Module 2 - Part 1 - Protecting your Personal Computer - ILecture 19 - Module 2 - part 2 - Protecting your Personal Computer - IILecture 20 - Module 2 - Part 3 - Protecting your Personal Computer - IIILecture 21 - Module 2 - Part 4 - Cloud Computing (Basic Definitions) - ILecture 22 - Module 2 - Part 5 - Cloud Computing (Deployment) - IILecture 23 - Module 2 - Part 6 - Cloud Computing (Security Issues) - IIILecture 24 - Module 2 - Part 7 - Cloud Computing (Trust and Risk) - IVLecture 25 - Module 2 - Part 8 - Cloud Computing (Security and Privacy Issues) - VLecture 26 - Module 2 - Part 9 - Cloud Computing (Security and Privacy Issues) - VILecture 27 - Module 2 - Part 10 - Cloud Computing (Application and Data level security) - VIILecture 28 - Module 2 - Part 11 - Cloud Computing (Summary) - VIIILecture 29 - Module 2 - Part 12 - Standard ILecture 30 - Module 2 - Part 13 - Standard IILecture 31 - Module 2 - Part 14 - Standard IIILecture 32 - Module 3 - Part 1Lecture 33 - Module 3 - Part 2



www.digimat.in

Lecture 34 - Module 3 - Part 3Lecture 35 - Module 3 - Part 4Lecture 36 - Module 3 - Part 5Lecture 37 - Module 3 - Part 6Lecture 38 - Module 3 - Part 7Lecture 39 - Module 3 - Part 8Lecture 40 - Module 3 - Part 9Lecture 41 - Module 4 - Part 1Lecture 42 - module 4 - Part 2Lecture 43 - Module 4 - Part 3Lecture 44 - Module 4 - Part 4Lecture 45 - Module 4 - Part 5Lecture 46 - Module 4 - Part 6Lecture 47 - Module 4 - Part 7Lecture 48 - Module 4 - Part 8Lecture 49 - Module 4 - Part 9Lecture 50 - Module 4 - Part 10Lecture 51 - Module 5 - Part 1Lecture 52 - Module 5 - Part 2Lecture 53 - Module 5 - Part 3Lecture 54 - Module 5 - Part 4Lecture 55 - Module 5 - Part 5Lecture 56 - Module 5 - Part 6Lecture 57 - Module 5 - Part 7Lecture 58 - Module 6 - Part 1Lecture 59 - Module 6 - Part 2Lecture 60 - Module 6 - Part 3Lecture 61 - Module 6 - Part 4Lecture 62 - Module 6 - Part 5Lecture 63 - Module 6 - Part 6Lecture 64 - Module 6 - Part 7Lecture 65 - Module 6 - Part 8



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - NOC:Programming and Data structures (PDS)

Subject Co-ordinator - Dr. N S. Narayanaswamy


Lecture 1 - A Simple C Program for SortingLecture 2 - Review of Structures, Pointers, and FunctionsLecture 3 - RecursionLecture 4 - Abstract Data Types-Data + MethodsLecture 5 - List Data TypeLecture 6 - Access and update methodsLecture 7 - Doubly Linked List Data TypeLecture 8 - Doubly Linked Lists and ArraysLecture 9 - ADT StacksLecture 10 - Checking of Balanced ParenthesisLecture 11 - Infix and Postfix expressions and Expression evaluationLecture 12 - Queue ADT Definition and ImplementationLecture 13 - Merging using Queue ADT and Queue typesLecture 14 - Tree ADT and TraversalsLecture 15 - Binary Tree ADT and traversalsLecture 16 - Tree Applications



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - NOC:Design and Analysis of Algorithms

Subject Co-ordinator - Prof. Madhavan Mukund

Co-ordinating Institute - Chennai Mathematical Institute

Lecture 1 - Course OutlineLecture 2 - ExampleLecture 3 - ExampleLecture 4 - ExampleLecture 5 - Introduction and motivationLecture 6 - Input size, worst case, average caseLecture 7 - Quantifying efficiencyLecture 8 - ExamplesLecture 9 - Arrays and listsLecture 10 - Searching in an arrayLecture 11 - Selection SortLecture 12 - Insertion sortLecture 13 - Merge sortLecture 14 - Merge sort - analysisLecture 15 - QuicksortLecture 16 - Quicksort - analysisLecture 17 - Sorting - Concluding remarksLecture 18 - Introduction to graphsLecture 19 - Representing graphsLecture 20 - Breadth first search (BFS)Lecture 21 - Depth first search (DFS)Lecture 22 - Applications of BFS and DFSLecture 23 - Directed acylic graphsLecture 24 - Directed acylic graphsLecture 25 - Single source shortest pathsLecture 26 - Dijkstras algorithmLecture 27 - Negative edge weightsLecture 28 - All pairs shortest pathsLecture 29 - Minimum Cost Spanning TreesLecture 30 - Prims AlgorithmLecture 31 - Kruskals algorithmLecture 32 - Union-Find using arraysLecture 33 - Union-Find using pointers



www.digimat.in

Lecture 34 - Priority queuesLecture 35 - HeapsLecture 36 - HeapsLecture 37 - Counting inversionsLecture 38 - Closest pair of pointsLecture 39 - Binary Search TreesLecture 40 - Balanced search treesLecture 41 - Interval schedulingLecture 42 - Scheduling with deadlinesLecture 43 - Huffman codesLecture 44 - Introduction to dynamic programmingLecture 45 - MemoizationLecture 46 - Grid PathsLecture 47 - Common subwords and subsequencesLecture 48 - Edit distanceLecture 49 - Matrix multiplicationLecture 50 - Linear ProgrammingLecture 51 - LP modellingLecture 52 - LP modellingLecture 53 - Network FlowsLecture 54 - ReductionsLecture 55 - Checking AlgorithmsLecture 56 - P and NP



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - NOC:Programming, Data Structures and Algorithms (Aricent)

Subject Co-ordinator - Dr. N S. Narayanaswamy, Prof. Shankar Balachandran, Prof. Hema A Murthy



Lecture 1 - Introduction to Computers and ProgrammingLecture 2 - Writing your first programLecture 3 - Variables, Operators and ExpressionsLecture 4 - Variable declarations, more operators and precedenceLecture 5 - Input and Output StatementsLecture 6 - ConditionalsLecture 7 - LoopsLecture 8 - Introduction to ArraysLecture 9 - Working with 1D ArraysLecture 10 - Find prime numbersLecture 11 - Debugging demoLecture 12 - Multi-dimensional arraysLecture 13 - PointersLecture 14 - More on pointersLecture 15 - Arrays and pointer arithmeticLecture 16 - Introduction to StringsLecture 17 - More on StringLecture 18 - Introduction to functionsLecture 19 - More details on functionsLecture 20 - Arguments, variables and parametersLecture 21 - Pass parameters by referenceLecture 22 - Recursive FunctionsLecture 23 - C control structures, functional specification of programsLecture 24 - Complexity Analysis using Sum and Product RuleLecture 25 - Complexity Analysis of Recursive FunctionsLecture 26 - Algorithms and PoweringLecture 27 - Polynomial evaluation and multiplicationLecture 28 - Linear and Binary Search Analysis



www.digimat.in

Lecture 29 - Analysis of minimum and maximum in an arrayLecture 30 - Sorting ILecture 31 - Sorting IILecture 32 - Finding i-th smallest numberLecture 33 - StructuresLecture 34 - More on StructuresLecture 35 - Using structures and pointers to structuresLecture 36 - Dynamic memory allocationLecture 37 - Linked ListLecture 38 - Brief introduction to C++Lecture 39 - Abstract Data TypesLecture 40 - More on ADT



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - NOC:Computer Architecture

Subject Co-ordinator - Prof.Madhu Mutyam



Lecture 1 - Introduction to Computer ArchitectureLecture 2 - Quantitative Principles of Computer DesignLecture 3 - Instruction Set Principles-Part 1Lecture 4 - Instruction Set Principles-Part 2Lecture 5 - Instruction Set Principles-Part 3Lecture 6 - Cache Memory Hierarchy - Part 1Lecture 7 - Cache Memory Hierarchy - Part 2Lecture 8 - Cache Memory Hierarchy - Part 3Lecture 9 - Cache Memory Hierarchy - Part 4Lecture 10 - Main Memory Design - Part 1Lecture 11 - Main Memory Design - Part 2Lecture 12 - Main Memory Design - Part 3Lecture 13 - Fundamentals of Pipelining - Part 1Lecture 14 - Fundamentals of Pipelining - Part 2Lecture 15 - Fundamentals of Pipelining - Part 3Lecture 16 - Fundamentals of Pipelining - Part 4Lecture 17 - Fundamentals of Pipelining - Part 5Lecture 18 - Scalar to Superscalar pipelineLecture 19 - Instruction DependenciesLecture 20 - Compiler optimizations for Exposing ILPLecture 21 - Advanced Branch Prediction Techniques - Part 1Lecture 22 - Advanced Branch Prediction Techniques - Part 2Lecture 23 - Superscalar OrganizationLecture 24 - Register RenamingLecture 25 - Tomasulo AlgorithmLecture 26 - Dynamic Execution CoreLecture 27 - Multi threadingLecture 28 - Multicore Processor ArchitectureLecture 29 - Cache Coherence



www.digimat.in

Lecture 30 - Cache Coherence Protocol DesignLecture 31 - SynchronizationLecture 32 - Memory Consistency - Part 1Lecture 33 - Memory Consistency - Part 2



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - NOC:Model Checking

Subject Co-ordinator - Prof. B. Srivathsan



Lecture 1 - Course OverviewLecture 2 - Module 1Lecture 3 - Module 2Lecture 4 - Module 3Lecture 5 - Module 4Lecture 6 - SummaryLecture 7 - Module 1Lecture 8 - Module 2Lecture 9 - Module 3Lecture 10 - Module 4Lecture 11 - Summary.Lecture 12 - Module 1Lecture 13 - Module 2Lecture 14 - Module 3Lecture 15 - Module 4Lecture 16 - Module 5Lecture 17 - Summary..Lecture 18 - Module 1Lecture 19 - Module 2Lecture 20 - Module 3Lecture 21 - Module 4Lecture 22 - Summary...Lecture 23 - Module 1Lecture 24 - Module 2Lecture 25 - Module 3Lecture 26 - Module 4Lecture 27 - Summary....Lecture 28 - Module 1Lecture 29 - Module 2



www.digimat.in

Lecture 30 - Module 3Lecture 31 - Module 4Lecture 32 - Summary.....Lecture 33 - Module 1Lecture 34 - Module 2Lecture 35 - Module 3Lecture 36 - Summary.Lecture 37 - Module 1Lecture 38 - Module 2Lecture 39 - Module 3Lecture 40 - Summary..Lecture 41 - Module 1Lecture 42 - Module 2Lecture 43 - Module 3Lecture 44 - summary...Lecture 45 - Module 1Lecture 46 - Module 2Lecture 47 - Module 3Lecture 48 - Module 4Lecture 49 - Summary....Lecture 50 - Module 1Lecture 51 - Module 2Lecture 52 - Module 3Lecture 53 - Summary.....



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - NOC:Functional Programming in Haskell

Subject Co-ordinator - Prof. Madhavan Mukund, Prof. S P Suresh



Lecture 1 - FunctionsLecture 2 - TypesLecture 3 - HaskellLecture 4 - Running Haskell programsLecture 5 - CurryingLecture 6 - ExamplesLecture 7 - ListsLecture 8 - Functions on listsLecture 9 - Characters and stringsLecture 10 - TuplesLecture 11 - Computation as rewritingLecture 12 - Polymorphism and higher-order functionsLecture 13 - Map and filterLecture 14 - List comprehensionLecture 15 - Folding through a listLecture 16 - Measuring efficiencyLecture 17 - SortingLecture 18 - Using infinite listsLecture 19 - Conditional polymorphismLecture 20 - Defining functions in ghciLecture 21 - User-defined datatypesLecture 22 - Abstract datatypesLecture 23 - ModulesLecture 24 - Recursive data typesLecture 25 - Binary search treesLecture 26 - Balanced search treesLecture 27 - ArraysLecture 28 - Input/Output



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Virtual Reality

Subject Co-ordinator - Prof. Steven LaVall



Lecture 1 - Course mechanicsLecture 2 - Goals and VR definitionsLecture 3 - Historical perspectiveLecture 4 - Birds-eye view (general)Lecture 5 - Birds-eye view (general) (Continued...)Lecture 6 - Birds-eye view (hardware)Lecture 7 - Birds-eye view (software)Lecture 8 - Birds-eye view (sensation and perception)Lecture 9 - Geometric modelingLecture 10 - Transforming modelsLecture 11 - Matrix algebra and 2D rotationsLecture 12 - 3D rotations and yaw, pitch, and rollLecture 13 - 3D rotations and yaw, pitch, and roll (Continued...)Lecture 14 - Axis-angle representationsLecture 15 - QuaternionsLecture 16 - Converting and multiplying rotationsLecture 17 - Converting and multiplying rotations (Continued...)Lecture 18 - Homogeneous transformsLecture 19 - The chain of viewing transformsLecture 20 - Eye transformsLecture 21 - Eye transforms (Continued...)Lecture 22 - Canonical view transformLecture 23 - Viewport transformLecture 24 - Viewport transform (Continued...)Lecture 25 - Three interpretations of lightLecture 26 - RefractionLecture 27 - Simple lensesLecture 28 - DioptersLecture 29 - Imaging properties of lenses



www.digimat.in

Lecture 30 - Lens aberrationsLecture 31 - Optical system of eyesLecture 32 - PhotoreceptorsLecture 33 - Sufficient resolution for VRLecture 34 - Light intensityLecture 35 - Eye movementsLecture 36 - Eye movements (Continued...)Lecture 37 - Eye movement issues for VRLecture 38 - Neuroscience of visionLecture 39 - Depth perceptionLecture 40 - Depth perception (Continued...)Lecture 41 - Motion perceptionLecture 42 - Frame rates and displaysLecture 43 - Frame rates and displays (Continued...)Lecture 44 - OverviewLecture 45 - Orientation trackingLecture 46 - Tilt drift correctionLecture 47 - Yaw drift correctionLecture 48 - Tracking with a cameraLecture 49 - Perspective n-point problemLecture 50 - FilteringLecture 51 - Lighthouse approachLecture 52 - Visual Rendering-OverviewLecture 53 - Visual Rendering-overview (Continued...)Lecture 54 - Shading modelsLecture 55 - RasterizationLecture 56 - Pixel shadingLecture 57 - VR-specific problemsLecture 58 - Distortion shadingLecture 59 - Post-rendering image warpLecture 60 - Physics and physiologyLecture 61 - Auditory perceptionLecture 62 - Auditory localizationLecture 63 - RenderingLecture 64 - Spatialization and displayLecture 65 - Combining other sensesLecture 66 - Interfaces -overviewLecture 67 - LocomotionLecture 68 - Manipulation



www.digimat.in

Lecture 69 - System controlLecture 70 - Social interactionLecture 71 - Evaluation of VR Systems



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - NOC:Introduction to Machine Learning (Sponsored by Arihant)

Subject Co-ordinator - Dr. Balaraman Ravindran



Lecture 1 - A brief introduction to machine learningLecture 2 - Supervised LearningLecture 3 - Unsupervised LearningLecture 4 - Reinforcement LearningLecture 5 - Probability Basics - 1Lecture 6 - Probability Basics - 2Lecture 7 - Linear Algebra - 1Lecture 8 - Linear Algebra - 2Lecture 9 - Statistical Decision Theory - RegressionLecture 10 - Statistical Decision Theory - ClassificationLecture 11 - Bias-VarianceLecture 12 - Linear RegressionLecture 13 - Multivariate RegressionLecture 14 - Subset Selection 1Lecture 15 - Subset Selection 2Lecture 16 - Shrinkage MethodsLecture 17 - Principal Components RegressionLecture 18 - Partial Least SquaresLecture 19 - Linear ClassificationLecture 20 - Logistic RegressionLecture 21 - Linear Discriminant Analysis 1Lecture 22 - Linear Discriminant Analysis 2Lecture 23 - Linear Discriminant Analysis 3Lecture 24 - OptimizationLecture 25 - Perceptron LearningLecture 26 - SVM - FormulationLecture 27 - SVM - Interpretation & AnalysisLecture 28 - SVMs for Linearly Non Separable DataLecture 29 - SVM Kernels



www.digimat.in

Lecture 30 - SVM - Hinge Loss FormulationLecture 31 - Weka TutorialLecture 32 - Early ModelsLecture 33 - Backpropogation - ILecture 34 - Backpropogation - IILecture 35 - Initialization, Training and ValidationLecture 36 - Maximum Likelihood EstimateLecture 37 - Priors and MAP EstimateLecture 38 - Bayesian Parameter EstimationLecture 39 - IntroductionLecture 40 - Regression TreesLecture 41 - Stopping Criteria and PruningLecture 42 - Loss Functions for ClassificationLecture 43 - Categorical AttributesLecture 44 - Multiway SplitsLecture 45 - Missing Values, Imputation and Surrogate SplitsLecture 46 - Instability, Smoothness and Repeated SubtreesLecture 47 - TutorialLecture 48 - Evaluation Measures ILecture 49 - Bootstrapping and Cross ValidationLecture 50 - 2 Class Evaluation MeasuresLecture 51 - The ROC CurveLecture 52 - Minimum Description Length and Exploratory AnalysisLecture 53 - Introduction to Hypothesis TestingLecture 54 - Basic ConceptsLecture 55 - Sampling Distributions and the Z TestLecture 56 - Student's t-testLecture 57 - The Two Sample and Paired Sample t-testsLecture 58 - Confidence IntervalsLecture 59 - Bagging, Committee Machines and StackingLecture 60 - BoostingLecture 61 - Gradient BoostingLecture 62 - Random ForestLecture 63 - Naive BayesLecture 64 - Bayesian NetworksLecture 65 - Undirected Graphical Models - IntroductionLecture 66 - Undirected Graphical Models - Potential FunctionsLecture 67 - Hidden Markov ModelsLecture 68 - Variable Elimination



www.digimat.in

Lecture 69 - Belief PropagationLecture 70 - Partitional ClusteringLecture 71 - Hierarchical ClusteringLecture 72 - Threshold GraphsLecture 73 - The BIRCH AlgorithmLecture 74 - The CURE AlgorithmLecture 75 - Density Based ClusteringLecture 76 - Gaussian Mixture ModelsLecture 77 - Expectation MaximizationLecture 78 - Expectation Maximization (Continued...)Lecture 79 - Spectral ClusteringLecture 80 - Learning TheoryLecture 81 - Frequent Itemset MiningLecture 82 - The Apriori PropertyLecture 83 - Introduction to Reinforcement LearningLecture 84 - RL Framework and TD LearningLecture 85 - Solution Methods and ApplicationsLecture 86 - Multi-class Classification



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - NOC:Artificial Intelligence: Knowledge Representation and Reasoning

Subject Co-ordinator - Prof. Deepak Khemani



Lecture 1 - IntroductionLecture 2 - Introduction to Knowledge Representation and ReasoningLecture 3 - An Introduction to Formal LogicsLecture 4 - Propositional LogicLecture 5 - Propositional LogicLecture 6 - Propositional LogicLecture 7 - Propositional LogicLecture 8 - Propositional LogicLecture 9 - Propositional LogicLecture 10 - Propositional LogicLecture 11 - SyntaxLecture 12 - SemanticsLecture 13 - Entailment and ModelsLecture 14 - Proof SystemsLecture 15 - Forward ChainingLecture 16 - UnificationLecture 17 - Forward Chaining Rule Based SystemsLecture 18 - The Rete AlgorithmLecture 19 - Rete Algorithm - ExampleLecture 20 - Programming in a Rule Based LanguageLecture 21 - The OPS5 Expert System ShellLecture 22 - SkolemizationLecture 23 - Terminological FactsLecture 24 - Properties and CategoriesLecture 25 - Reification and Abstract EntitiesLecture 26 - Resource Description Framework (RDF)Lecture 27 - The Event CalculusLecture 28 - Natural Language SemanticsLecture 29 - CD Theory



www.digimat.in

Lecture 30 - CD Theory (Continued...)Lecture 31 - English to CD TheoryLecture 32 - Backward ChainingLecture 33 - Logic ProgrammingLecture 34 - PrologLecture 35 - Search in PrologLecture 36 - Controlling SearchLecture 37 - The Cut Operator in PrologLecture 38 - IncompletenessLecture 39 - The Resolution Method for FOLLecture 40 - Clause FormLecture 41 - FOL with EqualityLecture 42 - Complexity of Resolution RefutationLecture 43 - Semantic Nets and FramesLecture 44 - ScriptsLecture 45 - Applying ScriptsLecture 46 - Goals, Plans and ActionsLecture 47 - Plan Applier MechanismLecture 48 - Top Down and Bottom Up ReasoningLecture 49 - IntroductionLecture 50 - NormalisationLecture 51 - Structure MatchingLecture 52 - Structure Matching - ExampleLecture 53 - ClassificationLecture 54 - A-box reasoningLecture 55 - DLLecture 56 - DLLecture 57 - ALC examplesLecture 58 - Taxonomies and InheritanceLecture 59 - BeliefsLecture 60 - Inheritance HierarchiesLecture 61 - IntroductionLecture 62 - CircumscriptionLecture 63 - Circumscription (Continued...)Lecture 64 - Minimal ModelsLecture 65 - Event Calculus RevisitedLecture 66 - Circumscription in ECLecture 67 - Defaul LogicLecture 68 - Autoepistemc Logic



www.digimat.in

Lecture 69 - Epistemic LogicLecture 70 - The Muddy Children Puzzle



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - NOC:Information Security - II

Subject Co-ordinator - Prof. V. Kamakoti



Lecture 1 - Experimental SetupLecture 2 - Need for Secure SystemsLecture 3 - Ignorance of A is Sin of BLecture 4 - Function calls and StacksLecture 5 - Stack SmashingLecture 6 - Virtual Machine Based RootkitsLecture 7 - Security and ArchitectureLecture 8 - Structured Computer Organization CompletedLecture 9 - X86 ISA - Part1Lecture 10 - X86 ISA - Part 2Lecture 11 - X86 Protected ModeLecture 12 - X86 Memory SegmentationLecture 13 - Process Isolation using SegmentationLecture 14 - Paging and Virtual MemoryLecture 15 - Task Switching and Interrupt ServiceLecture 16 - Memory Segmentation Deep dive - Part 1Lecture 17 - Memory Segmentation Deep dive - Part 2Lecture 18 - Memory Segmentation Deep dive - Part 3Lecture 19 - Memory Segmentation Deep dive - Part 4Lecture 20 - Segmentation RecapLecture 21 - Lab 1 - Part 1Lecture 22 - Lab 1 - Part 2Lecture 23 - Lab 1 - Part 3Lecture 24 - ISR RecapLecture 25 - Lab 2 - Part 1Lecture 26 - Lab 2 - Part 2Lecture 27 - Memory Management RecapLecture 28 - Lab 3 - Part 1Lecture 29 - Lab 3 - Part 2



www.digimat.in

Lecture 30 - Task Switch recapLecture 31 - Lab 4 - Part 1Lecture 32 - Lab 4 - Part 2Lecture 33 - Lab 4 - Part 3Lecture 34 - Lab 4 - Part 4Lecture 35 - Introduction to Basic CryptographyLecture 36 - Public Key CryptographyLecture 37 - Freescale ARM iMX6 ProcessorLecture 38 - High Assurance Boot in iMX6Lecture 39 - Case StudyLecture 40 - Basics of NetworkingLecture 41 - Network Processor Vs General Purpose ProcessorLecture 42 - Network Processor Architecture



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - NOC:Algorithms for Big Data

Subject Co-ordinator - Prof. John Augustine



Lecture 1 - Lesson 1 - Basic definitionsLecture 2 - Lesson 2 - Conditional probabilityLecture 3 - Lesson 3 - Example problemsLecture 4 - Lesson 4 - Karger's mincut algorithmLecture 5 - Lesson 5 - Analysis of Karger's mincut algorithmLecture 6 - Lesson 6 - Random variablesLecture 7 - Lesson 7 - Randomized quicksortLecture 8 - Problem solving video - The rich get richerLecture 9 - Problem solving video - Monty Hall problemLecture 10 - Lesson 1 - Bernoulli, Binomial, and Geometric distributionsLecture 11 - Lesson 2 - Tail BoundsLecture 12 - Lesson 3 - Application of Chernoff boundLecture 13 - Lesson 4 - Application of Chebyshev's inequalityLecture 14 - Lesson 1 - Intro to Big Data AlgorithmsLecture 15 - Lesson 2 - SAT ProblemLecture 16 - Lesson 3 - Classification of StatesLecture 17 - Lesson 4 - Stationary Distribution of a Markov ChainLecture 18 - Lesson 5 - Celebrities Case StudyLecture 19 - Lesson 6 - Random Walks on Undirected GraphsLecture 20 - Lesson 7 - Intro to Streaming, Morris AlgorithmLecture 21 - Lesson 8 - Reservoir SamplingLecture 22 - Lesson 9 - Approximate MedianLecture 23 - Lesson 1 - OverviewLecture 24 - Lesson 2 - Balls, bins, hashingLecture 25 - Lesson 3 - Chain hashing, SUHA, Power of Two choicesLecture 26 - Lesson 4 - Bloom filterLecture 27 - Lesson 5 - Pairwise independenceLecture 28 - Lesson 6 - Estimating expectation of continuous functionLecture 29 - Lesson 1 - Universal hash functions



www.digimat.in

Lecture 30 - Lesson 2 - Perfect hashingLecture 31 - Lesson 3 - Count-min filter for heavy hitters in data streamsLecture 32 - Problem solving video - Doubly Stochastic Transition MatrixLecture 33 - Problem solving video - Random Walks on Linear StructuresLecture 34 - Problem solving video - Lollipop GraphLecture 35 - Problem solving video - Cat And MouseLecture 36 - Lesson 1 - Estimating frequency momentsLecture 37 - Lesson 2 - Property testing frameworkLecture 38 - Lesson 3 - Testing ConnectivityLecture 39 - Lesson 4 - Enforce & Test IntroductionLecture 40 - Lesson 5 - Testing if a graph is a bicliqueLecture 41 - Lesson 6 - Testing bipartitenessLecture 42 - Lesson 1 - Property testing and random walk algorithmsLecture 43 - Lesson 2 - Testing if a graph is bipartite (using random walks)Lecture 44 - Lesson 3 - Graph streaming algorithmsLecture 45 - Lesson 4 - Graph streaming algorithmsLecture 46 - Lesson 5 - Graph streaming algorithmsLecture 47 - Lesson 1 - MapReduceLecture 48 - Lesson 2 - K-Machine Model (aka Pregel Model)



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - NOC:Reinforcement Learning

Subject Co-ordinator - Dr. B. Ravindran



Lecture 1 - Tutorial 1 - Probability Basics 1Lecture 2 - Tutorial 1 - Probability Basics 2Lecture 3 - Tutorial 2 - Linear algebra - 1Lecture 4 - Tutorial 2 - Linear algebra - 2Lecture 5 - Introduction to RLLecture 6 - RL Framework and applicationsLecture 7 - Introduction to Immediate RLLecture 8 - Bandit OptimalitiesLecture 9 - Value function based methodsLecture 10 - UCB 1Lecture 11 - Concentration BoundsLecture 12 - UCB 1 TheoremLecture 13 - PAC BoundsLecture 14 - Median EliminationLecture 15 - Thompson SamplingLecture 16 - Policy SearchLecture 17 - REINFORCELecture 18 - Contextual BanditsLecture 19 - Full RL IntroductionLecture 20 - Returns, Value Functions and MDPsLecture 21 - MDP ModellingLecture 22 - Bellman EquationLecture 23 - Bellman Optimality EquationLecture 24 - Cauchy Sequence and Green's EquationLecture 25 - Banach Fixed Point TheoremLecture 26 - Convergence ProofLecture 27 - Lpi ConvergenceLecture 28 - Value IterationLecture 29 - Policy Iteration



www.digimat.in

Lecture 30 - Dynamic ProgrammingLecture 31 - Monte CarloLecture 32 - Control in Monte CarloLecture 33 - Off Policy MCLecture 34 - UCTLecture 35 - TD(0)Lecture 36 - TD(0) ControlLecture 37 - Q-LearningLecture 38 - AfterstateLecture 39 - Eligibility TracesLecture 40 - Backward View of Eligibility TracesLecture 41 - Eligibility Trace ControlLecture 42 - Thompson Sampling RecapLecture 43 - Function ApproximationLecture 44 - Linear ParameterizationLecture 45 - State Aggregation MethodsLecture 46 - Function Approximation and Eligibility TracesLecture 47 - LSTD and LSTDQLecture 48 - LSPI and Fitted QLecture 49 - DQN and Fitted Q-IterationLecture 50 - Policy Gradient ApproachLecture 51 - Actor Critic and REINFORCELecture 52 - REINFORCE (cont'd)Lecture 53 - Policy Gradient with Function ApproximationLecture 54 - Hierarchical Reinforcement LearningLecture 55 - Types of OptimalityLecture 56 - Semi Markov Decision ProcessesLecture 57 - OptionsLecture 58 - Learning with OptionsLecture 59 - Hierarchical Abstract MachinesLecture 60 - MAXQLecture 61 - MAXQ Value Function DecompositionLecture 62 - Option DiscoveryLecture 63 - POMDP IntroductionLecture 64 - Solving POMDP



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - NOC:Introduction to Operating Systems

Subject Co-ordinator - Prof. Chester Rebeiro



Lecture 1 - Intro to the CourseLecture 2 - Introduction to OSLecture 3 - PC HardwareLecture 4 - From Programs to ProcessesLecture 5 - Sharing the CPULecture 6 - IntroductionLecture 7 - Virtual MemoryLecture 8 - MMU MappingLecture 9 - SegmentationLecture 10 - Memory Management in xv6Lecture 11 - PC BootingLecture 12 - Week 3 IntroductionLecture 13 - Create Execute and Exit from ProcessesLecture 14 - System Calls for Process ManagementLecture 15 - InterruptsLecture 16 - Interrupt HandlingLecture 17 - Software Interrupts and System callsLecture 18 - CPU Context switchingLecture 19 - CPU SchedulingLecture 20 - Priority Based Scheduling AlgorithmsLecture 21 - Multi-Processor SchedulingLecture 22 - Scheduling in LinuxLecture 23 - Completely Fair SchedulingLecture 24 - Inter Process CommunicationLecture 25 - SynchronizationLecture 26 - Software solutions for critical sectionsLecture 27 - Bakery AlgorithmLecture 28 - Hardware LocksLecture 29 - Mutexes



www.digimat.in

Lecture 30 - SemaphoresLecture 31 - Dining Philosophers ProblemLecture 32 - DeadlocksLecture 33 - Dealing with DeadlocksLecture 34 - Threads - Part 1Lecture 35 - Threads - Part 2Lecture 36 - Operating system securityLecture 37 - Information Flow policiesLecture 38 - Buffer OverflowsLecture 39 - Preventing Buffer Overflow Attacks



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - NOC:Programming, Data Structures and Algorithms in Python

Subject Co-ordinator - Prof. Madhavan Mukund



Lecture 1 - Lecture 1 - Algorithms and programmingLecture 2 - Lecture 2 - Improving naive gcdLecture 3 - Lecture 3 - Euclid's algorithm for gcdLecture 4 - Lecture 4 - Downloading and installing PythonLecture 5 - Lecture 1 - Assignment statement, basic types - int, float, boolLecture 6 - Lecture 2 - StringsLecture 7 - Lecture 3 - ListsLecture 8 - Lecture 4 - Control FlowLecture 9 - Lecture 5 - FunctionsLecture 10 - Lecture 6 - ExamplesLecture 11 - Lecture 1 - More about range()Lecture 12 - Lecture 2 - Manipulating listsLecture 13 - Lecture 3 - Breaking out of a loopLecture 14 - Lecture 4 - Arrays vs lists, binary searchLecture 15 - Lecture 5 - EfficiencyLecture 16 - Lecture 6 - Selection SortLecture 17 - Lecture 7 - Insertion SortLecture 18 - Lecture 8 - RecursionLecture 19 - Lecture 1 - MergesortLecture 20 - Lecture 2 - Mergesort, analysisLecture 21 - Lecture 3 - QuicksortLecture 22 - Lecture 4 - Quicksort analysisLecture 23 - Lecture 5 - Tuples and dictionariesLecture 24 - Lecture 6 - Function definitionsLecture 25 - Lecture 7 - List ComprehensionLecture 26 - Lecture 1 - Exception HandlingLecture 27 - Lecture 2 - Standard input and outputLecture 28 - Lecture 3 - Handling filesLecture 29 - Lecture 4 - String functions



www.digimat.in

Lecture 30 - Lecture 5 - Formatting printed outputLecture 31 - Lecture 6 - pass, del() and NoneLecture 32 - Lecture 1 - Backtracking, N queensLecture 33 - Lecture 2 - Global scope, nested functionsLecture 34 - Lecture 3 - Generating permutationsLecture 35 - Lecture 4 - Sets, stacks, queuesLecture 36 - Lecture 5 - Priority queues and heapsLecture 37 - Lecture 1 - Abstract datatypes, classes and objectsLecture 38 - Lecture 2 - Classes and objects in PythonLecture 39 - Lecture 3 - User defined listsLecture 40 - Lecture 4 - Search treesLecture 41 - Lecture 1 - Memoization and dynamic programmingLecture 42 - Lecture 2 - Grid pathsLecture 43 - Lecture 3 - Longest common subsequenceLecture 44 - Lecture 4 - Matrix multiplicationLecture 45 - Lecture 5 - Wrap-up, Python vs other languages



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - NOC:Privacy and Security in Online Social Networks

Subject Co-ordinator - Prof. Ponnurangam Kumaraguru

Co-ordinating Institute - IIITD


Lecture 1 - Intro to CourseLecture 2 - Intro to CourseLecture 3 - IncidentsLecture 4 - Tutorial 1 - Part 1 UbuntuLecture 5 - Tutorial 1 - Part 2 PythonLecture 6 - OSM APIs and tools for data collectionLecture 7 - Tutorial 2 - Part 1 Facebook APILecture 8 - Tutorial 2 - Part 2 Facebook APILecture 9 - Trust and Credibility on OSMLecture 10 - Misinformation on Social MediaLecture 11 - Privacy and Social MediaLecture 12 - Tutorial 3 - Part 1 Twitter APILecture 13 - Tutorial 3 - Part 2 MySQLLecture 14 - Tutorial 3 - Part 3 MongoDBLecture 15 - Privacy and Pictures on Online Social MediaLecture 16 - Policing and Online Social MediaLecture 17 - Policing and Online Social MediaLecture 18 - Policing and Online Social MediaLecture 19 - eCrime on Online Social MediaLecture 20 - eCrime on Online Social MediaLecture 21 - Tutorial 4 - Social Network AnalysisLecture 22 - Link Farming in Online Social MediaLecture 23 - NudgesLecture 24 - Semantic attacksLecture 25 - Tutorial 5 - Analyzing text using Python NLTKLecture 26 - Profile Linking on Online Social MediaLecture 27 - Anonymous NetworksLecture 28 - Tutorial 6 - Gephi Network VisualizationLecture 29 - Privacy in Location Based Social Networks - Part 1



www.digimat.in

Lecture 30 - Privacy in Location Based Social Networks - Part 2Lecture 31 - Tutorial 7 - Visualization - HighchartsLecture 32 - Beware of What You Share Inferring Home Location in Social NetworksLecture 33 - On the dynamics of username change behavior on TwitterLecture 34 - Boston Marathon Analyzing Fake Content on Twitter



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - NOC:Mobile Computing

Subject Co-ordinator - Prof. Pushpendra Singh

Co-ordinating Institute - IIITD


Lecture 1 - Java BasicsLecture 2 - JavaLecture 3 - JavaLecture 4 - JavaLecture 5 - JavaLecture 6 - Introduction to Android StudioLecture 7 - Your First AppLecture 8 - Deploying your App to a PhoneLecture 9 - Extending app - Buttons, ToastLecture 10 - Android Development EnvironmentLecture 11 - User InterfaceLecture 12 - Application FundamentalsLecture 13 - Extending the applicationLecture 14 - Activity Lifecycle - ILecture 15 - Activity Lifecycle - IILecture 16 - Activity LifeCycle - IIILecture 17 - Adding Icon, Layouts, Handling Rotation - ILecture 18 - Adding Icon, Layouts, Handling Rotation - IILecture 19 - DebuggingLecture 20 - Intents - ILecture 21 - Intents - IILecture 22 - Observer PatternLecture 23 - Fragments - ILecture 24 - Fragments - IILecture 25 - Fragment Basic Programming ExampleLecture 26 - Fragments - Advanced ExampleLecture 27 - Implicit IntentsLecture 28 - Saving Data - ILecture 29 - Saving Data - II



www.digimat.in

Lecture 30 - Security and System PermissionsLecture 31 - ServicesLecture 32 - Processes and threadsLecture 33 - Working with Fragments - ILecture 34 - Working with Fragments - IILecture 35 - Working with Fragments - IIILecture 36 - RecyclerView, AdapterLecture 37 - RecyclerView, Adapter, ViewHolderLecture 38 - ViewPagerLecture 39 - Dialogues



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - NOC:Introduction to Modern Application Development

Subject Co-ordinator - Tanmai Gopal, Prof. Gaurav Raina



Lecture 1 - Introduction to the courseLecture 2 - Introduction to a web-appLecture 3 - Building a web-appLecture 4 - Introducing IMADLecture 5 - NetworksLecture 6 - Practical - Running your own web-serverLecture 7 - ProtocolsLecture 8 - Module P2 - PracticalLecture 9 - Module P3 - PracticalLecture 10 - Module P4 - PracticalLecture 11 - Module P5 - Introduction to client-side JavascriptLecture 12 - Module P6 - PracticalLecture 13 - Module 6 - Introduction to databasesLecture 14 - Module 7 - Data modelling and constraintsLecture 15 - Module P7 - Interacting with a DBMSLecture 16 - Module P8 - PracticalLecture 17 - Module P9 - Introduction to SQL



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - NOC:Introduction to Cryptology

Subject Co-ordinator - Dr. Sugata Gangopadhyay

Co-ordinating Institute - IIT - Roorkee


Lecture 1 - Introduction Caeser cipherLecture 2 - Modular arithmetic, shift cipherLecture 3 - Affine Cipher, Vigenere CipherLecture 4 - Prefect secrecy, Application of Shift CipherLecture 5 - Problem Discussion on Affine cipher and Perfect SecrecyLecture 6 - Product Cipher, Block Cipher, Modes of Operation for Block CipherLecture 7 - Substitution Permutation network, Fiestel CipherLecture 8 - S-Box TheoryLecture 9 - Cryptanalysis and its Variants, Linear AttackLecture 10 - Problem DiscussionLecture 11 - Public Key Cryptology Introduction RSA CryptosystemLecture 12 - Complexity analysis of Euclidian Algorithm and RSA Cryptosystem square and multiply algorithmLecture 13 - Primality testingLecture 14 - Efficien Computation of Jacobi Symbol Primality TestingLecture 15 - Problem Discussion on Jacobi Symbol Calculation and RSA CryptosystemLecture 16 - Cryptographic hash functionLecture 17 - Random Oracle model, Security of hash functionsLecture 18 - Randomized Algorithm and its application on Preimage resistance and collision resistanceLecture 19 - Iterated Hash FunctionsLecture 20 - Problem Discussionn



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Combinatorics

Subject Co-ordinator - Dr. L. Sunil Chandran

Co-ordinating Institute - IISc - Bangalore


Lecture 1 - Pigeon hole principle - (Part 1)Lecture 2 - Pigeon hole principle - (Part 2)Lecture 3 - Pigeon hole principle - (Part 3)Lecture 4 - Pigeon hole principle - (Part 4)Lecture 5 - Elementary concepts and basic counting principlesLecture 6 - Elementary concepts; Binomial theorem; Bijective proofs - Part (1)Lecture 7 - Bijective proofs â�� Part (2)Lecture 8 - Bijective proofs - Part (3); Properties of binomial coefficients; Combinatorial identities - Part (1)Lecture 9 - Combinatorial identities - Part (2); Permutations of multisets â�� Part (1)Lecture 10 - Permutations of multisets â�� Part (2)Lecture 11 - Multinomial Theorem, Combinations of Multisets â�� Part (1)Lecture 12 - Combinations of Multisets - Part (2)Lecture 13 - Combinations of Multisets â�� Part (3), Bounds for binomial coefficientsLecture 14 - Sterlingâ��s Formula, Generalization of Binomial coefficients - Part (1)Lecture 15 - Generalization of Binomial coefficients - Part (2)Lecture 16 - Generalization of Binomial coefficients - Part (3); Double counting - Part (1)Lecture 17 - Double counting - Part (2)Lecture 18 - Hallâ��s Theorem for regular bipartite graphs; Inclusion exclusion principle - Part (1)Lecture 19 - Inclusion exclusion principle - Part (2)Lecture 20 - Inclusion exclusion principle - Part (3)Lecture 21 - Inclusion exclusion principle - Part (4)Lecture 22 - Inclusion exclusion principle - Part (5)Lecture 23 - Recurrence Relations - Part (1)Lecture 24 - Recurrence Relations - Part (2)Lecture 25 - Recurrence Relations - Part (3)Lecture 26 - Recurrence Relations - Part (4)Lecture 27 - Recurrence Relations - Part (5)Lecture 28 - Generating functions - Part (1)Lecture 29 - Generating functions - Part (2)



www.digimat.in

Lecture 30 - Solving recurrence relations using generating functions - Part (1)Lecture 31 - Solving recurrence relations using generating functions - Part (2)Lecture 32 - Exponential generating functions - Part (1)Lecture 33 - Exponential generating functions - Part (2), Partition Number - Part (1)Lecture 34 - Partition Number - Part (2)Lecture 35 - Partition Number - Part (3)Lecture 36 - Partition Number - Part (4); Catalan Numbers - Part (1)Lecture 37 - Catalans Numbers - Part (2)Lecture 38 - Catalan Numbers - Part (3), Sterling numbers of the 2nd kindLecture 39 - Difference SequencesLecture 40 - Sterling NumbersLecture 41 - Summary



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Compiler Design (Prof. Y.N. Srikanth)

Subject Co-ordinator - Prof. Y.N. Srikanth



Lecture 1 - An Overview of a Compiler - Part 1Lecture 2 - An Overview of a Compiler - Part 2 and Run-Time Environments - Part 1Lecture 3 - An Overview of a Compiler - Part 2 and Run-Time Environments - Part 1Lecture 4 - Run-Time Environments - Part 2Lecture 5 - Run-Time Environments - Part 3 and Local Optimizations - Part 1Lecture 6 - Run-Time Environments - Part 3 and Local Optimizations - Part 1Lecture 7 - Local Optimizations - Part 2 and Code Generation - Part 1Lecture 8 - Local Optimizations - Part 2 and Code Generation - Part 1Lecture 9 - Code Generation - Part 1Lecture 10 - Code Generation - Part 2Lecture 11 - Code Generation - Part 3 and Global Register Allocation - Part 1Lecture 12 - Code Generation - Part 3 and Global Register Allocation - Part 1Lecture 13 - Global Register Allocation - Part 2Lecture 14 - Global Register Allocation - Part 3 and Implementing Object-Oriented Languages - Part 1Lecture 15 - Global Register Allocation - Part 3 and Implementing Object-Oriented Languages - Part 1Lecture 16 - Implementing Object-Oriented Languages - Part 2 and Introduction to Machine-Independent Optimizations - Part 1Lecture 17 - Implementing Object-Oriented Languages - Part 2 and Introduction to Machine-Independent Optimizations - Part 1Lecture 18 - Introduction to Machine-Independent Optimizations - Part 2 and Data-Flow Analysis - Part 1Lecture 19 - Introduction to Machine-Independent Optimizations - Part 2 and Data-Flow Analysis - Part 1Lecture 20 - Data-Flow Analysis - Part 2Lecture 21 - Data-Flow Analysis - Part 3 and Control-Flow Analysis - Part 1Lecture 22 - Data-Flow Analysis - Part 3 and Control-Flow Analysis - Part 1Lecture 23 - Control-Flow Analysis - Part 2Lecture 24 - Machine-Independent Optimizations - Part 1Lecture 25 - Machine-Independent Optimizations - Part 2Lecture 26 - Machine-Independent Optimizations - Part 3 and Data-Flow AnalysisLecture 27 - Machine-Independent Optimizations - Part 3 and Data-Flow AnalysisLecture 28 - Data-Flow AnalysisLecture 29 - Data-Flow Analysis



www.digimat.in

Lecture 30 - Partial Redundancy Elimination - Part 2Lecture 31 - The Static Single Assignment FormLecture 32 - The Static Single Assignment FormLecture 33 - The Static Single Assignment FormLecture 34 - Automatic Parallelization - Part 1Lecture 35 - Automatic Parallelization - Part 2Lecture 36 - Automatic Parallelization - Part 3Lecture 37 - Automatic Parallelization - Part 4Lecture 38 - Instruction Scheduling - Part 1Lecture 39 - Instruction Scheduling - Part 2Lecture 40 - Instruction Scheduling - Part 3Lecture 41 - Software PipeliningLecture 42 - Energy-Aware Software Systems - Part 1Lecture 43 - Energy-Aware Software Systems - Part 2Lecture 44 - Energy-Aware Software Systems - Part 3Lecture 45 - Energy-Aware Software Systems - Part 4Lecture 46 - Just-In-Time Compilation and Optimizations for .NET CLRLecture 47 - Garbage CollectionLecture 48 - Interprocedural Data-Flow AnalysisLecture 49 - Worst Case Execution Time - Part 1Lecture 50 - Worst Case Execution Time - Part 2



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Graph Theory

Subject Co-ordinator - Dr. L. Sunil Chandran



Lecture 1 - IntroductionLecture 2 - MatchingsLecture 3 - More on Hallâ��s theorem and some applicationsLecture 4 - Tutteâ��s theorem on existence of a perfect matchingLecture 5 - More on Tutteâ��s theoremLecture 6 - More on MatchingsLecture 7 - Dominating set, path coverLecture 8 - Gallai â�� Millgram theorem, Dilworthâ��s theoremLecture 9 - ConnectivityLecture 10 - Mengerâ��s theoremLecture 11 - More on connectivityLecture 12 - Minors, topological minors and more on k- linkednessLecture 13 - Vertex coloringLecture 14 - More on vertex coloringLecture 15 - Edge coloringLecture 16 - Proof of Vizingâ��s theorem, Introduction to planarityLecture 17 - 5- coloring planar graphs, Kuratowskyâ��s theoremLecture 18 - Proof of Kuratowskyâ��s theorem, List coloringLecture 19 - List chromatic indexLecture 20 - Adjacency polynomial of a graph and combinatorial NullstellensatzLecture 21 - Chromatic polynomial, k - critical graphsLecture 22 - Gallai-Roy theorem, Acyclic coloring, Hadwigerâ��s conjectureLecture 23 - Perfect graphsLecture 24 - Interval graphs, chordal graphsLecture 25 - Proof of weak perfect graph theorem (WPGT)Lecture 26 - Second proof of WPGT, Some non-perfect graph classesLecture 27 - More special classes of graphsLecture 28 - Boxicity,Sphericity, Hamiltonian circuitsLecture 29 - More on Hamiltonicity



www.digimat.in

Lecture 30 - Chvatalâ��s theorem, toughness, Hamiltonicity and 4-color conjectureLecture 31 - Network flowsLecture 32 - More on network flowsLecture 33 - Circulations and tensionsLecture 34 - More on circulations and tensions, flow number and Tutteâ��s flow conjecturesLecture 35 - Random graphs and probabilistic methodLecture 36 - Probabilistic methodLecture 37 - Probabilistic methodLecture 38 - Probabilistic methodLecture 39 - Graph minors and Hadwigerâ��s conjectureLecture 40 - More on graph minors, tree decompositions



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - High Performance Computing

Subject Co-ordinator - Prof. Mathew Jacob



Lecture 1 - Programs and DataLecture 2 - Data RepresentationLecture 3 - Registers and MemoryLecture 4 - Instructions, Addressing ModesLecture 5 - A RISC Instruction SetLecture 6 - A RISC Instruction Set (Continued...)Lecture 7 - Function Call and ReturnLecture 8 - Function Call and Return (Continued...)Lecture 9 - Instruction ExecutionLecture 10 - Instruction Execution (Continued...)Lecture 11 - Software organizationLecture 12 - System CallsLecture 13 - Virtual memoryLecture 14 - Virtual memory (Continued...)Lecture 15 - Virtual Memory (Continued...)Lecture 16 - ProcessLecture 17 - Process schedulingLecture 18 - Process lifetimeLecture 19 - Interprocess communicationLecture 20 - Concurrent programmingLecture 21 - PipeliningLecture 22 - Pipeline hazardsLecture 23 - Pipeline hazards (Continued...)Lecture 24 - Pipeline hazards (Continued...)Lecture 25 - Cache memoryLecture 26 - Memory hierarchyLecture 27 - Cache operationLecture 28 - Cache operation (Continued)Lecture 29 - Cache aware programming



www.digimat.in

Lecture 30 - Cache aware programming (Continued...)Lecture 31 - More on cacheLecture 32 - Measuring timeLecture 33 - Program ProfilingLecture 34 - Secondary storageLecture 35 - Files and disksLecture 36 - DirectoriesLecture 37 - Protection and PerformanceLecture 38 - Parallel architectureLecture 39 - Cache coherenceLecture 40 - MPI programmingLecture 41 - MPI programming (Continued...)



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Numerical Optimization

Subject Co-ordinator - Dr. Shirish K. Shevade



Lecture 1 - IntroductionLecture 2 - Mathematical BackgroundLecture 3 - Mathematical Background (Continued...)Lecture 4 - One Dimensional Optimization - Optimality ConditionsLecture 5 - One Dimensional Optimization (Continued...)Lecture 6 - Convex SetsLecture 7 - Convex Sets (Continued...)Lecture 8 - Convex FunctionsLecture 9 - Convex Functions (Continued...)Lecture 10 - Multi Dimensional Optimization - Optimality Conditions, Conceptual AlgorithmLecture 11 - Line Search TechniquesLecture 12 - Global Convergence TheoremLecture 13 - Steepest Descent MethodLecture 14 - Classical Newton MethodLecture 15 - Trust Region and Quasi-Newton MethodsLecture 16 - Quasi-Newton Methods - Rank One Correction, DFP MethodLecture 17 - i) Quasi-Newton Methods - Broyden Family ii) Coordinate Descent MethodLecture 18 - Conjugate DirectionsLecture 19 - Conjugate Gradient MethodLecture 20 - Constrained Optimization - Local and Global Solutions, Conceptual AlgorithmLecture 21 - Feasible and Descent DirectionsLecture 22 - First Order KKT ConditionsLecture 23 - Constraint QualificationsLecture 24 - Convex Programming ProblemLecture 25 - Second Order KKT ConditionsLecture 26 - Second Order KKT Conditions (Continued...)Lecture 27 - Weak and Strong DualityLecture 28 - Geometric InterpretationLecture 29 - Lagrangian Saddle Point and Wolfe Dual



www.digimat.in

Lecture 30 - Linear Programming ProblemLecture 31 - Geometric SolutionLecture 32 - Basic Feasible SolutionLecture 33 - Optimality Conditions and Simplex TableauLecture 34 - Simplex Algorithm and Two-Phase MethodLecture 35 - Duality in Linear ProgrammingLecture 36 - Interior Point Methods - Affine Scaling MethodLecture 37 - Karmarkar's MethodLecture 38 - Lagrange Methods, Active Set MethodLecture 39 - Active Set Method (Continued...)Lecture 40 - Barrier and Penalty Methods, Augmented Lagrangian Method and Cutting Plane MethodLecture 41 - Summary



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Storage Systems

Subject Co-ordinator - Dr. K. Gopinath



Lecture 1 - OverviewLecture 2 - Storage, Processing, NetworkingLecture 3 - Naming and StoringLecture 4 - Storage FilesystemsLecture 5 - Access Architecture, Hard DisksLecture 6 - SCSILecture 7 - Fibre Channel Protocol (FCP)Lecture 8 - FCP, 10Gb Ethernet, iSCSI, TCPLecture 9 - NFS, NFSv2Lecture 10 - NFSv2, NFSv3, NFSv4, CIFSLecture 11 - USB StorageLecture 12 - TieringLecture 13 - Mobile/Personal/Organizational - type StorageLecture 14 - Parallel/Cloud/Web-scale StorageLecture 15 - Long-term StorageLecture 16 - Storage interfacesLecture 17 - User-Memory-CPU interactionsLecture 18 - Spinlock, ConcurrencyLecture 19 - Block Layer designLecture 20 - FAT, TFAT, F2FS, LFS, FTLLecture 21 - Data StructuresLecture 22 - AbstractionsLecture 23 - Link & Write OperationsLecture 24 - ZFSLecture 25 - RAID in FilesystemsLecture 26 - RAID-Z, NetApp RAID4, Flash FilesystemsLecture 27 - ReliabilityLecture 28 - PerformanceLecture 29 - Security



www.digimat.in

Lecture 30 - CAP TheoremLecture 31 - POSIX/NFS/S3/Zookeeper, ACID Vs. BASELecture 32 - Consistency & Commit problemsLecture 33 - PaxosLecture 34 - Group Communication problemLecture 35 - Message OrderingLecture 36 - Ordering ModelsLecture 37 - Orderings in FilesystemsLecture 38 - Semantics of highly scalable filesystemsLecture 39 - GFSLecture 40 - GFS ModelLecture 41 - GFS functions and operationsLecture 42 - GFS problems, BigTableLecture 43 - Lessons to learn



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - System Analysis and Design

Subject Co-ordinator - Prof. V. Rajaraman



Lecture - 1Lecture - 2Lecture - 3Lecture - 4Lecture - 5Lecture - 6Lecture - 7Lecture - 8Lecture - 9Lecture - 10Lecture - 11Lecture - 12Lecture - 13Lecture - 14Lecture - 15Lecture - 16Lecture - 17Lecture - 18Lecture - 19Lecture - 20Lecture - 21Lecture - 22Lecture - 23Lecture - 24Lecture - 25Lecture - 26Lecture - 27Lecture - 28Lecture - 29



www.digimat.in

Lecture - 30Lecture - 31Lecture - 32Lecture - 33Lecture - 34Lecture - 35Lecture - 36Lecture - 37Lecture - 38Lecture - 39Lecture - 40



www.digimat.in

NPTEL Video Course - Computer Science and Engineering - Principles of Compiler Design

Subject Co-ordinator - Prof. Y.N. Srikanth



Lecture 1 - An Overview of a CompilerLecture 2 - Lexical Analysis - Part 1Lecture 3 - Lexical Analysis - Part 2Lecture 4 - Lexical Analysis - Part 3Lecture 5 - Syntax AnalysisLecture 6 - Syntax AnalysisLecture 7 - Syntax AnalysisLecture 8 - Syntax AnalysisLecture 9 - Syntax AnalysisLecture 10 - Syntax AnalysisLecture 11 - Syntax AnalysisLecture 12 - Semantic Analysis with Attribute Grammars Part - 1Lecture 13 - Semantic Analysis with Attribute Grammars Part - 2Lecture 14 - Semantic Analysis with Attribute Grammars Part - 3Lecture 15 - Semantic Analysis with Attribute Grammars Part - 4Lecture 16 - Semantic Analysis with Attribute Grammars Part - 5Lecture 17 - Intermediate code generation Part - 1Lecture 18 - Intermediate code generation Part - 2Lecture 19 - Intermediate code generation Part - 3Lecture 20 - Intermediate code generation Part - 4 (first half of lecture)Lecture 21 - Run-time environments - 1 (second half of lecture)Lecture 22 - Run-time environments - 2Lecture 23 - Run-time environments - 3Lecture 24 - Run-time environments - 4 (first half of lecture)Lecture 25 - Control-Flow Graph and Local Optimizations - Part 1 (second half of lecture)Lecture 26 - Control-Flow Graph and Local Optimizations - Part 2 (first half of lecture)Lecture 27 - Machine code generation - 1 (second half of lecture)Lecture 28 - Machine code generation - 2Lecture 29 - Machine code generation - 3



www.digimat.in

Lecture 30 - Machine code generation - 4 (first half of lecture), Implementing object-oriented languages 1 (second half of lecture)Lecture 31 - Implementing object-oriented languages 2 (first half of lecture)Lecture 32 - Global register allocation - 1 (second half of lecture)Lecture 33 - Global register allocation - 2Lecture 34 - Global register allocation - 3Lecture 35 - Introduction to Machine-Independent Optimizations - 1Lecture 36 - Introduction to Machine-Independent Optimizations - 2Lecture 37 - Introduction to Machine-Independent Optimizations - 3Lecture 38 - Introduction to Machine-Independent Optimizations - 4Lecture 39 - Introduction to Machine-Independent Optimizations - 5Lecture 40 - Introduction to Machine-Independent Optimizations - 6Lecture 41 - Introduction to Machine-Independent Optimizations - 7 (first half of lecture)Lecture 42 - Instruction Scheduling and Software Pipelining - 1 (second half of lecture)Lecture 43 - Instruction Scheduling and Software Pipelining - 2Lecture 44 - Instruction Scheduling and Software Pipelining - 3 (first part of lecture)Lecture 45 - Automatic parallelization - 1 (second half of lecture)Lecture 46 - Automatic parallelization - 2



www.digimat.in

NPTEL Video Lecture Topic List - Created by LinuXpert ... · Lecture 4 - Asymptotic Notations...

Documents

Transcript of NPTEL Video Lecture Topic List - Created by LinuXpert ... · Lecture 4 - Asymptotic Notations...