Can you provide me the syllabus of UGC NET exam Computer Science Applications???

This is the UGC NET exam Computer Science Applications syllabus:

SYLLABUS PART A

General aptitude with emphasis on logical reasoning, graphical analysis, analytical and
numerical ability, quantitative comparisons, series formation, puzzles, etc.

SYLLABUS PART B

Mathematics And Engineering Aptitude

Linear Algebra

Calculus

Complex variables

Vector Calculus

Ordinary Differential
Algebra of matrices, inverse, rank, system of linear equations,
symmetric, skew-symmetric and orthogonal matrices. Hermitian,
skew-Hermitian and unitary matrices. eigenvalues and
eigenvectors, diagonalisation of matrices.

Functions of single variable, limit, continuity and differentiability,
Mean value theorems, Indeterminate forms and L'Hospital rule,
Maxima and minima, Taylor's series, Newton’s method for finding
roots of polynomials. Fundamental and mean value-theorems of
integral calculus. Numerical integration by trapezoidal and
Simpson’s rule. Evaluation of definite and improper integrals,
Beta and Gamma functions, Functions of two variables, limit,
continuity, partial derivatives, Euler's theorem for homogeneous
functions, total derivatives, maxima and minima, Lagrange method
of multipliers, double integrals and their applications, sequence and
series, tests for convergence, power series, Fourier Series, Half
range sine and cosine series.

Analytic functions, Cauchy-Riemann equations, Line integral,
Cauchy's integral theorem and integral formula Taylor’s and
Laurent' series, Residue theorem and its applications.

Gradient, divergence and curl, vector identities, directional
derivatives, line, surface and volume integrals, Stokes, Gauss and
Green's theorems and their applications.

First order equation (linear and nonlinear), Second order linear
differential equations with variable coefficients, Variation of Equations





Probability

parameters method, higher order linear differential equations with
constant coefficients, Cauchy-Euler's equations, power series
solutions, Legendre polynomials and Bessel's functions of the first
kind and their properties. Numerical solutions of first order
ordinary differential equations by Euler’s and Runge-Kutta
methods.

Definitions of probability and simple theorems, conditional
probability, Bayes Theorem.

Solid Body Motion and
Fluid Motion:

Energetics:


Electron Transport:




Electromagnetics:





Materials:

Particle dynamics; Projectiles; Rigid Body Dynamics; Lagrangian
formulation; Eularian formulation; Bernoulli’s Equation;
Continuity equation; Surface tension; Viscosity; Brownian Motion.

Laws of Thermodynamics; Concept of Free energy; Enthalpy, and
Entropy; Equation of State; Thermodynamics relations.

Structure of atoms, Concept of energy level, Bond Theory;
Definition of conduction, Semiconductor and Insulators; Diode;
Half wave & Full wave rectification; Amplifiers & Oscillators;
Truth Table.

Theory of Electric and Magnetic potential & field; Biot & Savart’s
Law; Theory of Dipole; Theory of Oscillation of electron;
Maxwell’s equations; Transmission theory; Amplitude &
Frequency Modulation.

Periodic table; Properties of elements; Reaction of materials;
Metals and non-Metals (Inorganic materials), Elementary
knowledge of monomeric and polymeric compounds;
Organometallic compounds; Crystal structure and symmetry,
Structure-property correlation-metals, ceramics, and polymers.

SYLLABUS PART C

1. COMPUTER SCIENCE AND INFORMATION TECHNOLOGY


Basic Discrete Mathematics: Counting principles, linear recurrence, mathematical induction,
equation sets, relations and function, predicate and propositional logic.

Digital Logic:
Logic functions, Minimization, Design and synthesis of combinational and sequential circuits;
Number representation and computer arithmetic (fixed and floating point).

Computer Organization and Architecture:
Machine instructions and addressing modes, ALU and data-path, CPU control design, Memory
interface, I/O interface (Interrupt and DMA mode), Instruction pipelining, Cache and main
memory, Secondary storage.

Programming and Data Structures:
Programming in C; Functions, Recursion, Parameter passing, Scope, Binding; Abstract data
types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binary heaps.

Algorithms:
Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case
analysis; Design: Greedy approach, Dynamic programming, Divide-and conquer; Tree and graph
traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching.
Asymptotic analysis (best, worst, average cases) of time and space, upper and lower bounds,
Basic concepts of complexity classes P, NP, NP-hard, NP-complete.

Operating System:
Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock,
CPU scheduling, Memory management and virtual memory, File systems.

Databases:
ER-model, Relational model (relational algebra, tuple calculus), Database design (integrity
constraints, normal forms), Query languages (SQL), File structures (sequential files, indexing, B
and B+ trees), Transactions and concurrency control.

Information Systems and Software Engineering:
information gathering, requirement and feasibility analysis, data flow diagrams, process
specifications, input/output design, process life cycle, planning and managing the project, design,
coding, testing, implementation, maintenance

Detailed syllabus is in the attachment, download it freely from here:

Attached Files

UGC NET EXAM computer science syllabus.pdf (295.1 KB, 84 views)