Choose your language
Showing posts with label HSST. Show all posts
Showing posts with label HSST. Show all posts
29 December 2016
In
DECEMBER 2016,
HSST,
HSST COMPUTER SCIENCE,
SOLVED PAPER 2016
by LIJO PAUL
//
12/29/2016
//
Our Youtube channel
HSST COMPUTER SCIENCE (SR FOR SC/ST)(ONLINE EXAM) 29-12-2016
HSST COMPUTER SCIENCE (SR FOR SC/ST)(ONLINE EXAM)
1.The buffer overflow attack is caused by
A.Vulnerability in the design of a networking protocol
B.Vulnerability in the implementation of a networking protocol
C.Vulnerability in human behavior
D.Vulnerability in software*
Ans:D
18 March 2016
HSST MATHEMATICS 18-03-2016 KERALA PSC
HSST MATHEMATICS ONLINE EXAM
EXAM DATE:18-03-2016
1.Who among
the following is the winner of Jnanapida award in 2015?
A.Ragveer Chaudary*
B.Leeladhar Mandloi
C.K.V.Chaudary
D.S.Ramanugam
Ans:A
6 August 2013
HSST POLITICS SYLLABUS
FURTHER DETAILS REGARDING MAIN TOPICS FOR THE POST OF HIGHER
SECONDARY SCHOOL TEACHER(POLITICAL SCIENCE)IN HIGHER SECONDARY EDUCATION
DEPARTMENT
CATEGORY NO.113/2010
Modern Political Thought
A.Machiavelli,Hobbies,Locke,Rousseau
B.Utilitanism:Jeremy Bentham,J.S.Mill
C.Idealism:Hegal,T.H.Green
D.Conservatism:Edmund Burke
E.Marxism:Marx,Lenin,Mao-Tse-Tung
F.Gandhism:M.K.Gandhi
G.Contemporary Political Theory:joh Rawls,Gramsci
8 June 2013
HSST COMPUTER SCIENCE SYLLABUS
HIGHER SECONDARY SCHOOL TEACHER-COMPUTER SCIENCE/COMPUTER
APPLICATION & HIGHER SECONDARY SCHOOL TEACHER-COMPUTER SCIENCE/COMPUTER
APPLICATION(JUNIOR)
1.Discrete Structures:Set,Relations,Functions,Pigeonhole
Principle,Inclusion-Exclusion principle,Equivalence and Partial
Orderings.Elementary Counting Techniques
Comaptibility: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-type0,type1,type2 and type3.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.