CS103 Introduction to Programming
Referencing Curricula Print this page
| Course Code | Course Title | Weekly Hours* | ECTS | Weekly Class Schedule | ||||||
| T | P | |||||||||
| CS103 | Introduction to Programming | 3 | 2 | 6 | ||||||
| Prerequisite | None | It is a prerequisite to | ||||||||
| Lecturer | Özge Büyükdağlı | Office Hours / Room / Phone | Monday: 13:00-17:00 Tuesday: 15:00-17:00 Wednesday: 15:00-17:00 |
|||||||
| obuyukdagli@ius.edu.ba | ||||||||||
| Assistant | Nesibe Husejnovic, Soundhadya Parashuram | Assistant E-mail | ndemir@ius.edu.ba | |||||||
| Course Objectives | Designed for students with little or no prior experience in programming. The course introduces the basic concepts of procedural programming. The main goal is for students to develop confidence in programming and the ability to apply programming skills to problems arising in a variety of fields. Topics include: high-programming languages, language syntax, control statements, loops, functions, arrays and pointers, simple searching and sorting, file streams, introduction to classes and objects. | |||||||||
| Textbook | Absolute C++, Walter Savitch, 6th ed. Pearson, 2016. | |||||||||
| Additional Literature |
|
|||||||||
| Learning Outcomes | After successful completion of the course, the student will be able to: | |||||||||
|
||||||||||
| Teaching Methods | Class discussions with examples. Active lab sessions for engaged learning and continuous feedback on progress. Lab exercises and practical assignments, projects. | |||||||||
| Teaching Method Delivery | Face-to-face | Teaching Method Delivery Notes | ||||||||
| WEEK | TOPIC | REFERENCE | ||||||||
| Week 1 | Overview of Computers and Programming | |||||||||
| Week 2 | Introduction to C++: variables, expressions, assignment statements, console I/O | Chapters 1.2, 1.3 | ||||||||
| Week 3 | Introduction to C++: programming style, libraries, Boolean expressions, branching | Chapters 1.4, 1.5, 2.1, 2.2 | ||||||||
| Week 4 | Flow of control: loops, file inputs | Chapters 2.3, 2.4 | ||||||||
| Week 5 | Functions: pre-defined functions, user-defined functions, scopes | Chapters 3.1, 3.2 | ||||||||
| Week 6 | Parameters and overloading | Chapters 4.1, 4.2 | ||||||||
| Week 7 | Testing, debugging, arrays | Chapters 4.3, 5.1, 5.2 | ||||||||
| Week 8 | Midterm | |||||||||
| Week 9 | More on arrays, structures | Chapters 5.3, 5.4, 6.1 | ||||||||
| Week 10 | Classes | Chapters 6.2 | ||||||||
| Week 11 | Strings | Chapters 9.1, 9.2, 9.3 | ||||||||
| Week 12 | Pointers, dynamic arrays | Chapters 10.1, 10.2 | ||||||||
| Week 13 | Classes, pointers and dynamic arrays, Streams and File I/O | Chapters 10.3, 12.1 | ||||||||
| Week 14 | Recursion | Chapters 13.1, 13.2, 13.3 | ||||||||
| Week 15 | Revision for final exam | |||||||||
| Assessment Methods and Criteria | Evaluation Tool | Quantity | Weight | Alignment with LOs |
| Final Exam | 1 | 30 | 1,2,3,4,5 | |
| Semester Evaluation Components | ||||
| Midterm Exam | 1 | 26 | 1,2,3 | |
| Tests | 2 | 20 | 1,2,3,4,5 | |
| Tutorials | 12 | 24 | 1,2,3,4,5 | |
| *** ECTS Credit Calculation *** | ||||
| Activity | Hours | Weeks | Student Workload Hours | Activity | Hours | Weeks | Student Workload Hours | |||
| Lecture Hours | 3 | 14 | 42 | Tests Study preparation | 5 | 6 | 30 | |||
| Active Tutorials | 2 | 12 | 24 | Midterm Exam Study | 10 | 1 | 10 | |||
| Final Exam Study | 14 | 1 | 14 | Home Study | 2 | 15 | 30 | |||
| Total Workload Hours = | 150 | |||||||||
| *T= Teaching, P= Practice | ECTS Credit = | 6 | ||||||||
| Course Academic Quality Assurance: Semester Student Survey | Last Update Date: 08/04/2024 | |||||||||