MICO VILLANUEVA February 6,2024

BSIT – 201I

PT1 - Prelims WE1: Understanding DSA Concepts

1. What are data structures and algorithms?

• Data structures are methods for efficiently accessing, storing, and organizing
data on a computer. Trees, graphs, linked lists, and arrays are a few examples.

• Step-by-step instructions or formulas for resolving an issue are known as

algorithms. They work with data to carry out operations like searching, sorting,
and more, frequently utilizing data structures.

2. What good will it do me to know about them?

- Gaining knowledge of data structures and algorithms enhances your ability

to solve problems quickly and effectively. It lets you select the most suitable
data organization scheme and data processing algorithm, resulting in software
that runs faster and uses fewer resources.

3. When does it make sense to apply what I learn about data structures and
algorithm?

- Applying this understanding makes sense anytime you are working on

problems involving the manipulation, storing, or retrieval of data. Your
software's performance and scalability can be significantly impacted by the
data format and algorithm you choose.

4. Why are data types important in programming?

- Because they specify the nature of the data (such as integer, floating-point,
or boolean) and specify the kinds of operations that can be done on it, data
types are crucial. They aid in preventing programming errors and ensuring
data integrity.

5. Can we consider data types as basic representation of data inside the

computer? Why?

- Yes, the fundamental way that data is represented in a computer is through

data types. They are essential for accurately processing and manipulating data
MICO VILLANUEVA February 6,2024
BSIT – 201I
since they instruct the computer on how to understand the data and what
kinds of operations can be performed.

6. If we already have data types to represent data, why do we need data

structures?

- While data structures arrange several data items, data types indicate the
type of data. Large volumes of data must be efficiently stored, arranged, and
accessed using data structures. They offer methods for managing complicated
data, allowing for more advanced actions on data than would be possible with
just basic data types.

7. What is the difference between ADTs and data types?

• Data Types are concrete implementations that specify how data is

organized and what operations can be performed on that data.

• Abstract Data Types (ADTs), on the other hand, are theoretical

concepts that define operations on data but do not specify how these
operations are implemented. Examples include Stack, Queue, and List.
ADTs focus on what operations are to be performed, while data
structures focus on how these operations are implemented.

8. How do records and fields in a database depict the relationship between data
types and data structures?

- A database's fields and records can be thought of as concrete examples of

data structures, with each record—which functions similarly to an object in
programming—consisting of fields with distinct data types. This structure
demonstrates the relationship between data types, which define the nature of
data in fields, and data structures, which organize those fields into records,
and enables effective data organization and retrieval.

9. What possible advantage does the structure of a database provide to the

users of a program.

- A database's structure has many benefits, including scalability, effective data

retrieval, data integrity enforcement, and ease of use for sophisticated queries
and data analysis. By facilitating rapid access to information and insights, this
organization improves user experience by enabling programs to handle
enormous volumes of data efficiently.
MICO VILLANUEVA February 6,2024
BSIT – 201I

10. How can we determine if a particular algorithm is efficient or not?

- An algorithm's time complexity—how long it takes to execute an algorithm
given the size of the input—and space complexity—how much memory it
uses—are typically used to assess an algorithm's efficiency. Big O notation,
which indicates the upper bound of the algorithm's complexity, is frequently
used to express this. An algorithm that exhibits reduced time and space
complexity within the anticipated range of input sizes is considered efficient.

11. Which is more important, the design of the data structure or the algorithm?
- Both hold equal significance. The effectiveness of algorithms that work with
a given data structure is directly impacted by the option made. On the other
hand, an algorithm's design might draw attention to a data structure's
advantages or disadvantages. Finding the best answer frequently necessitates
striking a healthy balance between developing an effective algorithm and
selecting the appropriate data format.

12. Can a particular task be accomplished by a computing device?

- If a task can be stated algorithmically, almost every logical task can be

completed by a computing system. The computational capacity, memory, and
task completion time of the device determine the restrictions.

13. What is the minimum number of operations for any algorithm to perform a
certain function?

- The most effective algorithm for tackling the problem and its intrinsic
complexity define the minimal amount of operations. The goal of algorithm
analysis in theoretical computer science is to determine the lowest bounds on
problems (i.e., maximum efficiency).
MICO VILLANUEVA February 6,2024
BSIT – 201I

14. Why is there a need to analyse an algorithm if it is already capable of solving

the problem at hand?
- Even if an algorithm is able to solve the problem, it still needs to be analyzed
in order to determine its resource utilization, scalability, and efficiency.
Through comparison with other solutions, this study helps to guarantee that
the method is the best option for the specific context, as well as helping to
optimize the algorithm and make it more practical for huge datasets or
confined situations.

15. Does it mean that when all properties are present in an algorithm, it is already
the best algorithm?
- Not always. Even if an algorithm possesses all the desirable qualities (such as
simplicity, efficiency, and accuracy), it may still perform worse than another
approach for certain types of data or in particular contexts. As new algorithms
are created and application needs change, it is crucial to continuously evaluate
and compare existing methods.

16. Can algorithms designed for a certain DS work for another DS? Why?

- In order to take use of the qualities of particular data structures, algorithms

are frequently created with them in mind. Even while an algorithm could
theoretically function with a different data structure, if the data structure
cannot effectively support the operations the algorithm depends on, its
performance could suffer noticeably. As a result, an algorithm's performance is
directly related to the properties of the data structure it uses.