Review1 - ConsideringCS2 As you would expect CS-2 is harder...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Computer Science I - Martin Hardwick Lecture 1 -- 1 Considering CS-2 As you would expect CS-2 is harder than CS-1. More difficult programming projects. More self-study required You are ready for CS-2 if you receive an A in CS -1 If you receive a B you must ask yourself Am I comfortable writing programs like merge_sort. There will be many more programs like this in CS 2 – Traversing trees, Sorting trees etc And they will be harder to debug because you will need to use C++  pointers  – Pointer variables can easily get “lost” in storage space – You have to find the line of code where they start to get lost If you receive a B in CS-1 you must be ready to study harder in CS-2 and you should practice programming on your own between the semesters Try implementing bubble_sort and insertion_sort
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Computer Science I - Martin Hardwick Lecture 1 -- 2 CS-1 Grades I will follow these rules when computing your grade
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 5

Review1 - ConsideringCS2 As you would expect CS-2 is harder...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online