How to prepare for the UGC NET Computer Science?

I qualified the UGC NET in Computer Science in December 2018.

I qualified the UGC NET in Computer Science in December 2018. When I started my preparation for NET Computer Science. I was also in the same dilemma that how to prepare for the UGC NET  Computer Science and GATE Computer Science. After preparation of 5 months, I qualified the exam for which marks are shared in the below picture. You can also clear this exam by following my strategy.

NET Computer Science
NET Computer Science

NET Computer Science

You have to prepare yourself  according to the previous years question papers. Don’t get bothered about the syllabus provided by the UGC or GATE administration. In this post I am sharing the strategy you need for the UGC NET paper 2 (computer science subject). For the paper 1, You can follow this link.” Tips for the first paper. “

Steps to follow

  1. Download and take a print out of the syllabus.
  2. Start reading standard books for all the different subjects. If you don’t have books, you can download the e-books. Below I have provided the sources of all the e-books from where you can download the e-books
  3. If you are not good at reading the books like me, You can study each topic from the YouTube according to the syllabus.  Make sure you side by side also prepare handwritten notes. It is better to maintain a different notebook for each subject, because handwritten notes helps us at revision time.
  4. Now it is the time to solve previous years papers. You can purchase a book provide by the Made Easy which contains all the previous year solved questions. You can also download the e-book. Here is the link provided.
  5. Now it is time to solve previous years gate papers. You can get Gate question from
  6. Now more and more revision is required only. Keep revising the handwritten material and keep solving previous year questions.

Download the Previous Years Question Papers

Here you can download the PDF file containing all the previous years questions with explanations. Download the PDF from here.

Download the e-books for the different subjects

Discrete StructureDownload
Computer Arithmetic Download
Programming in C and C++Download
Relational database design and SQLDownload
Data and file StructureDownload
Computer NetworkDownload
System SoftwareDownload
Operating System(with Case study of UNIX)Download
Software engineeringDownload
Current Trends and TechnologiesDownload
Design and Analysis of AlgorithmDownload
Theory of ComputationDownload
Computer GraphicsDownload
Download the e-books

Short Terms from subjects

When you think that you are fully prepared, the following terms must be at your fingers. I wrote all these terms in my notebook as an index when I was preparing for the NET Computer Science. It helped me to revise the topics very easily. I have written all the terms in very short form. The students who are well-prepared will get these terms very easily.

Discrete mathematics

  • What is Proposition?
  • Implication, equivalence, (bidirectional) converse, inverse, contrapositive.
  • Rules of inferences (modus pones, tulles,  hyothotivelpyllog, disgonativesyllog, addition, simplification?
  • logic operators(5)?
  • Quantifiers, negation of quantifiers, skolemization?
  • Horn clause, definite clause, goal clause?
  • If X unless Z then Y:?
  • Vacuous proof, trivial proof, indirect proof?
  • Duality?
  • Real no, integers, natural, whole no, positive integer?
  • Set
  • Function: domain, co-domain, range, type of function(injective, surjective, bijectives)?
  • Inverse?
  • Cartesian product, relation,function?
  • No of binary relation                                                  ?
  • Invertable function, one-to-one correspondence?
  • Composition of find f and g=fog=f(g(n))?
  • Types of relation?
  • Total no of reflexive relation over the set of n elements                  ?
  • Probability (h), 
  • Symmetric difference= (a-b)U(b-a)?
  • Graph theory
  • Domain and ranges:


  • Regular grammar, (CFG)
  • Lang, grammar, automate?
  • Basic classification of language?
  • Data structure of different automate?
  • Alphabet, symbol, string, lang, ?
  • Grammar (4 types)?
  • Finite automate and types?
  • Clauses properties of language?
  • Compliment of DFA?
  • Families of lang?
  • Check whether lang is a particular lang or not?
  • Elimination of unit product, useless symbols?
  • Set, subset, proper subset, super  set?
  • Star clauses(*), positive clauses(+)?
  • Two equipment grammar?
  • Extended hierarchy of language?
  • Right and left linear grammar, check is it RG?
  • NFA to DFA?
  • Compliment of regular expression?
  • Homomorphism?
  • Right quotient?
  • Pumping lemma(used for(FL, RL, linear)define it for RL,CFL, linear lang?
  •  Turing machine is complex?
  • PDA can behave like a TM by assigning stacks?
  • No of different FM with n state and m inputs()=                         ?
  • CFL definition, derivation tree or pass tree, type of CFG, D-PDA, NPDA, ambiguous grammar?

Computer Arithmetic

  • Conversions, floating conversion?
  • Floating point representation?
  • Ist,2’s, 9’.,10’Compliments?
  • Symbols:
  • Laws: associativity, commutative, demorgans, distribute tree, identity, idempotent, absorption, domains four?
  • Canonical/standard form, minterm /maxterm?
  • Types of encodes?
  • K-map?
  • Shift-register, types of SR, register?
  • adders?
  • Combinational circuit: HA, FA, HS, FS, Mux, demux, encoder, decoder?
  • Types of flip flops; characteristics equation?
  • Sequential circuit?
  • Signed magnitude representation?
  • Negated/bubbled gate?
  • Semi conductor memory?
  • Universal gate: NAND, NOR, Mux?
  • Architecture of CPU?
  • Auxiliary memory-hierarchy?
  • Microprocessor, micro controller, operation types in microprocessor?
  • Logic families, characteristics?
  • Logic gates; buffer gate, XOR, commutative gate, associative gates?
  • Register and counts?
  • Bi-polar and unipolar logic families?
  • Different types of microprocessor?
  • Structure table of 8085, 5 types of flag?
  • Addressing modes in 8085?
  • Instruction set in 8085?
  • Structure table of 8086?
  • Instruction: Shr, DAD, LHLD?
  • Weighted code (BCD-8421 Code, 2421), non-set code(grey code, excces-3 code)?
  • Self-complementing code (BCD, Excces-3 code, 2421)?
  • Write through, write around, around back?
  • Horizontal and vertical microprogramming?
  • Interrupts in 8086?
  • Addressing mode in 8086?
  • Addition excess-3 code?

Computer Graphics

  • CRT, bitmaps?
  • Projection?
  • Line drawing y-y1=m(x-x1)?
  • Line drawing algos: direct method, simple DDA, bresenhim algo?
  • Scan converting a circle:mid-point, bresenhim algo?
  • Homogeneous coordinates of{x,y}?
  • 2-D transformation?
  • x-shearing relatives to reference line y=yref?
  • 3D-transformation?
  • Geometric transformation and coordinate transformation?
  • Cohen sutharlandalgo (TBLR)?
  • Morphing, distortion, half toning, dithering, rendering, error-diffusion, aliasing, anti=aliasing?
  • Equation of straight line=y-y1=m(x-x1)?

Operating System

  • OS,Type of OS,System call?
  • Process and Program.States of Process and cycle?
  •  Schedulers, Dispatcher,Degree of multi-programming?
  • Schedulling Algorithm:FCFS,SJF,SRTF,RR,Priority,Convey effort,Starvation
  • Mutual Exclusion,ME Devices(Semaphores,Locks-Unlocks).
  • Process Synchronization.
  • Virtual Memory also known ass Demand Paging.
  • Logical Addresses and physical Addresses.
  • Contingougs and Non- contigougs memory Allocation,paging,segmentation,First Fit,Best Fit,Worst Fit.
  • Deadlock:Condition deadlock Prevention and Deadlock Avoidance,difference,Safe-state,Unsafe state,Deadlock State.
  • Buffering?
  • Page Replacement Algorithm:FIFO,LRU,OPR,Random Page Replacement,Page Frames,Page Fault,Belady Anemly?
  • Concurrency Control:Time Stamp and lock-based protocols?
  • Disk scheduling algos:FCFS,SSTF,Scan,c-scan,lool scheduling?
  • User-level and Kernel-level thread?
  • Mapping in Cache memor,Conten-Addressable memory?
  • Amadahl’s law speed=1/1-p.
  • Hit Ration Question:H(mm)+1-H(sm).
  •                                     :H(cache access time)+1-H(cache miss time).
  •                                     : H(cache access)+m(cache access + mm access).
  •      :H(TLB+mm)+m(TBL +mm*mm).
  • Multilevel feedback Queue Schedule?
  • Locality of Reference?
  • Thread?
  • Thrashing?
  • Fork,Exec,(2n-1),(2n)?
  • Page Table,TBL,
  • CPU Utilization =1-pn?
  • Wastage Memory due to I.F =NP/2 Bytes.
  • IPC,Shared Memory(Produces-consumer problem)(Bounded Buffer Problem),Message passing/Dining philosophic Problems?
  • Race condition,solution to it?
  • Multilevel Page Table,Inverted Page Table?
  • No. of entries inPage Table,Size of PT?
  • Diety Bit in PT?
  • Optimal Page size=?
  • File Allocation methods,Disk (C,T,S)?
  • requirement to critical section problem?
  • Permission init

Leave a Comment