Course Syllabus

Name of Instructor Azamat Serek

 
Secondary/ Additional Instructors

SDU Email Address azamat.serek@sdu.edu.kz

Contact Details Office Phone ext. no.

Room Office location, e.g.:D316

Academic Year 2021 - 2022 Fa Semester 1

of Study
Course Dates

  Days Time of office hours Place of office hours

Course Code CSS 215 Degree Cycle Bachelor

(Level)

Course Title Introduction to Algorithms Faculty Инженер және

жаратылыстану ғылымдары
факультеті
Credits / ECTS 5 Total Contact Department Department of Computer
Hours Sciences

Course Type Compulsory Primary English

Language of
Instruction

Collaborative insert name of any Secondary Choose

Organization industry/organization that may be Language of
involved with the course, e.g.:as a Instruction
sponsor; if none:n/a

Delivery Campus Mode of Choose

Location (1) Delivery

Delivery
Location (2)

Pre-Requisite Courses

Course Title
Course Code

*Include the list of topics that students must know to gain an understanding of the course

Additional topics

Co-Requisite Courses

*Аn academic course required to be taken in conjunction with this course, where relevant

Course Title
 Programes on which course is available

  Program Title Degree

Information Systems Bachelor
Mathematics Bachelor
Computing Systems and Software Bachelor
Computer Science Bachelor
Information Systems Bachelor
Mathematical and Computer Modeling Bachelor
Mathematics Bachelor

Course Description

Here, highlight the distinctive features of the course, i.e.: what the main aims and key areas will be. Also refer to any
non-classroom activities such as an internship component, field-trips, laboratory work, industry experience, etc. If
students will have access to experts (e.g.: industry specialists) state that here, too. This description should make
explicit reference to student-centred learning (and, where possible, the other items in bold below). Finally, consider the
transferable skills that will be useful for lifelong learning. Also specify the likely trajectory for possible employability
options.

Skills and Competencies

Academic Skills Subject-Specific Skills

Expressing thoughts coherently Analysis of algorithms

 1   1 

Arguing opinions based on science Using data structures

 2   2 

Scientific writing skills Solving algorithmic problems

 3   3 

Critical thinking Comparing data structures

 4   4 

Justifying opinions based on pros and cons Comparing algorithmic paradigms

 5   5 

Course Learning Outcomes

Active Verb What will be done/produced How this learning outcome

will be achieved

Use Usage of data structures in Solving exercises and

 1  problems passing exams

Compare Comparing data structures Solving exercises and

 2  from different angles passing exams

Analyze Analyze algorithms based on Solving exercises and

 3  their time and space passing exams
complexities
Synthese Synthese different data Solving exercises and
 4  structures to solve probelms passing exams

Understand Understand algorithmic Solving exercises and

 5  paradigms passing exams

Methods of Assessment

The University’s normative rules regarding assessment apply. See the Code of Practice on
Assessments. These norms set the boundary conditions for all instructors of University.

Assessed Components

Type of Assessments Description Number of Points

(60/100)
 1  Midterm 1 Midterm 1 30
 2  Midterm 2 Midterm 2 30

 3  Attendance score Attendance 10

70

Final Exam

Type of Assesments Description Number of Points

(total score / 40)
 1  Final Exam Final 40

Proposed system of assessment by MES RK

Reading List

Required Reading List

Type Author Year / ISBN Title Publisher/Web site

 1  Published Robert Sedgewick and 978-0321573513 Algorithms (4th Edition) https://www.amazon.co
Kevin Wayne m/Algorithms-4th-

Recommended Resources (optional)

Type Author Year / ISBN Title Publisher/Web site

Robert Sedgewick and Algorithms (4th Edition) https://algs4.cs.princeto

 1  Online 978-0321573513
Kevin Wayne n edu/home/

Other Resources (optional)

Type Author Year / ISBN Title Publisher/Web site

Course Content - Curriculum Plan

TOPICS Activity

 1  Analysis of Algorithms Solving exercises in practice sessions

 2  Union–Find Solving exercises in practice sessions

 3  Stacks and Queues Solving exercises in practice sessions

 4  Elementary Sorts Solving exercises in practice sessions

 5  Mergesort Solving exercises in practice sessions

 6  Quicksort Solving exercises in practice sessions

 7  Midterm I Solving exercises in practice sessions

 8  Priority Queues Solving exercises in practice sessions

 9  Elementary Symbol Tables and BSTs Solving exercises in practice sessions

 10  Balanced Search Trees Solving exercises in practice sessions

 11  Geometric Applications of BSTs Solving exercises in practice sessions

 12  Midterm II Solving exercises in practice sessions

 13  Hash Tables Solving exercises in practice sessions

 14  Undirected Graphs Solving exercises in practice sessions

 15  Final Solving exercises in practice sessions

Academic Integrity

Students must ensure that all work completed for this course is their own work. Any evidence of
plagiarism, data falsification, fabrication, collusion, self-plagiarism and/or other forms of academic
misconduct will be penalised. Further, information can be found in the Code of Practice on Academic
Integrity.

Late/Non Submission and Attendance Policy

Academic excellence and high achievement are only possible in an environment where the highest
standards of academic honesty and integrity are maintained: students at SDU must ensure they adhere to
this requirement.

Active participation is an integral part of teaching and learning at SDU. Therefore, regular class attendance
is required of all students and records of any absences are kept for each class: a student whose
attendance falls below 70% will fail the course. Students are also expected to be in class on time: poor
punctuality is seen as being discourteous to the teacher and other students, therefore repeat incidences of
late arrivals are subject to a penalty.

The use of electronic devices (e.g.: computers, tablets, phones) is only permitted upon tutor instruction.
Any other activities (e.g.: texting, surfing, gaming, social emails, online shopping…etc.) are strictly
forbidden during class time. Students found to be engaged in any non-class activity may lose marks for
overall participation.

Course-Specific Policy
Here, Instructors may insert their own course-specific rules

Administrative Contacts

  User Email Action Date

Azamat Serek azamat.serek@sdu.edu.kz Create 8/14/2021 12:40:06 PM

Syllabus Reviewer/ Силлабус тексеруші

(to be selected by the chairman/ кафедра меңгерушісі таңдай алады)

Azamat Zhamanov