RSSB Computer Instructor study materials
RSSB Computer Instructor study resources

RSSB Computer Instructor study plan

RSSB Computer Instructor · Give each week a clear focus.

8 weeks · About 6 hours per week

Week 1

Computer Fundamentals and Organization & Digital Electronics and Computer Architecture

  • Map the full syllabus into a one-page checklist that lists every domain with its weight and the subtopics you must cover for each

  • Explain the fetch-decode-execute cycle and the roles of the program counter, instruction register, and accumulator without referring to notes

  • Solve ten number-system conversion problems across binary, octal, decimal, and hexadecimal, and verify each answer by converting back

  • Derive the truth tables for AND, OR, NOT, NAND, NOR, XOR, and XNOR gates, then simplify three Boolean expressions using Karnaugh maps

  • Describe the internal organization of RAM and ROM, and state the difference between SRAM and DRAM in terms of speed, cost, and refresh needs

Your checkpoint

A handwritten or typed revision sheet that contains the syllabus checklist, the annotated fetch-decode-execute diagram, and ten solved conversion problems with checked answers

Week 2

Computer Fundamentals and Organization & Digital Electronics and Computer Architecture

  • Compare CISC and RISC architectures on instruction set size, addressing modes, pipelining, and typical use cases

  • Trace the steps of instruction pipelining and identify the three classic hazards (structural, data, control) with one example of each

  • Classify the memory hierarchy from registers to secondary storage by access time, cost per bit, and volatility

  • Draw and label the block diagram of a CPU showing ALU, control unit, registers, and buses, and explain the function of the address, data, and control buses

  • Compute the effective memory address for direct, indirect, immediate, and indexed addressing modes given a small sample instruction set

Your checkpoint

A labelled CPU-and-bus block diagram together with a comparison table for CISC vs RISC and a worked set of five addressing-mode address calculations

Week 3

Data Communication and Computer Networks

  • Explain the OSI seven-layer model and the TCP/IP four-layer model, and map each OSI layer to its TCP/IP counterpart

  • Describe the function of each network device (hub, switch, router, gateway, repeater, bridge) and state the layer at which each operates

  • Differentiate between circuit switching and packet switching, and between TCP and UDP, giving one application example for each protocol

  • Calculate the subnet mask, network address, broadcast address, and usable host range for five given IPv4 addresses with CIDR prefixes

  • Summarise the purpose of DNS, DHCP, HTTP, FTP, SMTP, and SNMP and the default port number of each

Your checkpoint

A one-page layered protocol reference chart plus five fully worked subnetting problems showing network, broadcast, and host ranges

Week 4

Data Communication and Computer Networks & Computer Security and Cyber Law

  • Describe the topologies (bus, star, ring, mesh, tree, hybrid) and justify a topology choice for a small school computer lab

  • Explain error detection and correction using parity, checksum, and CRC, and work through one CRC calculation by hand

  • Identify the main categories of malware (virus, worm, Trojan, ransomware, spyware) and match each to a realistic prevention measure

  • Distinguish symmetric from asymmetric encryption and explain how digital signatures and certificates establish authenticity

  • Outline the key provisions of Indian cyber law on unauthorised access, identity theft, and publishing obscene material, and state the role of CERT-In

Your checkpoint

A two-part summary sheet covering network topologies and error detection on one side, and malware categories with their countermeasures on the other

Week 5

Programming and Data Structures

  • Write, compile, and run programs in C that use arrays, pointers, structures, and file input/output

  • Implement linear search, binary search, bubble sort, and insertion sort, and state the time complexity of each

  • Build a singly linked list with insert, delete, and traverse operations, and explain how it differs from an array in memory layout

  • Trace a recursive function such as factorial or Fibonacci on paper and show the call stack at each step

  • Convert the infix expression A+B*C-D to postfix using a stack and evaluate one postfix expression step by step

Your checkpoint

A folder of at least six working C programs (four algorithms plus linked-list and file-handling examples) with saved output and a short complexity note for each

Week 6

Programming and Data Structures & Database Management Systems

  • Explain stack, queue, tree, and graph data structures with one real-world use case for each

  • Define the properties of a binary search tree and perform insertion, deletion, and all three traversal orders on a sample tree

  • Design an ER diagram for a school database with students, teachers, classes, and marks, identifying primary and foreign keys

  • Write SQL statements using SELECT, WHERE, ORDER BY, GROUP BY, JOIN, and aggregate functions against a small sample table

  • Explain normalisation up to third normal form and convert one unnormalised table into 3NF

Your checkpoint

An ER diagram for the school database plus a SQL script of at least ten queries that run successfully and produce correct output

Week 7

Operating Systems & Software Engineering and Web Technologies

  • Compare process scheduling algorithms (FCFS, SJF, round robin, priority) and compute average waiting time for a small process set under each

  • Explain virtual memory, paging, and page replacement using FIFO and LRU on a given reference string

  • Describe the software development life cycle phases and contrast the waterfall and agile models

  • Write HTML markup that includes headings, lists, tables, forms, and an embedded stylesheet, and explain the client-server request flow

  • List the file-system and process-management commands you would teach for a chosen operating system, with one line on each

Your checkpoint

A comparison table of scheduling algorithms with worked average waiting times, and a single valid HTML page containing a styled table and a form

Week 8

Rajasthan General Knowledge and Current Affairs & General Hindi and English & Pedagogy and Teaching Aptitude

  • Summarise key facts about Rajasthan's geography, districts, rivers, and major institutions for quick recall

  • Review current affairs from the past six months and note at least twenty items relevant to Rajasthan and national technology policy

  • Practise Hindi grammar topics such as sandhi, samas, and muhavare, and English grammar topics such as tenses, articles, and prepositions

  • Draft a lesson plan for a 40-minute class on number systems that states objectives, teaching aids, activities, and assessment

  • Explain formative and summative assessment, and list three classroom questioning techniques that check understanding

Your checkpoint

A complete 40-minute lesson plan on number systems plus a one-page current-affairs and Rajasthan GK fact sheet

Milestones

Week 2: You can draw the CPU block diagram from memory, explain the fetch-decode-execute cycle aloud in under two minutes, and correctly solve eight of ten mixed number-system and gate problems

Week 4: You can subnet any given IPv4 address correctly on the first attempt, name the OSI layer of each common device and protocol, and classify five malware scenarios with the right countermeasure

Week 6: Your six C programs compile and run without errors, you can trace a binary search tree traversal by hand, and your SQL script returns correct results for all ten queries

Week 8: You complete a full-length timed mock test across all eleven domains, score at least 60 percent overall, and score at least 50 percent in each of the four highest-weight domains