BSNL JTO study plan

Map the full telecom syllabus into a one-page checklist of sub-topics (transmission media, multiplexing, switching, signalling, numbering/charging) and rate your confidence on each

Derive and practise numericals on Shannon capacity, Nyquist sampling, bit rate vs baud rate, and dBm-to-mW conversion until you can solve each in under 90 seconds

Explain the OSI and TCP/IP layer stacks aloud, naming at least two protocols and one device per layer, and state where switching and routing decisions happen

Compare circuit switching, packet switching and message switching on latency, overhead and suitability for voice versus data traffic

Work through 25 mixed numericals on bandwidth, noise figure and link budget and log every error with its cause

Trace the path of a voice call from subscriber loop through local exchange, trunk network and terminating exchange, naming each signalling event (off-hook, dial tone, digits, ringing, answer, release)

Differentiate PCM, ADPCM, delta modulation and DPCM by sampling rate, bit rate and quantisation noise, and compute the bit rate for a 30-channel E1 frame including signalling and sync bits

Distinguish SDH/SONET hierarchy levels (STM-1/4/16, OC-3/12/48), their line rates and typical protection schemes (1+1, 1:1, MSP)

Summarise WDM, DWDM and OTN concepts including channel spacing, EDFA amplification bands and when regeneration is required

Classify transmission media (twisted pair, coax, fibre single-mode/multi-mode) by bandwidth, attenuation and typical deployment distance

Solve 20 problems each on diode circuits (clippers, clampers, rectifiers with ripple factor) and BJT/MOSFET biasing (Q-point, load line, stability)

Compute gain, input/output impedance and bandwidth for CE, CB and CC amplifier configurations and justify which configuration suits which application

Design and analyse op-amp circuits for inverting, non-inverting, summing, difference and integrator configurations, including slew-rate and offset-error limits

Apply feedback theory to identify topology (voltage/current, series/shunt) and compute closed-loop gain, bandwidth and stability margins from the loop gain

Derive the Barkhausen criterion and calculate oscillation frequency for RC phase-shift and Colpitts/Hartley oscillators

Convert between binary, Gray, BCD and hexadecimal, and simplify Boolean expressions using K-maps and Boolean algebra for up to five variables

Design combinational blocks (adders, multiplexers, decoders, comparators) and implement a given truth table with the minimum gate count

Analyse sequential circuits: derive state tables and diagrams for flip-flops, design mod-N counters and shift registers, and distinguish Mealy from Moore machines

Explain modulation schemes (AM, FM, ASK, FSK, PSK, QAM) in terms of bandwidth, noise immunity and spectral efficiency, and compute modulation index and bandwidth for AM/FM

Outline antenna fundamentals (gain, directivity, beamwidth, Friis transmission equation) and compute received power for a given link

Convert between number systems and perform signed arithmetic using 1's/2's complement, and identify overflow conditions in fixed-width arithmetic

Explain the full instruction cycle, addressing modes, pipelining hazards and cache mapping (direct, associative, set-associative) with a worked hit/miss calculation

Compare process and thread scheduling algorithms (FCFS, SJF, round robin, priority) by computing average waiting and turnaround times for a given process set

Detect deadlock using resource-allocation graphs and Banker's algorithm, and distinguish paging from segmentation by fragmentation behaviour and address translation

Apply SQL joins, GROUP BY and HAVING to a sample schema, and normalise a relation to 3NF while naming the functional dependencies

Trace a packet across the network stack and compute subnet masks, CIDR ranges, broadcast addresses and usable hosts for at least 15 IPv4 subnets

Compare TCP and UDP behaviour, explain the three-way handshake, congestion control phases and sliding-window flow control with a sequence-number example

Describe routing behaviour for distance-vector versus link-state protocols and apply Dijkstra's algorithm to a small weighted graph

Write and dry-run short C programs (pointers, arrays, recursion, string handling) and predict output for code snippets involving operator precedence

Classify data structures and algorithms (stack, queue, linked list, tree, sorting, searching) by time and space complexity, and compute complexity for given code

Solve 30 quantitative aptitude problems (percentages, ratio, time-speed-distance, time-and-work, profit-loss) under a 45-second-per-question clock

Practise 20 reasoning sets covering series, coding-decoding, blood relations, syllogisms and seating arrangement, recording accuracy and time per set

Complete 15 data-interpretation sets (tables, bar and line charts) and state the shortcut used for each

Revise current affairs from the last six months in telecom, IT and national policy, and record 50 verifiable facts with sources

Review static awareness topics relevant to a telecom PSU (organisation structure, regulators, spectrum basics, major government digital programmes) without relying on unverified claims

Take two full-length mixed mocks under exam timing and analyse each within 24 hours, tagging errors as concept gap, calculation slip or time pressure

Re-derive the 30 highest-yield formulas across all four domains from memory and correct any that fail

Revisit every item in your error logs from weeks 1-7 and re-solve the ones still marked unresolved

Simulate exam-day strategy on one mock: question order, skip rules and target time per section

Compress all notes into a final two-page revision sheet per domain