 | Select the desired Level or Schedule Type to find available classes for the course. |
| CS 18000 - Problem Solving And Object-Oriented Programming |
|
Credit Hours: 4.00. Problem solving and algorithms, implementation of algorithms in a high level programming language, conditionals, the iterative approach and debugging, collections of data, searching and sorting, solving problems by decomposition, the object-oriented approach, subclasses of existing classes, handling exceptions that occur when the program is running, graphical user interfaces (GUIs), data stored in files, abstract data types, a glimpse at topics from other CS courses. Intended primarily for students majoring in computer sciences. Credit cannot be obtained for both CS 18000 and any of 15600, 15800 and 15900. Not open to students with credit in CS 24000. Typically offered Fall Spring.
0.000 OR 4.000 Credit hours Syllabus Available Levels: Undergraduate, Graduate, Professional Schedule Types: Distance Learning, Laboratory, Lecture, Recitation All Sections for this Course Offered By: College of Science Department: Computer Science Course Attributes: Lower Division May be offered at any of the following campuses: West Lafayette Learning Outcomes: 1. Students have an understanding of solving problems by analyzing the problem, designing an algorithm, and programming the solution. Restrictions: Must be enrolled in one of the following Programs: Computer Science-BS Prerequisites: Undergraduate level MA 16100 Minimum Grade of C [may be taken concurrently] or Undergraduate level MA 16300 Minimum Grade of C [may be taken concurrently] or Undergraduate level MA 16500 Minimum Grade of C [may be taken concurrently] or Undergraduate level MA 16700 Minimum Grade of C [may be taken concurrently] or (Undergraduate level MA 22100 Minimum Grade of C and (Undergraduate level MA 22200 Minimum Grade of C or Undergraduate level MA 16021 Minimum Grade of C) ) or (Undergraduate level MA 22300 Minimum Grade of C and Undergraduate level MA 22400 Minimum Grade of C) |
| Return to Previous | New Search |
 |