Algorithms and Data Structures DSBA 2020

Материал из Wiki - Факультет компьютерных наук
Перейти к: навигация, поиск


or see this version of the syllabus

You can access all information about this course and the materials via the website

The training course “Algorithms and Data Structures” is offered to students of Bachelor Program “HSE and University of London Double Degree Programme in Data Science and Business Analytics” at the Faculty of Computer Science of the National Research University — Higher School of Economics (HSE). The course is classified as an compulsory subject; it is a two-module course (semester B quartiles 3 and 4).

The course is dedicated to the basics of design and analysis of algorithms. It also involves learning fundamental data structures implemented by the C++ Standard Library (STL).

The lectures and practical classes are closely inter-related. The lectures are primarily intended to introduce new topics, whereas the practical classes are intended for solving specific problems by coding programs in C++. Successful completion of “Introduction to Programming” course is the sole prerequisite for being enrolled in this course.

Lecturers and Teachers

Group 191 192 193
Lecturer Sergey Shershakov
Workshop Instructors Piatskii G.
Rudakov K.

Varenikov A.

Assistants Egor Polyakov , tg: @poegva

Kirill Gelvan
Alexander Serebrennikov

Grading system

The Course Grade

The course grade is based on both ongoing assessment and final examination. The third module ends up with an intermediate test. The fourth module ends up with a final exam. The grade for the final exam together with a cumulative grade represent a final grade for the course. The ultimate grade G for the whole course is calculated as:

4th Module G(rade) = 0.4 · Final Exam + 0.6 · Ongoing Assessment

The Ongoing Assessment

The ongoing assessment grade is accumulated throughout all the classes and is related to a participant’s activity.

During the classes, there are some activities available for students to be involved in. They include (but are not limited by) writing code and developing applications, evaluating practical problems, solving tests, answering questions and so on. Every activity is evaluated and grants some points (RP) to participants. We consider two sorts of points: 1) regular points (RP) and 2) bonus points (BP). BPs are given for additional efforts and for excellent jobs. RPs and BPs are accumulated during the semester.

Ongoing Assessment = min([10·((RP + BP)/RPmax)],10)

Finally, some kinds of out-of-class activities can be accounted for as a part of ongoing assessment. Peer review work, preparing and reporting one of course-related topics are examples of such activities.

Regular Points

Students’ skills are tested using automated testing. This way, a student is assigned an individual task, prepares it by using a personal computer and, then, submits it by using a special service, such as Yandex.Contest or a repository-based tool. The specific solution is subject to further clarification.

The individual home-based task submissions are to be further reassessed through in-class tests or examinations. For any two corresponding submissions, one for home work and one for class work, graded as H and C respectively, the resulting grade R is calculated as follows:

R(egular) = 0.8 · min(H, C) + 0.2 · max(H, C).