Download Last 5 Years Solved Papers of UGC NET Computer Science (2013 – 2017)
Find the reference book : UGC NET Computer Science Reference Books
8 Most Important books for UGCNET/JRF/SET in Computer Science
Category Recommended books
Introduction: The National Eligibility Test (NET) is organized twice a year to determine the eligibility for lectureship and for award of Junior Research Fellowship (JRF). This year onwards the prestigious examination will be conducted by the Central Board of Secondary Education (CBSE) and the present book has been designed according to the recent examination pattern issued by the UGC for General Paper 1.
The present book for General Paper1 UGC NET/JRF/SLET has been divided into 10 Units namely Teaching Aptitude, Research Aptitude, Reading Comprehension, Communication, Reasoning (Including Mathematical), Logical Reasoning, Data Interpretation, Information & Communication Technology, People & Environment and Higher Education System: Governance, Polity and Administration, each subdivided into number of chapters as per the syllabi of the examination. This book focuses on General Paper  1 Teaching & Research Aptitude and is completely based on the syllabi and the latest pattern of the UGCNET General Paper1. More than 4000 previous years' objective questions from 2008 to 2015 have been covered chapter wise in the book. The book also contains last four years' (20122015) Solved Papers of UGC NET General Paper1 to help aspirants get an insight into the recent examination pattern and the types of questions asked therein. The previous years' Papers have been solved in detail to ensure comprehensive and indepth knowledge of the concepts. The book also contains various types of objective questions based on the latest examination pattern to help the candidates get familiar with the new examination pattern. This book is equally useful for various State Eligibility Tests as well. Also two Model Sets for General Paper 1 have been provided in the book for the purpose of mock revision for the upcoming exam.
As the book has been designed according to the latest examination pattern of upcoming UGC General Paper1 2016, it for sure will help the aspirants climb up the ladder of success.
Section  IBPS Reference Books for English Language  Flipkart  Amazon 
 UGCNET/JRF/SET solved previous years question papers from 2004 to 2014 Paperback – 2016 by Mr S P Sajjan  
Trueman's UGC NET/SLET General Paper I Paperback – 1 Jan 2016 by M. Gagan (Author), Sajit Kumar (Author) 
 
UGC Computer Science and Application Paperback – 1 Jan 2016 by Sanjay Singhal (Author), Sameer Mishra (Author) 
 
UGC NET/JRF/SLET General Paper1 Teaching & Research Aptitude Paperback – 2 Feb 2016 by Arihant Experts (Author) 

 
UGC NET/SET (JRF & LS) Management Paper II & III Paperback – 20 Apr 2016 by Mohit Agarwal (Author), Third (Editor) 
 
CBSEUGCNET Teaching & research Aptitude 50 pracitice sets (Solved with Explanations) Paperback – 2016 by RPH Editorial Board (Author) 
 
UGC NET Computer Science & Applications (Paper II & III) JRF and Assistant Professor Exam Guide (CBSE UGC (NET) JRF & Asstt. Professor Exam) Paperback – 2015 by Shamshur Rabb Khan & RPH Editorial Board (Author) 

 
UGCNET: Computer Sciences & Applications (Paper I, II & III) Previous Years Papers (Solved) Paperback – 2016 by RPH Editorial Board (Author) 


Code No.: 87 CBSE NET January 2017 Computer Science and Applications Syllabus
There is a two type of question papers, UGC NET CS Paper II and Paper III ( Part – A & B ). UGC NET CS Paper II will cover total fifty(50) Objective Type Questions i.e. Multiple choice, Matching type, True / False, AssertionReasoning type and total marks will be 100.
UGC NET CS Paper III will have two PartsA 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.
Table for Syllabus breakup:
Computer Science and Applications Syllabus  Details 
Syllabus for UGC NET CS Paper II  50 Objective Type Questions. Total marks will be 100 
UGC NET CS Paper III (A) Core Group  10 short essay type questions. Total marks will be 160 
UGC NET CS Paper III (B) (Elective / Optional)  Total marks will be 200, One question from each of the elective. 


Syllabus for UGC NET CS Paper II
Part 1:
1. Discrete Structures: Sets, Relations, Functions. Pigeonhole Principle, InclusionExclusion Principle, Equivalence and Partial Orderings, Elementary Counting Techniques, Probability. Measure (s) for information and Mutual information.
2. Computability: Models of ComputationFinite 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.
3.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.
Part 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. Flipflops – 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.
Part 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 Carrays, 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.
Part 4:
Relational Database Design and SQL: ER 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 likeViews, indexes, sequences, synonyms, data dictionary.
Part 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, indexsequential and relative files. Hashing, inverted lists and multi – lists. B trees and B+ trees.
Part 6:
Computer Networks: Network fundamentals :</strong> 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 mediatwisted pair, coaxial cables, fibre – optic cables, wireless transmissionradio, microwave, infrared and millimetre waves. Lightwave transmission. Telephones – local loop, trunks, multiplexing, switching, narrowband ISDN, broadband ISDN, ATM, High speed LANS. Cellular Radio. Communication satellitesgeosynchronous and loworbit.
Internetworking: Switch / Hub, Bridge, Router, Gateways, Concatenated virtual circuits, Tunnelling, Fragmentation, Firewalls.
Routing: Virtual circuits and datagrams. Routing algorithms. Congestion control.
Network Security :Cryptographypublic key, secret key. Domain Name System ( DNS ) – Electronic Mail and Worldwide Web ( WWW ). The DNS, Resource Records, Name servers. Emailarchitecture and Serves.
Part 7:
System Software and Compilers:
Assembly language fundamentals (8085 based assembly language programming). Assemblers2pass and singlepass. Macros and microprocessors.
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 parsersshiftreduce, operator precedence, and LR. YACC package on Unix system.
Topdown parsersleft recursion and its removal. Recursive descent parser. Predictive parser. Intermediate codesQuadruples, Triples, Intermediate code generation, Code generation, Code optimization.
Part 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.
Part 9:
UNIX:
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): Create, open, close, read, write, iseek, link, unlink, stat, fstat, umask, chmod, exec, fork, wait, system.
Part 10:
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.
Part 11:
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. Mbusiness.
Part 12:
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:
Part – 1:
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.
Part – 2:
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.
Part – 3:
Display systems, Input devices, 2D Geometry, Graphic operations, 3D Graphics, Animation, Graphic standard, Applications.
Concepts, Storage Devices, Input Tools, Authoring Tools, Application, Files.
Part – 4:
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, postconditions, axiomatic approach for semantics, correctness, denotational semantics.
Compiler structure, compiler construction tools, compilation phases.
Finite Automata, Pushdown Automata. Nondeterminism 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 Analysisregular 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 parsersshiftreduce, operator precedence, and LR. YACC package on Unix system. Top down parsersleft recursion and its removal. Recursive descent parser. Predictive parser, Intermediate codes – Quadruples, triples. Intermediate code generation, code generation. Code optimization.
Part – 5:
Analog and Digital transmission, Asynchronous and Synchronous transmission, Transmission media, Multiplexing and Concentration, Switching techniques, Polling.
Topologies, Networking Devices, OSI Reference Model, Protocols for:
Data link layer
Network layer
Transport layer, TCP / IP protocols, Networks security, Network administration.
Part – 6:
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 notationsbig 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 nondeterministic programs. NP – hard and NP – complete problems.
Part – 7:
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.
Part – 8:
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.
Part – 9:
Introduction, Memory management, Support for concurrent process, Scheduling, System deadlock, Multiprogramming system, I/O management, Distributed operating systems, Study of Unix and Windows NT.
Part – 10:
Definitions, AI approach for solving problems.
Automated Reasoning with prepositional logic and predicate logicfundamental 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.
Decisionmaking 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 – 1:
Theory of Computation: Formal language, Need for formal computational models, Noncomputational 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. Nonregular 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 – KassamiYounger ( 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 recursivelyenumerable languages.
Elective – 2:
Models for Information Channel: Discrete Memoryless Channel, Binary Symmetric Channel (BSC), Burst Channel, Biterror 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, LempelZiev ( 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 – 3:
Linear Programming Problem ( LPP ) in the standard form, LPP in Canonical form. Conversion of LPP in Standard form to LPP in Canonical form. SimplexPrevention of cyclic computations in Simplex and Tableau, BigM 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 – PramodkumarMaheshwari ( 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.
Nonlinear Programming: Kuhn – Tucker conditions. Convex functions and Convex regions. Convex programming problems. Algorithms for solving convex programming problemsRate of convergence of iterative methods for solving these problems.
Elective – 4 :
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 – 5:
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.
UGC NET/SET (JRF & LS) Management Paper II & III Paperback – 20 Apr 2016:
The University Grants Commission (UGC) conducts the National Eligibility Test (NET) twice a year to determine eligibility for lectureship and for award of Junior Research Fellowship (JRF) to Indian nationals to ensure minimum standards for the entrants in the teaching profession and research. UGC NET Tutor Management Paper II & III has been revised as per the new syllabi and examination pattern issued by the UGC for Management Paper II & III.
The book has been divided into two parts Paper II & Paper III. Paper II has been divided into 10 Chapters namely Managerial Economics, Organisational Behaviour, Human Resource Management, Financial Management, Marketing, Production Management, Advance Statistics & MIS, Corporate Strategy, Entrepreneurship and Business Ethics. On the other hand, Paper III section has been divided in to Elective I, Elective II, Elective III and Elective IV.
Over 4000 previous years' objective questions upto December 2015 have been covered chapter wise. Some specific facts have been covered in a box and through pictures for better understanding. The book also contains last four years' (20122015) Solved Papers of UGC NET Management Paper II & III to help candidates understand the recent exam pattern. Also various types of objective questions based on the latest examination pattern to help the candidates get familiar with the new examination pattern have been provided in the book. At the end of the book, five Practice Papers for both Paper II & III have been given for thorough practice and selfanalysis for the upcoming examination. This book is equally useful for various State Eligibility Tests as well.
As the book has been designed according to the latest examination pattern of UGC Management Paper II & III, it for sure will help the aspirants climb up the ladder to success.
This comprehensive book is specially developed for the candidates of CBSEUGCNET Exam (For Compulsory PaperI)—50 Practice Test Papers (Solved). This book includes Test Papers (Solved) for the purpose of practice of questions based on the latest pattern of the examination. Detailed Explanatory Answers have also been provided for the selected questions for Better Understanding of the Candidates
Useful for UGC NET Aspirants
'UGCNET: Computer Sciences & Applications (Paper I, II & III) Previous Years Papers (Solved)' has been designed to help computer students who are interested in the UGC NET examination and are preparing for the same. The UGC NET examination is quite tough to crack and therefore requires a lot of practice. In order to facilitate this for the students, the book has been equipped with provisions for practicing and solving problems. Multiple questions have been included in the book belonging to varied difficulty levels. The book has also been revised as per the updated syllabus and guidelines for the UGC NET exams. It has been designed to help the students understand and grasp the subject at a deeper level.
Includes Solved Question Papers
The book also contains question papers of the UGC NET exam from the preceding years. These have been included in the book in order to facilitate the practice quotient of the aspirants. With the previous years’ question papers, the students can not only firsthand witness the difficulty of the questions that might actually appear in the exam, but they can also see the pattern of the question paper and be prepared for it. Further, since question papers are also provided with solutions, the students can also learn some tips and tricks when it comes to faster problem solving.
Comprehensive Book
UGCNET: Computer Sciences & Applications (Paper I, II & III) Previous Years Papers (Solved) is a comprehensive book wherein the subject has been preached at a deeper level so that the students get to understand it faster and better. The book deals with some of the most difficult questions that are likely to occur in the exams and provides simple solutions to them.
About the Publisher
This book has been published by the Ramesh Publishing House. This publishing house is renowned for its educational course books and books based on exam preparations of various kinds including exams like UGC NET.
The book is available online for convenient shopping. You can bag this book from Amazon.in today by following a few easy steps.
8 most important book in electronic science
Thanks sir provide us important books for ugc net jrf
Thank you for listening important books in computer science.
UGC NET Tutor Computer Science and Applications Paper II and III has been revised as per the new syllabi and examination pattern issued by the UGC for Computer Science and Applications Paper II and III.
Source: http://studyabroadaide.com/bestbookforugcnetcomputerscienceandapplications/