9780521269346 - recursion via pascal 2ed di rohl, j. s. (18 risultati)

- Brossura
Da: ThriftBooks-Dallas, Dallas, U.S.A.ThriftBooks-Dallas
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Buono
EUR 14,20
Spedizione gratuitaSpedito in U.S.A.Quantità: 1 disponibili
Paperback. Condizione: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.

- Brossura
Da: WorldofBooks, Goring-By-Sea, Regno UnitoWorldofBooks
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Discreto
EUR 10,72
EUR 6,46 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: Fair. A readable copy of the book which may include some defects such as highlighting and notes. Cover and pages may be creased and show discolouration.

- Brossura
- Prima edizione
Da: R. Rivers Books, Running Springs, U.S.A.R. Rivers Books
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Buono
EUR 30,91
EUR 5,99 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
Soft cover. Condizione: Good. 1st Edition. Cambridge University Press, 1986. Reprint. Softcover. 6 x 9 ". 191 pp. Good. Previous owner's blind stamp on the lower tip of the front cover and to the lower tips of some of the inside pages. The text appears unmarked. The binding is solid.

- Brossura
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 56,75
EUR 13,83 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. In.

- Brossura
Da: Chiron Media, Wallingford, Regno UnitoChiron Media
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 55,52
EUR 17,88 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Paperback. Condizione: New.

- Brossura
Da: Books Puddle, New York, U.S.A.Books Puddle
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 81,57
EUR 3,42 spedizioneSpedito in U.S.A.Quantità: 4 disponibili
Condizione: New. pp. 204.

- Brossura
Da: BennettBooksLtd, Los Angeles, U.S.A.BennettBooksLtd
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 84,53
EUR 5,96 spedizioneSpedito in U.S.A.Quantità: 1 disponibili
paperback. Condizione: New. In shrink wrap. Looks like an interesting title.

- Brossura
Da: Kennys Bookstore, Olney, U.S.A.Kennys Bookstore
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 104,05
EUR 9,01 spedizioneSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: New. Series: Cambridge Computer Science Texts. Num Pages: 204 pages, d. BIC Classification: UMX. Category: (U) Tertiary Education (US: College). Dimension: 228 x 152 x 12. Weight in Grams: 310. . 2008. paperback. . . . . Books ship from the US and Ireland.

- Brossura
Da: Kennys Bookshop and Art Galleries Ltd., Galway, IrlandaKennys Bookshop and Art Galleries Ltd.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 120,81
EUR 10,50 spedizioneSpedito da Irlanda a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. Series: Cambridge Computer Science Texts. Num Pages: 204 pages, d. BIC Classification: UMX. Category: (U) Tertiary Education (US: College). Dimension: 228 x 152 x 12. Weight in Grams: 310. . 2008. paperback. . . . .

- Brossura
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 95,95
EUR 61,70 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book is devoted to recursion in programming, the technique by which the solution to a problem is expressed partly in terms of the solution to a simpler version of the same problem. Ultimately the solution to the simplest version must be given… explicitly. In functional programming, recursion has received its full due since it is quite often the only repetitive construct. However, the programming language used here is Pascal and the examples have been chosen accordingly. It makes an interesting contrast with the use of recursion in functional and logic programming. The early chapters consider simple linear recursion using examples such as finding the highest common factor of a pair of numbers, and processing linked lists. Subsequent chapters move up through binary recursion, with examples which include the Towers of Hanoi problem and symbolic differentiation, to general recursion. The book contains well over 100 examples.

- Brossura
- Print on Demand
Da: Revaluation Books, Exeter, Regno UnitoRevaluation Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 57,04
EUR 11,54 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: Brand New. 191 pages. 9.00x6.00x0.50 inches. In Stock. This item is printed on demand.

- Brossura
- Print on Demand
Da: THE SAINT BOOKSTORE, Southport, Regno UnitoTHE SAINT BOOKSTORE
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 59,51
EUR 16,33 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Paperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.

- Brossura
- Print on Demand
Da: Majestic Books, Hounslow, Regno UnitoMajestic Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 80,35
EUR 7,50 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 4 disponibili
Condizione: New. Print on Demand pp. 204 2:B&W 6 x 9 in or 229 x 152 mm Perfect Bound on Creme w/Gloss Lam.

- Brossura
- Print on Demand
Da: Grand Eagle Retail, Bensenville, U.S.A.Grand Eagle Retail
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 92,82
Spedizione gratuitaSpedito in U.S.A.Quantità: 1 disponibili
Paperback. Condizione: new. Paperback. This book is devoted to recursion in programming, the technique through which the solution to a problem is expressed partly in terms of the solution to a simpler version of the same problem. Ultimately the solution to the simplest version must be given explicitly. In functional programming,… recursion has received its full due since it is quite often the only repetitive construct. However, here the programming language used is Pascal and the examples have been chosen accordingly. It therefore makes an interesting contrast with the use of recursion in functional and logic programming. The early chapters consider simple linear recursion using examples such as finding the highest common factor of a pair of numbers, and processing linked lists. Subsequent chapters move up through binary recursion, with examples which include the Towers of Hanoi problem and symbolic differentiation, to general recursion, which covers examples such as drawing the cover design of this book. The book contains well over 100 examples. Recursion via Pascal will be a useful introduction to recursion for undergraduate students of computer science in universities and polytechnics. This book is devoted to recursion in programming, the technique through which the solution to a problem is expressed partly in terms of the solution to a simpler version of the same problem. Ultimately the solution to the simplest version must be given explicitly. In functional programming, recursion has received its full due since it is quite often the only repetitive construct. However, here the programming language used is Pascal and the examples have been chosen accordingly. It therefore makes an interesting contrast with the use of recursion in functional and logic programming. The early chapters consider simple linear recursion using examples such as finding the highest common factor of a pair of numbers, and processing linked lists. Subsequent chapters move up through binary recursion, with examples which include the Towers of Hanoi problem and symbolic differentiation, to general recursion, which covers examples such as drawing the cover design of this book. The book contains well over 100 examples. Recursion via Pascal will be a useful introduction to recursion for undergraduate students of computer science in universities and polytechnics. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

- Brossura
- Print on Demand
Da: Biblios, frankfurt am main, GermaniaBiblios
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 82,03
EUR 9,95 spedizioneSpedito da Germania a U.S.A.Quantità: 4 disponibili
Condizione: New. PRINT ON DEMAND pp. 204.

- Brossura
- Print on Demand
Da: CitiRetail, Stevenage, Regno UnitoCitiRetail
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 64,77
EUR 42,70 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: new. Paperback. This book is devoted to recursion in programming, the technique through which the solution to a problem is expressed partly in terms of the solution to a simpler version of the same problem. Ultimately the solution to the simplest version must be given explicitly. In functional programming,… recursion has received its full due since it is quite often the only repetitive construct. However, here the programming language used is Pascal and the examples have been chosen accordingly. It therefore makes an interesting contrast with the use of recursion in functional and logic programming. The early chapters consider simple linear recursion using examples such as finding the highest common factor of a pair of numbers, and processing linked lists. Subsequent chapters move up through binary recursion, with examples which include the Towers of Hanoi problem and symbolic differentiation, to general recursion, which covers examples such as drawing the cover design of this book. The book contains well over 100 examples. Recursion via Pascal will be a useful introduction to recursion for undergraduate students of computer science in universities and polytechnics. This book is devoted to recursion in programming, the technique through which the solution to a problem is expressed partly in terms of the solution to a simpler version of the same problem. Ultimately the solution to the simplest version must be given explicitly. In functional programming, recursion has received its full due since it is quite often the only repetitive construct. However, here the programming language used is Pascal and the examples have been chosen accordingly. It therefore makes an interesting contrast with the use of recursion in functional and logic programming. The early chapters consider simple linear recursion using examples such as finding the highest common factor of a pair of numbers, and processing linked lists. Subsequent chapters move up through binary recursion, with examples which include the Towers of Hanoi problem and symbolic differentiation, to general recursion, which covers examples such as drawing the cover design of this book. The book contains well over 100 examples. Recursion via Pascal will be a useful introduction to recursion for undergraduate students of computer science in universities and polytechnics. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

- Brossura
- Print on Demand
Da: moluna, Greven, Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 62,28
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. InhaltsverzeichnisPreface 1. Introduction to recursion 2. Recursion with linked-linear lists 3. Recursion with binary trees 4. Binary recursion without trees 5. Double recursion, mutual recursion, recursive calls 6.…Recursion with .

- Brossura
- Print on Demand
Da: AussieBookSeller, Truganina, AustraliaAussieBookSeller
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 94,37
EUR 31,73 spedizioneSpedito da Australia a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: new. Paperback. This book is devoted to recursion in programming, the technique through which the solution to a problem is expressed partly in terms of the solution to a simpler version of the same problem. Ultimately the solution to the simplest version must be given explicitly. In functional programming,… recursion has received its full due since it is quite often the only repetitive construct. However, here the programming language used is Pascal and the examples have been chosen accordingly. It therefore makes an interesting contrast with the use of recursion in functional and logic programming. The early chapters consider simple linear recursion using examples such as finding the highest common factor of a pair of numbers, and processing linked lists. Subsequent chapters move up through binary recursion, with examples which include the Towers of Hanoi problem and symbolic differentiation, to general recursion, which covers examples such as drawing the cover design of this book. The book contains well over 100 examples. Recursion via Pascal will be a useful introduction to recursion for undergraduate students of computer science in universities and polytechnics. This book is devoted to recursion in programming, the technique through which the solution to a problem is expressed partly in terms of the solution to a simpler version of the same problem. Ultimately the solution to the simplest version must be given explicitly. In functional programming, recursion has received its full due since it is quite often the only repetitive construct. However, here the programming language used is Pascal and the examples have been chosen accordingly. It therefore makes an interesting contrast with the use of recursion in functional and logic programming. The early chapters consider simple linear recursion using examples such as finding the highest common factor of a pair of numbers, and processing linked lists. Subsequent chapters move up through binary recursion, with examples which include the Towers of Hanoi problem and symbolic differentiation, to general recursion, which covers examples such as drawing the cover design of this book. The book contains well over 100 examples. Recursion via Pascal will be a useful introduction to recursion for undergraduate students of computer science in universities and polytechnics. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.