1) A B+ tree can contain a maximum of 7 pointers in a node. What is the minimum number of keys in leaves?
Ans:3
2) A technique for direct search is
Ans: Hashing
3) A hash table can store a maximum of 10 records, currently there are records in location 1, 3,4,7,8,9,10. The probability of a new record going into location 2, with hash functions resolving collisions by linear probing is
Ans: 0.6
4) The goal of hashing is to produce a search that takes
Ans: O(1) time
5) A _________ consists of a sequence of query and/or update statements.
Ans: Transaction
6) The method in which records are physically stored in a specified order according to a keyfield in each record is
Ans: Hash
7) The relational model feature is that there
Ans: is much more data independence than some other database models.
8) ‘AS’ clause is used in SQL for
Ans: Rename operation
9) Relational calculus is a
Ans: Non-Procedural language
10) How many types of indexes are there in sql server?
Ans: 2
11) Which of the following is true?
Ans: B + tree allows rapid random access as well as rapid sequential access
12) B + tree allows rapid random access as well as rapid sequential access
Ans: commit
13) What is the purpose of the index in sql server?
Ans: All of the mentioned
14) In the relational modes, cardinality is termed as:
Ans: Number of tuples
15) In an E-R diagram attributes are represented by
Ans: ellipse
16) The way a particular application views the data from the database that the applicationuses is a
Ans: sub schema
17) ______ will undo all statements up to commit?
Ans: Rollback
18) A table on the many side of a one to many or many to many relationship must:
Ans: Have a composite key
19) The database environment has all of the following components except:
Ans: users
20) Cartesian product in relational algebra is
Ans: a Binary operator
21) Transaction processing is associated with everything below except
Ans: confirming an action or triggering a response.
22) The language which has recently become the defacto standard for interfacing application programs with relational database system is
Ans:SQL
23) The file organization that provides very fast access to any arbitrary record of a file is
Ans: Hashed file
24) How non clustered index point to the data?
Ans: It is used for pointing data rows containing key values
25) In a relational model, relations are termed as
Ans: Tables
