I recently finished watching a tremendous free distributed systems course. The lecturer is a famous Dr. Martin Kleppmann who wrote a well-known book with the red wild boar cover 😄 This course includes 8 lectures split into 23 videos: 1. Introduction 2. Models of distributed systems 3. Time, clocks, and ordering
I recently finished reading the book I've heard a lot of. Both authors are well-known Software Architects with dozen years of experience. Mark Richards, for example, runs great bi-weekly Software Architecture Monday lessons. I want to share my opinion about this book, save some notes I made, and explain why
Motivation and Selection 2022 was a really tough year so I read only 11 books 😞 This year (2023) I decided to create a reading plan in advance and track my progress every week. This list includes nonfiction, sci-fi, classics, and tech books. All of them were recommended by my friends
I'm Dmitry, a Software Engineer with an entrepreneurial mindset. I'm going to share here my thoughts, plans, ideas, and everything I'll find interesting. Stay tuned!
Algorithm complexity Definition The growth rate big O T(x)=O(g(x)) The growth rate of f(x) is asymptotically less than or equal to (<=) the growth rate of g(x) little o T(x)=o(g(x)) The growth rate of f(x) is asymptotically less than (<) the