This document provides an introduction to data structures. It discusses common data structures like lists, arrays, stacks, queues, heaps, trees and graphs. It also summarizes different types of linked lists and operations possible with arrays. Additionally, it describes ALISON, the online education platform where the internship took place, and covers stacks, arrays and linked lists in more detail. It concludes by emphasizing the importance of understanding data structures for computer scientists and software engineers.

1. Introduction to Data Structures
Dept. Of CSE, EPCET 2022-23 Internship(18CSI85)
Presented by, Under the guidance of,
Mrs.Shammi
Assistant Professor
Department of CSE, EPCET
Soumya Shrikanth Mantri (1EP21CS101)
Internship(21INT49) on

2. CONTENTS:
• Introduction to Data Structures
• Classification of Data Structures
• About Company
• Stack
• Array
• Linked lists
• Future Enhancement of Internship
• Conclusion
• References
Dept. Of CSE, EPCET 2022-23 Internship(18CSI85)

3. Introduction To Data Structures
• A Data Structure is a scheme for organising the data in the memory of the
computer.
• Some of the more commonly used data structures include lists, array, stacks,
queues, heaps, trees and graphs
• The way in which the data is organised affects the performances of a program
for different tasks.
Dept. Of CSE, EPCET 2022-23 Internship(18CSI85)

4. Classification of Data Structures

5. About Company
• ALISON (Advance Learning Interactive Systems Online) is an
Irish online education platform for higher education that provides
certificate courses and accredited diploma courses.
• It was founded on 21 April 2007 in Galway, Ireland, by Irish social
entrepreneur Mike Feerick.
• The platform allows registered users to access digitally-based
education and skills training for free.
Dept. Of CSE, EPCET 2022-23 Internship(18CSI85)

6. Stacks
• Stack is a linear data structure that follows a particular order in which the
operations are performed.
• The order is LIFO(Last in first out).
• Entering and retrieving data is possible from only one end.
• In stack, if the allocated space for the stack is full, and still anyone attempts to
add moreelements, it will lead to stack overflow.

7. Array
• The idea is to store multiple items of the same type together in one place.
• It allows the processing of alarge amount of data in a relatively short period.
• The first element of the array is indexed by a subscript of 0.
• There are different operations possible in an array, like Searching, Sorting,
Inserting, Traversing,Reversing, and Deleting.

8. Linked Lists
• A linked list is a linear data structure in which elements are not stored at
contiguous memory locations.
• The elements in a linked list are linked using pointers.
• Types of Linked Lists
 Singly-linked list
 Doubly linked list
 Circular linked list
 Doubly circular linked list
Dept. Of CSE, EPCET 2022-23 Internship(18CSI85

9. Future Enhancement of Internship
It has helped me to gain knowledge and further helps me to get placed.
It helps in
Dept. Of CSE, EPCET 2022-23 Internship(18CSI85)

10. Conclusion
• A solid understanding of data structures is essential for any software engineer or
computer scientist.
• By leveraging the right data structure for each problem, developers can design
efficient and scalable algorithms, leading to optimized applications and systems.
• As technology progresses, data structures will remain a vital pillar in the field of
computer science, enabling innovative solutions and pushing the boundaries of
what's possible in the world of computing.
Dept. Of CSE, EPCET 2022-23 Internship(18CSI85)

11. References
1. GeeksforGeeks | A computer science portal for geeks
2. Alison | Free Online Courses & Online Learning
3. Data structures and algorithms made easy, Narasimha karumanchi,5th edition
4. Data Structures with C, Schaum series 2
5. Data Structures and algorithm, Satraj and Sahni,2nd edition
Dept. Of CSE, EPCET 2022-23 Internship(18CSI85)

12. THANK YOU