Differences between revisions 13 and 45 (spanning 32 versions)
|
Size: 2273
Comment:
|
Size: 3274
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 3: | Line 3: |
| = COMP1917: Computing 1 = | = Course Homepage = |
| Line 5: | Line 5: |
| ||<#cccccc>~+ Course Material +~ ||<#ccccff> ~+ '''[[http://www.cse.unsw.edu.au/~cs1917/10s1|2010 s1]]''' +~<<BR>>''current session'' ||<#cccccc> ~-[[http://www.cse.unsw.edu.au/~cs1917/09s2|2009 s2]]-~ ||<#cccccc> ~-[[http://www.cse.unsw.edu.au/~cs1917/09s1|2009 s1]]-~ ||<#cccccc> ~-[[http://www.cse.unsw.edu.au/~cs1917/08s2|2008 s2]]-~ ||<#cccccc> ~-[[http://www.cse.unsw.edu.au/~cs1917/08s1|2008 s1]]-~ || | == COMP1917 Computing 1 == |
| Line 7: | Line 7: |
| ||<#cccccc>~+ Course Material +~ ||<#ccccff>~+[[https://www.openlearning.com/courses/99luftballons/|2015 s1]]+~ <<BR>> ~+ ''current session'' +~||<#cccccc>~-[[https://www.openlearning.com/courses/99luftballons/|2014 s1]]-~ <<BR>> ~- [[http://www.cse.unsw.edu.au/~cs1917/14s2|2014 s2]] -~||<#cccccc> ~- [[https://www.openlearning.com/unsw/courses/computing1|2013 s1]] -~ <<BR>> ~-[[http://www.cse.unsw.edu.au/~cs1917/13s2|2013 s2]] -~||<#cccccc> ~-[[http://www.openlearning.net/courses/Comp1917|2012 s1]] <<BR>>[[http://www.cse.unsw.edu.au/~cs1917/12s2|2012 s2]] -~ ||<#cccccc> ~-[[http://openlearning.cse.unsw.edu.au/Comp1917/2011s1|2011 s1]] <<BR>> [[http://www.cse.unsw.edu.au/~cs1917/11s2|2011 s2]]-~ ||<#cccccc> ~-[[http://www.cse.unsw.edu.au/~cs1917/10s1|2010 s1]]<<BR>>[[http://www.cse.unsw.edu.au/~cs1917/10s2|2010 s2]]-~ ||<#cccccc> ~-[[http://www.cse.unsw.edu.au/~cs1917/09s1|2009 s1]]<<BR>>[[http://www.cse.unsw.edu.au/~cs1917/09s2|2009 s2]]-~ ||<#cccccc> ~-[[http://www.cse.unsw.edu.au/~cs1917/08s1|2008 s1]]<<BR>>[[http://www.cse.unsw.edu.au/~cs1917/08s2|2008 s2]]-~ ||<#ccccff> ~+ '''[[http://wiki.cse.unsw.edu.au/openlearning|2008 YouTube Version]]''' +~<<BR>>''see [[http://wiki.cse.unsw.edu.au/openlearning|openlearning]] site''|| Update: 2011 Version of the course PLUS course materials are being released throughout 2012. |
|
| Line 21: | Line 24: |
| * Understand and appropriately use abstraction. | |
| Line 22: | Line 26: |
| * Create and use dynamic data structures such as linked lists and trees. | * Create and use dynamic data structures such as linked lists. |
Course Homepage
COMP1917 Computing 1
Course Material |
2015 s1 |
2008 YouTube Version |
Update: 2011 Version of the course PLUS course materials are being released throughout 2012.
Overview
Introduction to programming and computer science. Introduction to C, problem solving, debugging, programming style, unit testing, teamwork. Recursion, security, memory, pointers, and dynamic data structures.
Objectives
After completing COMP1917, you should be able to:
- Design solutions for simple problems.
- Design solutions for larger problems using abstraction and interfaces.
- Distinguish between well-written programs and poorly written programs.
- Write programs using good programming style.
- Understand and appropriately use abstraction.
- Have a solid understanding of the use memory and pointers in C.
- Create and use dynamic data structures such as linked lists.
- Test and debug programs.
- Work in a team to develop software.
Specific Skills
About the Course
Student Resources
Staff Resources
CategoryCourseHomePage | 267161 page views