CIS131 — Programming and Problem Solving II
4 , 4 lecture periods 0 lab periods Continuation of CIS 129 . Includes data structures and data representation, complex problem solving, procedural abstraction, and complex arrays with structured elements. Also includes object-oriented programming, exception handling, file input and output, debugging, and testing. Build programs that use recursion to solve simple problems. Solve complex problems through programming. Design programs using sorting and searching algorithms. Create object-oriented programs with inheritance, constructors, and destructors. Outline: Revisit Data Structures and Data Representation Elementary data types Character String Integer Real Boolean Structured data types and data abstraction File Record Array Single dimension Multidimensional Procedural Abstraction Procedure code module Statement extension Actions upon objects Recursion Data Files Reading input from data files Building new output data files Adding to existing output data files Adding and random updating of data records in binary typed data files Object-Oriented Programming Creating complex classes using abstract classes, inheritance and composition Creating overloaded methods, constructors and destructors Data encapsulation Exception Handling Creating programs using simple exception handling, propagation Using generic and specific try-catch blocks Using finally blocks Debugging and Testing Creating test data using black box, white box, robustness testing methods Creating a test plan Boundary c
Prerequisites: CIS129