CS302 Algorithms and Data Structures
CS302 Algorithms and Data Structures
Syllabus | International University of Sarajevo - Last Update on Sep 09, 2025
Syllabus Quick Jump
Search and navigate to any syllabus instantly
Computer Sciences and Engineering
Emine Yaman
Course Lecturer
Course Objectives
The objecitve of the course is to introduce and train students in design and analysis of data structures and algorithms in the program implementation. It demonstrates the analysis of the computational complexity of programs along with their comparative analysis.
Learning Outcomes
After successful completion of the course, the student will be able to:
Course Materials
Required Textbook
Data Structures & Algorithms in Java, 2nd Edition, Robert Lafore, SAMS
Additional Literature
Data Structures and Algorithms Made Easy in Java, Narasimha Karumanchi, CareerMonk PublicationsTeaching Methods
Lectures
Tutorials
Class discussions with examples
Homeworks .
Weekly Topics
| Week | Topic | Readings / References |
|---|---|---|
| 1 | Course Logistics, Introduction | Chapter 1 |
| 2 | Arrays | Chapter 2 |
| 3 | Time Complexity (Run Time Analysis) | Chapter 2 |
| 4 | Stacks and Queues | Chapter 4 |
| 5 | Linked Lists | Chapter 5 |
| 6 | Simple Sorting | Chapter 3 |
| 7 | Recursion | Chapter 6 |
| 8 | Midterm Exam | |
| 9 | Advanced Sorting | Chapter 7 |
| 10 | Binary Trees | Chapter 8 |
| 11 | Binary Search Trees and AVL Trees | Chapter 8, Hands on |
| 12 | Hash Tables | Chapter 11 |
| 13 | Heaps | Chapter 12 |
| 14 | Graphs | Chapter 13 |
| 15 | Review |
Course Schedule (All Sections)
| Section | Type | Day 1 | Venue 1 | Day 2 | Venue 2 |
|---|---|---|---|---|---|
| CS302.1 | Course | Monday 14:00 - 16:50 | A F1.24 - Amphitheater I | - | - |
| CS302.2 | Course | - | - | - | - |
| CS302.1 | Tutorial | Friday 10:00 - 11:50 | A F1.17 | - | - |
| CS302.2 | Tutorial | Tuesday 09:00 - 10:50 | A F1.25 | - | - |
| CS302.3 | Tutorial | Tuesday 12:00 - 13:50 | B F1.25 Computer Lab | - | - |
Office Hours & Room
| Day | Time | Office | Notes |
|---|---|---|---|
| Wednesday | 10:00 - 12:00 | A F1.34 | |
| Thursday | 10:00 - 12:00 | A F1.34 | |
| Friday | 10:00 - 12:00 | A F1.34 |
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 4 5
Homework Assignments
AI: Not AllowedAlignment with Learning Outcomes : 1 2 3 4 5
Lab Assignments
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)
Midterm study
10 hours ⏳ (1 week × 10 h)
Final Exam Study
11 hours ⏳ (1 week × 11 h)
Home Study
45 hours ⏳ (15 week × 3 h)
Homework Study
15 hours ⏳ (5 week × 3 h)
Labs
24 hours ⏳ (12 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 [CS302] 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 Sep 09, 2025 | International University of Sarajevo
Print Syllabus
Referencing Curricula Print this page
| Course Code | Course Title | Weekly Hours* | ECTS | Weekly Class Schedule | ||||||
| T | P | |||||||||
| CS302 | Algorithms and Data Structures | 3 | 2 | 6 | Monday 14:00-16:50 | |||||
| Prerequisite | CS105, MATH204 | It is a prerequisite to | CS405, CS416, CS423 | |||||||
| Lecturer | Emine Yaman | Office Hours / Room / Phone | Wednesday: 10:00-12:00 Thursday: 10:00-12:00 Friday: 10:00-12:00 |
|||||||
| eyaman@ius.edu.ba | ||||||||||
| Assistant | Harun Hadzo | Assistant E-mail | hhadzo@ius.edu.ba | |||||||
| Course Objectives | The objecitve of the course is to introduce and train students in design and analysis of data structures and algorithms in the program implementation. It demonstrates the analysis of the computational complexity of programs along with their comparative analysis. |
|||||||||
| Textbook | Data Structures & Algorithms in Java, 2nd Edition, Robert Lafore, SAMS | |||||||||
| Additional Literature |
|
|||||||||
| Learning Outcomes | After successful completion of the course, the student will be able to: | |||||||||
|
||||||||||
| Teaching Methods | Lectures, Tutorials, Class discussions with examples, Homeworks . | |||||||||
| Teaching Method Delivery | Face-to-face | Teaching Method Delivery Notes | ||||||||
| WEEK | TOPIC | REFERENCE | ||||||||
| Week 1 | Course Logistics, Introduction | Chapter 1 | ||||||||
| Week 2 | Arrays | Chapter 2 | ||||||||
| Week 3 | Time Complexity (Run Time Analysis) | Chapter 2 | ||||||||
| Week 4 | Stacks and Queues | Chapter 4 | ||||||||
| Week 5 | Linked Lists | Chapter 5 | ||||||||
| Week 6 | Simple Sorting | Chapter 3 | ||||||||
| Week 7 | Recursion | Chapter 6 | ||||||||
| Week 8 | Midterm Exam | |||||||||
| Week 9 | Advanced Sorting | Chapter 7 | ||||||||
| Week 10 | Binary Trees | Chapter 8 | ||||||||
| Week 11 | Binary Search Trees and AVL Trees | Chapter 8, Hands on | ||||||||
| Week 12 | Hash Tables | Chapter 11 | ||||||||
| Week 13 | Heaps | Chapter 12 | ||||||||
| Week 14 | Graphs | Chapter 13 | ||||||||
| Week 15 | Review | |||||||||
| 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 | 30 | 1,2,3,4,5 | Not Allowed | |
| Homework Assignments | 5 | 15 | 1,2,3,4,5 | Not Allowed | |
| Lab Assignments | 10 | 20 | 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 | Midterm study | 10 | 1 | 10 | |||
| Final Exam Study | 11 | 1 | 11 | Home Study | 3 | 15 | 45 | |||
| Homework Study | 3 | 5 | 15 | Labs | 2 | 12 | 24 | |||
| 0 | ||||||||||
| Total Workload Hours = | 150 | |||||||||
| *T= Teaching, P= Practice | ECTS Credit = | 6 | ||||||||
| Course Academic Quality Assurance: Semester Student Survey | Last Update Date: 23/09/2025 | |||||||||