Course Objectives:
|
Upon completion of the course, students shall be able to:
- Apply algorithms and problem-solving techniques using a computer, using different problem-solving strategies, implementation strategies, simple selection and control flow algorithms, simple sequential and binary search algorithms
- Write programs using fundamental programming constructs, demonstrating command of the syntax and semantics of a higher-level language, static and dynamic variables, types, expressions, and assignment, simple I/O, file I/O, conditional, selection and iterative control structures, subprograms and parameter passing, and structured decomposition
- Apply fundamental techniques for numerical estimation
- Apply mathematical analysis skills to numerical technique results
- Use fundamental data structures, including enumeration types, arrays, records, strings and string processing, pointers and references
- Use client tools for data abstraction and understand its characteristics, including encapsulation, information-hiding, and separation of specification and implementation
- Use predefined object classes and packages
- Use software development methodologies, including fundamental design concepts and principles, structured design, testing and debugging strategies, test-case design, and programming environments
- Write programs using exception handling
|
