Primary Key

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/GATE-GUIDANCE-BY-SANCHIT-SIR/database-management-systemdbms/keys-integrity-constraints/super-key-candidate-key-primary-key/asset-primary-key after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Discrete Mathematics: Set Theory, Relations, Functions, Graph Theory, Group Theory, Propositional and Predicate Logic
  2. DataBase Management System/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
  3. Digital Electronics: Digital Systems & Boolean Basics, Logic Gates & Hardware, Boolean Expression, Boolean Minimization, Combinational Circuit, Sequential Circuits, Number System, Number Representation
  4. Computer Architecture: Floating Point Rep, Cache Memory Organization, Input Output Organisation, Pipelining, Instr Formats & Modes, Control Unit Design
  5. Operating System: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management
  6. C Language: C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling
  7. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  8. Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos
  9. Computer Networks: Introduction to CN, 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
  10. Theory Of Computation/Automata Theory: 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
  11. 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
  12. Engineering Mathematics: Permutation and Combination, Linear Algebra, Calculus, Probability, Statistics
  13. General Aptitude: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Logarithm, Number System, HCF LCM, Sequence and Series (Series), Speed Time and Distance, Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Percentage, Mensuration and Geometry, Mental Ability, Arithmetic, Profit and Loss, Powers and Exponents (Surds and Indices), Average, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Syllogisms, Venn Diagram, Seating Arrangements, Blood Relations, Directions (Direction Test), Analogy, Algebra, Time and Work, Analytical Reasoning (Counting Figures Reasoning), Puzzle Solving (Puzzles), Cubes & Dices, Ranking, Order and Sequence, Mixture and Alligation, Age Problems, Clock, Selection Decision Table (Decision Making), Data Arrangement
  14. English (Verbal Aptitude): Vocabulary, Noun, Subject Verb Agreement (Verb Noun Agreement), Adjectives, Tenses, Pronoun, Preposition, Direct and Indirect Speech, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Sentence Correction (Error Correction), Verbal Analogy (Word Based Analogy), Conjunction, Interjection, Verb, Articles, Adverb, Modals, Sentence Construction
  15. Live Classes Recordings(Earlier Batch): GATE 2026 Live Class
  16. Full Mock Test:
  17. Previous Year Papers:
  18. GATE 2026 Counselling: Counselling and Guidance Sessions
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The lecture focuses on the concept of Primary Keys in Relational Database Management Systems (RDMS). The instructor outlines four key properties defining a Primary Key. First, it is a specific candidate key chosen by the database administrator. Second, it cannot contain null values. Third, a table can have at most one primary key. Fourth, any candidate key not selected as the primary key is termed an alternate key. The instructor uses a concrete example with attributes A, B, C, and D to illustrate these concepts, demonstrating how functional dependencies determine candidate keys and how the selection process works in practice.

Chapters

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

    The instructor introduces the definition of a Primary Key using four numbered points on the slide. He emphasizes that a Primary Key is selected from candidate keys by the database administrator. He highlights that Primary Key attributes cannot have null values and that only one Primary Key is allowed per table in an RDMS. He also defines Alternate Keys as candidate keys not chosen as the primary key. Visually, he underlines key phrases like "selected by database administrator" and "not allowed to have Null values" to stress their importance. He begins writing an example relation R(A B C D) with functional dependencies A -> B C D and B C D -> A to set up a practical scenario.

  2. 2:00 – 2:46 02:00-02:46

    The instructor analyzes the written example R(A B C D) with dependencies A -> B C D and B C D -> A. He explains that both A and B C D are candidate keys because they can uniquely identify tuples. He reiterates that since there are multiple candidate keys, the database administrator must select one as the Primary Key. The remaining candidate key, in this case B C D if A is chosen, becomes the Alternate Key. He underlines the dependency B C D -> A to show how B C D acts as a key. He circles the term "alternate key" to reinforce the terminology. The explanation clarifies the distinction between candidate keys and the specific selection of a primary key.

The lesson effectively bridges theoretical definitions with practical application. By defining the strict rules of Primary Keys—uniqueness, non-nullability, and singular selection per table—the instructor sets a clear framework. The example with attributes A, B, C, and D serves to concretize the abstract concept of candidate keys versus primary keys. It demonstrates that while multiple keys might exist mathematically, the database design process involves a specific administrative choice to designate one as the primary identifier, leaving others as alternates. This progression from definition to example ensures students understand both the constraints and the decision-making involved in database schema design.

Loading lesson…