Skip navigation

Bookboon.com Gratis studiebøger og e-bøger

Choose a category

Ruby Data Structures and Algorithms

Ruby Data Structures and Algorithms
Ingen anmeldelse endnu
ISBN: 978-87-403-1955-2
1. udgave
Sider : 248
  • Pris: 129,00 kr
  • Pris: €13,99
  • Pris: £13,99
  • Pris: ₹250
  • Pris: $13,99
  • Pris: 129,00 kr
  • Pris: 129,00 kr

4 nemme skridt til din e-bog

Vi beklager, men for at kunne downloade vores bøger eller se vores videoer, kræves det at din browser tillader JavaScript.
Er du interesseret i GRATIS e-bøger og relevante opdateringer fra Bookboon?
Efter du har indtastet din email addresse, modtager du en bekræftelsesmail. Venligst acceptér denne for at modtage vores ugentlige eBooks update. Vi giver ikke din personlige information videre.
eLib
Opnå din organisations potentiale
Se Demo

Corporate eLibrary

Se vores erhvervsløsninger til intern uddannelse

Dette er en Premium eBog

Bookboon Premium - Få adgang til over 800 eBøger - uden annoncer

Du kan få gratis adgang i 30 dage til denne - og 800 andre bøger via Premium abonnementet. Du kan også købe bogen nedenfor

  • Start et 30 dages prøveabonnement. Efter 30 dage: 39,99 kr pr/måned
  • Start et 30 dages prøveabonnement. Efter 30 dage: €5,99 pr/måned
  • Start et 30 dages prøveabonnement. Efter 30 dage: £4,99 pr/måned
  • Start et 30 dages prøveabonnement. Efter 30 dage: ₹299 pr/måned
  • Start et 30 dages prøveabonnement. Efter 30 dage: $3,99 pr/måned
  • Start et 30 dages prøveabonnement. Efter 30 dage: 39,99 kr pr/måned
  • Start et 30 dages prøveabonnement. Efter 30 dage: 39,99 kr pr/måned
eLib
Opnå din organisations potentiale
Klik her

Corporate eLibrary

Se vores erhvervsløsninger til intern uddannelse

Om bogen

  1. Beskrivelse
  2. Indholdsfortegnelse

Beskrivelse

A concise introduction to data structures and algorithms in Ruby. Data structures are presented in a container hierarchy that includes stacks and queues as non-traversable dispensers, and lists, sets, and maps as traversable collections. Algorithm analysis is introduced and applied to linear and binary search, bubble sort, selection sort, insertion sort, merge sort and quicksort. The book also covers heaps and heapsort, unbalanced binary search trees, AVL trees, 2-3 trees, hashing, graph representations, and graph algorithms based on depth-and breadth-first search.

About the author

Christopher Fox is a Professor and Director of the Undergraduate Program in Computer Science at James Madison University. He holds a Ph.D. in Information Studies and an M.S. in Computer Science from Syracuse University, and M.A. and B.A. degrees in Philosophy from Michigan State University. Dr. Fox has over 20 years experience teaching Computer Science at JMU, Bowling Green State University, Villanova, Rutgers, and Colgate. Dr. Fox also spent a decade in software research and development at various companies, including AT&T Bell Laboratories. He has published numerous articles and several books, including Introduction to Software Engineering in the Unix/C Environment, and Introduction to Software Engineering Design.

Indholdsfortegnelse

  1.   Introduction 
  2.   Built-In Types 
  3.   Containers 
  4.   Assertions 
  5.   Stacks 
  6.   Queues 
  7.   Stacks and Recursion 
  8.   Collections and Iterators 
  9.   Lists 
  10.   Analyzing Algorithms 
  11.   Function Growth Rates 
  12.   Basic Sorting Algorithms 
  13.   Recurrences 
  14.   Merge Sort and Quicksort 
  15.   Trees, Heaps, and Heapsort 
  16.   Binary Trees 
  17.   Binary Search and Binary Search Trees 
  18.   AVL Trees 
  19.   2–3 Trees 
  20.   Sets 
  21.   Maps 
  22.   Hashing 
  23.   Hashed Collections 
  24.   Graphs 
  25.   Graph Algorithms 

This website uses cookies to improve user experience. By using our website you consent to all cookies in accordance with EU regulation.