Gate 2018

Duration: 4 min

This video lesson is available to enrolled students.

Return to /learn/MPPSC-ASSISTANT-PROFESSOR-COMPUTER-SCIENCE-PAPER-2/database-management-system/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 1 | General Studies: State Wise GK
  3. Paper 1 | Information and Communication Technology: Role of Internet and Web Services, Security in Mobile and Wireless Computing
  4. Paper 1 | Current Affairs: GK- Current Affairs
  5. Paper 2 | Discrete Mathematical Structure: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic, Probability
  6. Paper 2 | Digital Computer Organization And Architecture: Number System, Number Representation, Sequential Circuits, Combinational Circuit, Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design, Programming the Basic Computer
  7. Paper 2 | C Programming: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  8. Paper 2 | Programming Languages & Object-Oriented Programming Concepts: Java, OOPS with C++, Java Fundamentals, Array, String, IO & References
  9. Paper 2 | Python: Introduction to Python, Tokens, Variables, Data Types, I/O, Operators & Expressions, Control Flow & Looping, Collections & Strings, Functions & Modules, File Handling & Data Analysis
  10. Paper 2 | Data Structure And Algorithms: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing, Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Minimum Spanning Trees, Advanced Algorithms
  11. Paper 2 | Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS
  12. 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, Complexity Theory
  13. 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
  14. Paper 2 | Database Management System: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, Relational Algebra, SQL, Transaction Management, Concurrency Control, Database Recovery, Database Security & Authorization, Enhanced Data Models
  15. Paper 2 | Computer Network And Information Security: Introduction to CN, Data Communication, Application Layer, Hardware basics, Cyber Threats and Malware Attacks, Network Security, 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
  16. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  17. Paper 2 | Current Trends & Technologies: Emerging Tech Trends, Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Fuzzy Sets, Natural Language Processing, Artificial Neural Networks, Genetic Algorithms, Artificial Intelligence, Data Warehousing & Mining, Electronic Data Interchange and E-Commerce, Terms & Abbreviations
  18. Paper 2 | Full Length Mock Tests:
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…