Artificial intelligence and data structures MAIN LAB MANUALS FULL CLEAR PG

Artificial intelligence and data structures
MAIN LAB MANUALS FULL CLEAR
PG




Heap Property -<<<ANSWER>>> Binary heap structure
with parent-child relationship rules.

Max-Heap -<<<ANSWER>>> Parent node is greater than
or equal to children.

Min-Heap -<<<ANSWER>>> Parent node is less than or
equal to children.

Heap Representation -<<<ANSWER>>> Heaps stored as
arrays using indices for nodes.

Priority Queue -<<<ANSWER>>> Data structure
retrieving elements by priority order.

, Heapsort -<<<ANSWER>>> Efficient sorting algorithm
using heap data structure.


Universal Quantifier (∀) -<<<ANSWER>>> Indicates
'for all' elements in a domain.

Existential Quantifier (∃) -<<<ANSWER>>> Indicates
'there exists' at least one element.

Training Set -<<<ANSWER>>> Data used to train
machine learning models.

Test Set -<<<ANSWER>>> Data used to evaluate model
performance.

Regression -<<<ANSWER>>> Predicts continuous
outcomes like prices.

Classification -<<<ANSWER>>> Predicts discrete
outcomes like spam detection.

Supervised Learning -<<<ANSWER>>> Learning from
labeled input-output data.

ML Bias -<<<ANSWER>>> Systematic error from
algorithm assumptions.