skip to main content
10.1145/65293.71210acmconferencesArticle/Chapter ViewAbstractPublication PagessigcseConference Proceedingsconference-collections
Article
Free Access

Operations on sets of intervals - an exercise for data structures or algorithms

Authors Info & Claims
Published:01 February 1989Publication History

ABSTRACT

Ordered linked lists are introduced in data structures courses and are frequently encountered in the study of algorithms. Set operations (e.g. union, intersection) on sets of real intervals provide a non-trivial exercise in developing correct algorithms for manipulating lists.

References

  1. 1.Aho, A.V., J.E. Hopcroft, and J.D. Unman. Data Structures and Algorithms, Addison- Wesley, 1983. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. 2.Dijkstra, E.W. A Discipline of Programming, Prentice-Hall, 1976. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.Horowitz, E. and S. Sahni. Fundamentals of Data Structures in Pascal, 2nd ed., Computer Science Press, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.Sedgewick, R. Algorithms, 2nd ed., Addison- Wesley, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.Ullman, J.D. Principles of Database Systems, 2nd ed., Computer Science Press, 1982. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.Ullman, J.D. Computational Aspects of VLSI, Computer Science Press, 1984. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Operations on sets of intervals - an exercise for data structures or algorithms

                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
                • Published in

                  cover image ACM Conferences
                  SIGCSE '89: Proceedings of the twentieth SIGCSE technical symposium on Computer science education
                  February 1989
                  309 pages
                  ISBN:0897912985
                  DOI:10.1145/65293

                  Copyright © 1989 ACM

                  Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                  Publisher

                  Association for Computing Machinery

                  New York, NY, United States

                  Publication History

                  • Published: 1 February 1989

                  Permissions

                  Request permissions about this article.

                  Request Permissions

                  Check for updates

                  Qualifiers

                  • Article

                  Acceptance Rates

                  Overall Acceptance Rate1,595of4,542submissions,35%

                  Upcoming Conference

                  SIGCSE Virtual 2024

                PDF Format

                View or Download as a PDF file.

                PDF

                eReader

                View online with eReader.

                eReader