BATAAN PENINSULA STATE UNIVERSITY – MAIN CAMPUS

COLLEGE OF INFORMATION AND COMMUNICATIONS TECHNOLOGY

1ST SEMESTER, A.Y. 2023-2024

CTCC0513 – DATA STRUCTURES AND ALGORITHMS

JOHN CARL S. SINGCA

BS ENTERTAINMENT & MULTIMEDIA COMPT – DAT2B
 Research Assignment 01
Course Packet 01: The Stages of ADT

1. What is abstract data type?

An Abstract Data Type (ADT) is a classification of objects characterized by a defined set of

values and operations. The ADT definition specifies what operations should be performed
without detailing how these operations are executed. It doesn't delve into the specifics of data
organization in memory or the algorithms used for operation implementation. The term 'abstract'
is apt because it provides a view that is independent of the actual implementation.
In computer science, ADTs are employed to bundle data and associated operations into a
unified entity. This simplifies the management and modification of data structures and promotes
the creation of reusable code.
Common examples of ADTs encompass Arrays, Stacks, Queues, Linked lists, Trees, and
Graphs. These ADTs are often realized using concrete data structures like arrays, linked lists,
and trees. However, the intricate implementation details are concealed from the user, who
interacts solely with the ADT's public interface.

2. Enumerate and explain the stages of abstract data

type.

1. Specification: In this phase, we outline the expected behavior of the Abstract Data Type
(ADT). This includes identifying the potential data values, the permissible operations on
the data, and how these operations should behave. Importantly, this specification should
remain independent of any specific implementation details.
2. Implementation: During this step, we select a practical data structure and put into
practice the operations defined for the ADT using that chosen data structure. It's crucial
that this implementation is both efficient and accurate.
3. Usage: This stage involves integrating the ADT into other programs. Importantly, users
employing the ADT shouldn't need to concern themselves with the underlying
implementation details.

3. Differentiate data structure to algorithm.

A data structure refers to the method of arranging data on a computer system to ensure efficient
utilization. Meanwhile, algorithms encompass detailed guidelines for problem-solving.
Data structures serve as repositories for data storage and arrangement, whereas algorithms
serve as tools for data manipulation and problem resolution.
Typically, data structures are employed for data storage, while algorithms are employed for data
manipulation. However, these two elements are frequently combined. For instance, a sorting
algorithm may employ an array data structure to hold the elements undergoing sorting.

4. Give two (2) examples of data structure that may

be used in writing programs.
 1. Arrays: Arrays are a simple and efficient way to store a collection of items in a
sequential order. This means that the items are stored in a line, one after the other.
Arrays can be used to store any type of data, such as numbers, strings, or objects.

2. Linked lists: Linked lists are a more flexible data structure than arrays. Linked lists are
also stored in a linear order, but the items are not stored next to each other in memory.
Instead, each item in a linked list contains a pointer to the next item in the list. This
makes linked lists more efficient for inserting and deleting items, but less efficient for
accessing individual items.

Reference
GeeksforGeeks. (2017, September 11). Abstract Data Types - GeeksforGeeks. GeeksforGeeks.
https://www.geeksforgeeks.org/abstract-data-types/
Arya, S. (2022, July 20). Abstract Data Type in Data Structure. Scaler Topics.
https://www.scaler.com/topics/abstract-data-type-in-data-structure/
Abstract data type in data structure - javatpoint. (n.d.). Www.javatpoint.com.
https://www.javatpoint.com/abstract-data-type-in-data-structure
GeeksforGeeks. (2014). Data Structures - GeeksforGeeks. GeeksforGeeks.
https://www.geeksforgeeks.org/data-structures/
Prabhu, R. (2019, March 28). Introduction to Algorithms. GeeksforGeeks.
https://www.geeksforgeeks.org/introduction-to-algorithms/
Data Structures and Algorithms Tutorial. (n.d.). Scaler Topics.
https://www.scaler.com/topics/data-structures/
Data Structures and Algorithms. (2019). Programiz.com. https://www.programiz.com/dsa