New algorithms research for first year students

Working Group Reports on ITiCSE on Innovation and Technology in Computer Science Education 2006

Volumn , Issue , 2006, Pages 128-132

  Wirth, Anthony ^a   Bertolacci, Michael ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Approximation algorithms; CS1 2; Haskell; Research led teaching; Undergraduate research capstones

Indexed keywords

COMPUTER PROGRAMMING; LEARNING SYSTEMS; MATHEMATICAL PROGRAMMING; STUDENTS;

HASKELL; RESEARCH-LED TEACHING; UNDERGRADUATE RESEARCH/CAPSTONES;

APPROXIMATION ALGORITHMS;

EID: 34548363964     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1140124.1140160     Document Type: Conference Paper

References (19)

1. N. Ailon, M. Charikar, and A. Newman. Aggregating inconsistent information: ranking and clustering. In 37th Symposium on Theory of Computing (STOC), pages 684-93, 2005.
2. Centre for Academic Practice, University of Warwick. Research-based learning, http://www2.warwick.ac.uk/services/cap/eddev/rbl/whatis/.
3. W. Combs, R. Hawkins, T. Pore, A. Schechet, T. Wahls, and L. Ziantz. The course scheduling problem as a source of student projects. In 36th SIGCSE, pages 81-5, 2005.
4. D. Coppersmith, L. Fleischer, and A. Rudra. Ordering by weighted number of wins gives a good ranking for weighted tournaments. In 17th Symposium on Discrete Algorithms (SODA), 2006. to appear.
5. H. Davis and S. White. A research-led curriculum in multimedia: Learning about convergence. In 10th ITiCSE, pages 29-33, 2005.
6. P. Denning and A. McGettrick. Recentering computer science. CACM, 48(11):15-9, 2005.
7. R. Haddad and D. Knuth. A programming and problem-solving seminar. Technical Report 1055, Stanford University, 1985. Accompanying video at http ://scpd.stanford.edu/knuth/.
8. R. Karp. Report of the SIGACT committee on funding for theoretical computer science. http://theorymatters.org/pmwiki/uploads/Main/focssigactkarp. pdf, 2005.
9. J. Kleinberg and E. Tardos. Algorithm Design. Addison-Wesley, 2006.
10. A. Levitin. Introduction to the Design and Analysis of Algorithms. Addison-Wesley, 2002.
11. A. Levitin. Analyze That: Puzzles and analysis of algorithms. In 36th SIGCSE, pages 171-5, 2005.
12. W. Marrero and A. Settle. Testing first: Emphasizing testing in early programming courses. In 10th ITiCSE, pages 4-8, 2005.
13. D. Patterson. Restoring the popularity of computer science. CACM, 48(9):25-8, 2005.
14. S. Robila, A. Kumar, D. Baldwin, and C. Congdon. Considerations on undergraduate computer science research. J. Comp. Sci. Coll., 20(5):91-5, 2005.
15. R. Sedgewick. Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching. Addison-Wesley, third edition, 1997.
16. M. Sipser. Introduction to the Theory of Computation. Thomson Course Technology, second edition, 2005.
17. The Boyer Commission on Educating Undergraduates in the Research University. Reinventing undergraduate education: A blueprint for America's research universities. http://naples.ce.sunysb.edu/Pres/boyer.nsf/, 1998.
18. The University of Melbourne. Nine principles regarding teaching and learning in the University of Melbourne. http://www.unimelb.edu.au/student/ nineprinciples.html, 2002.
19. A. Wirth. 433-152 Algorithmic Problem Solving (Advanced) Project: Ranking players in a tournament. http://www.esse.unimelb.edu.au/awirth/pubs/iticse06/ proj/, 2005.