Algorithms in C: Parts 1-4, Fundamentals, Data Structures, Sorting, and Searching
Algorithms in C: Parts 1-4, Fundamentals, Data Structures, Sorting, and Searching
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Introduction to the Design and Analysis of Algorithms
Introduction to the Design and Analysis of Algorithms
A Programming and Problem-Solving Seminar
A Programming and Problem-Solving Seminar
The course scheduling problem as a source of student projects
Proceedings of the 36th SIGCSE technical symposium on Computer science education
Analyze that: puzzles and analysis of algorithms
Proceedings of the 36th SIGCSE technical symposium on Computer science education
Algorithm Design
Considerations on undergraduate computer science research
Journal of Computing Sciences in Colleges
Aggregating inconsistent information: ranking and clustering
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Testing first: emphasizing testing in early programming courses
ITiCSE '05 Proceedings of the 10th annual SIGCSE conference on Innovation and technology in computer science education
A research-led curriculum in multimedia: learning about convergence
ITiCSE '05 Proceedings of the 10th annual SIGCSE conference on Innovation and technology in computer science education
Restoring the popularity of computer science
Communications of the ACM - Special issue: RFID
Communications of the ACM
Ordering by weighted number of wins gives a good ranking for weighted tournaments
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Proceedings of the 16th annual conference reports on Innovation and technology in computer science education - working group reports
| Hi-index | 0.00 |
Motivated first-year undergraduate students should be exposed to some of the processes of research and some of the latest results. This brings them into the university culture quickly and encourages them to feel part of the development of the computer science discipline.To this end, students in a second-semester first-year computer science subject were presented with a programming project in which the goal was to implement several approximation algorithms for an active research problem. In addition, they were asked to complete four related mathematical puzzles. The lecturer author and the student author show how this project proved to be an exciting experience for them both. The paper concludes with some suggestions for expanding the research influence in this subject.