To take part in discussions on talkSFU, please apply for membership (SFU email id required).

what is cmpt 225 about?

edited June 2014 in General
course description says we'll learn about sorting/trees/etc.

I know cmpt 125 does not cover all the data structures but it seems like half of them are already from cmp125.

is it just reviewing cmpt125 stuff or is it advanced version of cmpt 125 + new data structure algorithms?

Comments

  • CMPT 225 is about data structures and algorithms. 

    On the data structures front typically in CMPT 120/130/125/135 the majority of assignments deal with basic types (int/char/bool etc) or included complex types (lists/dictionaries etc.) In 225 you will actually implement data types as classes, things like trees, stacks, queues, hash tables, etc. Now many languages have libraries that implement a lot of these data types for you, but learning how to do it yourself gives you a far greater appreciation for what each is of them is good for. As well it is good OOP practice.

    On the algorithms front it is mostly sorting algorithms. This is also very important since so many computing problems boil down to sorting at some point, and knowing how to implement different sorting algorithms and what there running time is will be valuable in the future. 

    So yeah some of the stuff will be things you perhaps saw in 125, but it is definitely a more advanced version. On the whole though there is a lot of new stuff, and you will find yourself having to design more than you did in 125. 225 is a very important prerequisite for future computing courses.120 and 125 are mostly syntax courses. 225 is when things start to get a little more real. Understanding what is presented in 225 will prepare you well for the upper division computing courses you will eventually take.

Leave a Comment