Maharashtra State Eligibility Test (SET) 2010
Syllabus: (Computer Science & Applications: Paper II and III)
1. Discrete Structures
Sets, Relations, Functions, Pigeonhole Principle,
Inclusion-Exclusion Principle, Equivalence and Partial Orderings, Elementary
Counting Techniques. Probability, Measure(s) for information and Mutual
information.
Computability : Models of computation-Finite Automata,
Pushdown Automata. Non-determinism and NFA, DPDA and PDAs and Languages accepted
by these structures. Grammars, Languages, Non- omputability and Examples of
non-computable problems.
Graph : Definition, walks, paths, trails, 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. Central
Graphs. Centre(s) of a tree. Hamiltonian and Eulerian graphs, Planar graphs.
Groups : Finite fields and Error correcting/detecting
codes.
2. Computer Arithmetic
Propositional (Boolean) Logic, Predicate Logic,
Well-formed-formulae (WFF), Satisfiability and Tautology.
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.