3
Congratulations! We covered a lot of ground C: pretty much all of it C++: fundamentals, STL Data structures: linked list, BST, graph Algorithms: merge sort, big-O, recursions UNIX programming environment: vim/emacs, gcc, make, git Enjoy your accomplishments – big and small Do not compare with peers Compare with yourself 12 weeks ago Stress? What stress? Have fun; be happy; be honest to yourself Life is long. Really. Go have a Roti Roll

Congratulations! We covered a lot of ground –C: pretty much all of it –C++: fundamentals, STL –Data structures: linked list, BST, graph –Algorithms: merge

Embed Size (px)

Citation preview

Page 1: Congratulations! We covered a lot of ground –C: pretty much all of it –C++: fundamentals, STL –Data structures: linked list, BST, graph –Algorithms: merge

Congratulations!• We covered a lot of ground

– C: pretty much all of it– C++: fundamentals, STL– Data structures: linked list, BST, graph– Algorithms: merge sort, big-O, recursions– UNIX programming environment: vim/emacs, gcc, make, git

• Enjoy your accomplishments – big and small– Do not compare with peers– Compare with yourself 12 weeks ago

• Stress? What stress?– Have fun; be happy; be honest to yourself– Life is long. Really.– Go have a Roti Roll

Page 2: Congratulations! We covered a lot of ground –C: pretty much all of it –C++: fundamentals, STL –Data structures: linked list, BST, graph –Algorithms: merge

Beyond 3136

• Please fill out CourseWorks evaluation

• Please do NOT share your materials– NEVER upload any class-related code

(both mine and yours) to GitHub, etc.

• Keep programming!

Page 3: Congratulations! We covered a lot of ground –C: pretty much all of it –C++: fundamentals, STL –Data structures: linked list, BST, graph –Algorithms: merge

All good things…