Practice Questions Functional Dependency

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/COGNIZANT-PREPARATION/dbms/relational-model-functional-dependencies/attribute-closure-equivalence-of-sets/asset-practice-questions-functional-dependency-3262 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Communication Round: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Direct and Indirect Speech, Active Passive Voice (Voice), Verbal Analogy (Word Based Analogy), Articles, Preposition, Conjunction, Sentence Construction, English Writing Ability, Communication Assessment
  2. Quantitative Aptitude: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Speed Time and Distance, Percentage, Average, Powers and Exponents (Surds and Indices), Time and Work, Mensuration and Geometry, Age Problems, Pipe and Cistern, Probability, Profit and Loss, Simple Interest and Compound Interest, Algebra
  3. Analytical and Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Directions (Direction Test), Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Logical Sequence Of Words, Puzzle Solving (Puzzles), Syllogisms, Seating Arrangements, Calendar, Clock, Blood Relations, Cubes & Dices, Venn Diagram, Analytical Reasoning (Counting Figures Reasoning)
  4. Cognizant Gaming Aptitude: Gamified / Game Based Aptitude
  5. Java (Cluster 1): Java
  6. ANSI SQL MySQL (Cluster 1,2,3): SQL
  7. HTML, CSS, JavaScript (Cluster 1,3): HTML, CSS, JavaScript
  8. Python (Cluster 2): Python for Placements by Yash Sir
  9. Cloud Fundamentals (Cluster 2): Emerging Tech Trends
  10. C# (Cluster 3): C#
  11. OOPs: Object Oriented Programming (OOPS)
  12. Technical Assessment (Coding): Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Pseudo Codes
  13. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  14. DBMS: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  15. Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  16. Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video lecture addresses a problem in database normalization involving the equivalence of two sets of functional dependencies, F and G, for a relation schema R(ABCDE). The instructor displays a table comparing the two sets. Set F includes the dependencies B -> CD, AD -> E, and B -> A. Set G includes B -> CDE, A -> BC, and AD -> E. The goal is to determine if F and G are equivalent. The instructor begins by calculating the closure of attributes under set F. He writes B+ = BCDE and (AD)+ = ABCDE on the board. He then checks if F covers G. He observes that B -> CDE in G is covered by B+ under F, and AD -> E is present in both. However, he notes that B -> A in F needs to be checked against G. He then switches to checking if G covers F. He calculates closures under G, writing B+ = BCDE, A+ = A, and (AD)+ = ADE. He identifies that A -> BC in G is not covered by F because A+ under F is just A. Similarly, B -> A in F is not covered by G because B+ under G is BCDE, which does not include A. He concludes that since neither set covers the other, F is not equivalent to G.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The instructor introduces the problem statement 'Consider the following set of fd R(ABCDE)' and displays a table with columns F and G. He starts analyzing set F by calculating the closure of B, writing 'B+ = BCDE' on the board. He then calculates the closure of AD, writing '(AD)+ = ABCDE'. He begins checking if F covers G, noting that B -> CDE in G is implied by B+ under F. He also notes that AD -> E is common to both. He circles B -> A in F, indicating it needs verification against G. He writes 'F != G' initially but continues the analysis to verify the reverse direction.

  2. 2:00 – 3:07 02:00-03:07

    The instructor continues the analysis by checking if G covers F. He calculates closures under G, writing 'B+ = BCDE', 'A+ = A', and '(AD)+ = ADE' on the right side of the board. He circles A -> BC in G and notes that it is not covered by F since A+ under F is just A. He also circles B -> A in F and notes it is not covered by G since B+ under G is BCDE. He writes 'G != F' and finally concludes 'F != G' at the bottom, confirming the sets are not equivalent.

The lecture provides a step-by-step demonstration of how to test for equivalence between two sets of functional dependencies. By systematically computing attribute closures for both sets, the instructor identifies specific dependencies that are not implied by the other set. This method clearly shows that F and G are distinct sets, as neither is a subset of the other's closure, leading to the conclusion that they are not equivalent.

Loading lesson…