[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"article:fe":3},{"meta":4,"markdown":79,"quiz":80},{"type":5,"articleId":6,"slug":7,"title":8,"titleEn":9,"category":10,"summary":11,"publishedAt":12,"image":13,"vocabulary":14,"quizId":78},"article","exam-fe","fe","基本情報技術者試験 — シラバス全体像","FE Exam — Full Syllabus Overview","exams","Full overview of the Fundamental Information Technology Engineer Exam (FE \u002F 基本情報技術者試験) — including the post-2023 CBT format, the split between 科目A (60 multiple-choice questions in 90 minutes) and 科目B (20 questions in 100 minutes focused on algorithms\u002Fpseudocode and information security), recent pass rates, and a study plan for engineers.\n","2026-04-27T00:00:00Z","https:\u002F\u002Fimages.yamiyomi.com\u002Fexam-fe.png",[15,20,24,29,33,38,42,46,50,54,58,62,66,70,74],{"word":16,"reading":17,"meaning":18,"level":19},"試験","しけん","exam","N3",{"word":21,"reading":22,"meaning":23,"level":19},"基本","きほん","fundamental",{"word":25,"reading":26,"meaning":27,"level":28},"技術者","ぎじゅつしゃ","engineer","N2",{"word":30,"reading":31,"meaning":32,"level":19},"科目","かもく","subject",{"word":34,"reading":35,"meaning":36,"level":37},"擬似言語","ぎじげんご","pseudo-code","N1",{"word":39,"reading":40,"meaning":41,"level":37},"配列","はいれつ","array",{"word":43,"reading":44,"meaning":45,"level":28},"関数","かんすう","function",{"word":47,"reading":48,"meaning":49,"level":28},"変数","へんすう","variable",{"word":51,"reading":52,"meaning":53,"level":37},"通年","つうねん","year-round",{"word":55,"reading":56,"meaning":57,"level":28},"合格率","ごうかくりつ","pass rate",{"word":59,"reading":60,"meaning":61,"level":28},"出題","しゅつだい","exam questions",{"word":63,"reading":64,"meaning":65,"level":28},"重点","じゅうてん","emphasis",{"word":67,"reading":68,"meaning":69,"level":37},"計算量","けいさんりょう","computational complexity",{"word":71,"reading":72,"meaning":73,"level":28},"探索","たんさく","search",{"word":75,"reading":76,"meaning":77,"level":28},"整列","せいれつ","sorting","exam-fe-quiz","\n::heading\n[基本]{きほん:fundamental:N1}[情報]{じょうほう:information:N3}[技術者]{ぎじゅつしゃ:engineer:N2}[試験]{しけん:exam:N4}とは\n\n#en\nWhat is the FE Exam?\n::\n\n::para\n[基本]{きほん:fundamental:N1}[情報]{じょうほう:information:N3}[技術者]{ぎじゅつしゃ:engineer:N2}[試験]{しけん:exam:N4}（[略称]{りゃくしょう:abbreviation:N1}「FE」）は、[経済産業省]{けいざいさんぎょうしょう:METI:N2}[認定]{にんてい:certified:N3}・IPA[実施]{じっし:administered:N1}の[国家資格]{こっかしかく:national qualification:N3}で、[情報処理]{じょうほうしょり:information processing:N3}[技術者]{ぎじゅつしゃ:engineer:N2}[試験]{しけん:exam:N4}の「レベル2」に[相当]{そうとう:corresponding:N3}する。ITエンジニアとして[働き始めた]{はたらきはじめた:started working:N3}[人]{ひと:people:N5}や[これから]{korekara:from now on}IT[業界]{ぎょうかい:industry:N4}に[就職]{しゅうしょく:get a job:N1}しようとする[学生]{がくせい:students:N5}を[主]{しゅ:main:N4}な[対象]{たいしょう:target:N2}としており、ITパスポートの[次]{つぎ:next:N3}に[挑戦]{ちょうせん:challenge:N1}する[資格]{しかく:qualification:N3}として[位置]{いち:position:N3}づけられている。\n\n#en\nThe Fundamental Information Technology Engineer Exam (FE) is a METI-certified, IPA-administered national qualification at \"Level 2\" of the Information Processing Engineer Examinations. It mainly targets people who have started working as IT engineers or students aiming to enter the IT industry, and is positioned as the next exam to challenge after the IT Passport.\n::\n\n::callout\n[試験]{しけん:exam:N4}のポイント：FEは2023[年]{ねん:year:N5}4[月]{がつ:month:N5}よりCBT[方式]{ほうしき:method:N3}に[完全]{かんぜん:fully:N3}[移行]{いこう:migrated:N2}し、[通年]{つうねん:year-round:N4}[受験]{じゅけん:taking:N3}が[可能]{かのう:possible:N3}となった。[従来]{じゅうらい:previously:N1}の[年]{ねん:year:N5}2[回]{かい:times:N3}（[春]{はる:spring:N4}・[秋]{あき:autumn:N4}）の[紙]{かみ:paper:N4}[試験]{しけん:exam:N4}とは[大]{おお:major:N5}きく[異なる]{ことなる:differs:N1}ため、[古い]{ふるい:old:N4}[受験]{じゅけん:exam-taking:N3}[情報]{じょうほう:information:N3}に[惑わされない]{まどわされない:not be misled by:N1}ように[注意]{ちゅうい:caution:N4}する。\n\n#en\nExam Tip: FE fully migrated to CBT in April 2023 and is now available year-round. This differs significantly from the previous twice-yearly (spring\u002Fautumn) paper exam, so be careful not to be misled by outdated exam information.\n::\n\n::heading\n[試験]{しけん:exam:N4}[構成]{こうせい:structure:N3}：[科目]{かもく:subject:N3}A・[科目]{かもく:subject:N3}B\n\n#en\nExam Structure: Subjects A and B\n::\n\n::para\n[現行]{げんこう:current:N3}のFEは[科目]{かもく:subject:N3}Aと[科目]{かもく:subject:N3}Bの2[部]{ぶ:parts:N3}[構成]{こうせい:structure:N3}である。[科目]{かもく:subject:N3}Aは[四肢]{しし:four-choice:N1}[択一式]{たくいつしき:multiple choice:N1}で[全]{ぜん:total:N3}60[問]{もん:questions:N4}、[試験]{しけん:exam:N4}[時間]{じかん:time:N5}90[分]{ふん:minutes:N5}である。[出題範囲]{しゅつだいはんい:scope:N1}はテクノロジ[系]{けい:domain:N1}（[基礎理論]{きそりろん:fundamental theory:N1}・アルゴリズム・コンピュータ[構成要素]{こうせいようそ:components:N1}・システム[構成要素]{こうせいようそ:components:N1}・ソフトウェア・データベース・ネットワーク・[情報]{じょうほう:information:N3}セキュリティ・[技術要素]{ぎじゅつようそ:technology elements:N1}）、マネジメント[系]{けい:domain:N1}（プロジェクトマネジメント・サービスマネジメント・システム[監査]{かんさ:audit:N1}）、ストラテジ[系]{けい:domain:N1}（システム[戦略]{せんりゃく:strategy:N2}・[経営戦略]{けいえいせんりゃく:management strategy:N2}・[企業]{きぎょう:enterprise:N1}と[法務]{ほうむ:legal affairs:N3}）に[広く]{ひろく:widely:N4}[渡る]{わたる:span:N3}が、テクノロジ[系]{けい:domain:N1}が[圧倒的]{あっとうてき:overwhelmingly:N2}に[比重]{ひじゅう:weight:N2}を[占める]{しめる:occupies:N2}。\n\n#en\nThe current FE consists of two parts, Subject A and Subject B. Subject A is four-choice multiple choice with 60 questions in 90 minutes. The scope spans broadly across the Technology domain (fundamental theory, algorithms, computer components, system components, software, database, network, information security, technology elements), Management domain (project management, service management, system audit), and Strategy domain (system strategy, management strategy, enterprise and legal affairs), but the Technology domain occupies overwhelming weight.\n::\n\n::para\n[科目]{かもく:subject:N3}Bは[全]{ぜん:total:N3}20[問]{もん:questions:N4}、[試験]{しけん:exam:N4}[時間]{じかん:time:N5}100[分]{ふん:minutes:N5}で、「アルゴリズムとプログラミング」が[約]{やく:approximately:N3}16[問]{もん:questions:N4}、「[情報]{じょうほう:information:N3}セキュリティ」が[約]{やく:approximately:N3}4[問]{もん:questions:N4}という[配分]{はいぶん:distribution:N3}である。アルゴリズム[問題]{もんだい:problems:N4}はIPAが[独自]{どくじ:original:N1}に[定めた]{さだめた:defined:N3}「[擬似言語]{ぎじげんご:pseudo-code:N1}」で[記述]{きじゅつ:described:N2}されており、[特定]{とくてい:specific:N3}のプログラミング[言語]{げんご:language:N4}（C・Java・Pythonなど）の[知識]{ちしき:knowledge:N3}は[不要]{ふよう:unnecessary:N3}だが、[制御]{せいぎょ:control:N3}[構造]{こうぞう:structure:N2}（[条件]{じょうけん:conditional:N1}[分岐]{ぶんき:branching:N1}・[繰り返し]{くりかえし:looping:N1}）、[配列]{はいれつ:array:N3}、[関数]{かんすう:function:N3}、[再帰]{さいき:recursion:N2}、[計算量]{けいさんりょう:computational complexity:N2}（O[記法]{きほう:notation:N3}）の[理解]{りかい:understanding:N3}が[必須]{ひっす:essential:N1}である。\n\n#en\nSubject B has 20 questions in 100 minutes, distributed as roughly 16 questions on \"Algorithms and Programming\" and 4 questions on \"Information Security.\" Algorithm questions are written in IPA's original \"pseudo-code,\" so knowledge of any specific programming language (C, Java, Python, etc.) is not required, but understanding of control structures (conditional branching, looping), arrays, functions, recursion, and computational complexity (Big-O notation) is essential.\n::\n\n::callout\n[擬似言語]{ぎじげんご:pseudo-code:N1}[仕様]{しよう:specification:N3}はIPA[公式]{こうしき:official:N3}サイトで[公開]{こうかい:published:N4}されている[資料]{しりょう:document:N3}を[必ず]{かならず:must:N3}[一読]{いちどく:read through:N5}すること。[配列]{はいれつ:array:N3}の[添字]{そえじ:index:N1}（1[始まり]{はじまり:starts from:N4}）、[条件]{じょうけん:conditional:N1}[式]{しき:expression:N3}、[関数]{かんすう:function:N3}[呼び出し]{よびだし:call:N3}、[手続]{てつづき:procedure:N3}と[関数]{かんすう:function:N3}の[違い]{ちがい:difference:N3}など、[一般的]{いっぱんてき:general:N2}な[言語]{げんご:language:N4}と[微妙]{びみょう:subtly:N1}に[異なる]{ことなる:differs:N1}[点]{てん:points:N3}が[多い]{おおい:many:N4}。\n\n#en\nCarefully read through the pseudo-code specification document published on IPA's official site. Many points subtly differ from common languages, including array indexing (starts from 1), conditional expressions, function calls, and the distinction between procedures and functions.\n::\n\n::heading\n[合格基準]{ごうかくきじゅん:passing criteria:N1}と[合格率]{ごうかくりつ:pass rate:N1}\n\n#en\nPassing Criteria and Pass Rate\n::\n\n::para\n[合格基準]{ごうかくきじゅん:passing criteria:N1}は[科目]{かもく:subject:N3}A・[科目]{かもく:subject:N3}Bそれぞれで600[点]{てん:points:N3}\u002F1000[点]{てん:points:N3}[以上]{いじょう::N4}が[必要]{ひつよう:required:N3}である。どちらか[一方]{いっぽう:one side:N4}でも600[点]{てん:points:N3}を[下回る]{したまわる:fall below:N3}と[不合格]{ふごうかく:fail:N3}となる。[受験料]{じゅけんりょう:exam fee:N3}は[税込]{ぜいこみ:tax included:N2}7,500[円]{えん:yen:N5}（2024[年]{ねん:year:N5}[改定]{かいてい:revised:N2}[後]{ご:after:N5}）。CBT[移行]{いこう:migration:N2}[後]{ご:after:N5}の[合格率]{ごうかくりつ:pass rate:N1}は[公表]{こうひょう:public:N3}データによれば[科目]{かもく:subject:N3}A・[科目]{かもく:subject:N3}B[両方]{りょうほう:both:N3}を[受験]{じゅけん:taking:N3}した[受験者]{じゅけんしゃ:examinees:N3}で[約]{やく:approximately:N3}40〜50%と、[従来]{じゅうらい:previous:N1}の[紙]{かみ:paper:N4}[試験]{しけん:exam:N4}（25%[前後]{ぜんご:around:N5}）より[大幅]{おおはば:significantly:N2}に[向上]{こうじょう:improved:N3}している。\n\n#en\nThe passing criteria require 600\u002F1000 or higher on each of Subject A and Subject B. Falling below 600 on either one results in failure. The fee is 7,500 yen including tax (after the 2024 revision). According to published data, the post-CBT-migration pass rate for examinees who took both Subject A and Subject B is about 40–50%, significantly higher than the previous paper exam (around 25%).\n::\n\n::heading\n[出題分野]{しゅつだいぶんや:exam domains:N4}の[重点]{じゅうてん:focus areas:N3}\n\n#en\nFocus Areas Within the Exam Domains\n::\n\n::para\n[科目]{かもく:subject:N3}Aで[特に]{とくに:particularly:N4}[頻出]{ひんしゅつ:frequent:N1}な[分野]{ぶんや:domains:N4}は[次]{つぎ:next:N3}の[通り]{とおり:as follows:N4}である。[基礎理論]{きそりろん:fundamental theory:N1}（2[進数]{しんすう:base:N3}・[論理演算]{ろんりえんざん:logical operations:N2}・[情報量]{じょうほうりょう:information amount:N2}・[誤差]{ごさ:errors:N3}）、コンピュータ[構成要素]{こうせいようそ:components:N1}（CPUのパイプライン・キャッシュ[記憶]{きおく:memory:N1}・[割込み]{わりこみ:interrupts:N3}）、[データベース]{でーたべーす:database}（[正規化]{せいきか:normalization:N3}・SQL・[排他]{はいた:exclusive:N1}[制御]{せいぎょ:control:N3}・トランザクション[管理]{かんり:management:N2}）、[ネットワーク]{ねっとわーく:network}（OSI[参照]{さんしょう:reference:N2}モデル・TCP\u002FIP・サブネット[マスク]{ますく:mask}・[経路]{けいろ:routing:N3}[制御]{せいぎょ:control:N3}）、[情報]{じょうほう:information:N3}セキュリティ（[暗号]{あんごう:cryptography:N3}[方式]{ほうしき:method:N3}・[認証]{にんしょう:authentication:N1}・PKI・[攻撃]{こうげき:attack:N1}[手法]{しゅほう:method:N3}）である。\n\n#en\nParticularly frequent domains in Subject A are as follows. Fundamental Theory (binary, logical operations, information amount, errors), Computer Components (CPU pipelining, cache memory, interrupts), Database (normalization, SQL, exclusive control, transaction management), Network (OSI reference model, TCP\u002FIP, subnet mask, routing control), and Information Security (cryptography, authentication, PKI, attack methods).\n::\n\n::para\n[科目]{かもく:subject:N3}Bのアルゴリズム[問題]{もんだい:problems:N4}では、[基本]{きほん:basic:N1}データ[構造]{こうぞう:structure:N2}（[配列]{はいれつ:array:N3}・[連結]{れんけつ:linked:N1}リスト・スタック・キュー・[木]{き:tree:N5}）と[整列]{せいれつ:sorting:N1}・[探索]{たんさく:search:N1}アルゴリズム（バブルソート・[挿入]{そうにゅう:insertion:N1}ソート・クイックソート・マージソート・[線形]{せんけい:linear:N2}[探索]{たんさく:search:N1}・2[分]{ぶん:binary:N5}[探索]{たんさく:search:N1}）の[計算量]{けいさんりょう:computational complexity:N2}と[動作]{どうさ:behavior:N4}を[正確]{せいかく:accurately:N3}に[追跡]{ついせき:trace:N2}できることが[要求]{ようきゅう:required:N3}される。[再帰]{さいき:recursion:N2}（フィボナッチ・[階乗]{かいじょう:factorial:N2}）と[計算量]{けいさんりょう:complexity:N2}の[評価]{ひょうか:evaluation:N1}（O(n)・O(n log n)・O(n²)）も[頻出]{ひんしゅつ:frequent:N1}である。\n\n#en\nSubject B algorithm questions require accurately tracing the behavior and computational complexity of basic data structures (array, linked list, stack, queue, tree) and sorting\u002Fsearch algorithms (bubble sort, insertion sort, quicksort, merge sort, linear search, binary search). Recursion (Fibonacci, factorial) and complexity evaluation (O(n), O(n log n), O(n²)) are also frequent.\n::\n\n::heading\n[学習]{がくしゅう:study:N4}プランと[推奨]{すいしょう:recommended:N1}リソース\n\n#en\nStudy Plan and Recommended Resources\n::\n\n::para\n[標準的]{ひょうじゅんてき:standard:N1}な[学習]{がくしゅう:study:N4}[期間]{きかん:duration:N3}は[初心者]{しょしんしゃ:beginner:N3}で[約]{やく:approximately:N3}3〜6か[月]{げつ:months:N5}、ITパスポート[合格者]{ごうかくしゃ:pass-holder:N3}や[業務]{ぎょうむ:work:N3}[経験]{けいけん:experience:N3}が[ある]{ある:have}[人]{ひと:people:N5}で1〜3か[月]{げつ:months:N5}が[目安]{めやす:target:N4}である。[第]{だい:number:N1}1ステップとして[市販]{しはん:commercial:N2}テキスト（「キタミ[式]{しき:style:N3}イラストIT[塾]{じゅく:tutoring:N1} [基本]{きほん:fundamental:N1}[情報]{じょうほう:information:N3}[技術者]{ぎじゅつしゃ:engineer:N2}」など）で[全範囲]{ぜんはんい:full scope:N1}を[一周]{ひとまわり:one round:N2}し、[第]{だい:number:N1}2ステップで[科目]{かもく:subject:N3}Aの[過去問]{かこもん:past questions:N3}を[徹底]{てってい:thoroughly:N1}[演習]{えんしゅう:practice:N3}する。[最後]{さいご:last:N3}に[科目]{かもく:subject:N3}B[専用]{せんよう:dedicated:N2}の[問題集]{もんだいしゅう:problem book:N4}でアルゴリズム[トレース]{とれーす:tracing}と[情報]{じょうほう:information:N3}セキュリティの[読解]{どっかい:reading comprehension:N3}を[強化]{きょうか:strengthen:N3}する。\n\n#en\nStandard study duration is about 3–6 months for beginners and 1–3 months for those who have passed the IT Passport or have work experience. As Step 1, do one full pass through a commercial textbook (like \"Kitami-shiki Illustrated IT Cram School: FE\"). In Step 2, drill Subject A past questions thoroughly. Finally, use a Subject-B-dedicated problem book to strengthen algorithm tracing and information security reading comprehension.\n::\n\n::para\n[無料]{むりょう:free:N4}リソースとしては「[基本]{きほん:fundamental:N1}[情報]{じょうほう:information:N3}[技術者]{ぎじゅつしゃ:engineer:N2}[過去問]{かこもん:past questions:N3}[道場]{どうじょう:dojo:N4}」が[最大手]{さいおおて:largest:N3}で、[紙]{かみ:paper:N4}[試験]{しけん:exam:N4}[時代]{じだい:era:N4}（〜2022[年]{ねん:year:N5}）の[問題]{もんだい:problems:N4}が[全]{ぜん:all:N3}[公開]{こうかい:public:N4}されている。CBT[移行]{いこう:migration:N2}[後]{ご:after:N5}は[公開]{こうかい:public:N4}[問題]{もんだい:problems:N4}が[減った]{へった:decreased:N2}が、IPAが[年]{ねん:year:N5}に[数回]{すうかい:several times:N3}サンプル[問題]{もんだい:problems:N4}を[公表]{こうひょう:publish:N3}している。[科目]{かもく:subject:N3}Bは[紙]{かみ:paper:N4}[時代]{じだい:era:N4}の[午後]{ごご:afternoon:N5}[試験]{しけん:exam:N4}（[長文]{ちょうぶん:long-form:N4}アルゴリズム）と[出題]{しゅつだい:question:N4}[形式]{けいしき:format:N3}が[異なる]{ことなる:differs:N1}ため、[必ず]{かならず:must:N3}[最新]{さいしん:latest:N3}のサンプル[問題]{もんだい:problems:N4}と[市販]{しはん:commercial:N2}の[科目]{かもく:subject:N3}B[対策]{たいさく:preparation:N1}[本]{ほん:book:N5}で[練習]{れんしゅう:practice:N2}すること。\n\n#en\nThe largest free resource is the \"FE Past Question Dojo,\" which has all questions from the paper-exam era (until 2022) publicly available. After the CBT migration, public questions have decreased, but IPA publishes sample questions several times a year. Because Subject B's question format differs from the paper-era afternoon exam (long-form algorithms), be sure to practice with the latest sample questions and commercial Subject-B preparation books.\n::\n\n::callout\n[学習]{がくしゅう:study:N4}のコツ：[科目]{かもく:subject:N3}Bのアルゴリズム[問題]{もんだい:problems:N4}は「[頭]{あたま:head:N3}の[中]{なか:in:N5}で[実行]{じっこう:execute:N3}する」ことが[難しい]{むずかしい:difficult:N3}ので、[必ず]{かならず:must:N3}[紙]{かみ:paper:N4}に[変数]{へんすう:variables:N3}と[配列]{はいれつ:array:N3}の[状態]{じょうたい:state:N1}を[書き出して]{かきだして:write out:N5}トレースする[習慣]{しゅうかん:habit:N3}をつける。CBT[本番]{ほんばん:real exam:N3}でも[白紙]{はくし:blank paper:N4}と[ペン]{ぺん:pen}が[支給]{しきゅう:provided:N3}される。\n\n#en\nStudy Tip: Subject B algorithm questions are hard to \"execute in your head,\" so build the habit of always writing variables and array states on paper to trace them. Even in the real CBT exam, blank paper and a pen are provided.\n::\n\n::heading\n[次]{つぎ:next:N3}のステップ：APと[高度]{こうど:advanced:N4}[区分]{くぶん:category:N2}\n\n#en\nNext Steps: AP and Advanced Categories\n::\n\n::para\nFE[合格]{ごうかく:pass:N3}[後]{ご:after:N5}は、レベル3の[応用]{おうよう:applied:N1}[情報]{じょうほう:information:N3}[技術者]{ぎじゅつしゃ:engineer:N2}[試験]{しけん:exam:N4}（AP）に[進む]{すすむ:proceed:N3}のが[一般的]{いっぱんてき:typical:N2}である。APは[午後]{ごご:afternoon:N5}が[記述式]{きじゅつしき:written:N2}となり、より[実務]{じつむ:practical:N3}に[近い]{ちかい:close to:N4}[応用]{おうよう:applied:N1}[力]{りょく:ability:N4}が[問われる]{とわれる:asked:N4}。さらに[上位]{じょうい:upper:N3}には[高度]{こうど:advanced:N4}[区分]{くぶん:category:N2}（レベル4）として、データベーススペシャリスト・ネットワークスペシャリスト・[情報]{じょうほう:information:N3}[処理]{しょり:processing:N3}[安全]{あんぜん:safety:N3}[確保]{かくほ:assurance:N1}[支援士]{しえんし:support specialist:N1}（[登録]{とうろく:registered:N2}セキスペ）など[専門]{せんもん:specialized:N2}[分野]{ぶんや:fields:N4}の[資格]{しかく:qualifications:N3}がある。\n\n#en\nAfter passing FE, the typical path is to proceed to the Level 3 Applied Information Technology Engineer Exam (AP). The AP afternoon section becomes written, asking for applied skills closer to practice. Above it are Level 4 advanced categories with specialized field qualifications such as Database Specialist, Network Specialist, and Registered Information Security Specialist.\n::\n",{"id":78,"title":81,"titleEn":82,"topicPath":10,"questions":83},"基本情報技術者試験 — サンプル問題","FE Exam — Sample Questions",[84,108,126,146,169,192],{"id":85,"articleId":6,"question":86,"options":89,"correctLabel":94,"explanation":102,"tags":105},"exam-fe-quiz-q01",{"en":87,"jp":88},"What is the worst-case time complexity of binary search on an array of n elements?","[要素数]{ようそすう:number of elements}nの[配列]{はいれつ:array}に[対する]{たいする:for}2[分]{ぶん:binary}[探索]{たんさく:search}の[最悪]{さいあく:worst-case}[計算量]{けいさんりょう:complexity}はどれか。",[90,93,96,99],{"label":91,"jp":92,"en":92},"ア","O(1)",{"label":94,"jp":95,"en":95},"イ","O(log n)",{"label":97,"jp":98,"en":98},"ウ","O(n)",{"label":100,"jp":101,"en":101},"エ","O(n²)",{"en":103,"jp":104},"Binary search compares with the middle element of a sorted array and halves the search range. In the worst case, it completes in log₂n comparisons, giving O(log n).","2[分]{ぶん:binary}[探索]{たんさく:search}は[整列]{せいれつ:sorted}[済み]{ずみ:done}[配列]{はいれつ:array}の[中央]{ちゅうおう:middle}[要素]{ようそ:element}と[比較]{ひかく:compare}し、[探索]{たんさく:search}[範囲]{はんい:range}を[半分]{はんぶん:half}にしていく。よって[最悪]{さいあく:worst-case}でもlog₂n[回]{かい:times}の[比較]{ひかく:comparison}で[完了]{かんりょう:complete}し、O(log n)である。",[106,107],"科目B","アルゴリズム",{"id":109,"articleId":6,"question":110,"options":113,"correctLabel":94,"explanation":122,"tags":125},"exam-fe-quiz-q02",{"en":111,"jp":112},"When the following pseudo-code is executed, what is the final value of variable sum?\n```\nsum ← 0\nfor (i: 1 to 5)\n    sum ← sum + i\nendfor\n```","[次]{つぎ:next}の[擬似言語]{ぎじげんご:pseudo-code}を[実行]{じっこう:execute}したとき、[変数]{へんすう:variable}sumの[最終]{さいしゅう:final}[値]{あたい:value}はいくつか。\n```\nsum ← 0\nfor (i: 1 から 5 まで)\n    sum ← sum + i\nendfor\n```",[114,116,118,120],{"label":91,"jp":115,"en":115},"10",{"label":94,"jp":117,"en":117},"15",{"label":97,"jp":119,"en":119},"20",{"label":100,"jp":121,"en":121},"25",{"en":123,"jp":124},"1+2+3+4+5 = 15. The loop sums values 1 through 5.","1+2+3+4+5 = 15。[ループ]{るーぷ:loop}が1から5まで[加算]{かさん:add}される。",[106,34],{"id":127,"articleId":6,"question":128,"options":131,"correctLabel":91,"explanation":140,"tags":143},"exam-fe-quiz-q03",{"en":129,"jp":130},"In TCP\u002FIP networks, which protocol is used to resolve the correspondence between IP addresses and MAC addresses?","TCP\u002FIPネットワークにおいて、IPアドレスとMACアドレスの[対応]{たいおう:correspondence}を[解決]{かいけつ:resolve}するために[使われる]{つかわれる:used}プロトコルはどれか。",[132,134,136,138],{"label":91,"jp":133,"en":133},"ARP",{"label":94,"jp":135,"en":135},"DNS",{"label":97,"jp":137,"en":137},"DHCP",{"label":100,"jp":139,"en":139},"ICMP",{"en":141,"jp":142},"ARP (Address Resolution Protocol) resolves a MAC address from an IP address. DNS handles hostname-to-IP mapping, DHCP automatically assigns IP addresses, and ICMP is used for reachability checks (e.g., ping).","ARP（Address Resolution Protocol）はIPアドレスからMACアドレスを[解決]{かいけつ:resolve}する。DNSは[ホスト]{ほすと:host}[名]{めい:name}とIPの[対応]{たいおう:correspondence}、DHCPはIPアドレスの[自動]{じどう:automatic}[割当]{わりあて:assignment}、ICMPは[到達性]{とうたつせい:reachability}[確認]{かくにん:check}（pingなど）に[用いる]{もちいる:used for}。",[144,145],"科目A","ネットワーク",{"id":147,"articleId":6,"question":148,"options":151,"correctLabel":97,"explanation":164,"tags":167},"exam-fe-quiz-q04",{"en":149,"jp":150},"Which of the following is the appropriate condition that the third normal form must satisfy?","[正規化]{せいきか:normalization}の[第]{だい:number}3[正規形]{せいきけい:normal form}が[満たす]{みたす:satisfies}べき[条件]{じょうけん:condition}として[適切]{てきせつ:appropriate}なものはどれか。",[152,155,158,161],{"label":91,"jp":153,"en":154},"[繰り返し]{くりかえし:repeating}[項目]{こうもく:items}を[排除]{はいじょ:eliminate}している","Eliminates repeating items",{"label":94,"jp":156,"en":157},"[部分]{ぶぶん:partial}[関数]{かんすう:functional}[従属]{じゅうぞく:dependency}を[排除]{はいじょ:eliminate}している","Eliminates partial functional dependencies",{"label":97,"jp":159,"en":160},"[推移的]{すいいてき:transitive}[関数]{かんすう:functional}[従属]{じゅうぞく:dependency}を[排除]{はいじょ:eliminate}している","Eliminates transitive functional dependencies",{"label":100,"jp":162,"en":163},"[多値]{たち:multi-valued}[従属]{じゅうぞく:dependency}を[排除]{はいじょ:eliminate}している","Eliminates multi-valued dependencies",{"en":165,"jp":166},"1NF eliminates repeating items, 2NF eliminates partial functional dependencies, and 3NF eliminates transitive functional dependencies. Option D relates to BCNF or 4NF.","[第]{だい:number}1[正規形]{せいきけい:normal form}は[繰り返し]{くりかえし:repeating}[項目]{こうもく:items}の[排除]{はいじょ:elimination}、[第]{だい:number}2は[部分]{ぶぶん:partial}[関数]{かんすう:functional}[従属]{じゅうぞく:dependency}の[排除]{はいじょ:elimination}、[第]{だい:number}3は[推移的]{すいいてき:transitive}[関数]{かんすう:functional}[従属]{じゅうぞく:dependency}の[排除]{はいじょ:elimination}である。エはBCNFや[第]{だい:number}4[正規形]{せいきけい:normal form}に[関連]{かんれん:related}する。",[144,168],"データベース",{"id":170,"articleId":6,"question":171,"options":174,"correctLabel":94,"explanation":187,"tags":190},"exam-fe-quiz-q05",{"en":172,"jp":173},"Which is the most effective countermeasure against SQL injection?","SQLインジェクションの[対策]{たいさく:countermeasure}として[最]{もっと:most}も[有効]{ゆうこう:effective}なものはどれか。",[175,178,181,184],{"label":91,"jp":176,"en":177},"[通信]{つうしん:communication}を[暗号化]{あんごうか:encrypt}する","Encrypt the communication",{"label":94,"jp":179,"en":180},"プレースホルダ（[バインド]{ばいんど:bind}[機構]{きこう:mechanism}）を[使用]{しよう:use}する","Use placeholders (bind variable mechanism)",{"label":97,"jp":182,"en":183},"[利用者]{りようしゃ:user}に[強い]{つよい:strong}パスワードを[設定]{せってい:set}させる","Have users set strong passwords",{"label":100,"jp":185,"en":186},"[最新]{さいしん:latest}の[ウイルス]{ういるす:virus}[対策]{たいさく:protection}ソフトを[導入]{どうにゅう:install}する","Install the latest antivirus software",{"en":188,"jp":189},"Using placeholders (prepared statements) ensures input values are always treated as strings and not interpreted as SQL, fundamentally preventing SQL injection.","プレースホルダ（プリペアードステートメント）を[使う]{つかう:use}と[入力]{にゅうりょく:input}[値]{ち:value}が[必ず]{かならず:always}[文字列]{もじれつ:string}[扱い]{あつかい:treatment}になり、SQL[文]{ぶん:statement}として[解釈]{かいしゃく:interpreted}されないため、SQLインジェクションを[根本的]{こんぽんてき:fundamentally}に[防げる]{ふせげる:prevent}。",[144,191],"セキュリティ",{"id":193,"articleId":6,"question":194,"options":197,"correctLabel":97,"explanation":210,"tags":213},"exam-fe-quiz-q06",{"en":195,"jp":196},"The following pseudo-code sorts elements of array a. What sorting algorithm is this?\n```\nfor (i: 0 to n-2)\n    for (j: 0 to n-2-i)\n        if (a[j] > a[j+1])\n            swap(a[j], a[j+1])\n        endif\n    endfor\nendfor\n```","[次]{つぎ:next}の[擬似言語]{ぎじげんご:pseudo-code}は[配列]{はいれつ:array}aの[要素]{ようそ:elements}を[並べ替える]{ならべかえる:sort}。この[整列]{せいれつ:sorting}アルゴリズムは[何]{なん:what}か。\n```\nfor (i: 0 から n-2 まで)\n    for (j: 0 から n-2-i まで)\n        if (a[j] > a[j+1])\n            swap(a[j], a[j+1])\n        endif\n    endfor\nendfor\n```",[198,201,204,207],{"label":91,"jp":199,"en":200},"クイックソート","Quicksort",{"label":94,"jp":202,"en":203},"マージソート","Mergesort",{"label":97,"jp":205,"en":206},"バブルソート","Bubble sort",{"label":100,"jp":208,"en":209},"ヒープソート","Heap sort",{"en":211,"jp":212},"Repeatedly comparing and swapping adjacent elements is the bubble sort (adjacent-exchange sort). Worst-case and average complexity is O(n²).","[隣接]{りんせつ:adjacent}する2[要素]{ようそ:elements}を[比較]{ひかく:compare}・[交換]{こうかん:swap}する[操作]{そうさ:operation}を[繰り返す]{くりかえす:repeat}のはバブルソート（[隣接]{りんせつ:adjacent}[交換]{こうかん:exchange}[整列]{せいれつ:sort}）。[最悪]{さいあく:worst-case}・[平均]{へいきん:average}[計算量]{けいさんりょう:complexity}はO(n²)。",[106,107]]