Overview
Introduction to algorithms: their definition, design, coding, and execution on computers. Intended for students who have no programming experience.
Learning Outcomes
After completing CISC 101, students will be able to:
- Design a computational solution to a problem described in natural language, express the solution in an algorithmic way, and convert the algorithm effectively and intelligibly into a procedural program.
- Ensure that algorithms produce the correct output and handle edge cases.
- Properly use modularity, repetition (both counted and unbounded), conditionals, and simple (rectangular) data structures in problem solution
Additional Information
NOTE: Learning Hours may vary. Sufficient preparation for CISC 121; alternative to CISC 110/3.0 and CISC 151/3.0