DATA STRUCTURE AND ALGORITHM

_____ is information that cannot be broken into smaller parts

• Atomic

• Traceable

• Accurate

• Clear and Concise

The process of visiting every element of a data structure at least once

• Traversing

• Searching

• Insertion

• Deletion

The process of locating an element in data structure and returning its index or address

• Traversing

• Searching

• Insertion

• Deletion

The process of arranging the data elements in a data structure in a specific order by specific values

• Deletion

• Sorting

• Merging

• Copying

The process of combining elements of two data structure

• Deletion

• Sorting

• Merging

• Copying

The process of _____ is the operation that makes a new data structure from an existing data structure

• Deletion

• Sorting

• Merging

• Copying

A type of algorithm that divides the problem into smaller overlapping sub-problems and solves them

• Divide and Conquer

• Greedy

• Dynamic Programming

• Randomized

Set of values

• Data

• Data Item

• Data Object

• Data Type

Refers to a single unit of values

• Data

• Data Item

• Data Object

• Data Type

Represents an object having a data

• Data

• Data Item

• Data Object

• Data Type