Depth-first search. Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. One starts at the root (selecting some arbitrary node as the root in the case of a graph) and explores as far as possible along each branch before backtracking.
Derivative classification is: the incorporating, paraphrasing, restating, or generating in new form information that is already classified and the marking of the new material consistent with the classification of the source material, or the marking of the information in accordance with an authorized classification guide.
Derivative Classification IF103.16. This course does not contain the final exam. Students must register for the exam separately in STEPP and will receive credit for the course upon receiving a passing score. Description: This course explains how to derivatively classify national security information from a classification management perspective.