README.md

4th Semester Course Material 📚

Notes, slides, codes and resources for 4th semester courses in BTech Data Science and Engineering at MIT Manipal.

Theory
- DSE_2256_L0_L1.pdf: Asymptotic Analysis
- DSE_2256_L2_L3.pdf: Divide and Conquer
- DSE_2256_L4_L5.pdf: Dynamic Programming
- DSE_2256_L6_L7.pdf: Greedy Algorithms
- DSE_2256_L8_L9.pdf: Basic Graph Algorithms
- DSE_2256_L10_L11.pdf: Minimum Spanning Trees
- DSE_2256_L12_L13.pdf: Single Source Shortest Paths
- DSE_2256_L14_L15.pdf: All Pairs Shortest Paths
- DSE_2256_L16.pdf: String Matching
- DSE_2256_L17.pdf: Computational Geometry
- DSE_2256_L18_19_20.pdf: NP-Completeness
- DSE_2256_L21.pdf: Approximation Algorithms
Lab
- Week1: Basics of C++, arrays, pointers
- Week2: Mathematical fundamentals
- Week3: Basics sorting techniques
- Week4: Graph algorithms like BFS, DFS
- Week5: Advanced sorting algorithms
- Week6: Binary trees and tree traversals
- Week7: AVL trees, heaps
- Week8: Heapsort
- Week9: Hashing, radix sort
- Week10: Dynamic programming algorithms
- Week11: Minimum spanning trees, shortest paths

Unit1_Introduction_DBMS.pdf: Introduction to database systems
Unit2_Relational Model 2022.pdf: Relational data model
Unit3_SQL_Part2.pdf: SQL queries
Unit4_ERmodel_final_pdf.pdf: ER diagrams
Unit5_Procedures_Functions_Triggers.pdf: PL/SQL programming
Unit6_Relational Database Design 2021 Complete.pdf: Database design principles
Queryprocessing.pdf: Query processing and optimization techniques
Fileorganization_final.pdf: File organizations, indexing
slide9_recoverysystem.pdf: Recovery systems and concepts
Exceptions 2020.pdf: Exception handling in PL/SQL
6. PL_SQL Oracle 2022.pdf: PL/SQL concepts
12 Transactions Concurrency-2019.pdf: Transaction processing, concurrency control

Let me know if the relative links look good now or if you need any other changes!

The notes and codes cover all important algorithms, database concepts and SQL which will be useful for learning and revision.