PowerPoint Presentation

[Audio] A relational database environment has all of the following components except Q1 a Users a Separate files b Database c Query language d SSC SA 2017 | ACF And Forest Range Officer Gr-I.

[Audio] Database Query language a Users a Separate files b c d Answer: b) Separate files In a relational database environment, data is stored in a single integrated database (in related tables), not in separate files. The key components are Users, Database (the actual data), and Query language (e.g., SQL). SSC SA 2017 | ACF And Forest Range Officer Gr-I.

[Audio] Which clause represents a Cartesian-product operation in a basic structure of an SQL expression? Q2 From as a Select a Where b c d ACF And Forest Range Officer Gr-I.

[Audio] From as a Select a Where b c d Answer: c) From In SQL, the FROM clause specifies the tables involved in a query. When multiple tables are listed in the FROM clause without a join condition, SQL performs a Cartesian product meaning every row of one table is combined with every row of the other table. ACF And Forest Range Officer Gr-I.

[Audio] Which of the join operations do not preserve non matched tuples? Q3 a Left Outer Join a Right Outer Join b c Inner Join Full Outer Join d ACF And Forest Range Officer Gr-I.

[Audio] Which of the join operations do not preserve non matched tuples? Inner Join Full Outer Join a Left Outer Join a Right Outer Join b c d Answer: c) Inner Join An Inner Join only returns rows where there is a match between the tables being joined. If there is no match, those rows are excluded from the result. Therefore, non-matched tuples are not preserved in an Inner Join ACF And Forest Range Officer Gr-I.

[Audio] Q4 Which of the following is a procedural language ? a tuple relational calculus a domain relational calculus b c relational algebra None of these d ACF And Forest Range Officer Gr-I.

[Audio] Which of the following is a procedural language ? relational algebra None of these a tuple relational calculus a domain relational calculus b c d Answer: c) relational algebra Relational Algebra is a procedural query language because it specifies how to obtain the result step by step. Tuple & Domain Relational Calculus are non-procedural languages because they specify what result is needed, not the procedure to get it. ACF And Forest Range Officer Gr-I.

[Audio] A B+ tree index is to be built on the attribute of the relation with length 8 bytes. The disk blocks are of size 512 bytes and index pointer is of size 4 bytes. What could be the optimal degree of the B+ tree ? Q5 a 43 a 17 b c d ACF And Forest Range Officer Gr-I | GATE 2002 | UGC 2012.

[Audio] Introduction of B+ Tree - GeeksforGeeks Introduction of B+ Tree - GeeksforGeeks A B+ tree index is to be built on the attribute of the relation with length 8 bytes. The disk blocks are of size 512 bytes and index pointer is of size 4 bytes. What could be the optimal degree of the B+ tree ? Q5 15 18 a 43 a 17 b c d Answer: a) (43) 4(x+1) + 8x <= 512 x = 42 => No. of degree = No of child = Order = x+1=42+1=43 ACF And Forest Range Officer Gr-I | GATE 2002 | UGC 2012.

[Audio] When user create views, they are part of which schema? Q6 a Virtual a Conceptual b c External Internal d ACP (Dy. Director) 2011.

[Audio] Introduction of B+ Tree - GeeksforGeeks Introduction of B+ Tree - GeeksforGeeks When user create views, they are part of which schema? Q6 External Internal a Virtual a Conceptual b c d Answer: c) (External) When users create views, they define customized ways of seeing data without changing the actual database structure. Therefore, views belong to the External Schema. ACP (Dy. Director) 2011.

[Audio] A stored program that is attached to a table or a view is called? Q7 a Embedded SELECT Statement a Trigger b c System file Virtual file d ACP (Dy. Director) 2011.

[Audio] Introduction of B+ Tree - GeeksforGeeks Introduction of B+ Tree - GeeksforGeeks A stored program that is attached to a table or a view is called? Q7 System file Virtual file a Embedded SELECT Statement a Trigger b c d Answer: b) (Trigger) A trigger is a stored program that is automatically executed when certain events (such as INSERT, UPDATE, or DELETE) occur on a table or view. ACP (Dy. Director) 2011.

[Audio] When using cursors in embedded SQL, what is the first step you must take before you can retrieve data through that cursor? Q8 a Fetch the cursor a Declare the cursor b c Close the cursor Open the cursor d ACP (Dy. Director) 2011.

[Audio] Introduction of B+ Tree - GeeksforGeeks Introduction of B+ Tree - GeeksforGeeks When using cursors in embedded SQL, what is the first step you must take before you can retrieve data through that cursor? Q8 Close the cursor Open the cursor a Fetch the cursor a Declare the cursor b c d Answer: b) (Declare the cursor) Before retrieving data through a cursor, you must first declare the cursor, which defines the SQL query associated with it. ACP (Dy. Director) 2011.

[Audio] Q9 Locks which are placed by DBMS are called? a Shared locks a Exclusive locks b c Implicit locks Explicit locks d ACP (Dy. Director) 2011.

[Audio] Introduction of B+ Tree - GeeksforGeeks Introduction of B+ Tree - GeeksforGeeks Q9 Locks which are placed by DBMS are called? Implicit locks Explicit locks a Shared locks a Exclusive locks b c d Answer: c) (Implicit locks) Implicit locks are automatically placed by the DBMS without the user explicitly requesting them. They help maintain data consistency and concurrency control.. ACP (Dy. Director) 2011.

[Audio] Armstrong's axioms Rule A. Reflexivity 1. If α → β holds and γβ → δ holds, then αγ → δ holds B. Augmentation 2. If α → βγ holds and α→ β holds and α → γ holds C. Transitivity 3. If α → β holds and β→ γ holds , then α → γ holds D. Pseudotransitivity 4. If α is a set of attributes and β ⊆ α , then α → β holds E. Decomposition 5. If α → β holds and γ is a set of attributes, then γα → γβ holds Q10 a A-4, B-5, C-3, D-1, E-2 a A-5, B-2, C-3, D-2, E-1 b A-4, B-3, C-5, D-2, E-1 c A-1, B-3, C-2, D-4, E-5 d ACP (Dy. Director) 2011.

[Audio] Introduction of B+ Tree - GeeksforGeeks Introduction of B+ Tree - GeeksforGeeks Armstrong's axioms Rule A. Reflexivity 1. If α → β holds and γβ → δ holds, then αγ → δ holds B. Augmentation 2. If α → βγ holds and α→ β holds and α → γ holds C. Transitivity 3. If α → β holds and β→ γ holds , then α → γ holds D. Pseudotransitivity 4. If α is a set of attributes and β ⊆ α , then α → β holds E. Decomposition 5. If α → β holds and γ is a set of attributes, then γα → γβ holds Q10 A-4, B-3, C-5, D-2, E-1 A-1, B-3, C-2, D-4, E-5 a A-4, B-5, C-3, D-1, E-2 a A-5, B-2, C-3, D-2, E-1 b c d Answer: a) (A-4, B-5, C-3, D-1, E-2) . ACF And Forest Range Officer Gr-I.