A Rotation of Data Structures

Simple item page
dc.contributor.authorCook, Thomas
dc.contributor.authorMentis, Alexander S.
dc.contributor.authorOkasaki, Chris
dc.date.accessioned2023-10-13T16:29:43Z
dc.date.available2023-10-13T16:29:43Z
dc.date.issued2023-04
dc.description.abstractThis paper provides options for varying the details of certain topics from semester to semester in a data structures course that focuses—at least to some extent—on the implementation of data structures. The data structures considered are variations on balanced binary search trees and mergeable heaps (priority queues).
dc.description.sponsorshipDepartment of Electrical Engineering and Computer Science
dc.identifier.citationThomas Cook, Alexander Mentis, and Chris Okasaki, "A Rotation of Data Structures," Journal of Computing Sciences in Colleges 38, No. 8 (April 2023): 29--38.
dc.identifier.urihttps://hdl.handle.net/20.500.14216/876
dc.publisherConsortium of Computing Sciences in Colleges
dc.subjectdata structures
dc.subjectcurriculum design
dc.titleA Rotation of Data Structures
dc.typeJournal articles
local.USMAemailchris.okasaki@westpoint.edu
local.peerReviewedYes

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
ARODS.pdf
Size:
423.03 KB
Format:
Adobe Portable Document Format
Download

Collections

Works of Scholarship