Compact DS0-002 Cheat sheet for CompTIA DataSys+ V2 candidates covering database design, SQL, security, operations, performance, and recovery.
Use the tables for a quick pre-exam check. Expand a topic’s notes for explanations, examples, and additional distinctions.
Scope and study context
Focus on decision-making: DS0-002-style questions often test whether you can choose the safest database design, operation, security control, or troubleshooting step—not just define a term.
Use this review with the current CompTIA exam objectives. Do not rely on memory of older versions or unofficial weightings.
High-yield DBA decision map
Task
Choose / remember
Common exam trap
Design transactional system
Normalize, enforce constraints, index frequent predicates
Adding indexes for every column without considering write cost
BEGIN;UPDATEaccountsSETbalance=balance-100WHEREaccount_id=10;UPDATEaccountsSETbalance=balance+100WHEREaccount_id=20;COMMIT;-- Use ROLLBACK instead of COMMIT if validation fails.
SQL categories
Category
Examples
Purpose
DDL
CREATE, ALTER, DROP, TRUNCATE
Define or change database objects
DML
SELECT, INSERT, UPDATE, DELETE, MERGE
Query and modify data
DCL
GRANT, REVOKE
Manage permissions
TCL
COMMIT, ROLLBACK, SAVEPOINT
Control transactions
Logical SELECT processing order
Remember the logical order, not the written order:
FROM and JOIN
WHERE
GROUP BY
HAVING
SELECT
DISTINCT
ORDER BY
LIMIT / FETCH / TOP, depending on platform
Exam trap: a column alias created in SELECT may not be available to WHERE because WHERE is logically processed earlier.
Join review
Join type
Result
Common mistake
INNER JOIN
Matching rows only
Accidentally excluding unmatched records
LEFT OUTER JOIN
All left rows plus matching right rows
Filtering right-table columns in WHERE can turn it into an inner join
RIGHT OUTER JOIN
All right rows plus matching left rows
Usually can be rewritten as LEFT JOIN for clarity
FULL OUTER JOIN
All rows from both sides with matches where possible
Misreading NULLs from unmatched sides
CROSS JOIN
Cartesian product
Often accidental due to missing join condition
SELF JOIN
Table joined to itself
Requires clear aliases
Filtering, grouping, and NULLs
Topic
High-yield rule
WHERE
Filters rows before grouping
HAVING
Filters groups after aggregation
COUNT(*)
Counts rows
COUNT(column)
Counts non-NULL values in that column
NULL comparison
Use IS NULL or IS NOT NULL, not equals comparison
NOT IN with NULL
Can produce unexpected results; understand three-valued logic
DISTINCT
Removes duplicates from the selected result set, not from the table
UNION
Combines and removes duplicates
UNION ALL
Combines without duplicate removal, often faster
ORDER BY
Result order is not guaranteed without it
UPDATE and DELETE safety
Before changing production data, the safest pattern is usually:
Confirm the target rows with SELECT.
Use a transaction when supported and appropriate.
Apply a specific WHERE clause.
Validate the affected row count.
Commit only after verification.
Keep a rollback or restore path.
Common trap: choosing a broad UPDATE or DELETE when the scenario asks for controlled, auditable change.
DROP vs DELETE vs TRUNCATE
Command
What it does
Exam caution
DELETE
Removes selected rows
WHERE matters; may be logged row by row depending on system
TRUNCATE
Removes all rows from a table efficiently
Usually not for selective removal
DROP
Removes the object itself
Highest destructive impact
Transactions, concurrency, and consistency
ACID reference
Property
Meaning
DBA relevance
Atomicity
All-or-nothing transaction
Prevent partial transfers or half-written changes
Consistency
Database moves between valid states
Constraints and business rules remain valid
Isolation
Concurrent transactions do not improperly interfere
Controlled by isolation levels and locks
Durability
Committed data survives failure
Logs, storage, checkpoints, replication
Notes and examples
Isolation and anomalies
Isolation concept
Prevents / allows
Exam cue
Read uncommitted
May allow dirty reads
Fast but unsafe for correctness
Read committed
Prevents dirty reads
Common baseline behavior
Repeatable read
Prevents non-repeatable reads
Same row reread remains stable
Serializable
Strongest isolation; behaves like serial execution
More blocking/overhead possible
Snapshot / MVCC
Readers see consistent version
Reduces read/write blocking, may create version storage pressure
Anomaly
Meaning
Dirty read
Read data from uncommitted transaction
Non-repeatable read
Same row read twice returns different committed values
High-yield rule: increasing isolation can improve consistency but may reduce concurrency. The best answer depends on the scenario’s balance between correctness and performance.
Indexing and query performance
Index selection
Index type / pattern
Use when
Avoid / watch for
B-tree / balanced tree
Equality and range predicates, sorting
Low-selectivity columns may not help
Composite index
Queries filter/sort by multiple columns
Column order matters
Covering index
Query can be satisfied from index
Extra storage and write overhead
Unique index
Enforce uniqueness and speed lookup
Duplicates will fail
Filtered / partial index
Only subset is frequently queried
Predicate must match supported syntax
Full-text index
Natural language search
Not same as LIKE '%term%'
Hash index
Equality lookup, if supported
Usually not for range queries
Bitmap index
Low-cardinality analytics, if supported
Often poor for high-concurrency OLTP
Notes and examples
SARGability checklist
A predicate is more index-friendly when the database can search the index directly.
Less index-friendly
More index-friendly
WHERE YEAR(order_date) = 2026
WHERE order_date >= DATE '2026-01-01' AND order_date < DATE '2027-01-01'
WHERE LOWER(email) = 'a@x.com'
Store normalized email or use supported function-based index
WHERE amount + 10 > 100
WHERE amount > 90
WHERE name LIKE '%son'
Use full-text/search index if suffix search is required
Query tuning sequence
Confirm the performance symptom and baseline.
Review execution plan: scan vs seek, join method, sort, spill, estimated vs actual rows if available.
Check predicates for SARGability.
Validate relevant indexes and index column order.
Check statistics freshness and cardinality estimates.
Inspect joins, missing filters, accidental cross joins, and implicit conversions.
Check locks, waits, I/O, CPU, memory, and temp space.
Test changes in non-production and compare measured results.
Performance tools and signals
Signal
Indicates
Typical response
Full table scan
No useful index, low selectivity, or optimizer choice
Add/tune index only if beneficial
High CPU
Complex calculations, poor plan, too many executions
Tune query, cache results, reduce frequency
High disk I/O
Large scans, missing indexes, poor caching
Index, partition, archive, tune queries
Memory pressure
Sort/hash spills, insufficient cache
Tune query, review memory config/capacity
Temp space growth
Large sorts, hash joins, temp tables
Add indexes, reduce intermediate rows
Stale statistics
Bad cardinality estimates
Update statistics/maintenance
Parameter sensitivity
Plan good for one value, bad for another
Recompile/plan strategy, query rewrite where supported
Index fundamentals
Concept
Why it matters
Selectivity
Indexes help most when values narrow the result set significantly
Composite index
Column order matters; leftmost leading columns are important
Covering index
Includes all needed columns for a query, reducing lookups
Clustered organization
Data stored in index order in some systems
Nonclustered index
Separate structure pointing to data rows
Unique index
Enforces uniqueness and can improve lookup performance
Over-indexing
Speeds reads but slows writes and increases maintenance/storage
Statistics
Help the optimizer choose an efficient plan
SARGable predicate
Search-friendly condition that can use an index effectively
Common index traps
Indexing every column “just in case.”
Adding an index before checking the query plan.
Ignoring stale statistics.
Using functions on indexed columns in filters and then wondering why the index is not used.
Creating a composite index with columns in the wrong order for the query pattern.
Forgetting write-heavy systems pay a cost for every additional index.
flowchart TD
A[Slow query or workload] --> B[Confirm scope and baseline]
B --> C[Check wait events, locks, CPU, memory, I/O]
C --> D[Review execution plan]
D --> E{Root cause?}
E -->|Bad access path| F[Index, statistics, predicate rewrite]
E -->|Too much data scanned| G[Filter earlier, partition prune, aggregate appropriately]
E -->|Blocking| H[Shorten transactions, tune locks, review isolation]
E -->|Resource saturation| I[Capacity, configuration, workload scheduling]
F --> J[Test change safely]
G --> J
H --> J
I --> J
J --> K[Measure again and document]
Storage, partitioning, and capacity
Storage concepts
Concept
DBA meaning
Exam note
Data file
Stores table/index data
Placement affects I/O
Log / journal
Records changes for durability and recovery
Critical for point-in-time restore
Tablespace / filegroup
Logical storage grouping, vendor term varies
Can separate data, indexes, partitions
Temp space
Used for sorts, joins, temp objects
Running out can break queries
Checkpoint
Flushes dirty pages to durable storage
Interacts with recovery time
Compression
Reduces storage and I/O
May increase CPU
Tiering
Move data to different storage classes
Balance performance, cost, retention
Notes and examples
Partitioning patterns
Pattern
Use when
Benefit
Trap
Range partition
Date/time or ordered key
Fast pruning and archival
Bad partition key creates imbalance
List partition
Known categories
Region/status separation
Too many categories can be hard to manage
Hash partition
Spread data evenly
Reduces hotspot risk
Less intuitive for pruning
Composite partition
Multiple strategies
Large complex workloads
More operational complexity
Partitioning is not automatically a performance fix. It helps most when queries filter on the partition key, maintenance can operate per partition, or data lifecycle actions need efficient archive/drop.
Deployment and architecture patterns
Database deployment decision table
Pattern
Best for
Strengths
Risks / controls
Single instance
Small/simple workload, dev/test
Simple administration
Single point of failure unless backed by platform features
Dev/test portability, some specialized deployments
Repeatable deployment
Persistent storage, backup, and performance need care
Serverless database
Variable workload, simplified scaling
Operational simplicity
Cold starts/latency/cost behavior may vary by platform
Notes and examples
Replication choices
Replication type
Description
Choose when
Synchronous
Commit waits for replica acknowledgment
Very low data-loss tolerance
Asynchronous
Primary commits before replica catches up
Distance/performance more important than zero-lag
Physical/block-level
Replicates storage/log changes
Disaster recovery or exact copy
Logical
Replicates rows/statements/changes
Selective replication, migration, integration
Snapshot
Periodic copy
Reporting or initial synchronization
CDC
Captures data changes over time
Near-real-time pipelines and migrations
CAP and distributed data systems
Concept
Meaning
Consistency
Reads return latest correct data according to model
Availability
Requests receive non-error responses
Partition tolerance
System continues despite network partitions
Eventual consistency
Replicas converge over time
Strong consistency
Reads reflect committed writes according to defined rules
Exam distinction: CAP applies under network partition conditions. It does not mean every system permanently chooses only two characteristics in all situations.
Security quick reference
Security control matrix
Control
Protects
Examples / notes
Authentication
Who are you?
Passwords, MFA, certificates, federation
Authorization
What can you do?
Roles, grants, row-level access
Accounting / auditing
What happened?
Login logs, query audit, DDL audit
Encryption in transit
Network confidentiality
TLS/secure client connections
Encryption at rest
Stored data protection
Database/file/storage encryption
Key management
Control encryption keys
Rotation, separation of duties, access policy
Masking
Hide sensitive values in displays
Useful for non-prod or limited users
Tokenization
Replace sensitive data with token
Reduces exposure of original value
Hashing
One-way transformation
Password verification, integrity checks
Salting
Random value added before hashing
Defends against precomputed hash attacks
Data classification
Label sensitivity
Drives access, retention, and monitoring
Secrets management
Protect credentials
Avoid hardcoded passwords
Network segmentation
Limit reachable paths
Private subnets, firewalls, allowlists
Patching
Remove known vulnerabilities
Test, schedule, rollback plan
Notes and examples
Least privilege SQL example
-- Example pattern; exact syntax varies by platform.
CREATEROLEreporting_reader;GRANTSELECTONsales_summaryTOreporting_reader;GRANTreporting_readerTOanalyst_user;REVOKEINSERT,UPDATE,DELETEONsales_summaryFROMreporting_reader;
Role design
Pattern
Good practice
Trap
User-specific grants
Use sparingly
Hard to audit and revoke
Role-based access control
Grant privileges to roles, users to roles
Overly broad shared roles
Separation of duties
Split DBA, security admin, developer duties
One account can alter, approve, and audit itself
Break-glass access
Emergency elevated access
Must be logged, time-limited, reviewed
Service accounts
Application/database connectivity
Use rotation and scoped permissions
Sensitive data handling
Technique
Reversible?
Primary use
Encryption
Yes, with key
Protect stored/transmitted data
Hashing
No
Verify password or integrity
Masking
Usually display-level
Reduce exposure to users
Tokenization
Yes, through token vault/mapping
Replace sensitive values in workflows
Redaction
Usually no in output
Remove sensitive text from logs/documents
Anonymization
Intended no
Analytics without identifying individuals
Pseudonymization
Possible with mapping
Reduce direct identifiability
Audit and logging focus
Event type
Why it matters
Failed logins
Brute force or credential misuse
Privilege changes
Escalation or misconfiguration
DDL changes
Schema drift, unauthorized alteration
Access to sensitive tables
Data exposure investigation
Bulk export
Potential exfiltration
Backup/restore events
Data movement and recovery assurance
Configuration changes
Security or availability impact
Trap: audit logs must be protected from tampering. Logging sensitive values can create a second data exposure location.
Core security controls
Control
Purpose
Exam clue
Authentication
Proves identity
Passwords, MFA, federated identity, service accounts
Authorization
Grants allowed actions
Roles, privileges, policies
Accounting / auditing
Tracks activity
Logs, access reviews, alerts
Least privilege
Grants only required access
Excessive admin rights are a red flag
Separation of duties
Splits sensitive responsibilities
Prevents one person from controlling all steps
Encryption in transit
Protects data moving over networks
TLS or secure channels
Encryption at rest
Protects stored data
Database, disk, file, or backup encryption
Masking
Hides sensitive values from users
Useful in reports, testing, support
Tokenization
Replaces sensitive data with tokens
Reduces exposure of original values
Hashing
One-way transformation
Password storage with salt; not reversible encryption
Key management
Protects encryption keys
Rotation, access control, separation from data
Permission model review
Model
Best fit
RBAC
Access based on job roles such as analyst, developer, DBA
ABAC
Access based on attributes such as department, location, data classification
Direct user grants
Small or exceptional cases; harder to manage at scale
Group-based access
Easier lifecycle management
Service account
Application or automated process access; should be scoped and monitored
High-yield rule: if a user needs access, prefer granting access through an appropriate role or group rather than giving broad direct privileges.
Security traps
Granting administrative rights to fix a simple read/write permission issue.
Using shared accounts without accountability.
Storing secrets in scripts, code repositories, or plain-text configuration files.
Copying production data to test without masking sensitive fields.
Encrypting data but leaving keys broadly accessible.
Logging sensitive data into application or database logs.
Ignoring failed login spikes, unusual exports, or privilege escalation events.
Must understand consistency and dependency on storage
Logical export
Schema/data as statements/files
Migration, selective restore
May be slower; consistency must be managed
Physical backup
Data files/logs
Fast full restore
Platform/version compatibility matters
Restore sequence reference
Scenario
Typical restore approach
Full backup only
Restore full backup
Full + differential
Restore full, then latest differential
Full + incrementals
Restore full, then each incremental in order
Full + logs
Restore full, then logs to target point
Full + differential + logs
Restore full, latest differential, then logs
Corrupt object only
Consider object-level restore/export if supported
Accidental DELETE
Point-in-time restore to separate environment, extract/replay valid data
Backup validation checklist
Confirm backups complete successfully.
Test restore in a non-production environment.
Verify application can connect after restore.
Validate row counts, checksums, or reconciliation totals.
Document restore steps and owners.
Protect backups with encryption and access controls.
Store backups separately from the primary failure domain.
Monitor backup age, duration, failure, and capacity.
Review retention and deletion settings against business requirements.
HA/DR decision path
flowchart TD
A[Requirement: protect database service] --> B{Main concern?}
B -->|Short outage from server failure| C[High availability: cluster or failover replica]
B -->|Data loss tolerance is very low| D[Synchronous replication or frequent log shipping]
B -->|Regional/site disaster| E[Disaster recovery environment plus offsite backups]
B -->|Accidental data change| F[Point-in-time restore and audit trail]
C --> G[Test failover runbook]
D --> G
E --> G
F --> H[Test restore and data reconciliation]
RPO and RTO
Term
Meaning
Scenario clue
RPO
Maximum acceptable data loss
“Can lose no more than 15 minutes of data”
RTO
Maximum acceptable downtime
“Must be back online within 1 hour”
High-yield rule: a backup strategy is not proven until a restore has been tested.
Backup types
Backup type
Purpose
Tradeoff
Full backup
Complete backup at a point in time
Larger and slower, simpler restore base
Incremental backup
Changes since the last backup of any type
Smaller backups, potentially longer restore chain
Differential backup
Changes since the last full backup
Larger over time, simpler than many incrementals
Transaction/log backup
Supports point-in-time recovery in systems that use logs
Requires proper log management
Snapshot
Fast point-in-time image
May depend on underlying storage and is not always a full backup substitute
Availability patterns
Pattern
Strength
Watch for
Read replica
Offloads read traffic
Replication lag
Synchronous replication
Stronger data consistency
Latency and performance impact
Asynchronous replication
Better performance over distance
Possible data loss on failover
Clustering
Improves service availability
Complexity and split-brain concerns
Failover
Moves service to standby system
Must be tested and documented
Geo-redundancy
Regional resilience
Cost, latency, compliance, recovery procedures
Operational mistakes
Backing up but never testing restore.
Restoring over production without confirming scope and authorization.
Treating snapshots as the only disaster recovery plan.
Ignoring transaction logs until storage fills.
Failing over without knowing application connection behavior.
Forgetting that replicas may replicate bad data or destructive changes.
Not documenting recovery steps before an incident.
Engine or host patch automation depending on service
Availability
Architecture choice, failover testing
Platform redundancy mechanisms
Monitoring
Alerts, query performance, business KPIs
Built-in metrics/log delivery
Compliance support
Policies, evidence, data handling
Platform controls and reports
Cost/capacity
Workload sizing, scaling choices
Metering and scaling mechanisms
Trap: managed database does not mean unmanaged data. The organization still owns data quality, access design, query behavior, and recovery requirements.
Common exam distinctions
Distinction
Remember
Backup vs replication
Backup protects against deletion/corruption history; replication can copy bad changes quickly
HA vs DR
HA handles local/component failure; DR handles broader disaster recovery
Both enforce uniqueness; primary key is main row identifier and non-null
Foreign key vs join
FK enforces relationship; join retrieves related data
WHERE vs HAVING
WHERE filters rows; HAVING filters groups
DELETE vs TRUNCATE
DELETE is row operation and can filter; TRUNCATE removes all rows more directly, behavior varies by platform
Logical vs physical backup
Logical exports objects/data; physical backs up files/pages/logs
Incremental vs differential
Incremental since last backup; differential since last full
Scale up vs scale out
Scale up adds resources to one node; scale out adds nodes/partitions
Normalization vs denormalization
Normalize for integrity; denormalize intentionally for read performance
Data lake vs data warehouse
Lake stores flexible raw/curated files; warehouse stores structured optimized analytics
CDC vs full reload
CDC captures changes; full reload replaces or reloads entire set
Compact command/query patterns to recognize
-- Add an index for a frequent lookup pattern
CREATEINDEXidx_orders_customer_dateONorders(customer_id,order_date);-- Enforce valid status values
ALTERTABLEordersADDCONSTRAINTchk_orders_statusCHECK(statusIN('NEW','PAID','SHIPPED','CANCELLED'));-- Identify duplicate business keys
SELECTemail,COUNT(*)ASduplicate_countFROMcustomersGROUPBYemailHAVINGCOUNT(*)>1;-- Find orphaned child rows
SELECTo.order_idFROMordersoLEFTJOINcustomerscONc.customer_id=o.customer_idWHEREc.customer_idISNULL;
Final DS0-002 review checklist
Can you select relational, NoSQL, warehouse, lake, or streaming architecture based on workload?
Can you explain primary keys, foreign keys, constraints, joins, NULLs, and transaction isolation?
Can you read SQL and predict result-set behavior?
Can you choose an index strategy and a query-tuning sequence?
Can you distinguish authentication, authorization, auditing, encryption, hashing, masking, and tokenization?
Can you map RPO/RTO requirements to backup, restore, replication, HA, and DR designs?
Can you troubleshoot slow queries, blocking, failed backups, replication lag, and storage growth?
Can you describe safe schema changes, migrations, validation, and rollback planning?
Can you connect data governance, classification, lineage, and quality checks to DBA operations?
High-scale distributed workloads, sparse data, high write volume
Data model depends heavily on access patterns
Graph database
Highly connected data such as relationships, paths, networks
Not ideal for simple tabular reporting
Data warehouse
Analytical reporting, historical trends, BI queries
Not optimized for high-volume transactional writes
Data lake
Raw or varied data at scale
Requires governance, cataloging, quality controls
Cache
Low-latency repeated reads
Stale data, invalidation, consistency risk
Notes and examples
OLTP vs OLAP
Feature
OLTP
OLAP
Main purpose
Day-to-day transactions
Analysis and reporting
Query pattern
Short, frequent reads/writes
Long scans, aggregations, joins
Schema style
Normalized
Often dimensional or denormalized
Data freshness
Current
Current plus historical
Optimization goal
Integrity and fast transactions
Query performance and analytical flexibility
Common risk
Locking and contention
Slow scans, stale extracts, inconsistent metrics
Data modeling quick review
Entities, relationships, and keys
Concept
Meaning
Exam trap
Entity
Object or concept stored as a table/collection
Do not model every report field as a separate entity
Attribute
Property of an entity
Repeating groups suggest poor normalization
Primary key
Unique row identifier
Must be stable, unique, and not null
Foreign key
References a primary or candidate key
Enforces relationship integrity
Candidate key
Attribute set that could uniquely identify a row
Multiple candidate keys may exist
Composite key
Key made of multiple columns
Common in junction tables
Surrogate key
Artificial identifier, such as an ID number
Does not replace business uniqueness rules
Natural key
Real-world unique value
May change or be reused in some domains
Unique constraint
Prevents duplicate values
Use for business rules such as unique email when required
Check constraint
Enforces allowed values or ranges
Better than relying only on application validation
Default constraint
Supplies a value when none is provided
Does not validate all bad input
Notes and examples
Cardinality and optionality
Relationship
Meaning
Typical implementation
One-to-one
Each row maps to at most one related row
Shared key or unique foreign key
One-to-many
One parent has many child rows
Foreign key on child table
Many-to-many
Many rows relate to many rows
Junction/bridge table
Optional relationship
Related row may not exist
Nullable foreign key or separate optional table
Mandatory relationship
Related row must exist
NOT NULL foreign key and referential constraint
Normalization
Normal form
Core idea
What it prevents
1NF
Atomic values; no repeating groups
Multi-value columns and repeating fields
2NF
Non-key attributes depend on the whole key
Partial dependency in composite-key tables
3NF
Non-key attributes depend only on the key
Transitive dependency and update anomalies
High-yield rule: Normalize to reduce redundancy and protect integrity; denormalize deliberately for performance or reporting after understanding the tradeoff.
Design traps
Storing comma-separated values in one column instead of using a child table.
Using free-text fields where a constrained lookup table is required.
Omitting foreign keys because “the application handles it.”
Confusing a surrogate primary key with a full uniqueness rule.
Modeling many-to-many relationships without a junction table.
Denormalizing transactional tables before measuring the performance need.
Ignoring delete behavior: cascade, restrict, set null, and soft delete each have consequences.
Large sorts, cache pressure, insufficient resources
Replication lag
Network latency, large transaction, replica resource bottleneck
Common DS0-002 candidate mistakes
Memorizing definitions without practicing scenario decisions.
Treating every performance issue as an indexing issue.
Ignoring the difference between authentication and authorization.
Forgetting that WHERE filters rows and HAVING filters groups.
Confusing RPO with RTO.
Assuming backups are valid without restore tests.
Selecting DROP when the scenario only requires removing rows.
Granting permissions directly to users instead of roles or groups.
Missing NULL behavior in SQL questions.
Choosing denormalization as a first design step.
Overlooking audit, retention, and classification requirements.
Forgetting that replication improves availability but does not replace backup.
Making production changes without rollback planning.
Failing to distinguish OLTP design from analytical reporting design.
Quick practice plan
Use this review as a checklist before moving into IT Mastery practice.
1. Do targeted topic drills
Start with short topic drills from an original practice questions question bank:
SQL joins, aggregates, NULLs, and transactions
Normalization, keys, constraints, and ERD scenarios
Backup, restore, RPO, and RTO
Security permissions, encryption, masking, and auditing
Indexing, query plans, locking, and troubleshooting
ETL/ELT, data quality, and reporting models
2. Review detailed explanations
For every missed question, write down:
The clue you missed.
The wrong assumption you made.
The rule that would have led to the correct answer.
Whether the error was knowledge-based or scenario-reading-based.
3. Mix domains
After topic drills, use mixed sets so you practice switching between design, SQL, operations, performance, and security. The real exam can require that kind of context switching.
4. Take timed mock exams
Timed practice helps reveal whether you are over-reading simple questions or rushing through scenario details. Review both missed questions and guessed-correct questions.
Final last-pass checklist
Before exam day, make sure you can confidently answer:
When should you normalize, and when might denormalization be justified?
Which SQL command category applies to a given task?
What changes when an outer join is filtered incorrectly?
How do NULLs affect comparisons and aggregates?
What is the difference between DELETE, TRUNCATE, and DROP?
How do RPO and RTO drive backup and recovery design?
Why is restore testing essential?
How do least privilege, roles, masking, and encryption work together?
How do indexes help, and when can they hurt?
What symptoms suggest locking, blocking, or deadlocks?
How do ETL, ELT, CDC, batch, and streaming differ?
How do data quality, lineage, and governance reduce operational risk?