Project
GUJARAT STATE LEVEL ELIGIBILITY TEST
Code No.:19
Subject : COMPUTER SCIENCE AND APPLICATIONS
SYLLABUS AND SAMPLE QUESTIONS
Note :
There will be two question papers, Paper—II and Paper—III. Paper—II will cover 50 Objective Type
Questions carrying 100 marks. Paper—III will be of 200 marks and will consist of four sections, in all containing 26 questions (short and essay type) to attempt. For detail structure of Paper-III please visit our website http://www.msubaroda.ac.in
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.
Compatibility : Models of computation—Finite Automata, Pushdown Automata, Nondeterminism and NFA. DPDA and PDAs and Languages accepted by these structures.
Grammars, Languages, Non-computabllity 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
Prepositional (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 iteration(s). Structured data types In
Code No.:19
Subject : COMPUTER SCIENCE AND APPLICATIONS
SYLLABUS AND SAMPLE QUESTIONS
Note :
There will be two question papers, Paper—II and Paper—III. Paper—II will cover 50 Objective Type
Questions carrying 100 marks. Paper—III will be of 200 marks and will consist of four sections, in all containing 26 questions (short and essay type) to attempt. For detail structure of Paper-III please visit our website http://www.msubaroda.ac.in
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.
Compatibility : Models of computation—Finite Automata, Pushdown Automata, Nondeterminism and NFA. DPDA and PDAs and Languages accepted by these structures.
Grammars, Languages, Non-computabllity 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
Prepositional (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 iteration(s). Structured data types In