INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA

UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA

UNIVERSITY

SYLLABUS

Course Algorithms and Data Structures 2

Program Computer Science
Faculty Faculty of Business and Technologies
Course code CS116
Lecturer Dr. George Mandaria, Affiliated Assoc. Professor
(+995) 599 429234
[email protected], [email protected]

consultations will be held for two hours a week by prior agreement.

Study cycle Bachelor’s (the first cycle of higher education)
Study semester IV
Course status Obligatory
Amount of credits and 6 ECTS
distribution of hours 15 study weeks, 125 hours, Including 47 contact (Lectures – 29 hrs, Practical Work –
14 hrs, Midterm Exam – 2 hrs, Final Exam – 2 hrs) and 78 independent work hours
Admission
Algorithms and Data Structures 1
preconditions
Purposes of the course To give to students an important knowledge in the field of projection and realization of
processes, which includes building and realization optimal algorithms. To introduce
fundamental techniques for the design of efficient algorithms. Also to show the importance
of building effective algorithms for solving problems by optimal methods using a minimum
resources, through the learning nonspecific algorithms. Therefore, developing creative
thinking for students. to provide strong fundament for further studying and grow in this
field.
Learning outcomes After the completion of the study course students gain following generic (transferable) and
field-specific competencies:
Knowledge and  Important knowledge in the field of algorithmization – projecting and realization of
understanding processes;
 Ability of solving a variety of problems by known algorithms using of algorithmic methods;
 Knowledge of methods and techniques for finding efficient algorithms;
 Analytical, creative and scientific thinking that is oriented on finding optimal solutions.

IBSU.R3.F1E; Revision No.: 0 Page No: 1/9

 INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA
UNIVERSITY

SYLLABUS

Skills  Ability to use algorithmic methods for optimal solving economic and other different
problems;
 Ability of Conducting research or practical projects in accordance with predetermined
data;
 Ability to use algorithms in real practical professional activities;
 Ability to select and interpret data, also to analyze abstract data and/or situations using
standards and certain selected methods and to make sound judgment;
 Ability to formulate difficult issues like problems or solutions in verbal and written form;
 Ability of formalization of different kinds of tasks;
 Ability to search and find necessary information in different information sources;
 Carry out of own activities with maintaining ethical principles;
 Assessment of learning process consecutively and in many respects. Determining
future needs of learning and skills of independent learning.

Content 1 week:
Lecture, 2 hours – Introduction to Course. Repeating material from the
obligatory courses.
Repeating material from the previous semester.
Lab work, 1 hour
2 week:
Lecture, 2 hours – Dynamic Programming and Greedy Algorithms: Elements of
dynamic programming, Reducing task into subtask, Concept of recurrent
dependence, Right recurrent dependence.
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein,
(2009). Introduction to Algorithms (3rd Edition). Massachusetts Institute of
Technology, ISBN 978-0-262-03384-8 (hc: alk. paper), ISBN 978-0-262-53305-8
(pbk.: alk. paper), Chapter 15. Dynamic Programming, pp. 359-413
Lab work, 1 hour
3 week:
Lecture, 2 hours – Dynamic Programming and Greedy Algorithms: Organizing
one and two-dimensional tables, Calculating elements of one and two-
dimensional tables.
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein,
(2009). Introduction to Algorithms (3rd Edition). Massachusetts Institute of
Technology, ISBN 978-0-262-03384-8 (hc: alk. paper), ISBN 978-0-262-53305-8
(pbk.: alk. paper), Chapter 15. Dynamic Programming, pp. 359-413
Lab work, 1 hour

IBSU.R3.F1E; Revision No.: 0 Page No: 2/9

 INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA
UNIVERSITY

SYLLABUS

4 week:
Lecture, 2 hours – Dynamic Programming and Greedy Algorithms: Calculating
elements of two-dimensional tables with additional constraints, Maximal
increasing subsequence.
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein,
(2009). Introduction to Algorithms (3rd Edition). Massachusetts Institute of
Technology, ISBN 978-0-262-03384-8 (hc: alk. paper), ISBN 978-0-262-53305-8
(pbk.: alk. paper), Chapter 15. Dynamic Programming, pp. 359-413
Lab work, 1 hour, quiz I
5 week:
Lecture, 2 hours – Dynamic Programming and Greedy Algorithms: Greedy
algorithms, Elements of greedy strategy, An Activity-selection problem.
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein,
(2009). Introduction to Algorithms (3rd Edition). Massachusetts Institute of
Technology, ISBN 978-0-262-03384-8 (hc: alk. paper), ISBN 978-0-262-53305-8
(pbk.: alk. paper), Chapter 16. Greedy Algorithms pp. 415-450
Lab work 1 hour
6 week:
Lecture, 2 hours – Combinatorics: Permutation, Finding all the permutations in
lexicographic order. Combinations, Finding all the combinations in
lexicographic order.
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein,
(2001). Introduction to Algorithms (2nd Edition). Massachusetts Institute of
Technology, ISBN 0-262-03293-7 (hc.: alk. paper MIT Press), ISBN 0-07-013151-
1 (McGraw Hill), Chapter 5. Combinatorics and Probability pp. 91-106
Lab work, 1 hour, quiz II

7 week:
Lecture, 2 hours – Combinatorics: Arrangements, Finding all the arrangements
in lexicographic order. Subsets. Finding all the subsets of the given set.

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein,

(2001). Introduction to Algorithms (2nd Edition). Massachusetts Institute of
Technology, ISBN 0-262-03293-7 (hc.: alk. paper MIT Press), ISBN 0-07-013151-
1 (McGraw Hill), Chapter 5. Combinatorics and Probability pp. 91-106

Lab work, 1 hour

8 - 9 week:
IBSU.R3.F1E; Revision No.: 0 Page No: 3/9
 INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA
UNIVERSITY

SYLLABUS

Lab work, 1 hours

Midterm, 2 hours

10 week:
Lecture, 2 hours - Additional Algorithms of Sorting: Description of quicksort,
Performance of quicksort, A randomized version of quicksort, Analysis of
quicksort.

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein,

(2009). Introduction to Algorithms (3rd Edition). Massachusetts Institute of
Technology, ISBN 978-0-262-03384-8 (hc: alk. paper), ISBN 978-0-262-53305-8
(pbk.: alk. paper), Chapter 7. QuickSort pp. 170-190
Lab work, 1 hour

11 week:
Lecture, 2 hours - Graph theory: Definition of graph, Examples of graphs,
Adjacency and incidence, Representation of graphs, Routes in graph.
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein,
(2009). Introduction to Algorithms (3rd Edition). Massachusetts Institute of
Technology, ISBN 978-0-262-03384-8 (hc: alk. paper), ISBN 978-0-262-53305-8
(pbk.: alk. paper), Chapter 22. Elementary graph Algorithms pp. 589-623

Lab work, 1 hour, quiz III

12 week:
Lecture, 2 hours - Graph theory: Connected graphs. Connected components,
Bipartite graphs, Breadth-First Search, Solving some standard tasks using
Breadth-First Search algorithm.
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein,
(2009). Introduction to Algorithms (3rd Edition). Massachusetts Institute of
Technology, ISBN 978-0-262-03384-8 (hc: alk. paper), ISBN 978-0-262-53305-8
(pbk.: alk. paper), Chapter 22. Elementary graph Algorithms pp. 589-623

Lab work, 1 hour

13 week:
Lecture, 2 hours – Graph theory: Depth-First Search, Solving some standard
IBSU.R3.F1E; Revision No.: 0 Page No: 4/9
 INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA
UNIVERSITY

SYLLABUS

tasks using Depth-First Search algorithm, Finding of fundamental set of cycles.

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein,
(2009). Introduction to Algorithms (3rd Edition). Massachusetts Institute of
Technology, ISBN 978-0-262-03384-8 (hc: alk. paper), ISBN 978-0-262-53305-8
(pbk.: alk. paper), Chapter 22. Elementary graph Algorithms pp. 589-623

Lab work, 1 hour, quiz IV

14 week:
Lecture, 2 hours – Graph theory: Shortest path. Relaxation of edge. Single
Destination Shortest Path, Dijkstra's algorithm.
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein,
(2009). Introduction to Algorithms (3rd Edition). Massachusetts Institute of
Technology, ISBN 978-0-262-03384-8 (hc: alk. paper), ISBN 978-0-262-53305-8
(pbk.: alk. paper), Chapter 24. Single-Source Shortest Paths pp. 651-683

Lab work, 1 hour

15 week:
Lecture, 2 hours – Data Structures: Heap. Maintaining the main property of
heap , Building a heap, Operations on heap.
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein,
(2009). Introduction to Algorithms (3rd Edition). Massachusetts Institute of
Technology, ISBN 978-0-262-03384-8 (hc: alk. paper), ISBN 978-0-262-53305-8
(pbk.: alk. paper), Chapter 6. Heapsort pp. 151-170
Lab work, 1 hour, quiz V

16 week:
Lecture, 2 hours – Data Structures: Binary search trees. Binary-Search-Tree
property, Searching of key in the binary search tree - Recursive and iterative
procedures. Searching of minimal and maximal keys, Searching of predecessor
and successor elements of a given element in the binary search tree. Insertion
and deletion of element.
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein,
(2009). Introduction to Algorithms (3rd Edition). Massachusetts Institute of
Technology, ISBN 978-0-262-03384-8 (hc: alk. paper), ISBN 978-0-262-53305-8
(pbk.: alk. paper), Chapter 12. Binary Search Trees pp. 286-308
Lab work, 1 hour,

IBSU.R3.F1E; Revision No.: 0 Page No: 5/9

 INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA
UNIVERSITY

SYLLABUS

17-19 weeks: Final exam

Teaching and learning methods

Lecture verbal, spoken method

Presentation (By lecturer)

Demonstration

Induction

Deduction

Analysis

Synthesis

E-learning

Group Work Discussion / Debates

Working on a book

Cases Study

Induction

Deduction

Analysis

Practical / laboratory Solving of tasks

work Problems solutions

Group work

Individual work

Working on a book

Induction

Analysis

Synthesis

E-learning

Independent work Working on a book

Induction

Deduction

Analysis

Synthesis

Problem-based learning (PBL)

Evaluation criteria The purpose of the assessment is the qualitative determination of student learning
outcomes in relation to the goals and parameters of the academic program.
Students are assessed verbally and / or in writing. The maximum grade for a course /
component is 100 points. The score includes intermediate and final scores of 100 points.
The rating system allows you to:
Five types of positive assessment:
1) (A) Excellent - 91-100% of the maximum assessment;
2) (B) Very good - 81 - 90% of the maximum assessment;
3) (C) Good - 71 - 80% for maximum assessment;
4) (D) Satisfactory - 61 - 70% of the maximum assessment;

IBSU.R3.F1E; Revision No.: 0 Page No: 6/9

 INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA
UNIVERSITY

SYLLABUS

5) (E) Enough - 51 - 60% for maximum assessment.

Two types of negative assessment:

1) (FX) Failure - 41 - 50% of the maximum assessment, which means that student has to
work more to pass the course, is given additional independent work hours and is admitted
to the exam one more time;
2) (F) Failure - 40% or lower of the maximum assessment, which means that work hours
for the student in this course is not enough and he should retake this course.
The limit of minimal competency is determined for midterm and final assessments. The
minimal competency limit of the final assessment should not exceed 60% of the final
assessment.
The distribution of midterm and final grades, their minimal competency limits and
grading rubrics are written in the corresponding component of syllabus.
A credit can be obtained only after the student has achieved outcomes listed in syllabus,
subject to the following requirements:
A) in case of exceeding the limits of midterm and final assessments;
B) in case of getting at least 51 points out of a maximal 100 points.
A student is admitted to the additional exam if he scored from 41-50 points out of
maximum 100 points or not less than 51 points, but did not exceed the minimum
competency established for the final exam.
A midterm assessment includes:
Midterm exam (written) - maximum 35 points;
Quizes - maximum 15 points;
Audience activity - maximum 10 points.
Student is admitted to final exam if his midterm evaluation is minimum 20 points out of
60.
Midterm exam is written, questions are from the subject’s of syllabus and it’s maximum
evaluation is 35 points.
midterm exam contains 7 questions, each question is evaluated by maximum 5 points.
5-4,5 points: The answer is full . The subject is told precisely and fully . The terminology
is correct.Student knows the whole subject deeply using major literature.
4-3,5 points: The answer is full, but with some gaps. The terminology is right. The subject
is told almost fully. There are no essential mistakes. Student knows the subject very well
using major literature .
3-2,5 points: The answer isn’t full. it’s satisfactory. The terminology isn’t full. Student
knows the subject , but there are several mistakes.
2-1,5 points: The answer isn’t full. The terminology isn’t right. The subject material is told
partly. student doesn’t know major literature fully. There are some important mistakes.
1-0,5 points: The answer isn’t full. There is no terminology used or it’s wrong. There are
only some fragments of the subject told.
0 points: The answer doesn’t go to the question or there is no answer.
IBSU.R3.F1E; Revision No.: 0 Page No: 7/9
 INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA
UNIVERSITY

SYLLABUS

Quizzes is evaluated by maximum 15 points. The quantity of quizzes are 5. Each of them
is evaluated by 3 points. It has 3 questions and each question is evaluated by 1 point.
1-0,9 points: The answer is full . The subject is told precisely and fully.
0,8-0,7 points: The answer is full . The subject is told precisely and fully . There are no
important mistakes.
0,6-0,5 points:The answer isn’t full. it’s satisfactory. Student knows subject but there are
some mistakes.
0,5-0,3 points: The answer isn’t full. The subject material is told partly. There are some
important mistakes.
0,2-0,1 points: The answer isn’t full. Only some fragments of the subject are told.
0 point: The answer doesn’t go to the question or there is no answer.
Audience activity is evaluated by maximum 10 points. The student is evaluated randomly
on the 10 different lectures (except first and last lectures and midterm exam). By
maximum 1 point on one lecture.
1 point: A student carefully listens to the lecturer, fully focused on a lecture, actively
involved in the process of explaining the new material, expresses their opinions, makes
certain conclusions.
0.5 points: A student carefully listens to the lecturer, partly involved in the process of
explaining the new material, expresses their opinions.
0 points: A student not carefully listens to the lecturer, can't actively involve in the
process of explaining the new material, can't express their opinions.

Final exam should be written, questions are from the subject’s of syllabus, maximum
evaluation is 40 points. The limit of minimal competency for final exam is 15 points. It
consists of 8 questions, each question is evaluated by 5 points.
5-4,5 points: The answer is full . The subject is told precisely and fully . The terminology
is correct.Student knows the whole subject deeply using major literature.
4-3,5 points: The answer is full, but with some gaps. The terminology is right. The subject
is told almost fully. There are no essential mistakes. Student knows the subject very well
using major literature.
3-2,5 points: The answer isn’t full. it’s satisfactory. The terminology isn’t full. Student
knows the subject , but there are several mistakes.
2-1,5 points:The answer isn’t full. The terminology isn’t right. The subject material is told
partly. student doesn’t know major literature fully. There are some important mistakes.
1-0.5 points: The answer isn’t full. There is no terminology used or it’s wrong. There are
only some fragments of the subject told.
0 point:The answer doesn’t go to the question or there is no answer.
Basic literature 1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, (2009).
Introduction to Algorithms (3rd Edition). Massachusetts Institute of Technology, ISBN
978-0-262-03384-8 (hc: alk. paper), ISBN 978-0-262-53305-8 (pbk.: alk. paper)
2. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein  2001,
Introduction to Algorithms(2nd Edition), by the Massachusetts Institute of technogy,
IBSU.R3.F1E; Revision No.: 0 Page No: 8/9
 INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA UNIVERSITY - INTERNATIONAL BLACK SEA
UNIVERSITY

SYLLABUS

ISBN 0-262-03293-7 (hc.: alk. paper MIT Press), ISBN 0-07-013151-1 (McGraw Hill)
Auxiliary literature 1. G. Mandaria (2015), Informatics–Algorithmic Methods, Book 2. Tbilisi;
2. Z. Gamezardashvili (2004) – Algorithms. Kutaisi;
3. G. Mandaria and others (2000) - Olympic Problems in Informatics (Tasks, Solutions,
Sources). ISBN 99928-25-03-0, “Lampari”, Tbilisi;
4. https://algs4.cs.princeton.edu/home/
5. http://e-maxx.ru/index.php
6. https://wcipeg.com/main
7. http :// codeforcess.com
8. http :// acm.timus.ru
9. http:// www.spoj.pl
10. http:// www.hsin.hr/COCI
11. http :// www.topcoder/tc
12. http:// www.geolymp.org
13. http:// ace.delos.com

IBSU.R3.F1E; Revision No.: 0 Page No: 9/9