Prep

Un article de Sometimes Kitties Think Too.

Sommaire 1 Networking 1.1 TCP State Model 1.2 Transport Level 1.3 Session Level 1.4 Network Level 1.5 Misc. Levels 2 Systems 2.1 Memory Management 2.2 Process Management 2.3 File Systems 2.4 Kernel 2.5 Sockets/IPC 2.6 Linux 2.7 Security 3 Software

Networking

TCP State Model

Transport Level

 Functions
 TCP Headers
 Timeouts
 Security Risks
 Improvements
 Windowing
 Closing/resetting
 Random Early Detection (RED)
 TCP Congestions/Error Control

Session Level

 HTTP/SSL

Network Level

  IP Header 
  IP Datagram (46-1500 byte)
  Resource Reservation (RSVP)
  DiffServ
  IPv6
  Shortest Path routing
  Dijkstra's Algorithm
  Distance Vector Protocols
  Link State Protocols

Misc. Levels

  Overview
  Encapsulation
       Ethernet Header/Trailer
       Ethernet has a CRC/FCS in the trailer. 
       Requirements for ethernet are that device support 1 of 2 encapsulation types: RFC 1042 and 849

Systems

  Ken Thompson, Dennis Ritchie

Memory Management

  Virtual memory mgmt
  Paging, swapping
  

Process Management

  Processes/threads
  CPU Scheduling
  Synchronization
  Deadlock

File Systems

  File System API (open, read, write, seek, close, stat)
  Inodes, Links (hard, soft), Data Blocks
  File types/Special files (character files, etc...)
  File Permissions
  Storage
  NFS

Kernel

  Kernel services
  Scheduling
  Signals
  Multiplexing I/O
  Disk Device drivers

Sockets/IPC

Linux

  File system layout
  Distributions
  /proc virtual filesystem
  Device drivers

  I/O Control - buffering, fread/fput, etc..
  Blocking/non-blocking operations
  Buffering
  Process Control
     fork, vfork (doesn't obtain a copy of parent's heap/stack)
     wait, waitpid (non-blocking)
  System Files (passwd, groups, shadow, services)
  time_t, tm, TZ, localtime, strftime, ctime
  malloc, calloc
  exit, _exit, _Exit
  start routine
  program space (initialized variables, non-initialized, BSS, heap, stack)

Security

Software

Puzzles

Popular Questions

Algorithm	Best Case	Worst Case
Divide and Conquer Problems
Merge Sort	O(nlogn)
Quick Sort	O(nlogn)	O(n^2)
Binary Search (sorted list)	O(n)	O(n)
QuickSort	O(nlogn)	O(n^2)

Trees

  Traversals: O(n)
  Binary search trees
  Heaps

Lists

  Linked lists

Graphs/Maps