Mark Aljun Bote CPE3M1

Assignment 1. Module No. 1 Data Structures and Algorithm

Answer the following:

1. Memorize the Mission and Vision of Trimex Colleges

Mission
TRIMEX exists to excel in serving individuals and institutions who believe that
education is essential in one’s lifelong achievement of success. Its essence in anchored
on its drive to be a relevant partner in community and nation building where individual is
considered the best organizational resource
Vision
To be leading educational center to produce globally competitive skilled
professionals with the ability to create, act positively and contribute to the development
of the family and participate as responsive leaders and dynamic component in nation
building.
2. What is Data Structure?
A data structure is a specialized format for organizing, processing, retrieving and
storing data. While there are several basic and advanced structure types, any data structure is
designed to arrange data to suit a specific purpose so that it can be accessed and worked with
in appropriate ways.
In computer programming, a data structure may be selected or designed to store data for the
purpose of working on it with various algorithms. Each data structure contains information about
the data values, relationships between the data and functions that can be applied to the data.
Data structures can be linear or non-linear, based on the way their data is accessed. Linear are
those in which data is stored in a sequential manner, and can be accessed in a sequence too.
Non-linear are those which hold the data together without focusing on its sequence. The data
cannot be arranged or accessed in a sequence.
3. What is Algorithm?
An algorithm is a set of instructions designed to perform a specific task. This can be a
simple process, such as multiplying two numbers, or a complex operation, such as playing a
compressed video file. Search engines use proprietary algorithms to display the most relevant
results from their search index for specific queries.
In computer programming, algorithms are often created as functions. These functions serve as
small programs that can be referenced by a larger program. For example, an image viewing
application may include a library of functions that each use a custom algorithm to render
different image file formats. An image editing program may contain algorithms designed to
process image data. Examples of image processing algorithms include cropping, resizing,
sharpening, blurring, red-eye reduction, and color enhancement.
In many cases, there are multiple ways to perform a specific operation within a software
program. Therefore, programmers usually seek to create the most efficient algorithms possible.
By using highly-efficient algorithms, developers can ensure their programs run as fast as
possible and use minimal system resources. Of course, not all algorithms are created perfectly
the first time. Therefore, developers often improve existing algorithms and include them in future
software updates. When you see a new version of a software program that has been
"optimized" or has "faster performance," it most means the new version includes more efficient
algorithms.
Mark Aljun Bote CPE3M1

4. Give an example of applications of Data Structures.

Following are common Data Structures with their respective applications:

1. Arrays: Implementation of other data structures, Execution of matrices and vectors, Dynamic
memory allocation, Pointer container, Control tables.

2. Stack: Evaluation of expressions, Backtracking, Runtime memory management,

Arrangement of books in a library.

3. Queue: Here, the data sent need not be received at the same rate at which it was sent. A
certain system resource is to be shared between different processes.

4. Linked-List: Representation of sparse matrices, Non-contiguous data storage,

Implementation of non-binary tree or other data structures, Dynamic memory management,
Equalizing parenthesis, Symbol tables.

5. Set: Mapping of data, Common data storage.

6. Graph: Computer networking, Problem solutions involving 'Depth-First' search or 'Breadth-

First' search algorithms, Representation of matrices, Study of molecular interactions in
Chemistry.

7. Tree: Representation of data lists, Quickly accessible data storage, Representation of

hierarchal data, Routing of algorithms.

8. Hash-table: Unique data representation, Implementation of caches, Array association,

Locating entries in a table, Representation of objects, Database indexing.

9. File: Implementation of computer programs, Data comparison, Storage of data having

varying data types.