HPSC PGT Computer Science Recruitment 2026

Are you an aspiring educator with a passion for Computer Science and a dream of securing a prestigious government job in Haryana? Look no further! The Haryana Public Service Commission (HPSC) has announced a golden opportunity for eligible candidates to join as Post Graduate Teachers (PGTs) in Computer Science for both the Rest of Haryana Cadre and Mewat Cadre. This is your chance to make a significant impact on students' futures while building a stable and rewarding career.

With a whopping 1672 vacancies, HPSC PGT Computer Science Recruitment 2026 promises a fantastic career path with an attractive salary package. The online application process begins on February 16, 2026, and the last date to apply is March 09, 2026. Don't miss this opportunity to contribute to the education sector of Haryana and achieve your sarkari naukri aspirations!

🎯 Quick Highlights

• Organization: Haryana Public Service Commission (HPSC)
• Post Name: Post Graduate Teachers (PGT) - Computer Science
• Total Vacancies: 1672 Posts
• Salary: Rs. 47,600 - 1,51,100/- (Level 8) 💰
• Application Start Date: 📅 16 February 2026
• Application Last Date: 📅 09 March 2026 (till 05:00 PM) - Apply Soon!
• Job Location: Haryana

📋 Vacancy Details

A total of 1672 vacancies have been announced for PGT Computer Science across two cadres:

Rest of Haryana (ROH) Cadre - PGT Computer Science

Category	Total Posts	Female (33% Horizontal Reservation)	ESM	PwBD
General (Gen) / UR	859	277	45	-
SC	327	108	16	-
BC-A (Non Creamy Layer)	163	54	8	-
BC-B (Non Creamy Layer)	82	27	4	-
EWS	163	-	-	-
PwBD (VH)	-	-	-	17
PwBD (OH)	-	-	-	17
PwBD (HH)	-	-	-	16
PwBD (ID/MD)	-	-	-	9
Total ROH Cadre	1594	466 (Total for Females)	73 (Total for ESM)	59 (Total for PwBD)

Mewat Cadre - PGT Computer Science

Category	Total Posts	Female (33% Horizontal Reservation)	ESM	PwBD
General (Gen) / UR	43	14	2	-
SC	15	5	1	-
BC-A (Non Creamy Layer)	8	3	0	-
BC-B (Non Creamy Layer)	4	1	0	-
EWS	8	-	-	-
PwBD (VH)	-	-	-	1
PwBD (OH)	-	-	-	1
PwBD (HH)	-	-	-	1
PwBD (ID/MD)	-	-	-	0
Total Mewat Cadre	78	23 (Total for Females)	3 (Total for ESM)	3 (Total for PwBD)

Note: The bifurcation of SC category posts into DSC/OSC will be announced later. The number of posts is liable to variation.

✅ Eligibility Criteria

Age Limit:

Candidates must be between 18 and 42 years of age as of the closing date of application, i.e., 09 March 2026. Age relaxation is applicable for reserved categories as per Haryana Government rules:

• Scheduled Castes (SC) of Haryana: 5 years
• Backward Classes (BC) of Haryana: 5 years
• Disabled Persons (PwBD) of Haryana: 5 years (+ additional 5 years if belonging to SC/ST/BC/EWS category, subject to a maximum age of 52 years for Group A & B posts).
• Wife of Military Personnel Disabled in Service: 5 years
• Widowed or Legally Divorced Woman: 5 years
• Judicially Separated Woman: 5 years (residing separately for over two years)
• Unmarried Woman: 5 years
• Ex-servicemen: Relaxation to the extent of military service rendered plus 3 years.
• Adhoc/Contract/Work-charged/Daily Wages Employees of Haryana Govt.: Age relaxation equal to the number of completed years on an equivalent post (maximum 52 years).

Note: Age relaxation for DSC/OSC/BC-A/BC-B/ESM is admissible only where posts are reserved for that category. The upper age limit for any applicant (except Ex-servicemen) shall not exceed 52 years.

Educational Qualification:

Applicants must possess the following essential qualifications as of the closing date (09.03.2026):

1. M.Sc. Computer Science (Regular two-year course) / MCA (Regular three-year course) / BE/B.Tech. Computer Science / Computer Engg. / IT (Regular course) from a recognized university with at least 55% aggregate marks.
2. Matric with Hindi / Sanskrit or 10+2/B.A./M.A. with Hindi as one of the subjects.
3. Certificate of having qualified Haryana Teachers Eligibility Test (HTET) / School Teachers Eligibility Test (STET).
4. Consistent good academic record. (As per Service Rules, this means having 50% marks after averaging any three examinations from 10th/12th/Graduation/Post Graduation, and at least 55% marks in Post-Graduation/Graduation).

SC and PwBD candidates are allowed a 5% relaxation in qualifying marks (minimum 52.25%).

💰 Salary & Benefits

Selected Post Graduate Teachers (PGT) in Computer Science will be entitled to a highly attractive salary package. The scale of pay is Rs. 47,600 - 1,51,100/-, which corresponds to Pay Level 8 as per the 7th Central Pay Commission (CPC) matrix. In addition to the basic pay, candidates will also receive usual allowances as applicable from time to time by the Haryana Government, making it a lucrative sarkari naukri opportunity. This includes Dearness Allowance (DA), House Rent Allowance (HRA), Transport Allowance (TA), and other benefits, ensuring a comprehensive compensation package.

📝 Selection Process

The HPSC PGT Computer Science selection process is rigorous and designed to identify the most competent candidates. It comprises three main stages:

1. Stage 1: Screening Test (100 Marks)
   • Total MCQs: 100
   • Time Duration: 02 hours
   • Total Marks: 100
   • Question Type: All questions carry equal marks, with five options (A, B, C, D, E). Candidates must darken A, B, C or D for attempted questions, and E for unattempted questions.
   • Negative Marking: 0.25 marks deducted for each wrong answer.
   • Language: English only.
   • Qualification: Minimum 25% marks required to qualify for the Subject Knowledge Test.
   • Shortlisting: Candidates 4 times the number of advertised posts (including bracketed candidates) will be called for the next stage.
   • Note: Marks from the Screening Test will NOT be counted for final selection; it is purely for shortlisting.
2. Stage 2: Subject Knowledge Test (150 Marks)
   • Time Duration: 03 hours
   • Total Marks: 150
   • Language: English only.
   • Syllabus: Detailed subject-wise syllabus is provided in Annexure-I (see below).
   • Qualification: Minimum 35% marks required to qualify for the Interview.
   • Weightage: This test carries a significant weightage of 87.5% in the final merit list.
   • Shortlisting: Candidates 2 times the number of advertised posts (including bracketed candidates) will be called for the Interview.
3. Stage 3: Interview / Viva-Voce
   • This stage carries a weightage of 12.5% in the final merit list.
   • The final merit list will be prepared by adding the marks obtained in the Subject Knowledge Test and the Interview/Viva-Voce.

The Commission reserves the right to directly call candidates for the Subject Knowledge Test without conducting a Screening Test.

💳 Application Fee

The application fee must be paid online via Net Banking, Debit Card, or Credit Card by the closing date (09.03.2026, 05:00 PM). Fees once paid are non-refundable.

Sr. No.	Category of Candidates	Fee (Rs.)
1.	Persons with Benchmark Disabilities (PwBD) of Haryana (with at least 40% disability)	NIL
2.	DSC, OSC, BC-A (Non Creamy Layer), BC-B (Non Creamy Layer), ESM, EWS, and all women candidates of Haryana	250/-
3.	DESM Candidates of Haryana belonging to their vertical category (DSC, OSC, BC-A (Non Creamy Layer), BC-B (Non Creamy Layer), ESM, EWS of Haryana)	250/-
4.	DESM Candidates of Haryana belonging to UR Category	1000/-
5.	All Remaining Candidates	1000/-

📅 Important Dates

Event	Date
Date of Publication	05 February 2026
Opening Date for Online Applications	16 February 2026
Closing Date for Online Applications	09 March 2026 (upto 05:00 PM)
Closing Date for Deposit of Fee	09 March 2026 (upto 05:00 PM)

🔗 How to Apply Online

Applying for the HPSC PGT Computer Science 2026 recruitment is a straightforward 4-stage online process. Follow these steps carefully to ensure a successful application:

1. Visit the Official HPSC Website: Go to http://hpsc.gov.in.
2. Registration: Click on the "Apply Online" link for Advertisement No. 23/2026. Register using your Mobile Number & Aadhar Number. If your Aadhar data is not updated, use your Mobile Number for registration. A Login ID will be created.
3. Fill Application Form: Log in with your credentials and accurately fill in all particulars in the online application form. Ensure all details like name, father's/mother's name, DOB, category, qualifications, marks, etc., are correct as no changes will be allowed after final submission.
4. Upload Documents: Upload scanned copies of your photo, signature, educational degrees/mark sheets, caste/reservation certificates (if applicable, valid for 2025-26), HTET/STET certificate, Aadhar card, Haryana Domicile, and any experience certificates.
5. Pay Application Fee: Proceed to pay the requisite application fee online as per your category.
6. Print & Upload Signed Form: After making payment, take a printout of the application form, sign it, and then upload the signed copy online. This is mandatory; incomplete applications will be rejected.
7. Final Submission: Carefully review all entered data before final submission. It is advisable to take another printout of the finally submitted application form for your records.

Note: Submit only one application. If multiple applications are submitted, only the one with the highest/latest application number will be considered, and fees for other applications will not be adjusted or refunded.

💡 Important Tips

• Read Notification Carefully: Before applying, thoroughly read the official notification to understand all terms, conditions, and eligibility criteria.
• Prepare Documents: Keep all necessary documents (educational certificates, caste certificates, HTET/STET, Aadhar, photo, signature) ready in scanned format before starting the application process. Ensure reservation certificates are valid for 2025-26.
• Check Eligibility: Double-check that you meet all age, educational, and other eligibility criteria on or before the closing date. Certificates issued after the closing date will not be accepted.
• Accurate Information: Fill in the application form with 100% accurate information. No changes will be allowed after final submission.
• Active Contact Details: Ensure your mobile number and email ID remain active throughout the selection process for important communications.
• Practice Mock Tests: Familiarize yourself with the exam pattern and syllabus. Practice mock tests to improve speed and accuracy, especially given the negative marking.
• Syllabus Focus: Give special attention to the Subject Knowledge Test syllabus (Computer Science) as it carries the highest weightage.

📚 PGT Computer Science Syllabus (Annexure-I)

The detailed syllabus for the PGT Computer Science exam is crucial for preparation. It covers a wide range of topics to test comprehensive knowledge in the field:

Computer Systems and Organisation

• Basic Computer Organisation: Introduction to computer system, hardware, software, input device, output device, CPU, memory (primary, cache and secondary), units of memory (Bit, Byte, KB, MB, GB, TB, PB).
• Types of Software: System software (operating systems, system utilities, device drivers), programming tools and language translators (assembler, compiler & interpreter), application software.
• Operating System (OS): Functions of operating system, OS user interface.
• Boolean Logic: NOT, AND, OR, NAND, NOR, XOR, truth table, De Morgan’s laws and logic circuits.
• Number System: Binary, Octal, Decimal and Hexadecimal number system; conversion between number systems.
• Encoding Schemes: ASCII, ISCII and UNICODE (UTF8, UTF32).

Computational Thinking and Programming

• Introduction to Problem Solving: Steps for problem solving (analysing the problem, developing an algorithm, coding, testing and debugging). Representation of algorithms using flowchart and pseudo code, decomposition.
• Familiarization with the Basics of Python Programming: Introduction to Python, features of Python, executing a simple “hello world” program, execution modes: interactive mode and script mode, Python character set, Python tokens (keyword, identifier, literal, operator, punctuator), variables, concept of l-value and r-value, use of comments.
• Knowledge of Data Types: Number (integer, floating point, complex), Boolean, sequence (string, list, tuple), none, mapping (dictionary), mutable and immutable data types.
• Operators: Arithmetic operators, relational operators, logical operators, assignment operator, augmented assignment operators, identity operators (is, is not), membership operators (in, not in).
• Expressions, Statement, Type Conversion & Input/Output: Precedence of operators, expression, evaluation of expression, python statement, type conversion (explicit & implicit conversion), accepting data as input from the console and displaying output.
• Errors: Syntax errors, logical errors, runtime errors.
• Flow of Control: Introduction, use of indentation, sequential flow, conditional and iterative flow control.
• Conditional Statements: If, if-else, if-elif-else, flowcharts, simple programs: e.g.: absolute value, sort 3 numbers and divisibility of a number.
• Iterative Statements: For loop, range function, while loop, flowcharts, break and continue statements, nested loops, suggested programs: generating pattern, summation of series, finding the factorial of a positive number etc.
• Strings: Introduction, indexing, string operations (concatenation, repetition, membership & slicing), traversing a string using loops, built-in functions: len(), capitalize(), title(), lower(), upper(), count(), find(), index(), endswith(), startswith(), isalnum(), isalpha(), isdigit(), islower(), isupper(), isspace(), lstrip(), rstrip(), strip(), replace(), join(), partition(), split().
• Lists: Introduction, indexing, list operations (concatenation, repetition, membership & slicing), traversing a list using loops, built-in functions: len(), list(), append(), extend(), insert(), count(), index(), remove(), pop(), reverse(), sort(), sorted(), min(), max(), sum(); nested lists, suggested programs: finding the maximum, minimum, mean of numeric values stored in a list; linear search on list of numbers and counting the frequency of elements in a list.
• Tuples: Introduction, indexing, tuple operations (concatenation, repetition, membership & slicing), built-in functions: len(), tuple(), count(), index(), sorted(), min(), max(), sum(); tuple assignment, nested tuple, suggested programs: finding the minimum, maximum, mean of values stored in a tuple; linear search on a tuple of numbers, counting the frequency of elements in a tuple.
• Dictionary: Introduction, accessing items in a dictionary using keys, mutability of dictionary (adding a new item, modifying an existing item), traversing a dictionary, built-in functions: len(), dict(), keys(), values(), items(), get(), update(), del, clear(), fromkeys(), copy(), pop(), popitem(), setdefault (), max(), min(), count(), sorted(), copy(); suggested programs : count the number of times a character appears in a given string using a dictionary, create a dictionary with names of employees, their salary and access them.
• Introduction to Python Modules: Importing module using 'import <module>' and using from statement, Importing math module (pi, e, sqrt, ceil, floor, pow, fabs, sin, cos, tan); random module (random, randint, randrange), statistics module (mean, median, mode) Society, Law and Ethics.
• Digital Footprints: Digital society and Netizen: net etiquettes, communication etiquettes, social media etiquettes.
• Data Protection: Intellectual Property Right (copyright, patent, trademark), violation of IPR (plagiarism, copyright infringement, trademark infringement), open source softwares and licensing (Creative Commons, GPL and Apache).
• Cyber-crime: Definition, hacking, eavesdropping, phishing and fraud emails, ransomware, preventing cyber crime.
• Cyber Safety: Safely browsing the web, identity protection, confidentiality, cyber trolls and bullying.
• Safely Accessing Websites: Malware, viruses, trojans, adware.
• E-waste Management: Proper disposal of used electronic gadgets.
• Indian Information Technology Act (IT Act).
• Technology & Society: Gender and disability issues while teaching and using computers.

Computational Thinking and Programming (Continued)

• Functions: Types of function (built-in functions, functions defined in module, user defined functions), creating user defined function, arguments and parameters, default parameters, positional parameters, function returning value(s), flow of execution, scope of a variable (global scope, local scope).
• Introduction to Files: Types of files (Text file, Binary file, CSV file), relative and absolute paths.
• Text File: Opening a text file, text file open modes (r, r+, w, w+, a, a+), closing a text file, opening a file using with clause, writing/appending data to a text file using write() and writelines(), reading from a text file using read(), readline() and readlines(), seek and tell methods, manipulation of data in a text file.
• Binary File: Basic operations on a binary file: open using file open modes (rb, rb+, wb, wb+, ab, ab+), close a binary file, import pickle module, dump() and load() method, read, write/create, search, append and update operations in a binary file.
• CSV File: Import csv module, open / close csv file, write into a csv file using csv.writer() and read from a csv file using csv.reader().
• Data Structure: Stack, operations on stack (push & pop), implementation of stack using list.

Computer Networks

• Evolution of Networking: Introduction to computer networks, evolution of networking (ARPANET, NSFNET, INTERNET).
• Data Communication Terminologies: Concept of communication, components of data communication (sender, receiver, message, communication media, protocols), measuring capacity of communication media (bandwidth, data transfer rate), IP address, switching techniques (Circuit switching, Packet switching).
• Transmission Media: Wired communication media (Twisted pair cable, Co-axial cable, Fiber-optic cable), Wireless media (Radio waves, Micro waves, Infrared waves).
• Network Devices: Modem, Ethernet card, RJ45, Repeater, Hub, Switch, Router, Gateway, WIFI card.
• Network Topologies and Network Types: Types of networks (PAN, LAN, MAN, WAN), networking topologies (Bus, Star, Tree).
• Network Protocol: HTTP, FTP, PPP, SMTP, TCP/IP, POP3, HTTPS, TELNET, VOIP.

Database Management

• Database Concepts: Introduction to database concepts and its need.
• Relational Data Model: Relation, attribute, tuple, domain, degree, cardinality, keys (candidate key, primary key, alternate key, foreign key).
• Structured Query Language: Introduction, Data Definition Language and Data Manipulation Language, data type (char(n), varchar(n), int, float, date), constraints (not null, unique, primary key), create database, use database, show databases, drop database, show tables, create table, describe table, alter table (add and remove an attribute, add and remove primary key), drop table, insert, delete, select, operators (mathematical, relational and logical), aliasing, distinct clause, where clause, in, between, order by, meaning of null, is null, is not null, like, update command, delete command, aggregate functions (max, min, avg, sum, count), group by, having clause, joins: cartesian product on two tables, equi-join and natural join.
• Interface of Python with an SQL Database: Connecting SQL with Python, performing insert, update, delete queries using cursor, display data by using fetchone(), fetchall(), rowcount, creating database connectivity applications.

Introduction to Computer System (Repeated in source, merging with first instance)

• Introduction to Computer and Computing: Evolution of computing devices, components of a computer system and their interconnections, Input/output devices.
• Computer Memory: Units of memory, types of memory - primary and secondary, data deletion, its recovery and related security concerns.
• Software: Purpose and types - system and application software, generic and specific purpose software.

Data Structure & Algorithms

• Types of Data Structure: Array, stack, queues, linked lists heaps, trees, binary search tree.
• Searching Algorithms: Linear and Binary search.
• Sorting Algorithms: Bubble, Selection, Insertion, quick sort, merge sort and heap sort.
• Analysis of Algorithm: Asymptotic notation - Big - Oh (O), Omega and Theta notations.
• Graphs: Definitions, connected graphs, regular and bipartite graphs, cycles and circuits, spanning trees, breadth first search, Depth first search.

Operating Systems (O.S.)

• Functions of Operating Systems: Types of O.S.- multiprocessing, Multitasking, Multiprogramming, time sharing & distributed operating systems.
• Virtual memory, paging, segmentation & fragmentations.
• Mutual Exclusion, Lock-unlock, semaphores.
• C.P.U Scheduling, I/O scheduling, Resource scheduling, Scheduling algorithms.
• Deadlock & its handling.

Software Engineering

• Software, development life cycle (SDLC) introduction and various steps.
• SDLC Models:- waterfall, prototype, spiral, Agile.
• Data warehouse & Data mining: introduction and methodology.

Digital Logic & Circuits

• Number System and Codes.
• Combinational Logic Circuits: Digital Logic gates, Simplifications, Half and full address, encoders, Decoders and Multiplexers.
• Sequential Logic Circuits: Flip Flops, RAM and ROM.

Theory of Computation

• Automata Fundamentals: Finite Automata (F.A.), Deterministic F.A. & Non Deterministic F.A.
• Regular Expressions and Language.
• Context Free Grammar and Languages.
• Recursive Enumerable and non-Recursive Enumerable Language.

Compiler Design

• Introduction of a Compiler: Lexical Analyses Recognition of tokens, Minimizing DFA.
• Parsing and Parse trees: Rightmost and leftmost derivation, Bottom-up and Top-down parser.
• Intermediate code generation.
• Code Generation and Code optimization.

Introduction to the Emerging Trends

• Artificial Intelligence, Machine Learning, Natural Language Processing, Immersive experience (AR, VR), Robotics, Big data and its characteristics, Internet of Things (IoT), Sensors, Smart cities, Cloud Computing and Cloud Services (SaaS, IaaS, PaaS); Grid Computing, Block chain technology.

Database Query using SQL

• Math functions: POWER (), ROUND (), MOD ().
• Text functions: UCASE (), UPPER (), LCASE (), LOWER (), MID (), SUBSTRING (), SUBSTR (), LENGTH (), LEFT (), RIGHT (), INSTR (), LTRIM (), RTRIM (), TRIM ().
• Date Functions: NOW (), DATE (), MONTH (), MONTHNAME (), YEAR (), DAY (), DAYNAME ().
• Aggregate Functions: MAX (), MIN (), AVG (), SUM (), COUNT (); using COUNT (*).
• Querying and manipulating data using Group by, Having, Order by.

Website & Web Browsers

• Website: Introduction, difference between a website and webpage, static vs dynamic web page, web server and hosting of a website.
• Web Browsers: Introduction, commonly used browsers, browser settings, add-ons and plug-ins, cookies.