What are Data Structures and Algorithms? - PowerPoint PPT Presentation

About This Presentation
Title:

What are Data Structures and Algorithms?

Description:

Software engineering is a field of study that involves the concept of engineering where software engineer learns to design as well as write the lines of codes & algorithms in order to create programs and software applications for various electronic devices including computer. However, the writing of codes is simply a stage of the whole process. There’s a well-articulated life-cycle in the true software engineering since there are numerous components included with it like requirement, verification, design, testing, coding, specification, testing, quality check, implementation, and acceptance by the user(s). – PowerPoint PPT presentation

Number of Views:299

less

Transcript and Presenter's Notes

Title: What are Data Structures and Algorithms?


1
What are Data Structures and Algorithms?
2
  • Software engineering is a field of study that
    involves the concept of engineering where
    software engineer learns to design as well as
    write the lines of codes algorithms in order to
    create programs and software applications for
    various electronic devices including computer.
  • However, the writing of codes is simply a stage
    of the whole process.
  • Theres a well-articulated life-cycle in the true
    software engineering since there are numerous
    components included with it like requirement,
    verification, design, testing, coding,
    specification, testing, quality check,
    implementation, and acceptance by the user(s).

3
  • While software engineers dont really need to
    have a in-depth knowledge on every single
    component of their software projects, possessing
    some basic knowledge of data structures can be
    really helpful for them.

4
  • Taking a simple data structures course
    online would be great for them. It is the core
    part of the coding phase.
  • To store and manipulate data, its mandatory to
    learn the basics of data structures and
    algorithms. The skill could be acquired by going
    for online data structures and algorithms course.
  • The storage as well as arrangement of the data
    in the disk space of OC or its memory storage
    done is a way such that it could be easily used
    in the future is known as data structures. 

5
  •  Algorithms, on the other hand includes
    instructions or commands using which the stored
    data is manipulated.
  • Algorithm is used to make searches for specific
    items in the data structure and also to sort the
    data through advanced as well as simple data
    sorting methods.
  • Algorithms needs to be highly efficient with its
    execution, and at the same time, better-designed
    algorithms are needed for stronger sets of data
    structures.
  • Algorithms could be efficient only if the data
    within the data structure is arranged in a proper
    manner and they are easily accessible. Data
    structures and algorithms are important part
    of machine learning training.

6
Here are a few characteristics of data structure
  • Array Here, algorithms are fairly easy to
    insert. Data are accessible easily, however,
    searching for data and deleting it is
    comparatively slower and the size of such data
    structure couldnt be expanded.
  • Queue Here, accessibility follows the basic rule
    of first in/ first out. Drawbacks of queue being
    that access of the items are slower.

7
  • Stack While it is fairly similar to queue, here,
    the different is that it follows the rule of last
    in and first out.
  • Binary Tree Here, there is an advantage with
    making searches, inserting data, and deleting
    data, all of which is quicker, however,
    algorithms used for deleting could be quite
    complex in nature.
  • Linked List Here, the act of inserting and
    deleting data is quicker, but at the same time,
    searching is slow.

8
  • Hash Table Here, accessibility is fast if the
    key is known, otherwise, it could be slower.
    Inserting data is also quick, however, deleting
    data is slower and the use of inter disk memory
    space is not very efficient.
  • Graph For the real-world situations, this is the
    best model available. And therefore, it is also
    the most complex of all.

9
Thank You
Visit Us www.learnbay.in
Write a Comment
User Comments (0)
About PowerShow.com