CrazyEngineers
CrazyEngineers

  • what is ADT??

    samaira

    Member

    Updated: Oct 25, 2024
    Views: 1.3K
    what do u mean by Abstract data types.??And whats the relation between ADT and data structures???😕And one more thing i m 'to be comp engineer' so can anyone tell me all the things about computer that an engineer should know.Plz help
    0
    Replies
Howdy guest!
Dear guest, you must be logged-in to participate on CrazyEngineers. We would love to have you as a member of our community. Consider creating an account or login.
Replies

  • saurabh2486

    Member • Aug 16, 2009

    <a href="https://en.wikipedia.org/wiki/Abstract_data_type" target="_blank" rel="nofollow noopener noreferrer">Abstract Data Type</a>
    hope this will help
    Are you sure? This action cannot be undone.
    Cancel

  • saurabh2486

    Member • Aug 16, 2009

    and for ur 3rd query u should be able to do coding and able to understand that how everything in computer works etc etc . if you have any problems u can ask lol
    Are you sure? This action cannot be undone.
    Cancel

  • aponjon

    Member • Aug 17, 2009

    abstract data type or abstract data structure is a <a href="https://en.wikipedia.org/wiki/Mathematics" target="_blank" rel="nofollow noopener noreferrer">Mathematics</a> model for a certain class of <a href="https://en.wikipedia.org/wiki/Data_structure" target="_blank" rel="nofollow noopener noreferrer">Data Structure</a> that have similar behavior; or for certain <a href="https://en.wikipedia.org/wiki/Data_type" target="_blank" rel="nofollow noopener noreferrer">Data Type</a> of one or more <a href="https://en.wikipedia.org/wiki/Programming_languages" target="_blank" rel="nofollow noopener noreferrer">Programming Languages</a> that have similar <a href="https://en.wikipedia.org/wiki/Semantics" target="_blank" rel="nofollow noopener noreferrer">Semantics</a>. An ADT is defined indirectly, only by the operations that may be performed on it and by mathematical constraints on the effects (and possibly <a href="https://en.wikipedia.org/wiki/Computational_complexity" target="_blank" rel="nofollow noopener noreferrer">Computational Complexity</a>) of those operations<a href="https://en.wikipedia.org/wiki/Abstract_data_type#cite_note-liskov-0" target="_blank" rel="nofollow noopener noreferrer">Abstract Data Type Cite Note Liskov 0</a>. For example, an abstract <a href="https://en.wikipedia.org/wiki/Stack_data_structure" target="_blank" rel="nofollow noopener noreferrer">Stack Data Structure</a> could be defined by two operations: push, that inserts some data item into the structure, and pop, that extracts an item from it; with the constraint that each pop always returns the most recently pushed item that has not been popped yet. When <a href="https://en.wikipedia.org/wiki/Analysis_of_algorithms" target="_blank" rel="nofollow noopener noreferrer">Analysis Of Algorithms</a> of algorithms that use stacks, one may also specify that both operations take the same time no matter how many items have been pushed into the stack, and that the stack uses a constant amount of storage for each element.
    #-Link-Snipped-#
    Are you sure? This action cannot be undone.
    Cancel
Home Channels Search Login Register