3i Infotech Papers: Sample Questions 712 - 714 of 1245

Examrace Placement Series prepares you for the toughest placement exams to top companies.

Question number: 712

» Database » Oracle



What do you mean by CHECK BOX?


Choice (4) Response


One state control


Three state control


Two state control


None of the above




  • Checkbox is a two state control- either checked or unchecked

  • The checkbox contains an empty value null when it is not checked

  • We can create checkbox as items, or we can create checkbox in reports.

  • It works similarly to a list of values.

  • When we define an item to a check box, we need to provide the check box value in the list of values.

Question number: 713

» Basic CS » Networks

Short Answer Question▾

Write in Short

What is virtual path?


  • Virtual path is a virtual channel beam providing semi-permanent connections.

  • It provides a data communication identifier to uniquely identify a network path allowing an asynchronous transfer mode cell packet to reach its destination node.

  • Virtual path identifiers are composed of 8 - 16 bit numeric headers in ATM cell packets.

  • Virtual path connection are concatenation of one or more virtual paths.

  • Virtual path headers tell the switches where to route the packet.

Question number: 714

» Database » MySQL

Essay Question▾

Describe in Detail

What do you understand by dependency preservation?


Understanding of dependency preservation.

Understanding of Dependency Preservation.

Understanding of dependency preservation.

  • A decomposition of a relation R into is dependency preserving decomposition with respect to the set of functional dependencies F that hold on R only if the following is hold:


    - Sets of functional dependencies of relations.

    - Closure of union of all sets of functional dependencies.

    - Closure of set of functional dependency

    • If the closure of set of functional dependencies of individual relations are equal to the set of functional dependencies of the main relation R, then we would say the decomposition D is lossless dependency preserving decomposition.

  • Example:

    Decomposition of

    Does this decomposition preserve the given dependencies?

  • Solution:

In the following dependencies hold:

In the following dependencies hold:

In all the original dependencies occur,

So, this decomposition preserves dependencies.