There are no items in your cart
Add More
Add More
Item Details | Price |
---|
Instructor: Go Leanerz FacultyLanguage: Malayalam
The KTU Database Management Systems Crash Course (CST 204) is an intensive, exam-focused program designed to help students achieve top marks in their database management systems examinations.
This course provides a streamlined overview of essential topics, including core concepts of database systems, efficient database design with Entity-Relationship models and normalization, SQL mastery for data manipulation and query optimization, and transaction management for maintaining data integrity. Emphasizing critical topics and problem-solving strategies, this crash course equips students with the knowledge and techniques needed to confidently tackle exam questions and excel in their KTU database management systems course.
Database Management Systems (DBMS) - Characteristics of Database
system, Database Users, structured, semi-structured and unstructured data. Data Models and
Schema - Three Schema architecture. Database Languages, Database architectures and
classification.
ER model - Basic concepts, entity set & attributes, notations, Relationships and constraints,
cardinality, participation, notations, weak entities, relationships of degree 3.
Structure of Relational Databases - Integrity Constraints, Synthesizing ER diagram to relational schema
Introduction to Relational Algebra - select, project, cartesian product operations, join - Equi-join, natural join. query examples, introduction to Structured Query Language (SQL), Data Definition Language (DDL), Table definitions and operations – CREATE, DROP, ALTER, INSERT, DELETE, UPDATE.
DML (Data Manipulation Language) - SQL queries on single and multiple tables, Nested
queries (correlated and non-correlated), Aggregation and grouping, Views, assertions, Triggers, SQL data types.
Physical Data Organization - Review of terms: physical and logical records, blocking factor,
pinned and unpinned organization. Heap files, Indexing, Singe level indices, numerical examples, Multi-level-indices, numerical examples, B-Trees & B+-Trees (structure only, algorithms not required), Extendible Hashing, Indexing on multiple keys – grid file
Different anomalies in designing a database, The idea of normalization, Functional dependency, Armstrong’s Axioms (proofs not required), Closures and their computation, Equivalence of Functional Dependencies (FD), Minimal Cover (proofs not required). First Normal Form (1NF), Second Normal Form (2NF), Third Normal Form (3NF), Boyce Codd Normal Form (BCNF), Lossless join and dependency preserving decomposition, Algorithms for checking Lossless Join (LJ) and Dependency Preserving (DP) properties.
Transaction Processing Concepts - overview of concurrency control, Transaction Model, Significance of concurrency Control & Recovery, Transaction States, System Log, Desirable Properties of transactions.
Serial schedules, Concurrent and Serializable Schedules, Conflict equivalence and conflict
serializability, Recoverable and cascade-less schedules, Locking, Two-phase locking and its
variations. Log-based recovery, Deferred database modification, check-pointing.
Introduction to NoSQL Databases, Main characteristics of Key-value DB (examples from:
Redis), Document DB (examples from: MongoDB)
Main characteristics of Column - Family DB (examples from: Cassandra) and Graph DB
(examples from : ArangoDB)
At Golearnerz, Master Complex Concepts With Simple Lectures And Exam-focused Content. Score Good Marks In Less Time With Our Recorded Sessions. We Offer Affordable Online Learning For KTU Engineering Students.
Locate Us: Propoint Developers, Cyberpark Calicut, Kerala, Pin - 673014