1. Understanding the Exam Pattern, Marking Scheme & Eligibility
UGC NET is conducted by the NTA (National Testing Agency), computer-based, usually twice a year, in a single sitting covering both papers back-to-back with no break between them. As of recent cycles, Paper 1 has 50 compulsory MCQs worth 100 marks (2 marks each), and Paper 2 has 100 compulsory MCQs worth 200 marks (2 marks each), for a combined 300 marks in roughly 3 hours total — and as of recent NTA cycles there is no negative marking for wrong answers, meaning every question is worth attempting since there's nothing to lose by guessing when unsure.
Eligibility for CS & Applications typically requires a master's degree (or equivalent) in Computer Science/Applications or a closely related field with the minimum required percentage (with a relaxation for reserved categories), and NET qualification opens two separate outcomes: eligibility for Assistant Professor positions, and — for candidates who additionally clear the higher JRF cutoff — a Junior Research Fellowship (JRF) for pursuing a PhD with a stipend.
Exam pattern details (question counts, marks, negative marking policy, exact duration, eligibility percentages) are set by NTA per cycle and have changed in the past. Treat the figures above as the stable recent pattern, but always cross-check the current year's official NTA UGC NET information bulletin (ugcnet.nta.nic.in) before finalising your exam-day strategy.
2. Building a Personal Revision Plan & Exam-Day Time Management
With no negative marking, the highest-leverage exam-day strategy is: attempt every question, but in two passes. First pass — answer everything you're confident about immediately, skipping (not agonising over) anything uncertain. Second pass — return to skipped questions with remaining time, since a confident guess still beats leaving a question blank when there's no penalty for being wrong.
For your remaining revision time before the exam, allocate it proportional to marks and to your own diagnosed weak spots, not equally: Paper 2 is worth twice Paper 1's marks (200 vs. 100), so it typically deserves roughly twice the study time, but you should skew further toward whichever specific units this course's practice questions revealed as your weakest — revisit the practice sections from those specific weeks, not the whole course, in the days immediately before the exam.
4 weeks out: Full re-read of every week's topic sections, one module per few days
3 weeks out: Redo EVERY practice-question set in this course from scratch (closed-book)
2 weeks out: Take 2-3 full mixed mock tests (like this week's), timed strictly
1 week out: Review ONLY your weak units from mock-test results + official PYQs
Exam day: Two-pass strategy above; attempt every question, no blanks
3. Where to Find & How to Use Official Previous-Year Papers
This course's practice questions throughout are written in NTA's style and difficulty band to build the right instincts, but they are original questions, not reproductions of actual past papers — official previous-year question papers (and their official answer keys) are published by NTA itself, and are the single most valuable extra resource once you finish this course. Search for "UGC NET previous year question papers" on ugcnet.nta.nic.in (NTA's official UGC NET site) and the UGC's own site, which periodically archive past cycles' papers and answer keys directly.
Use real past papers the way you used this week's mock test below: strictly timed, scored against the official key, then reviewed question-by-question for why each wrong answer was wrong — not just which ones were wrong. Doing 8-10 real previous-year papers this way in your final month, alongside this course's content, is the single highest-value activity left once the syllabus itself is covered.
Many websites host "UGC NET previous papers" PDFs of inconsistent or outdated accuracy, sometimes with wrong answer keys. Prefer NTA's own official site or the UGC's official resources as your primary source, and treat any third-party copy as needing independent verification against an official key.
4. Hands-on Exercise
Build your personal exam-day plan and revision schedule
This is the one exercise in the course that produces a document you'll actually use, not just a practice drill — do it in writing.
Part 1 — Your revision plan:
- Write down your actual exam date (or your best estimate) and count the exact number of weeks remaining.
- List the 3-4 units where your practice-question scores were weakest across Weeks 1-18 (be honest — go back and check if you don't remember).
- Build a week-by-week plan for your remaining time, weighted toward Paper 2 (twice the marks) and your specific weak units, following the taper structure shown in this week's content.
- Schedule at least 2 full timed previous-year papers (from NTA's official archive) in your final two weeks.
Part 2 — Your exam-day checklist:
- Write your own two-pass strategy in one paragraph, in your own words, as a reminder to read the morning of the exam.
- Note the current official exam pattern (question counts, marks, timing, negative marking status) after checking this cycle's actual NTA information bulletin — do not rely on memory or this course alone for exam-day numbers.
5. Exam-Style Practice (UGC NET Pattern)
A full-length, 15-question mixed mock test spanning both papers, in NTA's exam style. Treat this as a real mock: set a 25-minute timer, attempt every question with the two-pass strategy from this week, and only then expand the answers.
Q1
[Paper 1] A teacher redesigns her own lesson plan mid-term after noticing student confusion, and studies whether the change helps. This is:
A) Fundamental research
B) Applied research
C) Action research
D) Historical research
[Paper 1] A teacher redesigns her own lesson plan mid-term after noticing student confusion, and studies whether the change helps. This is:
A) Fundamental research
B) Applied research
C) Action research
D) Historical research
Correct answer: C) Action research. Small-scale, practitioner-led research aimed at improving one's own immediate practice is the defining feature of action research (Week 2).
Q2
[Paper 1] Which level of teaching involves a learner applying known principles to solve a completely novel problem?
A) Memory level
B) Understanding level
C) Reflective level
D) Evaluation level
[Paper 1] Which level of teaching involves a learner applying known principles to solve a completely novel problem?
A) Memory level
B) Understanding level
C) Reflective level
D) Evaluation level
Correct answer: C) Reflective level. The reflective level is the highest of the three levels of teaching, defined by independent application of principles to unseen problems (Week 1).
Q3
[Paper 1] In the standard communication process model, which stage represents the receiver's response returning to the sender?
A) Channel
B) Noise
C) Feedback
D) Decoding
[Paper 1] In the standard communication process model, which stage represents the receiver's response returning to the sender?
A) Channel
B) Noise
C) Feedback
D) Decoding
Correct answer: C) Feedback. Feedback closes the communication loop by carrying the receiver's response back to the sender (Week 3).
Q4
[Paper 1] Which Pramana in Indian logic refers to knowledge gained through inference, such as inferring fire from smoke?
A) Pratyaksha
B) Anumana
C) Upamana
D) Shabda
[Paper 1] Which Pramana in Indian logic refers to knowledge gained through inference, such as inferring fire from smoke?
A) Pratyaksha
B) Anumana
C) Upamana
D) Shabda
Correct answer: B) Anumana. Anumana is inference — deriving knowledge by reasoning from something already known, the classic example being inferring fire from observed smoke (Week 5).
Q5
[Paper 1] SWAYAM is best described as:
A) A UGC-funded postgraduate e-content repository
B) A free government MOOC platform spanning school to postgraduate level
C) An engineering-only e-content platform
D) A private-sector coding bootcamp
[Paper 1] SWAYAM is best described as:
A) A UGC-funded postgraduate e-content repository
B) A free government MOOC platform spanning school to postgraduate level
C) An engineering-only e-content platform
D) A private-sector coding bootcamp
Correct answer: B) A free government MOOC platform spanning school to postgraduate level. SWAYAM is the Government of India's free MOOC platform, offering courses across levels from school through postgraduate (Week 6).
Q6
[Paper 2] What is the worst-case time complexity of search in an unbalanced Binary Search Tree?
A) O(1)
B) O(log n)
C) O(n)
D) O(n log n)
[Paper 2] What is the worst-case time complexity of search in an unbalanced Binary Search Tree?
A) O(1)
B) O(log n)
C) O(n)
D) O(n log n)
Correct answer: C) O(n). An unbalanced BST can degenerate into a linked-list-like structure (e.g. from sorted-order insertion), giving O(n) worst-case search — only self-balancing variants like AVL guarantee O(log n) (Week 11).
Q7
[Paper 2] Using the Master Theorem, what is Θ(T(n)) for T(n) = 2T(n/2) + O(n)?
A) Θ(n)
B) Θ(n log n)
C) Θ(n²)
D) Θ(2ⁿ)
[Paper 2] Using the Master Theorem, what is Θ(T(n)) for T(n) = 2T(n/2) + O(n)?
A) Θ(n)
B) Θ(n log n)
C) Θ(n²)
D) Θ(2ⁿ)
Correct answer: B) Θ(n log n). This matches Master Theorem Case 2 exactly (f(n) = Θ(n) = Θ(n^(log_2 2))), giving Θ(n log n) — the well-known complexity of merge sort (Week 12).
Q8
[Paper 2] A Pushdown Automaton is exactly equivalent in recognising power to which class of grammars?
A) Regular grammars
B) Context-free grammars
C) Context-sensitive grammars
D) Unrestricted grammars
[Paper 2] A Pushdown Automaton is exactly equivalent in recognising power to which class of grammars?
A) Regular grammars
B) Context-free grammars
C) Context-sensitive grammars
D) Unrestricted grammars
Correct answer: B) Context-free grammars. A Pushdown Automaton (a finite automaton plus a stack) recognises exactly the context-free languages, matching context-free grammars in generative power (Week 13).
Q9
[Paper 2] Which deadlock-handling technique checks, before granting a resource request, whether the resulting state is still "safe"?
A) Deadlock prevention via mutual exclusion removal
B) The Banker's Algorithm (deadlock avoidance)
C) Deadlock detection via resource-allocation graphs
D) Deadlock recovery via process termination
[Paper 2] Which deadlock-handling technique checks, before granting a resource request, whether the resulting state is still "safe"?
A) Deadlock prevention via mutual exclusion removal
B) The Banker's Algorithm (deadlock avoidance)
C) Deadlock detection via resource-allocation graphs
D) Deadlock recovery via process termination
Correct answer: B) The Banker's Algorithm (deadlock avoidance). The Banker's Algorithm is a deadlock avoidance technique that checks whether granting a request leaves the system in a safe state before actually granting it (Week 14).
Q10
[Paper 2] A relation is in 2NF, but a non-key attribute depends on another non-key attribute rather than directly on the key. This relation violates:
A) 1NF
B) 2NF (it is not actually in 2NF)
C) 3NF
D) None of the normal forms
[Paper 2] A relation is in 2NF, but a non-key attribute depends on another non-key attribute rather than directly on the key. This relation violates:
A) 1NF
B) 2NF (it is not actually in 2NF)
C) 3NF
D) None of the normal forms
Correct answer: C) 3NF. A non-key attribute depending on another non-key attribute is a transitive dependency, which specifically violates 3NF — the relation can still validly be in 2NF while failing 3NF (Week 15).
Q11
[Paper 2] At which OSI layer does a router primarily operate?
A) Physical layer
B) Data Link layer
C) Network layer
D) Transport layer
[Paper 2] At which OSI layer does a router primarily operate?
A) Physical layer
B) Data Link layer
C) Network layer
D) Transport layer
Correct answer: C) Network layer. A router operates at the Network layer, using IP addresses and routing tables to forward packets between different networks (Week 16).
Q12
[Paper 2] "Are we building the product right?" — checking each phase's output against its own specification — describes:
A) Validation
B) Verification
C) Acceptance testing
D) Regression testing
[Paper 2] "Are we building the product right?" — checking each phase's output against its own specification — describes:
A) Validation
B) Verification
C) Acceptance testing
D) Regression testing
Correct answer: B) Verification. Verification checks that each development phase correctly implements its specification ("right"); validation instead checks the finished product against actual user needs (Week 17).
Q13
[Paper 2] A cloud service where the provider manages everything through the operating system, leaving the customer to manage only application code and data, is:
A) IaaS
B) PaaS
C) SaaS
D) DaaS
[Paper 2] A cloud service where the provider manages everything through the operating system, leaving the customer to manage only application code and data, is:
A) IaaS
B) PaaS
C) SaaS
D) DaaS
Correct answer: B) PaaS. PaaS (Platform as a Service) provides a managed platform including the OS, leaving the customer responsible only for their application code and data (Week 18).
Q14
[Paper 1] Which sampling method gives every population member a known, non-zero chance of selection, supporting statistical generalisation?
A) Convenience sampling
B) Purposive sampling
C) Simple random sampling
D) Snowball sampling
[Paper 1] Which sampling method gives every population member a known, non-zero chance of selection, supporting statistical generalisation?
A) Convenience sampling
B) Purposive sampling
C) Simple random sampling
D) Snowball sampling
Correct answer: C) Simple random sampling. Simple random sampling is a probability-sampling method — every unit has a known chance of selection — which is what supports generalising sample results back to the full population (Week 2).
Q15
[Paper 2] A search algorithm using f(n) = g(n) + h(n), guaranteed optimal when the heuristic never overestimates true remaining cost, is:
A) Breadth-First Search
B) Greedy Best-First Search
C) A* Search
D) Uniform-Cost Search alone
[Paper 2] A search algorithm using f(n) = g(n) + h(n), guaranteed optimal when the heuristic never overestimates true remaining cost, is:
A) Breadth-First Search
B) Greedy Best-First Search
C) A* Search
D) Uniform-Cost Search alone
Correct answer: C) A* Search. A* search combines actual cost-so-far g(n) with heuristic estimate h(n), and is guaranteed optimal when h(n) is admissible — never overestimating the true remaining cost to the goal (Week 18).