When contributing to this repository, please first discuss the change you wish to make via issue, email, or any other method with the owners of this repository before making a change.
Please note we have a code of conduct, please follow it in all your interactions with the project.
| 1. What is information security and how is it achieved? | |
| 2. What are the core principles of information security? | |
| 3. What is non-repudiation (as it applies to IT security)? | |
| 4. What is the relationship between information security and data availability? | |
| 5. What is a security policy and why do we need one? | |
| 6. What is the difference between logical and physical security? Can you give an example of both? | |
| 7. What’s an acceptable level of risk? | |
| 8. What are the most common types of attacks that threaten enterprise data security? | |
| 9. What is the difference between a threat and a vulnerability? | |
| 10. Can you give me an example of common security vulnerabilities? |
I was at Amazon for about six and a half years, and now I've been at Google for that long. One thing that struck me immediately about the two companies -- an impression that has been reinforced almost daily -- is that Amazon does everything wrong, and Google does everything right. Sure, it's a sweeping generalization, but a surprisingly accurate one. It's pretty crazy. There are probably a hundred or even two hundred different ways you can compare the two companies, and Google is superior in all but three of them, if I recall correctly. I actually did a spreadsheet at one point but Legal wouldn't let me show it to anyone, even though recruiting loved it.
I mean, just to give you a very brief taste: Amazon's recruiting process is fundamentally flawed by having teams hire for themselves, so their hiring bar is incredibly inconsistent across teams, despite various efforts they've made to level it out. And their operations are a mess; they don't real
This list is meant to be a both a quick guide and reference for further research into these topics. It's basically a summary of that comp sci course you never took or forgot about, so there's no way it can cover everything in depth. It also will be available as a gist on Github for everyone to edit and add to.
| // See http://en.wikipedia.org/wiki/Kruskal's_algorithm | |
| // and http://programmingpraxis.com/2010/04/06/minimum-spanning-tree-kruskals-algorithm/ | |
| var _ = require('underscore'); | |
| var nodes = ["A", "B", "C", "D", "E", "F", "G"]; | |
| var edges = [ | |
| ["A", "B", 7], ["A", "D", 5], |