Classroom exercise demonstrating linked list operations
Abstract
Recommendations
Classroom exercise demonstrating linked list operations
ITiCSE-WGR '06: Working group reports on ITiCSE on Innovation and technology in computer science educationThis paper describes a strategy whereby, using directly manipulable items, one can show the behaviors of a linked list, and even show some of the details of linked list manipulations. The students themselves operate as the linked list nodes, and retain ...
Lock-free linked lists and skip lists
PODC '04: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computingLock-free shared data structures implement distributed objects without the use of mutual exclusion, thus providing robustness and reliability. We present a new lock-free implementation of singly-linked lists. We prove that the worst-case amortized cost ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
- June 200699 pagesISBN:1595936033DOI:10.1145/1189215
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 549Total Downloads
- Downloads (Last 12 months)3
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in