An entrance exam is conducted by Kerala Public Service Commission called KPSC HSST Computer Science/Computer Application Exam for the selection of candidates for the post of Higher Secondary school Teachers for the subjects of Computer Science or Computer Application. The exam is organized for filling the existing vacancies in various Government Higher Secondary Schools. Kerala Public Service Commission is an autonomous body functioning under Government of Kerala. Kerala Public Service Commission’s exams are considered to be tough. It is not so easy to get into the list. Large numbers of candidates apply for the test conducted by Kerala Public Service Commission.

Structure of KPSC HSST Computer Science/Computer Application Exam

The candidates for the HSST Computer Science/Computer Application Exam are selected by a written test conducted by Kerala PSC. The written test is of objective type format. The test includes 100 multiple choice questions which carries 100 marks. The time duration of the exam will be one hour and fifteen minutes. The candidates have to answer the questions in English only. 1/4th mark from the total mark will be deducted if the answer is wrong. So the candidates need to be careful while answering.

Syllabus for KPSC HSST Computer Science/Computer Application Exam

KPSC HSST Computer Science/Computer Application Exam includes questions from twelve different sections.

Section 1: Discrete Structures

• Sets, Relations
• Functions
• Pigeonhole Principle
• Inclusion-Exclusion principle
• Equivalence and Partial Orderings
• Elementary Counting Techniques
• Computability: Models of computation - Finite Automata
• Pushdown Automata
• Non-determinism and NFA
• Grammars
• Types of grammars - type 0, type I, type 2 and type 3
• Groups: Finite fields and Error correcting / detecting codes
• Propositional logic
• Predicate logic
• Well-formed formulae (WFF)
• Satisfiability and Tautology

Section 2: Computer Arithmetic

• Logic families: TTL, ECL and C-MOS gates
• Boolean algebra
• Minimization of Boolean functions
• Flip-flops- types
• Race condition and comparison
• Design of combinational and sequential circuits
• Representation of Integers
• Floating point representation

Section 3: Programming in C and C++

• Programming in C
• Elements of C – Tokens
• Identifiers
• Data types in C
• Control constructs in C
• Sequence, selection and iteration
• Structured data types in C - arrays, structs, unions, strings and pointers
• Object-Oriented programming Concepts
• Class – object
• Instantiation
• Inheritance –polymorphism and overloading
• Aggregation
• Abstract classes
• Generalization as extension and restriction
• Object oriented design
• Multiple inheritance C++ - programming

Section 4: Relational Database Design and Query Languages

• E-R diagrams
• Transformation of E-R models to relational design
• Normalization - INF, 2NF, 3NF, BCNF and 4NF
• SQL: Data Definition Language (DDL)
• Data Manipulation Language (DML),
• Data Control Language (CDL) Commands
• Data base Objects
• Query Processing and Optimization
• Centralized and Distributed Database
• Security
• Concurrency and Recovery in Centralized and Distributed Database Systems
• Object Oriented Database Management Systems
• Concepts, Composite objects
• Integration with RDBMS applications

Section 5: Data Structures and Algorithms

• Data, Information
• Definition of data structure
• Arrays, stacks, queues
• Linked lists
• Graphs
• Priority queues and heaps
• File Structures: Fields, records and files
• Sequential, direct, index-sequential and relative files
• Hashing, inverted list and multi-lists
• B-trees and B+ trees
• Graphs: Definition
• Walks, paths, connected graphs
• Regular and bipartite graphs
• Cycles and circuits
• Tree and rooted tree
• Spanning trees
• Eccentricity of a vertex radius and diameter of a graph
• Hamiltonian and Eulerian graphs
• Planar graphs
• Sorting and Searching Algorithms
• Analysis of Algorithms
• Interpolation and Binary Search
• Asymptotic notations - big oh, omega and theta
• Quick sort
• Design of Algorithms

Section 6: Data Communication and Computer Networks

• Data Communication: Analog and Digital transmission
• Asynchronous and Synchronous transmission
• Transmission media
• Multiplexing and Concentration
• Switching techniques
• Polling
• Channel capacity
• Transmission
• Coaxial cables
• Fibre-optic cables
• Wireless transmission- radio
• Microwave and infrared waves
• Light wave transmission
• Telephones - local loop
• Trunks
• Multiplexing, switching
• Narrowband ISDN and broadband ISDN
• ATM, High speed LANs
• Cellular Radio
• Communication satellites
• Geosynchronous and low-orbit
• Reference Models: The OSI model
• TCP/IP model
• Topologies
• Networking Devices
• Protocols for
• Data link layer
• Network layer, and
• Transport layer
• TCP/IP protocols
• Networks security
• Network administration
• Local Area Networks (LAN)
• Metropolitan Area Networks (MAN)
• Wide Area Networks (WAN)
• Wireless Networks
• Inter Networks
• Internetworking: Switch/Hub
• Bridge
• Router
• Gateways
• Concentrated virtual circuits
• Tunneling
• Fragmentation
• Firewalls
• Routing: Virtual circuits and datagrams
• Routing Algorithms
• Congestion control
• Network Security: Cryptography - public key, secret key, Domain Name System (DNS) - Electronic
• Mail and World Wide Web {WWW)
• Name servers
• E-mail architecture
• E-mail Servers

Section 7: Systems Software and Compilers

• Assembly language fundamentals (8085 and 8088 based assembly language programming)
• Assemblers - 2-pass and single-pass
• Macros and macro processors
• Loading
• Linking
• Relocation
• Linkage editing
• Text editors
• Programming Environments
• Debuggers and program generators
• Compilation and Interpretation
• Bootstrapping
• Phases of compilation
• Lexical analysis
• LEX
• Context free grammars
• Parsing and parse trees
• Representation of parse trees and rightmost and leftmost derivations
• Bottom up parsers - shift-reduce
• Operator precedence and LR
• YACC
• Top down parsers - left recursion and its removal
• Recursive descent parser
• Predictive parser
• Intermediate codes - Quadruples, Triples
• Indirect Triples
• Intermediate code generation
• Cod generation
• Code optimization

Section 8:  Operating Systems

• Main functions of operating systems
• Multiprogramming
• Multiprocessing and multitasking
• Memory management
• Virtual memory, paging, fragmentation
• Concurrent processing: Mutual exclusion
• Critical regions lock and unlock
• Scheduling: CPU scheduling
• I/O Scheduling
• Resource scheduling
• Deadlock and scheduling algorithms
• Banker’s algorithm for deadlock handling
• The UNIX system: File system, process management
• Bourne shell
• Shell variables
• Command line programming
• Systems Calls

Section 9: Software Engineering

• System Development Life Cycle (SDLC)
• Water fall model
• Prototypes
• Spiral model
• Software Metrics
• Software Project Management
• Software Design
• System design
• Detailed design
• Function oriented design
• Object-oriented design
• User interface design
• Design level metrics
• Coding and Testing
• Testing level metrics
• Software quality and reliability
• Clean room approach
• Software engineering

Section 10: Computer Graphics

• Display systems
• Input devices
• 2D Geometry - .Algorithms for drawing primitives
• Clipping and windowing
• Windows
• View ports
• Graphic operations for transformations
• 3D Graphics
• Animation
• Graphics standard
• Applications
• Storage Devices
• Input Tools
• Authoring Tools
• Application
• Files

Section11: Programming Language Theory

• Programming language concepts
• Paradigms, models
• Data and Data types
• Operators
• Expressions
• Assignment
• Flow of Control - Control structures
• I/O structures
• I/O statements
• User-Defined and built-in functions
• Parameter passing
• Principles
• Classes
• Inheritance
• Class hierarchies
• Polymorphism
• Dynamic binding
• Reference semantics and their implementation

Section 12: Current Trends and Technologies

• Parallel computing
• Parallel virtual Machine (PVM)
• Message passing interface (MPI)
• Mobile Computing
• Mobile connectivity – Cells
• Framework, wireless delivery technology and switching methods
• Mobile information access devices
• Mobile data internetworking standards
• Cellular data communication
• E-Technologies
• Electronic Commerce
• Electronic Payment Systems
• Digital Token
• Smart Cards
• Credit Cards
• Risks in Electronic Payment System
• Designing Electronic Payment Systems
• Electronic Data Interchange (EDI)
• EDI and Electronic Commerce
• Standardization and EDI
• EDI Software Implementation
• Data Mining
• Principles of parallelism
• Parallel Virtual Machine (PVM)
• Message Passing Interface (MPI) routines and calls
• Parallel programs in PVM paradigm

Eligibility Criteria

The candidates who have a Masters Degree in Computer Application/ Computer Science with 50% marks can apply for the post. Those who have a Masters Engineering Degree in any Computer Science/ IT/Software Engineering with 50% marks are eligible for the post. Those who have a B.Tech or M Sc degree in Physics/Mathematics/Statistics and Post Graduate Diploma in Computer application from a recognized University can also apply for the test. The candidates should be in the age of 20 and 39 years.

How to Apply?

Kerala Public Service commission provides the opportunity for the online submission of the application form. The application form is published in the Kerala PSC website www.keralapsc.org. The candidates can register online through this website. For applying for the examination conducted by Kerala PSC the candidates need not pay any fee.

How to fill the Form?

There are several guidelines provided in the website for the candidates for the application form filling. The candidates have to fill the application form correctly with all necessary details. The Photograph and signature of the candidates must be uploaded in the application form. The photograph and signature must be in the size prescribed in the exam notification. The date of birth and other personal details of the candidates should be filled correctly. The form should be submitted by the candidates before the last date.

Important Dates (Tentative)

• Online Registration starts from: Last Week of June, 2012
• Last date of online registration: Last Week of July, 2012
• Admission Tickets can be downloaded from: Second Week of August, 2012
• Date of the Examination: First Week of September, 2012

List of KPSC HSST Computer Science/Computer Application Exam Centers

• Thiruvananthapuram
• Kannur
• Kollam
• Ernakulum
• Thrissur
• Calicut
• Alapuzha
• Kottayam
• Pathanamthitta
• Malapuram

Contact Address for KPSC HSST Computer Science/Computer Application Exam

• Address : The Under Secretary II, Government Wing Recruitment, Office of the Kerala Public Service Commission, Pattom, Thiruvananthapuram
• Website: www.keralapsc.org
• E-mail: [email protected]

Reference Books for KPSC HSST Computer Science/Computer Application Exam

• Protection and Switchgear by Bhavesh Bhalja, R.P. Maheshwari, Nilesh Chothani
• Analog Integrated Circuit Design by David Johns, Kenneth W. Martin
• The Art of Electronics by Paul Horowitz, Winfield Hill
• Data and file structures using C (GTU)  by Reema Thareja
• The Art of Analog Layout by Roy Alan Hastings
• Computer Networks by Bhushan Trivedi
• Communication Systems Engineering by John G. Proakis, Masoud Salehi
• Digital Image Processing by S. Sridhar
• Schaum’s Outline of Software Engineering by David A. Gustafson
• The Design of CMOS Radio-Frequency Integrated Circuits by Thomas H. Lee
• Fundamental Concepts in Electrical and Computer Engineering by Peter M. Meenen and Reza Adhami
• Computer Engineering: Hardware Design by M. Morris Mano
• Digital Systems by Ronald J. Tocci, Neal Widmer

Coaching Centers for KPSC HSST Computer Science/Computer Application Exam

• Brilliant Tutorials Private Limited
• Elite Academy
• Fundas and Competitions
• Career Launcher
• Success Guru
• Vedic Academy
• DAMS
• Brain Strom Academy
• APEX Academy
• Prism Center for Education
• Sahil Study Circle
• National Institute of Advanced Learning
• S.S.B. Interviews Coaching
• Heirank School of Competitions
• Achievers Tutorials
• Arpan Institute
• Rajendra institute of Higher Studies
• Progress Coaching Centre
• Institute of Career Management
• Takshila Institute
• CAT Guroo
• Ascent Education
• Rachna A.C.A. of Career Education
• Dhaliwal Institute of Competition
• New Career Academy

Study Plan

The candidates have to prepare a realistic study plan for scoring good marks in the exam. The candidates need to be familiar with the syllabus of the exam. The exam patterns of the test can be identified from the previous question papers. The candidates should spend three hours daily for the preparation of the exam. Divide the long sections into small topics. It helps the candidates to cover the topics more easily. The candidates can go for coaching provided by various coaching centers before attempting the exam. The study plan should be designed to reduce the stress of the candidates. Candidates should follow the study plan to achieve the goal.

How and Where To Get the Results?

The result of the exam will be available in the official website of Public Service Commission www.keralapsc.org.

Score Validity

The exam score is valid for minimum one year and maximum three years till the announced vacancies are filled.