The goal of the course is to deepen students' C# knowledge acquired during the Programming 1 course, as well as to introduce the concepts and principles of object-oriented programming in C#.

Lectures

1. From C++ to C#: language transition and development workflow. 2. Data types, variables, expressions, and type handling in C#. 3. Control flow and decision structures. 4. Iteration and algorithmic patterns. 5. Methods and modular program design. 6. Classes, objects, and early object-oriented design. 7. Midterm Test 8. Arrays and algorithmic data processing. 9. Multidimensional arrays, jagged arrays, and data organization. 10. Strings, text processing, and practical input handling. 11. Exception handling and defensive programming. 12. Final Test 13. Make-up and correction week

Labs

1. Environment setup and syntax transition exercises. Creating console projects, using the IDE effectively, compiling and running programs, reviewing syntax through short tasks, and rewriting small C++-style solutions in idiomatic C#. 2. Expression-based programming tasks. Numeric computations, conversion problems, input parsing, overflow-aware thinking, formatting output, and debugging type-related mistakes. 3. Conditional problem solving. Multi-branch tasks, classification problems, validation scenarios, menu-driven logic, and rewriting overly complex conditions into cleaner forms. 4. Loop-based problem solving. Sequence processing, digit manipulation, divisibility tasks, pattern generation, nested-loop exercises, and edge-case testing. 5. Refactoring into methods. Breaking larger procedural solutions into smaller units, designing helper methods, testing with varied inputs, and improving readability and reuse. 6. Implementing simple classes. 7. Written midterm assessment covering Weeks 1–6. 8. Array algorithms in practice. Input and output of arrays, filtering, searching, counting by condition, frequency-style tasks, and comparative testing of alternative implementations. 9. Matrix and table-processing exercises. Row and column operations, traversal patterns, basic transformations, indexed computations, and debugging incorrect indexing logic. 10. Text-processing tasks. Parsing structured input, validating textual data, counting and filtering characters, tokenization, formatted output generation, and solving small real-life style problems. 11. Robust programming exercises. Safe input parsing, handling invalid data, building fault-tolerant console programs, and revising earlier solutions with better error handling. 12. Written final assessment covering Weeks 8–11. 13. Retake, correction, and make-up opportunities for previous assessments.

Supplementary material and laboratory background.