Google: Difference between revisions
Content added Content deleted
(→Topics) |
(→Topics) |
||
Line 9:
| Algorithms
|-
| Web technologies
HTML, CSS
OSI layers
ICMP
DNS
How does internet work
How do browsers work
APIs
Authentication
Email
Architecture of the web
How to optimize web applications
Static routing
BGP, OSPF in Linux
load balancing,
|-
| Databases
Basic SQL
Relational database
DB Designing
|-
| Debugging
Line 19 ⟶ 45:
| Clouds
|-
| Infrastructure and system administration
Shell scripting
logging
initalization
software packaging and distribution
Kernel
libraries
system calls
memory management
permissions
file systems for Linux/Unix or Windows
|-
Kubernetes
Docker
▲| Container technologies like Kubernetes and Docker.
| Big Data and Machine Learning: Relational and non-relational databases▼
| Big Data analytics and frameworks like MapReduce, Hadoop and Spark. ▼
| Machine learning/artificial intelligence, like TensorFlow.▼
|}
▲ IP
▲ HTTP/HTTPS
▲ Caching
▲ Cookies
▲ Tcp
▲ Udp
▲ Latency
▲ Routing
▲ Indexing
*Platform & OS
*Pros & Cons
= Preparations =
|
Revision as of 00:49, 12 November 2019
Topics
Header text | Header text |
---|---|
OSs | |
Algorithms | |
Web technologies
HTML, CSS OSI layers IP Tcp Udp ICMP HTTP/HTTPS Caching DNS How does internet work How do browsers work APIs Authentication Cookies Email Architecture of the web How to optimize web applications Latency Routing Static routing BGP, OSPF in Linux load balancing, | |
Databases
Basic SQL Relational database DB Designing Indexing | |
Debugging | |
Distributes system | |
Clouds | |
Infrastructure and system administration
Shell scripting logging initalization software packaging and distribution Kernel libraries system calls memory management permissions file systems for Linux/Unix or Windows | |
Container technologies
Kubernetes Docker |
- Platform & OS
- Pros & Cons
- Big Data and Machine Learning: Relational and non-relational databases
- Big Data analytics and frameworks like MapReduce, Hadoop and Spark.
- Machine learning/artificial intelligence, like TensorFlow.
Preparations
- 1st round
- 1st Week Dec starting
- Video interview
coding tech communication thinking
- 1 Hour:
1st Troubleshooting code Distributes system Web & Network technologies
- F2F - Bangalore office
2 tech Networking/General Web troubleshooting 1 manager
- Share use cases
- Working with Code (15 min)
- What is code, Issue & How to improve it.
- Ask question about question
- Break it down
- No IDE
- No library
Questions
- Unix System call that takes path & returns inode name
stat()
- Signal sent by kill command by default
TERM
- HTML -> Div vs SPAN
Block vs inline
- Quick sort -> run time
n log n
- Fastest to slowest:
CPU Memory Context switching Disk
Disk access may be significantly faster at times due to caching ... so can memory access (CPUs sometimes manage a caches from main memory to help speed up access and avoid competition for the bus). Memory access could also be as slow or slightly slower than disk access at times, due to virtual memory page swapping. Context switching needs to be extremely fast in general ... if it was slow then your CPU could begin to spend more time switching between processes than actually performing meaningful work when several processes are running concurrently. Register access is nearly instantaneous.