Scribd
Upload
27 views

Student Number

This document contains a student assignment for a Data Structures and Algorithms course. It includes the student number, name, course details, and responses to questions about data structures, the need for algorithm analysis, and common operations on data structures. The student defines a data structure as a way of organizing data to enable efficient access and modification, provides examples, and explains why algorithm analysis is important for system performance.

Uploaded by

Carlo Hocon
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
27 views

Student Number

This document contains a student assignment for a Data Structures and Algorithms course. It includes the student number, name, course details, and responses to questions about data structures, the need for algorithm analysis, and common operations on data structures. The student defines a data structure as a way of organizing data to enable efficient access and modification, provides examples, and explains why algorithm analysis is important for system performance.

Uploaded by

Carlo Hocon
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

STUDENT NUMBER: 2019-00227-SP-0

FULLNAME: HOCON, CARLO C.


COURSE AND SECTION: BSIT 2-1
SUBJECT CODE: COMP 20063
SUBJECT DESCRIPTION: Data Structures and Algorithms

ASSIGNMENT NUMBER 1

Based on what you read and watched answer the following:

1.) What is data structure?


 Data structure defined as a particular way of organizing and managing data in a computer that
enables efficient access and modification.
 A collection of data values, relationships among them, and the functions or operations can be
apply to the data.
 Example of data structures are arrays, Stack, Queue, Linked List, etc.

2.) Why we need to do algorithm analysis?


 Algorithm analysis is important because every algorithm has functions and one mistake may
lead to significantly ineffective system performance. However, if you apply algorithm analysis it
ables you to identify the mistake in an algorithm.

Research Work:
1. What are the common operations that can be performed on a data structure? Explained each
operation.
 Deletion – You will be able to delete an existing data item from the data structure.
 Searching – You will be able to pinpoint the location of the data from the item if it exists in the
data structure.
 Sorting – You will be able to arrange data items in some orders
 Insertion – You will be able to add a new data item in the structure
 Traversal – you will be able to access each data item exactly once so that it can be process

You might also like