Revision as of 10:04, 7 November 2019

Topics

OSs
Algorithms
Web technologies - HTML, CSS
Networking
Databases
Debugging
Distributes system
Clouds

Web tech

IP
HTTP/HTTPS
Caching
Cookies

Netwroking

Tcp
Udp
Latency
Routing

Data

DB Desing
Indexing

Unix/Linux
Platform & OS
Pros & Cons

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 -> path & reutrn inode name -> stat()
Signal -> term -> kill by default
HTML -> Div vs SPAN -> inline
Quick sort -> runnign time -> n log n
Sort fastest:

Read from CPU
Read from main memory
Context switch
Disk seek

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.

@@ Line 1: / Line 1: @@
-*Topics:
+= Topics =
  '''OSs'''
  '''Algorithms'''
@@ Line 9: / Line 9: @@
  Distributes system
  Clouds
-*Unix -> path & reutrn inode name -> stat()
-*Signal -> term -> kill by default
-*HTML -> Div vs SPAN -> inline
-*Quick sort -> runnign time -> n log n
-*Sort fastest:
- Read from CPU
- Read from main memory
- Context switch
- Disk seek
@@ Line 66: / Line 56: @@
 *No IDE
 *No library
+= Questions =
+*Unix -> path & reutrn inode name -> stat()
+*Signal -> term -> kill by default
+*HTML -> Div vs SPAN -> inline
+*Quick sort -> runnign time -> n log n
+*Sort fastest:
+ Read from CPU
+ Read from main memory
+ Context switch
+ Disk seek
+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.