Views
3 years ago

CS 120 Course Syllabus - Computer Science

CS 120 Course Syllabus - Computer Science

CS

CS 120 Outline 1) Intro to Objects [Chapters 1 & 2] • objects and classes • edit, compile & run • syntax diagrams • parameterless method calls • constructing and assigning objects • declaring instance variables • Java comments 2) Intro to Implementation [Chapters 3&4] • algorithms & refinement • identifiers • intro to awt and swing • import declarations • private methods • parameter passage • intro to event handling • non-void methods • debugging in BlueJ 3) Primitive Classes & Expressions [Chapter 5] • int constants & expressions • float and double constants & expressions • mixed type numeric expressions • casting • char constants • assignment and parameter passage of primitive values • the basic swap algorithm 3) Developing Supplier Classes [Chapter 6] • data abstraction and encapsulation (private & public declarations) • local variables versus instance variables (scope and lifetime) • read access and write access to data • overloading • this • String data • the Scanner class 4) Boolean Expressions & Selection Control [Chapter 7] • relations • boolean data and expressions • short-circuit evaluation • Boolean functions (predicates) • assertions • the if instruction • I/O operations for debugging

5) Inheritance & Polymorphism [Chapters 8 and 9] • is_a relationships • inheritance for expanded behavior • constructors & inheritance • information hiding when using inheritance • the Java inheritance tree - Object class • method redefinition • type conformance • content equality versus identity equality 6) Repetition [Chapter 10] • a general while-type loop • common loop patterns • nested loops • a some cautions regarding loops 7) Intro to Container Classes [Chapter 11] • generic classes with autoboxing/unboxing • type safety, casting and instanceof • Java wrapper classes • a list container • iterator (an embedded feature of lists) • linear list processing algorithms 8) Arrays - Random Access Containers [Chapter 12] • one dimensional arrays • for loops • linear array processing, including searching • straight selection sort • linear insertion sort

CS - Department of Computer Science - Virginia Tech
Lecture notes - Computer Science - University of San Francisco
Course Introduction in PDF - Computer Science
CS 406-01 Lecture 20 Security and Ethics - Math & Computer Science
COMPUTER SCIENCE - Jones & Bartlett Learning
COMPUTER SCIENCE PROGRAM - Polytechnic University
CSCE 314 Programming Languages - TAMU Computer Science ...
Summer Programs PowerPoint (PDF) - Garfield Computer Science
Idenity Theft and Online Safety - Garfield Computer Science
Extreme Programming - Seidenberg School of Computer Science ...
Brookshear - Computer Science - An Overview 9e - Computarium LCD
Objects, Types, and Values - TAMU Computer Science Faculty Pages
ACM's Model Curriculum for K-12 Computer Science - CSTA
utt-syllabus - Living Waters Home School Courses
CS1520 – Recitation 01 - Department of Computer Science ...
Survey of Computer Science - Mathematics and Computer Science
Computing and Information Science Postgraduate Courses
Course Syllabus - Department of Rehabilitation Sciences - The ...
Course Outline - Computer Science and Software Engineering
Hardware Software Codesignof Embedded Systems - CS Course ...
Syllabus Course: Motivating and Engaging Students Presenters: Dr ...
Course syllabus and schedule - Academic Resources at Missouri ...
Computer Science @ Virginia Tech - Computer Science at Virginia ...
IBT Course Syllabus for Motorcycling - Road Safety Authority
Future-Computer-Science-3
COMPUTER SCIENCE & ELECTRICAL ENGINEERING
COMPUTER SCIENCE - Swansea University
(CMPUT) 201 - Department of Computing Science - University of ...
Course Overview - Computer Science Department - Montana State ...
Special course in Computer Science Molecular Computing