500 likes | 771 Views
Intro. Name: Chun ping Wang Why? No idea Current status: Senior. What is computer science?. 1.Finding ways to solve answer. 2. Software designing. 3. Finding relation between software and hardware. 4. Finding relation between software and hardware. .
E N D
Intro Name: Chun ping Wang Why? No idea Current status: Senior
What is computer science? 1.Finding ways to solve answer. 2. Software designing. 3. Finding relation between software and hardware. 4. Finding relation between software and hardware.
Software needed (IDE and they are all free). • Eclipse (http://www.eclipse.org) • DevC++ (http://www.bloodshed.net). • Visual Studio • Jbuilder (http://www.Borland.com) • Swi prolog (http://www.Swi-prolog.org) • Hugs (http://www.Haskell.org)
Software needed (Communication). • Web mail (http://webmail.calstatela.edu/core/imp). • Ssh client (http://www.ssh.org) • Internet access. • Book review site especially for classes requiring c++.
Resource and network. • ACM • CS student network. • Your classmate. • Faculty
Before Cal State Los Angeles Credits: 4 Course: Math 103 Where: East Los Angeles College.
Fall 2001 Courses • NSS 101 (USELESS). • CS 201 • MATH 206 • ENG 95
CS 122 CS 120 Math 103 Cs 201 Math 206 Math 207 P 201 Cs 202 Cs 245 Math 208 P 202 Cs 203 Math 248 CS 320 Math 255 P 203 Cs 386 Cs 332 Cs 312 Cs 491 a Cs 440 EE 444 Cs 437 Math 270 Cs 491b Cs 490
2001 Courses (CS 201) • Language: Java or C++ • Lessons • Binary search • Sorting • Writing functions • Doing a small group project.
Winter 2002 • English 96 • Math 207 • Cs 202 • Political Science 150
CS 122 CS 120 Math 103 Cs 201 Math 206 Math 207 P 201 Cs 202 Cs 245 Math 208 P 202 Cs 203 Math 248 CS 320 Math 255 P 203 Cs 386 Cs 332 Cs 312 Cs 491 a Cs 440 EE 444 Cs 437 Math 270 Cs 491b Cs 490
2002 Courses (CS 202). • Language: Java or C++ • Lesson • Classes. • Functions. • Object Oriented Programming. • Debugging in Jbuilder
Spring 2002 • English 101 (A1 Written Communication) • Math 208 • History 202 b • Cs 212
CS 122 CS 120 Math 103 Cs 201 Math 206 Math 207 P 201 Cs 202 Cs 245 Math 208 P 202 Cs 203 Math 248 CS 320 Math 255 P 203 Cs 386 Cs 332 Cs 312 Cs 491 a Cs 440 EE 444 Cs 437 Math 270 Cs 491b Cs 490
2002 Courses (CS 212). • Language: Java or C++ • Lessons • Data structure. • How to use the library. • How to implement your own library. • Some complex algorithms.
Summer 2002 • Cs 312 • Math 248 • Criminology 126 (Cs 101 would have help). • Philosophy 250 (Block A3).
CS 122 CS 120 Math 103 Cs 201 Math 206 Math 207 P 201 Cs 202 Cs 245 Math 208 P 202 Cs 203 Math 248 CS 320 Math 255 P 203 Cs 386 Cs 332 Cs 312 Cs 491 a Cs 440 EE 444 Cs 437 Math 270 Cs 491b Cs 490
2002 Courses (Math 248). • Lesson • Counting • Shortest path algorithm • Depth first search • Trees • PAY ATTENTION.
2002 Courses (CS 312). • Language: Java or C++. • Lesson • Comparing Algorithms. • Polymorphism • Generic Programming (If taught in c++). • Finding efficient answer to your problems.
Fall 2002 • Cs 345 (elective) • Cs 240 • Math 255 • English 102
CS 122 CS 120 Math 103 Cs 201 Math 206 Math 207 P 201 Cs 202 Cs 245 Math 208 P 202 Cs 203 Math 248 CS 320 Math 255 P 203 Cs 386 Cs 332 Cs 312 Cs 491 a Cs 440 EE 444 Cs 437 Math 270 Cs 491b Cs 490
2002 Courses (CS 345). • Language: Shell programming, AWK, SED. • Lessons • Using Vi. • Scripting. • Shell programming. • Writing kernel process. • Suggested book: Beginning Linux Programming by Richard Stones.
Winter 2003 • Cs 340 (Cs Elective) • Cs 350 (Cs Elective) • Physics 201 • Sociology 201 (block D)
CS 122 CS 120 Math 103 Cs 201 Math 206 Math 207 P 201 Cs 202 Cs 245 Math 208 P 202 Cs 203 Math 248 CS 320 Math 255 P 203 Cs 386 Cs 332 Cs 312 Cs 491 a Cs 440 EE 444 Cs 437 Math 270 Cs 491b Cs 490
2003 Courses (CS 340). • Low level programming. • Data representation • Binary Processing.
2003 Courses (CS 350). • Language: C++ • Lesson • Vectors and Matrix • Serpensiki basket • Simple Transformation. • Advice: • 1. Pay Attention in Math 255. • 2. Find a good c++ books such as Accelerated c++.
Spring 2003 • Cs 450 (Cs Elective) • Math 270 • Physics 202 • Philosphy 152 (Block C3: Preview to Phil 373)
CS 122 CS 120 Math 103 Cs 201 Math 206 Math 207 P 201 Cs 202 Cs 245 Math 208 P 202 Cs 203 Math 248 CS 320 Math 255 P 203 Cs 386 Cs 332 Cs 312 Cs 491 a Cs 440 EE 444 Cs 437 Math 270 Cs 491b Cs 490
2003 Courses (CS 450). • Language: c++ • Lesson • Advance Transformation. • Rotation and shading. • Wrapping and screen transition • Simple Term: Apply your math 255 knowledge to c++ programming.
Summer 2003 • Cs 386 • Physics 203 • Art 101a (Block c2)
CS 122 CS 120 Math 103 Cs 201 Math 206 Math 207 P 201 Cs 202 Cs 245 Math 208 P 202 Cs 203 Math 248 CS 320 Math 255 P 203 Cs 386 Cs 332 Cs 312 Cs 491 a Cs 440 EE 444 Cs 437 Math 270 Cs 491b Cs 490
2003 Courses (CS 386) • A theory class. • DFA • NFA • Turing machine.
Fall 2003 Courses • Cs 437 • Cs 440 • Psychology 160 (block E) • Theatre Art 152 (block c1)
CS 122 CS 120 Math 103 Cs 201 Math 206 Math 207 P 201 Cs 202 Cs 245 Math 208 P 202 Cs 203 Math 248 CS 320 Math 255 P 203 Cs 386 Cs 332 Cs 312 Cs 491 a Cs 440 EE 444 Cs 437 Math 270 Cs 491b Cs 490
2003 Courses (CS 440) • Language: Any • Lesson • Locks and threads • Multiprocessing. • Scheduling Algorithm.
2003 Courses (CS 437). • Language: Any • Lesson • Working in team, choose GOOD PARTNER. • Picking up your partner slacks or vice versa (possible). • How to make schedules. • How to write documents. • Relation between designer and user.
Winter 2004 • Anthropology 250 (Block D, diversity). • Biology 156 (Block B1) • University 400 (WPE). • Cs 486 (Cs Elective) • Communication 150 (Block A2).
Spring 2004 • Cs 488 (Cs Elective) • Nutrition 351 (Block F upper). • University 401
2004 Courses (CS 486, CS 488). • Advanced Automata theory. • Designing a compiler. • How to Tokenize (JLex). • How to parse (YACC). • How to do code generation. • Advice: Being expose to material in CS 486 and CS 386 helps whether you understand or not.
Summer 2004 • Cs 491a • Geology 155 (Block D diversity). • Philosphy 373 (Block F) • Sociology 323 (Block F)
CS 122 CS 120 Math 103 Cs 201 Math 206 Math 207 P 201 Cs 202 Cs 245 Math 208 P 202 Cs 203 Math 248 CS 320 Math 255 P 203 Cs 386 Cs 332 Cs 312 Cs 491 a Cs 440 EE 444 Cs 437 Math 270 Cs 491b Cs 490
Fall 2004 • Cs 491b • Cs 332 • Cs 120 • EE 444
CS 122 CS 120 Math 103 Cs 201 Math 206 Math 207 P 201 Cs 202 Cs 245 Math 208 P 202 Cs 203 Math 248 CS 320 Math 255 P 203 Cs 386 Cs 332 Cs 312 Cs 491 a Cs 440 EE 444 Cs 437 Math 270 Cs 491b Cs 490
2004 Courses (CS 491a, CS 491b). • Plan ahead, do not start from scratch. • You have to present in front of the entire faculty member. • Advice: Take it during fall and winter. This leaves you with an EXTRA MONTH to work with.
2004 Courses (CS 332). • Language: Prolog and Haskell. • Lesson • Relearn the basics. • Data searching. • Functional programming • Operator overloading. • Polymorphism.
2004 Courses (CS 120). • Static webpage • HTML and java script. • Writing forums and user interaction.
Winter 2005 • Cs 122 • Cs 461 (Elective) • Math 325 • Cs 101
CS 122 CS 120 Math 103 Cs 201 Math 206 Math 207 P 201 Cs 202 Cs 245 Math 208 P 202 Cs 203 Math 248 CS 320 Math 255 P 203 Cs 386 Cs 332 Cs 312 Cs 491 a Cs 440 EE 444 Cs 437 Math 270 Cs 491b Cs 490
CONCLUSION. • Find good books on the specify topics. Its helpful to buy ADDITIONAL books then the one required. • Learn what teachers except. Your knowledge is useless if you can’t do what your boss ask you for.