3. Characteristics
• Correctness − Data structure implementation should implement its interface
correctly.
• Time Complexity − Running time or the execution time of operations of data
structure must be as small as possible.
• Space Complexity − Memory usage of a data structure operation should be as
little as possible.
• Rules: Set of rules to implement operations
04/12/2020Dincy R Arikkat,Christ college Irinjalakkuda
3
5. Traversing
04/12/2020Dincy R Arikkat,Christ college Irinjalakkuda
5
• It means to access each data item exactly once so that it can be processed.
• Example-to print the names of allthe students in a class
6. Searching
04/12/2020Dincy R Arikkat,Christ college Irinjalakkuda
6
• Finding the location of a particular data item with given value or finding the
location of allthe records which satisfies one or more conditions
• Example-to find the names of allthe students who secured 100 marks in
data structures
7. Insertion
04/12/2020Dincy R Arikkat,Christ college Irinjalakkuda
7
• It is used to add new data items to the given list of data items.
• Example-To add the details of a new students,who has recently joined
8. Deletion
04/12/2020Dincy R Arikkat,Christ college Irinjalakkuda
8
• It means to remove or delete a particular data from the given collection of
data items
• Example –to delete name of a student who has left the course
9. Sorting
04/12/2020Dincy R Arikkat,Christ college Irinjalakkuda
9
• Data items can be arranged in some order like ascending order or descending
order depending on type of application
• Arranging the names of students in a class in alphabetic order
11. Applications of Data Structure
04/12/2020Dincy R Arikkat,Christ college Irinjalakkuda
11
• Compiler Design
• Operating System
• DBMS
• Artificial Intelligence
• Computer Networks
