arvind posted an update in the group Computer Science 101 2 months, 1 week ago
FREE E BOOK “A freshman’s Beacon for Computer Science Millennials” by Nagasuri Bala Venkateswarlu that is designed to help CSE and IT students on How to plan their four years of college stay fruitfully. It is trending very nicely. http://bit.ly/30OdAub
arvind posted an update in the group Python programming 2 months, 2 weeks ago
One significant advantage of learning Python is that it’s a general-purpose language that can be applied in a large variety of projects. Below are just some of the most common fields where Python has found its use:
Data science
Scientific computing
Web development
Books on Python
A Byte of Python is a free book on programming using the Python l…[Read more]
arvind posted an update in the group Algorithms 2 months, 2 weeks ago
Algorithms let you figure out efficient ways to handle large amounts of data. A website like google has many algorithms running behind its simple interface
1. Page rank algorithm to find the most important pages
2. Indexing and Search algorithms
3. Algorithms that reduces the website response time
4. Distributed algorithms that can run on…[Read more]
arvind posted an update in the group Algorithms 2 months, 2 weeks ago
Dijkstra’s algorithm is an iterative algorithm that provides us with the shortest path from one particular starting node to all other nodes in the graph. Again this is similar to the results of a breadth first search
A video tutorial in 3 minutes
arvind posted an update in the group Jobs and Career 2 months, 3 weeks ago
How to make a career in DevOps
What is DevOps?
AWS has a great article that outlines DevOps as a work environment where development and operations teams are no longer “siloed”, but instead work together across the entire application lifecycle — from…[Read more]
arvind posted an update in the group Theory of computing 2 months, 3 weeks ago
P is the set of all decision problems that can be solved in polynomial time (by a deterministic Turing Machine). Polynomials are functions of the form sum(c_i xi). So, if there exist an algorithm solving problem X in O(xn) time where n is a natural number, we say X in P. An example is finding shortest path. Remember Dijkstra’s Algorithm? The fact…[Read more]
arvind posted an update in the group Databases 2 months, 3 weeks ago
arvind posted an update in the group Algorithms 2 months, 3 weeks ago
arvind posted an update in the group Discrete mathematics 2 months, 4 weeks ago
Birthday paradox (probability) https://betterexplained.com/articles/understanding-the-birthday-paradox/
arvind posted an update in the group Tech interviews 2 months, 4 weeks ago
Programming interview questions