DATA STRUCTURES AND ALGORITHMS
• Data structure refers to how data is stored and organized in a computer file.
• It provides an efficient way of storing and organizing data in the computer.
• Examples of Data Structures include arrays, Linked List, Stack, Queue, Tree, Graph
etc.
DATA STUCTURES OPERATIONS
• TRAVERSING – visit elements in a data structure
• INSERTION – Adding an element
• DELETION – Removing an element
• SEARCHING – finding an element
• SORTING – Arranging elements in a certain order
• MERGING – Joining different data structures
, • An Computer Algorithm consist of a finite sequence of well-defined, computer-
implementable instructions, that are designed to perform a specific task such
performing a computation, sorting data in a file or searching.
Elements of a Computer Program
• A computer program
– INPUTS – provides commands for entering data eg cout<< ( in C++), scanf( in C),
readln(in pascal)
• Data structure refers to how data is stored and organized in a computer file.
• It provides an efficient way of storing and organizing data in the computer.
• Examples of Data Structures include arrays, Linked List, Stack, Queue, Tree, Graph
etc.
DATA STUCTURES OPERATIONS
• TRAVERSING – visit elements in a data structure
• INSERTION – Adding an element
• DELETION – Removing an element
• SEARCHING – finding an element
• SORTING – Arranging elements in a certain order
• MERGING – Joining different data structures
, • An Computer Algorithm consist of a finite sequence of well-defined, computer-
implementable instructions, that are designed to perform a specific task such
performing a computation, sorting data in a file or searching.
Elements of a Computer Program
• A computer program
– INPUTS – provides commands for entering data eg cout<< ( in C++), scanf( in C),
readln(in pascal)
