가장 많이 묻는 면접 질문과 답변 & 온라인 테스트
면접 준비, 온라인 테스트, 튜토리얼, 라이브 연습을 위한 학습 플랫폼

집중 학습 경로, 모의고사, 면접 준비 콘텐츠로 실력을 키우세요.

WithoutBook은 주제별 면접 질문, 온라인 연습 테스트, 튜토리얼, 비교 가이드를 하나의 반응형 학습 공간으로 제공합니다.

Prepare Interview

Computer Science 면접 질문과 답변

Test your skills through the online practice test: Computer Science Quiz Online Practice Test

Ques 41. What is the purpose of the 'Observer' design pattern?

The Observer design pattern defines a one-to-many dependency between objects, so that when one object changes state, all its dependents are notified and updated automatically.

Example:

Implementing event handling in graphical user interfaces.

도움이 되었나요? Add Comment View Comments
 

Ques 42. Explain the concept of the CAP theorem in distributed systems.

The CAP theorem states that in a distributed system, it is impossible to simultaneously provide all three guarantees: Consistency, Availability, and Partition tolerance.

Example:

Choosing between consistency and availability during network partitions in a distributed database system.

도움이 되었나요? Add Comment View Comments
 

Ques 43. What is the purpose of the 'OAuth' protocol in web development?

OAuth is an authentication and authorization protocol used for secure and delegated access, allowing a user to grant a third-party application limited access to their resources without exposing their credentials.

Example:

Allowing a mobile app to access a user's Google Drive without sharing the password.

도움이 되었나요? Add Comment View Comments
 

Ques 44. Explain the concept of the 'Decorator' design pattern.

The Decorator design pattern allows behavior to be added to an object, either statically or dynamically, without affecting the behavior of other objects from the same class.

Example:

Extending the functionality of a text editor with spell-checking or formatting capabilities.

도움이 되었나요? Add Comment View Comments
 

Ques 45. What is the purpose of the 'BFS' (Breadth-First Search) algorithm?

BFS is a graph traversal algorithm that visits all the vertices of a graph in breadth-first order, exploring all neighbors at the current depth before moving on to the next level.

Example:

Finding the shortest path in an unweighted graph or exploring the relationships in a social network.

도움이 되었나요? Add Comment View Comments
 

Most helpful rated by users:

Copyright © 2026, WithoutBook.