FUNDAMENTALS OF COMPUTER

Detailed explanation-1: -In computing, a persistent data structure or not ephemeral data structure is a data structure that always preserves the previous version of itself when it is modified.

Detailed explanation-2: -A data structure is persistent if every updated version can be accessed. A data structure is partially persistent if we can only update the latest version whereas in a fully persistent data structure we can modify every version of it. Examples of persistent data structures: Linked Lists Consider a linked list A.

Detailed explanation-3: -There are two types of persistence: object persistence and process persistence. In data terms, object persistence refers to an object that is not deleted until a need emerges to remove it from the memory. Some database models provide mechanisms for storing persistent data in the form of objects.

Detailed explanation-4: -Data persistence is the longevity of data after the application that created it has been closed. In order for this to happen, the data must be written to non-volatile storage-a type of memory that can retain that information long-term, even if the application is no longer running.