{"id":82013,"date":"2026-08-11T08:58:24","date_gmt":"2026-08-11T08:58:24","guid":{"rendered":"https:\/\/leapscholar.com\/blog\/?p=82013"},"modified":"2026-08-11T08:59:33","modified_gmt":"2026-08-11T08:59:33","slug":"dmat-computer-science-section","status":"publish","type":"post","link":"https:\/\/leapscholar.com\/blog\/dmat-computer-science-section\/","title":{"rendered":"dMAT Computer Science Section: Syllabus, Format and 12 Practice Questions (2026)"},"content":{"rendered":"<span class=\"rt-reading-time\" style=\"display: block;\"><span class=\"rt-label rt-prefix\"><\/span> <span class=\"rt-time\">5<\/span> <span class=\"rt-label rt-postfix\">min read<\/span><\/span>\n<div class=\"quick-read-box\">\n\n  <div class=\"qr-header\">\n    <span style=\"font-size:18px;\">\u26a1<\/span>\n    <h3 class=\"qr-title\">Quick Read<\/h3>\n  <\/div>\n\n  <ul>\n    <li>Computer Science is one of five disciplines in the dMAT Battery Science module, not a standalone test, tested in the Basic Task plus two Advanced Tasks<\/li>\n\n    <li>Basic Task: data types and memory. Advanced Tasks: combinational logic, and linear transformations of high-dimensional data (LDA)<\/li>\n\n    <li>Format: technical reading passage + four-option single-choice questions, 90 minutes for the whole subject test<\/li>\n\n    <li>Both advanced topics map to real battery engineering: logic gates to protective circuit decisions, LDA to catching a degrading cell early<\/li>\n\n<li>Method: read the passage as your reference sheet first, work logic questions one gate at a time, anchor precision questions to the passage&#8217;s stated ranges<\/li>\n\n<li>Attempt 12 free practice questions below using this method<\/li>\n  <\/ul>\n\n  <div class=\"qr-footer\">\n    \ud83d\udc49 Best for:CS\/IT graduates assigned the Battery Science module who want the actual topic breakdown before revising\n  <\/div>\n\n<\/div>\n\n\n\n<div style=\"margin:4px 0 28px\">\n<style>\n.dcs-jump{display:inline-flex;align-items:center;justify-content:center;gap:8px;background:linear-gradient(50.6deg,#3C3ACC 14.27%,#4A47FF 85.65%);color:#ffffff!important;font-weight:600;font-size:15px;line-height:1.3;padding:14px 24px;border-radius:12px;text-decoration:none!important;text-align:center}\n@media(max-width:640px){.dcs-jump{display:flex;width:100%}}\n<\/style>\n<a class=\"dcs-jump\" href=\"#dmat-cs-practice\">Start the 12 Practice&nbsp;Questions&nbsp;&#8595;<\/a>\n<\/div>\n\n\n\n<p>This guide sets out what the Computer Science module covers, who it rewards, and how to prepare and closes with 12 original practice questions in the same passage-plus-multiple-choice format you will see on exam day.<\/p><div id=\"ez-toc-container\" class=\"ez-toc-v2_0_68_1 ez-toc-wrap-left counter-hierarchy ez-toc-counter ez-toc-custom ez-toc-container-direction\">\n<div class=\"ez-toc-title-container\">\n<p class=\"ez-toc-title \" >Table of Content<\/p>\n<span class=\"ez-toc-title-toggle\"><a href=\"#\" class=\"ez-toc-pull-right ez-toc-btn ez-toc-btn-xs ez-toc-btn-default ez-toc-toggle\" aria-label=\"Toggle Table of Content\"><span class=\"ez-toc-js-icon-con\"><span class=\"\"><span class=\"eztoc-hide\" style=\"display:none;\">Toggle<\/span><span class=\"ez-toc-icon-toggle-span\"><svg style=\"fill: #192a3d;color:#192a3d\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" class=\"list-377408\" width=\"20px\" height=\"20px\" viewBox=\"0 0 24 24\" fill=\"none\"><path d=\"M6 6H4v2h2V6zm14 0H8v2h12V6zM4 11h2v2H4v-2zm16 0H8v2h12v-2zM4 16h2v2H4v-2zm16 0H8v2h12v-2z\" fill=\"currentColor\"><\/path><\/svg><svg style=\"fill: #192a3d;color:#192a3d\" class=\"arrow-unsorted-368013\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" width=\"10px\" height=\"10px\" viewBox=\"0 0 24 24\" version=\"1.2\" baseProfile=\"tiny\"><path d=\"M18.2 9.3l-6.2-6.3-6.2 6.3c-.2.2-.3.4-.3.7s.1.5.3.7c.2.2.4.3.7.3h11c.3 0 .5-.1.7-.3.2-.2.3-.5.3-.7s-.1-.5-.3-.7zM5.8 14.7l6.2 6.3 6.2-6.3c.2-.2.3-.5.3-.7s-.1-.5-.3-.7c-.2-.2-.4-.3-.7-.3h-11c-.3 0-.5.1-.7.3-.2.2-.3.5-.3.7s.1.5.3.7z\"\/><\/svg><\/span><\/span><\/span><\/a><\/span><\/div>\n<nav><ul class='ez-toc-list ez-toc-list-level-1 eztoc-toggle-hide-by-default' ><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-1\" href=\"https:\/\/leapscholar.com\/blog\/dmat-computer-science-section\/#What_Is_the_dMAT_Computer_Science_Section\" title=\"What Is the dMAT Computer Science Section?\">What Is the dMAT Computer Science Section?<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-2\" href=\"https:\/\/leapscholar.com\/blog\/dmat-computer-science-section\/#How_to_Solve_dMAT_Computer_Science_Questions\" title=\"How to Solve dMAT Computer Science Questions\">How to Solve dMAT Computer Science Questions<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-3\" href=\"https:\/\/leapscholar.com\/blog\/dmat-computer-science-section\/#dMAT_Computer_Science_Practice_Questions_with_Answers_Free\" title=\"dMAT Computer Science Practice Questions with Answers (Free)\">dMAT Computer Science Practice Questions with Answers (Free)<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-4\" href=\"https:\/\/leapscholar.com\/blog\/dmat-computer-science-section\/#Who_Must_Take_the_dMAT_Computer_Science_Section\" title=\"Who Must Take the dMAT Computer Science Section?\">Who Must Take the dMAT Computer Science Section?<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-5\" href=\"https:\/\/leapscholar.com\/blog\/dmat-computer-science-section\/#dMAT_Computer_Science_Syllabus_Basic_and_Advanced_Tasks\" title=\"dMAT Computer Science Syllabus: Basic and Advanced Tasks\">dMAT Computer Science Syllabus: Basic and Advanced Tasks<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-6\" href=\"https:\/\/leapscholar.com\/blog\/dmat-computer-science-section\/#dMAT_Computer_Science_Study_Plan_Before_26_September_2026\" title=\"dMAT Computer Science Study Plan Before 26 September 2026\">dMAT Computer Science Study Plan Before 26 September 2026<\/a><\/li><li class='ez-toc-page-1 ez-toc-heading-level-2'><a class=\"ez-toc-link ez-toc-heading-7\" href=\"https:\/\/leapscholar.com\/blog\/dmat-computer-science-section\/#Frequently_Asked_Questions_About_the_dMAT_Computer_Science_Section\" title=\"Frequently Asked Questions About the dMAT Computer Science Section\">Frequently Asked Questions About the dMAT Computer Science Section<\/a><\/li><\/ul><\/nav><\/div>\n\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"What_Is_the_dMAT_Computer_Science_Section\"><\/span><strong>What Is the dMAT Computer Science Section?<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>Battery management systems run on embedded software that reads cell voltage, temperature, and current in real time, then decides how to charge, discharge, and protect the pack. The three CS topics map directly onto that pipeline: sized data types for sensor readings, logic for rapid protective decisions, and data-driven methods to catch a degrading cell early.<\/p>\n\n\n\n<p><strong>Basic Task: Data Types and Memory:<\/strong><\/p>\n\n\n\n<figure class=\"wp-block-table is-style-stripes\"><table class=\"has-palette-color-5-background-color has-background\"><thead><tr><th><strong>Type<\/strong><\/th><th><strong>Width<\/strong><\/th><th><strong>Range<\/strong><\/th><\/tr><\/thead><tbody><tr><td>Boolean<\/td><td>1 bit<\/td><td>\u2014<\/td><\/tr><tr><td>Short<\/td><td>16 bits<\/td><td>\u2014<\/td><\/tr><tr><td>Int<\/td><td>32 bits<\/td><td>\u2014<\/td><\/tr><tr><td>Float<\/td><td>32 bits<\/td><td>~10\u00b3\u2078<\/td><\/tr><tr><td>Double<\/td><td>64 bits<\/td><td>~10\u00b3\u2070\u2078<\/td><\/tr><tr><td>String<\/td><td>No fixed width<\/td><td>Any length<\/td><\/tr><\/tbody><\/table><figcaption class=\"wp-element-caption\"><em>Declaring a variable with a value reserves and initializes memory in one step; declaring it alone only reserves it. The framing here is oscillation and correction; precision and representation error matter more than memorizing widths.<\/em><\/figcaption><\/figure>\n\n\n\n<p><strong>Advanced Task 1: Combinational Logic<\/strong><\/p>\n\n\n\n<p>AND, OR, NOT gates; truth tables; simplifying an expression once you can trace it through a small circuit.<\/p>\n\n\n\n<p><strong>Advanced Task 2: Linear Transformations (LDA)<\/strong><\/p>\n\n\n\n<p>Linear Discriminant Analysis finds the directions in a data set that best separate predefined classes, exactly what a cell-diagnostics pipeline needs to distinguish a healthy cell from a degrading one across several variables at once.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"How_to_Solve_dMAT_Computer_Science_Questions\"><\/span><strong>How to Solve dMAT Computer Science Questions<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p><strong>Read the passage before you look at the questions, and treat it as your reference sheet.<\/strong> Note where the type-and-width table, the gate definitions, or the description of what LDA optimizes for sits. You will not have your own notes, but the passage gives you nearly everything you need, so look up a stated value range rather than recalling one from your degree.<\/p>\n\n\n\n<p><strong>Work logic questions one gate at a time.<\/strong> A question that chains two or three gates together is not hard if you evaluate it in order: find the output of the first gate for the given inputs, then feed that output into the next. Trying to hold the whole circuit in your head at once is where marks are lost.<\/p>\n\n\n\n<p><strong>For data type and precision questions, anchor on the actual numbers.<\/strong> Compare the magnitude in the question against the ranges given in the passage rather than guessing from memory, since exact widths can vary slightly between passages.<\/p>\n\n\n\n<p><strong>For LDA questions, separate what the technique optimizes for from how it is applied.<\/strong> Many wrong options describe a real but different technique, such as general variance reduction or file compression. Reread what the passage says LDA specifically searches for before choosing it.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"dMAT_Computer_Science_Practice_Questions_with_Answers_Free\"><\/span><strong>dMAT Computer Science Practice Questions with Answers<\/strong> <strong>(Free)<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>The 12 questions below cover data types and bit widths, numeric precision and representation limits, combinational logic and truth tables, and linear discriminant analysis on high-dimensional data. They are original, built to test the same concepts as the official materials with different numbers and wording, and each one includes a full solution path. Work through them without notes and without a calculator, exactly as the real exam requires.<\/p>\n\n\n<div data-block=\"hook:82011\" class=\"alignfull\"><article id=\"post-82011\" class=\"post-82011\"><div class=\"entry-content\">\n<div class=\"dcs-wrap\" id=\"dmat-cs-practice\">\n<style>\n\n.dcs-wrap{--p:#443EFF;--p2:#4A47FF;--ink:#1C2233;--mut:#656E7F;--ln:#E2E6EA;--ln2:#C6CBD2;--lavb:#CAC9FF;--lav:#F4F3FF;--okg:#067647;--okbg:#ECFDF3;--okln:#75E0A7;--bad:#B42318;--badbg:#FEF3F2;--badln:#FDA29B;color:var(--ink);line-height:1.6;scroll-margin-top:100px}\n.dcs-wrap *{box-sizing:border-box}\n.dcs-stack{display:flex;flex-direction:column;gap:20px}\n.dcs-more{display:none;flex-direction:column;gap:20px;margin-top:20px}\n#dcs-toggle{display:none}\n#dcs-toggle:checked ~ .dcs-more{display:flex}\n#dcs-toggle:checked ~ .dcs-seemore{display:none}\n.dcs-seemore{display:flex;align-items:center;justify-content:center;border:1px solid #D8D6F2;background:#F1F0FC;color:var(--ink)!important;font-weight:600;font-size:15px;height:50px;border-radius:14px;width:100%;max-width:360px;margin:24px auto 0;cursor:pointer;transition:background .15s,border-color .15s}\n.dcs-seemore:hover{background:#E9E7FA;border-color:var(--lavb);color:var(--ink)}\n.dcs-input{background:#fff;border:1px solid var(--ln);border-left:4px solid var(--p2);border-radius:16px;box-shadow:0 4px 8px rgba(67,54,149,.08);padding:16px;display:flex;flex-direction:column;gap:10px}\n.dcs-ilabel{font-size:11px;font-weight:600;color:var(--p2);text-transform:uppercase;letter-spacing:1.25px;margin:0!important;padding:0!important}\n.dcs-itext{font-size:14.5px;color:var(--ink);margin:0!important;padding:0!important}\n\/* input tables: hardened against theme table CSS *\/\n.dcs-wrap .dcs-input table.dcs-t{width:auto!important;min-width:0!important;max-width:100%!important;table-layout:auto!important;border-collapse:collapse!important;border-spacing:0!important;border:none!important;border-radius:0!important;margin:4px 0 0!important;box-shadow:none!important;align-self:flex-start!important;display:table!important}\n.dcs-wrap .dcs-input table.dcs-t tr{background:transparent!important;border:none!important}\n.dcs-wrap .dcs-input table.dcs-t th{background:#F5F5FA!important;font-weight:600!important;text-align:left!important;padding:8px 14px!important;border:1px solid var(--ln)!important;font-size:13.5px!important;color:var(--ink)!important}\n.dcs-wrap .dcs-input table.dcs-t td{padding:8px 14px!important;border:1px solid var(--ln)!important;background:#fff!important;font-size:13.5px!important;color:var(--ink)!important;border-radius:0!important}\n.dcs-q{background:#FBFCFD;border:1px solid var(--ln);border-radius:16px;overflow:hidden;box-shadow:0 4px 8px rgba(67,54,149,.08);margin:0!important}\n.dcs-qtop{background:#fff;border-bottom:1px solid var(--ln);padding:14px;display:flex;flex-direction:column;gap:12px}\n.dcs-qlabel{font-size:11px;font-weight:600;color:var(--p2);text-transform:uppercase;letter-spacing:1.25px;display:flex;align-items:center;gap:10px;margin:0!important;padding:0!important}\n.dcs-pill{font-size:10px;font-weight:700;padding:2px 10px;border-radius:999px;letter-spacing:.5px;text-transform:uppercase}\n.dcs-pl{background:var(--okbg);color:var(--okg)}.dcs-pm{background:#FFFAEB;color:#B54708}.dcs-ph{background:var(--badbg);color:var(--bad)}\n.dcs-qtext{font-size:14.5px;color:var(--ink);margin:0!important;padding:0!important}\n.dcs-wrap .dcs-q ul.dcs-opts{list-style:none!important;margin:0!important;padding:0!important;display:flex;flex-direction:column;gap:8px}\n.dcs-wrap .dcs-q ul.dcs-opts li{list-style:none!important;list-style-type:none!important;margin:0!important;border:1px solid var(--ln);background:#fff;border-radius:12px;padding:12px 14px;font-size:14px;display:flex;gap:10px;align-items:flex-start;cursor:pointer;transition:border-color .12s,background .12s}\n.dcs-wrap .dcs-q ul.dcs-opts li b{color:var(--p2)}\n.dcs-wrap .dcs-q ul.dcs-opts li:hover{border-color:var(--p2);background:var(--lav)}\n.dcs-wrap .dcs-q ul.dcs-opts li.dcs-right{background:var(--okbg)!important;border-color:var(--okln)!important}\n.dcs-wrap .dcs-q ul.dcs-opts li.dcs-wrong{background:var(--badbg)!important;border-color:var(--badln)!important}\n.dcs-opts li .dcs-mk{margin-left:auto;font-weight:700;font-size:12.5px;white-space:nowrap}\n.dcs-opts li.dcs-right .dcs-mk{color:var(--okg)}.dcs-opts li.dcs-wrong .dcs-mk{color:var(--bad)}\n.dcs-wrap .dcs-q ul.dcs-opts.dcs-done li{cursor:default}\n.dcs-wrap .dcs-q ul.dcs-opts.dcs-done li:hover{border-color:var(--ln);background:#fff}\n.dcs-wrap .dcs-q ul.dcs-opts.dcs-done li.dcs-right:hover{border-color:var(--okln);background:var(--okbg)}\n.dcs-wrap .dcs-q ul.dcs-opts.dcs-done li.dcs-wrong:hover{border-color:var(--badln);background:var(--badbg)}\n.dcs-fb{display:none;font-weight:600;font-size:13.5px;padding:10px 14px;border-radius:12px}\n.dcs-fb.dcs-g{display:block;background:var(--okbg);color:var(--okg)}\n.dcs-fb.dcs-b{display:block;background:var(--badbg);color:var(--bad)}\n.dcs-sol summary{list-style:none;display:flex;justify-content:space-between;align-items:center;gap:12px;cursor:pointer;padding:14px}\n.dcs-sol summary::-webkit-details-marker{display:none}\n.dcs-st{display:flex;align-items:center;gap:8px;font-weight:600;font-size:14px;color:var(--ink)}\n.dcs-spark{color:var(--p);font-size:16px;line-height:1}\n.dcs-chev{color:#A5A4B6;transition:transform .3s;font-size:12px}\n.dcs-sol[open] .dcs-chev{transform:rotate(180deg)}\n.dcs-sh{display:none}\n.dcs-sol[open] .dcs-sv{display:none}\n.dcs-sol[open] .dcs-sh{display:inline}\n.dcs-solb{padding:0 14px 14px;font-size:14px;color:var(--ink)}\n.dcs-solb strong{color:var(--okg)}\n@media(max-width:640px){\n.dcs-qtop{padding:12px}\n.dcs-input{padding:13px}\n.dcs-wrap .dcs-input table.dcs-t th,.dcs-wrap .dcs-input table.dcs-t td{padding:7px 10px!important;font-size:12.5px!important}\n.dcs-wrap .dcs-q ul.dcs-opts li{padding:13px 12px;font-size:13.5px}\n}\n\n<\/style>\n<div class=\"dcs-stack\">\n<div class=\"dcs-input\"><p class=\"dcs-ilabel\">&#128196; Input 1 &middot; Data Types, Bit Widths and Value Ranges<\/p><p class=\"dcs-itext\">A variable is a named location in memory. In a typed language, declaring a variable fixes how much memory is reserved for it and what range of values it can hold. Declaring a variable with a value both reserves the memory and initialises it in one step; declaring without a value only reserves the memory. The table below lists representative widths. <strong>Questions 1 to 3 refer to this input.<\/strong><\/p><table class=\"dcs-t\"><tr><th>Type<\/th><th>Width<\/th><th>Approximate range<\/th><\/tr><tr><td>boolean<\/td><td>1 bit<\/td><td>true or false<\/td><\/tr><tr><td>short<\/td><td>16 bit<\/td><td>integers<\/td><\/tr><tr><td>int<\/td><td>32 bit<\/td><td>integers<\/td><\/tr><tr><td>float<\/td><td>32 bit<\/td><td>up to roughly 10<sup>38<\/sup><\/td><\/tr><tr><td>double<\/td><td>64 bit<\/td><td>up to roughly 10<sup>308<\/sup><\/td><\/tr><tr><td>string<\/td><td>variable<\/td><td>depends on character count<\/td><\/tr><\/table><\/div>\n<div class=\"dcs-q\">\n<div class=\"dcs-qtop\">\n<p class=\"dcs-qlabel\">Question 1 <span class=\"dcs-pill dcs-pl\">Easy<\/span><\/p>\n<p class=\"dcs-qtext\">A programmer declares a variable as boolean without assigning it a value. What has happened to memory at that point?<\/p>\n<ul class=\"dcs-opts\" data-a=\"0\"><li role=\"button\" tabindex=\"0\"><b>a)<\/b> A single bit has been reserved but not yet given a value<\/li><li role=\"button\" tabindex=\"0\"><b>b)<\/b> 32 bits have been reserved and initialised to false<\/li><li role=\"button\" tabindex=\"0\"><b>c)<\/b> No memory is reserved until a value is assigned<\/li><li role=\"button\" tabindex=\"0\"><b>d)<\/b> 16 bits have been reserved, since all variables default to short width<\/li><\/ul>\n<div class=\"dcs-fb\" aria-live=\"polite\"><\/div>\n<\/div>\n<details class=\"dcs-sol\">\n<summary><span class=\"dcs-st\"><span class=\"dcs-spark\">&#10022;<\/span><span><span class=\"dcs-sv\">View Solution Path<\/span><span class=\"dcs-sh\">Hide Solution Path<\/span><\/span><\/span><span class=\"dcs-chev\">&#9660;<\/span><\/summary>\n<div class=\"dcs-solb\"><p><strong>Answer: a.<\/strong> Declaring a variable reserves the memory its type needs, here a single bit for a boolean. Only declaring it together with a value also initialises that memory. Since no value was given, the bit is reserved but not yet set.<\/p><\/div>\n<\/details>\n<\/div>\n<div class=\"dcs-q\">\n<div class=\"dcs-qtop\">\n<p class=\"dcs-qlabel\">Question 2 <span class=\"dcs-pill dcs-pm\">Medium<\/span><\/p>\n<p class=\"dcs-qtext\">Which pair of variables together uses the same total memory as a single double?<\/p>\n<ul class=\"dcs-opts\" data-a=\"1\"><li role=\"button\" tabindex=\"0\"><b>a)<\/b> Two short variables<\/li><li role=\"button\" tabindex=\"0\"><b>b)<\/b> One int and one float<\/li><li role=\"button\" tabindex=\"0\"><b>c)<\/b> One boolean and one int<\/li><li role=\"button\" tabindex=\"0\"><b>d)<\/b> One short and one int<\/li><\/ul>\n<div class=\"dcs-fb\" aria-live=\"polite\"><\/div>\n<\/div>\n<details class=\"dcs-sol\">\n<summary><span class=\"dcs-st\"><span class=\"dcs-spark\">&#10022;<\/span><span><span class=\"dcs-sv\">View Solution Path<\/span><span class=\"dcs-sh\">Hide Solution Path<\/span><\/span><\/span><span class=\"dcs-chev\">&#9660;<\/span><\/summary>\n<div class=\"dcs-solb\"><p><strong>Answer: b.<\/strong> A double is 64 bits. An int (32 bits) plus a float (32 bits) also totals 64 bits. Two shorts total 32 bits, a boolean plus an int totals 33 bits, and a short plus an int totals 48 bits, so none of the others match.<\/p><\/div>\n<\/details>\n<\/div>\n<div class=\"dcs-q\">\n<div class=\"dcs-qtop\">\n<p class=\"dcs-qlabel\">Question 3 <span class=\"dcs-pill dcs-ph\">Hard<\/span><\/p>\n<p class=\"dcs-qtext\">A developer needs to store a numeric value of approximately 10<sup>50<\/sup> for use in arithmetic. Which type from the table is the smallest one able to hold it, and why?<\/p>\n<ul class=\"dcs-opts\" data-a=\"2\"><li role=\"button\" tabindex=\"0\"><b>a)<\/b> int, because 32-bit integer types represent unlimited magnitude through overflow wrapping<\/li><li role=\"button\" tabindex=\"0\"><b>b)<\/b> float, because it reaches roughly 10<sup>38<\/sup>, which is close enough to 10<sup>50<\/sup><\/li><li role=\"button\" tabindex=\"0\"><b>c)<\/b> double, because float tops out near 10<sup>38<\/sup> while double reaches roughly 10<sup>308<\/sup><\/li><li role=\"button\" tabindex=\"0\"><b>d)<\/b> short, because 16-bit types automatically extend their range for large exponents<\/li><\/ul>\n<div class=\"dcs-fb\" aria-live=\"polite\"><\/div>\n<\/div>\n<details class=\"dcs-sol\">\n<summary><span class=\"dcs-st\"><span class=\"dcs-spark\">&#10022;<\/span><span><span class=\"dcs-sv\">View Solution Path<\/span><span class=\"dcs-sh\">Hide Solution Path<\/span><\/span><\/span><span class=\"dcs-chev\">&#9660;<\/span><\/summary>\n<div class=\"dcs-solb\"><p><strong>Answer: c.<\/strong> A value of 10<sup>50<\/sup> is well beyond the roughly 10<sup>38<\/sup> reach of a float, so a float cannot hold it. A double, reaching roughly 10<sup>308<\/sup>, is the smallest listed type that comfortably covers it. Overflow wrapping does not extend range, it corrupts the value, so option a is wrong for the opposite reason it claims to be right.<\/p><\/div>\n<\/details>\n<\/div>\n<div class=\"dcs-input\"><p class=\"dcs-ilabel\">&#128196; Input 2 &middot; Numeric Precision and Representation Limits<\/p><p class=\"dcs-itext\">Floating-point types trade an enormous representable range for limited precision: only a fixed number of significant digits is stored, so a value near the edge of that range is rounded to the nearest representable value. Repeated arithmetic on such approximations accumulates a representation error. Moving from float to double extends both the representable range and the number of significant digits carried, which reduces this error without removing it entirely. <strong>Questions 4 to 6 refer to this input.<\/strong><\/p><\/div>\n<div class=\"dcs-q\">\n<div class=\"dcs-qtop\">\n<p class=\"dcs-qlabel\">Question 4 <span class=\"dcs-pill dcs-pl\">Easy<\/span><\/p>\n<p class=\"dcs-qtext\">What is the main trade-off a programmer accepts when choosing a float over a double to save memory?<\/p>\n<ul class=\"dcs-opts\" data-a=\"3\"><li role=\"button\" tabindex=\"0\"><b>a)<\/b> Faster processing, since float arithmetic is always executed in hardware and double never is<\/li><li role=\"button\" tabindex=\"0\"><b>b)<\/b> More memory left over for other variables, with no change in precision<\/li><li role=\"button\" tabindex=\"0\"><b>c)<\/b> A guaranteed error for any value that includes a decimal point<\/li><li role=\"button\" tabindex=\"0\"><b>d)<\/b> Reduced precision, since fewer significant digits are carried at the same or a lower range<\/li><\/ul>\n<div class=\"dcs-fb\" aria-live=\"polite\"><\/div>\n<\/div>\n<details class=\"dcs-sol\">\n<summary><span class=\"dcs-st\"><span class=\"dcs-spark\">&#10022;<\/span><span><span class=\"dcs-sv\">View Solution Path<\/span><span class=\"dcs-sh\">Hide Solution Path<\/span><\/span><\/span><span class=\"dcs-chev\">&#9660;<\/span><\/summary>\n<div class=\"dcs-solb\"><p><strong>Answer: d.<\/strong> The passage states that floating types trade range for precision. A float carries fewer significant digits than a double, so values are rounded more coarsely. Memory saving is real, but it comes at the cost of precision, not for free.<\/p><\/div>\n<\/details>\n<\/div>\n<div class=\"dcs-q\">\n<div class=\"dcs-qtop\">\n<p class=\"dcs-qlabel\">Question 5 <span class=\"dcs-pill dcs-pm\">Medium<\/span><\/p>\n<p class=\"dcs-qtext\">A long sequence of oscillation readings is repeatedly summed and averaged using float variables, and the final result drifts noticeably from the value obtained by repeating the same calculation with double variables. What best explains the drift?<\/p>\n<ul class=\"dcs-opts\" data-a=\"0\"><li role=\"button\" tabindex=\"0\"><b>a)<\/b> The representation error from repeated float rounding accumulates enough to be visible in the final average<\/li><li role=\"button\" tabindex=\"0\"><b>b)<\/b> Float variables cannot store negative oscillation readings<\/li><li role=\"button\" tabindex=\"0\"><b>c)<\/b> The double variables were declared without being initialised<\/li><li role=\"button\" tabindex=\"0\"><b>d)<\/b> Boolean variables were silently substituted for the numeric readings<\/li><\/ul>\n<div class=\"dcs-fb\" aria-live=\"polite\"><\/div>\n<\/div>\n<details class=\"dcs-sol\">\n<summary><span class=\"dcs-st\"><span class=\"dcs-spark\">&#10022;<\/span><span><span class=\"dcs-sv\">View Solution Path<\/span><span class=\"dcs-sh\">Hide Solution Path<\/span><\/span><\/span><span class=\"dcs-chev\">&#9660;<\/span><\/summary>\n<div class=\"dcs-solb\"><p><strong>Answer: a.<\/strong> Each float addition rounds to the nearest representable value. Over a long sequence, those small roundings do not cancel out perfectly, and the accumulated representation error becomes large enough to separate the float result from the more precise double result.<\/p><\/div>\n<\/details>\n<\/div>\n<div class=\"dcs-q\">\n<div class=\"dcs-qtop\">\n<p class=\"dcs-qlabel\">Question 6 <span class=\"dcs-pill dcs-pm\">Medium<\/span><\/p>\n<p class=\"dcs-qtext\">Which statement about representable range versus precision is correct?<\/p>\n<ul class=\"dcs-opts\" data-a=\"1\"><li role=\"button\" tabindex=\"0\"><b>a)<\/b> A wider representable range always means more significant digits are carried<\/li><li role=\"button\" tabindex=\"0\"><b>b)<\/b> A type can have a wide representable range while still carrying a limited number of significant digits<\/li><li role=\"button\" tabindex=\"0\"><b>c)<\/b> Precision and range are the same property described in two different ways<\/li><li role=\"button\" tabindex=\"0\"><b>d)<\/b> Only integer types have a defined precision<\/li><\/ul>\n<div class=\"dcs-fb\" aria-live=\"polite\"><\/div>\n<\/div>\n<details class=\"dcs-sol\">\n<summary><span class=\"dcs-st\"><span class=\"dcs-spark\">&#10022;<\/span><span><span class=\"dcs-sv\">View Solution Path<\/span><span class=\"dcs-sh\">Hide Solution Path<\/span><\/span><\/span><span class=\"dcs-chev\">&#9660;<\/span><\/summary>\n<div class=\"dcs-solb\"><p><strong>Answer: b.<\/strong> A float already illustrates this: it reaches roughly 10<sup>38<\/sup>, a wide range, yet still carries only a fixed, limited number of significant digits. Range describes how large or small a value can be; precision describes how many digits of that value are actually stored. They are related but distinct properties.<\/p><\/div>\n<\/details>\n<\/div>\n<\/div>\n<input type=\"checkbox\" id=\"dcs-toggle\" aria-hidden=\"true\">\n<div class=\"dcs-more\">\n<div class=\"dcs-input\"><p class=\"dcs-ilabel\">&#128196; Input 3 &middot; Combinational Logic and Truth Tables<\/p><p class=\"dcs-itext\">Combinational logic circuits build outputs directly from the current inputs using logic gates. An AND gate outputs 1 only when every input is 1. An OR gate outputs 1 when at least one input is 1. A NOT gate inverts its single input. Gates can be chained, so that the output of one gate becomes the input to the next, letting simple gates build more complex expressions. <strong>Questions 7 to 9 refer to this input.<\/strong><\/p><table class=\"dcs-t\"><tr><th>A<\/th><th>B<\/th><th>A AND B<\/th><th>A OR B<\/th><\/tr><tr><td>0<\/td><td>0<\/td><td>0<\/td><td>0<\/td><\/tr><tr><td>0<\/td><td>1<\/td><td>0<\/td><td>1<\/td><\/tr><tr><td>1<\/td><td>0<\/td><td>0<\/td><td>1<\/td><\/tr><tr><td>1<\/td><td>1<\/td><td>1<\/td><td>1<\/td><\/tr><\/table><\/div>\n<div class=\"dcs-q\">\n<div class=\"dcs-qtop\">\n<p class=\"dcs-qlabel\">Question 7 <span class=\"dcs-pill dcs-pl\">Easy<\/span><\/p>\n<p class=\"dcs-qtext\">A circuit feeds inputs A and B into a single AND gate. For which combination does the output equal 1?<\/p>\n<ul class=\"dcs-opts\" data-a=\"2\"><li role=\"button\" tabindex=\"0\"><b>a)<\/b> A = 0, B = 0<\/li><li role=\"button\" tabindex=\"0\"><b>b)<\/b> A = 0, B = 1<\/li><li role=\"button\" tabindex=\"0\"><b>c)<\/b> A = 1, B = 1<\/li><li role=\"button\" tabindex=\"0\"><b>d)<\/b> A = 1, B = 0<\/li><\/ul>\n<div class=\"dcs-fb\" aria-live=\"polite\"><\/div>\n<\/div>\n<details class=\"dcs-sol\">\n<summary><span class=\"dcs-st\"><span class=\"dcs-spark\">&#10022;<\/span><span><span class=\"dcs-sv\">View Solution Path<\/span><span class=\"dcs-sh\">Hide Solution Path<\/span><\/span><\/span><span class=\"dcs-chev\">&#9660;<\/span><\/summary>\n<div class=\"dcs-solb\"><p><strong>Answer: c.<\/strong> An AND gate outputs 1 only when both of its inputs are 1. Checking the truth table, that happens only for A = 1 and B = 1; every other combination gives 0.<\/p><\/div>\n<\/details>\n<\/div>\n<div class=\"dcs-q\">\n<div class=\"dcs-qtop\">\n<p class=\"dcs-qlabel\">Question 8 <span class=\"dcs-pill dcs-pm\">Medium<\/span><\/p>\n<p class=\"dcs-qtext\">A circuit computes NOT(A OR B). For A = 0 and B = 0, what is the output?<\/p>\n<ul class=\"dcs-opts\" data-a=\"3\"><li role=\"button\" tabindex=\"0\"><b>a)<\/b> 0<\/li><li role=\"button\" tabindex=\"0\"><b>b)<\/b> Undefined, since NOT cannot follow OR in the same circuit<\/li><li role=\"button\" tabindex=\"0\"><b>c)<\/b> Equal to whatever value A holds<\/li><li role=\"button\" tabindex=\"0\"><b>d)<\/b> 1<\/li><\/ul>\n<div class=\"dcs-fb\" aria-live=\"polite\"><\/div>\n<\/div>\n<details class=\"dcs-sol\">\n<summary><span class=\"dcs-st\"><span class=\"dcs-spark\">&#10022;<\/span><span><span class=\"dcs-sv\">View Solution Path<\/span><span class=\"dcs-sh\">Hide Solution Path<\/span><\/span><\/span><span class=\"dcs-chev\">&#9660;<\/span><\/summary>\n<div class=\"dcs-solb\"><p><strong>Answer: d.<\/strong> With A = 0 and B = 0, A OR B equals 0 from the truth table. Passing that 0 through the NOT gate inverts it to 1. Gates chain freely, so a NOT gate can follow an OR gate without issue.<\/p><\/div>\n<\/details>\n<\/div>\n<div class=\"dcs-q\">\n<div class=\"dcs-qtop\">\n<p class=\"dcs-qlabel\">Question 9 <span class=\"dcs-pill dcs-ph\">Hard<\/span><\/p>\n<p class=\"dcs-qtext\">A circuit combines two gates in sequence: first A AND B, then the result is passed through a NOT gate, giving output Y = NOT(A AND B). For which combination of A and B does Y equal 0?<\/p>\n<ul class=\"dcs-opts\" data-a=\"0\"><li role=\"button\" tabindex=\"0\"><b>a)<\/b> A = 1, B = 1<\/li><li role=\"button\" tabindex=\"0\"><b>b)<\/b> A = 0, B = 0<\/li><li role=\"button\" tabindex=\"0\"><b>c)<\/b> A = 1, B = 0<\/li><li role=\"button\" tabindex=\"0\"><b>d)<\/b> A = 0, B = 1<\/li><\/ul>\n<div class=\"dcs-fb\" aria-live=\"polite\"><\/div>\n<\/div>\n<details class=\"dcs-sol\">\n<summary><span class=\"dcs-st\"><span class=\"dcs-spark\">&#10022;<\/span><span><span class=\"dcs-sv\">View Solution Path<\/span><span class=\"dcs-sh\">Hide Solution Path<\/span><\/span><\/span><span class=\"dcs-chev\">&#9660;<\/span><\/summary>\n<div class=\"dcs-solb\"><p><strong>Answer: a.<\/strong> From the truth table, A AND B equals 1 only when A = 1 and B = 1. Passing a 1 through the following NOT gate gives Y = 0. For every other combination A AND B is 0, and NOT of 0 is 1, so A = 1 and B = 1 is the only case where Y drops to 0.<\/p><\/div>\n<\/details>\n<\/div>\n<div class=\"dcs-input\"><p class=\"dcs-ilabel\">&#128196; Input 4 &middot; Linear Discriminant Analysis and High-Dimensional Data<\/p><p class=\"dcs-itext\">Linear Discriminant Analysis, or LDA, is a linear transformation applied to high-dimensional data sets. Rather than only reducing the number of dimensions the way some other transformations do, LDA searches for the directions along which data points belonging to different classes are best separated from each other. A data set with many measured variables per sample is projected onto a smaller number of these directions, and classification is then carried out in that reduced space. In battery diagnostics, each cell can be described by many measured variables such as voltage, temperature and internal impedance, and LDA can help distinguish healthy cells from degrading ones using those measurements together. <strong>Questions 10 to 12 refer to this input.<\/strong><\/p><\/div>\n<div class=\"dcs-q\">\n<div class=\"dcs-qtop\">\n<p class=\"dcs-qlabel\">Question 10 <span class=\"dcs-pill dcs-pl\">Easy<\/span><\/p>\n<p class=\"dcs-qtext\">What is the main goal LDA optimises for when it chooses its projection directions?<\/p>\n<ul class=\"dcs-opts\" data-a=\"1\"><li role=\"button\" tabindex=\"0\"><b>a)<\/b> Minimising the total variance of the data set as a whole<\/li><li role=\"button\" tabindex=\"0\"><b>b)<\/b> Maximising the separation between predefined classes in the data<\/li><li role=\"button\" tabindex=\"0\"><b>c)<\/b> Compressing the data to the smallest possible file size<\/li><li role=\"button\" tabindex=\"0\"><b>d)<\/b> Removing the mean value from every measured variable<\/li><\/ul>\n<div class=\"dcs-fb\" aria-live=\"polite\"><\/div>\n<\/div>\n<details class=\"dcs-sol\">\n<summary><span class=\"dcs-st\"><span class=\"dcs-spark\">&#10022;<\/span><span><span class=\"dcs-sv\">View Solution Path<\/span><span class=\"dcs-sh\">Hide Solution Path<\/span><\/span><\/span><span class=\"dcs-chev\">&#9660;<\/span><\/summary>\n<div class=\"dcs-solb\"><p><strong>Answer: b.<\/strong> The passage states that LDA searches for the directions along which data points belonging to different classes are best separated. That is a class-separation objective, not a general variance-minimising or compression objective.<\/p><\/div>\n<\/details>\n<\/div>\n<div class=\"dcs-q\">\n<div class=\"dcs-qtop\">\n<p class=\"dcs-qlabel\">Question 11 <span class=\"dcs-pill dcs-pm\">Medium<\/span><\/p>\n<p class=\"dcs-qtext\">A battery diagnostics data set records ten variables per cell, including voltage, temperature and impedance, and each cell is labelled as healthy or degrading. Why is LDA a reasonable technique to apply here, rather than treating this purely as unlabelled dimension reduction?<\/p>\n<ul class=\"dcs-opts\" data-a=\"2\"><li role=\"button\" tabindex=\"0\"><b>a)<\/b> Because LDA requires exactly ten variables to function<\/li><li role=\"button\" tabindex=\"0\"><b>b)<\/b> Because LDA ignores the labels and only looks at overall variance<\/li><li role=\"button\" tabindex=\"0\"><b>c)<\/b> Because LDA uses the healthy or degrading labels to find directions that separate the two classes, not just directions of maximum spread<\/li><li role=\"button\" tabindex=\"0\"><b>d)<\/b> Because LDA can only be applied when there are exactly two measured variables<\/li><\/ul>\n<div class=\"dcs-fb\" aria-live=\"polite\"><\/div>\n<\/div>\n<details class=\"dcs-sol\">\n<summary><span class=\"dcs-st\"><span class=\"dcs-spark\">&#10022;<\/span><span><span class=\"dcs-sv\">View Solution Path<\/span><span class=\"dcs-sh\">Hide Solution Path<\/span><\/span><\/span><span class=\"dcs-chev\">&#9660;<\/span><\/summary>\n<div class=\"dcs-solb\"><p><strong>Answer: c.<\/strong> The labels are exactly what makes LDA useful here: it uses the healthy or degrading label of each cell to pick directions that separate those two groups, which a label-blind dimension reduction technique cannot do. Neither the variable count nor the number of variables restricts LDA the way the other options claim.<\/p><\/div>\n<\/details>\n<\/div>\n<div class=\"dcs-q\">\n<div class=\"dcs-qtop\">\n<p class=\"dcs-qlabel\">Question 12 <span class=\"dcs-pill dcs-ph\">Hard<\/span><\/p>\n<p class=\"dcs-qtext\">After applying LDA to the ten-variable battery data set, classification accuracy in the reduced space is noticeably lower than expected. Which of the following would most directly explain the drop?<\/p>\n<ul class=\"dcs-opts\" data-a=\"3\"><li role=\"button\" tabindex=\"0\"><b>a)<\/b> The cells were all manufactured in the same production batch<\/li><li role=\"button\" tabindex=\"0\"><b>b)<\/b> The measured variables were recorded in different physical units before scaling<\/li><li role=\"button\" tabindex=\"0\"><b>c)<\/b> The number of healthy cells is larger than the number of degrading cells<\/li><li role=\"button\" tabindex=\"0\"><b>d)<\/b> The healthy and degrading classes overlap heavily in the underlying measurement space, with no direction offering clean separation<\/li><\/ul>\n<div class=\"dcs-fb\" aria-live=\"polite\"><\/div>\n<\/div>\n<details class=\"dcs-sol\">\n<summary><span class=\"dcs-st\"><span class=\"dcs-spark\">&#10022;<\/span><span><span class=\"dcs-sv\">View Solution Path<\/span><span class=\"dcs-sh\">Hide Solution Path<\/span><\/span><\/span><span class=\"dcs-chev\">&#9660;<\/span><\/summary>\n<div class=\"dcs-solb\"><p><strong>Answer: d.<\/strong> LDA can only find a separating direction if one exists in the data. If the healthy and degrading cells genuinely overlap across every combination of the measured variables, no linear projection will separate them well, and classification accuracy in the reduced space will suffer no matter how carefully the transformation is computed.<\/p><\/div>\n<\/details>\n<\/div>\n<\/div>\n<label for=\"dcs-toggle\" class=\"dcs-seemore\" role=\"button\">See More Questions (6 more)<\/label>\n\n<script>\n(function(){\n  var root=document.getElementById('dmat-cs-practice');\n  if(!root)return;\n  root.querySelectorAll('.dcs-opts').forEach(function(list){\n    var a=parseInt(list.getAttribute('data-a'),10);\n    var items=list.querySelectorAll('li');\n    items.forEach(function(it,j){\n      function pick(){\n        if(list.classList.contains('dcs-done'))return;\n        list.classList.add('dcs-done');\n        var good=(j===a);\n        it.classList.add(good?'dcs-right':'dcs-wrong');\n        it.insertAdjacentHTML('beforeend','<span class=\"dcs-mk\">'+(good?'\\u2713 Correct':'\\u2717 Your answer')+'<\/span>');\n        if(!good){items[a].classList.add('dcs-right');items[a].insertAdjacentHTML('beforeend','<span class=\"dcs-mk\">\\u2713 Correct answer<\/span>');}\n        var fb=list.parentElement.querySelector('.dcs-fb');\n        if(fb){fb.className='dcs-fb '+(good?'dcs-g':'dcs-b');\n          fb.textContent=good?'\\u2705 Correct, well done!':'\\u274C Not quite. The correct option is highlighted. Open the solution path below.';}\n        var q=list.closest('.dcs-q');var sol=q&&q.querySelector('details.dcs-sol');\n        if(sol)sol.open=true;\n      }\n      it.addEventListener('click',pick);\n      it.addEventListener('keydown',function(e){if(e.key==='Enter'||e.key===' '){e.preventDefault();pick();}});\n    });\n  });\n})();\n<\/script>\n<\/div>\n<\/div><\/article><\/div>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Who_Must_Take_the_dMAT_Computer_Science_Section\"><\/span><strong>Who Must Take the dMAT Computer Science Section?<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p>Every candidate answers the Computer Science Basic Task, alongside the other four disciplines&#8217; basic tasks; nobody is shut out of the module by a discipline they never studied.<\/p>\n\n\n\n<p>The real advantage sits in the Advanced Tasks. Choose Computer Science there if your Bachelor&#8217;s is in CS, IT, or a related field; that background picks up marks others find harder under time pressure. Otherwise, treat the Basic Task as a fair foundation topic and move on.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"dMAT_Computer_Science_Syllabus_Basic_and_Advanced_Tasks\"><\/span><strong>dMAT Computer Science Syllabus: Basic and Advanced Tasks<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<figure class=\"wp-block-table is-style-stripes\"><table class=\"has-palette-color-5-background-color has-background\"><thead><tr><th><strong>Task<\/strong><\/th><th><strong>Topic<\/strong><\/th><th><strong>What it involves<\/strong><\/th><\/tr><\/thead><tbody><tr><td>Basic Task<\/td><td>Data types and memory<\/td><td>Variable declaration, memory widths, representable ranges, precision<\/td><\/tr><tr><td>Advanced Task 1<\/td><td>Combinational logic<\/td><td>Boolean AND, OR, NOT; logic gates; truth tables; simplifying expressions<\/td><\/tr><tr><td>Advanced Task 2<\/td><td>Linear transformations of high-dimensional data sets<\/td><td>Linear Discriminant Analysis; separating classes in multivariate data<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<p>As with the other four disciplines, every question here is passage-based. You are given a short technical passage, sometimes with a table, and the question tests whether you can apply undergraduate-level reasoning to it quickly, not whether you can recall a fact from memory. That distinction matters more for how you prepare than almost anything else in this guide.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"dMAT_Computer_Science_Study_Plan_Before_26_September_2026\"><\/span><strong>dMAT Computer Science Study Plan Before 26 September 2026<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n\n<p><a href=\"https:\/\/leapscholar.com\/blog\/dmat-registration\/\"><strong>Registration<\/strong><\/a><strong> for the September 2026 cycle closes on 15 September 2026, with the exam itself on 26 September 2026.<\/strong> A four-week plan that treats Computer Science as one part of a five-discipline subject module works well.<\/p>\n\n\n\n<figure class=\"wp-block-table is-style-stripes\"><table class=\"has-palette-color-5-background-color has-background\"><thead><tr><th><strong>Week<\/strong><\/th><th><strong>Focus<\/strong><\/th><\/tr><\/thead><tbody><tr><td>1: Diagnose<\/td><td>Attempt the 12 CS practice questions plus a handful from each of the other four disciplines. Note whether data types, combinational logic, or LDA costs the most time<\/td><\/tr><tr><td>2: Refresh Basic Task<\/td><td>Re-read variable declaration, memory width, and value-range definitions until you can state them without a source<\/td><\/tr><tr><td>3: Go deep<\/td><td>If your discipline is CS, focus on combinational logic and LDA. If not: your own two Advanced Task areas<\/td><\/tr><tr><td>4: Rehearse conditions<\/td><td>No notes, no calculator on screen. Watch the official d-mat.de videos<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n<h2 class=\"wp-block-heading\"><span class=\"ez-toc-section\" id=\"Frequently_Asked_Questions_About_the_dMAT_Computer_Science_Section\"><\/span><strong>Frequently Asked Questions About the<\/strong> <strong>dMAT Computer Science Section<\/strong><span class=\"ez-toc-section-end\"><\/span><\/h2>\n\n\n<div id=\"rank-math-faq\" class=\"rank-math-block\">\n<div class=\"rank-math-list \">\n<div id=\"faq-question-1786438178981\" class=\"rank-math-list-item\">\n<h5 class=\"rank-math-question \"><strong>Do I need real programming experience to answer this section well?<\/strong><\/h5>\n<div class=\"rank-math-answer \">\n\n<p>No. The Basic Task tests data types and memory at the first-year level, and the passage supplies the specific widths and ranges you need.<\/p>\n\n<\/div>\n<\/div>\n<div id=\"faq-question-1786438194300\" class=\"rank-math-list-item\">\n<h5 class=\"rank-math-question \"><strong>Is the Computer Science section only relevant if I studied computer science?<\/strong><\/h5>\n<div class=\"rank-math-answer \">\n\n<p>Not for the Basic Task, which every candidate answers. It matters most if you choose Computer Science as one of your two Advanced Task areas, typically because your Bachelor&#8217;s degree is in computer science, IT, or a closely related field.<\/p>\n\n<\/div>\n<\/div>\n<div id=\"faq-question-1786438210291\" class=\"rank-math-list-item\">\n<h5 class=\"rank-math-question \"><strong>Why is there a computer science topic in a battery science exam at all?<\/strong><\/h5>\n<div class=\"rank-math-answer \">\n\n<p>Because battery management systems are built on exactly these foundations: sized data types for sensor readings, digital logic for protective decisions, and methods like LDA for diagnosing cell health.<\/p>\n\n<\/div>\n<\/div>\n<div id=\"faq-question-1786438230517\" class=\"rank-math-list-item\">\n<h5 class=\"rank-math-question \"><strong>Can I use a calculator for the numeric questions?<\/strong><\/h5>\n<div class=\"rank-math-answer \">\n\n<p>No. No calculator and no notes are allowed anywhere in the dMAT. Questions are designed to be answerable through reasoning and simple arithmetic.<\/p>\n\n<\/div>\n<\/div>\n<div id=\"faq-question-1786438266061\" class=\"rank-math-list-item\">\n<h5 class=\"rank-math-question \"><strong>What if I believe I have been assigned the wrong subject module?<\/strong><\/h5>\n<div class=\"rank-math-answer \">\n\n<p>Contact g.a.s.t. at <a href=\"mailto:kontakt@gast.de\">kontakt@gast.de<\/a>, since they handle registration and module assignment. APS India handles the separate APS procedure and any exemptions.<\/p>\n\n<\/div>\n<\/div>\n<\/div>\n<\/div>","protected":false},"excerpt":{"rendered":"<p><span class=\"rt-reading-time\" style=\"display: block;\"><span class=\"rt-label rt-prefix\"><\/span> <span class=\"rt-time\">5<\/span> <span class=\"rt-label rt-postfix\">min read<\/span><\/span> \u26a1 Quick Read Computer Science is one of five disciplines in the dMAT Battery Science module, not a standalone test, tested in the Basic Task plus two Advanced Tasks Basic Task: data types and memory. Advanced Tasks: combinational logic, and linear transformations of high-dimensional data (LDA) Format: technical reading passage + four-option single-choice questions, 90 [&hellip;]<\/p>\n","protected":false},"author":85,"featured_media":82018,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[260],"tags":[1620],"blocksy_meta":[],"_links":{"self":[{"href":"https:\/\/leapscholar.com\/blog\/wp-json\/wp\/v2\/posts\/82013"}],"collection":[{"href":"https:\/\/leapscholar.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/leapscholar.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/leapscholar.com\/blog\/wp-json\/wp\/v2\/users\/85"}],"replies":[{"embeddable":true,"href":"https:\/\/leapscholar.com\/blog\/wp-json\/wp\/v2\/comments?post=82013"}],"version-history":[{"count":3,"href":"https:\/\/leapscholar.com\/blog\/wp-json\/wp\/v2\/posts\/82013\/revisions"}],"predecessor-version":[{"id":82023,"href":"https:\/\/leapscholar.com\/blog\/wp-json\/wp\/v2\/posts\/82013\/revisions\/82023"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/leapscholar.com\/blog\/wp-json\/wp\/v2\/media\/82018"}],"wp:attachment":[{"href":"https:\/\/leapscholar.com\/blog\/wp-json\/wp\/v2\/media?parent=82013"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/leapscholar.com\/blog\/wp-json\/wp\/v2\/categories?post=82013"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/leapscholar.com\/blog\/wp-json\/wp\/v2\/tags?post=82013"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}