Yet another analysis of algorithms laboratory

Authors:
Ed C. Epp
Affiliations:
-
Venue:
ACM SIGCSE Bulletin
Year:
1992

Citing 1
Cited 3

Three “lab assignments” for an algorithms course

ACM SIGCSE Bulletin

The KLYDE workbench for studying experimental algorithm analysis

SIGCSE '94 Proceedings of the twenty-fifth SIGCSE symposium on Computer science education
A gentle introduction to algorithm complexity for CS1 with nine variations on a theme by Fibonacci

ACM SIGCSE Bulletin
An analysis of algorithms laboratory utilizing the maximum segment sum problem

ACM SIGCSE Bulletin

Quantified Score

Hi-index	0.00

Visualization

Abstract

Laboratory assignments can reinforce material given in lecture by making it come alive in practice. A prime example is the time complexity of algorithms. However, laboratories that confirm the time complexity of algorithms can be tedious exercises that do not really challenge a student to think about the algorithms they are testing. By giving students a set of unknown executables, the laboratory becomes more of a detective problem. Students are required to apply what they know about the sort algorithms so that they can identify them.