# VOCATIONAL TEACHER IN COMPUTER SCIENCE EXAM SYLLABUS

FURTHER DETAILS REGARDING MAIN TOPICS OF PROGRAMME NO.7/2013(ITEM NO.17 & 18)VOCATIONAL TEACHER IN COMPUTER SCIENCE VOCATIONAL HIGHER SECONDARY EDUCATION(CATEGORY NO.302/2010 & 303/2010)

PART.I COMPUTER SCIENCE
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE Logics and proofs:propositions,conditional propositions and logical equivalences,quantifiers,proofs resolution,mathematical induction,Fundamental principles of counting,pigeonhole principle,countable and uncountable sets,principle of inclusion and exclusion,derangements,equivalence relations and partitions,partial order,lattices and Boolean algebra,generating functions,recurrence relations,solution of recurrences.Divisibilty,gcd,prime numbers,fundamental theorem of arithmetic,Congruences,Femat’s theorem,Euler function,primality testing,solution of congruences,Chinese remainder theorem,Wilson’s theorem Graphs,Euler tours,planar graphs,Hamiltonian graphs,Euler’s formula,applications of kuratowski’s theorem,graph colouring,chromatic polynomials,trees,weighted trees,shortest path algorithms,spanning trees,the maxflow min-cut theorem.

ALGORITHMS Framework for Algorithm analysis-Asymptotic notations-iterating recurrences-Master Method –Analysis of algorithms:Sorting-Searching Algorithm design techniques-Backtracking-Branch and bound-Divide-and –Conquer:sorting-median finding-Dynamic Programming:knapsack-LCS-Matrix chain multiplication-Optimal search trees-Scheduling problems-Greedy strategy:Set of  intervals-Fractional knapsack-Huffmann coding Algorithms on graphs-BFS,DFS Dijkstra’s algorithm for shortest path,Floyd’s algorithm for all pairs of shortest paths,Kruskal’s and Prim’s algorithm for minimum  spanning  tree NP Completeness:Matching-Search/Decision-Sat-Subset sum and Partition-Hamiltonian circuit-Reductions-Approximation algorithms for NP-Randomized algorithms.

OPERATING SYSTEMS Operating system concepts:System calls-Operating System Structure.Processes-inter Process Communication-Race conditions-critical sections-Mutual Exclusion-Busy Waiting-Sleep and Wakeup-Semaphores-Monitors –Message Passing.Process Scheduling-First Come  First Served-Shortest Job First-Priority scheduling-Round Robin Scheduling-Multiple queues scheduling-Guaranteed scheduling-Two-level scheduling.Memory management:Multiprogramming and memory usage-Swapping-multiprogramming  with fixed and variable partitions-Memory management with bit maps,linked lists,Buddy system-Allocation of swap space.File systems and Input/Output:Files-Directories-File system implementation-Security and Protection mechanicsms.Deadlock detection and recovery –Deadlock avoidance-resource trajectories-safe and unsafe states-Banker’s algorithms-Deadlock prevention:Two phase locking –Non –resource deadlocks-Starvation.Case  Studies:UNIX/LINUX ,Windows Operating Systems.

COMPUTATIONAL INTELLIGENCE Artificial Intelligence:history and Applications,Production Systems,Structures and Strategies  for state space search-Data driven and goal driven search,Depth First and Breadth First Search,DFS with Iterative Deepening,Heuristic Search-Best First Search,A * Algorithm,AO* Algorithm,Constraint Satisfaction,Using heuristics in games-Minimax Search,Alpha Beta procedure Knowledge representation-Propositional calculus,discrete-time Markov Chains-Continuous Markov Chains-Birth-death processes.Game Theory:The formation of two –person-Zero-sum games-Solving simple games,games with mixed strategies,Graphical solution procedure,Solving by LP.Inventory Theory:Inventory models-Deterministic periodic and continuous review models-Stochastic continuous review model.

COMPUTER BASED OPTIMIZATION Linear programming:Model and Assumptions-Solving LPP-Simplex method-Sensitivity analysis-Transportation and assignment problems Integer Programming:Branch and found Techniques-Binary Linear programming-Assignment & Travelling salesman problems-Dynamic programming:Deterministic and Probabilistic Dynamic programming Queing Model:Specification and measure of queing systems-Structures of basic queing systems-Definition and classification of stochastic processes-Al Representational Schemes-Semantic Nets,Conceptual Dependency,Scripts,Frames,Introduction to Agent based problem solving Machine learning-Symbol based and Connectionist,Social and Emergent models of learning,The Genetic Algorithm-Genetic Programming,Overview of Expert System Technology-Rule based Expert Systems,Introduction to Natural Language  Processing.

COMPUTER NETWORKS Network Architecture:ISO-OSi and TCP protocol stack-Internet Architecture-Performance factors-Connecting to a network:Links-Encoding-Framing-Error detection-Reliable transmission-Ethernet Internetworking:Switching and bridging-Internet protocol-Routing Protocols-Multicast-MPLS-IPV6 End-to –End Protocols:UDP-TCp-TCp extensions-RPC-RTP Congestion Control-Resource Allocation-Tcp Congestion Control-Congestion avoidance-QoS Application Protocols-Email-HTTP-Session Control-Naming Service-Network Management

OBJECT ORIENTED MODELLING AND DESIGN Structural Modelling:Object Oriented Fundamentals,Basic structural Modeling,UML Model,Class Diagrams,object Diagrams,Packages and Interfaces,Case Studies.Behavioural and architectural Modelling:Use Case Diagrams,Interaction Diagrams,State Chart Diagrams,Collaborations,Design Patterns,Component Diagrams,Deployment Diagrams,Case Studies Object oriented Testing Methodologies:Implications of Inheritance  on Testing ,State based Testing,Adequacy and Coverage,Scenario Based Testing,Testing Workflow,Case Studies,Object Oriented Metrics  Components:Abuses of inheritance,danger of polymorphism,mix in classes,rings of operations,class cohesion and support  of states  and behaviour,components and objects ,design of a component,lightweight and heavyweight components,advantages and disadvantages of using components.

NUMBER THEORY AND CRYPTOGRAPHY
Divisibility,Division Algorithm,Euclidean Algorithm,Congruences,Complete Residue systems,Reduced Residue systems,Fermat’s little theorem,Euler’s Generalisation,Wilson’s Theorem,Chinese Remainder Theorem,Finite Fields,Primitive Roots-Primarily  Tests,Pseudoprimes,Carmichael Numbers,Fermat’s pseudoprimes,Euler pseudoprimes.Factorization by Pollard’s  Rho method,Simple Continued Fraction,simple infinite continued Fraction,simple infinite continued fractions-raditional Cryptosystem,limitations,Public key Cryptography Diffie-Hellmann key exchange,Discrete Logarithm p[roblem,One-way functions,Trapdoor functions,RSA cryptosystem,Digital signature schemes,Digital signature standards,RSA signature schemes-Introduction to Elliptic Curves-Elliptic Curve Cryptography

PART .II BASIC FACTS ABOUT INDIA
Geography of India-Physical Features-Climate –Soils-Rivers-Famous Sites-Etc Demography-Ecnomic and Social Development-Poverty Alleviation-Economy and Planning –Etc History of India-period from 1857 to 1947-national Movement-Etc.

PART.III BASIC FACTS OF KERALA
Geographical Facts-Physical Features –Climate-Soils-Rivers-Famous Sites-Etc Renaissance of kerala important Events/Movements/Leaders Brahmananda Swami Sivayogi,Chattampi Swami,Sree Narayana Guru,Vagbhatananda,Thycaud Ayya,Ayya vaikundar,Poikayil Yohannan(Kumara Guru),Ayyankali,Pandit Karuppan,Mannathu padmanabhan,V.T.Bhattathirippad,Dr.Palpu,kumaranasan,Vakkom Moulavi,Blessed Kuriakose Elias Chavara,Etc.

NOTE: It may be noted that apart from the topics detailed above,questions from other topics prescribed for the educational qualification of the post may also appear in the question paper.There is no undertaking that all the topics above may be covered in the question paper.

Please Give Us Your 1 Minute In Sharing This Post!
SOCIALIZE IT →
SHARE IT →