Whatever mind

 I have to finish identity and solid course and then i will finish with a good knowledge about backend. then i will go learn angular and following that i will work on signalr and learn signalr and angular together. then i will have practical knowledge about both angular and signalr that will be good. when im done, i will go start making project. my project will be a chat application, i will use solid architecture and design principles.

Comments

Post a Comment

Popular posts from this blog

c# .net learning From 19 Sep 2023

Introduction | C# | Tutorial 1 - YouTube This is the best youtuber! Getting started with c# .net by watching video tutorial of Mr. Bangar Raju and Codewith harry: (1) Mr. Bangar Raju: (1) Working with Visual Studio .NET | C#.NET Tutorial | Mr. Bangar Raju - YouTube   (1) Working with Visual Studio .NET | C#.NET Tutorial | Mr. Bangar Raju - YouTube (2) Codewith harry: https://youtu.be/SuLiu5AK9Ps?t=296 (3) Programming with Mosh: (1) C# Tutorial For Beginners - Learn C# Basics in 1 Hour - YouTube Important topics in c#:  1. Generics  2. garbage collection  3. Exception handling  4. Interface Implementation  5. Delegates(callbacks, multicast etc)  6. Events  7. Multithreading using TPL My .NET Developer Roadmap for 2023 - YouTube Learn: RDBMS, SQL server. Fundamentals-of-Computer-Programming-with-CSharp-Nakov-eBook-v2013.pdf
Read more

template

 **** Combinatorics **** const ll M = 1e9+7;  // default modulus // --- Basic modular operations --- ll mod(ll x, ll m = M){      return ((x % m) + m) % m;  } ll mod_add(ll a, ll b, ll m = M){      return (a + b) % m;  } ll mod_sub(ll a, ll b, ll m = M){      return ((a - b) % m + m) % m;  } ll mod_mul(ll a, ll b, ll m = M){     return ((a % m) * (b % m)) % m; // safe for small numbers } ll mod_pow(ll a, ll b, ll m = M) {     ll res = 1;     a %= m;     while(b) {         if(b & 1) res = (res * a) % m;         a = (a * a) % m;         b >>= 1;     }     return res; } // --- Modular inverse for prime modulus --- // Fermat's Little Theorem: a^(m-2) ≡ a^(-1) (mod m) ll mod_inv_prime(ll a, ll m = M){     return mod_pow(a, m - 2, m); } // --- Modular inverse for non-prime modulus --- /...
Read more

settings.json

 {     "editor.fontFamily": "'Fira Code', Consolas, monospace",     "editor.fontLigatures": true,     "editor.fontWeight": "normal",     "editor.fontSize": 18,     "editor.lineHeight": 26,     "editor.wordWrap": "on",     "editor.cursorBlinking": "smooth",     "editor.cursorStyle": "underline",     "editor.cursorWidth": 5,     "editor.cursorSmoothCaretAnimation": "off",     "editor.smoothScrolling": false,     "editor.mouseWheelSmoothScroll": false,     "workbench.reduceMotion": "on",     "editor.scrollBeyondLastLine": false,     "editor.scrollBeyondLastColumn": false,     "editor.fastScrollSensitivity": 20,     "editor.allowVariableLineHeights": false,     "files.autoSave": "onFocusChange",     "explorer.confirmDelet...
Read more