Latest Qualification Jobs

Check Your Email To Activate the Confirmation Link

HSST Computer Science Syllabus 2018 Kerala PSC HSST Syllabus, Exam Pattern

HSST Computer Science Syllabus

Get HSST Computer Science Syllabus from this page!!! Kerala Public Service Commission is going to conduct Higher Secondary School Teacher (HSST) Exam on specific locations. All those aspirants who had successfully filled the application form and willing to participate in the Kerala PSC HSST exam must go through Kerala PSC HSST Exam Pattern. Moreover, students can download the Kerala PSC HSST Computer Science Syllabus 2018 as well as exam pattern in PDF format by hitting the direct link given on this page.

HSST Exam Pattern comprises all significant details about exams as major topics, marking scheme, duration and lot more Facts. To crack the Kerala PSC HSST Exam, individuals must be well acknowledged about the Public service Commission of Kerala Exam structure. For the assistance of applicants, we have provided all crucial details about HSST PSC Exam Syllabus.

After the studying on significant parameters regarding HSST Computer Science Syllabus 2018, the diligent team of has well formulated this web page, so take quick overview of entire page.

HSST Computer Science Syllabus

HSST Computer Science Syllabus:

  • Discrete Structures
  • Computer Arithmetic
  • Programming in C and C++
  • Relational Database Design and Query Languages
  • Data Structures and Algorithms
  • Data Communication and Computer Networks
  • Systems Software and Compilers
  • Operating Systems
  • Software Engineering
  • Computer Graphics
  • Programming Language Theory
  • Current Trends and Technologies

Read Here: How To Find Online Study Material

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, DPDA and PDA s and Languages accepted by these structures.
  • Grammars – types of grammars – type 0 , type I, type 2 and type 3. The relationship between types of grammars,Languages, Non-computability, Non-computable problems.
  • Groups: Finite fields and Error correcting / detecting codes.
  • Propositional logic. Predicate logic. Well-formed formulae (WFF). Satisfiability and Tautology.

Check Out: Kerala PSC Notification

Computer Arithmetic:

  • Logic families: TTL, ECL and C-MOS gates. Boolean algebra and Minimization of Boolean functions, Flip-flops- types, race condition and comparison, Design of combinational and sequential circuits.
  • Representation of Integers: Octal. Hex. Decimal and Binary 2’s complement and 1’s complement arithmetic. Floating point representation.

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: Elements of C++ – Tokens, Identifiers, Variables and constants. Data types, Operators. Control statements, Functions, parameter passing, Class and objects, Constructors and destructors, Overloading, Inheritance, Templates, Exception handling.

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. Database objects like- Views, indexes, sequences, synonyms, data dictionary, Embedded SQL, QBE Query Processing and Optimisation, Centralised and Distributed Database, Security, Concurrency and Recovery in Centralised and Distributed Database Systems, Object Oriented Database Management Systems – Concepts, Composite objects, Integration with RDBMS applications.

Read Now: Health Hazards due to over Studying

Data Structures and Algorithms:

  • Data, Information. Definition of data structure, Arrays, stacks, queues, linked lists, trees, 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. Average case analysis of simple programs like finding of a maximum of n elements. Recursion. Quick sort.
  • Design of Algorithms (Divide and Conquer. Greedy method. Dynamic programming. Back tracking. Branch and Bound).

Want to Know? Tips To Create Your Own Study Guide

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 media – twisted pair, coaxial cables, fibre-optic cables, wireless transmission- radio, microwave and infrared waves. Light wave transmission. Telephones – local loop, trunks, multiplexing, switching, narrow band ISDN, 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 – (i) Data link layer (ii) Network layer, and (iii) 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. Tunnelling, 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). The DNS, Resource Records. Name servers. E-mail architecture and E-mail Servers.

System 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, program relocatability. 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, Code generation, Code optimization.

You May Read This: Strategies To Improve Memory

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, commands line programming.
  • Systems Calls: Creat, open, close, read, write. Iseek, link, unlink, stat, fstat, umask, chmod, exec, fork, wait, system.

Software Engineering:

  • System Development Life Cycle (SDLC): Steps, 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

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.

You May Read This: How to Prepare for Written Exam

Programming Language Theory:

  • Programming language concepts, paradigms, models.
  • Data. 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.
  • Principles, functions, lists, types and polymorphism, higher order functions, lazy evaluation, equations and pattern matching.
  • Principles, horn clauses and their execution, logical variables, relations, data structures, control the search order, program development in Prolog, implementation of Prolog, example programs in Prolog.

Current Trends and Technologies:

  • Parallel computing: Parallel virtual Machine (PVM) and message passing interface (MPI) libraries and calls. Advanced architectures. Today’s fastest computers.
  • Mobile Computing: Mobile connectivity – Cells. Framework, wireless delivery technology and switching methods, mobile information access devices, mobile data internetworking standards, cellular data communication protocols, mobile computing applications. Mobile databases – protocols, scope, tools and technology.
  • E-Technologies: Electronic Commerce: Framework, Media convergence of Applications, Consumer Applications, Organisation applications.
  • Electronic Payment Systems: Digital Token, Smart Cards, Credit Cards. Risks in Electronic Payment System, Designing Electronic Payment Systems.
  • Electronic Data Interchange (EDI): Concepts, Applications, (Legal, Security and Privacy) issues. EDI and Electronic Commerce. Standardisation and EDI. EDI Software Implementation. EDI Envelope for Message Transport, internet-based EDI.
  • Data Warehousing: Data Warehouse environment, architecture of a data warehouse methodology, analysis, design, construction and administration.

Want to Know? How to Get Rid Of Sleeping While Studying

HSST Computer Science Exam Pattern:

The Kerala PSC HSST Exam Pattern 2018 has provided in below section of the page. Appearing aspirants can check it and should prepare according to this exam pattern for score higher marks in exam.

  • Kerala PSC HSST will be based on OMR sheet.
  • Each question will comprise 4 options from which one answer will be right.
  • Candidates have to choose one option as right answer.
  • The question paper will be total of 100 marks.
  • The time limit will be provided of 1 ¼ hour.
  • One mark will be gifted for attempt right answer.
PartSubjectsMaximum MarksExam Duration
ICore Subject100 marks1 ¼ hour
IIResearch Methodology & Teaching Aptitude
IIISalient Features of Indian Constitution, Social Welfare Legislations & Programmes
IVGeneral Knowledge, Current Affairs & Renaissance in Kerala

Centers of Examination:

Kerala Public Service Commission has decided these following centers where the Higher Secondary School Teachers will be organized. Applying contenders for HHST recruitment will get one of the exam centers from these following. Aspirants are advised to check HSST exam center in their Kerala PSC HSST admit card.

  • Thiruvanathapuram
  • Kannur
  • Kollam
  • Calicut
  • Malapuram
  • Kottayam
  • Alapuzha
  • Ernakulam
  • Thrissur
  • Pathanamthitta

Get HSST Computer Science Syllabus PDF >> Hit Here

Preparation Tips:

Applicants, who are preparing for this exam and want to crack it, but have confusion about how to prepare for the examination. For all contenders we are providing some preparation tips which will help a lot to the students for qualify and score higher marks in the examination.

  • Time Management is the most important key preparing for any exam, this also apply for Higher Secondary School Teachers exam.
  • Candidates should manage their time in between small and lengthy topics of HSST Computer Science Syllabus.
  • Give equal time to all subjects which are related to HSST Computer Science Syllabus.
  • Should learn general knowledge and solve PSC Previous Questions Papers of HSST Computer Science Syllabus.
  • Prepare from also PSC Model Questions in which most of the questions are provided from the previous questions.
  • Collect all the data about most repeated PSC questions of HSST Computer Science Syllabus.
  • Practice grammar section while prepare for English subject.
  • Take regular sleep and power nap while studying which will charge your mind.
  • Take proper diet and do exercise well also.
  • HSST Computer Science Syllabus provided on this page will definitely help the candidates for score passing marks.


We hope, you are satisfied with the given on our page about HSST Computer Science Syllabus 2018. But still, if you have any query related to HSST Computer Science Syllabus then you may ask it in below given comment box. Our expert will solve your query as soon as possible.

Something That You Should Put An Eye On

Tips to Make Study InterestingHow to Get in Mood to Study
Tips to Manage StressLast Minute Exam Preparation Tips
Makes Your Brain Work BetterStay Awake All Night To Study
Kerala PSC One Time RegistrationKerala PSC Model Question Papers

Filed in: Exam Pattern, Syllabus Tags: 

Leave a Reply

Submit Comment