SemIVPublic

Intention

The intention of this Vault is to be a repository of the Academic Knowledge learnt in Semester IV of Bachelor of Engineering in Artificial Intelligence and Data Science.

How To Use

Download this Vault as a .zip, then extract it. Then download and install Obsidian to access all features of this Vault.

Once you have Obsidian installed on your Computer, then inside Obsidian click the 'Vault Switcher' icon in the bottom left and then select 'Open Folder as Vault'. Select the previously extracted zip file. Your Vault should now open with all the extensions and content installed.

Below is just the frontpage of it.

Analysis of Algorithm

| Module | | Detailed Contents | Hours | Course Material | | ------ | --- | --------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- | ----- | --------------- | | 1 | | Introduction | 8 | | | | 1.1 | Performance analysis, space, and time complexity Growth of function, Big-Oh, Omega Theta notation Mathematical background for algorithm analysis. Complexity class: Definition of P, NP, NP-Hard, NP-Complete Analysis of selection sort, insertion sort. | | | | | 1.2 | Recurrences: The substitution method, Recursion tree method, Master method | | | | 2 | | Divide and Conquer Approach | 6 | | | | 2.1 | General method, Merge sort, Quick sort, Finding minimum and maximum algorithms and their Analysis, Analysis of Binary search. | | | | 3 | | Greedy Method Approach | 6 | | | | 3.1 | General Method, Single source shortest path: Dijkstra Algorithm Fractional Knapsack problem, Job sequencing with deadlines, Minimum cost spanning trees: Kruskal and Prim’s algorithms | | | | 4 | | Dynamic Programming Approach | 9 | | | | 4.1 | General Method, Multistage graphs, Single source shortest path: Bellman Ford Algorithm All pair shortest path: Floyd Warshall Algorithm, Assembly-line scheduling Problem0/1 knapsack Problem, Travelling Salesperson problem, Longest common subsequence | | | | 5 | | Backtracking and Branch and bound | 6 | | | | 5.1 | General Method, Backtracking: N-queen problem, Sum of subsets, Graph coloring | | | | | 5.2 | Branch and Bound: Travelling Salesperson Problem, 15 Puzzle problem | | | | 6 | | String Matching Algorithms | 4 | | | | 6.1 | The Naive string-matching algorithm, The Rabin Karp algorithm, The Knuth-Morris-Pratt algorithm | | |

Database Management System

| Module | | Content | Hrs | Course Material | | ------ | --- | ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------ | --- | --- | | 1 | | Introduction Database Concepts | 3 | Chapter 1-PPT | | | 1.1 | Introduction, Characteristics of databases, File system v/s Database system, Data abstraction and data Independence, DBMS system architecture, Database Administrator | | | | 2 | | Entity-Relationship Data Model | 6 | ER-1 EER PPT FINAL | | | 2.1 | The Entity-Relationship (ER) Model: Entity types: Weak and strong entity sets, Entity sets, Types of Attributes, Keys, Relationship constraints: Cardinality and Participation, Extended Entity-Relationship (EER) Model: Generalization, Specialization and Aggregation | | | | 3 | | Relational Model and relational Algebra | 8 | Mapping of ER and EER to Relational | | | 3.1 | Introduction to the Relational Model, relational schema and concept of keys. Mapping the ER and EER Model to the Relational Model, Relational Algebra-operators, Relational Algebra Queries. | | | | 4 | | Structured Query Language (SQL) | 6 | DBMS_Module-4 | | | 4.1 | Overview of SQL, Data Definition Commands, Integrity constraints: key constraints, Domain Constraints, Referential integrity , check constraints, Data Manipulation commands, Data Control commands, Set and string operations, aggregate function-group by, having, Views in SQL, joins, Nested and complex queries, Triggers | | | | 5 | | Relational-Database Design | 6 | | | | 5.1 | Pitfalls in Relational-Database designs, Concept of normalization, Function Dependencies, First Normal Form, 2NF, 3NF, BCNF.