Primary Key

Duration: 3 min

This video lesson is available to enrolled students.

Return to /learn/COGNIZANT-PREPARATION/dbms/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. 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 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…