RSSB Computer Instructor common mistakes
RSSB Computer Instructor · Understand the traps and how to avoid them.
Solving subnetting questions by memorising a single worked example and then freezing when the question asks for usable hosts, broadcast address, or the number of subnets rather than just the network address.
Most candidates practise subnetting only in one direction (given IP + mask, find network ID) because that is the example shown in coaching notes, so the inverse operations (host bits, block size, usable range) never become automatic and time pressure in the exam exposes the gap.
What to do instead
Drill all four directions from the same stem: for a given CIDR, write network address, broadcast address, first/last usable host, and usable host count in one line, using the block-size method (256 minus the interesting octet). Do 30 such stems with masks /25 to /30 until each takes under 60 seconds without writing binary.
Writing SQL answers that run but are conceptually wrong: using WHERE instead of HAVING with aggregates, omitting GROUP BY columns, or confusing COUNT(*) with COUNT(column) when NULLs are present.
Candidates learn SELECT-FROM-WHERE first and never internalise the logical processing order (FROM, WHERE, GROUP BY, HAVING, SELECT, ORDER BY), so aggregate filtering feels interchangeable with row filtering.
What to do instead
Memorise the clause evaluation order and apply a two-question test to every query: does the condition involve an aggregate (then HAVING), and does the column contain NULLs (then COUNT(column) skips them). Practise ten queries where you must state the row count returned before running them mentally.
Confusing paging and segmentation, or describing virtual memory as 'extra RAM on the hard disk', when asked about memory management in the OS section.
Everyday language ('the computer uses disk as RAM') contaminates the technical answer, and candidates memorise definitions of paging and segmentation separately without ever contrasting them on fixed vs variable size and on internal vs external fragmentation.
What to do instead
Build a two-column comparison table (unit size, fragmentation type, address form, visibility to programmer) and rehearse one sentence per row aloud. For virtual memory, always state the mechanism: page table mapping, page fault, swap-out and swap-in, and that the disk area is swap space, not RAM.
Answering pedagogy questions with generic slogans ('use ICT', 'make it interactive') instead of naming a specific method, its theorist, and the classroom step it produces.
Pedagogy is treated as the easy section and revised last from short notes, so candidates can recognise terms like constructivism but cannot apply them to a described classroom situation, which is how the questions are framed.
What to do instead
For each major approach (constructivism, behaviourism, discovery learning, cooperative learning, Bloom's levels), write one concrete classroom action and one theorist. Then practise converting a scenario into an answer that names the method, justifies it with the theory, and describes the teacher's specific move.
Mixing up the layers of the OSI and TCP/IP models when asked where a device or protocol operates, for example placing a switch at layer 4 or a router at layer 2, or putting SSL at the transport layer.
Devices and protocols are memorised as a flat list rather than attached to a layer with a reason, so under exam pressure the list is recalled in the wrong order.
What to do instead
Anchor every device and protocol to a layer by its function: hub repeats bits (L1), switch forwards frames by MAC (L2), router forwards packets by IP (L3), TCP/UDP handle ports (L4). Rehearse by writing the layer number first and the function second, then the device third, for ten items.
Treating computer organisation numericals (cache hit ratio, effective access time, CPI, speedup) as theory and skipping the arithmetic, then losing easy marks on formulas that were known but misapplied.
Candidates read the formula, nod, and never practise substituting values, so they miss unit mismatches (ns vs cycles) and forget that effective access time must weight hit and miss paths.
What to do instead
Keep a one-page formula sheet (EAT = hit ratio x hit time + miss ratio x miss penalty; CPU time = IC x CPI x clock period; Amdahl's law) and solve five numeric problems per formula with units written at every step. Always state the unit in the final answer.
Answering Rajasthan GK from outdated district counts and old scheme names, for example using pre-2023 district numbers or citing renamed government schemes.
Static GK notes circulate unchanged for years while the state's administrative divisions and flagship schemes are updated, and candidates do not cross-check the year of their source.
What to do instead
Maintain a dated fact sheet for Rajasthan (current district and division count with the year of change, current chief minister and governor, major schemes with launch year and purpose) and refresh it from the official state portal before the exam. Mark every fact with the year you verified it.
Losing marks in General Hindi and English on sandhi, samas, and error-spotting because the rule is recognised but the applied form is guessed rather than derived.
Grammar is revised by reading examples passively; candidates can name the type of samas when shown the answer but cannot split a compound or identify the correct sandi form from scratch.
What to do instead
Practise the reverse direction: given a compound word, split it and name the samas; given two words, join them and name the sandhi. For English, underline the specific error (subject-verb agreement, article, preposition, tense) in 20 sentences and state the rule violated.
Confusing symmetric and asymmetric encryption use cases, or describing a digital signature as 'encrypting the message with the receiver's public key'.
The two key pairs are memorised as abstract symbols without mapping each to its purpose, so the signing direction (private key signs, public key verifies) gets reversed under pressure.
What to do instead
Fix one sentence: confidentiality uses the receiver's public key to encrypt; authenticity uses the sender's private key to sign. Draw the four-key diagram once and label which key sits on which side for each of the two goals, then answer five scenario questions using only that diagram.
Writing code answers without tracing them, so off-by-one errors in loops, wrong base cases in recursion, and stack or queue order mistakes survive into the final answer.
Candidates read code and believe they understand it; reading is passive and does not reveal that a loop runs n+1 times or that a post-order traversal prints the root last.
What to do instead
For every algorithm question, hand-trace with a small input (n = 3 or a four-node tree) in a table of variable values per iteration, and state the base case explicitly for recursion. Check the trace against the expected output before finalising the answer.