ITMO University Computer Science course homeworks

Evolutionary Algorithms

• Master's thesis experiments

Advanced Algorithms

• Semester: 11
• Content: randomized algorithms and scheduling problem soultions in Rust, Kotlin and C++
• Course by: Andrey Stankevich
• Course structure:
  • Randomized Algorithms
    • B. MinDisk
  • Scheduling
    • A. Cheese
    • B. O2 | | C_max
    • C. 1 | outree | Σ wi ci
    • D. 1 | | Σ Ui
    • E. 1 | pi = 1 | Σ wi Ui
    • F. 1 | prec | f_max
    • G. R2 | | C_max
    • H. 1 | prec; pmtn; ri | f_max
    • J. P1 | p1 = 1 | Σ Ui
    • K. P2 | prec; pi = 1 | L_max
    • L. P | intree; pi = 1 | L_max
    • M. R | | Σ Ci
    • N. F2 | | C_max
    • O. Q | | Σ Ci

Bioinformatics

• Semester: 11
• Content: bioinformatics Rosalind problem solutions in Rust
• Course structure:
  • Find the Longest Repeat in a String
  • Align Two Strings Using Affine Gap Penalties
  • Reconstruct a String from its Paired Composition
  • Find a Median String
  • Implement the Viterbi Algorithm
  • Implement RandomizedMotifSearch
  • Implement AdditivePhylogeny
  • Pattern Matching with the Suffix Array
  • Find All Approximate Occurrences of a Collection of Patterns in a String
  • Find a Shortest Transformation of One Genome into Another by 2-Breaks

Parallel Algorithms

• Semester: 11
• Course by: Vitaly Aksenov
• Content: parallel algorithms benchmarking assignments in Rust
• Course structure:
  • Quick Sort
  • Breadth First Search

Big Data Machine Learning

• Semester: 10
• Content: assignments in Scala using Spark
• Course structure:
  • Linear Regression with Spark

Deep Learning

• Semester: 10
• Course by: Denis Stepanov
• Content: miscellaneous theory and practice tasks in Python in Jupyter notebooks
• Course structure:
  • Several Jupyter Notebook tasks: both practice and theory
  • Neural Style Transfer
  • Model Distillation

Compilers

• Semester: 10
• Course by: Computer Science Center
• Content: writing a Lama compiler in Lama language
• Course structure:
  • Expression interpretator
  • X86 assembler compiler
  • AST parser
  • Control Flow
  • All expressions
  • Scope functions
  • Data Structures
  • Fixnum

Mathematical Models

• Semester: 10
• Content: Several small random tasks
• Course structure:
  • Dataset Visualization

Data Processing and Analysis

• Semester: 9
• Course by: Yang Qi
• Content: miscellaneous helpful data manipulations and transformations and a project
• Course structure:
  • Sentiment Analysis of Microblog Data Streams

Information Theory

• Semester: 9
• Course by: Evgeny Belyaev
• Content: compressing algorithm implementations in Rust
• Course structure:
  • Burrows Wheeler transformation with Huffman compression
  • Jpeg format compression improver using BWT + MTF + RLE + AC

Optimization Methods

• Semester: 8
• Course by: Mary Moskalenko
• Content: optimization method algorithm implementation and researching in Python and Jupyter Notebooks
• Course structure:
  • First oder optimization methods

Software Design

• Semester: 7-8
• Course by: A. Kirakozov
• Content: Kotlin languages homeworks solutions: different programming patterns and techniques
• Course structure:
  • Assertions: LRU Cache implementation
  • Modular and Mock object tests: Using VK API for requests
  • Refactoring
  • Model View Controller pattern
  • Bridge pattern: Graph drawing desktop application
  • Visitor pattern: Tokenizing, parsing, printing
  • Aspect Oriented Programming paradigm: Aggregating code statistics
  • Actors: Different search engines request aggregation
  • Reactive Application Example: Product shop backend application
  • Event Sourcing: Fitness center application

Software Testing

• Semester: 7
• Course by: Vsevolod Brekelov
• Content: Miscellaneous patterns and instruments of testing, automatization and deployment
• Course structure:
  • React framework frontend with node.js backend testing: unit and component tests
  • Lighthouse Accessibility, Best Practices, SEO: 100%
  • Kotlin + Spring + PostgreqSQL backend application testing: unit, component tests, mocking with MockK, TestContainers database tests, Allure report integration
  • E2E testing using miscellaneous frameworks: Cypress in JavaScript, Playwright in TypeScript, Selenide in Kotlin with Selenoid and Allure report integrations
  • Github Actions for Continious Integration (linting and testing) and Continious Deployment using Heroku
  • Workshop Performance Testing using thing Gatling Scala DSL: Tinkoff Perf Workshop

Network

• Semester: 7
• Course by: Artem Beresnev
• Content: network connected laboratory reports
• Course structure:
  • Console network components settings utilities in Linux and Windows OS

Machine Learning

• Semester: 7
• Course by: Huawei
• Content: miscellaneous maching learning algorithm implementation using C++ and Python
• Course structure:
  • Codeforces tasks
  • Jupyter notebook tasks
    • kNN classifying method
    • linear regression using stochastic gradient descent with momentum and matrix method
    • Support Vector Machine
    • Naive Bayes Classifier: spam and legit messages determining
    • Decision Tree
    • Boost
    • Clust

Databases

• Semester: 7
• Course by: Georgiy Korneev
• Content: homeworks creating University database step by step and a course project
• Course structure:
  • Introduction: setting environment
  • Models: ERM, PDM, DDL, DML
  • Functional dependencies, keys, attribute set closure
  • Normalization
  • Relational Algebra
  • Relational Calculus, Datalog
  • Modification requests
  • Course project GitHub database: 5 normal form normalization, ERM, PDM, DDL, DML, views, functions, triggers

Numerical Methods

• Semester: 6
• Course by: Alex Segal
• Content: homeworks and course work

Distributed Systems

• Semester: 6
• Course by: Roman Elizarov
• Content: distributed systems homework in Kotlin
• Course structure:
  • distributed mutex

Functional Programming

• Semester: 6
• Course by: Arseniy Seroka
• Content: haskell homeworks
• Course structure:
  • Practices
    • Sorting functions
    • Number operations
  • Homeworks
    • Theoretical
    • Basic language constructions
    • File System Shell
    • Strictness. Multithreading. Advanced types. Lenses. Comonads.

Probability Theory

• Semester: 5-6
• Course by: Irina Suslina
• Content: probability algorithm implementations in Octave
• Course structure:
  • Monte Carlo Method

Parallel Programming

• Semester: 5
• Course by: Roman Elizarov, Nikita Koval
• Content: parallelism homeworks in Java and Kotlin
• Course structure:
  • stack with elimination
  • Michael Scott queue
  • fine grained bank
  • linked list set
  • parallel dijkstra
  • monotonic clock
  • universal construction
  • mcs lock
  • fetch-and-add queue
  • synchronous queue
  • lock free bank
  • stm bank
  • blocking stack

Type Theory

• Semester: 5
• Course by: Dmitry Shtukenberg
• Content: miscellaneous problem solutions in Haskell with make builds, alex and happy
• Course structure:
  • Lambda expression parser
    • haskell version
    • ocaml version
  • normalization
  • expression type reducing

Cryptography

• Semester: 5
• Course by: Alla Levina
• Content: symmetric, stream, assymmetric ciphers and cryptographic hash functions implementation mostly in Kotlin
• Course structure:
  • Symmetric Ciphers
    • Kasiski examination: hacking Vigenere cipher
    • des cipher (Data Encryption Standard)
    • serpent cipher: Advanced Encryption Standard contest second place
  • Stream Ciphers
    • rc4: simpliest stream cipher
    • a5 and comp128: implementation of the A3, A5 and A8 functions defined in the GSM standard.
      A3 is used to authenticate the mobile station to the network.
      A8 is used to generate the session key used by A5 to encrypt the data transmitted between the mobile station and the BTS
  • Assymmetric Ciphers
    • rsa: simpliest modulo operation based assymmetric cipher, one of the first public-key cryptosystems and is widely used for secure data transmission
  • Cryptographic Hash Functions
    • CubeHash: a cryptographic hash function submitted to the NIST hash function competition, SHA-3 semi-finalist

Translation Methods

• Semester: 5
• Course by: Andrey Stankevich
• Content: regex problem solutions in Perl, parsers in Kotlin
• Course structure:
  • Regular Expressions in Perl
  • Manual building top-to-bottom syntax analyzers: c function headers
  • Using automatic analyzers generators Bison or ANTLR: functional to imperative language translation
  • LALR parser generator

Operation Systems

• Semester: 4
• Course by: Dmitry Banschikov
• Content: homeworks in C++ with make builds
• Course structure:
  • Interpreter
  • Find utility subset
  • Piece of JIT complier
  • Introduction to libraries
  • Introduction to sockets
  • Introduction to descriptors transferring and IPC
  • Signals handling

Mathematical Logic

• Semester: 4
• Course by: Dmitry Shtukenberg
• Content: miscellaneous problem solutions in Haskell with make builds, alex and happy
• Course structure:
  • expression parser
  • proof minimization
  • intuitionistic proof conversion
  • propositional calculus completeness
  • formal arithmetic proof check

Descrete Mathematics

• Semesters: 1-4
• Course by: Andrey Stankevich, Artem Vasilyev
• Content: miscellaneous problem solutions in C++
• Course structure:
  • Probability
  • Language Theory and Automats
  • Context Free Grammars
  • Hamilton Paths
  • Graph Planarity
  • Generating Function
  • Turing machine

Algorithms and Data Structures

• Semesters: 1-4
• Course by: Pavel Mavrin
• Content: miscellaneous problem solutions in C++
• Course structure:
  • Dynamic Programming
  • Segment Tree
  • Binary Search Tree
  • Tree Algorithms: LCA, Link-Cut, etc
  • Greed Algorithms
  • Graphs
  • Minimum Paths
  • Strings
  • Maximum Flow And Matching
  • Maximum Flow Minimum Cost
  • Mathematic

Java

• Semester: 3
• Course by: Georgiy Korneev
• Content: homeworks in Java with buildscripts and javadoc
• Course structure:
  • recursive walk
  • array set
  • student db
  • implementor
  • jar implementor
  • javadoc
  • iterative parallelism
  • parallel mapper
  • web crawler
  • hello udp
  • private persons

Web Programming

• Semester: 3
• Course by: Mike Mirzayanov
• Content: codeforces site implementation homeworks in Java with Tomcat ans Spring
• Course structure:
  • HTTP (cURL usage, HTTP-requests, simple HTTP server)
  • Верстка (HTML + CSS)
  • Servlet API (Tomcat, JSON, CaptchaFilter)
  • Servlet API 2 (Java reflection, file database, Freemaker)
  • SQL (SQL basics, refactoring with Java reflection, MariaDB)
  • AJAX (Javascript, AJAX)
  • Spring (Spring Boot)
  • Spring (OneToMany, ManyToOne, ManyToMany relations)
  • Vue.js (Basics)
  • Spring Rest API w/ Vue.js frontend

C++

• Semesters: 2-3
• Course by: Ivan Sorokin
• Content: C++ homework projects
• Course structure:
  • Similar Files Finder: An utility to find files with similar content in directories
  • Substring Finder: An utility to find the given substring in directories
  • Function: std::function implementation

Paradigms of Programming

• Semester: 2
• Course by: Georgiy Korneev, Nikolay Vedernikov
• Content: homeworks in Java with some contracts and single JavaScript parser
• Course structure:
  • calc sha256
  • binary search
  • array queue
  • queue
  • evaluate
  • expression parser
  • exceptions
  • functional expression
  • object expression