UGC NET Computer Science Syllabus
National Testing Agency (NTA) has laid down the UGC NET Computer Science Syllabus 2019. Candidates who are going to appear for Union Grant commission National Eligibility Test must download the CS and Applications Syllabus from here.
Through UGC NET Computer Science Syllabus candidates will be able to know about the important topics and concepts. By preparing from the latest UGC NET CS Syllabus, candidates can clear the UGC NET exam.
UGC NET Syllabus For Computer Science
National Testing Agency (NTA) will conduct the NET Exam in three stages and candidates who want to appoint for the Teaching post, they must be qualify in all the stages.
Eager candidates can check the exam pattern, UGC NET Computer Science Syllabus 2019 which is well provided by the team member of www.recruitmentinboxx.comand start their preparation according to it.
UGC NET Computer Science Syllabus
Detailed UGC NET Computer Science And Applications Syllabus is provided here. And, we also provided the UGC NET Syllabus for Computer Science and Applications 2019 Pdf, so download it and begin your peroration accordingly.
UGC NET Computer Science Paper – II Syllabus
Discrete Structure:
| Sets, relation, Functions, Pigeonhole Principle, inclusion-Exclusion Principle, Equivalence and Partial orderings, elementary counting techniques Probability, Measures for Information and total information |
| Compatibility: Model of computation-Finite Automata, Pushdown Automata, Non-determinism and NFS, DPDA and PDAs and languages accepted by these structure, Grammars languages, non-compatibility and example of non-computable problems |
| Graph-definitions 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, and centers of a tree, Hamiltonian and Eulerian graphs, and planar graphs |
Get Here, Detailed: UGC NET Syllabus
UGC NET CS Syllabus For Computer Arithmetic:
- Proportional (Boolean Logic), Predicate Logic, Well-formed formula (WFF), Satisfactory and tautology
- Logic Families: TTL, ECL and C-MOS sates, Boolean algebra and minimization of Boolean functions, Flip-Flop type’s race conditions and comparison, Design of combinational and sequential circuits
- Representation of Integer: Octal, Hex, Decimal and Binary, 2;s Complement and 1’s complement arithmetic, Floating point representation
Programming in C and C++:
| Programming in C | Element of C-Tokens, Identifiers, Data types in C, Control structure in C, Sequence selection and iteration, Structured data types in C-arrays, structure, union, string an pointers |
| O-O Programming concepts | Classes, Object, installation, Inheritance, Polymorphism and overloading |
| C++ Programming | Element of C++ Tokens, identifiers, Variable and constants, Data types, Operator, Control Statement, Function parameter passing, Class and object, Constructor and destructor, overloading inheritance temples , exception handling |
Relational Database Design and SQL:
- E-R Diagram and their transformation to relation design, normalization -INF, 2NF and BCNF
- SQL: Data definition language (DDL) Data manipulation language (DML), Data control language (DCL) commands database objects like. Views indexes, sequences, synonyms, data dictionary.
Check Updated: UGC NET Exam Pattern
Data and File Structure:
| Data information, definition of data structure, arrays, stacks, queues, linked lists, trees, Graphs, priority queues, and heaps |
| File Structure: Fields, records, and files sequential direct, index Sequential and elative files hashing, inverted lists multi list, B trees and B+ trees. |
UGC NET Syllabus Of Computer Science For Computer Network:
- Network Fundaments: Local area Network (LAN), metropolitan Area Network *(MKAN), Wide area Network (WAN) m, Wireless Network, Inter Network
- Data Communication: channel capacity. Twisted pasi Coaxial cables, Fiber optic cables, Wireless transmission -radio, microwave infrared and millimeter waves Light wave transmission , telephones-local loop, trunks, multiplexing switching, narrowband ISDNm broadband ISDNm ATM, High speed LANS, Cellular radio Communication satellite-Geosynchronous and low orbit
Syllabus For UGC NET Computer Science of System Software:
- Assemble language fundamental (8085 based assembly language programming), Assemblr-2 pass and single pass, Macros and Microprocessor
- Text editor programming environments debugger and program generator
- Phase of Compilation process, Lexical analysis, Lex package on UNIX System
CBSE UGC NET Computer Science Syllabus for Operating System:
| Main function of operating system, Multiprogramming multiprocessing and multitasking |
| Memory management: Virtual memory, Paging, fragmentation |
| Concurrent processing: mutual exclusion, critical regions, locks ad unlock |
| Scheduling: CPU Scheduling, I/O Scheduling, resource scheduling, Banker’s Algorithm for deadlock handling. |
Read Out Here: UGC NET Question Papers
UGC NET Syllabus Computer Science for Software engineering:
- System development cycle (SDCL): Steps, water fall model, Prototypes, Spiral model
- Software Metrics: Software Project Management
- Software Design: System Design , Detailed design., function oriented design, Object oriented design, user interface design, Design level metrics
- Coding and testing: testing level metrics, Software quality ad reliability, clean room approach, Software reengineering
UGC NET 2019 Syllabus For Computer Science of Current Trends and Technologies:
The topic of current interest in Computer Science and Computer application shall be recovered. The expert shall use their judgment from time to time to include the topics of popular interest, which are expected to be known for an application development software
UGC NET Computer Science Paper-III Syllabus
Paper-III(A)Core Group
Unit-I
| Combinational circuit design, Sequential Circuit design, Hardware ad Micro programmed processor design, Instruction formats, Addressing models Memory types and organization, Interfacing peripheral devices, Interrupts |
| Microprocessor architecture, Instruction set and Programming (8085. P-III/P-IV), Microprocessor applications |
Unit-II
- Database concepts, ER diagrams, Data model, Design of Relational Database, Normalization, SQL and QBE, Query Processing and Optimization, Centralized and Distributed Database, Security
- Concurrency an recovery in centralized and Distributed Database System, Object oriented Database Management System (Concept, composite object , Integration with RDBMS application), ORACLE.
Do You Know: How To Maximize Your Score In Exam
Unit-III
| Display system , input devise, 2D, geometry, Graphics operation, 3D Graphics, Animation Graphic Standard, Application |
| concepts, Storage Devices, Input Tools, Authoring Tools, Application files |
Unit-IV
- Programming language , concepts, Paradigm and models
- Data , Data types, Operators, Expressions, Assignments , Flow of control-Control Structure, I/O Statement, User Defined and Built in Function parameter passing
- Principles , Classes, Inheritance, Class hierarchies, Polymorphism, Dynamic binding, reference semantics and their implementationetc
Unit-V
| Analogue and Digital Transmission, Asynchronous and Synchronous transitions Transmission media, Multiplexing and Concentration Switch if techniques Polling |
| Topologies m Networking devices, OSI, Reference Model Protocol for -(i) Data link layer, (ii) Network layer and (iii) Transpire layer , TCP/IP Protocol Network security, Network Administration |
Unit-VI
- Definition , simple and composite structure, Arraue lists, stacks queues, Priority Queues, Binary trees , B-Trees Graphs
- Sorting searching Algorithms, Analysis of algorithms, Interpolation and Binary search, Asymmetric notation, Bih ohm, Omega and Theta, Average case case analysis of simple programmes like finding of maximum of n elements, recursion and its systematic removal
- Quicksort-Non-recurive implementation with minimal stake storage, Design of algorithm(divide and Conquer, greedy method, Dynamic programming Back tracking, Brach and Bound(), Lower bound theory, Non-deterministic algorithm Non-Deterministic algprogramming, construct, Simple non-deterministic programs, NP-hard and NP-complete problems
Check Out: How To Get Rid Of Sleeping While Studying
Unit-VII
| Object, message, classed, encapsulation, inheritance, polymorphism, aggregation, abstract, lasses, generalization and extension and restriction m Object oriented design, Multiple, inheritance metadata |
| HTML, DHTML, XML, Scripting, JAVA, Sevelets, Applets |
Unit-VIII
- Software development models, Requirement analysis and specification software design Programming techniques and tools software validation
- Quality assurance techniques, Software maintenance and advanced concepts , Software management
Unit-IX
| Introduction, memory management, Support for concurrent process Scheduling |
| System deadlock, Multiplexing system |
| I/O Management distributes operating system Study of UNIX and Window NT |
Unit-X
- definition, AI approach foe sloping problems
- Automated Reasoning with propositional logic and predicate logic-Fundamental proof procedure, Refutation , resolution refinement to resolution (ordering/Pruning/Restriction strategies)
- State solace representation of problems, Bounding functions, breadth first depth first, A, A*, AO* etc performance, comparison of various techniques
- Frame, scripts, Semantic nets, production systems, Procedurural representation , Prolog programming
Must Check: 11 Tips To Remember What You Read
Paper-III(B)[Elective/Optional]
Elective-I
| Theoory of computation: Formal language, need for formal computational model, Non-Computational model on computational problems, Diagonal argument and Russell’s paradox |
| Deterministic Finite Automata(DFA), Non deterministic finite Automaton (NFA),Digital languages ad regular sets Equivalence, of DFA, and NFA |
| Minimizing the numbers of state of a DFA, non-regulate language m, and pumping lemma |
| Pushdown Automaton (PDA. Deterministic, Pushdoam Automaton (DPDA), No equivalence of PDA and DPDA |
| Context free grammars: greenback Normal form (GNF) ad Chomsky Normal Form (CNF), Ambiguity , Parse Tree, representation of derivation, Equivalence of PDA’s and CFG;s Parsing techniques for parsing of general CFG’ -Early’s Cook-Kassami-YUNGer (CKY) and Tomitta parsing |
| Linear Bounded Automaton (LBA): Power of LBA , Closure Properties |
| Turing Machine (TM) : One tape, Multiple, the notion of time and space complexity in terms of TM, Construction of TM for simple problems, Computational Complexity |
| Chomsky Hierarchy of Languages: Recursive and Recursively enumerable language |
Elective-II
- Model for information Channel: Discrete Memory less channel, Binary Symmetric Channel(BSC), Burst channel, Bit-error rates, Probability, entropy and Shannon’s measure of information, Mutual information, channel capacity theorem, rate and optimally of information transform mission
- Variable Length codes: Prefix Codes, Human Codes, lempel -Ziew (LZ) Codes, Optimally of these cases Information content of these codes
- Error Correcting and detecting Codes: Finite fields, Hamming Distance, Bounds of Codes, Linear (Party check) Codes, Parity check matrix, generator Matrix, Decoding of linear codes, Hamming Codes
- Image Processing: Image Processing, Spatial Fourier, Transform Discrete Spatial Fourier Transform Restoration , Loss compression of image s(pictures)
- Data compression techniques :representation and compression of text, sound, picture, and video files based of MPEG and JPEG standards
Get Best Answer: How to Score Good Marks in Exam
Elective-III
| Linear programming Problem (LPP) in the standard form, LPP in canonical form, conversion of LPP in Standard form to LPP in Canonical form |
| Simplex-Prevention of cyclic computation in simplex and Tableau, Big-M method, Dual Simplex and reviewed simplex |
| Complexity of simple Algorithm(s), Exponential behaviors of simplex |
| Ellipsoid method and Karmakar’s Method for solving LPPs. Solving simple LLPs through theses methods, comparison of complexity of theses methods |
| Assignment and Transportation Problems: Simple algorithm like Hungarian method etc |
| Shortest Path Problems: Dijkstra’a and Moore’s method Complexity |
| Network Flow problem: Formulation, Max Flow min-Cut Theorem. Ford and Fulkerson;s algorithm,. Exponential behavior of f rod and fulkerson;salorithim, Malhotra-PromodKUMar-Maheswari (MPM), Polynomial Method for solving network problem, Bipartite Graphs and Matching, Solving matching using network flow problems |
| Matriods: Definition, Graphic and co graphic matriods, Matriods intersection problem |
| Non-Linear programming: Kuhn-Tucker conditions, Convex function and Convex region, Convex programming problems, Algorithms for solving convex programming problems-Rate of convergence of iterative method for solving theses problems |
Elective-IV
- Neural network: Perception Model, Linear Severability and XOR problem, Two and three layered neural network, Backprpaogation-Convergence, Hopfield nets, Neural net Learning, Application
- Fuzzy System: Definition of a Fuzzy ste, fuzzy relation, fuzzy functions, Fuzzy measures, Fuzzy reasoning, Application of Fuzzy systems
Elective-V
| UNIX | Operating system, Structure of UNIX, Operating system, UNIX Commands, Interfacing with UNIX, Editors and Compliers for UNIX, LEX and YACC , File System, System calls, Filters, Shell programming |
| Windows | Windows environment,. Unicode, Documents and Views, Drawing in window, Message handing, Scrolling and Splitting views, Docking toolbar and status bar, Common dialogue and control, MDI, Multithreading , OLE, Active X Control, ATL, Database, access, Network programming |
Also Read: How To Write On Exam Paper Faster & Better
UGC NET Exam Pattern
| Parts of Exam | Total Number of Questions | Maximum Marks | |
| Part-II | 50 | 100 | |
| Part-III | (A) | 10 | 160 |
| (B) | 01 | 40 | |
| Total | 61 | 200 | |
Instructions To Be Consider:
- Paper II will cover 50 objective Type Questions.
- Paper III will have descriptive type questions.
- Total marks for paper 3 will be 200.
Must Read: How To Prepare For UGC NET Exam
How To Download UGC NET Computer Science 2019 Syllabus?
Follow these steps to download UGC NET Exam Syllabus For Computer Science, take a look…
- Candidates are required to open official site of University Gran Commission which is www.ugc.ac.in/net/.
- On homepage of official web site, select “Syllabus for NET” link.
- A new page will open on your computer screen with various UGC NET Syllabus.
- Now, select the link of UGC NET 2019 Syllabus For Computer Science.
- Consequently, UGC NET Syllabus 2019 For Computer ScienceInPdf format will open.
- Download it and get printout of UGC NET 2019 Computer Science Syllabus.
Press Here For UGC NET Computer Science Syllabus Pdf
Press Here For UGC NET Computer Science Official Link
Important Note:
Before appearing for NTA UGC Exam, you must have Syllabus Of UGC NET Computer Science. So go through this page and start your preparation according to UGC NET Computer Science Syllabus 2019.
Stay tuned with us on our web portal www.recruitmentinboxx.com for getting instant updates about Teaching Jobs, admit card, results etc. Thank you for visiting us and wish you very best of luck for your exam.
You May Also Like To Visit This Section