BPSC TRE 4.0 Computer Science: Complete Strategy, Negative Marking Rules & Topic Weightage

Understanding the BPSC TRE 4.0 Computer Science Pattern

The Bihar Public Service Commission (BPSC) conducts TRE examinations with specific weighting across Computer Science topics. Understanding which topics carry maximum marks is the key to securing victory in the upcoming recruitment.

1. The High-Weightage Units (Over 60% of Subject Questions)

Based on our empirical analysis of BPSC TRE 1.0, 2.0, and 3.0:

DBMS & SQL (27 Questions): Keys, Normalization (1NF to BCNF), SQL Joins, Triggers, ACID properties.

Digital Electronics (25 Questions): Logic gates, K-Maps, Flip-Flops, Multiplexers, Number Systems conversions.

Computer Organization & Architecture (24 Questions): Addressing modes, Cache memory mapping, Pipelining, Instruction formats.

Computer Networks (23 Questions): OSI layers, IP addressing (Subnetting & CIDR), TCP/UDP headers, Routing protocols.

C++ & Object Oriented Programming (20 Questions): Constructors/Destructors, Virtual functions, Inheritance hierarchies, Operator overloading.

2. Official TRE 4.0 Negative Marking Scheme

Candidates must carefully note the revised marking rules:

Correct Answer: +1.0 Mark

Wrong Answer: -0.33 Mark (One-third negative penalty)

Option E (Unattempted): 0.0 Mark (No penalty)

Left Blank (Unbubbled): -0.33 Mark (Penalty for incomplete bubbles)

3. Preparation Strategy

1.Solve Topic-Wise Sets First: Complete each of the 19 units systematically.

2.Review Explanations: Do not just check right or wrong—read the step-by-step logic.

3.Attempt Timed Mocks: Train yourself to bubble 'Option E' when you don't know the answer rather than leaving it blank or guessing blindly!