Haryana PGT CS 2025 Question Paper
- Year 2025
- Conducted By Haryana Government
- Questions 15
- Maximum Marks 150
- Duration 3 Hours
Exam Details
| Detail | Information |
|---|---|
| Examination | Post Graduate Teachers (PGTs) |
| Year | 2025 |
| Conducting Body | Haryana Government |
| Paper | Computer Science |
| Subject | Computer Science |
| Duration | 3 Hours |
| Maximum Marks | 150 |
| Number of Questions | 15 |
This dataset combines Page 1 and Page 2 OCR from the Haryana Government's Post Graduate Teachers (PGTs) Computer Science examination 2025. Page 1 presents the exam header, maximum marks (150), duration (3 hours), and paper-specific instructions; it confirms a total of 15 questions. Page 2 shows five descriptive questions (repair OCR) addressing core topics: nested comments and language parsing, formal language theory and regular expressions, graph cycles and circuits, the end-to-end principle in network design, NATs/firewalls, and Python's multi-paradigm support. The merged content yields a complete SEO-friendly overview: details of the exam structure, a ready-to-use question sample set, and topic-oriented SEO signals for search engines. The objective questions preview extracted from Page 2 is included for mapping to the overall exam structure. This metadata supports better indexing and discovery for candidates seeking Haryana PGT CS 2025 materials.
Major Topics Covered
- Nested comments in programming languages
- Regular expressions and automata
- Formal languages and automata theory
- Language L with equal substrings
- Regular languages
- Context-free languages
- Graph theory: cycles and circuits
- Directed vs undirected graphs
- Deadlock detection
- Scheduling
- Electronic circuit design
- End-to-end principle in networking
- NATs and firewalls
- Middleboxes
- Internet architecture
- Python programming paradigms
- Maintainability
- Large-scale software systems
- Language theory
- Substrings in formal languages
Why This Paper is Important
- Useful for Post Graduate Teachers (PGTs) preparation
- Helps understand the latest exam pattern
- Useful for practice and self-assessment
- Covers frequently asked General Studies topics
- Helpful for analysing question trends
Related Resources
Instructions
- 33A CANDIDATE COPY 2025 Roll No. Maximum Marks: 150 Time: 3 hours समय : 3 घंटे अधिकतम अंक: 150
- प्रश्न पत्र के लिए विशिष्ट अनुदेश (Please read the following instructions carefully before attempting questions) (कृपया प्रश्नों का उत्तर देने से पहले निम्नलिखित निर्देशों को ध्यान से पढ़ें) There are fifteen (15) questions in all.
- कुल पंद्रह (15) प्रश्न हैं। All questions are compulsory.
- सभी प्रश्न अनिवार्य हैं। No extra/additional sheet will be provided.
- कोई अतिरिक्त / विशेष शीट प्रदान नहीं की जाएगी। Answer must be written in the authorized medium.
- No marks will be given for
- answers written in a medium other than the authorized one. उत्तर अधिकृत माध्यम में ही लिखना होगा। अधिकृत माध्यम के अलावा किसी अन्य माध्यम में लिखे गए उत्तरों के लिए कोई अंक नहीं दिए जाएंगे। All questions carry equal marks i.e. 10 each.
- सभी प्रश्न समान अंक वाले हैं, अर्थात प्रत्येक 10 अंक का है। Each Question should be answered within the space provided for that particular
- question. Otherwise, the answer given will not be evaluated. प्रत्येक प्रश्न का उत्तर उसके लिए निर्धारित स्थान पर ही लिखा जाए।अन्यथा, दिए गए उत्तर का मूल्यांकन नहीं किया जाएगा। 33A 2025
Questions (page 2)
Q1. CANDIDATE COPY a Rango ta Maja Consider a programming language that allows nested comments in the 1. following format: comments begin with "(*" and end with "*)", and they may be arbitrarily nested (i.e., a comment may contain another properly formed comment). For example, "(* comment (* nested *) still in comment *)" is valid. Write a detailed justification of whether such a language feature can be handled by a regular expression-based lexical analyzer (i.e., finite automata), or if a more powerful mechanism is required. Explain your reasoning based on formal language theory. 10 Marks Let L be a language over the alphabet \a, b\ such that L = \{ w ∈ \a, b\ \mid w has
Q2. an equal number of substrings "ab" and "ba" }. Is L regular, context-free, or neither? Justify your answer. 10 Marks Distinguish between cycles and circuits in both directed and undirected graphs. 3. Explain how the detection of these structures varies depending on graph type and representation. Also explain how cycle detection plays a critical role in applications such as deadlock detection, scheduling, and electronic circuit design. 10 Marks Explain the end-to-end principle in network design. Evaluate its impact on the evolution 4. of the Internet architecture and its interaction with middleboxes such as NATs and firewalls. Discuss how the proliferation of these intermediary devices challenges the principle, and critically assess whether the modern Internet still adheres to the end-to-end philosophy. Reflect on the future implications of this shift for protocol design and innovation. 10 Marks Python supports multiple programming paradigms - procedural, object-oriented, and 5. functional. Critically evaluate how Python achieves this flexibility, and discuss the design consequences of supporting such diverse paradigms. How do these features influence maintainability, performance, and software architecture, particularly in large-scale systems or collaborative development environments? 10 Marks 33A 2025 \overline2
Q2. an equal number of substrings "ab" and "ba" }. Is L regular, context-free, or neither? Justify your answer. 10 Marks Distinguish between cycles and circuits in both directed and undirected graphs. 3. Explain how the detection of these structures varies depending on graph type and representation. Also explain how cycle detection plays a critical role in applications such as deadlock detection, scheduling, and electronic circuit design. 10 Marks Explain the end-to-end principle in network design. Evaluate its impact on the evolution 4. of the Internet architecture and its interaction with middleboxes such as NATs and firewalls. Discuss how the proliferation of these intermediary devices challenges the principle, and critically assess whether the modern Internet still adheres to the end-to-end philosophy. Reflect on the future implications of this shift for protocol design and innovation. 10 Marks Python supports multiple programming paradigms - procedural, object-oriented, and 5. functional. Critically evaluate how Python achieves this flexibility, and discuss the design consequences of supporting such diverse paradigms. How do these features influence maintainability, performance, and software architecture, particularly in large-scale systems or collaborative development environments? 10 Marks 33A 2025 \overline2
Q3.
3. Distinguish between cycles and circuits in both directed and undirected graphs.
Explain how the detection of these structures varies depending on graph type and representation.
Also explain how cycle detection plays a critical role in applications such as deadlock detection, scheduling, and electronic circuit design.
Q4.
4. Explain the end-to-end principle in network design.
Evaluate its impact on the evolution of the Internet architecture and its interaction with middleboxes such as NATs and firewalls.
Discuss how the proliferation of these intermediary devices challenges the principle, and critically assess whether the modern Internet still adheres to the end-to-end philosophy.
Reflect on the future implications of this shift for protocol design and innovation.
Q5.
5. Python supports multiple programming paradigms - procedural, object-oriented, and functional.
Critically evaluate how Python achieves this flexibility, and discuss the design consequences of supporting such diverse paradigms.
How do these features influence maintainability, performance, and software architecture, particularly in large-scale systems or collaborative development environments?
Question paper preview
Scanned pages 1–2 for reference. Download the official PDF for the full paper.
Free question paper download
Download question paper PDF
Your download starts in 10s
Preparing your question paper file…
Frequently asked questions
What is the exam name and year?
Post Graduate Teachers (PGTs), Computer Science, 2025.
How many questions are in the paper and how many marks per question?
There are 15 questions in total, each carrying 10 marks, for a maximum of 150 marks.
What is the duration of the exam?
The exam duration is 3 hours.
From which region is the paper?
Haryana Government Jobs region.
Which languages are used in the paper?
The paper uses Hindi and English.
What is included on Page 1 of the paper?
Page 1 includes the exam header, time, maximum marks, and paper-specific instructions.