In programming, what do we use data structures for?

(a)  

What is the basic data structure that stores single value

(a)  

In programming, what do we use algorithms for?

(a)  

What are the two types of Data Structures

(a)  

This is a complex structure built using primitive data and can store multiple values

(a)  

What are the Two Types of Non-Primitive Data Structures 

(a)  

What Primitive Data Structure can be used to represent numeric data, specifically whole numbers?

(a)  

Float stands for what?

(a)  

A basic data structure used to store a sequence of characters like letters, numbers, or symbols

(a)  

In binary "true" represents the value _ , and "false" respresents the value of _

(a)  

What Type of Data Structures are arranged sequentially, where each element is connected to its previous and next elements?

(a)  

What are the two types of Non-Primitive Data Structure?

(a)  

One characteristic of Linear Data Structure is data elements can be accessed in a sequence, one after another. What is it called?

(a)  

One characteristic of linear data structure is each element has only one successor and one predecessor, except for the first and last elements

(a)  

This refers to how linear data structure utilize memory in a contiguous manner, which sometimes lead to inefficient memory use if not managed properly

(a)  

This is a collection of elements of the same data type stored in contiguous memory locations

(a)  

What is a data structure that stores a fixed-size collection of elements of the same type in sequential memory locations

(a)  

This is a data structure that follow the Last-In-First-Out (LIFO) principle, where the last element added is the first one to be removed

(a)  

This is a data structures that follow the First-In-First-Out (FIFO) principle, where the first element added is the first one to be removed

(a)  

This is the process of adding an element to the end of the queue.

(a)  

This is the process of removing an element from the front of the queue.

(a)  

This data structure composed of nodes, where each node contains data and a reference (pointer) to the next node in the sequence.

(a)  

What do you call the basic elements that make up a linked list?

(a)  

What are the two main components stored inside each node of a linked list?

(a)  

What is the special part of a node that stores the address (or location) of the next node?

(a)  

What is the last node of a linked list called, which usually points to NULL?

(a)  

What is the term for the first node of a linked list?

(a)  

This is a fixed-size collection of heterogeneous values, meaning it can store multiple values of different types.

(a)  

What do you call an unordered collection of key-value pairs?

(a)  

In a Dictionary Data Structure what must be UNIQUE?

(a)  

In this Dictionary Data Structure example:

{“verb”: “action words”}

what is the KEY?

(a)  

In this Dictionary Data Structure example:

{“verb”: “action words”}

what is the VALUE?

(a)  

In this Dictionary Data Structure example:

employee[101] = {"Juan Dela Cruz", "Software Engineer", 75000};

what is the KEY and OBJECT?

(a)  

What do you call a hierarchical data structure that starts with a root node and branches into child nodes?

(a)  

What is the very first node at the top of a tree called?

(a)  

What do you call the nodes that come directly under the root or another node?

(a)  

What connect nodes together in a tree structure?

(a)  

How many parent can a node have in tree structure?

(a)  

What do you call the node that doesnt have a child in a tree structure?

(a)  

This data structure consists of nodes (vertices) connected by edges, representing relationships between entities.

(a)  

In graph data structure, what is another term for a “node”?

(a)  

This is a data structure used to represent relationships between pairs of objects, called nodes (or vertices) connected by edges.

(a)  

Give one area where graphs are widely used

(a)  

Give one real-life example where data structure is used.

(a)  

It is a step-by-step set of instructions to process data for a specific purpose

(a)  

It refers to how fast an algorithm runs

(a)  

It refers to how much space or storage an algorithm uses

(a)  

When solving a problem, we want an algorithm that is not only correct but also (a)  

These are the two factors often used to measure the efficiency of an algorithm

(a)  

What do you call the process of comparing multiple algorithms to choose the best one

(a)  

Between speed(time) and memory use, this factor is usually prioritized.

(a)  

This type of algorithms are used to find specific data within a structure.

(a)  

This type of algorithms are used to arrange data in a particular order (ascending or descending).

(a)  

This type of algorithms are used to solve problems related to graph theory, such as finding the shortest path or detecting cycles

(a)