deque with doubly linked list class Node: def init(self, datum, pre=None, _next=None): self.datum = datum self.pre = pre self.next = _next def insertbehind(front: Node, t...
class MaxHeap(object): def init(self, items): self.queue = [None] + items # 0 번 인덱스 사용하지 않은 경우 절반의 노드만 heapify하면 됨 for i in ran
Address Translation, Dynamic Relocation, Base Register, Bound Register
Subnet, Subnetting, Subnet mask, Supernetting, Network address, Broadcast Address, Broadcasting
소프트웨어 설계 및 구현 프로세스에 대한 고찰, getline, getline구현, get next line
42 Seoul, getline, getline구현, C언어, static variable, 정적 변수, read
Proportional Share Scheduling, Lottery Scheduling, Stride Scheduling, Linux CFS
Operation System, MLFQ, Multi Level Feedback Queue, OS Scheduling, OS Scheduler
OS Mechanism, LDE (limited direct execution) protocol, context switch, trap, system call