This chapter introduces the data structures necessary to define a discrete random variable in APPL and surveys some simple algorithms associated with discrete random variables. The first section will show that the nature of the support of discrete random variables makes the data structures required much more complicated than for continuous random variables.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
(2008). Data Structures and Simple Algorithms. In: Computational Probability. In Operations Research & Management Science, vol 117. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74676-0_6
Download citation
DOI: https://doi.org/10.1007/978-0-387-74676-0_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-74675-3
Online ISBN: 978-0-387-74676-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)