CIM7B Advance Java for Business- Spring 2013- Professor T. DeDonno |
|
![]() |
Onsite Help in Computer Labs: SME 346 or BGS24CCC Conf Web-Cast Every Tuesday at Noon, Will try to achive Web-Cast, Web-Cast login info on Blackboard Main Index http://cim.saddleback.edu Ticket # 21475 Java 1.3 API | J2SE6 Documentation | | Submit |
| Online Resources For Liang Textbook. | Pearson | Valore Books | Rent Text Books | Can Buy either 7th , 8th or 9th Edition | Java Applet Written For Lockheed/Martin By Instructor |
In CIM7B Advance Java- Offered Every Spring
Course covers the fundamentals of Java Programming, Object-Oriented Programming (OOP), exception handling, file I/O, recursion and generics. See Schedule. |
|
In CS4B Java Web Programming - Offered Every Spring
In first half of CS4B Java Web programming we cover OOP, HTML Web pages, Java Applets and GUI Programming (Swing/AWT). In the second half we cover: threads, network programming, database (SQL - JDBC), Server Side Web Programming (J2EE/Glassfish), Server-side Web Scripting JSP/Beans, Java Web Frameworks and MVC Design Patterns. |
|
CIM05A SQL/MySQL
Structured Query Language (SQL) has become the standard for communicating to a Relational Database Management System (RDBMS). RDBMS have become the defacto standard for organizing data. MySQL is a fast growing RDMBS and also has a library that supports sending SQL commands to its database using the PHP scripting language. Recently Sun Microsystems has purchases MySQL. This will help expand the roll of MySQL beyond a popular Web Database system, into a more mainstream fortune 500 database. CSB4 uses the same MySQL RDBMS as cim205a. More Specifically CIM205A Covers...
|
CS1D Data Structures in Java
Both CS4B adn CS1D are offered every Spring. CS1D covers the middle data structure chapters in the Liang Java Book, CS4A beginning chapters, CS4B later chapters, more specifically...
CS1D covers basic concepts of data structures and related algorithms. The abstract data types of lists, stacks, queues, strings, binary and general trees, multidimensional and sparse arrays, and graphs will be discussed and implemented using a contemporary programming language. Recursion, searching, and sorting will also be examined. |