SQL - Steps for clean SQL
The steps and the stages you can take in order to create clear and clean SQL and comparing it to standard programming languages
Nov 12, 2020•9 min
Programmers Quickie
Software Engineering Best Practices, System Design, High Scale, Algorithms, Math, Programming Languages, Statistics, Machine Learning, Databases, Front Ends, Frameworks, Low Level Machine Structure, Papers and Computing, Computer Science Book Reviews - Everything!
Episodes
Clean SQL
Best practice for writing clean maintainable understandable human readable SQL.
Oct 29, 2020•12 min
DNS for programmers
DNS is just another high scale service we can learn from how it was designed for future high scale services architecture
Oct 24, 2020•8 min
Floating Point
The floating point number representation in computers is another data type but when should you be using or not, what are its advantages and limitations
Oct 17, 2020•6 min
Tools
Editors command line intellij visual studio vim bash zsh markdown wiki and looking what are the best practice tools for a programmer today
Oct 05, 2020•15 min
Productivity for Programmers
Here are 10 tips for productivity specifically for programmers from the top brilliant minds of productivity super experts
Oct 01, 2020•10 min
Basic sorting differences
The differences between the basic sorting algorithms selection bubble and insertion there are delicate ones.
Sep 24, 2020•10 min
Anti Process
How do companies deal and how should they deal with detention between efficiency wounds and innovation do this collide and what can we do about it What do companies actually do about this tension. And the Netflix example from the recent Netflix CEO book.
Sep 18, 2020•19 min
BFS
BFS breadth first search is another building block algorithm. It's built from a queue and a visited marker array.
Sep 16, 2020•13 min
How Random is Random
We all use java.util.Random let's see what a professor of mathematics who recently won $3m prize the largest one in math has to say about randomness.
Sep 12, 2020•12 min
JSON and Relational Databases
The JSON data model and the relational databse and sql model
Sep 11, 2020•9 min
DFS - Building graph algorithms bottom up
Building more complex graph algorithms based on the basic building blocks such as DFS and from there moving on to connected components shortest path traveling salesman
Sep 05, 2020•8 min
Design Documents
What are the smells for a bad design document, What makes a design document good, what should you include in it, what should you not include in it guidelines on writing top notch design documents for software engineers.
Sep 04, 2020•13 min
Trees and Graph Terminology
Rooted graphs, graphs, DAG, different ways of storing graphs bipartite graphs etc.
Aug 28, 2020•8 min
Hidden Technical Debt in Machine Learning Systems
Machine learning offers a fantastically powerful toolkit for building useful complexprediction systems quickly. This paper argues it is dangerous to think ofthese quick wins as coming for free. Using the software engineering frameworkof technical debt, we find it is common to incur massive ongoing maintenancecosts in real-world ML systems. We explore several ML-specific risk factors toaccount for in system design. These include boundary erosion, entanglement,hidden feedback loops, undeclared con...
Jul 23, 2020•15 min
Statistical Significance and Hypothesis Testing
In statistical hypothesis testing, a result has statistical significance when it is very unlikely to have occurred given the null hypothesis.
Jul 17, 2020•11 min
B Trees Research Paper (1970)
In computer science, a B-tree is a self-balancing tree data structure that maintains sorted data and allows searches, sequential access, insertions, and deletions in logarithmic time. The B-tree generalizes the binary search tree, allowing for nodes with more than two children.[2] Unlike other self-balancing binary search trees, the B-tree is well suited for storage systems that read and write relatively large blocks of data, such as discs. It is commonly used in databases and file systems....
Jul 16, 2020•16 min
Peter Naur's Research Paper - Programming as Theory Building
Peter Naur (25 October 1928 – 3 January 2016)[1] was a Danish computer science pioneer and Turing award winner. He is best known as a contributor, with John Backus, to the Backus–Naur form (BNF) notation used in describing the syntax for most programming languages. He also contributed to creating the language ALGOL 60.
Jul 10, 2020•19 min
Flutter - UI - Well Organized Cross Platform Compiled UI Code.
Fast development . Flutter's hot reload helps you quickly and easily experiment, build UIs, add features, and fix bugs faster. Experience sub-second reload times..
Jul 06, 2020•12 min
Vim CheatSheet
Vim is an extremely powerful editor. Not only you can use it from command line but also from IntelliJ, Visual Studio Code, and for actual command line manipulation.
Jul 05, 2020•10 min
DateTime and ISO 8601
ISO 8601 Data elements and interchange formats – Information interchange – Representation of dates and times is an international standard covering the exchange of date- and time-related data. It was issued by the International Organization for Standardization and was first published in 198
Jul 01, 2020•14 min
Vim for developers - Let's Talk
Should you invest time in using Vim for software development? What should you do with Vim? How do you search for files? What about syntax coloring? Loading files from history, autocomplete and more. As it turns out you don't need plugins for all this.
Jun 27, 2020•17 min
Google's Monorepo Research Paper
Why Google Stores Billions of lines of code in a single repository - this is a brief summary of a research paper published by google.
Jun 24, 2020•24 min
Research Paper Review - Auto Distributed Systems Code Corrector
In a paper named Fixed it for you. Protocol repair using lineage graphs it is described how machine can autocorrect programming error.
Jun 09, 2020•16 min
Dijkstra Vs Bellman Ford Algorithm
The Bellman–Ford algorithm is an algorithm that computes shortest paths from a single source vertex to all of the other vertices in a weighted digraph.
Jun 05, 2020•15 min
Edsger Dijkstra's Shortest Path Algorithm
Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years later. The algorithm exists in many variants
May 29, 2020•15 min
Linux Performance for Software Developers
As developers, we sometimes want to check the performance of our server, we are not system administrators so we do not run these commands on a daily basis but here is a quick overview of it.
May 24, 2020•16 min
Selection Sort
In computer science, selection sort is an in-place comparison sorting algorithm. It has an O(n²) time complexity, which makes it inefficient on large lists, and generally performs worse than the similar insertion sort
May 22, 2020•10 min
Containers - cgroups, namespaces, hypervisor, vm's
cgroups is a Linux kernel feature that limits, accounts for, and isolates the resource usage of a collection of processes. Engineers at Google started the work on this feature in 2006 under the name "process containers".
May 20, 2020•13 min
Recursive Backtracking
Backtracking is a general algorithm for finding all solutions to some computational problems, notably constraint satisfaction problems, that incrementally builds candidates to the solutions, and abandons a candidate as soon as it determines that the candidate cannot possibly be completed to a valid solution
May 16, 2020•18 min
For the best experience, listen in Metacast app for iOS or Android
Open in Metacast