Media Storage Type : DVD-ROM
NPTEL Course Name : Data Structures and Program Methodology
NPTEL Subject Matter Expert : Dr. Pradip K Das
NPTEL Co-ordinating Institute : IIT Guwahati
NPTEL Lecture Count : 66
Lecture Titles:
Lecture 1 - What is Data Structure
Lecture 2 - Methods of Interpreting bit Setting
Lecture 3 - Type of Data Structure
Lecture 4 - Introductions to Algorithms
Lecture 5 - Time Complexity
Lecture 6 - Recurrence
Lecture 7 - Linear Data Structures
Lecture 8 - Linked Lists
Lecture 9 - Introduction to Sorting
Lecture 10 - Sink Sort
Lecture 11 - Selection Sort
Lecture 12 - Merge Sort
Lecture 13 - Quick Sort
Lecture 14 - Radix Sort
Lecture 15 - Searching
Lecture 16 - Graphs I : Representation and Traversal
Lecture 17 - Graphs II : Basic Algorithms
Lecture 18 - Binary Tree
Lecture 19 - Heap sort
Lecture 20 - AVL-tree
Lecture 21 - B-Tree
Lecture 22 - Hashing Techniques
Lecture 23 - Introduction
Lecture 24 - String Algorithm
Lecture 25 - String copy
Lecture 26 - Pattern Matching
Lecture 27 - Life cycle
Lecture 28 - Problems - Introduction to Data Structures
Lecture 29 - Example 1 - Introduction to Algorithms
Lecture 30 - Example 2 - Introduction to Algorithms
Lecture 31 - Problems - Introduction to Algorithms
Lecture 32 - Example - Introduction to Stack
Lecture 33 - Example - Introduction to Queue
Lecture 34 - Problems - Linear Data Structures
Lecture 35 - Example - Inserting and Removing Nodes from a List
Lecture 36 - Example - Linked Implemented of Stacks
Lecture 37 - Example - Getnode and Freenode Operation
Lecture 38 - Example - Linked Implemented of queues
Lecture 39 - Example - List Implementation of Priority queue
Lecture 40 - Example - Header Nodes
Lecture 41 - Example - Circular Lists
Lecture 42 - Example - Doubly Linked List
Lecture 43 - Problems - Linked list
Lecture 44 - Example - Linear Search
Lecture 45 - Example - Binary Search
Lecture 46 - Example - k nigsberg bridge problem
Lecture 47 - Problems - GRAPHS Representation
Lecture 48 - Example - Minimum Spanning tree
Lecture 49 - Example - Single Source Shortest Path
Lecture 50 - Problems
Lecture 51 - Example - Array Representation of Binary Tree
Lecture 52 - Example - Linked Representation of Binary Tree
Lecture 53 - Example - Examples-Heap sort
Lecture 54 - Problems - Heap sort
Lecture 55 - Problems - Search Trees
Lecture 56 - Problems - Tables
Lecture 57 - Problems - Sets
Lecture 58 - Problems - STRING ALGORITHM
Lecture 59 - Example - Code Designing
Lecture 60 - Example - Coding
Lecture 61 - Example - Programming Style
Lecture 62 - Examples - Program devlopment
Lecture 63 - Problems - Program devlopment
Lecture 64 - Example - Testing Method
Lecture 65 - Example - Verification Procedures
Lecture 66 - Problems - Program Testing and Verification