simple insertion of the ordered letters into an initially nil tree. Extend your answer to describe an algorithm which will order the letters to produce any given binary trees containing each letter exactly once. A Design Problem Synthesis [4]: to Encourage A druggist must keep records of all prescriptions she has filled, including i n f o r m a t i o n on the drug, p a t i e n t ' s name, and date filled; and she must be able to retrieve these records by patient's name (for processing refill), patient's family name (for tax purposes), date (for doctor's inquiries), and m o n t h (for billing). Design a data structure to store and retrieve this information. Your structure should be practical and efficient; the druggist fills m a n y prescriptions each day, and new customers arrive in town frequently. Also, your design should assume that there is too much data to rely solely upon storage in main memory, so disk storage is needed. In discussing your data structure, specify the n e e d e d d e c l a r a t i o n s and draw
End of preview. The entire article is 2 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/service-learning-via-the-computer-science-club-NXw0gb0SvP
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Service learning via the computer science club
Gersting, Judith L.; Young, Frank H.
Follow ACM SIGCSE Bulletin
, Volume 30 (4)
Association for Computing Machinery – Dec 1, 1998
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
