What is the selection process for HPSC PGT Computer Science 2025?

The selection process includes three stages: Screening Test, Subject Knowledge Test, and Interview/Viva-Voce.

Is the Screening Test score counted in the final merit list?

No, the Screening Test is qualifying in nature and its marks are not included in the final merit list.

What is the weightage of the Subject Knowledge Test in the final selection?

The Subject Knowledge Test carries 87.5% weightage in the final selection process.

What is the duration and marks of the Subject Knowledge Test?

It is a 3-hour descriptive exam with a total of 150 marks.

What topics are covered in the HPSC PGT Computer Science Syllabus 2025?

The syllabus includes Python Programming, Data Structures, DBMS, Operating Systems, Computer Networks, Software Engineering, Compiler Design, Theory of Computation, Cyber Safety, Emerging Trends in IT, and more.

What is the minimum qualifying mark for the Subject Knowledge Test?

Candidates must score at least 35% in the Subject Knowledge Test to qualify for the interview round.

HPSC PGT Computer Science Syllabus 2025, Check Exam Pattern

Table of Contents

The HPSC PGT Computer Science Syllabus 2025 has been released by the HPSC on their official website. As the HPSC PGT Computer Science exam date has been released, candidates are advised to check out the syllabus, exam pattern, marking scheme and other related and relevant information. Read the following article for the details HPSC PGT Computer Science Syllabus PDF download link.

HPSC PGT Computer Science Syllabus 2025

The HPSC PGT Computer Science Syllabus 2025 serves as the foundation for effective exam preparation, providing a clear roadmap of the topics and concepts candidates must master. Studying the syllabus thoroughly is essential because it helps aspirants understand the weightage of each subject area, prioritize their study plan, and focus on the core topics like Python programming, Data Structures, Operating Systems, and Computer Networks. It also ensures that candidates align their preparation with the expectations of the Haryana Public Service Commission, avoiding irrelevant content and saving valuable time. A deep understanding of the syllabus not only boosts confidence but also enhances accuracy and performance in the HPSC PGT Computer Science Exam.

HPSC PGT Computer Science Exam Pattern 2025

The HPSC PGT Computer Science Exam 2025 follows a three-stage selection process: Screening Test, Subject Knowledge Test, and Interview. The Screening Test consists of 100 MCQs, primarily based on the subject syllabus, along with questions on general awareness, pedagogy, and reasoning. It serves only as a qualifying stage, with marks not counted in the final selection. Shortlisted candidates then appear for the Subject Knowledge Test, which is a 3-hour exam carrying 150 marks and holds 87.5% weightage in the final merit. Those qualifying this stage are called for the Interview, which carries the remaining 12.5% weightage. The final selection is based on combined marks from the Subject Knowledge Test and the Interview.

HPSC PGT Computer Science Exam pattern 2025
Haryana HPSC PGT Exam Pattern	Total Marks/Questions	Weightage	Exam Type	Minimum Qualifying Marks
Screening Test	100	–	Objective	25%
Subject Knowledge Test	150	87.5%	Descriptive	35%
Interview	–	12.5%	–	–

HPSC PGT Computer Science 2025 Syllabus Detailed

The HPSC PGT Computer Science Syllabus 2025 covers a wide range of topics essential for teaching at the senior secondary level. It includes core computer science areas such as Programming with Python, Data Structures, Operating Systems, Computer Networks, Database Management, Software Engineering, Digital Logic, Compiler Design, and Theory of Computation. The syllabus also emphasizes practical aspects like Cyber Safety, Emerging IT Trends, and Pedagogical techniques relevant for effective teaching. This comprehensive syllabus ensures candidates are well-versed in both theoretical foundations and current technological advancements.

HPSC PGT Computer Science Syllabus 2025
Unit	Desciption
Computer Systems and Organisation	Basics of computer organisation: input/output devices, memory, motherboard, CPU. Number systems: binary, octal, hexadecimal, and their conversions. Boolean algebra and logic gates: AND, OR, NOT, NAND, NOR, XOR, XNOR. Types of software: system, application, utility, open-source and proprietary. Memory types: RAM, ROM, cache, secondary storage (HDD, SSD). Types of computers: micro, mini, mainframe, and supercomputers.
Computational Thinking and Programming (with Python)	Problem-solving and algorithmic thinking. Introduction to Python: syntax, variables, data types. Control structures: if-else, loops (for, while). Functions and recursion. Lists, tuples, dictionaries, sets in Python. String operations. File handling in Python. Error handling: try, except blocks. Data structures using Python: stack, queue, linked lists (basic operations).
Society, Law, and Ethics	Cyber safety: secure password practices, identity protection, cyberbullying. Cybersecurity concepts: phishing, malware, firewalls. Intellectual Property Rights (IPR), copyright, and licenses. Digital footprint and digital rights. Plagiarism and its implications. IT Act 2000 and its provisions.
Computer Networks	Introduction to computer networks and their need. Network types: LAN, MAN, WAN. Network topologies: bus, star, ring, mesh. Protocols: HTTP, TCP/IP, FTP. Wi-Fi, Bluetooth, cellular networks. Basics of transmission media: wired (twisted pair, coaxial, fiber) and wireless. IP address, DNS, and MAC address. Network security basics: firewalls, encryption, secure communication.
Database Management Systems (DBMS)	Introduction to DBMS and RDBMS. Concepts: tables, records, fields, primary key, foreign key. SQL: SELECT, INSERT, UPDATE, DELETE, JOIN, GROUP BY, ORDER BY. Basic and advanced SQL functions. Normalization: 1NF, 2NF, 3NF. Transactions and concurrency control. Database security and integrity.
Data Structures and Algorithms	Arrays, linked lists, stacks, queues. Trees: binary trees, BST. Graphs: representation and traversal (BFS, DFS). Sorting algorithms: bubble, selection, insertion, merge, quick. Searching: linear and binary search. Time and space complexity: Big-O notation.
Operating Systems	Basic functions and types of operating systems. Process management and scheduling. Memory management: paging, segmentation. File systems and directories. Deadlock and its prevention. User and kernel modes.
Software Engineering	Software Development Life Cycle (SDLC). Models: Waterfall, Agile, Spiral. Requirements analysis, design, coding, testing, maintenance. CASE tools. Software quality and metrics. Risk analysis and project management basics.
Digital Logic and Circuits	Logic gates and their truth tables. Combinational circuits: adders, subtractors, multiplexers, demultiplexers, encoders, decoders. Sequential circuits: flip-flops, counters, registers. Binary arithmetic: addition, subtraction, multiplication, division. Number system conversions. Boolean algebra simplification using Karnaugh Maps (K-Map).
Theory of Computation	Automata theory: finite automata, DFA, NFA. Regular expressions and languages. Context-free grammar and pushdown automata. Turing machines. Decidability and computability.
Compiler Design	Phases of compiler: lexical analysis, syntax analysis, semantic analysis, optimization, code generation. Lexical analyzer and regular expressions. Parsing techniques: LL, LR parsers. Syntax-directed translation. Intermediate code generation. Symbol tables and error handling.
Emerging Trends in IT	Artificial Intelligence and Machine Learning basics. Internet of Things (IoT) applications. Blockchain fundamentals. Cloud Computing: types of cloud, services (IaaS, PaaS, SaaS). Virtual Reality and Augmented Reality. Big Data and Data Analytics.
Educational Psychology and Pedagogy (for Teaching Aptitude)	Child development, inclusive education. Learning theories: behaviorism, constructivism, cognitivism. Motivation and classroom management. Assessment and evaluation techniques. ICT in teaching and learning. Teaching strategies and methodologies.

HPSC PGT Computer Science Syllabus 2025 PDF

The HPSC PGT Computer Science Syllabus 2025 PDF is provided below for download. Candidates should use it to guide their preparation, track progress, and ensure thorough coverage of all important topics for the exam.

HPSC PGT Computer Science Syllabus 2025 PDF
HPSC PGT Syllabus 2025 General Paper	Click Here to Download
HPSC PGT Computer Science Syllabus 2025	Click Here to Download