GATE (Graduate Aptitude Test in Engineering) Computer Science & IT (CS): Questions 1797 - 1802 of 3196

Choose Programs:

🎓 Study Material (1190 Notes): 2024-2025 Syllabus

Rs. 1000.00 -OR-

3 Year Validity (Multiple Devices)

Topic-wise Notes & SampleDetails

🎯 302 Numeric, 2894 MCQs (& PYQs) with Full Explanations (2024-2025 Exam)

Rs. 650.00 -OR-

3 Year Validity (Multiple Devices)

CoverageDetailsSample Explanation

Help me Choose & Register (Watch Video) Already Subscribed?

Passage

Answer based on the problem statement given below:

An organization needs to maintain database having five attributes . These attributes are functionally dependent on each other which functionally dependency set is given as: . Consider a universal relation with functional dependency set . Also all attributes are simple and take atomic values only.

Question 1797 (1 of 5 Based on Passage)

Appeared in Year: 2019

Question MCQ▾

Identify primary key of table with functional dependency set

Choices

Choice (4)Response

a.

A

b.

c.

d.

Edit

Question 1798 (2 of 5 Based on Passage)

Appeared in Year: 2019

Question MCQ▾

Minimal cover of functional dependency set is (December)

Choices

Choice (4)Response

a.

b.

c.

d.

Edit

Question 1799 (3 of 5 Based on Passage)

Appeared in Year: 2019

Question MCQ▾

Identify the redundant functional dependency in (December)

Choices

Choice (4)Response

a.

b.

c.

d.

Edit

Question 1800 (4 of 5 Based on Passage)

Appeared in Year: 2019

Question MCQ▾

Identify the normal form in which relation belongs to (December)

Choices

Choice (4)Response

a.

b.

c.

d.

Edit

Question 1801 (5 of 5 Based on Passage)

Appeared in Year: 2019

Question MCQ▾

Assume that given table is decomposed in two tables

with functional dependency set and

with FD set

Which of the following options is true w. r. t. given decomposition?

(December)

Choices

Choice (4)Response

a.

is in and is in

b.

and are both in

c.

Dependency preservation property is followed

d.

is in and is in

Edit

Question 1802

Appeared in Year: 2019

Question True-False▾

Statements

  1. The running time of dynamic programming algorithm is always where is number of subproblems. (December)

  2. When a recurrence relation has cyclic dependency, it is impossible to use that recurrence relation (unmodified) in a correct dynamic program.

  3. For a dynamic programming algorithm, computing all values in a bottom-up fashion is asymptotically faster than using recursion and memorization.

  4. If a problem can be reduced to a known NP-hard problem, then must be NP-hard.

Choices

Choice (4)Response

a.

Both statement Ⅰ & statement Ⅱ are true.

b.

Both statement Ⅱ & statement Ⅲ are true.

c.

Statement Ⅰ, Ⅱ & Ⅲ are all true.

d.

Only statement Ⅱ is true.

Edit