Gate 2018

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/COAL-INDIA-MANAGEMENT-TRAINEE/databases-dbms-sql/normalization-1nf-bcnf/third-normal-form-3nf/asset-gate-2018-3310 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: About the Course
  2. Paper-2 | Programming & Data Structures: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  3. Paper-2 | Databases / DBMS & SQL: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control
  4. Paper-2 | Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  5. Paper-2 | Computer Networks & Security: 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 Access Technologies, Network Security
  6. Paper-2 | Digital Logic: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation, Floating Point Rep, Registers and Counters, Boolean Algebra and Logic Gates, Microprocessors and Microcontrollers, Logic Families and CMOS Logic, Microprocessors, Logic Gates and Boolean Algebra, Number Systems and Codes, Minimization of Boolean Functions, Timing, Hazards and Testing, Logic Families, Combinational Logic Design, Arithmetic Circuits, Waveform Generators and Timer Circuits, Semiconductor Memories and Programmable Logic Devices, Combinational Logic Circuits, Sequential Circuits and State Machines, Latches and Flip-Flops, Finite State Machines, Minimization of Boolean Functions, Arithmetic Circuits, Registers and Counters, Latches and Flip-Flops, Number Systems and Codes
  7. Paper-2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  8. Paper-2 | Theory of Computation: Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Grammar, Regular Language Properties, Moore & Mealy Machines, Pushdown Automata & CFG, Turing Machines
  9. Paper-2 | Computer Organization & Architecture: Basics of COA, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Programming the Basic Computer, Semiconductor Memories and Programmable Logic, Processor Organization and Instructions, Memory Hierarchy and Input/Output
  10. Paper-2 | Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment
  11. Paper-1 | General Awareness: Polity, Physics, Biology, Chemistry, Static General Knowledge, GK- Current Affairs, History, Geography, Indian Economy, Environment
  12. Paper-1 | Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Data Interpretation, Blood Relations, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Clock, Calendar, Cubes & Dices, Directions (Direction Test), Analogy, Seating Arrangements, Analytical Reasoning (Counting Figures Reasoning), Alphabet and Word Tests, Numerical Reasoning, Number System, Averages, Mixtures and Alligation, Percentages, Series Completion, Analogy and Classification, Patterns in Two-Dimensional Figures, Coding and Decoding, Mathematical Operations, Data Sufficiency, Direction Sense, Assembling and Grouping of Shapes, Transformation of Shapes, Three-Dimensional Patterns and Visualization, Cubes and Dice, Vocabulary, Statistics, Algebra, Geometry, Permutations and Combinations, Logical Deduction and Induction, Syllogisms and Venn Diagrams, Critical Reasoning, Order, Ranking and Sequence, Reading Comprehension, Speed, Time and Distance, Narrative Sequencing, Project Monitoring, Resources and Safety, Profit, Loss and Discount, Constraint Puzzles, Clocks and Calendars, Traverse Surveying, Simplification and Approximation, Blood Relations, Data Interpretation, Venn Diagram
  13. Paper-1 | Quantitative Aptitude: Ratio and Proportion (Ratios), Mixture and Alligation, Permutation and Combination, Number System, HCF LCM, Speed Time and Distance, Average, Age Problems, Percentage, Profit and Loss, Pipe and Cistern, Simple Interest and Compound Interest, Powers and Exponents (Surds and Indices), Mensuration and Geometry, Probability, Statistics, Arithmetic, Algebra, Ratio and Proportion, Subject-Verb Agreement, Sentence Completion, Powers, Surds and Logarithms, Data Interpretation, Sequences and Series, Trigonometry, Mensuration, Measurement and Quantity Take-Off, Signal Space and Optimum Detection, Time and Work, Probability, Algebra, Speed, Time and Distance, Statistics, Sequence and Series (Series), Combinatorics
  14. Paper-1 | English: Vocabulary, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Prepositions and Conjunctions, Idioms and Phrases, Verb Forms and Verb Patterns, Sentence Structure and Correction, Modals, Conditionals and Subjunctive, Tenses, Adjectives and Adverbs, Sentence Basics, Nouns and Pronouns, Voice and Reported Speech, Articles and Determiners, Vocabulary
  15. Coal India Previous Year Paper:
  16. Engineering Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Linear Algebra, Calculus
  17. Coal India Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video analyzes a GATE 2018 question asking to identify a relational schema that is in 3NF but not in BCNF. The instructor reviews four schemas: Registration with set-valued courses, Registration with email, Registration with marks and grade, and Registration with credit. He evaluates primary keys and functional dependencies for each. He determines that Schema I violates 1NF due to multi-valued attributes. He finds Schema II satisfies 3NF but fails BCNF due to a dependency on a non-superkey. He identifies Schema III as violating 3NF due to transitive dependency. He identifies Schema IV as violating 2NF due to partial dependency. The final conclusion points to Schema II as the correct answer.

Chapters

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

    The instructor begins by reading the problem statement visible on the slide: "Which one of the relational schemas above is in 3NF but not in BCNF?" He starts with Schema I: Registration (rollno, courses). He points out that the attribute 'courses' is a set-valued attribute. This typically violates First Normal Form (1NF). Although he briefly writes "BCNF" next to it, he dismisses it. He then shifts focus to Schema II: Registration (rollno, courseid, email). He identifies the primary key as the composite key (rollno, courseid). He lists the non-trivial functional dependencies: rollno, courseid -> email and email -> rollno. On the whiteboard, he writes (Rno, Cid) and (Cid, Email). He explains that while this schema satisfies 3NF conditions, the dependency email -> rollno violates BCNF because email is not a superkey. He marks "Schema 2" with a checkmark.

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

    Continuing the analysis, the instructor examines Schema III: Registration (rollno, courseid, marks, grade). He identifies the primary key as (rollno, courseid) and notes the dependencies rollno, courseid -> marks, grade and marks -> grade. He draws arrows to visualize the transitive dependency where marks determines grade. Since marks is a non-prime attribute determining another non-prime attribute, he labels this schema as "2NF", indicating it fails 3NF. Next, he analyzes Schema IV: Registration (rollno, courseid, credit). He identifies the primary key as (rollno, courseid) and lists dependencies rollno, courseid -> credit and courseid -> credit. He points out that courseid -> credit is a partial dependency because courseid is a proper subset of the primary key. He labels this schema "1NF". Finally, he confirms that Schema 2 is the only one satisfying the condition of being in 3NF but not BCNF.

The lecture demonstrates a methodical approach to database normalization problems by evaluating functional dependencies against normal form definitions. The instructor uses visual aids like arrows and handwritten notes to track keys and dependencies, effectively ruling out schemas that violate lower normal forms (1NF, 2NF) or BCNF constraints. The key takeaway is distinguishing between partial dependencies (violating 2NF), transitive dependencies (violating 3NF), and dependencies on non-superkeys (violating BCNF). The final conclusion reinforces that Schema 2 is the correct answer because it has a transitive dependency on a non-prime attribute (3NF) but also a dependency on a non-superkey (BCNF violation).

Loading lesson…