Description : In a relational model, relations are termed as (A) Tuples. (B) Attributes (C) Tables. (D) Rows.
Last Answer : (C) Tables
Description : The number of attributes in relation is called as its ..................... A) Cardinality B) Degree C) Tuples D) Entity
Last Answer : B) Degree
Description : The number of tuples in a relation is called its …………. While the number of attributes in a relation is called it’s ……………….. A) Degree, Cardinality B) Cardinality, Degree C) Rows, Columns
Last Answer : B) Cardinality, Degree
Description : Let E1 and E2 be two entities in E-R diagram with simple single valued attributes. R1 and R2 are two relationships between E1 and E2 where R1 is one-many and R2 is many-many. R1 and R2 do not have any ... are required to represent this situation in the Relational Model? (A) 4 (B) 3 (C) 2 (D) 1
Last Answer : (B) 3
Description : Let M and N be two entities in an E-R diagram with simple single vale attributes. R1 and R2 are two relationship between M and N, whereas R1 is one-to-many and R2 is many-to-many. The minimum number of tables required to ... and R2 in the relational model are .......... (1) 4 (2) 6 (3) 7 (4) 3
Last Answer : Answer: 4
Description : Based on the cardinality ratio and participation ............... associated with a relationship type, choose either the Foreign Key Design, the Cross Referencing Design or Mutual Referencing Design. (A) Entity (B) Constraints (C) Rules (D) Keys
Last Answer : (B) Constraints
Description : In a relational database model, NULL values can be used for all but which one of the following? (A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL. (B) To ... D) To fill a column in a tuple when that column does not really exist for that particular tuple.
Last Answer : (A) To allow duplicate tuples in the table by filling the primary key column(s) with NULL.
Description : Which of the following statements is FALSE about weak entity set ? (A) Weak entities can be deleted automatically when their strong entity is deleted. (B) Weak entity set avoids the data ... weak entity set are not partitioned according to their relationship with tuples in a strong entity set.
Last Answer : (D) Tuples in a weak entity set are not partitioned according to their relationship with tuples in a strong entity set.
Description : The relational model is based on the concept that data is organized and stored in two-dimensional tables called ………………………A) Fields B) Records C) Relations D) Keys
Last Answer : C) Relations
Description : An ER Model includes I. An ER diagram portraying entity types. II. Attributes for each entity type III. Relationships among entity types. IV. Semantic integrity constraints that reflects the business rules about data not ... ; IV (B) I&IV (C) I, II & IV (D) I & III
Last Answer : (A) I, II, III & IV
Description : The main task carried out in the …………… is to remove repeating attributes to separate tables. A) First Normal Form B) Second Normal Form C) Third Normal Form D) Fourth Normal Form
Last Answer : D) Fourth Normal Form
Description : How many rows and column will be there in the Cartesian product of the above given tables. Also mention the degree and cardinality -Technology
Last Answer : Cartesian Product:Number of Rows: 20Number of Columns: 9Degree: 9Cardinality: 20
Description : Spurious tuples may occur due to i. Bad normalization ii. Theta joins iii. Updating tables from join a) i& ii b) ii & iii c) i& iii d) ii & iii
Last Answer : a) i& ii b) ii & iii
Description : Consider the following ORACLE relations: R(A,B,C) = {, , , , ,< 3,1,4>} S(B,C,D) = {, , , , } Consider the following two SQL queries SQ1 and SQ2: SQ1: SELECT R.B, AVG(S.B) FROM R, S WHERE R.A = S.C AND S.D ... tuples returned by SQ2 then (A) M=4, N=2 (B) M=5, N=3 (C) M=2, N=2 (D) M=3, N=3
Last Answer : (A) M=4, N=2
Description : An instance of a relation is a time varying set of …………………. A) Tuples B) Rows C) Both of them D) None of them
Last Answer : C) Both of them
Description : What type of data is: a=[(1,1),(2,4),(3,9)]? a) Array of tuples b) List of tuples c) Tuples of lists d) Invalid type
Last Answer : b) List of tuples
Description : What is the output of the following code? >>> a=(2,3,4) >>> sum(a,3) a) Too many arguments for sum() method b) The method sum() doesn’t exist for tuples c) 12 d) 9
Last Answer : c) 12
Description : What is the output of the following piece of code when executed in Python shell? >>> a=("Check")*3 >>> a a) (‘Check’,’Check’,’Check’) b) * Operator not valid for tuples c) (‘CheckCheckCheck’) d) Syntax erro
Last Answer : c) (‘CheckCheckCheck’)
Description : What is the output of the following code? >>> a=(1,2,(4,5)) >>> b=(1,2,(3,4)) >>> a
Last Answer : a) False
Description : Suppose ORACLE relation R(A, B) currently has tuples {(1, 2), (1, 3), (3, 4)} and relation S(B, C) currently has {(2, 5), (4, 6), (7, 8)}. Consider the following two SQL queries SQ1 and SQ2 ... (A) 2 and 6 respectively (B) 6 and 2 respectively (C) 2 and 4 respectively (D) 4 and 2 respectively
Last Answer : (D) 4 and 2 respectively
Description : Consider the following database table : Create table test( one integer, two integer, primary key(one), unique(two), check(one≥1 and ≤10), check(two≥1 and ≤5) ); How many data records/tuples atmost can this table contain ? (A) 5 (B) 10 (C) 15 (D) 50
Last Answer : (A) 5
Description : Consider the following two commands C1 and C2 on the relation R from an SQL database: C1: drop table R; C2: delete from R; Which of the following statements is TRUE? I. Both C1 and C2 delete the schema for R. II. C2 ... R. (A) I only (B) I and II only (C) II and III only (D) I, II and III
Last Answer : (C) II and III only
Description : Explain various types of Relational constraints.
Last Answer : Relational Constraints Relational constraints are a set of rules. It is used to maintain the quality of information. Integrity constraints ensure that the data insertion, updating, and other ... - It establishes parent child relationship between two tables. For example :Foreign key constraints
Description : How are relationship between tables expressed in a relational database?
Last Answer : Tables are the basic building blocks of a relationaldatabase.
Description : Is it true or false that a relational database typically consists of related two dimensional tables?
Last Answer : Need answer
Description : A relational database management (RDBM) package manages datain morethan one file at once. How does itorganizethese file? As A. tables B. relations C. tuple D. both (a)and (b) E. None of the above
Last Answer : both (a)and (b)
Description : Which of the following describes a relational database? 1) It provides a relationship between integers 2) It consists of separate tables or related data 3) It retrieves data related to its queries 4) It provides a relationship between floats
Last Answer : 2) It consists of separate tables or related data
Description : The “PROJECT” operator of a relational algebra creates a new table that has always (A) More columns than columns in original table (B) More rows than original table (C) Same number of rows as the original table (D) Same number of columns as the original table
Last Answer : (C) Same number of rows as the original table
Description : Consider the following schemas: Branch = (Branch-name, Assets, Branch-city) Customer = (Customer-name, Bank-name, Customer-city) Borrow = (Branch-name, loan-number, customer account-number) Deposit = ... )) (C) πcustomer-name(σbalance> 10000(Borrow)) (D) σcustomer-name(σbalance> 10000(Borrow))
Last Answer : (A) πcustomer-name(σbalance> 10000(Deposit))
Description : Relational database schema normalization is NOT for: (A) reducing the number of joins required to satisfy a query. (B) eliminating uncontrolled redundancy of data stored in the database. (C) ... could otherwise occur with inserts and deletes. (D) ensuring that functional dependencies are enforced.
Last Answer : reducing the number of joins required to satisfy a query.
Description : Consider the following conditions : (a) The solution must be feasible, i.e. it must satisfy all the supply and demand constraints. (b) The number of positive allocations must be equal to m+n-1, where m is the number of rows and n is ... B) (a) and (c) only (C) (b) and (c) only (D) (a), (b) and (c)
Last Answer : (D) (a), (b) and (c)
Description : Which of the following is not a binary operator in relational algebra? A) Join B) Semi-Join C) Assignment D) Project
Last Answer : D) Project
Description : Which of the following is not a logical database structure? A) Chain B) Network C) Tree D) Relational
Last Answer : A) Chain
Description : A top-to-bottom relationship among the items in a database is established by a A) Hierarchical schema B) Network schema C) Relational Schema D) All of the above
Last Answer : A) Hierarchical schema
Description : In a relational schema, each tuple is divided into fields called A) Relations B) Domains C) Queries D) All of the above
Last Answer : B) Domains
Description : A relational database developer refers to a record as (A) a criteria. (B) a relation. (C) a tuple. (D) an attribute.
Last Answer : C) a tuple
Description : Cartesian product in relational algebra is (A) a Unary operator. (B) a Binary operator. (C) a Ternary operator. (D) not defined.
Last Answer : (B) a Binary operator.
Description : If D1, D2,…. Dn are domains in a relational model, then the relation is a table, which is a subset of (A) D1+D2+…. +Dn (B) D1x D2x… xDn (C) D1U D2U….UDn (D) D1- D2-….-Dn
Last Answer : (B) D1x D2x… xDn
Description : Which of the following is not a type of Database Management System? (A) Hierarchical (B) Network (C) Relational (D) Sequential
Last Answer : (D) Sequential
Description : Which of the following is true ? I. Implementation of self-join is possible in SQL with table alias. II. Outer-join operation is basic operation in relational algebra. III. Natural join and outer join operations are ... (B) II and III are correct. (C) Only III is correct. (D) Only I is correct.
Last Answer : (D) Only I is correct.
Description : Consider the relations R(A,B) and S(B,C) and the following four relational algebra queries over R and S: I. πA,B(R⋈S) II. R⋈πB(S) III. R∩(πA(R) Χ πB(S)) IV. πA,R.B(R Χ S) where R.B refers to ... IV are the same query. (C) I, II and IV are the same query. (D) I, III and III are the same query.
Last Answer : (D) I, III and III are the same query.
Description : Which of the following statements concerning Object-Oriented databases is FALSE? (A) Objects in an object-oriented database contain not only data but also methods for processing the data. (B ... Object-oriented databases store more types of data than relational databases and access that data faster.
Last Answer : (C) Object-oriented databases are more adapt at handling structures (analytical) data than relational databases.
Description : Which of the following statement(s) is/are FALSE in the context of Relational DBMS ? I. Views in a database system are important because they help with access control by allowing users to see only a particular subset of the data ... (B) III and IV only (C) I, II and III only (D) II, III and IV only
Last Answer : (D) II, III and IV only
Description : Consider the following statements regarding relational database model: (a) NULL values can be used to opt a tuple out of enforcement of a foreign key. (b) Suppose that table T has only one candidate key. If Q is in 3NF, then it is ... true. (C) (b) and (c) are true. (D) (a), (b) and (c) are true.
Last Answer : (D) (a), (b) and (c) are true.
Description : …………. Refer to the names of variables, functions, arrays, classes etc. created by the programmer. A) Keywords B) Identifiers C) Constraints D) Strings
Last Answer : B) Identifiers
Description : . ………………… is a special type of integrity constraint that relates two relations & maintains consistency across the relations. A) Entity Integrity Constraints B) Referential Integrity Constraints
Last Answer : B) Referential Integrity
Description : ………………… is preferred method for enforcing data integrity A) Constraints B) Stored Procedure C) Triggers D) Cursors
Last Answer : A) Constraints
Description : ……………. is a preferred method for enforcing data integrity A) Constraints B) Stored procedure C) Triggers D) Cursors
Description : In constraint satisfaction problem, constraints can be stated as . (A) Arithmatic equations and inequalities that bind the values of variables (B) Arithmatic equations and inequalities ... impose restrictions over variables (D) Arithmatic equations that discard constraints over the given variables
Last Answer : (A) Arithmatic equations and inequalities that bind the values of variables
Description : How many solutions are there for the equation x+y+z+u=29 subject to the constraints that x≥1, y≥2, z≥3 and u≥0? (A) 4960 (B) 2600 (C) 23751 (D) 8855
Last Answer : (B) 2600