DBMS PPT LIST Topics-CSE-E
DBMS PPT LIST Topics-CSE-E
Course
S.No Roll Number Topic Name Outcome
History of DBMS and disadvanges of FMS, advantages of DBMS
23B81A05R7
1
2 23B81A05R8 Concepts and overview of DBMS, Data models - ER model
3 23B81A05R9 Relational model, Levels of Abstraction in DBMS
4 23B81A05S0 Data base Languages
5 23B81A05S1 Data Base Users and Administrators CO-1
6 23B81A05S2 ER-Model: Data base design and ER model
7 23B81A05S3 ER modeling Constructs, Additional features of ER Model
8 23B81A05S4 Class Hierarchies,
9 23B81A05S5 Aggregation and Conceptual Design with ER model
10 23B81A05S6 Case study: ER design for Large Enterprises
Relational Algebra and Calculus: Introduction to relational model,
23B81A05S7
11 relational operators and examples
12 23B81A05S8 Logical Database Design- ER to Relational
13 23B81A05S9 Relational Algebra - Selection and Projection
14 23B81A05T0 Set operations, Renaming
15 23B81A05T1 joins
16 23B81A05T2 Examples of Relational Algebra Relational Calculus
17 23B81A05T3 Tuple relational Calculus
18 23B81A05T4 Domain relational calculus
Introduction to Structured Query Language: Form of Basic SQL CO2
23B81A05T5
19 Query,
20 23B81A05T6 Examples of Basic SQL Queries
21 23B81A05T7 Introduction to Nested Queries
22 23B81A05T8 Correlated Nested Queries
23 23B81A05T9 Set Comparison Operator-Aggregate Operators
24 23B81A05U0 NULL values and Comparison using Null values
25 23B81A05U1 Logical connectivity‘s – AND, OR and NOT
26 23B81A05U2 OUTER Joins
27 23B81A05U3 Disallowing NULL Values
28 23B81A05U4 PL/SQL: Data Types
29 23B81A05U5 Declaration of Variables
30 23B81A05U6 Strings
31 23B81A05U7 Control Conditional Statements
32 23B81A05U8 Functions
33 23B81A05U9 Procedures
34 23B81A05V0 Cursors
35 23B81A05V1 Triggers
Introduction to schema refinement, Problems caused by
23B81A05V2 CO3
36 decomposition
37 23B81A05V3 Functional dependencies (FDs)
38 23B81A05V4 Reasoning about FDs
39 23B81A05V5 Normal Forms(NF) – 1NF, 2NF
40 23B81A05V6 3NF
41 23B81A05V7 BCNF
42 23B81A05V8 Properties of Decomposition
43 23B81A05V9 Schema Refinement in DataBase Design
44 23B81A05W0 Case studies using Normal Forms
45 23B81A05W1 Transaction Management- Transaction concept & state
46 23B81A05W2 Implementation of atomicity and durability
47 23B81A05W3 Concurrent executions of transaction
48 23B81A05W4 Serializability and Recoverability
49 23B81A05W5 Implementation of Isolation
50 23B81A05W6 Testing for serializability CO4
51 23B81A05W7 Lock-Based Protocols
52 23B81A05W8 Graph Based Protocol
53 23B81A05W9 Timestamp-Based Protocols
54 23B81A05X0 Validation-Based, Protocols
55 23B81A05X1 Multiple Granularity
56 23B81A05X2 Data on External storage
57 23B81A05X3 File Organization and Indexing
58 23B81A05X4 Cluster Indexes, Primary and secondary indexes
59 23B81A05X5 Index data structures
23B81A05X6
60 Hash based indexing - Static hashing and Extensible Hashing, CO-5
23B81A05X7
61 Tree based indexing - Indexed Sequential Access Methods (ISAM)
62 23B81A05X8 B+ Trees: A Dynamic Index structure
63 23B81A05X9 Recovery and Atomicity
64 23B81A05Y0 Log based Recovery, Recovery with concurrent transaction