- Option : B
- Explanation : Fro i=1: term = term * x / i = 1 * x / 1 = x. sum = sum + term = x. For i = 2: term = x * x / 2 = x
^{2}/ 2. sum = x + x^{2}/ 2. For i = 3: term = x2 / 2 * x / 3 = x^{3}/ 3! . sum = x + x^{2}/ 2 + x^{3}/ 3!. and so on... So, option (B) is correct.

You must be logged in to post a comment.

- Option : A
- Explanation :
- A publicly derived class is a subtype of its base class.
- Inheritance provides for code reuse. So, option (A) is correct.

You must be logged in to post a comment.

You must be logged in to post a comment.

14. Match the following database terms to their functions:

List I | List II |

(a) Normalization | (i) Enforces match of primary key to foreign key |

(b) Data Dictionary | (ii) Reduces data redundancy in a databae |

(c) Referential Integrity | (iii) Define view(s) of the database for particular user(s) |

(d) External Schema | (iv) Contains metadata describing database structure. |

- Option : B
- Explanation :
- Normalization reduces data redundancy in a database
- Data Dictionary contains metadata describing database structuredefines view(s) of the database for particular user(s)
- Referential Integrity enforces match of primary key to foreign key
- External Schema defines view(s) of the database for particular user(s)

So, option (B) is correct.

You must be logged in to post a comment.

You must be logged in to post a comment.

15. In general, in a recursive and non-recursive implementation of a problem (program) :

- A
Both time and space complexities are better in recursive than in non-recursive program.

- B
Both time and space complexities are better in non-recursive than in recursive program

- C
Time complexity is better in recursive version but space complexity is better in non-recursive version of the program.

- D
Space complexity is better in recursive version but time complexity is better in non-recursive version of the program.

- Option : B
- Explanation : In general, in a recursive and non-recursive implementation of a problem (program) both time and space complexities are better in non-recursive than in recursive program. In some program recursive implementation gives worst case scenario too. So, recursive implementation does not guarantee for best case all the time. So, optipon (B) is correct.

You must be logged in to post a comment.

You must be logged in to post a comment.

You must be logged in to post a comment.