3i Infotech Placement: Sample Questions 1235 - 1237 of 1245

Glide to success with Doorsteptutor material for competitive exams : get questions, notes, tests, video lectures and more- for all subjects of your exam.

Question 1235

Edit

Write in Short

Short Answer▾

What is Lossless join property?

Explanation

Understanding of Lossless Join
  • It guarantees that the spurious tuple generation does not occur with respect to relation schemas after decomposition.
  • If we decompose a relation R into relations R1 and R2,
    • Decomposition is lossy if
    • Decomposition is lossless if

Question 1236

Edit

Describe in Detail

Essay▾

What is Bandwidth?

Explanation

Define Bandwidth
  • Historically it refers to a range within a band of frequencies or wavelengths- A measure of the difference between the highest and lowest frequencies that a medium can transmit.
  • Now the more generally refers to amount of data that can be transmitted in a fixed amount of time.
  • Important for I/O devices.
  • Example a fast disk drive can be hampered by a bus with a low bandwidth.
  • One of the factors that affects network performance.
  • Bandwidth measured in:
    • bps - bits per second
    • kbps - kilobits per second
    • mbps- megabits per second

Question 1237

Question

MCQ▾

Of the following tree structure, which is, efficient considering space and time complexities?

Choices

Choice (4)

a.

Complete Binary Tree

b.

Incomplete Binary Tree

c.

Full Binary Tree

d.

All of the above

Answer

a.

Explanation

Complete or perfect Binary Tree

  • A binary tree in which every level, except possibly the last, is completely filled.
  • Generalization: Complete tree, binary tree.
  • Specialization: Binary heap, perfect binary tree.
Graph Shows the Complete Binary Tree
  • A complete binary tree has nodes at every depth k < n.
  • A complete binary tree of depth n has nodes.
  • Efficiently implemented as an array- a node at index i has children at indexes and and a parent at index , with 1-based indexing.
  • If child index is greater than the number of nodes, the child does not exist.

Developed by: