1. Ans his rt vqiower any Fifth Semester B.E. Degree Examination CBCS - Model Question Paper - 1 DATABASE MANAGEMENT SYSTEM Max, Marks: 80 FIVE full questions, selecting ONE full qiestion froih each moidile. MODULE - 1 piscuss the main characteristis ofthe database approach over thie file processing approach. a (8marksy ‘He main characteristics ofthe database approach versus the file-processing approach are as follows: ‘ Self-describing nature of a database system ‘A database system includes a complete definition or description of the database’s structure and constraints. This description is stored in a system catalog, which contains a description of the structure of each file, the type and storage format of each field and the various constraints on the data. The information stored in catalog igcalled as meta-data, which desetibes the structure of the primary database. In traditional file processing, data definition is part of the application programs. Hence, these programs are constrained to work with only one specific database, whose structure is declared in the application programs. Insulation between programs and data, and data abstraction In traditional file processing, the structure of data files is embedded in the application programs, so any changes to the stricture ofa file may require changing all programs that access that file. DBMS access programs do not require such changes in most cases. The structure of data files is stored in the DBMS catalog separately from the access programs. This is ternied.as program-data independence. DBMS provides a conceptual or logical view of the data to application programs, so that the underlying implementation may be changed without the programs being ‘modified. ¢ Support of multiple views of the data Different users have different “views” or perspectives on the database. A view is a subset of the database or it contains virtual data that is derived from the database file. A good Multiuser DBMS has facilities for defining multiple views. This is not only convenient for users, but also addresses security issues of data access. For example, one user of the database is interested only in accessing and printing the transcript of each student. A second user is interested only in checking that students have taken all the prerequisites of each course for which they register. © Sharing of data and multiuser transaction processing The Multiuser DBMS includes concurrency control software to ensure that severa Users trying to update the same data in a controlled manner in order to ensure that Eka ScannerV Senv (CSE / TSE) Ans. result ofthe updat ryt assign a 500 on ay For example, when sever ure that eac! é faa : rer. These types of applications are generally calle, ing (OLTP) applications. Transition is a progegs lnk al reservation sat can be accessed by onl: ° Aitling g. seat can be Y Only One agen 4 A sto a database and which must have the appearance on ut a fr isolation from all other transactions and of being atomic, og, in the typical component modules of DBMS and their interaeg, is a neat diagram. Poa) MS components. Maly Below Figure illustrate the typical DB It is divided into two parts. The top part refers to the interfaces, The lower part shows the internals of the DBMS responsible fory Storage various users of the database environment any of data and processing of transactions. The database and the DBMS catalog are usually stored on disk and operating. (OS) controls the accessibility to this disk like read/write. 8 SYsteq DBM$s have their own buffer management module to schedule disk readjy¢i A higher-level stored data manager module of the DBMS controls access ta Dm information that is stored on disk, whether it is part of the database or the cat ne The DBA staff works on defining the database and tuning it by making ied definition using the DDL and other privileged commands bi The DDL compiler processes schema definitions which are specified in the Di and stores descriptions of the schemas (meta-data) in the DBMS catalog, Th a feel information such as the names and sizes of files, names an ee lata item: ar i woe 3. ee storage details of each file, mapping information among schemas, zs Uses: OBASit . Passes Ure2a Ans. - ahost programming language, Casual users and persons with occas; : ‘asional need for i i \ sing som i ; information from the database a . aa Seer of interface, which we call the interactive ee interface. The query is Concerned with the Fearrangement and possible reordering of operations, elimination of redundancies ° uring execution, 5, and use of correct algorithms and indexes The runtime daval e Processor executes- the Privileged commands, the executable query plans, and the canned transactions with runtime parameters, The precompiler extracts DML commands from an application program written in Concurrency control and backu; : P and recovery systems are i ir working of the runtime datab ae) epee are nfegratedanto) the ‘se processor for purposes of transaction management. OR With a neat diagram, illustrate the main Phases of database design? (8marks) Mess ANALYSIS" Dosa Requtemares FUNGTONAL ARADO CONCEPTUAL DESIGN Hohe! Tanessten Conceeua! Schema ‘Soacteaton deabich eel dot rods 4 | 1OGiGAL DESIGN (OsTA MODEL APEC) Logical (Concept Scheme {inthe dts moc ca epo2e DOMS) PROGRAM PHYSICAL DESGH t TRANSACTION] q__ tna Schema IMPLEVENTATION, Aolieaten Programs The above figure shows the overview of the database design process. The first step is requirements collection and analysis. In this step, the database designers interview database users to understand and document their data requirements. The result of ‘this step is a concisely written set of users’ requirements, In parallel with specifying the data requirements, it is useful to specify the known functional requirements of the application. It consists of the user-defined operations (or transactions) that will be.applicd to the database, including both retrievals and updates, ww Exam ScannerV Sem (CSE ( ISE) i ¢ a conceptual ee yatta step i called conceptual design, re cceptalschemn i «desertion oF the de egutemens op iiicludes detailed descriptions of the entity pa a ee vey Constiaing The next step in database design 1S aed actual i a aa ra Of the ig uising a commerciat DBMS. DBMSs use an aa itt 7 ata mod the conceptual schema is transformed from ; iB bigh-tevel data. mote x implementation data model. This step is called logical design or qa,. F f a) me mapping. . . . | The Mast step is the physical design phase, during which the interna, Mo structures, ile organizations indexes, access paths, and physical design y% a d, In parallel: with these activities, sont for the database files are specifies a o programs are designed and implemented as database transactions Correspo; the high-level tratisaction specifications. b. What is a weak entity type? Explain the role of partial key in design of we entity type? . . . (Amari Ans. An entity type that has no set of attributes that qualify as a key is called weak, Entity of a weak identity type is uniquely identified by the specific entity to Whichit is related (by a so-called identifying relationship that relates the weak entity yp with its so-called identifying or owner entity type) in combination with some stg its own attributes (called a partial key). Example: A DEPENDENT eatity is identified by its first name together with te EMPLOYEE entity to which it is related via DEPENDS_ON. Aweak entity type has a partial key, which is the attribute that can uniquely identify weak entities that are related to the same owner entity, In the above example, if we assume that no two dependents of the same employ ever have the same first name, the attribute Name of DEPENDENT is the partial ke. In the worst case, a composite attribute of all the weak entity’s attributes will bett partial key. ‘e i nig c. What are the responsibilities of DBA and Database Designers? —_ (Amati Ans. DBA: The Data base Administrator (DBA) is the super-user of the system T#! oversees and manages the database system (including the data and software}D8 responsibilities include authorizing users to access the database, coordi monitoring its use, acquiring hardware/software for upgrades, ete. I" organizations, the DBA might have a support staff. Database Designers: Database Designers identifying the data to be so choosing an appropriate way to organize the data, They have to communicate database users to understand thei requirement. They also define views (04° i categories of users. The final design must be able to support the requireme™ the user sub-groups, 4\ cs - Model Question Paper - 1 “ Module-2 Define (6marks) , Fi 3 j, Domain ii, Tuple Domain: Domain is a set/universe of a/omic values. “atomic” means that each value Ans. asa ieee domain is indivisible (i.., cannot be broken down into componient parts). in the Example: USA_phone_number: string of digits of length ten ; A tuple is a mapping from attributes to values drawn from the respective | d (tributes. A tuple is intended to describe some entity (orrelationship between entities) in the miniworld, |. Example: A tuple for a PERSON entity might be | { Name -> “Rumpelstiltskin”, Sex > Male, 1Q--> 143} .. Discuss the yarious types of JOIN operations? (6marks) ‘Ans. The Join operation denoted by , is used to combine related tuples from two relations into single “longer” tuples. ‘Theta Join: Similar to a CARTESIAN PRODUCT followed by a SELECT. The condition c is called a join condition. R(AL,A2, «Am, BI, B2, .., Ba) RI(AI, A2, «.. Am) ¢ R2 (BI, B2, .... Bn) Equi-Join: The join condition c includes one or more equality ‘comparisons involving attributes from RI and R2. That is, ci of the form: (Ai=Bj) AND "AND (Ah=Bk); I FROM ] [GROUP BY ] n>) >] attributes or functions to be retrieved. The FROM clause specifies all relations (tables) needed in the query. The WHERE clause specifi relations. Example: Retrieve the birth date and address of the empl is John B Smit ployee(s) whose name is ‘John SELECT b date,address FROM EMPLOYEE John’ AND WHERE Fname= Mini 2B? Lname='smith’; a Group by specifies grouping attributes whereas having specifies « conor 8rOups being selected rather than on the individual tuples. The bull functions COUNT,SUM,MIN,MAX AND AVG are used in conj grouping. Example: ies the conditions for selection of tuples from thst | AND tin As ‘unctiola Pr Model Question Paper - 1! (em ; each project on which more than two employees work, retrieve the project Fol : oject name and the number of employees who work on the project. number? SELECT Pnumber,Pname,count(*) FROM PROJECT, WORKS_ON WHERE, Pnumber=Pno GROUP BY Pnumber,Pname HAVING COUNT(*)>2; ORDER BY specifies an order for displaying the result of a query. Syntax is shown low w ORDER BY ] {, ]} : =(ASC/DESC) pb, Explain Relationship Sets (without Constraints) to Tables? (8marks) Ans. Relationship set, like an entity set, is mapped to a relation in the relational model. Consider a relationship sets without key and participation constraints To represent a relationship, each participating entity is identified and the descriptive attributes of the relationship. Thus, the attributes of the relation include: ‘ The primaty key attributes of each participating entity set, as foreign key fields. ‘© The descriptive attributes of the relationship set. The set of nondeseriptive attributes is a superkey for the relation. If ther constraints, this set of attributes is a candidate key. Module-3 give values to re are no key 3, a. Write a note on: (8marks) ‘Ans, i. Views in SQL ii. Aggregate functions in SQL, i) Views in SQL : A Views in SQL is a single table that is derived from other tables. ‘These other tables can be base fables. A view does not necessarily exist in physical form; it is considered to be a virtual table. In SOL, the command to specify a view is CREATE VIEW. ‘The view is given a (virtual) table name (or view name), a list of attribute names, and a query to specify the contents of the view. Example: CREATE VIEW WORKS_ONI AS SELECT Fname, Lname, Pname, Hours FROM EMPLOYEE, PROJECT, WORKS_ON WHERE Ssn=Essn AND Pno=Pnumber; The DROP VIEW command to dispose of it. For example: | VIA: DROP VIEW WORKS_ON1; ii) Aggregate functions in SQL: Aggregate functions are used to summarize information from multiple tuples into a single-tuple summary. Grouping is used to create subgroups of tuples before summarization. A number of built-in aggregate functions exist: COUNT, SUM, MAX, MIN, and AVG. star Exam Scanner 9V Sem (CSE / ISE) © F tuples or values ag returns the number o Speai The COUNT FM MIN, and AVG can be applied to A set g ame he sum, maximum, Value, ming and average (mean) of those values. BERET SUM (Salary), MAX (Salary), MIN (Salary), ayg (Salary) " EMPLOYEE: SOL? Expr Oy riggers and assertions defined in SQL? Explain CREATE ASSERTION statement of the DDL. ; Encl tion is given a constraint name and is specified yi the WHERE clause of an SQL query. For example, to specify the constraint that the salary of an employee imu greater than the salary of the manager of the department that the employee for in SQL. CREATE ASSERTION SALARY_CONSTRAINT CHECK (NOT Exisy SELECT * FROM EMPLOYEE E, EMPLOYEE M, DEPARTMENT D WHERE E.Salary>M Salary AND E.Dno=D.Dnumber AND D.Mgr sso The Constraint name SALARY CONSTRAINT is followed by CHECK, which is followed by a condition in pare every database state for the assertion to be satisfied. The constraint name can be used to refer to the Constraint or to modify or dropit Any WHERE clause condition can be used, but Many constraints can be specie using the EXISTS and NOT EXISTS style of SQL conditions. Another important statement in SQL is CREATE TRIGGER, The trigger cate written as below CREATE TRIGGER SALA RY_VIOLATION BEFORE INSERT OR UPDATE OF SALARY, SUPERVISOR_SSN ON EMPLOYEE FOR EACH ROW WHEN ( NEW.SALARY > (SELECT SALARY FROM EMPLOYEE WHERE SSN = NEW.SUPERVISOR_SSN ))INFORM_SUPERVISOR (NEW.Supertst. ssn, NEW.Ssn ); Trigger has three components: i. The event(s): These applied to the database, record, changing an emp (8 meron ty ty i8 a condition Sing ly MSa) the keywog ntheses that must hold true og are usually database update operations that are a In this example the events are: inserting a ne a re E loyee’s salary, or changing an employee's supers the he Condition that determines whether thé rule action should be execute the triggering event has Sccurred, an optional condition may be evaluated Condition is Specified, the action Will be executed once the event occurs. ld iti. The action: The action is Usually a sequence of SQL statements, but ito! be a database transaction o aM external program that will be automaticallyE scs - Model Question Paper - 1° 6% Briefly explain the Properties of Cursors? jos. The general form of a cursor declaration is . Explain Three-Tier Applic: . The three-tier architecture separates application logic from data management: (8marks) DECLARE cursomame [INSENSITIVE] [SCROLL]. CURSOR (WITH HOLD] FOR some query [ ORDER BY order-item-list ] [ FOR READ ONLY I FOR UPDATE ] Acursor can be declared to be a read-only cursor (FOR READ ONLY) or, if it is “ cnet a base relation or an updatable view, to be an updatable cursor (FOR ¢ The UPDATE andDELETE commands allow us to update or delete the row on which the cursor is positioned. For example, if sinfa is an updatable cursor and open, the following statement is executed: UPDATE Sailors S . SET S.rating = S.rating ~ 1 WHERE CURRENT of sinfo; @ If the keyword SCROLL is specified, the cursor is scrollable, which means that variants of the FETCH command can’be used to position the cursor in very flexible ways; otherwise, only the basic FETCH command, which retrieves the next row, is allowed. «@ If the keyword INSENSITIVE is specified, the cursor behaves as if it is ranging over a private copy of the collection of answer rows. Otherwise, and by default, other actions of some transaction could modify these rows, creating unpredictable behavior. For example, while rows is fetched using the sinfa cursor, then rating values is modified in Sailor rows by concurrently executing the command: UPDATE Sailors S : SET S.rating = S.rating - n Architectures? (8marks) i. Presentation Tier: Users require a natural interface to make requests,.provide input, and to see results. The widespread use of the Internet has made Web-based interfaces increasingly popular. At the presentation layer, the user can issue requests, and display responses that the middle tier generates. Itis important that this layer of code be easy to adapt to different display devices and formats; for example, regular desktops versus handheld devices versus cell phones. ii, Middle Tier: The application logic executes here, An enterprise-class application reflects complex business processes, and is coded in a general purpose language such as C++ or Java. ‘The middle layer runs code that implements the business logic of the application: Controls what data needs to be input before an action can be executed, determines the control flow between multi-action steps, controls access to the database layer, and - Exam Scannerfrom databas, i erated HTML pages atabase que cay ee who wants to buy an item (afte, ie ry a ale can happen, the customer has tg 9 dy! en assembles dy" on consider the For example, . Fe searching the site to find Fa Ee toher shopping basket, she has yy hay a series of steps She na Oe umber (unless she has an account at 4% miki shipping address and she has to finally confi the flow among these steps mile tir ofthe application. plications inv iii, Data Management Tier: Data-intensive pp olve Daas, Module-4 7. a. Explain informal design guidelines for relation schemas. Bray ‘Ans, The four informal measures of quality for relation schema i. Semantics of relations attributes _ Specifies how to interpret the attributes values stored. in a tuple of the Telation, jy other words, how the attribute value in a tuple relate to one another. Guideline 1: Design a relation schema so that itis easy to explain its meaning p, not combine attributes from multiple entity types and relationship types into single relation. ii, Reducing redundant values in tuples. Save storage space and avoid ups anomalies Insertion Anomalies To insert a new employee tuple into EMP_DEPT, it must include either the attribute values for that department that the employee works for, or nulls. It’s difficult to inser anew department that has no employee as yet in the EMP_DEPT relation. The oaly way to do this is to place null values in the attributes for employee. This causes problem because SSN is the primary key of EMP_DEPT, and each tuple is supposed to represent an employee entity - not a department entity. Deletion Anomalies r ee tuple is deleted from EMP_DEPT that happens to represent te yee working for a particular department, the information concerning department is lost from the database, Modification Anomalies ’ aera if ee One of the attributes of a particular cent in that department have to be ics 1 Besalereplovie nto > Guideline 2: Design the base rela, tm the sale with tax and shipping costs addeq atl and remembering already executed step j go™ ly a al the oo, rat S modification anomalies coe ie Schemas so that no insertion, dt itis born eine the null values in tuples. e-8 i aoe have Offices, it is better to have a separat Fs va Bae OFFICE: an an attribute OFFICE NUMBER j E Parate relation, =) ii, Reducing the null values in ty ma MPLOYEE. Shea lle interpretations, Such as the following: ‘ FPP to this tuple, For example, Visa_status may! (42. Model Question Paper - 1 to U:S. students. «The attribite value for this tuple is unknown. For example, be unknown for an employee. « The value is known but absent; that is, ithas not been recorded yet. For example, the Home_Phone_Number for an employee may exist, but may not be available and recorded yet. Guideline 3: Avoid placing attributes in a base re! iv. Generation of Spurious Tuples: Spurious Tuples are the ty inal elation but generated by natural jon of decomposed subrelations Guideline 4: Design relation sehemasso that they can be naturally JOINed on primary keys or foreign keys in a way that guarantees no spurious tuples are generated. ation? Explain third normal form with example (8marks) Normalization of data is the process of analyzing the given relation schemas based on their FDs and primary keys to achieve the desirable properties of (1) minimizing redundancy and (2) minimizing the insertion, deletion, and update anomalies ‘Third normal form is based on the concept of transitive dependency. ‘A functional dependency X Y ina relation is a transitive dependency if there is a set of attributes Z that is not a subset of any key of the relation, and both X Z and ZY the Date_of_birth may lation whose values are mostly null. ples that are not in the What is normaliz: = Ans. hold. Inother words, a relation is in 3NF if, whenever a functional dependency XA holds in the relation, either (a) X is a superkey of the relation, or (b) A is a prime attribute of the relation, Practical Rule: “Eliminate Columns not Dependent on Key,” ie., if attributes do not contribute to a description of a key, remove them {0 a ‘separate table. Formal Definition: A relation is in third normal form (3NF) ifand only if it isin 2NF and every nonkey attribute is nontransitively dependent on the primary key. EP.DEFT caumeer | ouame | CMGRSSN enue | cou | enare | aooress yl FFF Y se nerusueanan em come | sores | cwmeen | [ommeer | crane | oucrsey cae | St : tI Ltt INF: Ris in INF iffall domain values are atomic. 2NE: R is in 2 NF iff R is in INF and every nonkey the key. 3NF: Ris in 3NF iff R is 2NF and every nonkey attribute is non-transitively dependent eo! attribute is fully dependent on on the key. wv Exam Scanner 13V Sew (CSE / ISE) 8. a. Write the algorithm for testing non additive join property, q ‘Ans. Testing for Nonadditive Join Property Cl Inputs A universal relation R, a decomposi 7 Fs on Rim ot F of functional dependen band tial matrix ch attribute Aj in R. . ae e 2. Set Si j):= bij for all matrix entries. (* each bij is a distinet symbg) . with indices “oe Gi). . ; iff 3. For each row i representing relation schema Ri {for each column j pp S with one row i for each relation Rin D, ang ne attribute 4j ; 7 {if (relation Ri includes attribute 4/) then set S(, j): symbol associated with index (j) *)- : 4. Repeat the following loop until a complete loop execution results in ng chan, 5 {for each functional dependency XY in F {forall rows in S that how ye symbols in the columns corresponding to attributes in X {make the symbols, a column that correspond to an attribute in Y be the same in all these rows ag alloy IF any of the rows has an a symbol for the column, set the other rows to thases @ symbol in the column. If no a symbol exists for the attribute in any of the mm, choose one of the 6 symbols that appears in one of the rows for the attribute and se the other rows to that same b symbol in the column 3} ; } 3}; 5. If a row is made up entirely of a symbols, then the decomposition has te nonadditive join property; otherwise, it does not. b. Consider R={A B CD E F} Fd’s{ ABC, BE, ADF}. Check whether decomposition is lossless. (8marks) T3335 (* each aj is ¢ a dist Ans. Key=AB R, = {A,B,C} R= {A,D,F} {BF} Decomposition is lossless if for any 2 relations R, and R, Ryn RR, or RinR,—>R, RnR —R, o RnR, > R, Here this condition is not satisfied so the decomposition is lossy. Module-5 cont 9. a. Write a short note on: i. Transaction support in SQL, ii, Wei ; i, a ‘ol. Ans. i. Transaction support in i A Write ahead log protoc: An SQL transaction is a logical uni ie. asi ent) gical unit of work (i.e., a single SQL state i # The access mode an be specified as READ ONLY ot READ WHITE. Tl is READ WRITE, which allows update, insert, delete, and create CN be executed. A mode of READ ONLY, as the name implies, i'Si™PY retrieval. : . Sunstar© ¢BCS - Model Question Paper - 1 = Ans. The diagnostic area size option specifies an integer value n, indicating the number of conditions that can be held simultaneously in the diagnostic area. The isolation level option is specified using the statement ISOLATION LEVEL. where the value for can be READ UNCOMMITTED, READ COMMITTED, REPEATABLE READ, or SERIALIZABLE. , ‘ the default isolation level is SERIALIZAB, Ifa transaction executes at a lower isolation level than SERIALIZABLE, then the following three violations may occur: i, Dirty read. ii, Nonrepeatable read. ii, Write ahead log protocol. Write-ahead logging (WAL) protocol for a recovery algorithm that requires both UNDO and REDO: 1. The before image of an item cannot be overwritten by its after image in the database on disk until all UNDO-type log records for the updating transaction— up to this point—have been force-written to disk. 2, The commit operation of-a transaction cannot be completed until all the REDO- type and UNDO-type log records for that transaction have been force written to disk. . Phantoms., With a neat state transition diagram, discuss the different states of a transition, (Smarks) Read, Write transaction. Asi Abort © BEGIN_TRANSACTION. This marks the beginning of transaction execution, © READ or WRITE. These specify read or write operations on the database items that are executed as part of a transaction. © END_TRANSACTION. This specifies that READ and WRITE transaction operations have ended and marks the end of transaction execution. At this point it may be necessary to check whether the changes introduced by the transaction can be permanently applied to the database (committed) or whether the transaction has to be aborted because it violates serializabitity or for some other reason. © COMMIT_TRANSACTION. This signals a successful end of the transaction so that any changes (updates) executed by the transaction can be safely committed to the database and will not be undone. ¢ ROLLBACK (or ABORT). This signals that the transaction has ended unsuccessfully, so that any changes or effects: that the transaction may have applied to the database must be undone. —> Failed) eo Exam Scanner 15al Ans, 16 hich the participate is serializable, 4, @m, te permitted has the tansaetions in order of nd ha thy imestamp Ord ig (TO) ; ‘The concurrency control algorithm must ch dering in the following ye 0 ¢ the timestamp ore ag yes a write_item(X) operation, the fy ig i time $e values. This is TO Algo conflicting opera 1. Whenever a transaction checked: si) if ‘TS(X)> TSCA), then abort and rot by the operation. This should be done because some younger transact’ ‘di 's(7)—and hence afier T in the timestamp onder With Iue of item X before Thad a chance to write x » ty timestamp greater than alre: or written the va Sint .« the timestamp ordering. b. Ifthe condition in part (a) does not occur, of and set write_TS(X) to TS(7). 2, Whenever a transaction 7 issues then execute the write_item() S Opera ig a read_item(X) operation, the folloyig checked: * a If write TS(K) > TS(1), then abort and roll back and reject the operation, Tg should be done because some younger transaction with timestamp greater tha, TS(T)—and hence afier Tin the timestamp ordering—has already written the vale of item Y before Thad a chance to read X. b. If write TS(X) < TS(Z), then execute the read_item(X) operation of Pant st read_TS(X) to the larger of TS(7) and the current read_TS(%). Strict Timestamp Ordering (TO): Thomas's Write Rule: A modification of the basic TO algorithm, knows Thomas’s write rule, does not enforce conflict serializability, but it rejects fever write operations by modifying the checks for the write_item(X) operation as follows: 1. If read_TS(X) > TS(7), then abort and roll back 7 and reject the operation. 2. If write_TS(X) > TS(7), then do not execute the write operation but como processing, This is because some transaction with timestamp greater than TS and hence after 7 in the timestamp ordering—has already written the value of Thus, we must ignore the write_item(X) operation of T because itis already ou and obsolete. Notice that any conflict arising from this situation would be ate by case (1). ; u neies the cto in part (1) nor the condition in part (2) occurs, -_item(A) operation of Pand set write_TS(X) to TS(D)- thenert Describe the shadow pagi i ances : aging recovery technique. . cireumsta™ Pecteninestes -y technique. Under what cir" nit This recovery scheme does not require the use of a log in a single-user envi Inami Be environment, a log may be needed for the concurrency contol Shadow paging considers the database to be made up of a number of f* ‘Sunstar Exe"(or disk blocks vases ort where eae ; itor recovery purposes. directory with » entries is cons ? ntry points to the ith databiise page on disk. The directory is kept in main memory if it is not too large, it database pages on disk go through it, 'ge, and all references—reads or writes—to When a transaction begins executing, the eurrent di to the most recent or current database Pages on disk. directory. The shadow directory is then say used by the transaction, During transaction is copied into a shadow ed on disk while the current dire. ry is ccution, the shadow directory is never modifi 3 wie jem operation is peter, new cory stvhe meager name wees created, but the old copy of that page is not overwritten. Instead, the new page is written elsewhere—on some previously unused disk block, The current directory entry is modified to point to the new disk block, whereas the shadow directory is not modified and continues to point to the old unmodified disk block. Below Fig illustrates the concepts of shadow and current directories. For pages updated by the transaction, two versions are kept. The old version is referenced by the shadow directory and the new version by the current directory. ‘An orale of sha Current divoctory Databsce dik fatter updating Blocks (pages) ages 2,5) Page (new) Ina multiuser environment with concurrent transactions, logs and checkpoints must be incorporated into the shadow paging technique: star Exam Scanner ; 17 isFifth Semester B.E. Degree Examination CBCS - Model Question Paper - 2 DATABASE MANAGEMENT SYSTEM Time: 3 hrs, 7 i i Ma: Note : Answer any FIVE full questions, selecting ONE full question from ety y Mm ath weg MODULE - 1 1a, Explain the three level DBMS architecture, need mappings between schema levels? Ans. This idea was first described by the ANSI/SPARC committee in late 19705 28) is to separate (ie, insert layers of “insulation” between) user application “t physical database. And ty * Internal level: has an internal/physical schema that describes the physical sh structure of the database using a low-level data model. The internal schema physieal data model and describes the complete details of data storage ani a paths for the database. Conceptual level: has a conceptual schema describing the the whole database for a community of users. It hides physical storage details, concentrating upon describing entities, data ty pes, relationships, user opens and constraints. It is deseribed using either high-level or implementation ao model. with a neat diagram Wh Why ayy, (logical) structure of External/view level: includes a number of external schemas (or user viens}, each of which describes part of the database that a particular category of uses is interested in, hiding fest of database, It is described using either high-leveler implementation data model. ‘ External Level External View Externa/Coneeptual Mapping Conceptual Lever (Conceptual So) Concoptuat/intornat Mapping Internal Level ¥ Internal Schema 668 Stored Database into @ The DBMS transform a request specified on an external schema ne i against the, conceptual schema, and then into a request on the intern i 18 . ‘Sunstar Exams 3cos! rocessing over the stored database. If the ‘request is database retrieval, the data extracted from the stored database must be reformatted to match the user’s external view. The processes of transforming requests and results between levels are called mappings: _ What are the advantages and the disadvantages of DBMS? Explain? (08 marks) as, Advantages of DBMS: * Controlling Redundancy: Data redundaney (occurs in the “file prov. ing” approach) leads to wasted storage space, duplication of effort (when multiple copies of a datum need to be updated), and a higher likelihood of the introduction of inconsistency. In the database approach, during database design the views of different user ups are integrated. ie each logical data details are stored in only one place in the database .This is termed as data normalization, and it ensures consistency and saves storage space. In order to improve the performance of queries, it is necessary to use controlled redundancy ‘A DBMS should provide the capability to automatically enforce the rule that no inconsistencies are introduced when data is updated. ‘e Restricting Unauthorized Access: A DBMS. provides a security and authorization subsystem, which is used for specifying restrictions on user accounts, DBMS will enforce these restrictions automatically. Allow read-only access (no updating), or access only to a subset of the data are some kinds of restrictions. Providing Persistent Storage for Program Objects: Object-oriented database systems make it easier for complex runtime objects (e.g., lists, trees) to be saved in secondary storage so as to survive beyond program termination and to be retrievable at a later time. Providing Storage Structures for Efficient Query Processing: The DBMS maintains indexes (typically in the form of trees and/or hash tables) that are utilized to improve the execution time.of queries and updates. (The choice of which indexes to create and maintain is part of physical database design and tuning (see Chapter 16) and is the responsibility of the DBA. © The query processing and optimization module is responsible for choosing an efficient query execution plan for each query submitted to the system. © Providing Backup and Recovery: The subsystem having this responsibility ensures that recovery is possible in the case of a system crash during execution of ‘one or more transactions, Disadvantages of DBMS: * ADBMS isa complex piece of software, optimized for certain kinds of workloads and its performance may not be adequate for certain specialized application. © The abstract view of the data. presented by the DBMS does not match the application’s needs and actually get in the way. © In most situations calling for large scale data management, DBMS have become an indispensable tool. Exam Scanner 19env (CSE / SE) VS aa 3 tes tha 2. a, Explain the different (yP° ofattribu eon ing notations? Ans. Attributes are cis : vs, Con @ Simple/Atomic vs. Cot isc ed of sma 7 composite attribute is one that is composed of smaller parts, 1. basic attributes with independent penne crests attributes forms a a Example: The Ades tui ee the E entity can be Sub gf a s, City, State, an . aoe ite saibe is indivisible or indecomposable, % « Single-valued vs. Multi-valued (or set-valued) The attribute that have a single value for a particular entity is called 5 Single attribute, Val Example: Age is a single valued attribute of a person, The attribute that have a number of values for a particular entity is Called as valued attribute, S Mut Example: The color attribute of the car. The car can have two or three Colors at @ Stored vs, Derived : : “ A derived attribute is one whose value can be calculated fro attributes, Example: Age can be calculated from BirthDate. Astored attribute is one from which a derived r s attribute is calculate, Example: BirthDate is a stored attribute from hich age is calculated, © NULL Values: ‘ m the values Of oth, A particular entity may not have an applicable value for an attribute, Example: a College_degrees attribute applies only to People with college degre Write an ER diagram of ho: entities (minimum 4), a = f spital management system, Assume your ov attributes and relations, (08 maris) 20cs - Model Question Paper . 2 OP Employee PSD TEA Qualification Experience attends Doctor ISA, Visiting} | Permanent || Trainee nurse Medicine Room Module-2 3.a. Explain the characteristics of relations? (08 marks) Ans, Ordering of Tuples: A relation is a set of tuples; hence, there is no order associated with them. . When a relation is depicted as a table, the tuples are necessarily listed in some order, of course, but you should attach no significance to that order. when tuples are represented on a storage device, they must be organized in some fashion, and it may be advantageous, from a performance standpoint, to organize them in a way that depends upon their content, Ordering of Attributes: A tuple is best viewed as a mapping from its attributes to the corresponding values. Hence, the order in which the attributes are listed in a table is irrelevant. Values of Attributes: For a relation to be in First Normal Form, each of its attribute domains must consist of atomic values. Much of the theory underlying the relational model was based upon this assumption, The Null value: used for don't know, not applicable. Interpretation of a Relation: Each relation can be viewed as a predicate and each + Exam Seanvier wo 2Fewed as an assertion for which that Dred ryalues in it. i other words, each tuple repres oa sted means: There exists a student hay 435, having age 19, ete, umption states that the only (rue facts about the ini whatever tuples curtently populate the database me tuple in that relation can be NS Name those represented b ? Give the detailed explanation of key ases can be categorized as follows: ample: no two tuples in Y COnstraings, 8 ¢ model-base Fa se a relation is a set of tuples; a aba be expressed using DDL; this kind is the focy, a relation cay be 4 “lig i S OF this sae . are speci othe “busines rls” of he mig ly dificult oF impossible to express and enforce within the que Hence, iti left to application programs to enforce, Ml Key Constraints: A relation is a sef of tuples, and each tuple’s by the values of its attributes. Henee, it makes no sense for two t to be identical. That is, no two tuples may have the same combi their attributes. Usually the miniworld dictates that there be subsets of attribute tuples may have the same combination of values. Such a set of superkey of its relation. From the fact that no two tuples can be that the set of all attributes of A key is a minimal superkey, its attributes, the resulting set identity ples ina rel nation of vag S fOr Which notyy attributes is call, identical, it folly, ‘a relation constitutes a superkey of that relation, ie., a superkey such that, if we were to remove anyef of attributes fails to be a superkey, Example: The faculty member is uniquely identified by Name and Address anda by Name and Department, but by no single one of the three attributes mentioned, Then { Name, Address, Department } is a (non-minimal) superkey and eachf{ Name, Address } and { N: } is a key (i.e., minimal superkey). ame, Department OR ; the following database schema (08 mat BRANCH, PERCENTAGE) 3 (CID, CNAME, FID) ENROLL (CID, USN, GRADE) i pane the den ofall students enrolled for the course “e554? be na : es © department having an average salary of the faculties oor ESIGNATION, SALARY) List the names of ; grade. he stulents enrolled for the course ‘es54” and s Ans. iSelect USN from stupp, =| NT, ENROLL, here, STU USN=ENROLL.USN ,COURSE_w CNAME=Cs-sq “4 COURSE.CID = “ENROLLCID and. 22ject DEPARTMENT from FACK , se ENT ULTY where avg(SALARY) > 10000 group by “ Beer ot Oe ENROLL.COURSE where STUDENT.USN = ENROLL L..CID=COURSE.CID And COURSE.CNAME = ‘CS- Srrand ENROLL-GRADE = °B” z _ explain fiw the group by clause works, What i ee 1 UMIERE and HAVING clause? eae Saar] 1s. Aggregate function can be applied to subgroups in a relation, where the subgroups are based on some attribute values. , The relation is partitioned into non-overlapping subsets (or groups) of tuples. Each group consists of the tuples that have the same value of some attributes called the grouping attributes. SQL has a GROUP BY clause for this function. It specifies the grouping attributes, ‘which can also be used with SELECT clause. Example: For cach department, retrieve the department number, .es in the department and their average salary. SELECT Dno, COUNT (*),AVG (salary) FROM EMPLOYEE GROUP BY _Dno; Difference between WHERE and HAVING clause WHERE CLAUSE 1, Where clause can be used other than the number of employe HAVING CLAUSE ‘ed only with the select 1. Having is us select statement also. statement. 2. Having clause applies to summarize rows 2, Where clause applies to each and single 3. In Having clause, the completed data is row. 4 lnwhere clauses, the data is fetched from fetched firstly and then separated according to condition. memory according to condition. T Whew clause is used before GROUP BY| 4. Having clause is used to improve clause, : condition on GROUP fiinction and is used afier GROUP BY clause inthe query. Module-3 how to ereate the view and how view ean be dropped? jated with updating views? (08 marks) m other tables. The other tables can be base 5. a, What is a view? Explain What problems are associ Ans. Aview is a single table that is derived fro | + tables or previously defined views. In SQL, the command to specify a view is CREATE VIEW. The view is given a (virtual) table name (or view name), attribute names, and a query to specify the contents of the view. CREATE VIEW DEPT_INFO(Dept_name, No_of_emps, Total_sal) ~. ASSELECT Dname, COUNT (*), SUM (Salary) FROM DEPARTMENT, EMPLOYEE alist of Exam ScannerV Sew (CSE / ISE) WHERE Dnumber=Dno GROUP BY Dname; ‘The DROP VIEW command is used to dispose the view, For example, to get rid of the view V1, VIA: DROP VIEW WORKS_ONI; Updating of views is complicated and ca ona single table without any aggregate underlying base table under certain con If the view involves joins, an update op on the underlying base relations in multiple ways. Hence, itis of the DBMS to determine which of the updates is intended, Example: Consider the WORKS_ONI view and suppose that the com, we can use the SQL Slateme, tin n be ambiguous, An Update on a, functions can be Mapped to a) Md Aa an ug ditions. at eration may be mapped to y a Mt On ten not Pr isi fF mi the PNAME attribute of ‘John Smith’ is issued from ‘ProductX* tp eh view update is shown below: UPDATEWORKS_ONI SET Pname = ‘ProductY” WHERE Lname="Smith’ AND Fname: AND Pname="ProductX’; r Ans. NULL is used to represent a missing val There are three different interpretations Explain the rules for dealing with NULL values in SQL? iductys ney =John’ ue (08 mary © value unknown (exists but is not known) © value not available (exists but is pury © value nol applicable (the attribute is * Consider the following examples. 1. Unknown value, A NULL in the database. 2.U; 3. Not applicable attribute. An attribut person who has no colle SQL uses a three-valued logic with valu of the standard two-valued (Boolean) OR 6, a, Explain the Stored Procedures? Stored procedures are beneficial for Software engineering. Once a store! cS Server, different users can re-use the store ts in writing SQL queries ‘or applicatio is registered with the database eliminating duplication of effo making code maintenance easy, Creating a Simple Stored Procedure 24 person’s date of birth is not known, so it is represented by ailable or withheld value. A person has a home phone but does not wat to be listed, so it is withheld and represented as NULL in the database. 7 ge degrees because it does not apply to that person. posely withheld) undefined for this tuple), ite LastCollegeDegree would be NULL ft es TRUE, FALSE, and UNKNOWN logic with values TRUE or FALSE! (08 otIN book_i IN addedQty INTEGER) UPDATE Books qty__: bookjsb: stored procedures can also have parameters. These parameters have one of three different modes: IN, OUT, or INOUT. IN parameters are arguments to” the stored procedure, OUT parameters are returned from the stored procedure; it assigns values to all OUT parameters that the user can process. INOUT parameters combine the properties of IN and OUT parameters. ‘They contain values to be passed tothe stored procedures, and the stored procedure can set their values as return values. Stored procedures enforce strict type conformance: If a parameter is of type INTEGER, it cannot be called with an argument of type VARCHAR. Calling Stored Procedures from JDBC Stored procedures from JDBC is called using the CallableStatment class. CallableStatement is a subclass of PreparedStatement and provides the same functionality. A stored procedure contain multiple SQL staternents or a series of SQL statements- thus, the result could be many different ResultSet objects. We illustrate the case when the stored procedure result is a single ResultSet. CallableStatement estmt= COIL. prepareCall(* {call ShowNumberOfOrders}”); ResultSet rs = cstmt.executeQueryO while (rs.next()) Calling Stored Procedures from SQLI ‘The stored procedure ‘ShowNumberOfOrders’ is called as follows using SQL: // create the cursor class #sql Iterator Customerlnfo(int cid, String ename, int count); // create the cursor CustomerInfo customerinfo; 1/call the stored procedure #sql customerinfo = {CALL ShowNumberOfOrders}; while (customerinfo.nextO) { System.out.println(customerinfo.cid) + “,” + customerinfo.count()) ; = Explain the Common Gateway Interface and Servlets? (08 marks) Ans, Common Gateway Interface The Common Gateway Interface connects HTML forms with application programs. E Sunstar Exam Scanner 25 33Ta. . First Normal Form (INF) 26 V Senv (CSE / ISE) Datrhase Managemen, Sy - en sare passed ( r sfines how argumel . ‘ey 0 Droy It isa protooa! a ie ino the details ofthe actual CEL protaggl ey sons gett 0 TEM, fy gh + Extn, le, enable application prog nt, written in Perl. #Vuse/bin/perl use CG #88 part | Sdataln = new ee ; jataln-l,header . Snare = Sdataln-l,param(-authorName’), #88 part 2 print (IISHTML>”); LE>Argument passing test Y is a fully functional dependeney is removal of any attribute A from X means that the dependency does not hold any more. A rélation schema is in ONF if every nonprime g ribute in relation is fully functionally dependent on the primary key of the relation. It also can be restated as: a relation schema is ‘2 if every nonprime attribute in relation is not partially dependent on any key of the relation. Practical Rule: “Eliminate Redundant Data,” ie,, if an attribute depends on only part ofa multi valued key, remove it to a separate table. Formal Definition: A relation is in second normal form (2NF) if and only if it is in INF and every non key attribute is fully dependent on the primary key. Third Normal Form (3NF) Third normal form is based on the concept of transitive dependency. A functional dependency X—>Y ina relation is a transitive dependency if there is a set of attributes Z that is not a subset of any key of the relation, and both X —>Z and Z —>Y hold. In other words, a relation is in 3NF if, whenever a functional dependency X —> A holds in the relation, either (a) X is a super key of the relation, or (b) A is a prime attribute of the relation. Practical Rule: “Eliminate Columns not Dependent on Key,” ie., if attributes do not contribute to a description: ofa key, remove them to a separate table. Formal Definition: A relation is in third normal form (3NF) ifand only if it is in 2NF and every non key attribute is non transitively dependent on the primary key. ly. What is a functional dependency? Explain? (08 marks) ‘A functional dependency (FD) is a constraint between two sets of attributes from the database. Itis denoted by X —> Y “Y is functionally dependent on X”. X is called the left-hand side of the FD. Y is called the right-hand side of the FD. A functional dependency is a property of the semantics or meaning of the attributes, ie, a property of the relation schema. They must hold on all relation states (extensions) of R. Relation extensions r(R). AFD X—> Yis a full functional dependency if removal of any attribute from X means that the dependency does not hold any more; otherwise, it is a partial functional dependency. Examples: 1. SSN ENAME 2. PNUMBER {PNAME, PLOCATION} 3. {SSN, PNUMBER} HOURS FD is property of the relation schema R, not of a particular relation state/instance Let R be a relation schema, where X R and YR tl, t2 ¢, t[X] = t2[X] [Y] = 2[Y] The FD X Y holds on R if and only if for all possible relations r(R), whenever two tuples of r agree on the attributes of X, they also agree on the attributes of Y. Exam Scanner 27he single arrow " “Y del # XY ean also be read as “X deter if 5 “logical implication” the double arrow denote: | imp OR key Normal Form i fined in order to formalize two hy) Ys Dt i) Inclusion depet ‘Ans, i. Inclusion depend interrelational constraints: | | _ The foreign key (or referential integrity) constraint cannot be specifeg functional or multivalued dependency because it relates attributes actoss ry? ‘ons that represent a class/subclass rg lati The constraint between two relatic A , lai also has no formal definition in terms of the functional, multivalued, a and jog dependencies. ; ‘An inelusion dependeney RX ‘ ae er and right-hand-side attribut “i . . : 'm} of R is dependency-preserving to F if the union of the projections of F on each Ri in Dis equivalent to 289.8 ‘Anse RIE Y 2 (aRm(h))+ = Fe, fa decomposition is not dependency-preserving, some dependency is lost in the decomposition. To check that a lost dependency hols, two or more relations in the decomposition must be joined to get a relation that includes all left and right-hand- side attributes of the lost dependeney, and then check that the dependency holds on the result of the JOIN. Module-5 din concurrency control. (08 marks) ferent type of locks Binary Locks. A binary lock have (wo states or values: locked and unlocked (or | and 0). A distinct lock is associated with each database item X. If the value of the lock on X is I, item X cannot be accessed by a database operation that requests the item. Ifthe value of the lock on X is 0, the item can be accessed when requested, and the lock value is changed to I.It includes two operations, lock_item and unlock_item. If the simple binary locking scheme is used, every transaction must obey the following rules: 4. Atransaction T must issue the operation lock_item(X) before any read_item(X) or wwrite_item(X) operations are performed in T. 2, A transaction Tmust issue the operation unlock_i and write_item(X) operations are completed in T. 3, A transaction T will not issue a lock_item(X) ope! on item X.1 4, Atransaction T will not issue an ut the lock on item X. shared/exclusive: Shared/exclusive or ret write_lock(X), and unlock(X). ‘A lock associated with an item X, LOCK(X). ‘A read-locked item is also called share-locked because other transact ions are allowed to read the item. write-locked item is called exclusiv. holds the lock on the item. ‘When the shared/exclusive locking scheme i following rules: 1. A transaction T must issue the operation read_l any read_jtem(X) operation is performed in T. 2. A transaction T must issue the operation write_lock(X) before any write_item(X) operation is performed in T. FA rencacrion T must issue the operation unlock(X) after all read. item(X) and \write_item(X) operations are completed in T-3 A aaneactign Twill not issue a read_lock(X) operation if it already holds a read (Ghared) lock or a write (exclusive) lock on item X. This, rule may be relaxed, as we discuss shortly. Fav Exam Scanner item(X) after all read_item(X) ration if it already holds the lock mnlock_item(X) operation unless it already holds ad/write locks have three locking operations: read_lock(X), e-locked because a single transaction exclusively s used, the system must enforce the lock(X) or write_lock(X) before 29Database Managemen, S) F Vit, {lI not issue a write, lock(X) operation if it already i vill not is ek on item X. This rule may aisg beta ag Teady holes V sem (CSE / ISE) 5. A transaction T will not (Shared) lock or write (exe! cuss shortly at issue an unloek(X) operation tnless ita i ‘ a) lock ¢ jusive) lock on item X, shared) loc lusive) lo ; covery is needed? b, Explain the fof Eis een DBMS. for execution, 4, 8g Ans. Whenever a transaction is subn 7 os) patente hot $< completed successtlly and ty raedlnel n the database, or a DBMS ‘must not permit some operations ofa transaction Tro be Alig database while other operations of Tare not. This may happen if a transaction g cuting some of its operations but before executing all of them, is Yypes of Failures L. A computer failure (system erash): A hardware, software, of netwoi occurs in the computer system during transaction execution. Hardware usually media failures—for example, main memory. failure. 2. A transaction or system error: Some operation in the transaction may causeity fail, such as integer overflow or division by zero. Transaction failure may asp cay because of erroneous parameter values or because of a logical programming ony, In addition, the user may interrupt the transaction during ils execution, 3. Local errors or exception conditions detected by transaction execution, certain conditions may occur th: the transaction, For example, data for the transaction may not be found. Notice tit an exception condition , such as insufficient account balance in a banking databss, may cause a transaction, such as a fund withdrawal, to be canceled, This except should be programmed in the transaction itself, and hence would not be consid! a failure. i ir Hayy crashes the transaction: Dui fat necessitate cancellations! 4. Concurrency control enfo! to abort the transaction, to b because several transactions 5. Disk failure; malfunction or b reement: The concurrency contro! method may & € restarted later, because it violates serializabili ® are in a state of deadlock. : Some disk blocks may lose their data because of a 7 ag i . ara disk read/write head crash, This may happen "8 B Peration of the transaction, &Pooieal Problems and catastrophes: This refers to an endless list ote disks of tapes be ace {i Conditioning failure, fire, theft, sabotage © pes by mistake, and mounting ofa wrong tape by the operato® OR 10. a. Explain the proble - Give example, Ans, The Lost Update Problem, 30cS - Model Question Paper -2 : 4 ctions tha — have ther operations interleaved ina yay are pe ure aatacae ay ite incor we Suppose that transactions TY and To ae pee same time, and su sis : ited a i the: faa Ppose that their operations are interk Se fitem X is incorrect, because T2 erleaved then the final value teads the value of tabase, and hence the update * Whe value of X before TI changes it in the do ee a resulting from T1 is lost. ° The pry ete (te recen sony pein Tene || writ tomxr: rad tom hem Xhas an incorec valuo because its Updo by Ti (rr. ‘ | © i =e read tem ext ete, Tie swe Rem 1 neat Tal and must change read. somit |__ teva ackiois old ae. Imeanht Tha ed th temporary incoect ai ot X ‘The Temporary Update (or Dirty Read) Problem. This problem occurs when one transaction updates a database item and then the transaction fails for some reason. The updated item is accessed by another transaction before it is changed back to its original value. Above figure (b) shows an example where TI updates item X and then fails before completion, so the system must change X back to its original value, Before it can do so, however, transaction T2 reads the “temporary” value of X, which will not be recorded permanently in the | database because of the failure of TI. The value of item X that is read by T2 is called | dirty data, because it has been created by a transaction that has not completed and committed yet; hence, this problem is also known as the dirty read problem. The Incorrect Summary Problem. } If one transaction is calculating an aggregate summary function on a number of records while other transactions are updating some of these records, the aggregate function may calculate some values before they-are updated and others after they are updated. For example, suppose that a transaction T3 is calculating the total number of reservations on all the flights; meanwhile, transaction TI is executing. If the interleaving of operations shown in Figure (c) occurs, an amount N because'T3 reads the value of X after N se: it but reads the value of Y before those N seats have been added to it. the result of T3 will be off by sats have been subtracted from 31Ans, 32 V Sem (CSE / ISE) . Writ sums = 0: um su + A toad _itemi(X); Treads X after Mis sty thera onan erm Another problem that may occur is called unrepeatable read, where $ MERE a tanga T reads an item twice and the item is changed by another transaction 7. been two reads, Hence, Preeives diferent values forts v0 ead ofthe sane et may occur, for example, if during an airline reservation transaction, inquiring about seat availability on several flights. When the customer particular flight, the transaction then reads the number of seats on that time before completing the reservation. a CUsome decides oq, Aight a seco, note on check pointing, (04 mar A check point is a record written into the log periodically at that Point When he system writes out to the database on disk all DBMS buffers that have been modifi ‘The recovery manager of DBMS decides at what intervals to take a check point The interval could be measure in time-say every m minutes or in the ‘number t of committed transactions since the last check point, where the values of m or tar system parameters, Taking a check point consists of the following actions 1. Suspend execution of transaction temporarily, 2. Force right all main memory buflers that have been modified to disk. 3. Write a [cheek point} record to the log and force- write the log to disk. 4, Resume executing transactions,Fifth Semester B.E. Degree Examination CBCS - Model Question Paper - 3 DATABASE MANAGEMENT SYSTEM Max. Marks: 80 3s VE full questions, selecting ONE full question from each module. ‘Answer any FL MODULE-1 ain the history of database application? (08 marks) tions: The Hierarchical and Network Models were introduced in mid 1960s and dominated during the seventies. ‘Abulk of the worldwide database processing still occurs using these models. ‘These database systems were implemented on large and expensive mainframe computers. ‘The main drawbacks of early database systems were’ the intermixing of conceptual jonships with the physical storage and placement of records on. disk. And these systems relat did not provide sufficient data abstraction and program-data independence capabilities. 'e Relational Model based Systems: Relational model was originally introduced in 1970, was heavily researched and experimented Relational model with in IBM Research and several universities. Relational model separated the physical storage of data from its conceptual repress and also provide a mathematical foundation for data representation and querying. ‘The relational data model also introduced high-level query languages that provided an alternative to programming language interfaces, ¢ Object-oriented and emerging applications: Object-Oriented Database Management Systems (OODBMSs) were introduced in late 1980s and early 1990s to cater to the need of complex data processing in CAD and other applications. Many relational DBMSs have incorporated object database concepts, leading to a new category called object-relational DBMSs (ORDBMSs) Mainly used in specialized applications such as engineering design, multimedia publishing, and manufacturing systems. ‘© Extended relational systems add further eapal XML, and other data types) Relational DBMS Products emerged in the 1980s « Interchanging Data on the Web for E-Commerce Using XML , Data on the Web and E-commerce Applications: a «© Web contains data in HTML (Hypertext markup language) with links among pages. © This has given rise to a new set of applications and E-commerce is using new standards like XML (eXtended Markup Language). ¢ Script programming languages such as PHP and JavaScript allow generation of dynamic Web pages that are partially generated from a database. © Extending Database Capabilities for New Applications New functionality is being added to DBMSs in the following areas: * Scientific Applications sntation es (e.g. for multimedia data; Buster Exam Scanner 33V Sem (CSE / ISE) Database Mi Ans, Ans, 34 . Define database? Explain the implicit properties of database? . Explain the different categories of data models XML (eXtensible Markup Language) Image Storage and Manager © Audio and Video data management @ Data Warehousing and Data Mining © Spatial data management © Time Series and Historical Data Management , © The above gives rise to new research and development in incorporatin types, complex data structures, new operations and storage and indexingst™ & database systems. ena © Also allow database updates through Web pages. ; The term database refers to any collection of related data. Accordi Navathe, database is not only a collection of related data, but a database MUSt hay, following properties: Ch © It represents some aspect of the real world, called the miniworld, miniworld are reflected in the database. For example, a UNIVERS| concerned with students, courses, course sections, grades, and cours; # Iisa logically coherent collection of data, to which some meaning © It has @ purpose: there is an intended group of users and soi applications that the users are interested in employing. (04 8 {0 Big) Changes ty ITY mini © prerequisites an beatae ME preconceirey (04 maris A data model is an abstract, self-contained, logical definition of the objects, opening, and so forth, which together constitute the absiract machine with which usérs inte. i, High-level/conceptual: provides a view close to the ‘Way users would perceive data, uses concepts such as © entity: real-world object or concept (e.g., student, employee, course, department, eves) * attribute: some property of interest describing an entity (e.g,, height, age, cola) © relationship: an interaction among entities (e.g., works-on relationship between a employee and a project) ii, Representational/implementation: It is the intermediate level of abstractness It Provide concepts that can be easily understood by end users but that are’ not t0 f removed from the way data is organized in computer storage. Example is relational data model. Also called as record-based model. + Low-level/physical: This level describes how data is stored in computer syste™ as record formats, orderings of records, access paths. An access path is a structure that makes the: search for particular datal efficient. such pase ets OR ) Define CF ean F sty ins i, Entity type: An entity type serves as a template for a collection of entity ™ 1 all of which are described by the same collection that ii, Entity set: An entity set is the collection of all entities of a particular YP in a database, at some moment in time,ili. Snapshot; The data in the database at a Particular time is called the state of the database, OF a snapshot. It is also called the Current set of occurrences or the database. ‘ jy, Parti ation Constraints: The Particip: risence of an entity depends on its being rel instances in ation constraint specifies whether the lated to another entity via the relationship type: p, DESIGN an ER-diagram for the movie database considering the following © gequirements: (08 marks) "), Each movie is identified by its title and ye and can have zero of more quotes, languages. b, Production companies are identified by namo, they have address and each production company can produce one or more movies, c, Actors are identified by name and date of birth, they can act in one or more movies and each actor has a role in a movie 4d, Director is identified by Name, Dssn, dob, sex, address. Ans. "ar of release, it has length in minutes ame Gob) ape in Producer |__qaares EY filmid director rar Exam Scanner . 35st / ISE) vst Module-2 straints and Atribute Defaults ayy « ‘ (08 iy 7 aq if NULL is not permitted for a part ( te Lis specified if NU! mitted fo ey Constant NOT NUL eee autibutes that are part of the primary key, i y is imi tly yall hose values are required not to be NUL, “ay specified for am ribute Com 3, a. Briefly explain how Attribute Ans. attributes I HECK (Dauber > 0 AND Daumber <21), be specified by appending the clas, le ue for an attribute can x apy : ae A deta va teiute dein. Te default value is included in any new gee explicit value is not provided for that attribute. ruple: CREATE TABLE EMPLOYEE INT NOT NULL DEFAULT | 2 ae a ‘ecified, te default “default value” is NULL for atti ULL constraint. Another type of constraint can restrict attrib the CHECK clause. pe used in conjunction with the CREATE DOMAIN statement, Example Daumber INT NOT NULL C ity If no default clause is 5 do not have the NOT NI or domain values using “The CHECK clause can also Example: . CREATE DOMAIN D_NUM AS INTEGER CHECK (D_NUM> 0 ANDD_NUM <2), the SELECT and PROJECT operations in relational algebra with exampl (08 marls) ‘The SELECT operation is used to choose a subset of the tuples from a relation tt satisfies a selection condition. The SELECT operation keeps only those tuples tt satisfy a qualifying condition. In general, the SELECT operation is denoted by e(R) where the symbol ° (sigma) is used to denote the SELECT operator and the selection condition is a Boolean expression (condition) specified on the attributes of relation & Example: Soe OR (Dno=5 AND Salary>30000)(EMPLOYEE) operation selects certain columns from the table and discards the 0, columns, The general form of the PR ion i "(R) OIECT operations wl nh ; ee used {0 represent the PROJECT operation, and ist of attributes from the.attributes of relation R. b. Explain into EMPLOYEE. ete command ETE command removes tuples from a relation. It includes a WHI e deleted. Tuples are explicitly deleted from only one ERE clause, to table at a time. T pel ‘The DEL select the tuples to b Example: DELETE FROM EMPLOY! HERE Lname="Brown’s Update command DRMUPDATE command is used to modify attribute values of on tuples. A WHERE clause in the UPDATE command selects the tup! eva single relation. An additional SET clause in the UPDATE comman' abutes to be modified and their new values. For example: UPDATE PROJECT SET Plocation = ‘Bellaire’, Dnum = 5 WHERE Paumber=10; in how Relationship Sets is tran tionship set involves ‘n’ entity sets and some “mi 1e key for anyone of these *m’ enti lationship set is mapped. Hence i 1c or more selected les to be modified d specifies the slated with Key Constraints (08 marks) » of them are linked via arrows sets constitutes a key for the ‘m’ candidate keys, one can be Explai Ifarelal in the ER diagram, th rélation to which t ~ designated as the primary key. Consider the relationship set in w attributes ssn, did, since. However, because e: no two tuples can have the same did value but differ on the ssr key for Manages. The set di, ssn is not a key. The Manages relation can be defined using the following SQL statement: CREATE TABLE Manages (ssn CHAR (1!) + did INTEGER, since DATE, PRIMARY KEY (did), FOREIGN KEY (ssn) REFERENCES Employees, FOREIGN KEY (did) REFERENCES Departments ‘Asecond approach to translating a relationship set With key constraints is often superior because it avoids creating a distinct table for the relationship set. The idea is to include the information about the relationship set in the table corresponding to the entity set with the key, taking advantage of the key constraint. In'the Manages example, because @ department can be added to the Employees tuple denoting the m: Departments tuple. This approach eliminates the nee’ and queries. The only drawback to this approach is that space could be wasted if several departments ~ have no managers. In this case the added fields would have to be filled with nud! values. which the table corresponding to Manages has the ach department has at most one managers value. The did is itself a thas at’ most one manager, A key fields anager and the since attribute to the ~ .d for a separate Manages relation, Sutstar Exam Scanner 37.5. a, Ans. s 38 V Sem (CSE / ISE) . Explain EXISTS and GROUP BY Functions in SQL . The EXISTS function in SQL is used to check whether the result of a correlated nested Module-3 ee ypes for SQL? Expatin Ateibute Dae TYPE yor nuinbers of Various sizes ¢ Numeric data types i gepoint (real) numbers of various INT) and floating-poin! pre ae SCISION). Formatted number REAL, and DOUBLE PRECISION). I ie , the preaige DECIMAL(,)—or DEC( i here 1, the presi number of decimal digits and , the seale, is the number of digits afer ihe, ; ng data typesare either fixed length-CHAR (1) or CHAR Ac eg nis the number of characters-or varying length-VARCHAR (1) or CHAR vane or CHARACTER VARYING (7, where isthe maximum numberof charge Ny Bit-string data types are either of fi d length n—BIT \(n)~or Varying ley | VARYING(n), where 71is the maximum number of bits. Bhp Boolean datatype has the traditional values of TRUE or FALSE, In sqy, wal the presence of NULL values, a three-valued logic is used, a third POSSIbIe Valyy a Boolean data type is UNKNOWN. : icy The DATE data type has ten positions, and its components are YEAR, DAY in the form YYYY-MM-DD. The TIME data type has at least eigh the components HOUR, MINUTE, and SECOND in the form HH:MM: A timestamp data type (TIMESTAMP) includes the DATE and TIME fe minimum of six positions for decimal fractions of seconds and an optional WI ZONE qualifier. M, MONTH g t Positions, Sst ds, plus ITHTINE (08 mark query is empty (contains no tuples) or not. The result of EXISTS is a Boolean vd TRUE if the nested query result contains at least one tuple, or FALSE if the nested qy result contains no tuples. Example: SELECT E.Fname, E.Lname FROM EMPLOYEE AS E WHERE EXISTS ( SELECT * FROM DEPENDENT AS D AND E.Fname=D.Depenilent_name); GROUP BY : The relation is partitioned into nonoverlapping, subsets (oF erp {uples. Each group (partition) will consist of the tuples that have the same value o™ attribute(s), called the grouping attribute(s). Group by function can be applied such group independently to produce summary information about each gfouP- The GROUP BY clause specifies the grouping attributes, which should as or the SELECT clause, so thatthe value resulting from applying each aggreest fi a group of tuples appears along with the value of the grouping attribute(s)- yes Example: For each department, retrieve the department number, the number of€™ in the department, and their average salary, SELECT Dro, COUNT (*), AVG (Salary) FROM EMPLOYEE, GROUP BY: Dno; toes Sunstar Exat| _ a, Explain the Classification of drive ans. DF Ans, The thre : rs in JDBC? vers in JDBC are cla.ssified into four yee ec (08 marks) between the application and the data soln ‘pending onthe architectural relationship # Type I Bridges: This type of driver translate ne : of another API that isnot native to Fe DENG function calls into function calls An example is a JDBC-ODBC bridge, " An application cai! use JDBC calls 0 access application loads only one driver, te brid Bri es have the advantage itis easy to piggyback the application onto an isting installation, and no new drivers have to be installed. One drawback ig incrensed number of layers between data source and application affects performance, : @ Type HI Direct Translation ¢ ive API via Non-Java Driver: This type of driver translates JDBC function calls directly into method! invocations of the API of one specific data source, The driver is written using a combin: specific to the data source, This arch ODBC bridge. One disadvantage is that the database driver that implements the API needs to be installed on each computer that runs the application, @ Type HI Network Bridges: The driver talks over a network to a middleware server that translates the JDBC requests into DBMS-specific method invocations. In this case, the driver on the client site is not DBMS-specific, The JDBC driver loaded by the application can be quite small, as the only functionality it needs to implement is sending of SQL statements to the middleware server. ‘The middleware server can then use a Type II JDBC driver to connect to the data source. ® Type IV-Direct Translation to the Native API via Java Driver: Instead of calling the DBMS API directly, the driver communicates with the DBMS through Java sockets. In this case, the driver on the client side is written in Java, but it is DBMS-specific. Ittranslates JDBC calls into the native API of the database system. This solution does not require an intermediate layer, and since the implementation is all Java, its performance is usually quite good. an ODBC compliant data source. The tation of C+ and Java. It is dynamically linked and hitecture performs significantly better than a JDBC- b. Briefly explain the advantages of the Three-Tier Architecture (08 marks) -tier architecture has the following advantages: © Heterogeneous Systems: Applications can utilize the strengths of different platforms and different software components at the different tiers. It is easy to modify or replace the code at any tier without affecting the other tiers. © Thin Clients: Clients only need enough computation power for the presentation layer. Clients are Web browsers. © Integrated Data Access: In many applications, the data must be accessed from several sources. This can be handled transparently at the middle tier, where we can centrally manage connections to all database systems involved. Buster Exam Scanner 39V Sew (CSE / Ist) © Scalability to Many Clients: Each client is lightweight and al] Access | eee = iddle tier. The middle tier can share database gg, ‘the is through the middle tier. : fe ee ana if the middle tier becomes the bottle-neck, we can depig ‘ i cet athe nde tier code. Clients can connect to anyone of he pe ex ee . sic is designed appropriately. 7 a See pealapuieal Benefits: By dividing the application cleanly into adress presentation, data access, and business logic, we gain many advay business logic is centralized, and is therefore easy to maintain, debuy Teracton between tes oceurs through well-defined, standardized api each application tier can be built out of reusable components that can be if hig’ | developed, debugged, and tested. . : Module-4 Book_title | Auth_name | Book_type | Listprice | Affiliation Publ] FD'S {Book _{itle->Book_type, Publication | Auth_name>Listprice} What normal form is the relation in? explain your answer. Apply normalizia| until you cannot decompose the relations further. State the reasons behinil eg, decomposition.? (O8mary © The relation is in INF and not in 2NF as no attributes are fully functionally dept on the key (BookTitle and AuthorName). It is also not in 3NF. © The relation is not in 2NF because: Book Title Publisher, BookType BookType —sListPrice AuthorName Author fliliation © Thus, these attributes are not fully functionally dependent on the primary key. TH 2NF decomposition will eliminate the partial dependencies, © 2NF decomposition: Book (BookTitle, AuthorName) Book2(BookTitle, BookType, ListPrice, Publisher) Book3(AuthorName, Author fiiliation) © The relations are not in 3NF because: BookTitle + BookType — ListPrice © Thus, BookType is feither a k prime attribute. . © The 3NF decomposition will © 3NF decomposition: «price i ey itself nor a subset of a key and ListPri sii eliminate the transitive dependency of List" Book (BookTitle, AuthorName) Book2A(BookTitle, BookType, Publisher) Book2B(BookType, ListPrice) Book3(AuthorName, AuthorA ffiliation) 40 - Sunskar Exe> Y in F+17 X is a superkey for R. © Anall-key relation is always in BCNF since it has no FDs. © Anall-key relation such as the EMP relation, which has no FDs but has the MVD Ename—— Pname | Dname, is not in 4NF. © Arclation that is notin 4NF due to a nontrivial MVD must be decomposed to convert it into a set of relations in 4NF. © The decomposition removes the redundancy caused by the MVD. A multivalued dependency X>—Y specified on relation schema R, where X and Y are both subsets of R, specifies the following constraint on any relation state r of R: If two tuples /1 and /2 exist in r such that (1[X] = 2[X], then two tuples 3 and /4 should also exist in r with the following properties, 15 where we use Z to denote (R= (XU): © BUX)= 41x] =X) = 201. © 6B[Y] =A] and 4[Y] © B[Z]=2[Z] and ¢4[Z] ? (08 marks) ee Rn}, specified on relation schema Ne constraint states that every legal state =e Ps 41 Suistar Exam ScannerV Senv (CSE / ISE) Module-5 ion should be atomic? 9. a. Explain why a transaction exe sth following (ACID) properties: Transaction several properties. These are often calle the ACID properties, adh ng cnforved by the concurrency control and recovery me re Dany are the ACID properti 1. Atomicity: citirely oF ot per tion is an atomic unit of processing; itis either Perfo, rmed at all. a ; / medi 2. Con preservation: A transaction is consistency preserving itis cong ex ition take(s) the database from one consistent state to another, hte 3. Isolation: A transaction should appear as though itis being executed in isolation other transactions. That i, the execution of a transaction should not be interteed any other transactions executing concurrently. . y ‘lity or p 4. Dur: maneney: The changes applied to the database by 2 coi (ransaction must persist'in the database. These changes must not be lost because Ofay failure, : The atomicity property requires that we execute a transaction to com Tesponsibility of the transaction recovery subsystem of a DBMS to en: a transaction fails to complete for some reason, transaction execution, the recovery technique m on the database, Pletion, Ii SUE atomic. such as a system crash in the midst lust undo any effects of the transaction b. What is schedule’ lity. Ans. A schedule (or histor of the transactions. schedule S, : Two operations in a sche ontlict if they satisfy all three ofthe follvét conditions: (1) they belong to different transactions; (2) they access the same iten 1a (3) at least one Of the operations is a write item(X). Testing Conflict Serializability of a Schedule ; 1, For each transaction 7) Daricipating in schedule 5, create a node labeled iat Precedence graph, ‘ 2, For each ease in.$ where 7 executes Create an edge (7j> Tj) in the precede 3. For each case in § where Texe create an edge (7:37) inthe Precedence graphs ie 4 Foreach case in.§ where 1) executes a write_item(X) after Ti executes a wit! create an edge (7i-> 7) in the Precedence graph, schedule § is Serializable ifand only if the precedence graph has no cycles: ? Explain the algorithm which is used to test a schedule for confi (08 marks) + Tris an ordering of the operas insactions can be interleaved inte ry) S of m transactions T1, 72, . Operations from different tra ‘dule are said to e se iter @read_item(X) after 77 executes a write i nce graph, <éieeOR cuss the problems of deadl g. Discuss Uy ‘adlock and staryati dealing with these problems, vation, and the different approaches to ays. Deadlock occurs when each transaction Pn (08 marks) sr some item that is locked by some other aneseaan os ete transactions is waiting he set lock pre ; p hich is use requites that every transaction lock all the items i obtained, none ofthe items are locked, Rather the to lock all the items it needs. A second proton) ordering all the items in the databas several items will lock them according revent deadlock i ¢ pr k is to use a deat vention protocol, dl in conservative two-phase locking, heeds in if any of the items cannot be transaction waits and then tries again Protocol, which also limits concurrency, involves i" and ee sure that a transaction that needs (0 that order. This i 1 is ava ofthe chosen ore ofthe items which sao tore he ae Another group of protocols that prevent deadlock do not require timestamps. These include the no waiting (NW) and cautious waiting (CW) algorithms : Inthe no waiting algorithm, if a transaction is unable to obtain alock, it is immediately aborted and then restarted aftera certain time delay without checking whether a deadlock will actually occur or not. : The cautious waiting algorithm was proposed to try to reduce the number of needless aborts/restarts. Suppose that transaction 77 tries to lock an item X but is not able to do so because 1’is locked by some other transaction 7j with a conflicting lock. Another problem that may occur when we use locking is starvation, which occurs when a transaction cannot proceed for an indefinite period of time while other transactions in the system continue normally. One solution for starvation is to have a fair waiting scheme, such as using a first-come- first-served queue; transactions are enabled to lock an item in the order in which they originally requested the lock. Another scheme allows some transactions to have priority over others but increases the priority ofa transaction the longer it waits, until it eventually gets the highest priority and proceeds. | b. Explain two multiversion techniques for concurrency control, (08 marks) | Ans. i, Multiversion Technique Based on Timestamp Ordering In this method, several versions XI, X2...Xk of each data item X are maintained. For each version, the value of version Xi and the following two timestamps are kept: 1, read_TS(Xi). The read timestamp of X7 is the largest of all the timestamps of transactions that have successfully read version Xi. I 2. write TS(X/). The write timestamp of X7 is the timestamp of the transaction that wrote the value of version Xi. Whenever a transaction Tis allowed to execute a write_item(X) operation, a new version t A+! of item Xis created, with both the write_TS(XE+1) and the read_TS(XF+1) set to TS(Z). Correspondingly, when a transaction 'is allowed to read the value of version Xi, the.valug of read_TS(%%) is set.to the larger of the current read_TS(Xi) and TS(7). ii, Multiversion Two-Phase Locking Using Certify Locks {In this multiple-mode locking scheme, there are three locking modes for an item: read, Write, and certify. 2 Exam’ Scanner . 43

You might also like

• DBMS Organizer 2024 by Aniruddha Adak

  

  No ratings yet

  DBMS Organizer 2024 by Aniruddha Adak

  160 pages
• Dbms Module 1 Questions With Answers

  

  No ratings yet

  Dbms Module 1 Questions With Answers

  7 pages
• CHAPTER 1 Intro - Databases

  

  No ratings yet

  CHAPTER 1 Intro - Databases

  29 pages
• BCS403-Database Management System-DBMS Module 1

  

  100% (4)

  BCS403-Database Management System-DBMS Module 1

  39 pages
• 2 Marks (DBMS)

  

  No ratings yet

  2 Marks (DBMS)

  11 pages
• DBMSit

  

  No ratings yet

  DBMSit

  282 pages
• DBMS - 2 Marks

  

  No ratings yet

  DBMS - 2 Marks

  19 pages
• RDBMS Unit1

  

  No ratings yet

  RDBMS Unit1

  46 pages
• Database Guide

  

  0% (1)

  Database Guide

  63 pages
• DBMS Mod 1

  

  No ratings yet

  DBMS Mod 1

  241 pages
• DBMS Mod1

  

  No ratings yet

  DBMS Mod1

  132 pages
• CT1 Answer Key

  

  No ratings yet

  CT1 Answer Key

  7 pages
• Im Final

  

  No ratings yet

  Im Final

  38 pages
• Database System

  

  No ratings yet

  Database System

  79 pages
• Dbms Module1-Part1

  

  No ratings yet

  Dbms Module1-Part1

  27 pages
• CST204 Module 1 DBMS

  

  No ratings yet

  CST204 Module 1 DBMS

  52 pages
• ESIA Study

  

  No ratings yet

  ESIA Study

  28 pages
• DBMS Full

  

  No ratings yet

  DBMS Full

  32 pages
• Lecture03 - IDB - Fall 24-25

  

  No ratings yet

  Lecture03 - IDB - Fall 24-25

  21 pages
• Patuakhali Science and Technology University: Assignment On

  

  No ratings yet

  Patuakhali Science and Technology University: Assignment On

  15 pages
• Two Marks

  

  No ratings yet

  Two Marks

  29 pages
• DBMS Chap1

  

  No ratings yet

  DBMS Chap1

  60 pages
• Lecture03 IDB

  

  No ratings yet

  Lecture03 IDB

  21 pages
• Module 1

  

  No ratings yet

  Module 1

  75 pages
• Unit 1 1

  

  No ratings yet

  Unit 1 1

  36 pages
• Dbms Module 1 Notes

  

  No ratings yet

  Dbms Module 1 Notes

  19 pages
• Dbms Mod 1

  

  No ratings yet

  Dbms Mod 1

  11 pages
• Dbms Question Bank2 Marks 16 Marks

  

  No ratings yet

  Dbms Question Bank2 Marks 16 Marks

  31 pages
• DBMS Unit-1

  

  No ratings yet

  DBMS Unit-1

  75 pages
• Lecture 1 PDF

  

  No ratings yet

  Lecture 1 PDF

  40 pages
• Question Bank

  

  No ratings yet

  Question Bank

  85 pages
• IGNOU MCS-23 Solved Question Exam Preparation

  

  No ratings yet

  IGNOU MCS-23 Solved Question Exam Preparation

  40 pages
• DBMS Organizer 2023

  

  No ratings yet

  DBMS Organizer 2023

  160 pages
• CST 204

  

  No ratings yet

  CST 204

  57 pages
• Week 1 Tutorial

  

  No ratings yet

  Week 1 Tutorial

  7 pages
• 1-Need For Database Systems Characteristics of Database Approach Actors in DBMS Dat

  

  No ratings yet

  1-Need For Database Systems Characteristics of Database Approach Actors in DBMS Dat

  23 pages
• 1

  

  No ratings yet

  1

  145 pages
• Lecture03 IDB

  

  No ratings yet

  Lecture03 IDB

  21 pages
• DBMS 1

  

  No ratings yet

  DBMS 1

  12 pages
• Module1 DBMS

  

  No ratings yet

  Module1 DBMS

  116 pages
• DBMS Unit 1

  

  No ratings yet

  DBMS Unit 1

  76 pages
• DBMS Hints Final

  

  No ratings yet

  DBMS Hints Final

  59 pages
• Chapter 1. INTRODUCTION TO DBMS

  

  No ratings yet

  Chapter 1. INTRODUCTION TO DBMS

  25 pages
• DBMS 2 Marks

  

  No ratings yet

  DBMS 2 Marks

  30 pages
• Chapter 1. INTRODUCTION TO DBMS

  

  No ratings yet

  Chapter 1. INTRODUCTION TO DBMS

  23 pages
• Chapter 1 Continuation

  

  No ratings yet

  Chapter 1 Continuation

  7 pages
• Chapter 1

  

  No ratings yet

  Chapter 1

  10 pages
• Unit I Part 1

  

  No ratings yet

  Unit I Part 1

  41 pages
• MM 1

  

  No ratings yet

  MM 1

  13 pages
• Dbms Intro

  

  No ratings yet

  Dbms Intro

  34 pages
• DBMS 53617 Scheme

  

  No ratings yet

  DBMS 53617 Scheme

  7 pages
• CS 105.3 Database Management Systems

  

  No ratings yet

  CS 105.3 Database Management Systems

  6 pages
• Review Question CH

  

  No ratings yet

  Review Question CH

  6 pages
• Chapter 1 Databases and Database Users Data

  

  No ratings yet

  Chapter 1 Databases and Database Users Data

  8 pages
• Chapter 1 Databases and Database Users Data

  

  No ratings yet

  Chapter 1 Databases and Database Users Data

  8 pages
• DBMS 3 Module

  

  No ratings yet

  DBMS 3 Module

  55 pages
• Dbms (Cse201) Theory Notes: Primary Key

  

  No ratings yet

  Dbms (Cse201) Theory Notes: Primary Key

  18 pages
• Database Management System Introduction

  

  No ratings yet

  Database Management System Introduction

  23 pages