L - 03
Data Structure and Operations
Data structures:
• Use of data structures in application development, e.g. stack, array,
multi-dimensional array, set, queue, list and linked list.
• Apply tree types, including active, passive and recursive.
Operations:
• Use of operations in application development, e.g. hash functions and
pointers.
• Utilise sorts, e.g. insertion, quick, merge and heap.
• Utilise searches, e.g. linear, binary tree and recursive
What is Data Structure
• A data structure is a way of organizing and storing data in a computer
so that it can be accessed and used efficiently. It refers to the logical
or mathematical representation of data, as well as its implementation
in a computer program
• It allows us to manage and manipulate data effectively, enabling
faster access, insertion, and deletion operations and provide a means
of handling information, rendering the data for easy use.
Stack, Queue, Tree, Linked list, Graph,
HashMap
Algorithm