Sem-3 IT MU [ PCOM – 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!
No items in this section -
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 -
[Maths-3] 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
-
[Maths-3] Inverse Laplace Transform
-
[Maths-3] Complex Variable
-
[Maths-3] Fourier Series
-
[Maths-3] Statistical Technique
-
[Maths-3] 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
-
[DBMS] Module 1 - Introduction Database Concepts
-
[DBMS] Module 2 - Entity–Relationship Data Model
-
[DBMS] Module 3 - Relational Model and relational Algebra
-
[DBMS] Module 4 - Structured Query Language (SQL)
- 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
-
[PCPF] Module 01 - Introduction to Programming Paradigms
-
[PCPF] Module 02 - Imperative Paradigm
- Introduction to C++
- Input & Output in C++
- Class & Objects C++
- Inspector, Mutators, Facilitators
- Contructor & Destructor
- Default Arguments & Inline Function
- Array of Objects
- Dynamic Memory Allocation
- Static Member and function
- Exception handling
- Composition
- Friend Class and function
- Function Overloading
- Operator Overloading
- Copy Constructor
- Inheritance
- Pure Virtual Function
- Types of Inheritance
- Virtual Function
-
[PCPF] Module 03 - Functional Programming
-
[PCPF] Module 04 - Logic Programming
-
[PCPF] Module 05 - Alternative Paradigms : Concurrency
-
[PCPF] Module 06 - Script Programming
-
[PCPF] MU - Dec-2024 Importance Solutions
-
[DSA] Introduction
-
[DSA] Stacks
-
[DSA] Queues
-
[DSA] Linked Lists
- Introduction To Linked List
- Array Vs Linked List
- Linked List Implementation Part – 1
- Linked List Implementation Part – 2
- Linked List Implementation Part – 3
- Linked List Implementation Part – 4
- Linked List Implementation Part – 5
- Linked List Implementation Part – 6
- Stack Implementation Using Linked List – Part 1
- Stack Implementation Using Linked List – Part 2
- Queue Using Linked List Part – 1
- Queue Using Linked List Part – 2
- Circular Queue Using Linked List
- Doubly Linked List – Part 1
- Doubly Linked List – Part 2
- Doubly Linked List – Part 3
- Doubly Linked List – Part 4
- Doubly Linked List – Part 5
-
[DSA] Trees
- Introduction to Tree Data Structure & Binary Tree
- Binary Tree Implementation Part 1 – Insertion & Traversing
- Binary Tree Implementation Part 2 – Traversing & Deletion
- Binary tree Traversal
- Tree traversal methods: Pre, post and in-order traversal
- (Binary Search Tree) – Traverse the Tree in In-Order, Pre-Order and Post-Order
- Height Balaced Binary Search Tree
- AVL Tree
- AVL Tree Solved Example – #1
- AVL Tree Solved Example – #2
- B-Tree Introduction
- B-Tree Solved Example – #1
- B-Tree Solved Example – #2
- Huffman Coding
-
[DSA] Graphs
-
[DSA] Recursion and Storage Management
-
[DSA] Searching & Sorting
- Hashing Collision
- Hashing concept
- Linear Probing – #1
- Linear Probing – #2
- Linear Probing With Collisions – Solved
- Linear + Quadratic Probing – Solved Example
- Searching & Sorting Introduction
- Selection Sorting – #1
- Selection Sorting – #2
- Insertion Sort – #1
- Insertion Sort – #2
- Merge Sort – #1
- Merge Sort – #2
- Merge Sort – #3
- Quick Sort – #1
- Quick Sort – #2
- Radix Sort – #1
- Radix Sort – #2
-
[DSA] Applications of Data Structures
-
[DSA] Viva Questions
-
[DSA] MU - Dec-2024 Importance Solutions
-
[PCOM] Module 01 - Introduction
-
[PCOM] Module 02 - Fourier Transform & Noise
-
[PCOM] Module 03 - Amplitude Modulation & Demodulation
- Amplitude Modulation (AM) or DSB-FC Modulation
- Time domain Description – AM
- Frequency domain Description – AM
- AM Power Calculations – Part 1
- AM Power Calculations – Part 2
- AM Power Calculations – Part 3
- Signal Sideband (SSBSC) Signal
- Phase Shift Method (SSBSC)
- Tuned Radio Frequency (TRF)
- Superheterodyne Receivers
- Pre-emphasis
- De-emphasis
- Ratio Detector
- Numerical – 2
- Numerical – 3
- Numerical – 4
- Numerical – 5
- Numerical – Image Frequency
- Numerical – 1
-
[PCOM] Module 04 - Pulse Analog & Digital Modulation
-
[PCOM] Module 05 - Multiplexing and Digital Band Pass Modulation Techniques
-
[PCOM] Module 06 - Radiation and Propagation of Waves
-
[PCOM] MU - Dec-2024 Importance Solutions
-
[PCOM] Viva Question
