# Programming and Data Structure

- Institution: IIT Kharagpur
- Department: Computer Science and Engineering
- Teacher: Dr. P.P.Chakraborty
- Level: Undergraduate
- Language: English
- Subjects: Computer science, Engineering
- Source: [NPTEL](https://nptel.ac.in/courses/106105085)
- Licence: [CC BY-NC-SA](https://nptel.ac.in/faq) (Non-commercial use only.)
- Syllabus: [at the source](https://nptel.ac.in/courses/106105085)
- Who can watch: Tweens profiles and older (sources give no ratings; placed by Invisible Network from the source's own words)

## Lectures

1. [Introduction](https://invisiblenetwork.ai/learn/nptel/106105085/fe6613ebf7c4) (Video)
2. [C Programming - I](https://invisiblenetwork.ai/learn/nptel/106105085/1cf6bb62e24a) (Video)
3. [C Programming - II](https://invisiblenetwork.ai/learn/nptel/106105085/09396733f486) (Video)
4. [C Programming - III](https://invisiblenetwork.ai/learn/nptel/106105085/1d32d795a82a) (Video)
5. [Data Structuring: Case Study - I](https://invisiblenetwork.ai/learn/nptel/106105085/bc36c21794fb) (Video)
6. [Data Structuring: Case Study - II](https://invisiblenetwork.ai/learn/nptel/106105085/dcdfff98b7ca) (Video)
7. [Data Structuring: Case Study - III](https://invisiblenetwork.ai/learn/nptel/106105085/3006b4e6c7d2) (Video)
8. [Problem Decomposition By Recursion - I](https://invisiblenetwork.ai/learn/nptel/106105085/f1ec53f0d59f) (Video)
9. [Problem Decomposition By Recursion - II](https://invisiblenetwork.ai/learn/nptel/106105085/7251fd6b5b03) (Video)
10. [Problem Decomposition By Recursion - III](https://invisiblenetwork.ai/learn/nptel/106105085/3c1ffc108f7e) (Video)
11. [Merge sort And Quick sort](https://invisiblenetwork.ai/learn/nptel/106105085/8ecff45ef4e5) (Video)
12. [Characters And Strings](https://invisiblenetwork.ai/learn/nptel/106105085/76d709b31ff9) (Video)
13. [Arrays: Addresses And Contents](https://invisiblenetwork.ai/learn/nptel/106105085/9f13cadd7122) (Video)
14. [Structures - I](https://invisiblenetwork.ai/learn/nptel/106105085/1c6f8a0a33a1) (Video)
15. [Structures - II](https://invisiblenetwork.ai/learn/nptel/106105085/c753977b12fe) (Video)
16. [Dynamic Allocation Part - I](https://invisiblenetwork.ai/learn/nptel/106105085/10c5cddfd791) (Video)
17. [Linked Lists - I](https://invisiblenetwork.ai/learn/nptel/106105085/d604ed97fc89) (Video)
18. [Complexity (Efficiency) of Algorithms](https://invisiblenetwork.ai/learn/nptel/106105085/cde5a3fce56c) (Video)
19. [Asymptotic Growth Functions](https://invisiblenetwork.ai/learn/nptel/106105085/a0501a9c2ab6) (Video)
20. [Asymptotic Analysis of Algorithms](https://invisiblenetwork.ai/learn/nptel/106105085/2783632654f8) (Video)
21. [Data Structuring](https://invisiblenetwork.ai/learn/nptel/106105085/74820c2e3037) (Video)
22. [Search Trees](https://invisiblenetwork.ai/learn/nptel/106105085/070905c48cbc) (Video)
23. [Search Trees - II](https://invisiblenetwork.ai/learn/nptel/106105085/f8d37cb27ef6) (Video)
24. [Search Trees - III](https://invisiblenetwork.ai/learn/nptel/106105085/b84bfe5db9b1) (Video)
25. [2-3 Trees](https://invisiblenetwork.ai/learn/nptel/106105085/d94aed1f83f5) (Video)
26. [Algorithm Design - I](https://invisiblenetwork.ai/learn/nptel/106105085/e2fc09291343) (Video)
27. [Algorithm Design - II](https://invisiblenetwork.ai/learn/nptel/106105085/d281f77b9fa5) (Video)
28. [Algorithm Design - III](https://invisiblenetwork.ai/learn/nptel/106105085/b2dd7fba3e81) (Video)
29. [Graphs - I](https://invisiblenetwork.ai/learn/nptel/106105085/32ee7f8f1cb4) (Video)
30. [Graphs - II](https://invisiblenetwork.ai/learn/nptel/106105085/c7a65b21060a) (Video)
31. [Graphs - III](https://invisiblenetwork.ai/learn/nptel/106105085/4e478cc1cc3e) (Video)
32. [Conclusions](https://invisiblenetwork.ai/learn/nptel/106105085/c0c0b5d8679c) (Video)