CONCEPTUAL VERIFICATION · SELF-ASSESSMENT
Interactive Quizzes & Concept Checks
Test your first-principles understanding of operating systems concepts, execution models, and numerical derivations with instant feedback and complete rationales.
Concept Check
Which IPC mechanism requires explicit synchronization to prevent race conditions?
After fork(); fork(); how many total processes exist including the original?
5. Module 1 Concept Verification
Test your understanding of DBMS architectural boundaries and data independence.
Creating a secondary B+ Tree index on the 'Salary' column of an Employee table to speed up range queries is an example of exercising which property?
Which of the following database languages is strictly compiled into a set of internal schema instructions that define physical storage structures and access paths?
5. ER Modeling & Table Reduction Quiz
Solve standard GATE questions on entity mapping and constraints.
Entity E1 has attributes (A, B) with key A. Entity E2 has attributes (C, D) with key C. Relationship R is M:N with descriptive attribute E. What is the primary key of the table representing relationship R?
In an ER diagram, a weak entity set W has a partial key D. The identifying relationship R connects W to strong entity S with primary key K. What constitutes the primary key of W?
4. Relational Algebra Concept Verification
Test your mastery of relational operators and join semantics.
Which relational algebra operator is equivalent to the SQL query: 'SELECT DISTINCT A FROM R WHERE A NOT IN (SELECT A FROM S)'?
5. SQL Nuances & 3-Valued Logic Quiz
Verify your understanding of SQL corner cases and execution pipelines.
Given a table T with 4 rows where column 'val' has values: 10, 20, NULL, 30. What is the result of 'SELECT COUNT(*), COUNT(val) FROM T'?
6. Normalization Concept Verification
Solve high-frequency GATE normalization problems.
Relation R(A, B, C, D) has FDs: {A → B, B → C, C → D}. What is the candidate key and the highest normal form of R?
5. B+ Tree Indexing Quiz
Test your understanding of tree height and node split bounds.
In a B+ Tree where internal nodes have maximum order p = 10, what is the minimum number of keys an internal node (other than root) must contain?
5. Serializability & Concurrency Quiz
Solve classic GATE questions on serializability and schedules.
Consider schedule S: r1(X); r2(X); w1(X); w2(X). Which of the following is true?
6. Locking & Recovery Quiz
Test your understanding of 2PL, deadlock schemes, and WAL recovery.
Which of the following properties is guaranteed by the Strict Two-Phase Locking (Strict 2PL) protocol?
Practice: choose and calculate
Training minimum and maximum are 5 and 25. Under min-max scaling to [0,1], what is the transformed value of 15?
A constant feature has min=max=7. What is the ordinary min-max formula's denominator?
A lossless codec reduces a 1200-byte file to 300 bytes. What is the compression ratio?
Socket API checks
Which call makes a TCP server socket passive and ready to queue incoming connection requests?
After a successful accept(), which descriptor usually remains available for later clients?
Check your understanding
What values are produced by `list(range(2, 8, 2))`?
What is `-7 // 3` in Python?
Collection checks
Which structure best represents unique course codes with fast membership checks?
After `a=[1,2]; b=a; b.append(3)`, what is `a`?
Function and transformation checks
What does a Python function return if execution reaches its end without a `return` statement?
In `[x*x for x in values if x > 0]`, when is `x*x` evaluated?
Algorithm checks
What precondition is required for the binary-search implementation above?
How many comparisons does linear search use for an absent target in a 7-element list?
Representation checks
Which operation is O(n) on a Python list of n elements?
A binary tree traversal visits every node once. What is its time complexity for n nodes?