Data-Management-Foundations Exam Dumps : WGU Data Management – Foundations Exam

Binary searchis an algorithm that finds a search value byrepeatedly dividing the search space into two halves. It is commonly used inindexed searches.

Example Usage in Databases:

B-Trees and B+ Trees(used in database indexing) applybinary searchto navigate the index efficiently.

If searching for ID = 50 in asorted list of IDs, binary search:

Splits the list into two halves.

Checks the middle value.

Eliminates half of the dataset.

Repeats until the value is found.

Why Other Options Are Incorrect:

Option A (Table scan) (Incorrect):Readsevery row,much slowerthan binary search.

Option C (Index scan) (Incorrect):Uses indexes but does not necessarily apply binary search.

Option D (Fan-out) (Incorrect):Describesbranching in B-Trees, not searching.

Thus, the correct answer isBinary search, as it repeatedlysplits the indexin two.

Anintangible entityis an entity that does not have a physical presence but still holds meaning in a database. These entities representconcepts, relationships, or abstract datathat exist in a logical sense.

Example Usage in Databases:

Customer Loyalty Status (Gold, Silver, Bronze)

Theloyalty levelis anintangible entitysince it is derived from other data (purchase history).

Online User Sessions

Asession IDexistslogically in the systembut does not have a tangible presence like a product or employee.

Why Other Options Are Incorrect:

Option A (Concrete entity) (Incorrect):No such formal term in database design.

Option B (Tangible entity) (Incorrect):Represents somethingphysical, like anemployeeorproduct.

Option D (Physical entity) (Incorrect):Refers todata stored on disk, like database tables or indexes.

Thus, the correct answer isIntangible entity, as it only exists in a logical sense within the database.

AFull Join (FULL OUTER JOIN)selectsall records from both tables, filling in NULL values where there is no match. This ensures that no data is lost from either table.

Example Usage:

sql

SELECT Employees.Name, Departments.DepartmentName

FROM Employees

FULL OUTER JOIN Departments ON Employees.DeptID = Departments.ID;

This query retrievesall employees and all departments, even if an employeehas no assigned departmentor a departmenthas no employees.

Types of Joins:

FULL OUTER JOIN (Correct Answer)→ Includesall rows from both tables, filling missing values with NULL.

LEFT JOIN (Incorrect)→ Includesall rows from the left tableandmatching rows from the right table.

RIGHT JOIN (Incorrect)→ Includesall rows from the right tableandmatching rows from the left table.

CROSS JOIN (Incorrect)→ Produces aCartesian product(each row from one table is combined with every row from another table).

Thus, the correct answer isFULL JOIN, whichensures that all rows from both tables appear in the result.