|
Official Course
Description: MCCCD Approval:
2-27-2001 |
||
|
CSC240AA
2001 Fall – 2011 Fall |
LEC
4.0 Credit(s) 4.0 Period(s) 4.0 Load Acad |
|
|
Introduction
to Different Programming Languages |
||
|
Introduction
to procedural (C/C++), applicative (LISP), and declarative (Prolog)
languages. Prerequisites: CSC210 or permission of Instructor.
|
||
|
|
||
Go to Competencies Go to Outline
|
MCCCD
Official Course Competencies: |
|
|
|
|
|
CSC240AA 2001 Fall – 2011 Fall |
Introduction to Different Programming Languages |
|
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) |
Go to Description Go to top of
Competencies
|
MCCCD
Official Course Outline: |
|
|
|
|
|
CSC240AA 2001 Fall – 2011 Fall |
Introduction to Different Programming Languages |
|
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 II. LISP 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 |