개발자

개발자 인터뷰에 필요한 컴퓨터 지식

지구빵집 2016. 4. 19. 23:42
반응형




Most interviewers won't ask about specific algorithms for binary tree balancing or other

complex algorithms. Frankly, being several years out of school, they probably don't

remember these algorithms either.


You're usually only expected to know the basics. Here's a list of the absolute, must-have

knowledge:



Data Structure


Linked Lists,

Binary Trees,

Tries,

Stacks,

Queues,

Vectors / ArrayLists,

Hash Tables,


Algorithms


Breadth First Search,

Depth First Search,

Binary Search,

Merge Sort,

Quicksort,

Tree Insert/ Find /e.t.c,


Concepts


Bit Manipulation,

Singleton Design Pattern,

Factory Design Pattern,

Memory (Stack vs. Heap),

Recursion,

Big-OTime









반응형