Q71. Most common type of join?
The **`INNER JOIN`** is the most widely used type of join in relational database systems. In fact, `INNER` is the default join type in standard SQL—writing `FROM A JOIN B...
Technical Question Bank · Peer-Reviewed
Job Interview Questions and Answers Directory
Search and filter frequently asked interview questions across technical, programming, and behavioral domains. Tailor your interview preparation by difficulty for freshers or experienced developers (142 available).
Active:
Tag: data ×
Q72. What are different JOINs in SQL?
1. **INNER JOIN** — matching rows only 2. **LEFT (OUTER) JOIN** — all left + matched right 3. **RIGHT (OUTER) JOIN** — all right + matched left 4. **FULL OUTER JOIN** — a...
Q73. Which is NOT TRUE about the ON clause?
The `ON` clause specifies the join condition. It improves readability over the old comma-syntax, supports multi-column joins (`ON a.id = b.id AND a.type = b.type`), and i...
Q74. Inner join result?
An **`INNER JOIN`** returns only the subset of rows where the join predicate (`ON` condition) matches in **both** tables simultaneously: ### Visual Venn Diagram Concept: ...
Q75. Can you join 3 tables with INNER JOIN?
Yes. There's no practical limit (though performance degrades with many joins). ```sql SELECT f.name, d.name AS division, c.name AS country FROM faculty f INNER JOIN divis...
Q76. Can you join a table to itself?
Yes — **SELF JOIN**. You must use aliases to distinguish the two instances. ```sql SELECT a.name AS employee, b.name AS manager FROM employees a, employees b WHERE a.mana...
Q77. What is true about Cartesian Products?
A Cartesian product occurs when tables are joined **without a condition**. Every row in Table A pairs with every row in Table B: `m × n` rows total. It's usually a bug, b...
Q78. INTERSECTION in relational algebra?
In relational algebra and set theory, the **INTERSECTION** of two sets $A \cap B$ yields only the tuples that appear in **both** relation sets simultaneously. ### SQL Imp...
Q79. UNION in relational algebra?
In relational algebra, the **UNION** of two sets $A \cup B$ combines all distinct tuples from both relations into a single unified relation. ### `UNION` vs `UNION ALL` in...
Q80. UNION vs UNION ALL?
| UNION | UNION ALL | |-------|-----------| | Removes duplicates | Keeps duplicates | | Slower (sort + dedup) | Faster | | Use when uniqueness matters | Use when sets are...