KnowledgeShop

Learn & Share

TODO - Topics to Learn In-depth

  • Algorithms
    • List sorting algorithms
    • String paths - backtracking algorithms
  • Architecture
    • Shared nothing architecture
    • SEDA
  • Cloud computing
    • What are the things to do to migrate an application to cloud? or How do you design an application to be cloud-native?
  • Coding principles
    • Command Query Separation
  • Datastructures.md
    • Skiplist
    • Self-balanced tree
    • Splay tree
    • Graphs
  • Db Design
    • Time-series database
  • Db performance
    • Lock type - update lock
    • Row-wide partitioning
    • Column-wide partitioning
    • DB Replication (HADR)
  • Distributedcomputing
  • Elasticsearch
    • learn this in-depth
  • Functional programming
    • Persistent Data structures (STM)
    • Loan Pattern
  • Groovy
    • Concurrency
    • DSL
    • Double dispatch
    • Expando
    • How coercion works
1
2
3
4
5
Point p = [1,2]
println p

Point p2 = [x:1, y:2]
println p2