Maharashtra HSC Computer Technology (Vocational) common mistakes
Maharashtra HSC Computer Technology (Vocational) · Understand the traps and how to avoid them.
When converting between binary, octal, decimal and hexadecimal, the candidate converts the integer part correctly but pads or groups the fractional part from the wrong end - for example writing 0.1011 binary as 0.B hex by grouping 1011 instead of 1011, or converting 0.1 binary to decimal as 0.1 instead of 0.5.
Textbook methods are drilled on whole numbers, so the candidate memorises 'group in threes/fours from the right' and applies it mechanically to fractions, where grouping must start from the decimal point and proceed rightwards, padding on the right. The fractional place values (2^-1, 2^-2 ...) are also less practised, so the candidate falls back on the integer place-value pattern.
What to do instead
Adopt a fixed two-line routine: write the number with the radix point aligned, then mark group boundaries outward from the radix point (left for the integer part, right for the fraction), padding only on the outer edges. For binary-to-decimal fractions, write the weights 0.5, 0.25, 0.125, 0.0625 above each bit before adding. Verify by converting back with the multiply-by-2 method and checking you recover the original digits.
The candidate builds a truth table for a two- or three-variable Boolean expression but fills rows in an arbitrary order (00, 01, 10, 11 mixed up) or skips repeated rows, so the final simplified expression derived by Karnaugh map or algebraic simplification does not match the circuit described.
The candidate treats the truth table as a list of 'cases' rather than an exhaustive enumeration of minterms, and has not internalised that K-map adjacency depends on Gray-code ordering. Under exam time pressure, rows get filled in the order the terms appear in the expression rather than in binary counting order.
What to do instead
Always write the input columns in strict binary counting order (000, 001, 010 ...), one row per combination, and count rows as 2^n before starting. When using a K-map, label rows and columns in Gray code (00, 01, 11, 10) and check that every 1 in the truth table appears in exactly one cell. Finally, substitute one input combination back into both the original expression and your simplified answer to confirm they agree.
The candidate writes a loop or conditional in a programming answer with an off-by-one boundary - for example using `for i = 1 to n-1` when summing n terms, or `while i < n` when the last element index is n - and then hand-traces the program incorrectly because they trace the variable's value after the update instead of before.
Loop bounds are learned as templates without connecting them to whether the range is inclusive and whether indices start at 0 or 1. Hand-tracing fails because the candidate does not maintain a table of variable values per iteration, so they lose track of the state at the test condition.
What to do instead
Before writing the loop, state in words the exact number of iterations and the first and last value the counter takes, then choose the comparison operator to match. When tracing, draw a table with one column per variable and one row per iteration, and evaluate the loop condition using the values at the top of the row, not after executing the body. Test with the smallest case (n = 1) and one middle case.
When asked to write an SQL query or explain a relational operation, the candidate confuses WHERE with HAVING, uses SELECT * when an aggregate is required, or omits GROUP BY while selecting an aggregate alongside a plain column, producing a query that would be rejected or would return meaningless rows.
The candidate memorises query syntax as a sequence of keywords rather than as clauses with distinct evaluation roles: WHERE filters rows before grouping, HAVING filters groups after aggregation. Aggregate functions and grouping are taught late in the syllabus, so they get less practice than simple SELECT statements.
What to do instead
Learn the logical evaluation order - FROM, WHERE, GROUP BY, HAVING, SELECT, ORDER BY - and place each condition by asking 'is this a property of a single row or of a group?'. Whenever an aggregate appears in SELECT, every non-aggregated column must appear in GROUP BY; write the GROUP BY list first, then the SELECT list. Practise by writing the same question both ways and predicting which one the database will reject.
The candidate answers questions on network layers, devices and addressing by listing memorised device names without matching them to the correct layer or function - for example placing a router at the data link layer, calling a switch a layer-3 device, or saying an IP address identifies a process rather than a host/interface.
Device and protocol names are memorised as a flat list from a single revision table, without a mental model of encapsulation and what each layer's address identifies. The distinction between MAC address (link), IP address (network) and port number (transport) is often glossed over in quick revision.
What to do instead
Build a one-page layer map with four columns: layer, address/identifier used, example device, example protocol. For each device, write the layer and the single sentence of what it forwards (hub: bits to all ports; switch: frames by MAC; router: packets by IP). For addressing, practise classifying sample addresses and stating explicitly 'this identifies a host interface' versus 'this identifies a service on a host'.
In HTML/CSS questions the candidate writes presentational tags and attributes that are deprecated or misnested - using `<font>`, `<center>`, `<b>` for emphasis, or closing tags in the wrong order - and cannot explain the difference between inline and block elements or between internal, external and inline CSS.
The candidate learns markup from older tutorials and from copying visible output rather than from the current specification, and treats HTML as a formatting language rather than a structural one. Nesting rules and CSS cascade precedence are rarely practised as explicit rules.
What to do instead
Memorise the current structural element set (headings, p, ul/ol/li, table/tr/td, a, img, div, span, form controls) and use CSS for all appearance. Practise writing a small page with an external stylesheet and predict which rule wins when an inline style, an ID rule and a class rule conflict (inline > ID > class > element, with later rules of equal specificity winning). Validate nesting by indenting every element one level inside its parent.
The candidate describes operating-system and file-management concepts using everyday intuitions - saying deleting a file always erases it from disk, that RAM stores files permanently, or that a folder and a directory path are unrelated - and confuses virtual memory with secondary storage or a process with a program.
Everyday desktop experience (drag to recycle bin, files 'in' folders) creates a mental model that conflicts with the formal one, and the syllabus vocabulary (process, paging, file allocation, path) is learned as definitions to recite rather than as mechanisms.
What to do instead
For each term, write a one-line mechanism plus a concrete trace: program versus process (code on disk versus instance in memory with its own state), deletion (directory entry removed; data blocks freed but recoverable until overwritten), and virtual memory (pages swapped between RAM and disk). Practise reading absolute and relative paths and stating what each resolves to from a given working directory.
On cyber safety and ethics questions the candidate gives a vague moral answer ('be careful online', 'use a strong password') instead of naming the specific threat, mechanism and countermeasure, and misclassifies attacks - calling phishing a virus, or describing a firewall as antivirus software.
These topics are often revised as general awareness rather than as a taxonomy, so the candidate cannot map a scenario to a named category. The exam expects precise terminology (phishing, pharming, spyware, ransomware, social engineering, authentication, encryption) and the candidate substitutes everyday language.
What to do instead
Build a threat table with columns: attack name, how it reaches the victim, what it targets (confidentiality/integrity/availability), and the specific control. For scenario questions, identify the delivery vector first (email link, infected download, weak credential, insider), then name the category, then the control. Distinguish authentication (proving identity), authorisation (what you may do) and encryption (protecting data in transit or at rest).
The candidate explains emerging technologies and vocational applications with buzzwords only - saying AI 'learns by itself', cloud computing 'is the internet', or IoT 'connects devices' - without stating the underlying mechanism, the data flow, or a concrete vocational use case with its benefit and limitation.
These are recent additions to the syllabus with little practice material, so the candidate reproduces marketing language heard outside class. Without a mechanism, they cannot answer the applied part of the question that asks for a use case or a trade-off.
What to do instead
For each technology, prepare a three-part note: what data or resource flows where, what the enabling mechanism is (training on labelled data; remote servers accessed over a network; sensors sending readings to a platform), and one vocational example with a benefit and a limitation (e.g. sensor-based crop monitoring improves irrigation timing but depends on connectivity and power). Answer applied questions by naming the sector, the task, and the measurable gain.
In office productivity and multimedia questions the candidate confuses spreadsheet relative and absolute references, or describes formulas and functions only by their result - writing =A1+B1 down a column and expecting it to keep referring to the same cells, or being unable to say what $A$1 does or why a chart type suits some data and not others.
Spreadsheet work is learned by clicking and observing, so the rule that references shift when copied is never articulated. Functions are memorised by example rather than by argument structure, so the candidate cannot adapt SUM, AVERAGE, IF or COUNTIF to a new question.
What to do instead
State the rule explicitly: a reference without $ shifts by the same offset as the cell it is copied to; $ locks the row, the column, or both. Practise by writing a formula, predicting the copied result two rows down, then checking. For functions, write the argument pattern (IF(condition, value_if_true, value_if_false)) and construct one example from scratch. For charts, match the chart to the data type: line for trends over time, bar for comparison across categories, pie for parts of a single whole.