[go: up one dir, main page]
Scribd
Upload
281 views5 pages

Project of Data

Mahadi Hassan is a computer science student with ID number 20183290535 studying data structures under Teacher Yi. Data structures are specialized formats for organizing and storing data in a way that allows efficient retrieval and manipulation. Common data structures include arrays, stacks, queues, linked lists, trees, graphs, tries, and hash tables, each suited to different algorithmic purposes. Knowledge of data structures and algorithms is important for writing optimized code, using resources efficiently, and gaining skills sought by employers.

Uploaded by

Mahedi Hassan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
281 views5 pages

Project of Data

Mahadi Hassan is a computer science student with ID number 20183290535 studying data structures under Teacher Yi. Data structures are specialized formats for organizing and storing data in a way that allows efficient retrieval and manipulation. Common data structures include arrays, stacks, queues, linked lists, trees, graphs, tries, and hash tables, each suited to different algorithmic purposes. Knowledge of data structures and algorithms is important for writing optimized code, using resources efficiently, and gaining skills sought by employers.

Uploaded by

Mahedi Hassan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

NAME : MAHEDI HASSAN

STUDENT ID : 20183290535

SUBJECT : Data Structure

SCHOOL : Information Science and Engineering

MAJOR : Computer Science & Technology

TEACHER : TEACHER YI
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.

Characteristics Of Data Structures


Data structures are often classified by their characteristics. Possible characteristics are:

 Linear or non-linear: This characteristic describes whether the data items are arranged
in chronological sequence, such as with an array, or in an unordered sequence, such as with a
graph.

 Homogeneous or non-homogeneous: This characteristic describes whether all data


items in a given repository are of the same type or of various types.

 Static or dynamic: This characteristic describes how the data structures are compiled.
Static data structures have fixed sizes, structures and memory locations at compile time.
Dynamic data structures have sizes, structures and memory locations that can shrink or
expand depending on the use.

Types Of Data Structures


Data structure types are determined by what types of operations are required or what kinds of
algorithms are going to be applied. These types include:

 Arrays- An array stores a collection of items at adjoining memory locations. Items that
are the same type get stored together so that the position of each element can be calculated or
retrieved easily. Arrays can be fixed or flexible in length.
 Stacks- A stack stores a collection of items in the linear order that operations are applied.
This order could be last in first out (LIFO) or first in first out (FIFO).

 Queues- A queue stores a collection of items similar to a stack; however, the operation
order can only be first in first out.

 Linked lists- A linked list stores a collection of items in a linear order. Each element, or
node, in a linked list contains a data item as well as a reference, or link, to the next item in
the list.

 Trees- A tree stores a collection of items in an abstract, hierarchical way. Each node is
linked to other nodes and can have multiple sub-values, also known as children.

 Graphs- A graph stores a collection of items in a non-linear fashion. Graphs are made up
of a finite set of nodes, also known as vertices, and lines that connect them, also known as
edges. These are useful for representing real-life systems such as computer networks.

 Tries- A trie, or keyword tree, is a data structure that stores strings as data items that can
be organized in a visual graph.

 Hash tables- A hash table, or a hash map, stores a collection of items in an associative
array that plots keys to values. A hash table uses a hash function to convert an index into an
array of buckets that contain the desired data item.

Uses Of Data Structures


In general, data structures are used to implement the physical forms of abstract data types. This
can be translated into a variety of applications, such as displaying a relational database as
a binary tree.In programming languages, data structures are used to organize code and
information in a digital space. For example, Python lists and dictionaries or JavaScript array and
objects are common coding structures used for storing and retrieving information. Data
structures are also a crucial part of designing efficient software.

Importance Of Data Structures


 Write optimized and scalable code - Once you have knowledge about different data
structures and algorithms, you can determine which data structure and algorithm to choose in
various conditions.
 Effective use of time and memory - Having knowledge about data structures and
algorithms will help you write codes that run faster and require less storage.
 Better job opportunities - Data structures and algorithms questions are frequently asked
in job interviews of various organizations including Google, Facebook, and so on.

Algorithm
The algorithm can be defined as "a sequence of steps to be carried out for a required output from
a certain given input". There are three main features of the algorithm from its definition:

1. The essential aim of an algorithm is to get a specific output,


2. An algorithm involves several continuous steps,
3. The output comes after the algorithm finished the whole process.
So basically, all algorithms perform logically while following the steps to get an output
for a given input.

Algorithms On Strings
World and internet is full of textual information. We search for information using textual queries,
we read websites, books, e-mails. All those are strings from the point of view of computer
science. To make sense of all that information and make search efficient, search engines use
many string algorithms. Moreover, the emerging field of personalized medicine uses many
search algorithms to find disease-causing mutations in the human genome.

THE END

You might also like