Computer Science Courses at Bronx Community College
Jump to: CSI 30, 31, 32, 33, 35.
For information on the different available syllabi formats go here.
| CSI 30 - Discrete Mathematics I | 3 hours 3 credits |
Syllabus: html, word, pdf, odt
Introduction to mathematical methods in computer science. Topics include
basic concepts of mathematical logic, set theory, elementary number theory,
counting methods and probability, and informal proof.
Prerequisites: MTH 06.
Corequisite: ENG 02 and RDL 02 if required.
| CSI 31 - Introduction to Computer Programming I | 2 lect 2 lab 3 credits |
Syllabus: html, word, pdf, odt
Introduction to computer systems and computer logic; techniques of
structured programming; data representation; basic algorithm design and
implementation in a modern structured language (e.g. C++); computer
solutions to problems taken from engineering, science, physics, mathematics,
business and other applications.
Prerequisites: CSI 30 and ENG 02 and RDL 02 if required.
Corequisite: MTH 31 or 14.
| CSI 32 - Introduction to Computer Programming I | 2 lect 2 lab 3 credits |
Syllabus: html, word, pdf, odt
Continuation of CSI 31. Introduction to object-oriented programming
including encapsulation, polymorphism, and inheritance; class templates;
recursion and recursive analysis; analysis of algorithms, program style;
documentation of programs; debugging; development of major projects.
Prerequisites: CSI 31 and ENG 02 and RDL 02 if required.
| CSI 33 - Data Structures | 2 lect 2 lab 3 credits |
Syllabus: html, word, pdf, odt
Introduction to data structures and algorithms for developing solutions to
various computational problems for sorting and searching large collections
of data. Topics include container classes, pointers and dynamic arrays,
linked lists, stacks, queues, and trees.
Prerequisites: CSI 32 and ENG 02 and RDL 02 if required.
| CSI 35 - Discrete Mathematics II | 2 lect 2 lab 3 credits |
Syllabus: html, word, pdf, odt
Introduction to the theory and application of abstract mathematical
structures, the design and analysis of algorithms, mathematical modeling,
and other disciplines. Topics selected from relations, partial orderings,
graphs and trees, mathematical reasoning, and methods of proof.
Prerequisites: CSI 30 and ENG 02 and RDL 02 if required.
Formats
The syllabi are available in html, word, pdf, tex and odt formats. For printing you should use the word or pdf formats which are opened with Microsoft Word, Adobe Acrobat respectively. You can also use Open Office, free software, to open the odt files. These are in the open document format.
For faculty members updating syllabi: make changes to either the word, tex or odt file and email it to the webmaster.