Communications of the ACM
Teaching internet algorithmics
Proceedings of the thirty-second SIGCSE technical symposium on Computer Science Education
Defensive climate in the computer science classroom
SIGCSE '02 Proceedings of the 33rd SIGCSE technical symposium on Computer science education
Science of computing suite (SOCS): resources for a breadth-first introduction
Proceedings of the 35th SIGCSE technical symposium on Computer science education
Use and assessment of a rigorous approach to CS1
Proceedings of the 36th SIGCSE technical symposium on Computer science education
Content and laboratories of a computing science course for non-majors in the 21st Century
Journal of Computing Sciences in Colleges
Weaving CS into CS1: a doubly depth-first approach
Proceedings of the 38th SIGCSE technical symposium on Computer science education
Perceptions of Computer Science at a South African university
Computers & Education
Breadth-last technical electives: integrating the CS core via computer games and mobile robotics
Proceedings of the 40th ACM technical symposium on Computer science education
A unified approach to introductory computer science: can one size fit all?
ITiCSE '09 Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education
Proceedings of the 42nd ACM technical symposium on Computer science education
A data-centric introduction to computer science for non-majors
Proceeding of the 44th ACM technical symposium on Computer science education
Hi-index | 0.00 |
A first course in computer science that loosely follows the Computing Curricula 2001 report is described. This course blends theory and practice, highlights algorithm design, introduces a modest amount of imperative programming, and uses an Internet algorithmics theme to tie the topics together and keep the course both challenging and interesting to those with and without previous computing experience.