Bihar STET Computer Science Syllabus 2025 & Exam Pattern (Paper 2)
Detail Information about Bihar STET: Computer Science (Paper 2) vacancies, eligibility, exam pattern, and the complete unit-wise syllabus. This structured guide reduces anxiety and gives you a clear starting point.
Bihar STET Syllabus 2025 — Overview
| Conducting Body | Bihar School Examination Board (BSEB) |
|---|---|
| Exam Name | Secondary Teachers Eligibility Test (STET) — Computer Science |
| Frequency | Once a year |
| Exam Level | State-level |
| Category | Syllabus & Exam Pattern |
| Total Papers | 2 |
| Paper Level | Paper 2 for Class 11–12 |
| Job Location | Bihar |
| Official Website | secondary.biharboardonline.com |
Bihar STET Paper 2 Computer Science — Exam Pattern 2025
Negative Marking: No | Duration: 150 Minutes
| Subject | No. of Questions | Marks |
|---|---|---|
| Specific Subject (Computer Science) | 100 | 100 |
| Art of Teaching | 30 | 30 |
| General Knowledge | 5 | 5 |
| Environmental Science | 5 | 5 |
| Mathematical Aptitude | 5 | 5 |
| Logical Reasoning | 5 | 5 |
| Total | 150 | 150 |
Unit I — Computer Science Syllabus (100 Marks)
Unit 1: Digital Logic
- Number systems: Binary, Octal, Hexadecimal; conversions; BCD, ASCII, EBCDIC, Gray
- Boolean algebra, Venn diagram, Logic gates; SOP/POS; K-map minimization
- Combinational circuits: Adder/Subtractor, Encoder/Decoder, Comparator, Mux/Demux, Parity
- Sequential circuits: SR, JK, D, T; Registers, Counters, State tables & diagrams
- A/D & D/A conversion; Logic families: TTL, ECL, MOS, CMOS
Unit 2: Computer Organization & Architecture
- Data representation, error detection/correction (Parity, Checksum, Hamming)
- CPU, Address/Data/Control buses; Memory (RAM/ROM/EPROM/EEPROM)
- ALU, Half/Full Adder, 2’s complement adder-subtractor; K-Map
- Digital electronics & logic gates; Universal gates; Basics of microprocessors/controllers
Unit 3: Programming & Data Structures
- Algorithms, asymptotic notations, order of growth
- Arrays (1-D/2-D), recursion & backtracking (e.g., Tower of Hanoi)
- Linked lists (singly/doubly/circular), polynomial ops
- Stacks & queues (array/linked), postfix evaluation, iteration vs recursion
- Searching (seq/binary/hash) & collisions; Sorting (Insertion/Selection/Bubble/Heap/Counting/Bucket)
- Graphs (adjacency matrix/list), DFS/BFS; Trees, BST, AVL, B-Trees, traversals
Unit 4: Algorithms
- Time–space trade-off; Big-O properties; conditional asymptotics
- Recurrences; linear search analysis
- Divide & Conquer: Binary Search, Max–Min, Merge Sort
- Dynamic Programming: Multistage graphs, APSP, Optimal BST
- Backtracking: 8-Queens, Hamiltonian
- Connected/Biconnected components; Spanning trees; NP-Hard & NP-Complete (intro)
Unit 5: Operating System
- Functions, types, layered structure, I/O & interrupts
- Processes, states, context switch, scheduling
- Synchronization: semaphores, monitors; deadlocks & solutions
- Memory: relocation, partitioning, swapping, paging/segmentation, virtual memory
- Files & I/O subsystems; security & protection models
Unit 6: Database Management Systems
- DBMS vs file systems; 3-level architecture
- Relational & ER models; keys; schema design
- Normalization: 1NF, 2NF, 3NF, BCNF
- Transactions, ACID, concurrency control, locking, timestamp ordering, 2-phase commit
Unit 7: Computer Networks
- Data communication, topologies, bandwidth, encoding, compression, impairments
- OSI/TCP-IP; Data Link (flow/error control, MAC)
- Network layer: routing, congestion, IPv4, ARP, PPP, subnetting, classless addressing, bridges/routers
- Transport: sockets, multiplexing, UDP/TCP
- Applications: HTTP, FTP, Telnet, SMTP, SNMP
Unit 8: Software Engineering
- SE characteristics, metrics; SDLC models: Waterfall, Prototype, Spiral
- Estimation: LOC, FP, COCOMO; Halstead; Putnam
- SRS, function-oriented design (DFD/structured design), intro to OOD
- Testing: unit/black-box/white-box; reliability; QA: ISO 9000, SEI CMM
- Maintenance & reverse engineering
Unit 9: Object-Oriented Programming
- Classes/objects, abstraction, encapsulation
- Constructors/destructors, namespaces, references, method overloading
- Inheritance, polymorphism, abstract classes/methods
- Exceptions & handling
Unit 10: Web-Based Application Development
- Internet basics, HTML, CSS, JavaScript, jQuery, DOM
- XML, DTD, PHP, MySQL, sessions/forms
- Node.js, Git; integrating PHP & MySQL
Unit 11: Theory of Computation
- DFA/NFA, ε-NFA, equivalence & minimization
- Regular expressions, Arden/Kleene, pumping lemma, closure & decision properties
- Moore/Mealy machines & equivalence
- CFG/CFL: ambiguity, CNF/GNF, closure/decision, pumping lemma
- PDA, CFG↔PDA; Turing machines, decidability, PCP
Unit 12: Internet of Things (IoT)
- Architecture, middleware, information security
- Standards/protocols: IEEE 802.15.4, BACnet, Modbus, KNX, Zigbee
- Web of Things vs IoT; Cloud of Things
- Industrial IoT, security & safety, runtime monitoring
Unit 13: Artificial Intelligence
- Search strategies: hill-climb, BFS/DFS; heuristic functions
- Knowledge representation: predicate logic, frames, rules
- Inference: forward/backward chaining, Bayesian, D-S, fuzzy
- Planning; intro to ML
- Expert systems (architecture, shells, examples)
Unit 14: Fundamentals of E-Commerce
- Framework, the I-way, network access equipment
- Internet architecture/NSFNET, governance
- Security & firewalls, data/message security, email encryption
- WWW architecture for commerce; consumer/merchant models
- E-payments (tokens, smart cards, credit cards), threats
- EDI, legal/security/privacy issues; corporate digital libraries & data warehouses
Unit 15: Multimedia
- Concepts, hardware/software, CD-ROM/DVD
- Audio: recording/editing, MIDI, formats; Text
- Graphics: imaging, scanning, formats
- Animation: kinematics, morphing, tools; Video standards & production
- Project stages, team, costing; future trends
Unit II — Art of Teaching & Other Skills (50 Marks)
Art of Teaching (30 Marks)
- Teaching & Learning: meaning, process, characteristics
- Objectives: instructional objectives, Bloom’s Taxonomy
- Teaching methods: types, merits/demerits
- Lesson planning: types, formats, models
- Microteaching & instructional analysis
- Classroom ecosystem & management; textbooks & library
- Qualities of a teacher; evaluation & assessment; curriculum
- Factors affecting teaching/learning; teaching aids & hands-on learning
Other Skills (20 Marks)
- General Knowledge: Indian History/Geography/Economy, Bihar & National Movement, Current Affairs
- Environmental Science: Pollution, Solid Waste, Deforestation, Global Warming, Flora & Fauna
- Mathematical Aptitude: Area, Average, CI, Fractions, LCM/HCF, Heights & Distances
- Logical Reasoning: Analogy, Classification, Series, Coding-Decoding, Blood Relations
FAQs — Bihar STET Computer Science Syllabus
Is there negative marking in Paper 2 (CS)?
No, there is no negative marking in Bihar STET Paper 2.
What is the exam duration?
The duration is 150 minutes (2.5 hours).
How many marks are for Computer Science?
100 marks for Unit I (Computer Science).
Where can I get Previous Papers & Mock Tests?
Use these pages: Previous Papers and Mock Tests.