Stack (data structure): Abstract Data Type, Structure, Friedrich L. Bauer, Charles Leonard Hamblin High level Programming Language, Lisp
Uitgelicht
|
39,75 |
Naar shop
|
|
39,75 |
Naar shop
|
|
180,00 |
Naar shop
|
Beschrijving
Bol
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computer science, a stack is a last in, first out abstract data type and data structure. A stack can have any abstract data type as an element, but is characterized by only two fundamental operations: push and pop. The push operation adds to the top of the list, hiding any items already on the stack, or initializing the stack if it is empty. The pop operation removes an item from the top of the list, and returns this value to the caller. A pop either reveals previously concealed items, or results in an empty list.
Beschrijving
(2)
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computer science, a stack is a last in, first out abstract data type and data structure. A stack can have any abstract data type as an element, but is characterized by only two fundamental operations: push and pop. The push operation adds to the top of the list, hiding any items already on the stack, or initializing the stack if it is empty. The pop operation removes an item from the top of the list, and returns this value to the caller. A pop either reveals previously concealed items, or results in an empty list.
AmazonPagina's: 144, Paperback, Betascript Publishers
ProductspecificatiesPrijzen voor het laatst bijgewerkt op:
Gerelateerde producten
