CS103 Introduction to Programming
CS103 Introduction to Programming
Syllabus | International University of Sarajevo - Last Update on Feb 02, 2026
Syllabus Quick Jump
Search and navigate to any syllabus instantly
Computer Sciences and Engineering
Özge Büyükdağlı
Course Lecturer
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, control statements, loops, functions, arrays and pointers, simple searching and sorting, file streams, introduction to classes and objects.
Learning Outcomes
After successful completion of the course, the student will be able to:
Course Materials
Required Textbook
Problem Solving with C++, 10th edition,Walter Savitch, Pearson Education, 2018.
Additional Literature
-Programming - Principles and Practice Using C++, 3rd edition, Bjarne Stroustrup, Addison-Wesley, 2024. -Cisco Networking Academy (NetAcad) – C++ Essentials 1. Available at: https://www.netacad.com/courses/c-plus-plus-essentials-1Teaching Methods
Class discussions with examples
Active lab sessions for engaged learning and continuous feedback on progress
Lab exercises and practical assignments
Weekly Topics
| Week | Topic | Readings / References |
|---|---|---|
| 1 | Introduction to Computers and Programming | Chapter 1 |
| 2 | Variables & Assignments, Input & Output, Data Types and Expressions | Chapters 2.1, 2.2, 2.3 |
| 3 | Simple Flow of Control, Program style, Using Boolean Expressions | Chapters 2.4, 2.5, 3.1 |
| 4 | Multiway Branches, More on Loop, Introduction to File Input | 3.2, 3.3, 3.4, Chapter 6.1 |
| 5 | Predefined Functions, Programmer-Defined Functions | Chapters 4.1 to 4.4 |
| 6 | Scope & Local Variables, Overloading Function Names + Quiz 1 | Chapters 4.5, 4.6 |
| 7 | Void Function, Call-By Reference Parameters, Review | Chapters 5.1, 5.2, 5.3 |
| 8 | Midterm | |
| 9 | Testing & Debugging Techniques | Chapters 5.4, 5.5 |
| 10 | Arrays | Chapter 7 |
| 11 | Strings and Vectors | Chapter 8 |
| 12 | Pointers and Dynamic Arrays | Chapter 9 |
| 13 | Classes & Structures + Quiz 2 | Chapters 10.1,10.2 |
| 14 | Recursion | Chapter 14 |
| 15 | Revision for final exam |
Course Schedule (All Sections)
| Section | Type | Day 1 | Venue 1 | Day 2 | Venue 2 |
|---|---|---|---|---|---|
| CS103.1 | Course | Tuesday 09:00 - 11:50 | B F1.23 - Amphitheater I | - | - |
| CS103.2 | Course | Wednesday 09:00 - 11:50 | A F2.14 - Amphitheater II | - | - |
| CS103.1 | Tutorial | Friday 12:00 - 13:50 | B F1.25 Computer Lab | - | - |
| CS103.2 | Tutorial | Thursday 18:00 - 19:50 | B F1.25 Computer Lab | - | - |
| CS103.3 | Tutorial | Thursday 14:00 - 15:50 | A F1.3 - Computer Lab | - | - |
| CS103.4 | Tutorial | Thursday 14:00 - 15:50 | A F1.18 - Computer Lab | - | - |
| CS103.5 | Tutorial | Thursday 16:00 - 17:50 | B F1.25 Computer Lab | - | - |
| CS103.6 | Tutorial | Thursday 10:00 - 11:50 | A F1.3 - Computer Lab | - | - |
Office Hours & Room
| Day | Time | Office | Notes |
|---|---|---|---|
| Tuesday | 13:00 - 15:00 | A F2.32 | |
| Wednesday | 12:00 - 13:00 | A F2.32 | |
| Thursday | 10:00 - 12:00 | A F2.32 |
Assessment Methods and Criteria
Assessment Components
Final Exam
AI: Not AllowedAlignment with Learning Outcomes : 1 2 3 4 5
Midterm Exam
AI: Not AllowedAlignment with Learning Outcomes : 1 2 3
Quizzes
AI: Not AllowedAlignment with Learning Outcomes : 1 2 3 4 5
Tutorial Assignment
AI: Not AllowedAlignment with Learning Outcomes : 1 2 3 4 5
C++ Essentials 1-NetAcad(completion + exam)
AI: Not AllowedAlignment with Learning Outcomes : 1 2 3 4 5
IUS Grading System
| Grading Scale | IUS Grading System | IUS Coeff. | Letter (B&H) | Numerical (B&H) |
|---|---|---|---|---|
| 0 - 44 | F | 0 | F | 5 |
| 45 - 54 | E | 1 | ||
| 55 - 64 | C | 2 | E | 6 |
| 65 - 69 | C+ | 2.3 | D | 7 |
| 70 -74 | B- | 2.7 | ||
| 75 - 79 | B | 3 | C | 8 |
| 80 - 84 | B+ | 3.3 | ||
| 85 - 94 | A- | 3.7 | B | 9 |
| 95 - 100 | A | 4 | A | 10 |
Late Work Policy
Information about late submission policies will be shared during class and posted in this section. Please check back for official guidelines.
ECTS Credit Calculation
📚 Student Workload
This 6 ECTS credit course corresponds to 150 hours of total student workload, distributed as follows:
Lecture Hours
45 hours ⏳ (15 week × 3 h)
Tests Study preparation
10 hours ⏳ (2 week × 5 h)
Active Tutorials
20 hours ⏳ (10 week × 2 h)
Midterm Exam Study
10 hours ⏳ (1 week × 10 h)
Final Exam Study
15 hours ⏳ (1 week × 15 h)
Home Study
30 hours ⏳ (15 week × 2 h)
Cisco Study
20 hours ⏳ (10 week × 2 h)
150 Total Workload Hours
6 ECTS Credits
Course Policies
Academic Integrity
All work submitted must be your own. Plagiarism, cheating, or any form of academic dishonesty will result in disciplinary action according to university policies. When in doubt about citation practices, consult the instructor.
Attendance Policy
Students are expected to adhere to the attendance requirements as outlined in the International University of Sarajevo Study Rules and Regulations. Excessive absences, whether excused or unexcused, may impact academic performance and eligibility for assessment. Mandatory sessions (e.g., labs, workshops) require attendance unless formally exempted. For detailed policies on absences, documentation, and penalties, please refer to the official university regulations.
Technology & AI Policy
Laptops/tablets may be used for note-taking only during lectures. Phones should be silenced and put away during all class sessions. Audio/video recording requires prior permission from the instructor.
Artificial Intelligence (AI) Usage: The use of AI tools (e.g., ChatGPT, Copilot, Gemini) varies by assessment component. Please refer to the AI usage indicator next to each assessment item in the Assessment Methods and Criteria section above. Submitting AI-generated content as your own work, where AI is not explicitly allowed, constitutes an academic integrity violation.
Communication Policy
All course-related communication should occur through official university channels (institutional email or SIS). Emails should include [CS103] in the subject line.
Academic Quality Assurance Policy
Course Academic Quality Assurance is achieved through Semester Student Survey. At the end of each academic year, the institution of higher education is obliged to evaluate work of the academic staff, or the success of realization of the curricula.
Learning Tips
Be prepared to contribute thoughtfully during class discussions, labs, or collaborative work. Active participation deepens understanding and encourages critical thinking.
Complete assigned readings or prep materials before class. Take notes, highlight key ideas, and jot down questions. Aim to grasp core concepts and their applications—not just facts.
Use course frameworks or methodologies to analyze problems, case studies, or projects. Begin early to allow time for reflection and refinement. Seek feedback to improve your work.
Don’t hesitate to reach out when something is unclear. Use office hours, discussion boards, or peer networks to clarify concepts and stay on track.
Syllabus Last Updated on Feb 02, 2026 | International University of Sarajevo
Print Syllabus
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 | AID201, AID403, CS105, CS404, CS414, EE325, ENS210, SE211 | |||||||
| Lecturer | Özge Büyükdağlı | Office Hours / Room / Phone | Tuesday: 13:00-15:00 Wednesday: 12:00-13:00 Thursday: 10:00-12:00 |
|||||||
| obuyukdagli@ius.edu.ba | ||||||||||
| Assistant | Nesibe Husejnovic | 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, control statements, loops, functions, arrays and pointers, simple searching and sorting, file streams, introduction to classes and objects. | |||||||||
| Textbook | Problem Solving with C++, 10th edition,Walter Savitch, Pearson Education, 2018. | |||||||||
| 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. | |||||||||
| Teaching Method Delivery | Face-to-face | Teaching Method Delivery Notes | ||||||||
| WEEK | TOPIC | REFERENCE | ||||||||
| Week 1 | Introduction to Computers and Programming | Chapter 1 | ||||||||
| Week 2 | Variables & Assignments, Input & Output, Data Types and Expressions | Chapters 2.1, 2.2, 2.3 | ||||||||
| Week 3 | Simple Flow of Control, Program style, Using Boolean Expressions | Chapters 2.4, 2.5, 3.1 | ||||||||
| Week 4 | Multiway Branches, More on Loop, Introduction to File Input | 3.2, 3.3, 3.4, Chapter 6.1 | ||||||||
| Week 5 | Predefined Functions, Programmer-Defined Functions | Chapters 4.1 to 4.4 | ||||||||
| Week 6 | Scope & Local Variables, Overloading Function Names + Quiz 1 | Chapters 4.5, 4.6 | ||||||||
| Week 7 | Void Function, Call-By Reference Parameters, Review | Chapters 5.1, 5.2, 5.3 | ||||||||
| Week 8 | Midterm | |||||||||
| Week 9 | Testing & Debugging Techniques | Chapters 5.4, 5.5 | ||||||||
| Week 10 | Arrays | Chapter 7 | ||||||||
| Week 11 | Strings and Vectors | Chapter 8 | ||||||||
| Week 12 | Pointers and Dynamic Arrays | Chapter 9 | ||||||||
| Week 13 | Classes & Structures + Quiz 2 | Chapters 10.1,10.2 | ||||||||
| Week 14 | Recursion | Chapter 14 | ||||||||
| Week 15 | Revision for final exam | |||||||||
| Assessment Methods and Criteria | Evaluation Tool | Quantity | Weight | Alignment with LOs | AI Usage |
| Final Exam | 1 | 35 | 1,2,3,4,5 | Not Allowed | |
| Semester Evaluation Components | |||||
| Midterm Exam | 1 | 25 | 1,2,3 | Not Allowed | |
| Quizzes | 2 | 20 | 1,2,3,4,5 | Not Allowed | |
| Tutorial Assignment | 8 | 15 | 1,2,3,4,5 | Not Allowed | |
| C++ Essentials 1-NetAcad(completion + exam) | 1 | 5 | 1,2,3,4,5 | Not Allowed | |
| *** ECTS Credit Calculation *** | |||||
| Activity | Hours | Weeks | Student Workload Hours | Activity | Hours | Weeks | Student Workload Hours | |||
| Lecture Hours | 3 | 15 | 45 | Tests Study preparation | 5 | 2 | 10 | |||
| Active Tutorials | 2 | 10 | 20 | Midterm Exam Study | 10 | 1 | 10 | |||
| Final Exam Study | 15 | 1 | 15 | Home Study | 2 | 15 | 30 | |||
| Cisco Study | 2 | 10 | 20 | |||||||
| Total Workload Hours = | 150 | |||||||||
| *T= Teaching, P= Practice | ECTS Credit = | 6 | ||||||||
| Course Academic Quality Assurance: Semester Student Survey | Last Update Date: 23/02/2026 | |||||||||