PREVIOUS YEAR SOLVED PAPERS - July 2016 Paper 3

6. In _____ method, the word is written to the block in both the cache and main memory, in parallel.

  • Option : A
  • Explanation :
    In write through method, the word is written to the block in both the cache and main memory, in parallel and in write back method the word is written to the block in cache but actual update into the corresponding location in main memory only at specified intervals or under certain conditions. In Write Protected cache policy word cannot be modified or deleted. In direct mapping block M of main memory maps into block M modulo n of the cache, where n is the total number of blocks in cache. So, option (A) is correct.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


7. Which of the following statements concerning Object-Oriented databases is FALSE?

  • Option : C
  • Explanation :
  • Objects in an object-oriented database contain not only data but also methods for processing the data.Correct
  • Object-oriented databases store computational instructions in the same place as the data.Correct
  • Object-oriented databases are more adapt at handling structured (analytical) data than relational databases.Incorrect
  • Object-oriented databases store more types of data than relational databases and access that data faster.Correct
  • So, option (C) is correct.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


8. In distributed databases, location transparency allows for database users, programmers and administrators to treat the data as if it is at one location. A SQL query with location transparency needs to specify:

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


9. 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 the column B in table R. One can determine that:

Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


10. Which of the following statements is TRUE?
D1 : The decomposition of the schema R(A, B, C) into R1(A, B) and R2 (A, C) is always lossless.
D2 : The decomposition of the schema R(A, B, C, D, E) having
AD → B,
C → DE,
B → AE and
AE → C,
into R1 (A, B, D) and R2 (A, C, D, E) is lossless.

  • Option : D
  • Explanation :
    only D2 is True because AD is key and present in both the tables. D1 is not always true because FD’s not given and if we take B->A and C->Athen it is lossy decomposition because no common attributes contain key from one of the table.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *


Related Quiz.
July 2016 Paper 3