Locked History Attachments

Diff for "COMP1917"

Differences between revisions 34 and 35
Revision 34 as of 2012-02-22 15:59:44
Size: 2804
Comment:
Revision 35 as of 2012-02-22 17:26:00
Size: 2794
Comment:
Deletions are marked like this. Additions are marked like this.
Line 25: Line 25:
  * 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

2012 s1
current session

2011 s1
2011 s2

2010 s1
2010 s2

2009 s1
2009 s2

2008 s1
2008 s2

2008 YouTube Version
see openlearning site

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.
  • 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 | 265089 page views