Edrian C.

Lacida
BS Information Technology
Block A

1. What is Data Structure?

Answer :

Data structure is a storage that is used to store and organize data. It is a way of arranging data on
a computer so that it can be accessed and updated efficiently.

Depending on your requirement and project, it is important to choose the right data structure for
your project. For example, if you want to store data sequentially in the memory, then you can go
for the Array data structure.

2. What are examples of Data Structures?

Answer :
There are 2 types of data structures..

1.Linear data structure

2.Non linear data structure

LINEAR DATA STRUCTURES includes: 1.Arrays 2.Stacks 3.Queue 4.linked lists

NON LINEAR DATA STRUCTURES include: 1.Trees 2.Graphs

3. Real-World applications of data structures?

Answer :

Array - A collection elements of the same data type

Example - An online exam question paper.

Linked List - A list of nodes where a single node contains a data element and a reference to the
next node.
Example - Music player

Tree - A hierarchical data structure with different types of nodes such as root, parent, leaf etc.

Example - Domain Name Server

Graph - A non-linear data structure with nodes and connections.

Example - GPS Navigation system

Heap - A tree based data structure where the order of nodes matters. In max heap structure, a root
node has higher value than the leaf nodes.

Example - Priority queue implementation

Sorting - It’s not a data structure but a method to order elements. Bubble sort, merge sort are
some examples of the sorting algorithm.

Example - TV remote programming to sort the channels

 4. What is an algorithm?

Answer :

An algorithm is a step-by-step process that specifies a series of directives that must be followed
in a particular sequence in order to yield the desired outcome. An algorithm can be implemented
in more than one programming language because algorithms are typically designed
independently of the underlying languages. A few properties of an algorithm include clarity,
excellence, efficacy, and language independence. An algorithm's performance and scalability are
what really determine how important it is..

5. What are examples of Algorithms?

Answer :

 Binary search algorithm

 Greedy algorithm
 Quicksort
 Sorting algorithm
 Merge sort
 Bubble sort
 Search algorithm
 Heapsort
 Minimum spanning tree
 Insertion sort
 Dijkstra's algorithm

6. Real-World applications of Algorithms?

Answer :
A nice illustration of a real-world algorithm is Google search.

Even an apparently straightforward action like a Google search may only be performed with the
aid of algorithms. Imagine that you are interested in learning whether an elephant can swim. The
input you are asking the computer to determine is how you phrase the enquiry to Google.

Even without all the words in the query "can an elephant swim?

Try searching for "swimming elephant," for instance, and see the results. The output or results
will show videos of swimming elephants right away, followed by more information. These
responses are produced by Google using an algorithm, therefore the complete query is not
necessary.