skip to main content
article
Free Access

Designing stimulating programming assignments for an algorithms course: a collection of exercises based on random graphs

Published:01 September 1996Publication History
Skip Abstract Section

Abstract

The field of random graphs contains many surprising and interesting results. Here we demonstrate how some of these results can be used to develop stimulating, open-ended exercises for courses in algorithms and data structures or graph theory. Specifically, we provide problems for algorithms that compute minimum spanning trees, connected components, maximum flows, and all-pairs shortest paths.

References

  1. [1] M. Atjai, J. Komlós, and E. Szemedrédi. Largest Random Component of a k-Cube. Combinatorica. 2, 1982, 1-7.Google ScholarGoogle Scholar
  2. [2] B. Bollobás. Random Graphs. Academic Press, 1985.Google ScholarGoogle Scholar
  3. [3] B. Bollobás, Y. Kohayakawa, and T. Luczak. The Evolution of Random Subgraphs of the Cube. Random Structures and Algorithms. 3, 1992, 55-90.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. [4] B. Bollobás, Y. Kohayakawa, and T. Luczak. On the Diameter and Radius of Random Subgraphs of the Cube. Random Structures and Algorithms. 5, 1994, 627-648.Google ScholarGoogle ScholarCross RefCross Ref
  5. [5] T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. MIT Press, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. [6] A. Frieze. On the Value of a Random Minimum Spanning Tree Problem. Discrete Applied Math. 10, 1985, 47-56.Google ScholarGoogle ScholarCross RefCross Ref
  7. [7] B. Hajek. Asymptotic Analysis of an Assignment Problem Arising in a Distributed Communications Protocol. Proceedings of the 27th Conference on Decision and Control. 1988, 1455-1459.Google ScholarGoogle ScholarCross RefCross Ref
  8. [8] A.V. Kostochka, A.A. Sapozhenko, and K. Weber. Radius and Diameter of Random Subgraphs of the Hypercube. Random Structures and Algorithms. 4, 1993, 215-229.Google ScholarGoogle ScholarCross RefCross Ref
  9. [9] D. Kozen. The Design and Analysis of Algorithms. Springer-Verlag, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. [10] S. Lumetta, A. Krishnamurthy, and D. Culler. Towards Modeling the Performance of a Fast Connected Components Algorithm on Parallel Machines. Available at http://www.cs.berkeley.edu/~stevel. Conference version at http://www.supercomp.org/sc95/proceedings/465_SLUM/SC95.HTM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. [11] R. Sedgewick. Algorithms. Addison-Wesley Publishing Co., 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Designing stimulating programming assignments for an algorithms course: a collection of exercises based on random graphs

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in

            Full Access

            • Published in

              cover image ACM SIGCSE Bulletin
              ACM SIGCSE Bulletin  Volume 28, Issue 3
              Sept. 1996
              68 pages
              ISSN:0097-8418
              DOI:10.1145/234867
              Issue’s Table of Contents

              Copyright © 1996 Author

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 1 September 1996

              Check for updates

              Qualifiers

              • article
            • Article Metrics

              • Downloads (Last 12 months)3
              • Downloads (Last 6 weeks)0

              Other Metrics

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader
            About Cookies On This Site

            We use cookies to ensure that we give you the best experience on our website.

            Learn more

            Got it!