Sem 3 IT MU [ AT – DSA – PCPF – Maths 3 – DBMS ]
₹39,999.00
₹29,999.00
-
ABOUT THE COURSE
This Course is Only Available On Our App
Dive-in and start learning! Get offline access to all the course contents!
-
Description
What you’ll Learn:
Data modelling using the entity-relationship and developing database designs.
Use of Structured Query Language (SQL) and learn SQL syntax.
Apply normalization techniques to normalize the database
Understand the needs of database processing and learn techniques for controlling the consequences of concurrent data access.
Description:
This course provides starting from the roots, the fundamentals of a database systems thereby learning to design Design and draw ER and EER diagram for the real life scenario. Converting conceptual model to relational model and formulate relational algebra queries. Talking to our very own database using SQL!!
Learning query optimization techniques like normalization and lastly dealing with transaction, concurrency & recovery.
Join in to learn Database Management System, equally important from the academic as well as real-world knowledge.
Modules Covered:
Introduction to Database Concepts
Entity-Relationship data Model
Relational Model and relational Algebra
Structured Query Language (SQL)
Relational Database Design
Transactions Management and Concurrency.No items in this section -
[Applied Mathematics Thinking - 1] Laplace Transform
- Introduction to Laplace transform
- Formula Method in Laplace transform
- Linearity Property in Laplace transform
- Laplace-transform-part-4
- First shift theorem in Laplace transform
- Second shift theorem in Laplace transform
- Multiplication by t^n in Laplace transform
- Division by t in Laplace transform
- Laplace transform of Derivative
- Laplace transform of Integration
- Laplace Transform Notes
-
[Applied Mathematics Thinking - 1] Inverse Laplace Transform
-
[Applied Mathematics Thinking - 1] Complex Variable
-
[Applied Mathematics Thinking - 1] Fourier Series
-
[Applied Mathematics Thinking - 1] Statistical Technique
-
[Applied Mathematics Thinking - 1] Probability
- Introduction to Probability Distribution
- Discrete Random Variable in Probability Distribution
- Distribution function of Discrete Random Variable
- Continuous Random Variable in Probability Distribution
- Continuous Distribution Function in Probability Distribution
- Expectation in Probability Distribution
- Mean and Variance Part 1 in Probability Distribution
- Mean and Variance Part 2 in Probability Distribution
- Moments and Moments Generating Function Part #1 in Probability Distribution
- Moments and Moments Generating Function Part #2 in Probability Distribution
- Probability Notes
-
[Advance Data Structure and Analysis] Introduction to Analysis of Algorithm
-
[Advance Data Structure and Analysis] Advance Data Structures
-
[Advance Data Structure and Analysis] Greedy Method Approach
-
[Advance Data Structure and Analysis] Dynamic Programming Approach
-
[Advance Data Structure and Analysis] Backtracking and Branch and bound
-
[Advance Data Structure and Analysis] String Matching Algorithms
-
[Advance Data Structure and Analysis] Viva Question
-
[DBMS] Module 1 - Database System Concepts and Architecture
-
[DBMS] Module 2 - Entity Relationship Model
-
[DBMS] Module 3 - Relational Model and relational Algebra
-
[DBMS] Module 4 - Structured Query Language (SQL) & Indexing
- Introduction to SQL
- Data definition language
- DML ( data manipulation language )
- DRL ( Data Retrieval Language)
- Aggregate Function in SQL
- Types Of Joins & Inner Join
- Left, Right & Full Join
- SQL Queries | Solved Example – 1
- SQL Queries | Solved Example – 2
- SQL Queries | Solved Example – 3
- SQL Queries | Solved Example – 4
- SQL Queries | Solved Example – 5
- PL SQL | part 1 |
- PL SQL | part 2 |
- Query Processing And Query Optimisation [Part 1]
- Query Processing And Query Optimisation [Part 2]
- Query Processing And Query Optimisation [Part 3]
- Query Processing And Query Optimisation [Part41]
- Integrity Constraints
- Trigger
-
[DBMS] Module 5 - Relational-Database Design
-
[DBMS] Module 6 - Transactions Management and Concurrence
- Concurrency Control
- Concurrency Control – Lock Based Protocol in DBMS Transaction
- Timestamp Based Protocol
- Deadlock Full concept in DBMS transaction management
- Shadow Paging in Database Recovery
- Log Based Database Recovery
- Shadow Copy Technique in Database recovery
- Transaction State and Acid Properties
- Transaction Schedule
- View Serializability
- Conflict Serializability
-
[DBMS] Importance
-
[DBMS] Viva Question
-
[Automata Theory] Introduction and Regular Languages
-
[Automata Theory] Finite Automata
- 1. Introduction to Finite State Machine-002
- 2. Finite State Machine Problem No. 1-001
- 3. Finite State Machine Problem No. 2-003
- 4. Finite State Machine Problem No. 3-004
- 5. Introduction to Deterministic Finite Automata ( DFA )
- 6. Deterministic Finite Automata ( DFA ) Problem No. 1 ( Updated )
- 7. Deterministic Finite Automata ( DFA ) Problem No. 2
- 8. Deterministic Finite Automata ( DFA ) Problem No. 3
- 9. Deterministic Finite Automata ( DFA ) Problem No. 4
- 15. RE to NFA with Epselon Transition using Thompsons COnstruction Method
- 16. RE to NFA with Epselon transition using Thompson’s Construction Method ( Part 2 )
- 17. RLRE to Minimised DFA ( Direct Method )
- 18. RLRE to Minimised DFA ( Imp State Method )
- 19. Convert NFA with E-Transition to NFA without E-Transition
- 20. NFA Without E-Transition to DFA
- 21. Moore & Mealy Machine
- 22. Moore & Mealy Machine ( Problem 1 )
-
[Automata Theory] Context Free Grammar
- Introduction to Grammar
- RE – RL to Context Free Grammar
- How to Convert RE RL to Context Free Grammar
- LMD RMD & Parse Tree
- Check whether the given grammar is an ambiguous grammar or not
- Elimination of useless variable
- Elimination of Null Production
- Elimination of unit Production
- Simplification of CFG
- Introduction to Chomsky Normal Form
- CFG to CNF ( Problem No. 1 )
- CFG to CNF ( Problem No. 2 )
- CFG to CNF ( Problem No. 3 )
- Introduction to Greibach Normal Form ( GNF )
- Convert CFG to GNF ( Problem No. 1 )
- Convert CFG to GNF ( Problem No. 2 )
- Convert CFG to GNF ( Problem No. 3 )
- Convert the following into CNF & GNF
-
[Automata Theory] Context Free Grammar :- Previously Asked Questions
-
[Automata Theory] Push Down Automata
-
[Automata Theory] Push Down Automata :- Previously Asked Questions
-
[Automata Theory] Turing Machine
-
[Automata Theory] Turing Machine:- Previously Asked Questions
-
[Automata Theory] Applications of Automata
-
[Automata Theory] TCS Notes
-
[Automata Theory] AT - PYQ
-
[Automata Theory] IMP
-
Time Table
