BPSC TRE Computer Science Syllabus & Exam Pattern | ExamRig
BPSC School Teacher Recruitment Examination
BPSC TRE Computer Science Syllabus and Exam Pattern
This guide explains the Computer Science preparation areas for the BPSC School Teacher Recruitment Examination (TRE), with the paper structure, topic priorities, previous-paper signals and links to official BPSC material. It is designed primarily for candidates preparing for higher-secondary Computer Science teacher posts.
Last reviewed: 16 August 2026Prepared by: ExamRigSource basis: Official BPSC notices and question booklets
Important status of the syllabus
This page is not a verbatim reproduction of a BPSC notification.
BPSC recruitment notices and question booklets establish the paper structure and subject tested, but the material reviewed does not present the Computer Science portion as the exact chapter-by-chapter list often circulated by coaching websites. The topic map below is therefore an ExamRig preparation guide built from the official paper, previous BPSC questions and standard Computer Science subject areas.
BPSC's current exam calendar lists the School Teacher Recruitment Examination (TRE-4), but candidates should use the latest detailed advertisement, syllabus notice and corrigenda published by BPSC when they become available. If a new notification changes the number of questions, marking rules, eligibility or subject coverage, the official notification will take priority over this guide.
Latest verified BPSC TRE paper structure
The latest available official Computer Science question booklet reviewed for this guide contains three parts. Computer Science begins at Question 71 and continues through Question 150. The booklet allows 2 hours and 30 minutes and carries a maximum of 150 marks.
Part
Area
Question numbers
Number of questions
Preparation note
Part I
Language (qualifying)
1-30
30
Includes the common English component and the notified language choice.
Part II
General Studies
31-70
40
Prepare the subjects and level stated in the current recruitment notification.
Part III
Computer Science
71-150
80
The main subject section and the largest part of the paper.
Total
150
Maximum marks: 150; time: 2 hours 30 minutes.
Before the examination: verify the current rules for qualifying marks, negative marking, permitted languages and the fifth answer option directly from the latest BPSC advertisement and question-booklet instructions. Do not rely on an older exam cycle for rules that BPSC may revise.
Topic-wise BPSC TRE Computer Science preparation syllabus
The following sections convert the broad Computer Science domain into a practical checklist. The first five areas deserve strong conceptual preparation because official papers have tested both basic definitions and problem-solving concepts. The remaining areas complete a balanced graduate-level Computer Science revision plan.
Unit 1
Computer fundamentals, number systems and digital logic
Computer generations, classifications and functional units
Input, output, storage and memory devices
Binary, octal, decimal and hexadecimal conversions
Signed numbers, complements and computer arithmetic
Boolean algebra, laws and De Morgan's theorems
Logic gates, truth tables and universal gates
Combinational and sequential circuits
Flip-flops, registers, counters, encoders and multiplexers
Unit 2
Computer organization and architecture
CPU organization, ALU, control unit and registers
Instruction cycle and addressing modes
Memory hierarchy, cache, RAM, ROM and secondary storage
Input-output organization, interrupts and DMA
RISC and CISC architecture
Pipelining and basic parallel processing
Microprocessor and microcontroller fundamentals
Basic concepts of 8085/8086 architecture and interfacing
Unit 3
Programming and object-oriented concepts
Algorithms, flowcharts, pseudocode and problem solving
Variables, data types, operators and expressions
Conditional statements, loops and functions
Arrays, strings, pointers, structures and file handling
Recursion and modular programming
Classes, objects, constructors and access control
Encapsulation, inheritance, polymorphism and abstraction
Core concepts of C, C++, Java and Python
Exception handling and basic program debugging
Unit 4
Data structures
Arrays and sparse matrices
Stacks, queues, circular queues and priority queues
Singly, doubly and circular linked lists
Trees, binary trees and tree traversals
Binary search trees, AVL trees and heaps
Graph representations and traversals
Hashing and collision resolution
Applications and time costs of common operations
Unit 5
Algorithms and complexity
Linear and binary searching
Bubble, selection, insertion, merge, quick and heap sorting
Asymptotic notation: Big O, Omega and Theta
Time and space complexity
Divide-and-conquer, greedy and dynamic programming
Graph algorithms, shortest paths and spanning trees
Tractable and intractable problems
Basic concepts of P, NP, NP-hard and NP-complete problems
Unit 6
Operating systems
Operating-system functions and types
Processes, threads and process states
CPU scheduling algorithms
Inter-process communication and synchronization
Race conditions, semaphores and critical sections
Deadlock conditions, prevention and avoidance
Paging, segmentation and virtual memory
File systems, disk management and disk scheduling
Unit 7
Database management systems and SQL
Database concepts and types of DBMS
ER diagrams and relational data models
Super, candidate, primary and foreign keys
Relational algebra fundamentals
Functional dependencies and normalization
SQL data definition and data manipulation commands
Queries, joins, grouping, subqueries and views
Transactions, ACID properties and concurrency control
Indexes, file organization and database security
Unit 8
Computer networks
LAN, MAN, WAN, PAN and network topologies
Transmission media and communication modes
OSI and TCP/IP reference models
Ethernet, switching and basic wireless networking
IPv4, IPv6, subnetting and address classes
Routing principles and common routing algorithms
TCP, UDP and common application protocols
Network devices and basic troubleshooting
Unit 9
Software engineering
Software characteristics and the software crisis
Software Development Life Cycle
Waterfall, prototyping, spiral and agile models
Requirements analysis and software specification
Modularity, cohesion, coupling and design principles
White-box and black-box testing
Verification, validation and quality assurance
Software maintenance and project estimation basics
Unit 10
Theory of computation and compiler fundamentals
Sets, relations, functions and mathematical logic
Regular expressions, DFA and NFA
Context-free grammars and pushdown automata
Turing machines, decidability and language classes
Compiler phases and language processors
Lexical analysis, parsing and syntax trees
Intermediate code generation and basic optimization
Unit 11
Web technologies and internet fundamentals
Client-server architecture and web browsers
HTML structure, forms, tables and semantic elements
CSS selectors, layout and responsive design
JavaScript fundamentals and DOM concepts
HTTP, HTTPS, URLs, DNS and web hosting
XML, JSON and web APIs
Sessions, cookies and basic web application architecture
Unit 12
Cybersecurity, ethics and emerging technology
Security goals: confidentiality, integrity and availability
Malware, phishing, social engineering and common attacks
Authentication, authorization and access control
Symmetric and asymmetric encryption
Hashing, digital signatures and digital certificates
Firewalls, antivirus tools and secure networking
Privacy, intellectual property, plagiarism and cyber law
Cloud computing, artificial intelligence and IoT basics
Teacher-focused preparation: ICT in education, digital learning tools, assessment methods, inclusive technology use and safe classroom computing are useful professional topics. However, they should not replace the core Computer Science units unless the current BPSC notification explicitly assigns them weight.
What the official Computer Science paper indicates
Previous-paper analysis is useful because it shows the depth at which a broad topic can be tested. The official BPSC Computer Science booklet reviewed for this guide contains questions ranging from direct facts to applied concepts.
Area
Examples of concepts seen in the official paper
How to prepare
Digital logic
Universal gates, truth-table size, flip-flop triggering and binary logic operations
Practice truth tables and short circuit-based calculations, not only definitions.
Algorithms and data structures
NP-complete problems, array properties and basic data-structure operations
Learn operation complexity and compare when each structure is appropriate.
Operating systems
Types of operating systems, memory-management methods, file systems, disk scheduling and threads
Solve scheduling and memory examples in addition to revising terminology.
DBMS and SQL
DBMS types, primary keys, normal forms and SQL insertion commands
Practice SQL syntax, keys, normalization and transaction concepts together.
A productive preparation method is to study a concept, solve objective questions without notes, examine every incorrect option and then revise the underlying topic. Memorising only the final answer is unlikely to help when BPSC changes the wording or applies the same concept in a different situation.
A practical six-week revision plan
Week
Primary topics
Practice target
1
Computer fundamentals, number systems, digital logic and architecture
Create formula/truth-table notes and solve topic-wise MCQs.
2
Programming, object-oriented concepts and data structures
Trace short programs and compare operations across structures.
3
Algorithms, complexity and operating systems
Work through sorting, scheduling, paging and disk problems.
4
DBMS, SQL and computer networks
Write SQL queries and practise subnetting and protocol questions.
5
Software engineering, TOC, compilers, web and security
Revise comparison tables and solve mixed-topic question sets.
6
Language, General Studies and full-paper revision
Attempt timed papers, maintain an error log and revise weak units.
Revision priorities
Complete the core concepts before attempting full mock tests.
Give extra revision time to digital logic, data structures, algorithms, operating systems and DBMS.
Do not ignore Language and General Studies simply because Computer Science carries the largest subject share.
Use official BPSC question booklets to understand wording, option style and time pressure.
Keep a separate list of factual errors, confused concepts and formulas that require repeated revision.
Official sources and verification
Candidates should verify every time-sensitive detail on the BPSC website. Exam dates, vacancies, eligibility, language rules, qualifying requirements and marking instructions may change between recruitment cycles.
BPSC Archived News - use the archive to locate School Teacher advertisements, notices and corrigenda for the relevant recruitment cycle.
BPSC Exam Calendar - check the latest tentative schedule and subsequent notices.
ExamRig is an independent educational platform and is not affiliated with or endorsed by the Bihar Public Service Commission. If this page differs from an official BPSC notification, the official notification must be followed.
Frequently asked questions
Is this the verbatim BPSC TRE Computer Science syllabus?
No. It is a preparation-oriented breakdown created from official BPSC recruitment material, the official Computer Science question booklet and standard Computer Science subject areas. BPSC's latest notification remains authoritative.
How many Computer Science questions are in the verified paper?
In the official 2024 Computer Science booklet reviewed here, Part III contains Question 71 through Question 150, giving 80 Computer Science questions within a 150-question paper.
Which subjects should I study first?
Begin with digital logic and architecture, programming, data structures, algorithms, operating systems and DBMS. These areas form the foundation for many other topics and are visible in official previous-paper questions.
Should I prepare only Computer Science?
No. The verified paper also contains a qualifying Language part and a General Studies part. A candidate who ignores these sections may lose marks or fail to meet a qualifying requirement even after preparing the subject section well.
Is the TRE-4 Computer Science syllabus final?
Candidates should wait for and follow the detailed TRE-4 advertisement, syllabus notice and corrigenda issued by BPSC. Until then, earlier official material is useful for preparation but should not be described as a guaranteed final TRE-4 syllabus.