Teaching Tree. What every computer science major should know. Portfolio versus resume Having emerged from engineering and mathematics, computer science programs take a resume-based approach to hiring off their graduates. A resume says nothing of a programmer's ability. Every computer science major should build a portfolio. A portfolio could be as simple as a personal blog, with a post for each project or accomplishment.
A better portfolio would include per-project pages, and publicly browsable code (hosted perhaps on github or Google code). Contributions to open source should be linked and documented. A code portfolio allows employers to directly judge ability. GPAs and resumes do not. Professors should design course projects to impress on portfolios, and students, at the conclusion of each course, should take time to update them. Examples Technical communication Lone wolves in computer science are an endangered species. Modern computer scientists must practice persuasively and clearly communicating their ideas to non-programmers.
Specific recommendations Java. Algorithmist. Newfinancepage.html. Scott Burton Financial Software Projects Graduate Division - Computer Science Tuesday 7:10-9:00 WWH Room WWH 3 This course will be taught by a veteran Wall St. technology manager currently employed at a top tier investment bank. The theme of this course will be “applied case study” and will focus on Fixed Income markets. Pre-requisites: It is assumed that the students can code in C++ or C for the server side. No prior experince in the financial sector is required - just a desire to learn it. Reference Materials: Software Engineering: Soul of a New Machine - Tracy Kidder The Mythical Man - Month - Fred Brooks (this is the only text students will need to purchase) Application Domain: (should be available in library): The Handbook of Global Fixed Income Calculations - Dragomir Krgin The Money Markets - Marcia Stigum Security Analysis - Graham and Dodd Handouts Course Objectives: 1. 2. 3. 4. 5. 6.
Grading policy: The final project will be a working app built using the library submitted at mid-term. Jeff Erickson's Algorithms Course Materials. Advanced Data Structures (6.851) Prof. Erik Demaine TAs: Tom Morgan, Justin Zhang [Home] [Lectures] [Assignments] [Project] [Problem Session] Data structures play a central role in modern computer science. You interact with data structures even more often than with algorithms (think Google, your mail server, and even your network routers). In addition, data structures are essential building blocks in obtaining efficient algorithms. Specifics Lecture time: Tuesday & Thursday 11–12:30 First lecture: Tuesday, February 7, 2012 Lecture room: 4-163 Units: 3-0-9, H-level & EC credit Registration: Subscribe to 6851-students mailing list on the web.
Prerequisites The required prerequisite is 6.046, Design and Analysis of Algorithms or an equivalently thorough undergraduate algorithms class from another school (e.g., covering much of CLRS). Grading There are three requirements, other than attending lectures: Scribing one, maybe two, lectures. LaTeX Help Homework solutions, scribe notes, and final projects must be typeset in LaTeX. CS 61A Home Page. Course Resources Contest Results You have selected the winners of the Recursion Exposition! Here they are: The results from the Pig contest are in! Our top finishers out of 34 entries: Other Useful Information Course Schedule About Viewing Documents Course documents available through these Web pages are either plain text files, Postscript files, or PDF (Portable Document Format) files. How to Design Programs. Types and Programming Languages.