Starting a new Lecture Notes Series on Computer Sc - Programming and Data Structure
%20(5).png)
%20(5).png)
Youtube Lecture Playlist CreditsChannel Name: nptelhrd
So Let Us Start to This Journey of Learning
Computer Sc - Programming and Data Structure By Lecture Notes together!
Lecture 1: Lec-1 Introduction
Lecture 2: Lec-2 C Programming-I
Lecture 3: Lec-3 C Programming-II
Lecture 4: Lec-4 C Programming-III
Lecture 5: Lec-5 Data Structuring: Case Study-I
Lecture 6: Lec-6 Data Structuring: Case Study-II
Lecture 7: Lec-7 Data Structuring: Case Study-III
Lecture 8: Lec-8 Problem Decomposition By Recursion-I
Lecture 9: Lec-9 Problem Decomposition By Recursion-II
Lecture 10: Lec-10 Problem Decomposition By Recursion-III
Lecture 11: Lec-11 Mergesort And Quicksort
Lecture 12: Lec-12 Characters And Strings
Lecture 13: Lec-13 Arrays: Addresses And Contents
Lecture 14: Lec-14 Structures-I
Lecture 15: Lec-15 Structures-II
Lecture 16: Lec-16 Dynamic Allocation Part-I
Lecture 17: Lec-17 Linked Lists-I
Lecture 18: Lec-18 Complexity(Efficiency) of Algorithms
Lecture 19: Lec-19 Asymptotic Growth Functions
Lecture 20: Lec-20 Asymptotic Analysis of Algorithms
Lecture 21: Lec-21 Data Structuring
Lecture 22: Lec-22 Search Trees
Lecture 23: Lec-23 Search Trees-II
Lecture 24: Lec-24 Search Trees-III
Lecture 25: Lec-25 2-3 Trees
Lecture 26: Lec-26 Algorithm Design-I
Lecture 27: Lec-27 Algorithm Design-II
Lecture 28: Lec-28 Algorithm Design-III
Lecture 29: Lec-29 Graphs-I
Lecture 30: Lec-30 Graphs-II
Lecture 31: Lec-31 Graphs-III
Lecture 32: Lec-32 Conclusions