WGU C803 : DATA TYPES AND
STRUCTURES PRACTICE EXAMINATION
2026 QUESTIONS WITH ANSWERS
GRADED A+
◍ Queue append ( ).
Answer: Adds an element to the rear of the queue
◍ Table.
Answer: A _____ has a name, a fixed tuple of columns, and a varying set of
rows.
◍ Database Design.
Answer: AnalysisLogical designPhysical design
◍ INNER JOIN.
Answer: Selects only matching left and right table rows.
◍ Relationship minimum.
Answer: ______________ ____________ is the least number of instances of
one entity that can relate to a single instance of another entity.
◍ Heap Tables.
Answer: ________ ________ optimize insert operations. Heap tables are
particularly fast for bulk load of many rows, since rows are stored in load
order.
◍ Metadata.
Answer: Data about the database, such as column names and the number of
rows in each table.
◍ % (Modulo).
, Answer: Divides one numeric value by another and returns the integer
remainder
◍ Linear Search.
Answer: The simplest search technique. Searches elements one by one
starting from the beginning of a list. The search ends when either the key
element is found, or all elements have been inspected.
◍ Abstract Data Structures.
Answer: STack, deque, queue, list, etc.
◍ Keywords (SQL Syntax).
Answer: Words with special meaning.ex. SELECT, FROM, WHERE
◍ enqueue ( ).
Answer: Adds an item to the back of a queue.
◍ Singly Linked List.
Answer: A linear data structure in which the elements are not stored in
contiguous memory locations and each element is connected only to its next
element using a pointer.
◍ Modulo.
Answer: Returns the remainder or signed remainder of a division.
◍ Multi-level index.
Answer: A ____________ ________ stores column values and row pointers
in a hierarchy.
◍ peek ( ).
Answer: Returns but does not remove the first item in a list.
◍ Assignment.
Answer: =
◍ Int.
Answer: A data type that stores a 32-bit signed two's complement integer
◍ Reflexive Relationship.
, Answer: A _________ ____________ relates an entity to itself.
◍ Priority Queue.
Answer: A specialized queue where elements are dequeued based on their
priority. Uses enqueue, dequeue, and peek.
◍ List append ( ).
Answer: Adds an element to the end of a list
◍ Rules.
Answer: Database systems ensure data is consistent with structural and
business rules.
◍ Null.
Answer: A value that represents the absence of a value or a null pointer
◍ Hashing.
Answer: The process of converting a key into an index that can be used to
access a value in a hash table.
◍ Min Heap.
Answer: A binary heap where the value of each parent node is less than or
equal to its children.
◍ set ( ).
Answer: Creates a set
◍ Queue pop ( ).
Answer: Removes and returns the first element
◍ Doubly Linked List.
Answer: A doubly linked list is a data structure that consists of a set of
nodes, each of which contains a value and two pointers, one pointing to the
previous node in the list and one pointing to the next node in the list.
◍ Storage Manager.
Answer: Translates the query processor instructions into low-level
file-system commands that modify or retrieve data. Database sizes range
from megabytes to many terabytes, so the storage manager uses indexes to
STRUCTURES PRACTICE EXAMINATION
2026 QUESTIONS WITH ANSWERS
GRADED A+
◍ Queue append ( ).
Answer: Adds an element to the rear of the queue
◍ Table.
Answer: A _____ has a name, a fixed tuple of columns, and a varying set of
rows.
◍ Database Design.
Answer: AnalysisLogical designPhysical design
◍ INNER JOIN.
Answer: Selects only matching left and right table rows.
◍ Relationship minimum.
Answer: ______________ ____________ is the least number of instances of
one entity that can relate to a single instance of another entity.
◍ Heap Tables.
Answer: ________ ________ optimize insert operations. Heap tables are
particularly fast for bulk load of many rows, since rows are stored in load
order.
◍ Metadata.
Answer: Data about the database, such as column names and the number of
rows in each table.
◍ % (Modulo).
, Answer: Divides one numeric value by another and returns the integer
remainder
◍ Linear Search.
Answer: The simplest search technique. Searches elements one by one
starting from the beginning of a list. The search ends when either the key
element is found, or all elements have been inspected.
◍ Abstract Data Structures.
Answer: STack, deque, queue, list, etc.
◍ Keywords (SQL Syntax).
Answer: Words with special meaning.ex. SELECT, FROM, WHERE
◍ enqueue ( ).
Answer: Adds an item to the back of a queue.
◍ Singly Linked List.
Answer: A linear data structure in which the elements are not stored in
contiguous memory locations and each element is connected only to its next
element using a pointer.
◍ Modulo.
Answer: Returns the remainder or signed remainder of a division.
◍ Multi-level index.
Answer: A ____________ ________ stores column values and row pointers
in a hierarchy.
◍ peek ( ).
Answer: Returns but does not remove the first item in a list.
◍ Assignment.
Answer: =
◍ Int.
Answer: A data type that stores a 32-bit signed two's complement integer
◍ Reflexive Relationship.
, Answer: A _________ ____________ relates an entity to itself.
◍ Priority Queue.
Answer: A specialized queue where elements are dequeued based on their
priority. Uses enqueue, dequeue, and peek.
◍ List append ( ).
Answer: Adds an element to the end of a list
◍ Rules.
Answer: Database systems ensure data is consistent with structural and
business rules.
◍ Null.
Answer: A value that represents the absence of a value or a null pointer
◍ Hashing.
Answer: The process of converting a key into an index that can be used to
access a value in a hash table.
◍ Min Heap.
Answer: A binary heap where the value of each parent node is less than or
equal to its children.
◍ set ( ).
Answer: Creates a set
◍ Queue pop ( ).
Answer: Removes and returns the first element
◍ Doubly Linked List.
Answer: A doubly linked list is a data structure that consists of a set of
nodes, each of which contains a value and two pointers, one pointing to the
previous node in the list and one pointing to the next node in the list.
◍ Storage Manager.
Answer: Translates the query processor instructions into low-level
file-system commands that modify or retrieve data. Database sizes range
from megabytes to many terabytes, so the storage manager uses indexes to
