Semester3

DBMS August 9

August 9, 2024
Notes
Semester3, DBMS

#databases #semester3 Reference # Oracle Docs W3Schools Reference Characteristics of Database Approach # Main Characteristics of Database Approach Self Describing nature of a DB System [ Catalog of the Data ] it contains the DB and Metadata The DB Catalog is Used by DBMS Software DB Users Comparision with Traditional File Processing (TFP) # TFP can only access specific DBs Insulation between program and data abstraction Program Data Independence - structure of the data files is stored in dbms catalog separatey from access programs VS TFP Any Change to the Structure should be reflect in the corresponding programs Program operation Independence In DDDBMS and ORDBMS users can define operations on data as part of DB Definitions an operation is specified in two parts implementation of the operation is specified separately and can be changed without affecting the instance Data Abstraction Allows program data independence and Program Operation Independence It provides users with conceptual representation of data Supports Multiple Views of Data Supports Multiuser Transaction Processing Multiuser DBMS Concorrency Control Software Online Transaction Processing Application

August 14

August 14, 2024
Notes
Semester3, DBMS

create table customers ( cid int constraint pk primary key, customer_name varchar(20) check (customer_name is NOT null) ) insert into customers (cid, customer_name) values(1, 'name') Adding a name to the constraint # create table customers ( cid int constraint pk primary key, customer_name varchar(20) constraint ck check (customer_name is NOT null) ) insert into customers (cid, customer_name) values(1, 'name') Dropping the constraint # Alter TABLE customers drop constraint ck ![[Pasted image 20240814143949. ...

DAA August 9

August 9, 2024
Notes
Semester3, DAA

Suggested Books: # Thomas H Orman - DAA Algorithm Design Manual GCD Code: def gcd(m,n): while n != 0 do: r = m mod n m = n n = r return m def gcd(m,n): t = min (m,n) while true: if m%t = 0: if n%t = 0: return t t = t - 1 General Approaches To Algorithm Design Divide and Conquer Greedy Method Dynamic Programming Basic Search and Traversal Graph Theory Linear Programming Approximation Algorithm NP Problem HW 9 Aug: Find the prime factors of a given number