ESTIMATING A LABORATORY EXECUTION EXERCISE TIMES: FOR CS2 William J. Collins Computer Science Department Lafayette College PA 18042 Easton, ABSTRACT A laboratory exercise for CS2 In the exercise, is presented. students are given seven different implementations of an operator to insert an item into an ordered list. After estimating the time to insert 1000 random integers into an initially empty list for each implementation, students determine the times experimentally and then answer some related questions. The exercise enables students to gain insight into several important dichotomies: linked vs. contiguous, recursive vs. iterative, and dynamic vs. static. a number of random imtegers into an initially empty ordered-list. They are also given the times, in increasing order, from running the with each of the seven program The variety of implementations. affords a good implementations for experimentation opportunity and inference-drawing. In the first part of the exercise, students estimate the execution time for running the program with each of the seven implementations. Then the students run the program and compare the results with their original estiThey are mates. also asked to draw inferences from the experiment. Finally, some related conjectures, tests and inferences are requested. The to enable into the 1.
End of preview. The entire article is 6 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/estimating-execution-times-a-laboratory-exercise-for-cs2-OYYFa6owIZ
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Estimating execution times: a laboratory exercise for CS2
Collins, William J.
Follow ACM SIGCSE Bulletin
, Volume 23 (1)
Association for Computing Machinery – Mar 1, 1991
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
