nkhjk
STATE ELIGIBILITY TEST
COMPUTER SCIENCE AND APPLICATIONS
(SYLLABUS)
SUBJECT CODE : 28
PAPER-II
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-computability and Examples of noncomputable 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, 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.
3.
Programming in C and C++
Programming in C : Elements of C-Tokens, identifiers, data types in C. Control structures in C. Sequence, selection and iterations(s). Structured data types in
C-arrays, struct, union, string, and pointers.
O-O Programming Concepts: polymorphism and overloading.
Class,
object,
instantiation.
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.
4.
Relational Database
COMPUTER SCIENCE AND APPLICATIONS
(SYLLABUS)
SUBJECT CODE : 28
PAPER-II
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-computability and Examples of noncomputable 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, 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.
3.
Programming in C and C++
Programming in C : Elements of C-Tokens, identifiers, data types in C. Control structures in C. Sequence, selection and iterations(s). Structured data types in
C-arrays, struct, union, string, and pointers.
O-O Programming Concepts: polymorphism and overloading.
Class,
object,
instantiation.
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.
4.
Relational Database