Skip navigation

Bookboon.com Download free eBooks and textbooks

Choose a category

Ruby Data Structures and Algorithms

Ruby Data Structures and Algorithms
Not enough reviews yet
ISBN: 978-87-403-1955-2
1 edition
Pages : 248
  • Price: 129.00 kr
  • Price: €13.99
  • Price: £13.99
  • Price: ₹250
  • Price: $13.99
  • Price: 129.00 kr
  • Price: 129.00 kr

Download for FREE in 4 easy steps...

We are terribly sorry, but in order to download our books or watch our videos, you will need a browser that allows JavaScript.
After entering your email address, a confirmation email will be sent to your inbox. Please approve this email to receive our weekly eBook update. We will not share your personal information with any third party.
eLib
Unlock your organization's learning potential
See Demo

Corporate eLibrary

Discover our employee learning solutions

This is a Premium eBook

Bookboon Premium - Gain access to over 800 eBooks - without ads

You can get free access for a month to this - and 800 other books with the Premium Subscription. You can also buy the book below

  • Start a 30-day free trial. After trial: 39.99 kr p/m
  • Start a 30-day free trial. After trial: €5.99 p/m
  • Start a 30-day free trial. After trial: £4.99 p/m
  • Start a 30-day free trial. After trial: ₹299 p/m
  • Start a 30-day free trial. After trial: $3.99 p/m
  • Start a 30-day free trial. After trial: 39.99 kr p/m
  • Start a 30-day free trial. After trial: 39.99 kr p/m
eLib
Unlock your organization's learning potential
Click here!

Corporate eLibrary

Discover our employee learning solutions

About the book

  1. Description
  2. Content

Description

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.

Content

  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.