Center for Curriculum and Transfer Articulation
Introduction to Different Programming Languages
Course: CSC240AA

First Term: 2012 Spring
Lecture   4 Credit(s)   4 Period(s)   4 Load  
Course Type: Academic
Load Formula: S

Description: Introduction to procedural (C/C++), applicative (LISP), and declarative (Prolog) languages.

MCCCD Official Course Competencies
1. Write C/C++ programs that use branches and loops. (I)
2. Write C/C++ programs that call functions and procedures from the C/C++ standard library. (I)
3. Write C/C++ programs that call functions and procedures from user-defined classes. (I)
4. Describe Object Oriented Design as used in C++. (I)
5. Write LISP programs that use recursion. (II)
6. Describe how LISP programs use backtracking. (II)
7. Write Prolog programs that use recursion. (III)
8. Describe how Prolog programs use backtracking. (III)
9. Describe the advantages and disadvantages of strong or weak typing. (IV)
10. Describe how C/C++ use pointers. (I)
MCCCD Official Course Outline
I. C/C++
   A. Control structures
      1. Branches
      2. Loops
   B. Recursion
   C. Subroutine and functions
      1. Internal
      2. Libraries
      3. Classes
   D. Object-Oriented Design Concepts
      1. Inheritance
      2. Overloading
      3. Polymorphism
   E. Pointers
      1. Dynamic memory allocation
      2. Pointer dereferencing
      3. Pointer arithmetic
   A. Control structures
   B. Recursion
   C. Backtracking
   D. Execution strategies
III. Prolog
   A. Control structures
   B. Recursion
   C. Backtracking
   D. Execution strategies
IV. Comparison of computer languages
   A. History and development
   B. Strong versus weak typing
   C. Polymorphism
MCCCD Governing Board Approval Date:  12/13/2011

All information published is subject to change without notice. Every effort has been made to ensure the accuracy of information presented, but based on the dynamic nature of the curricular process, course and program information is subject to change in order to reflect the most current information available.