Data structures

Arrays

Linked list --

• Dynamic datastructure

• number of nodes is not fixed and can grow and shrink on demand

• Very common data structure that is used to create other data structures like trees, graphs, hashing etc.

Stacks --

• LIFO

• Space for function parameters and local variables is created internally using a stack.

• Compiler's syntax check for matching braces is implemented by using stack.

• Support fo r recu rs ion.

• It can act as an auxil inry duta structure for other abstract data types.

Queues --

• FIFO

• In operating systems, for controlling access to shared system resources such as printers, files,

  communication lines, disks ;:ind tapes.

• Computer systems mL1st often provide a lwlcli11g areu for messages between two processes, two

  program::;, or even lwo systems. This holding area is us ua lly ca lled u /111f fer and is often

  implemented as u queue.

• It can act as an uuxiliury duta structure for other abstract data types.

Trees --

• Organize data in a tree format so as to make the data insertion or deletion or search faster.

• Applications --

  • The library database in u library, a student database in a school or college, an employee database in

    a company. a pnlicnl dnwbase in a hospi1 ul, or busica lly any database wou ld be irnple rncntccl using

    trees.

  • The file system in your compu ter, i.e. folde rs a nd a ll fil es, would be s tored ns n tree.

  • And a tree ca n act as a n a uxiliar y da ta s tructure fo r other abstract data types.

Priority queues --

• abstract data type designed for systems that maintain a collection of prioritized elelemtns where elements are removed from the collection in order of their priority.

Disjoint set ADT --

• collection of sets that are disjoint, that is no item is foind in more than one set.

• Collection of disjoint set is called a partition as the intems are partitioned among the sets.

Dictionary --