In computational problem solving, operations on abstract object types are defined by abstract data types (ADTs), while their concrete representations in memory are realized through data structures. For instance, a list exemplifies an ADT that supports operations such as access, insertion, and deletion, independent of how these elements are physically stored.