Software Architecture

Question 1

 

In B-tree file organization, the highest number of item can be placed in leaf node is 

Select one:

a. n-1 

b. (n-1)/2

c. n/2

d. n.

The correct answer is: n-1

Question 2

 

In RDBMS which data structure used in the internal storage representation?

Select one:

a. Hash table 

b. B tree

c. B+ tree 

d. Linked list .

The correct answer is: B+ tree

Question 3

 

If we are accessing a block index using binary index using binary search, how many block read is required to access the data in 100 blocks?

Select one:

a. 100

b. 7 

c. 6

d. 10.

The correct answer is: 7

Question 4

 

Which of the following is true?

Select one:

a. A file can have at least one primary index or at least one clustering index

b. A file can have at most one primary index or at most one clustering index 

c. A file can have both primary index and clustering index 

d. None of them .

The correct answer is: A file can have at most one primary index or at most one clustering index

Question 5

 

Two discs are called mirrors of each other if 

Select one:

a. They share the same address space in the main memory 

b. They hold indentical copies of data   

c. They contain blocks of a single file 

d. The second disk in the continuation of the first .

The correct answer is: They hold indentical copies of data  

Question 6

 

A recoverable schedule is one where (pair of transaction Ti  and Tj  )

 

Select one:

a. Ti read the data item written by Tj 

b. Tj read the data item written by Ti

c. Ti  and Tj reads the data item  

d. Ti  and Tj write the data item .

The correct answer is: Tj read the data item written by Ti

Question 7

 

In two phase locking protocol in growing phase 

Select one:

a. None of them 

b. Transaction may obtain lock as well as release lock 

c. Transaction may release lock but may not obtain lock 

d. Transaction may obtain locks but may not release  .

The correct answer is: Transaction may release lock but may not obtain lock 

Question 8

 

Lock point of transaction occurs when 

Select one:

a. None of them 

b. Transaction release all lock 

c. Transaction gets first lock 

d. Transaction gets it's final lock  .

The correct answer is: Transaction gets it's final lock 

Question 9

 

In Strict two phase locking protocol 

Select one:

a. All exclusive mode locks taken by transaction can be released before transaction commits 

b. All locks can be released before transaction commits 

c. All exclusive mode lock taken by transaction be held until transaction commits 

d. None of them .

The correct answer is: All exclusive mode lock taken by transaction be held until transaction commits

Question 10

 

In rigorous two phase locking 

Select one:

a. Only exclusive mode locks are released before transaction commits

b. All locks can held before transaction commits  

c. All locks are released before transaction commits 

d. None of them .

The correct answer is: All locks can held before transaction commits 

Question 11

 

Lock point of a schedule indicates 

Select one:

a. Initial lock of the schedule

b. Final lock of the schedule   

c. None of them 

d. There is no term lock point .

The correct answer is: Final lock of the schedule  

Question 12

 

Index consists of 

Select one:

a. 1) a list of key 

b. none of them 

c. 2) pointer to the records 

d. both 1 and 2  .

The correct answer is: both 1 and 2 

Question 13

 

Cascading rollback can be avoided by 

Select one:

a. Cannot be avoided 

b. Can be avoided but there is no actual protocol

c. Strict two phase locking protocol 

d. Two phase locking protocol .

The correct answer is: Strict two phase locking protocol

Question 14

 

In lock conversion what is true?

 

Select one:

a. Lock conversion can be allowed arbitrarily 

b. Upgrade and downgrade cannot be possible 

c. Upgrade can be done in growing phase and downgrading in shrinking phase  

d. Upgrade can be done in shrinking phase and downgrading in shrinking phase .

The correct answer is: Upgrade can be done in growing phase and downgrading in shrinking phase 

Question 15

 

In vigorous two phase locking protocol a transaction 

Select one:

a. Release exclusive locks only at the end of transaction

b. acquired all exclusive locks at the beginning of transaction  

c. release all locks only at the beginning of transaction 

d. acquired all locks at the beginning of transactions .

The correct answer is: release all locks only at the beginning of transaction 

Question 16

 

Which one of the following is key factor for preferring B+  trees to binary search trees for indexing database relations ? 

Select one:

a. Data transfer from disk is in blocks 

b. B+ trees require less memory than binary search trees

c. Database relations have a large number of records

d. Database relations are sorted on the primary key  .

The correct answer is: Data transfer from disk is in blocks

Question 17

 

Consider B+ tree in which the maximum number of keys in a node is 5. what is the minimum number of keys in any non-root node ?

Select one:

a. 1

b. 4

c. 3

d. 2 .

The correct answer is: 2

Question 18

 

Which of the following concurrency control protocols ensure both conflict serializability and freedom from deadlock?

I. 2-phase Locking 

II. Time-stamp ordering 

Select one:

a. I only 

b. Both I and II 

c. Neither I and II

d. II only  .

The correct answer is: II only 

Question 19

 

Consider the following statements 

S1: look up operation in B tree takes constant time

S2: look up operation in B+ tree takes constant time 

Select one:

a.  S1 and S2 are  false 

b.  S1 and S2 are  true

c. S1 is true S2 is false 

d. S2 is true, S1 is false .

The correct answer is: S2 is true, S1 is false 

Question 20

 

Though index speed up the searching, we don't keep search key value for every record because  

Select one:

a. None of the above 

b. Both the statement A and B are True   

c. A) every search key value add up additional CPU time

d. B) Each search key value requires additional storage space .

The correct answer is: Both the statement A and B are True  

Question 21

 

Main advantage of B- tree is to 

Select one:

a. Reduce redundant storage of search key value 

b. Reduce searching time  

c. None of the above 

d. Increase throughput of the system .

The correct answer is: Reduce redundant storage of search key value 

Question 22

 

Flash memory is 

Select one:

a. Both A and B are true 

b. None of them 

c. A) Volatile 

d. B) Non-Volatile  .

The correct answer is: B) Non-Volatile 

Question 23

 

In sequential file organization, if a record is not fit in free space then the record is placed in 

Select one:

a. Overflow block  

b. None of them

c. First block 

d. Last block .

The correct answer is: Overflow block 

Question 24

 

In dense index, index record contains

Select one:

a. A search key value and a pointer to the first record

b. None of them  

c. Smallest search key value and a pointer to the first location

d. Longest search key value and a pointer to least record.

The correct answer is: A search key value and a pointer to the first record

Question 25

 

Main difference between B+  tree and B tree index file is 

Select one:

a. None of the above

b. B tree eliminates the redundant storage of search key value  

c. B tree takes constant time for look up operation 

d. B tree contains redundant search key  .

The correct answer is: B tree eliminates the redundant storage of search key value