Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
Type of Medium
Language
Region
Library
Years
Person/Organisation
Subjects(RVK)
  • 1
    Online Resource
    Online Resource
    Indianapolis, IN :Wiley,
    UID:
    almafu_9959327562402883
    Format: 1 online resource (xxii, 601 pages) : , illustrations
    ISBN: 9781118612767 , 1118612760 , 9781118797297 , 1118797299 , 1118612108 , 9781118612101 , 9781299759992 , 1299759998 , 9781119575955 , 1119575958
    Series Statement: Essential
    Content: A friendly and accessible introduction to the most useful algorithms Computer algorithms are the basic recipes for programming. Professional programmers need to know how to use algorithms to solve difficult programming problems. Written in simple, intuitive English, this book describes how and when to use the most practical classic algorithms, and even how to create new algorithms to meet future needs. The book also includes a collection of questions that can help readers prepare for a programming job interview. Reveals methods for manipulating common data structures s.
    Note: Algorithm basics -- Numerical algorithms -- Linked lists -- Arrays -- Stacks and queues -- Sorting -- Searching -- Hash tables -- Recursion -- Trees -- Balanced trees -- Decision trees -- Basic network algorithms -- More network algorithms -- String algorithms -- Cryptography -- Complexity theory -- Distributed algorithms -- Interview puzzles.
    Additional Edition: Print version: Stephens, Rod, 1961- Essential algorithms. Indianapolis, IN : Wiley, [2013] ISBN 9781118612101
    Language: English
    Keywords: Electronic books. ; Llibres electrònics. ; Electronic books. ; Electronic books. ; Llibres electrònics.
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Book
    Book
    Indianapolis, Ind. :Wiley,
    UID:
    almahu_BV041295112
    Format: XXII, 601 S. : , Ill., graph. Darst.
    ISBN: 978-1-118-61210-1
    Additional Edition: Erscheint auch als Online-Ausgabe ISBN 978-1-118-61276-7
    Additional Edition: Erscheint auch als Online-Ausgabe ISBN 978-1-118-79729-7
    Language: English
    Subjects: Computer Science
    RVK:
    RVK:
    Keywords: Algorithmus
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    Indianapolis, IN :Wiley,
    UID:
    edocfu_9959327562402883
    Format: 1 online resource (xxii, 601 pages) : , illustrations
    ISBN: 9781118612767 , 1118612760 , 9781118797297 , 1118797299 , 1118612108 , 9781118612101 , 9781299759992 , 1299759998 , 9781119575955 , 1119575958
    Series Statement: Essential
    Content: A friendly and accessible introduction to the most useful algorithms Computer algorithms are the basic recipes for programming. Professional programmers need to know how to use algorithms to solve difficult programming problems. Written in simple, intuitive English, this book describes how and when to use the most practical classic algorithms, and even how to create new algorithms to meet future needs. The book also includes a collection of questions that can help readers prepare for a programming job interview. Reveals methods for manipulating common data structures s.
    Note: Algorithm basics -- Numerical algorithms -- Linked lists -- Arrays -- Stacks and queues -- Sorting -- Searching -- Hash tables -- Recursion -- Trees -- Balanced trees -- Decision trees -- Basic network algorithms -- More network algorithms -- String algorithms -- Cryptography -- Complexity theory -- Distributed algorithms -- Interview puzzles.
    Additional Edition: Print version: Stephens, Rod, 1961- Essential algorithms. Indianapolis, IN : Wiley, [2013] ISBN 9781118612101
    Language: English
    Keywords: Electronic books. ; Llibres electrònics.
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Did you mean 9781118412763?
Did you mean 9781118412367?
Did you mean 9781108613767?
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages