2026년 3회 정보처리기사 실기 대비 LIVE 특강 (기출 용어 정리)

Summary

The video is a live exam-preparation lecture reviewing frequently tested terms and concepts for the Information Processing Engineer practical exam. With roughly two weeks remaining, the instructor recommends focusing on high-yield material, distinguishing similar terms, and continuing to practice programming problems rather than trying to learn every obscure topic.

Study guidance

• Prioritize rather than trying to cover everything. Focus on recurring terms and concepts from past exams, along with core programming, SQL, and calculation practice.
• Learn terms and their defining characteristics. Memorize each term and what distinguishes it, rather than trying to learn long textbook descriptions word for word.
• Use past exams strategically. Repeated past-exam theory can help secure marks, but past questions alone may not be enough to pass. The instructor also recommends mock exams to practice a wider range of material.
• Keep programming fundamentals in scope. Programming questions combine topics such as variables, control flow, loops, arrays, and pointers. Practice a range of problems rather than assuming one topic is unimportant.
• Avoid spending too much time on rare advanced material while neglecting fundamentals. The lecture advises against abandoning theory entirely, since difficult programming, SQL, or calculation questions may be hard to answer.

Main concepts reviewed

Software design and testing

• Module coupling describes dependencies between modules. The lecture contrasts lower coupling, such as data coupling, with stronger coupling, such as content coupling. The sequence covered is data, stamp, control, external, common, and content coupling.
• Module cohesion describes how closely the tasks within a module relate. Functional cohesion is the strongest form; coincidental cohesion, where unrelated tasks are grouped together, is the weakest. Other forms discussed include sequential, communicational, procedural, temporal, and logical cohesion.
• Black-box testing techniques include:
  • Equivalence partitioning: Divide inputs into groups expected to behave similarly and test representative values.
  • Boundary-value analysis: Test values at and around range boundaries.
  • Cause-and-effect graphing: Use relationships between inputs and outputs to design test cases.
  • Other examples include comparison testing, state-transition testing, and error-guessing.
• White-box code coverage measures how much of the code or logic is exercised by tests. The instructor distinguishes statement coverage, condition coverage, decision coverage, condition/decision coverage, modified condition/decision coverage, and multiple-condition coverage.
• Testing levels and integration approaches: Unit, integration, system, and acceptance testing are reviewed. Integration strategies include bottom-up, top-down, Big Bang, and sandwich approaches. Alpha testing involves developers and users; beta testing is conducted by users.
• Test cases should specify input values, execution conditions, and expected results. The lecture also introduces test oracles, which compare actual results with expected results, and distinguishes static analysis from dynamic analysis.
• Code reviews and refactoring: Peer reviews, walkthroughs, and inspections are compared. Refactoring changes internal code structure while preserving the program’s external behavior.

Database concepts

• Normalization reduces unnecessary duplication and helps prevent insertion, deletion, and update anomalies.
• The lecture explains functional dependencies, including complete, partial, and transitive dependencies, then reviews normal forms:
  • First normal form: Values are atomic.
  • Second normal form: Remove partial functional dependencies.
  • Third normal form: Remove transitive functional dependencies.
  • BCNF and higher forms are also mentioned.
• Denormalization intentionally permits some duplication when needed for performance or operational convenience.
• Relational terminology: A relation is a table; attributes are columns; tuples are rows; and a domain is the set of allowable values. Degree counts attributes, while cardinality counts tuples.
• Keys: A superkey uniquely identifies a tuple. Candidate keys meet uniqueness and minimality requirements. One candidate key is selected as the primary key, and the others are alternate keys. A foreign key refers to a key in another table.
• Integrity constraints: Entity integrity requires a valid primary key; referential integrity governs references between tables; and domain integrity restricts values to valid ranges. Restrict and cascade behavior are also discussed.
• Relational algebra and calculus: Relational algebra is procedural, while relational calculus is non-procedural. Operators reviewed include selection, projection, join, division, union, intersection, difference, and Cartesian product.
• Transactions: The ACID properties are reviewed—atomicity, consistency, isolation, and durability. The lecture also distinguishes commit, rollback, and a partially committed state.
• Concurrency control and recovery: Locking, two-phase locking, timestamps, and multi-version methods are introduced. Recovery topics include log-based recovery, redo and undo, checkpoints, shadow paging, and media recovery.
• Database design stages: Requirements analysis, conceptual design, logical design, physical design, and implementation. Conceptual design uses models such as ER diagrams; logical design adapts the model to a DBMS; and physical design considers implementation and performance.
• Three-schema architecture: External, conceptual, and internal schemas are distinguished, along with logical and physical data independence.

Integration, interfaces, and application architecture

• EAI integrates applications by exchanging data. The lecture names point-to-point, hub-and-spoke, message-bus, and hybrid approaches.
• JSON, XML, and YAML are reviewed as data formats. JSON uses name/value pairs, XML uses tags, and YAML is described as a data-serialization language.
• SOAP is introduced through its components: WSDL as a service description, UDDI as a registry, and SOAP as a protocol for exchanging messages.
• REST identifies resources with URIs and operates on them through HTTP methods.
• AJAX enables asynchronous data exchange without reloading or visibly navigating away from the current page.
• UI and UX: UI is the interface presented to users; UX concerns the experience of using it. The four UI principles discussed are intuitiveness, validity, learnability, and flexibility. Interface types include CLI, GUI, NUI, and OUI.

Operating systems and software engineering

• Process scheduling is divided into preemptive and non-preemptive approaches. Examples include Round Robin, Shortest Remaining Time, multilevel queues, First Come First Served, Shortest Job First, priority scheduling, and HRN. For HRN, the lecture gives the response-ratio formula as ((\text{waiting time}+\text{service time})/\text{service time}).
• Process states and context switching: Ready, running, and waiting states are reviewed, along with dispatch, blocking, wake-up, time-out, and the role of the PCB in saving process information.
• Configuration management tracks and controls changes and versions. The lecture outlines configuration identification, control, auditing, and recording, including change requests, CCB approval, and updating a baseline. CVS and SVN are described as client-server tools; Git is described as distributed.
• Object-oriented design: The SOLID principles are summarized: single responsibility, open/closed, Liskov substitution, interface segregation, and dependency inversion.
• Object-oriented analysis methods: Rumbaugh’s object, dynamic, and functional modeling are connected to object, state, and data-flow diagrams.
• Requirements are divided into functional requirements, which describe system capabilities, and non-functional requirements, such as performance and security.
• Agile emphasizes iterative development and adapting to user requirements. The spiral model’s cycle is plan, analyze risks, develop, and evaluate.

Networks and communications

• OSI’s seven layers are reviewed from application through physical. The lecture associates the application, presentation, and session layers with data; the transport layer with segments; the network layer with packets; the data-link layer with frames; and the physical layer with bits.
• Network devices include repeaters and hubs at the physical layer; switches and bridges at the data-link layer; routers at the network layer; and L4 switches for load balancing.
• IPv4 and IPv6: IPv4 is described as 32-bit and IPv6 as 128-bit. Unicast, multicast, and broadcast are contrasted with IPv6’s use of unicast, multicast, and anycast. Address translation, dual stack, and tunneling are mentioned as transition techniques.
• Routing protocols: RIP is associated with distance-vector routing and a hop-count limit; OSPF with link-state routing; and BGP with inter-domain routing. The instructor contrasts RIP’s hop-based choice with OSPF’s path-cost considerations.
• Error control: Forward error correction can detect and correct errors, with Hamming code given as an example. Backward error correction detects errors and requests retransmission through ARQ. Stop-and-wait, Go-Back-N, selective-repeat, and adaptive ARQ are compared.
• Switching: Circuit switching, message switching, and packet switching are discussed. Packet switching includes datagram and virtual-circuit approaches.
• TCP connection procedures: The lecture reviews the three-way handshake for connection setup and the four-way exchange for connection termination.
• Application protocols: Examples include HTTP/HTTPS, FTP, SMTP, POP3, IMAP, SSH, Telnet, DNS, SNMP, and DHCP. The instructor highlights their general roles and some common port numbers.
• URI structure is introduced near the end, including the scheme and authority components. The subtitles stop while this topic is still being explained.

Security

• The three information-security principles are confidentiality, integrity, and availability.
• Authentication verifies identity; authorization determines what an authenticated user may access. SSO, OTP, and triple-A—authentication, authorization, and accounting—are covered.
• Access control models include MAC (mandatory access control), DAC (discretionary access control), and RBAC (role-based access control).
• VPNs create a logical private connection over a public network. The lecture mentions L2TP, IPsec, and SSL/TLS-related use.
• Common attacks discussed include Smurf, Ping of Death, LAND, Teardrop, flooding, SQL injection, session hijacking, ARP spoofing, typosquatting, watering-hole attacks, social engineering, and APTs. Worms, viruses, and Trojan horses are distinguished.
• Other security terms include ISMS, PIMS, and ISMS-P; WAF for web-application attack defense; SIEM for aggregating and analyzing security logs; and RTO/RPO for recovery-time and data-loss targets.
• The lecture compares symmetric and asymmetric encryption and mentions algorithms and terms such as AES, DES, RSA, MD5, TKIP, and IDEA.

Storage and performance

• Storage types: DAS is directly attached; NAS connects over a network; SAN uses a high-speed storage network.
• RAID levels are outlined by their general characteristics: RAID 0 uses striping, RAID 1 uses mirroring, RAID 2 uses Hamming-code-based error correction, and RAID 3–6 use variations involving parity.
• Performance measures include throughput, response time, and turnaround time.

Speakers and sources featured

• Main speaker: The instructor, known on the channel as 흥달쌤. The subtitles do not provide a reliably transcribed personal name.
• Additional source: Live-chat viewers, whose comments and questions are occasionally read aloud. Names appearing in the auto-generated subtitles include “Dingdiri,” “Daniel Kim,” “Choi Eun-chan,” “Son Yu-seol,” “Kim Min-jae,” and “Ganadara”; these spellings may be transcription errors.