Open channel bicester (1 resultados)
- Tapa blanda
- Impresión bajo demanda
Librería: CitiRetail, Stevenage, Reino UnidoCitiRetail
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 40,86
Envío por EUR 43,18Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Paperback. Condición: new. Paperback. Programming offers an ab initio introduction to programming, independent of the language employed, for anyone confronting the subject for the first time. While the book is principally aimed at first-year undergraduates, early chapters would also support learning within a high (secondary) sch…ool curriculum. Many experienced professionals will also find the text valuable as a comprehensive tutorial which includes recursive data structure and concurrency. They may find a deeper understanding of system abstraction, which is what programming is all about.The text uses pseudocode and a publication language (Honeysuckle) as the means to express algorithm, although practical illustration is given using compiled languages (mostly C). Material is sufficient to support a comprehensive first course in programming both control and data structure. After addressing the nature and use of structured programming, the reader is led through the design of first simple and then more complicated examples. The definition of dynamic data structure is explored via both recursion (using Honeysuckle and Haskell) and the explicit use of pointers (using C).The need is addressed to factor an application both as a system (serving development and maintenance) and as one of a suite of projects (serving reuse). System modularity is found through both object and process. Project modularity is enabled via definition of stand-alone item (process, function or (class of) object) and collection (library).Concurrency is described via communicating process architecture, whose formal foundation is the theory of Communicating Sequential Processes (CSP) of C.A.R. Hoare. Honeysuckle affords the expression of concurrency, secure against the threat of deadlock. This is achieved through the definition of service (client-server relation) between processes. (A formal proof of deadlock freedom using CSP exists but is not explored here.) Practical examples of concurrent programming are provided using occam.A discussion is included of how a programming language might support the engineering of reactive (event-driven) systems. This builds upon hardware prioritized vectored interruption and theoretical notions of interruption and alternation discussed by Hoare in his presentation of CSP. Programming differs from the competition by not prescribing any particular programming language and by treating concurrency and communication as natural and straightforward. It remains free of any mathematical (or other) prerequisite. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
