Here is UGC NET 2020 Subject wise Syllabus by KShare.
| Paper | Marks | No. of Questions | Time Duration |
| Paper-I (Common for all) | 100 | 50 | 1 Hour |
| Paper-II | 100 | 100 | 1 & 1/2 Hours |
| Paper III | 150 | 75 | 1 & 1/2 Hours |
Topics
- Discrete structures
- Computer arithmetic
- Programming in C and C++
- Relational database design and SQL
- Data and file structures
- Computer networks
- System software and compilers
- Operating systems with case study of Unix
- Software engineering
- Current trends and technologies
- Combinational circuit design
- Database concepts
- Display systems
- Programming language concepts
- Analog and digital transmission
- Definition, simple and composite structures
- Arrays
- Lists
- Stacks queues
- Priority queues
- Binary trees
- B-trees
- Graphs
- Sorting and searching algorithms
- Analysis of algorithms
- Interpolation and binary search
- Asymptotic notation
- Big ohm
- Omega and theta
- Average case analysis of simple programs like finding of a maximum of n elements
- Recursion and its systematic removal
- Quicksort
- Non-recursive implementation with minimal stack storage
- Design of algorithms (divide and conquer, greedy method, dynamic programming, back tracking, branch and bound)
- Lower bound theory
- Non-deterministic algorithm
- Non-deterministic programming constructs
- Simple non-deterministic programs
- NP-hard and NP-complete problems
- Object
- Messages
- Classes
- Encapsulation
- Inheritance
- Polymorphism
- Aggregation
- Abstract classes
- Generalization as extension and restriction
- Object oriented design
- Multiple inheritance
- Metadata
- HTML
- DHTML
- XML
- Scripting
- Java
- Servlets
- Applets
- Software development models
- Introduction of memory management
- Support for concurrent process
- Scheduling
- System deadlock
- Multiprogramming system
- I/O management
- Distributed operating systems
- Study of Unix and windows NT
- Definitions and AL approach for solving problems
- Automated reasoning with propositional logic and predicate logic
- Bounding functions
- Breadth first
- Depth first, A, A*, A0*
- Performance comparison of various search techniques
- Frames
- Scripts
- Semantic nets
- Production systems
- Procedural representations
- Prolog programming
- Components of an expert system
- Knowledge representation and acquisition techniques
- Building expert system and shell
- RTNS
- ATNS
- Parsing of ambiguous CFGS
- Tree adjoining grammars
- Systems approach to planning
- Designing
- Development
- Implementation and evaluation of MIS
- Decision-making processes
- Evaluation of DSS
- Group decision support system and case studies
- Adaptive design approach to DSS development
- Cognitive style in DSS
- Integrating expert and decision support systems
- Theory of computation
- Context free grammars
- Linear bounded automata
- Turing machine
- Chomsky hierarchy of languages
- Models for information channel
- Variable length codes
- Error correcting and detecting codes
- Image processing
- Data compression techniques
- LPP in canonical form
- Conversion of LPP in standard form to LPP in canonical form
- Simplex
- Prevention of cyclic computations in simplex and tableau
- Big-m method
- Dual simplex and revised simplex
- Complexity of simplex algorithm
- Exponential behaviour of simplex
- Ellipsoid method and Karmakar's method for solving LPPs
- Solving simple LPPs through these methods
- Comparison of complexity of these methods
- Assignment and transportation problems
- Simple algorithms like Hungarian method
- Shortest path problems
- Network flow problem
- Matroids
- Nonlinear programming
- Neural networks
- Fuzzy systems
- Unix
- Windows
For More Information visit Officially Website of UGC NET.