CBSE NET 2018 Computer Science and Applications Syllabus

Subject : Computer Science and Applications ( Code No : 87  )


There will be two question papers, UGC NET CS Paper II and Paper III ( Part – A & B ). UGC NET CS Paper II will cover 50 Objective Type Questions ( Multiple choice, Matching type, True / False, Assertion-Reasoning type ) carrying 100 marks.

UGC NET CS Paper III will have two Parts-A and B; Paper III ( A ) will have 10 short essay type questions ( 300 words ) carrying 16 marks each. In it there will be one question with internal choice from each unit ( i.e.. 10 questions from 10 units; Total marks will be 160 ).

UGC NET CS Paper III ( B ) will be compulsory and there will be one question from each of the Electives. The candidate will attempt only one question ( one elective only in 800 words ) carrying 40 marks. Total marks of UGC NET CS Paper III will be 200.


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 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. Centres of a tree. Hamiltonian and Eulerian graphs, 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 iteration(s). Structured data types in C-arrays, struct, union, string, and pointers.

O – O Programming Concepts : Class, object, instantiation. Inheritance, polymorphism and overloading.

C++ Programming : Elements of C++ – Tokens, identifiers. Variables and constants, Datatypes, Operators, Control statements. Functions parameter passing. Class and objects. Constructors and destructors. Overloading, Inheritance, Templates, Exception handling.

4. Relational Database Design and SQL

E-R diagrams and their transformation to relational design, normalization – INF, 2NF, 3NF, BCNF and 4NF. Limitations of 4NF 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.

5. Data and File structures

Data, Information, Definition of data structure. Arrays, stacks, queues, linked lists, trees, graphs, priority queues and heaps.

File Structures : Fields, records and files. Sequential, direct, index-sequential and relative files. Hashing, inverted lists and multi – lists. B trees and B+ trees.

6. Computer Networks

Network fundamentals : Local Area Networks ( LAN ), Metropolitan Area Networks ( MAN ), Wide Area Networks ( WAN ), Wireless Networks, Inter Networks.

Reference Models : The OSI model, TCP / IP model.

Data Communication : Channel capacity. Transmission media-twisted pair, coaxial cables, fibre – optic cables, wireless transmission-radio, microwave, infrared and millimeter waves. Lightwave transmission. Thelephones – local loop, trunks, multiplexing, switching, narrowband ISDN, broadband ISDN, ATM, High speed LANS. Cellular Radio. Communication satellites-geosynchronous and low-orbit.

Internetworking : Switch / Hub, Bridge, Router, Gateways, Concatenated virtual circuits, Tunnelling, Fragmentation, Firewalls.

Routing : Virtual circuits and datagrams. Routing algorithms. Conjestion control.

Network Security : Cryptography-public key, secret key. Domain Name System ( DNS ) – Electronic Mail and Worldwide Web ( WWW ). The DNS, Resource Records, Name servers. E-mail-architecture and Serves.

7. System Software and Compilers

  • Assembly language fundamentals ( 8085 based assembly language programming ). Assemblers-2-pass and single-pass. Macros and macroprocessors.
  • Loading, linking, relocation, program relocatability. Linkage editing.
  • Text editors. Programming Environments. Debuggers and program generators.
  • Compilation and Interpretation. Bootstrap compilers. Phases of compilation process. Lexical analysis. Lex package on Unix system.
  • Context free grammars. Parsing and parse trees. Representation of parse ( derivation ) trees as rightmost and leftmost derivations. Bottom up parsers-shift-reduce, operator precedence, and LR. YACC package on Unix system.
  • Topdown parsers-left recursion and its removal. Recursive descent parser. Predictive parser. Intermediate codes-Quadruples, Triples, Intermediate code generation, Code generation, Code optimization.

8. Operating Systems ( with Case Study of Unix )

Main functions of operating systems. Multiprogramming, multiprocessing, and multitasking.

Memory Management : Virtual memory, paging, fragmentation.

Concurrent Processing : Mutual exclusion. Critical regions, lock and unlock.

Scheduling : CPU scheduling, I / O scheduling, Resource scheduling. Deadlock and scheduling algorithms. Banker’s algorithm for deadlock handling.


  • The Unix System : File system, process management, bourne shell, shell variables, command line programming.
  • Filters and Commands : Pr, head, tail, cut, paste, sort, uniq, tr, join, etc., grep, egrep, fgrep, etc., sed, awk, etc.
  • System Calls ( like ) : Creat, open, close, read, write, iseek, link, unlink, stat, fstat, umask, chmod, exec, fork, wait, system.

9. Software Engineering

  • System Development Life Cycle ( SDLC ) : 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 and reliability. Clean room approach, software reengineering.

10. Current Trends and Technologies

The topics of current interest in Computer Science and Computer Applications shall be covered. The experts shall use their judgement from time to time to include the topics of popular interest, which are expected to be known for an application development software professional, currently, they include

Parallel Computing

Parallel virtual machine ( pvm ) and message passing interface ( MPI ) libraries and calls. Advanced architectures. Today’s fastest computers.

Mobile Computing

Mobile connectivity – Cells, Framework, wireless delivery technology and switching methods, mobile information access devices, mobile data internetworking standards, cellular data communication protocols, mobile computing applications. Mobile databases – protocols, scope, tools and technology. M-business.

E – Technologies

  • Electronic Commerce : Framework, Media Convergence of Applications, Consumer Applications, Organisation Applications.
  • Electronic Payment Systems : Digital Token, Smart Cards, Credit Cards, Risks in Electronic Payment System, Designing Electronic Payment Systems.
  • Electronic Data Interchange ( EDI ) : Concepts, Applications, ( Legal, Security and Privacy ) issues, EDI and Electronic Commerce, Standardization and EDI, EDI Software Implementation, EDI Envelope for Message Transport, Internet – Based EDI.
  • Digital Libraries and Data Warehousing : Concepts, Types of Digital documents, Issues behind document Infrastructure, Corporate Data Warehouses.
  • Software Agents : Characteristics and Properties of Agents, Technology behind Software Agents ( Applets, Browsers and Software Agents ).
  • Broadband Telecommunications : Concepts, Frame Relay, Cell Relay, Switched Multimegabit Data Service, Asynchronous Transfer Mode.
    Main concepts in Geographical Information System ( GIS ), E – cash, E – Business, ERP packages.
  • Data Warehousing : Data Warehouse environment, architecture of a data warehouse methodology, analysis, design, construction and administration.
  • Data Mining : Extracting models and patterns from large databases, data mining techniques, classification, regression, clustering, summarization, dependency modelling, link analysis, sequencing analysis, mining scientific and business data.

Windows Programming

Introduction to Windows programming – Win32, Microsoft Foundation Classes ( MFC ), Documents and views, Resources, Message handling in windows.

Simple Applications ( in windows ) : Scrolling, splitting views, docking toolbars, status bars, common dialogs.

Advanced Windows Programming

Multiple Document Interface ( MDI ), Multithreading. Object linking and Embedding ( OLE ). Active X controls. Active Template Library ( ATL ). Network programming.

UGC NET CS Paper III ( A ) Core Group

Unit – I

Combinational Circuit Design, Sequential Circuit Design, Hardwired and Micro Programmed processor design, Instruction formats, Addressing modes, Memory types and organisation, Interfacing peripheral devices, Interrupts.

Microprocessor architecture, Instruction set and Programming ( 8085, P – III / P – IV ), Microprocessor applications.

Unit – II

Database Concepts, ER diagrams, Data Models, Design of Relational Database, Normalisation, SQL and QBE, Query Processing and Optimisation, Centralised and Distributed Database, Security, Concurrency and Recovery in Centralised and Distributed Database Systems, Object Oriented Database Management Systems ( Concepts, Composite objects, Integration with RDBMS applications ), ORACLE.

Unit – III

  • Display systems, Input devices, 2D Geometry, Graphic operations, 3D Graphics, Animation, Graphic standard, Applications.
  • Concepts, Storage Devices, Input Tools, Authoring Tools, Application, Files.

Unit – IV

  • Programming language concepts, paradigms and models.
  • Data : Data types, Operators, Expressions, Assignment. Flow of Control.
  • Control structures, I / O statements, User – defined and built – in functions, Parameter passing.
  • Principles, classes, inheritance, class hierarchies, polymorphism, dynamic binding, reference semantics and their implementation.
  • Principles, functions, lists, types and polymorphisms, higher order functions, lazy evaluation, equations and pattern matching.
  • Principles, horn clauses and their execution, logical variables, relations, data structures, controlling the search order, program development in prolog, implementation of prolog, example programs in prolog.
  • Principles of parallelism, coroutines, communication and execution. Parallel Virtual Machine ( PVM ) and Message Passing Interface ( MPI ) routines and calls. Parallel programs in PVM paradigm as well as MPI paradigm for simple problems like matrix multiplication.
  • Preconditions, post-conditions, axiomatic approach for semantics, correctness, denotational semantics.
  • Compiler structure, compiler construction tools, compilation phases.
  • Finite Automata, Pushdown Automata. Non-determinism and NFA, DPDA, and PDAs and languages accepted by these structures. Grammars, Languages – types of grammars – type 0, type 1, type 2, and type 3. The relationship between types of grammars, and finite machines. Pushdown automata and Context Free Grammars. Lexical Analysis-regular expressions and regular languages. LEX package on Unix. Conversion of NFA to DFA. Minimizing the number of states in a DFA Compilation and Interpretation. Bootstrap compilers.
  • Context free grammars. Parsing and parse trees. Representation of parse ( derivation ) trees as rightmost and leftmost derivations. Bottom up parsers-shift-reduce, operator precedence, and LR. YACC package on Unix system. Top down parsers-left recursion and its removal. Recursive descent parser. Predictive parser, Intermediate codes – Quadruples, triples. Intermediate code generation, code generation. Code optimization.

Unit – V

  • Analog and Digital transmission, Asynchronous and Synchronous transmission, Transmission media, Multiplexing and Concentration, Switching techniques, Polling.
  • Topologies, Networking Devices, OSI Reference Model, Protocols for :
    1. Data link layer
    2. Network layer
    3. Transport layer, TCP / IP protocols, Networks security, Network administration.

Unit – VI

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 notations-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.

Unit – VII

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, Servelets, Applets.

Unit – VIII

Software development models, Requirement analysis and specifications, Software design, Programming techniques and tools, Software validation and quality assurance techniques, Software maintenance and advanced concepts, Software management.

Unit – IX

Introduction, Memory management, Support for concurrent process, Scheduling, System deadlock, Multiprogramming system, I/O management, Distributed operating systems, Study of Unix and Windows NT.

Unit – X

  • Definitions, AI approach for solving problems.
  • Automated Reasoning with prepositional logic and predicate logic-fundamental proof procedure, refutation, resolution, refinements to resolution ( ordering / pruning / restriction strategies ).
  • State space representation of problems, bounding functions, breadth first, depth first, A, A*, AO*, etc. 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 ( TAGs ).
  • 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.

UGC NET CS Paper III ( B ) ( Elective / Optional )

Elective – I

Theory of Computation : Formal language, Need for formal computational models, Non-computational problems, diagonal argument and Russel’s paradox.

Deterministic Finite Automaton ( DFA ), Non – deterministic Finite Automaton ( NFA ), Regular languages and regular sets, Equivalence of DFA and NFA. Minimizing the number of states of a DFA. Non-regular languages, and Pumping lemma.

Pushdown Automaton ( PDA ), Deterministic Pushdown Automaton ( DPDA ), Non – equilvalence of PDA and DPDA.

Context free Grammars : Greibach Normal Form ( GNF ) and Chomsky Normal Form ( CNF ), Ambiguity, Parse Tree Representation of Derivations. Equivalence of PDA’s and CFG’s. Parsing techniques for parsing of general CFG’s – Early’s, Cook – Kassami-Younger ( CKY ), and Tomita’s parsing.

Linear Bounded Automata ( LBA ) : Power of LBA Closure properties.

Turing Machine ( TM ) : One tape, multitape. The notions 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 languages.

Elective – II

Models for Information Channel : Discrete Memoryless 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 optimality of Information transmission.

Variable Length Codes : Prefix Codes, Huffmann Codes, Lempel-Ziev ( LZ ) Codes. Optirnality of these codes. Information content of these codes.

Error Correcting and Detecting Codes : Finite fields, Hamming distance, Bounds of codes, Linear (Parity Check) codes, Parity check matrix, Generator matrix, Decoding of linear codes, Hamming codes.

Image Processing : Image Registration, Spatial Fourier Transforms, Discrete Spatial ( 2 dimensional ) Fourier Transforms, Restoration, Lossy Compression of images ( pictures ).

Data Compression Techniques : Representation and compression of text, sound, picture, and video files ( based on the JPEG and MPEG standards ).

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 computations in Simplex and Tableau, Big-M method, dual simplex and revised simplex.

Complexity of simplex algorithm(s). 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, etc.

Shortest Path Problems : Dijkstra’s and Moore’s method. Complexity.

Network Flow Problem : Formulation. Max – Flow Min – Cut theorem. Ford and Fulkerson’s algorithm. Exponential behaviour of Ford and Fulkerson’s algorithm. Malhotra – Pramodkumar-Maheshwari ( MPM ) Polynomial algorithm for solving Network flow problem. Bipartite Graphs and Matchings; Solving matching problems using Network flow problems.

Matroids : Definition. Graphic and Cographic matroids. Matroid intersection problem.

Non-linear Programming : Kuhn – Tucker conditions. Convex functions and Convex regions. Convex programming problems. Algorithms for solving convex programming problems-Rate of convergence of iterative methods for solving these problems.

Elective – IV

Neural Networks : Perceptron model, Linear separability and XOR problem. Two and three layered neural nets, Back Propagation – Convergence, Hopfield nets, Neural net learning, Applications.

Fuzzy Systems : Definition of a Fuzzy set, Fuzzy relations, Fuzzy functions, Fuzzy measures, Fuzzy reasoning, Applications of Fuzzy systems.

Elective – V

Unix : Operating System, Structure of Unix Operating System, Unix Commands, Interfacing with Unix, Editors and Compilers for Unix, LEX and YACC, File system, System calls, Filters, Shell programming.

Windows : Windows environment, Unicode, Documents and Views, Drawing in a window, Message handling, Scrolling and Splitting views, Docking toolbars and Status bars, Common dialogs and Controls, MDI, Multithreading, OLE, Active X controls, ATL, Database access, Network programming.


139 thoughts on “UGC NET July 2018 Computer Science and Applications Syllabus

  1. we need to syllabus for NET exam and institute also in pune city. we want to join the coaching.

  2. Hlo Sir/mam
    i want to know about slybus nd reference book of computer science and application.

  3. pls inform me about last date of submission form of UGC NET june 2016 computer science and applications

  4. i just want to know what should be the strategy to pass NET 87, and any suggestive study material related which may help most. I need your reply…

  5. sir,I required information about new activities of ugc net sub is computer science and application…………….

  6. pls advise net exam for computer application
    b,coz i didn’t get the notification correct time so, i miss exam

  7. I completed MSC computer science ,I need syllabus ,previous year solved question papers of computer science and guidance to preparation for net exam plz send to my mail.

  8. Sir,i completed my MCA nd now i want to apply for NET exam,so plz send me detail about computer science net exam,syllabus etc.Thanks

  9. Hlo! I completed my MCA nd now I want to apply for NET so plz send me erery detail about computer science net exam, syllabus etc. Thanks.

  10. I Completed MCA. I am Willing to apply Net exam So i need every updates regarding Net exams,Syllabus,etc.Thank You

  11. Sir, I need the net exam notification.
    and please send the syllabus of exam of computer science and application on my email I’d.

  12. sir i want to appear in net exam of computer application.plz send me syllabus of this sub on my r mail id

  13. I need the net exam notification dec 2015 and syllabus on my mail
    By Dhwnsri basumatary from kokrajhar,assam on august 24,2015 at 1:17pm

  14. sir/madam… please sen me net exam notification and syllabus of december 2015 subject of computer science and application on my gmail id.thanks

  15. Dear sir/madam..I had completed my Msc-it degree. I need the net exam notification and syllabus of December 2015 subject of computer science and application on my email.

  16. Gud mrng sir. I had completed my MCA degree.i can apply from please infrom notification regarding exam and set me the next exam date in my phone msg . Thanking you

  17. I need the net exam notification of December 2015 subject of computer science and application on my mail.

  18. Dear sir/madam .I have finished msc mphil in computer science. Now i want to attend Net Exam Aug2015. In csir official notification there was no detail about the subject code for computer science . I need the subject code for CS. Please send it me as earlier. Thank you

  19. pls send syllabus for computer science and applications (87) to my email id and also some pdf files related to topics or some websites or books with author name.

  20. pleas send syllabus for UGC entrance exam in computer science stream on my email id. thankyou

  21. Greeting Mam/Sir,
    Pls,send the notification and syllabus for the computer science NET Exam..
    to my Mail…
    Thanking You…

  22. Greetings mam,

    Please guide me help me to get the study material as per the UGC NET syllabus for computer science.


  23. Sir/Mam, Plz send me study materials and format of paper1,2,3 question paper and guide me to prepare for net exam dec 2015 computer science… Hope u reply….

  24. I am gutte fulchand ,now study in last year of mca con i give net if so than plz send me syllabus.

  25. sir pls send me ugc computer science syllabus and study material and pls suggest to me how can preparation to this exam and when from fill up.

  26. Pls send me UGC Net COMPUTER Syllabus and study material and suggest me how to preparation to this exam and when from fill up.

  27. sir pls send me ugc computer science syllabus and stydy mattrial and pls suggerst to me how can preparation to this exam

  28. I Have done Masters in computer Managment. Am I elligible for taking UGC NET paper. Please intimate the date when forms can be filled. Waiting for your prompt reply

  29. hello sir/mam
    please send me the syllabus And courses material for computer science .for clear ugc net and also GATE .HOPE YOU REVERT POSITIVELY SOON

  30. Which book is helpful for UGC NET June 2015 Computer Science and Applications and which book covers all the syllabus for Computer Science and Applications.

  31. Am I eligible to apply UGC NET Examination in Computer Science & Application upcoming June,2015?

    Samir Biswas
    M.Tech in Information Technology

  32. Am I eligible for apply UGC NET Examination of Computer Science & Application?

    Samir Biswas
    M.Tech in Information Technology


  34. Pls send me the details about reference books for all subjects..that helpful to net exam computer science and application

  35. please send the net exam dates on 2015 and send me Paper 1,2,&3 which books are referring to me,as well as study material for all papers.Thanks

  36. please do send the net exams papers,syllabus and 5 years questions papers for 1,2,3 papers 2 n 3 papers for computer science.

  37. Please send the complete UGC NET December 2014 Computer and Applications examination paper, syllabus and recommended books available on paper 1,2 &3.Thanks

  38. Plz send me the model question for paper III computer science or how it will be in cbse dec 2014 net……I m confused.

  39. May i know whether any change in paper III question pattern for computer science and applications in dec net 2014

  40. I confused for paper II and Paper III Exam pattern. ugc said that Paper III haveing 75 que for 150 marks and U???

  41. what is the scheme of cbse net exam..? subjective or objective?/ in the cbse website, they have given the scheme of objective and multiple choice questions..

  42. it just confuse me cbse said that 3rd paper having 75 question for 150 marks and your site said that 3rd paper having 200 marks and also have two part A and B so can you please tell me what is the exact format of exam.

  43. Hello, I am computer science Engineer from BU bhopal.could u please let me know B.E/B.Tech are eligible for NET or one should b ME/ and how many times 1 can appear for net.

  44. Please update me online coaching centre or where we get the full covered materials for computer science

  45. i need syllabus for computer science also i want to search a coaching center any buddy help me if then contact me on my mobile no 9996499696 and tell me name of institute

  46. Hi, i want 2014 June computer science and applications question paper. and i want to know about the question patterns. because, the previous year(2013) question papers have objective type questions for both 2 paper and 3 paper. but, in the module question paper of the syllabus(which is in distributive type questions for 3 paper.which pattern is correct for the coming(2014 December) UGC NET exam.please, help to clear my doubt.

  47. Please I want last 5 years solved question paper for computer science and Application as well as study material for paper 1 also.

  48. Sir plz send me some sample paper n question papers of net with solutins on my email id..thanks a lot

  49. where i have to find the materials for the exam..
    can u say me the website for studying those syllabus..

  50. I want to old NET/JRF solved question papers Paper-1 & Paper2,3, Paper code-87. Please tell me the book & where i want purchase.

  51. where can i get the study materials for computer science &applns.NET exam?Are there any coaching institutes or any special websites for the required materials?

  52. Dear Sir/Mam,
    I am sorry to say, that all my friends and also myself feel very lengthy syllabus has been given. Is this heavy syllabus required to teach degree students ? Please mail your valuable suggestions.

    Thanking you, Yours Faithfully,
    K.Hima Bindhu.

  53. where i can get the study material according to the syllabus mentioned in ugc net syllabus please send/mention website for the required study material.

Leave a Reply

Your email address will not be published. Required fields are marked *