Professional Documents
Culture Documents
CS 106syllabus
CS 106syllabus
III. PREREQUISITE: CS 101 (Data Structures and Algorithm LEC and LAB)
I. GENERAL OBJECTIVES
At the end of the semester, the students are expected to:
1. Preliminaries.
a. Introduction.
b. The General Problem of Describing Syntax.
c. Formal Methods of Describing Syntax.
d. Recursive Descent Parsing.
e. Attribute Grammars.
f. Describing the Meaning of Programs: Dynamic Semantics.
a. Introduction.
b. Names.
c. Variables.
d. The Concept of Binding.
e. Type Checking.
f. Strong Typing.
g. Type Compatibility.
h. Scope.
i. Scope and Lifetime.
j. Referencing Environments.
k. Named Constants.
l. Variable Initialization.
5. Data Types.
a. Introduction.
b. Primitive Data Types.
c. Character String Types.
d. User-Defined Ordinal Types.
e. Array Types.
f. Associative Array.
g. Record Types.
h. Union Types.
i. Set Types.
j. Pointer Types.
6. Expressions and the Assignment Statement.
a. Introduction.
b. Arithmetic Expressions.
c. Overloaded Operators.
d. Type Conversions.
e. Relational and Boolean Expressions.
f. Short-Circuit Evaluation.
g. Assignment Statements.
h. Mixed-Mode Assignment.
PRELIMINARY EXAMINATION
7. Statement-Level Control Structures.
a. Introduction.
b. Compound Statements.
c. Selection Statements.
d. Iterative Statements.
e. Unconditional Branching.
f. Guarded Commands.
g. Conclusions.
8. Subprograms.
a. Introduction.
b. Fundamentals of Subprograms.
c. Design Issues for Subprograms.
d. Local Referencing Environment.
e. Parameter-Passing Methods.
f. Parameters That Are Subprogram Names.
g. Overloaded Subprograms.
h. Generic Subprograms.
i. Separate and Independent Compilation.
j. Design Issues for Functions.
k. Accessing Nonlocal Environments.
l. User-Defined Overloaded Operators.
m. Coroutines.
9. Implementing Subprograms.
a. The General Semantics of Calls and Returns.
b. Implementing FORTRAN 77 Subprograms.
c. Implementing Subprograms in ALGOL-like Languages.
d. Blocks.
e. Implementing Dynamic Scoping.
f. Implementing Parameters That Are Subprogram Names.
10. Abstract Data Types.
a. The Concept of Abstraction.
b. Encapsulation.
c. Introduction to Data Abstraction.
d. Design Issues.
e. Language Example.
f. Parameterized Abstract Data Types.
11. Support for Object- Oriented Programming.
a. Introduction.
b. Object-Oriented Programming.
c. Design Issues for Object-Oriented Languages.
d. Overview of Smalltalk.
e. Introduction to Smalltalk.
f. Smalltalk Example Programs.
g. Large-Scale Features of Smalltalk.
h. Evaluation of Smalltalk.
i. Support for Object-Oriented Programming in C++.
j. Support for Object-Oriented Programming in Java.
k. Support for Object-Oriented Programming in Ada 95.
l. Support for Object-Oriented Programming in Eiffel.
12. Concurrency.
a. Introduction.
b. Subprogram-Level Concurrency.
c. Statement-Level Concurrency.
13. Exception Handling.
a. Introduction to Exception Handling.
b. Exception Handling in PL/I.
c. Exception Handling in Ada.
d. Exception Handling in C++.
e. Exception Handling in Java.
14. Functional Programming Languages.
a. Introduction.
b. Mathematical Functions.
c. Fundamentals of Functional Programming Languages.
d. The First Functional Programming Language: LISP.
e. An Introduction to Scheme.
f. COMMON LISP.
g. ML.
h. Miranda.
i. Applications of Functional Languages.
j. A Comparison of Functional and Imperative Languages.
FINAL EXAMINATION
Prepared by:
Charmaine G. Salvador