HSST Computer Science Syllabus
Attention Aspirants!!!! Looking to download HSST Computer Science Syllabus 2023 & HSST Computer Science Exam Pattern 2023 in PDF get here!!! Kerala Public Service Commission going to conduct HSST Computer Science Recruitment 2023 examination soon, those aspirants who have applied for HSST Recruitment 2023 & seeking the relevant syllabus for the best preparation are eligible to download Kerala PSC HSST Computer Science Syllabus 2023 & Exam Pattern 2023 in PDF form by scrolling this page & start their preparation according to the HSST 2023 Computer Science Syllabus PDF & HSST 2023 Exam Pattern PDF.
Download HSST Computer Science Syllabus 2023 & HSST Exam Pattern 2023 Now!!!! Over the Lakhs of aspirants who have appeared for HSST Computer Science Recruitment Jobs 2023 are going to start their preparation to get a good score. Here we have provided a detailed full Kerala PSC HSST Computer Science Syllabus 2023 & Exam pattern & also HSST Computer Science Exam Preparation tips 2023 for the best score. The HSST Exam Pattern 2023 includes all the important details about examinations in the form of major topics, notation planning, duration and many more facts. The examination will be based on the OMR sheet which should be completed within 1 to 1 hour. There will be a total of 100 points with 4 options.
Kerala PSC HSST Syllabus 2023:
| Conducting Body | Kerala Public Service Commission |
| Name of Recruitment | HSST Computer Science Recruitment 2023+ |
| Category | HSST Computer Science Syllabus |
| Job Title | Higher Secondary School Teachers |
| Selection Procedure | Stage 1: Written/OMR/Online Test
Stage 2: Document Verification |
| Mode of Kerala PSC HSST Exam 2023 | Offline |
| Official Website | www.keralapsc.gov.in |
Grab Latest Sarkari Jobs
UPTET Answer Key 2023 Get Exam Answer Sheet Online Download in PDF
UPSC CDS 1 Notification 2023 Combined Defence Services Application Form
HSST Computer Science Syllabus 2023
HSST 2023 Computer Science Syllabus Details:
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 grammar, Languages, Non-computability, and Non-computable problems. |
| Groups: Finite fields and Error correcting/detecting codes. |
| Propositional logic. Predicate logic. Well-formed formulae (WFF). Satisfiability and Tautology. |
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 inheritances |
| 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, and 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 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. |
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 the finding of a maximum of n elements. Recursion. Quicksort. |
| Design of Algorithms (Divide and Conquer. Greedy method. Dynamic programming. Backtracking. Branch and Bound). |
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. Lightwave Transmission. Telephones – local loop, trunks, multiplexing, switching, narrowband 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) The transport layer, TCP/IP protocols, Networks security and Network administration. |
| Local Area Networks (LAN), Metropolitan Area Networks (MAN), Wide Area Networks (WAN). Wireless Networks, InterNetworks. |
| 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, and program relatability. 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. |
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: Create, open, close, read, write. Iseek, link, unlink, stat, fstat, umask, chmod, exec, fork, wait, system. |
Download HSST Computer Science Syllabus 2023
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, and 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. |
Programming Language Theory |
| Programming language concepts, paradigms, models. |
| Data. Data types, Operators, Expressions. Assignment. The 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, controlling the search order, program development in Prolog, implementation of Prolog, example programs in Prolog. |
Current Trends and Technologies |
| The topics of current interest in Computer Science and Computer Applications shall be covered. The experts shall use their judgment from time to time to include the topics of popular interest which are expected to be known by an ardent follower of the field. Currently, they include: |
| 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, the architecture of a data warehouse methodology, analysis, design, construction, and administration. |
| Data Mining: Extracting models and patterns from large databases, data mining techniques, classification, regression, clustering, summarization, dependency modeling, link analysis, sequencing analysis, and mining scientific and business data. |
| Principles of parallelism, coroutines, communication and execution, Parallel Virtual Machine (PVM), and Message Passing Interface (MPI) routines and calls. Parallel programs in PVM paradigm as well as MPl paradigm for simple problems like matrix multiplication. |
HSST Computer Science Syllabus
HSST Computer Science Exam Pattern 2023-
HSST Computer Science Exam Pattern 2023:
| Subjects | Maximum Marks |
| Core Subject |
100 marks |
| Research Methodology & Teaching Aptitude | |
| Salient Features of Indian Constitution, Social Welfare Legislations & Programmes | |
| General Knowledge, Current Affairs & Renaissance in Kerala |
Exam Duration: 1 ¼ hour
Preparation Tips for HSST Computer Science 2023:
Individuals, who are preparing for Computer Science Exam and want to secure better marks in the exam, can check some preparation tips which will help a lot for qualifying and getting higher marks in the examination.
- Time Management is the most vital key to planning for an exam, this likewise applies for the Higher Secondary School Teachers exam.
- Competitors ought to deal with their time in the middle of little and protracted points of HSST Computer Science Syllabus.
- Give measure up to time to all subjects which are identified with HSST Computer Science Syllabus.
- Ought to learn general information and understand PSC Previous Questions Papers of HSST Computer Science Syllabus.
- Get ready for likewise PSC Model Questions in which the vast majority of the questions are given from the previous questions.
- Gather every one of the information about the most rehashed PSC questions of the HSST Computer Science Syllabus.
- Practice grammar segments while planning for English subjects.
- Take ordinary rest and power rest while examining which will charge your psyche.
- Take the correct eating routine and do practice well moreover.
- HSST Computer Science Syllabus given on this page will help the possibility for score passing imprints.
Official website
Final Words!
Hope you get all detail about HSST Computer Science Syllabus 2023 & HSST Computer Science Exam Pattern 2023 for better preparation, In Above we have also coved HSST Computer Science Preparation tips & Tricks 2023 which will surely help you to get information to start your HSST Computer Science Recruitment 2023 | HSST Computer Science Exam 2023 preparation & get a good score, if you have any query & suggestion regarding this page, comment down below & make sure subscribe us by using the email address.