Gate 2018
Duration: 4 min
This video lesson is available to enrolled students.
Inside: a video lesson and guided study material.
Module outline
- Quantitative Aptitude and Math: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Permutation and Combination, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Algebra, Powers and Exponents (Surds and Indices), Arithmetic, Mensuration and Geometry, Statistics, Probability, Percentage, Profit and Loss, Simple Interest and Compound Interest, Time and Work, Average, Calculus, Trigonometry, Vectors, Linear Algebra
- Logical and Analytical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Analogy, Verbal Analogy (Word Based Analogy), Directions (Direction Test), Blood Relations, Ranking, Order and Sequence, Syllogisms, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Seating Arrangements, Puzzle Solving (Puzzles), Cubes & Dices, Analytical Reasoning (Counting Figures Reasoning)
- English Language & Comprehension: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Verb, Articles, Preposition, Pronoun, Conjunction, Sentence Correction (Error Correction), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Completion (Fill in the blanks), Sentence Construction, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Cloze Test (Cloze Passage)
- Computer Architecture: Basics of COA, Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design, Register Transfer and Microoperations, Multiprocessors, Programming the Basic Computer
- Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
- Operating System: 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
- 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, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Cyber and Info Security
- Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
- Algorithms: Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
- Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
- DBMS: 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, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
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
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: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).

