Please re-enter your password to continue with this action.
Arrays and lists
Searching in an array
Selection Sort
Insertion sort
Merge sort
Merge sort - analysis
Quicksort
Quicksort - analysis
Lec 35: Hashing
Input size, worst case, average case
Quantifying efficiency: O( ), Omega( ), Theta( )
Interval scheduling
Scheduling with deadlines: minimizing lateness
Huffman codes
Introduction to dynamic programming
Memoization
Grid paths
Common subwords and subsequences
Edit distance
Matrix multiplication
Counting inversions
Closest pair of points
Introduction to graphs
Representing graphs
Breadth first search (BFS)
Depth first search (DFS)
Applications of BFS and DFS
Directed acylic graphs: topological sort
Directed acylic graphs: longest paths
Minimum Cost Spanning Trees
Prims Algorithm
Kruskals algorithm
Single source shortest paths: Dijkstras algorithm
Dijkstras algorithm: analysis
Negative edge weights: Bellman-Ford algorithm
All pairs shortest paths
Lexical analysis
Lexical Analysis (Contd.)
Parser
Parser (Contd.)
Symbol Table (Contd.) and Runtime Environment
Runtime Environment
Runtime Environment (Contd.)
Intermediate Code Generation
Intermediate Code Generation (Contd.)
Principles of Compiler Design Local Optimizations
Principles of Compiler Design Machine Independent Optimization Lecture 1
Lecture 50 Introduction to Network Protocol Layers by NPTEL IIT MADRAS
Lecture 19 Switching Techniques Packet Switching
Lecture - 15 Data Link Protocols
Lecture 15: Error Detection and Correction
Lecture - 25 Medium Access Control - I
Lecture - 28 IEEE 802 LANs
Lec-20 Shortest Path Problem
Lecture - 20 Routing - I
Lecture - 27 RIP - Distance Vector Routing
Lecture - 21 Routing - II
Lecture 28 - IP version 4
Lecture - 6 IP Subnetting and Addressing
Lecture - 33 DHCP and ICMP
Lecture 29: IP Addressing (IPv4) III - Network Address Translation (NAT)
Lecture - 35 Congestion Control
1. Lecture 23 User Datagram Protocol
Lecture - 31 TCP
Lecture 24 : Socket Programming - I
1. Lecture 5 Application Layer-I
COA [Module 02 - Lecture 03]: Instruction Execution
COA [Module 02 - Lecture 04]: Instruction Format
COA [Module 02 - Lecture 05]: Instruction Set
COA [Module 02 - Lecture 06]: Addressing Modes
Lecture -11 Binary Arithmetic, ALU Design
Lecture -12 ALU Design, Overflow
Lecture 17 : DESIGN OF CONTROL UNIT (PART 1)
Lecture 18 :DESIGN OF CONTROL UNIT (PART 2)
Lecture 19 : DESIGN OF CONTROL UNIT (PART 3)
Lecture 20 : DESIGN OF CONTROL UNIT (PART 4)
Lecture 40 : BASIC PIPELINING CONCEPTS
Lecture 41 : PIPELINE SCHEDULING
mod11lec53
mod11lec54
mod11lec55
mod11lec56
mod11lec57
mod11lec58
Lecture 28 : MEMORY HIERARCHY DESIGN (PART 1)
Lecture 29 : MEMORY HIERARCHY DESIGN (PART 2)
Lecture 30 : CACHE MEMORY (PART 1)
Lecture 31 : CACHE MEMORY (PART 2)
Lecture 32 : IMPROVING CACHE PERFORMANCE
Lecture 46 : INTERRUPT HANDLING (PART 1)
Lecture 47 : INTERRUPT HANDLING (PART 2)
mod10lec48
Entity-Relationship Model/1
Entity-Relationship Model/2
Entity-Relationship Model/3
Formal Relational Query Languages
Introduction to SQL/1
Introduction to SQL/2
Introduction to SQL/3
Intermediate SQL/1
Intermediate SQL/2
Relational Database Design/1
Relational Database Design (Contd.)-1
Relational Database Design (Contd.) - 2
Relational Database Design (Contd.) - 3
Relational Database Design (Contd)- 4
Storage and File Structure/1:Storage
Storage and File Structure/2:File Structure
Indexing and Hashing/1 : Indexing/1
Indexing and Hashing/2 : Indexing/2
Indexing and Hashing/3 : Indexing/3
Indexing and Hashing/4 : Hashing
Indexing and Hashing/5:Index Design
Transactions/1
Transactions/2 : Serializability
Transactions/3 : Recoverability
Concurrency Control/1
Concurrency Control/2
Boolean algebra
Boolean algebra (Contd.)
Combinational Logic Basics
Combinational Circuits
Sequential circuits
Sequential circuits (Contd.)
Minimization Using Karnaugh Maps (Part 1)
Minimization Using Karnaugh Maps (Part 2)
NOC:Digital Circuits Lectures 3
NOC:Digital Circuits Lectures 4
NOC:Digital Circuits Lectures 5
NOC:Digital Circuits Lectures 6
NOC:Digital Circuits Lectures 7
Number Systems
Number Systems (Contd.)
Propositional logic and Predicate logic
Propositional logic and Predicate logic (Part 2)
Lec 3: First Order Logic: Introduction
Lec 4: First Order Logic: Introduction (Contd.)
Lec 8: Sets, Relations, Functions
Partially ordered relation
Partially ordered set
Lattices
Algebras
Lec 37: Introduction to groups
Lec 38: Modular arithmetic and groups
Lec 11: Introduction to graph theory
Lec 12: Trees, Cycles, Graph coloring
Counting for selection
Counting for distribution
Counting for distribution (Part 2)
Some counting problems
Counting using recurrence relation
Counting using recurrence relation (Part 2)
Solving recurrence relations (Part 1)
Solving recurrence relations (Part 2)
Lec 29: Generating Functions
Lec 30: Product of generating functions
Lec 31: Composition of generating function
Matrix: Examples, Transpose and Addition
Determinant
Introduction to system of linear equation
Introduction to eigenvalues and eigenvectors
LU decomposition - Simplest form
Limits of functions-Part 1
Limits of functions-Part 2
Continuity-Part 1
Continuity-Part 2
Differentiability-Part 1
Differentiability-Part 2
Maxima and minima-Part 1
Maxima and minima-Part 2
Rolle's theroem and mean value theorem-Part 1
Rolle's theroem and mean value theorem-Part 2
Lecture 21: Integration and its properties
Lecture-13 : Random variables
Probability Distribution
Normal distribution
Lecture 24: Special continuous distributions - I
Poisson process - I
Binomial distribution
Lecture 3: Arithmetic mean
Lecture 4: Geometric mean
Lecture 5: Measure of variability, Standard deviation
Lecture 9: Conditional probability
Multiplication Rule, Total Probability Rule, Bayes Theorem
W3 L3 system Calls for Process Management
W3 L1 Introduction to Processes
W3 L2 Create Execute and Exit from a Process
W7 L4 Threads (Light Weight Processes) Part 1
W7 L5 Threads (Light Weight Processes) Part 2
W6 L1 Inter Process Communication
W6 L2 Synchronization
W6 L3 Software solutions for critical sections
W6 L7 Semaphores
W7 L1 Dining Philosophers Problem
W7 L2 Deadlocks
W7 L3 Dealing with Deadlocks
W5 L1 CPU Scheduling
W5 L2 Priority based scheduling algorithms
W5 L3 Multi-Processor Scheduling
W2 L1 Memory Management Introduction
W2 L2 Virtual Memory
W2 L3 More on Virtual Memory
W2 L4 Segmentation
Lecture 57 : File System and Secondary Storage
Lecture 58: File System and Secondary Storage (Contd.)
Lecture 59: File System and Secondary Storage (Contd.)
Lecture 60: File System and Secondary Storage (Contd.)
Lec 1 Introduction The Process of Programming
Recursion
Introduction to Arrays
Lecture 21 : Stack Data Structures
Lecture 24 : Queue Data Structure
Lecture 16 : Linked List Data Structure (Part-I)
Lecture 27 : Understanding Tree Data Structures
Lecture 29 : Binary Search Tree
Lecture 32 : Heap Tree
Lecture 7: Matchings and Covers
Lecture 13: Connectivity and Paths: Cuts and Connectivity
Lecture 16: Vertex Coloring and Upper Bounds
Lecture 21: Line Graphs and Edge-coloring
Deterministic Finite Automata
Input Alphabet
Extended Transition function
Language of DFA
Building DFA
Building DFA (Contd.)
NFA (Nondeterministic Finite Automata)
Language of a NFA
Equivalence of DFA and NFA
Subset Construction
ε- NFA
Extended transition function of ε-NFA - part 12
Language of ε-NFA
ε-NFA to NFA
Regular Expression
Regular expression (Contd.) part 1
More on Regular Expression
Equivalence of ε-NFA and regular expression
Equivalence of ε-NFA and regular expression (Contd.) part 1
DFA to Regular expression
DFA to Regular expression (Contd.) part 1
Construction of regular expression from a DFA (Example)
Grammars and Languages Generated
Grammars and Languages Generated (Contd.)
Ambiguity in CFG
Simplification of CFG
Pushdown Automata (PDA)
Language Accepted by PDA
Example of language accepted by PDA
Context free grammars (CFG)
Context free language (CFL)
More example on CFL
More of CFG
Derivation Tree/Parse Tree
Leftmost and Rightmost derivations
Closure Properties of RL
Homomorphism
Properties of CFLs
Pumping Lemma
Applications of the pumping lemma
More on pumping lemma
Pumping lemma for CFLs
Turing Machines
Language Accepted by a Turing Machine
Undecidability 1
Undecidability 2
Undecidability 3
