Directories and Search

Course Search


Courses may be offered in one of the following modalities:

  • Traditional in-person courses (0–29 percent of coursework is delivered online, the majority being offered in person.)
  • Hybrid/blended courses (30–79 percent of coursework is delivered online.)
  • Online courses (100 percent of coursework is delivered online, either synchronously on a designated day and time or asynchronously as a deadline-driven course.)
  • Hyflex (Students will be assigned to attend in-person or live streamed sessions as a reduced-size cohort on a rotating basis; live sessions are also recorded, offering students the option to participate synchronously or view asynchronously as needed.)

If you are enrolled in courses delivered in traditional or hybrid modalities, you will be expected to attend face-to-face instruction as scheduled.


Intermediate Computer Programming (CSC-175)


Semester: Spring 2024
Number: 0145-175-003
Instructor: Christopher Miles
Days: Monday Wednesday Friday 12:00 pm - 12:50 pm
Note: Traditional In-Person Class
Location: Garden City - Swirbul Library 101
Credits: 4
Status: This Course is Filled to Capacity
Notes:

Student must register for Lecture and Lab
Students Must Register For Corresponding Lab:0145-175-30

Course Materials: View Text Books
Related Syllabi: Robert Siegfried for Spring 2020*

*Attention Students: Please note that the syllabi available for your view on these pages are for example only. The instructors and requirements for each course are subject to change each semester. If you enroll in a particular course, your instructor and course outline may differ from what is presented here.

Description:

Students explore object-oriented programming principles and techniques for solving problems. Students study class relationships (composition, inheritance, polymorphism, data-abstraction), file processing, exception handling, recursion, use of built-in language specific data structures. Students develop software-engineering skills and habits; develop a variety of applications that require storing, processing, sorting and searching data collections.

Learning Goals:   • Students will create, navigate through, and update objects inside collections. This objective will be measured by all course assessments. • Students will create driver and blueprint classes. This objective will be measured by all course assessments. • Students will apply standard programming conventions to create readable code that would be easy to maintain. This objective will be measured by all course assessments. • Students will code test cases and use unit testing tools and be introduced to test driven development techniques. This objective will be measured by all course assessments.• Students will create programs using composition, abstraction, interfaces, inheritance, exception handling and file processing. This objective will be measured by assignments 1 - 7, the midterm, and final project.• Students will solve written problems by designing objects and algorithms and then implementing those designs. This objective will be measured by all course assessments.• Students will construct and update structured objects. This objective will be measured by assignments 3&4 and the final project. • Students will trace recursive calls and write recursive algorithms. This objective will be measured by assignment 8, and the midterm examination. • Students will program using an integrated development environment to carry out a design-code-test-debug cycle. This objective will be measured by all course assignments.• Students will exercise step-wise refinement and method decomposition. This objective will be measured by all course assessments.• Students will design small UML class diagrams involving “is a” and “has a” relationships. This objective will be measured by the final examination. • Students will develop software involving several classes that interact together. This objective will be measured by the final project. • Students will use a change control system. This objective will be measured by the final project.• Students will implement and trace at least 2 searching algorithms. This objective will be measured by assignment 9, the midterm, the final examination and the final project.• Students will use and trace at least 2 sorting algorithms. This objective will be measured by assignment 10, the final examination and the final project.• Students will use and trace code involving at least 2 predefined data structures. This objective will be measured by assignments 11&12, the final examination and the final project.

*The learning goals displayed here are those for one section of this course as offered in a recent semester, and are provided for the purpose of information only. The exact learning goals for each course section in a specific semester will be stated on the syllabus distributed at the start of the semester, and may differ in wording and emphasis from those shown here.

Prerequisites:

» View Other Sections of this Course


« Back to Search Results

 
Apply Now
Request Information