CS302 Algorithms and Data Structures

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 Tuesday 09:00 - 11:50, Thursday 09:00 - 11:50
Prerequisite CS105, MATH204 It is a prerequisite to
Lecturer Zeynep Sağır Office Hours / Room / Phone
Monday:
13:00-14:00
Tuesday:
10:00-12:00
Wednesday:
12:00-14:00
A F1.16
E-mail zsagir@ius.edu.ba
Assistant Harun Hadzo Assistant E-mail
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
  • Data Structures and Algorithms Made Easy in Java, Narasimha Karumanchi, CareerMonk Publications
Learning Outcomes After successful  completion of the course, the student will be able to:
  1. Define basic types of data structures like stackcs, queues, sets, arrays, etc.
  2. Define, explain and use various algorithmic paradigms for problem-solving
  3. Modify existing and develop new efficient algorithms
  4. Analyze complexity of algorithms
  5. Be able to recognize the appropriate algorithmic method to solve a newly given problem
Teaching Methods Class discussions with examples.
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
Final Exam 1 35 1,2,3,4,5
Semester Evaluation Components
Midterm Exam 1 30 1,2,3,4,5
Quizzes 15 1,2,3,4,5
Homework Assignments 20 1,2,3,4,5
***     ECTS Credit Calculation     ***
 Activity Hours Weeks Student Workload Hours Activity Hours Weeks Student Workload Hours
Lecture Hours 3 15 45 Midterm study 12 1 12
Final Exam Study 10 2 20 Home Study 3 15 45
Homework Study 6 2 12 Tutorials 2 8 16
        Total Workload Hours = 150
*T= Teaching, P= Practice ECTS Credit = 6
Course Academic Quality Assurance: Semester Student Survey Last Update Date: 09/11/2023
QR Code for https://ecampus.ius.edu.ba/course/math204-discrete-mathematics

Print this page