JNTUH · R25 · CS305PC
A linked list finds a node. A database finds an answer.Table ante structured data, SQL ante aa data ni adigే language.
From why files alone don't scale, through ER design, SQL, and normalization, to transactions and indexing — with every idea tied back to the data structures you already know.
25 lessons5 units6 guided hours3–0–0–3 L–T–P–C
Complete course map
5 units. No mystery gaps.
Every lesson below — explanations, practice, and checks — is open to read right now, no account needed. Every unit is mapped to the R25 CS305PC syllabus.
Unit 1
5 lessonsDatabase System Applications and Database Design
- 01A linked list lives in your program. A database outlives it.Linked list nee program lopale untundi. Database program aipoyaka kuda untundi.13 min →
- 02You never see the actual bytes — three levels stand between you and themNuvvu actual bytes eppudu chudavu — nee ki, vaatiki madhya moodu levels untayi13 min →
- 03One language to define, another to touch — DDL and DMLDefine cheyyataniki oka language, touch cheyyataniki inkokati — DDL and DML12 min →
- 04Before a table, draw a box — the entityTable okati chesyakamundey, oka box gee — entity13 min →
- 05Entities alone tell you nothing — relationships do the real workEntities matrame emi cheppavu — relationships ne real pani chestayi13 min →
Unit 2
4 lessonsRelational Model, Relational Algebra and Calculus
- 01An ER diagram becomes a table, and gets rules to enforceER diagram oka table avutundi, and daaniki enforce cheyye rules vastayi13 min →
- 02A view is a saved question, not a saved answerView ante save chesina question, save chesina answer kaadu12 min →
- 03Relational algebra: operations on tables, the way arithmetic is operations on numbersRelational algebra: tables meeda operations, numbers meeda arithmetic laage14 min →
- 04Algebra says how to get there. Calculus says what you want.Algebra ela vellalo cheptundi. Calculus em kavalo cheptundi.12 min →
Unit 3
6 lessonsSQL and Schema Refinement
- 01SELECT is the algebra you learned, typed as one sentenceSELECT ante nuvvu nerchukunna algebra, okka sentence laa type chesindi14 min →
- 02A query inside a query, and the value that means "unknown"Query lopala oka query, and "teliyadu" ani meaning unna value14 min →
- 03Rules the database enforces for you, and code that runs itselfDatabase nee kosam enforce chese rules, tanantha tanuga run ayye code13 min →
- 04One bad table design, and the two ways to prove it is badOka bad table design, and adi bad ani prove cheyye rendu ways14 min →
- 051NF, 2NF, 3NF, BCNF: each one closes a specific loophole1NF, 2NF, 3NF, BCNF: prathi okati oka specific loophole ni musutundi15 min →
- 06Beyond BCNF: when two independent facts still cause redundancyBCNF dhati munduku: rendu independent facts inka redundancy cause chesinapudu13 min →
Unit 4
5 lessonsTransaction Management and Concurrency Control
- 01A transaction either fully happens, or it never happened at allOka transaction full ga jarugutundi, leda adi asalu jaraganatte14 min →
- 02Many transactions run at once. Only some interleavings are safe.Chaala transactions okesari run avutayi. Konni interleavings matrame safe15 min →
- 03Two philosophies for the same job: ask first, or sort it out by ageSame pani kosam rendu philosophies: mundu adugu, leda age batti sort avvu15 min →
- 04Optimism at the end, and locking the right size of thingChivarilo optimism, and correct size lo lock cheyyadam14 min →
- 05The log remembers what happened, so the database can un-happen itEm jarigindo log gurthu unchhutundi, kabatti database daanini un-happen cheyyagaladu15 min →
Unit 5
5 lessonsStorage Structures and Indexing
- 01A table on disk is a file. How you arrange it decides how fast you find a row.Disk meeda table ante oka file. Danini ela arrange chesthavo, row fast ga dorakadam batti untundi13 min →
- 02An index is a table's own table of contentsIndex ante, table yokka own table of contents13 min →
- 03Hashing gets you there in one jump, if you only ever ask "equals"Hashing okka jump lone theeskellindi, nuvvu eppudaina "equals" ani matrame adigithe13 min →
- 04A tree index answers "equals," "greater than," and "between" with one structureTree index okka structure tho "equals," "greater than," and "between" anni answer chestundi15 min →
- 05There is no single best storage design — only the one that fits your queriesOkka best storage design ane danedi ledu — nee queries ki fit ayye danedi matrame14 min →
These explanations and exercises are independent Chaduvu Bidda material, not JNTUH-authored content. Every lesson remains marked for factual, code, and language review before pilot publication.