NTA UGC NET

KEY TO SUCCESS in Computer Science

M.Pandiyan
Assistant Professor
Patrician College of Arts and Science
Chennai
SMALL STORY - DASHRATH MANJHI

A MAN OF MOUNTAIN
 Small story
• Dashrath Manjhi (14 January 1929[– 17
August 2007[), also known as Mountain Man,
[3]
was a laborer in Gehlaur village, near Gaya
in Bihar, India, who carved a path 110 m long
(360 ft), 9.1 m (30 ft) wide and 7.7 m (25 ft)
deep through a ridge of hills using only a
hammer and chisel. After 22 years of work,
Dashrath shortened travel 55 km to 15 km
 NTA UGC NET EXAM SYLLABUS

SPENDING TIME FOR PREPARTIONS – HAMMER

UNDERSTANDING THE CONCEPT CLEARLY- CHISEL
 BEST QUOTES
“There is No Short Cut for
Success”

“There is No Substitute for

Hard work”
 NTA UGC NET
Core Subjects for Success
• System Software and Operating System
• Computer System Architecture
• Artificial Intelligence (AI)
• Programming Languages and Computer
Graphics
• Software Engineering
 System Software and Operating System

• System Software: Machine, Assembly and High-Level Languages; Compilers

and Interpreters; Loading, Linking and Relocation; Macros, Debuggers.
• Basics of Operating Systems: Operating System Structure, Operations and
Services; System Calls, Operating-System Design and Implementation;
System Boot.
• Process Management: Process Scheduling and Operations; Interprocess
Communication, Communication in Client–Server Systems, Process
Synchronization, Critical-Section Problem, Peterson’s Solution, Semaphores,
Synchronization.
• Threads: Multicore Programming, Multithreading Models, Thread Libraries,
Implicit Threading, Threading Issues.
• CPU Scheduling: Scheduling Criteria and Algorithms; Thread Scheduling,
Multiple-Processor Scheduling, Real-Time CPU Scheduling.
System Software and Operating System
• Deadlocks: Deadlock Characterization, Methods for Handling Deadlocks, Deadlock Prevention,
Avoidance and Detection; Recovery from Deadlock.
• Memory Management: Contiguous Memory Allocation, Swapping, Paging, Segmentation,
Demand Paging, Page Replacement, Allocation of Frames, Thrashing, Memory-Mapped Files.
• Storage Management: Mass-Storage Structure, Disk Structure, Scheduling and Management,
RAID Structure.
• File and Input/Output Systems: Access Methods, Directory and Disk Structure; File-System
Mounting, File Sharing, File-System Structure and Implementation; Directory Implementation,
Allocation Methods, Free-Space Management, Efficiency and Performance; Recovery, I/O
Hardware, Application I/O Interface, Kernel I/O Subsystem, Transforming I/O Requests to
Hardware Operations.
• Security: Protection, Access Matrix, Access Control, Revocation of Access Rights, Program
Threats, System and Network Threats; Cryptography as a Security Tool, User Authentication,
Implementing Security Defenses.
• Virtual Machines: Types of Virtual Machines and Implementations; Virtualization.
• Linux Operating Systems: Design Principles, Kernel Modules, Process Management, Scheduling,
Memory Management, File Systems, Input and Output; Interprocess Communication, Network
Structure.
 Computer System Architecture
• Digital Logic Circuits and Components: Digital Computers, Logic Gates, Boolean
Algebra, Map Simplifications, Combinational Circuits, Flip-Flops, Sequential Circuits,
Integrated Circuits, Decoders, Multiplexers, Registers and Counters, Memory Unit.
• Data Representation: Data Types, Number Systems and Conversion, Complements,
Fixed Point Representation, Floating Point Representation, Error Detection Codes,
Computer Arithmetic - Addition, Subtraction, Multiplication and Division
Algorithms.
• Register Transfer and Microoperations: Register Transfer Language, Bus and
Memory Transfers, Arithmetic, Logic and Shift Microoperations.
• Basic Computer Organization and Design: Stored Program Organization and
Instruction Codes, Computer Registers, Computer Instructions, Timing and Control,
Instruction Cycle, Memory-Reference Instructions, Input-Output, Interrupt.
• Programming the Basic Computer: Machine Language, Assembly Language,
Assembler, Program Loops, Subroutines, Input-Output Programming.
 Computer System Architecture
• Microprogrammed Control: Control Memory, Address Sequencing, Design of
Control Unit.
• Central Processing Unit: General Register Organization, Stack Organization,
Instruction Formats, Addressing Modes, RISC Computer, CISC Computer.
• Pipeline and Vector Processing: Parallel Processing, Pipelining, Arithmetic
Pipeline, Instruction Pipeline, Vector Processing Array Processors.
• Input-Output Organization: Peripheral Devices, Input-Output Interface,
Asynchronous Data Transfer, Modes of Transfer, Priority Interrupt, DMA, Serial
Communication.
• Memory Hierarchy: Main Memory, Auxillary Memory, Associative Memory,
Cache Memory, Virtual Memory, Memory Management Hardware.
• Multiprocessors: Characteristics of Multiprocessors, Interconnection
Structures, Interprocessor Arbitration, Interprocessor Communication and
Synchronization, Cache Coherence, Multicore Processors
 Artificial Intelligence (AI)
• Approaches to AI: Turing Test and Rational Agent Approaches;
State Space Representation of Problems, Heuristic Search
Techniques, Game Playing, Min-Max Search, Alpha Beta Cutoff
Procedures.
• Knowledge Representation: Logic, Semantic Networks, Frames,
Rules, Scripts, Conceptual Dependency and Ontologies; Expert
Systems, Handling Uncertainty in Knowledge.
• Planning: Components of a Planning System, Linear and Non
Linear Planning; Goal Stack Planning, Hierarchical Planning,
STRIPS, Partial Order Planning.
• Natural Language Processing: Grammar and Language; Parsing
Techniques, Semantic Analysis and Prgamatics.
 Artificial Intelligence (AI)
• Multi Agent Systems: Agents and Objects; Agents and Expert Systems;
Generic Structure of Multiagent System, Semantic Web, Agent
Communication, Knowledge Sharing using Ontologies, Agent
Development Tools.
• Fuzzy Sets: Notion of Fuzziness, Membership Functions, Fuzzification
and Defuzzification; Operations on Fuzzy Sets, Fuzzy Functions and
Linguistic Variables; Fuzzy Relations, Fuzzy Rules and Fuzzy Inference;
Fuzzy Control System and Fuzzy Rule Based Systems.
• Genetic Algorithms (GA): Encoding Strategies, Genetic Operators,
Fitness Functions and GA Cycle; Problem Solving using GA.
• Artificial Neural Networks (ANN): Supervised, Unsupervised and
Reinforcement Learning; Single Perceptron, Multi Layer Perceptron, Self
Organizing Maps, Hopfield
Programming Languages and Computer Graphics

• Language Design and Translation Issues: Programming Language Concepts,

Paradigms and Models, Programming Environments, Virtual Computers and Binding
Times, Programming Language Syntax, Stages in Translation, Formal Transition Models.
• Elementary Data Types: Properties of Types and Objects; Scalar and Composite Data
Types.
• Programming in C: Tokens, Identifiers, Data Types, Sequence Control, Subprogram
Control, Arrays, Structures, Union, String, Pointers, Functions, File Handling, Command
Line Argumaents, Preprocessors. 3
• Object Oriented Programming: Class, Object, Instantiation, Inheritance,
Encapsulation, Abstract Class, Polymorphism.
• Programming in C++: Tokens, Identifiers, Variables and Constants; Data types,
Operators, Control statements, Functions Parameter Passing, Virtual Functions, Class
and Objects; Constructors and Destructors; Overloading, Inheritance, Templates,
Exception and Event Handling; Streams and Files; Multifile Programs.
• Web Programming: HTML, DHTML, XML, Scripting, Java, Servlets, Applets.
 Programming Languages and Computer Graphics

• Computer Graphics: Video-Display Devices, Raster-Scan and Random-Scan

Systems; Graphics Monitors, Input Devices, Points and Lines; Line Drawing
Algorithms, Mid-Point Circle and Ellipse Algorithms; Scan Line Polygon Fill
Algorithm, Boundary-Fill and Flood-Fill.
• 2-D Geometrical Transforms and Viewing: Translation, Scaling, Rotation,
Reflection and Shear Transformations; Matrix Representations and
Homogeneous Coordinates; Composite Transforms, Transformations Between
Coordinate Systems, Viewing Pipeline, Viewing Coordinate Reference Frame,
Window to View-Port Coordinate Transformation, Viewing Functions, Line and
Polygon Clipping Algorithms.
• 3-D Object Representation, Geometric Transformations and Viewing: Polygon
Surfaces, Quadric Surfaces, Spline Representation, Bezier and B-Spline Curves;
Bezier and B-Spline Surfaces; Illumination Models, Polygon Rendering Methods,
Viewing Pipeline and Coordinates; General Projection Transforms and Cipping
 Software Engineering
• Unit – 6 : Software Engineering
• Software Process Models: Software Process, Generic Process Model – Framework
Activity, Task Set and Process Patterns; Process Lifecycle, Prescriptive Process
Models, Project Management, Component Based Development, Aspect-Oriented
Software Development, Formal Methods, Agile Process Models – Extreme
Programming (XP), Adptive Software Development, Scrum, Dynamic System
Development Model, Feature Driven Development, Crystal, Web Engineering.
• Software Requirements: Functional and Non-Functional Requirements; Eliciting
Requirements, Developing Use Cases, Requirement Analysis and Modelling;
Requirements Review, Software Requirment and Specification (SRS) Document.
• Software Design: Abstraction, Architecture, Patterns, Separation of Concerns,
Modularity, Information Hiding, Functional Independence, Cohesion and
Coupling; Object-Oriented Design, Data Design, Architectural Design, User
Interface Design, Component Level Design.
 Software Engineering
• Software Quality: McCall’s Quality Factors, ISO 9126 Quality Factors,
Quality Control, Quality Assurance, Risk Management, Risk Mitigation,
Monitoring and Management (RMMM); Software Reliability.
• Estimation and Scheduling of Software Projects: Software Sizing, LOC
and FP based Estimations; Estimating Cost and Effort; Estimation Models,
Constructive Cost Model (COCOMO), Project Scheduling and Staffing;
Time-line Charts.
• Software Testing: Verification and Validation; Error, Fault, Bug and
Failure; Unit and Integration Tesing; White-box and Black-box Testing;
Basis Path Testing, Control Structure Testing, Deriving Test Cases, Alpha
and Beta Testing; Regression Testing, Performance Testing, Stress Testing.
• Software Configuration Management: Change Control and Version
Control; Software Reuse, Software Re-engineering, Reverse Engineering.
 OS NTA Question Strategy
Some Important Topics
• CPU Scheduling : RR (D-19), Preemptive (D-
19), SRTF (J-19), RR(D-18)
Disk Scheduling: SSTF (J-19), Disk Theory(J-19),
Disk sector Problem (D-18)
• Deadlock : Bankers algm(D-19), resource
alloc(J-19), Critical section (D-18)
 OS NTA Question Strategy

• Semaphore: Counting sem (D-19 ), (J-19), (D-18 )

• Memory Management : TLB (D-19), virtual
memory (J-19 ), (D-18), Cache (D-18)
• Page Replacement Algorithm: LRU and
Optimal(J-19), FIFO (D-18)
• Others: system call(D-19) , LinuxD-19), Unix , IPC
(D-18),
 CO NTA Question Strategy
Digital Logic Fundamental
Number System: find base (D-19), (J-19),Binary
code (D-19 ), Complements (D-18), IEEE (D-18)
Boolean Algebra: simplification (D-19),(J-19),(D-
18) (D-18)
Combinational circuit: Encoder & Decoder (J-19)
Counter (J-19)(D-18)
 CO NTA Question Strategy

Microprocessor
• Addressing Modes: Types (D-19)(J-19)(D-18)
• Micro instructions and programming:
Match(D-19), Assemply program(J-19)(D-18)
• Memory Hierarchy (structure:) Address and
data line(J-19), no of bits(D-19), (D-18)
• Others: Flags(D-18), RISC (D-19),Interrupts
 Artificial Intelligence
Artificial Neural Network(ANN):
• Learning algorithm: classification algm (D-19),
• Activation function: Sigmoid(J-19)
• Neural Network structure: SOM(J-19)
Fuzzy logic:
fuzzy operations(D-19), Operator(J-19)
Defuzzification methods (J-19)
Alpha cut (J-19)
Genetic Algorithm (J-19)
 Programming and CG
Programming
HTML (D-19)(D-18)
Java (D-19)(J-19)(D-18)
C program (D-19)(J-19)(D-18)
CPP (D-19)(J-19)(D-18)
XML (J-19)
 Programming and CG
Computer Graphics:
• Clipping (D-19)
• Raster System (D-19)
• Look Up Table: (D-18)
• 2D: Transforms(D-18)
• 3D:Projection(D-18),(J-19)
 Software Engineering
• Software process model: Agile model(D-19), (D-
18) basic model (J-19)
• Flow graph: (region, Cyclometic complexity)
(5Q)(D-19)
• Software configuration management: (J-19)
• Coupling and Cohesion:(J-19)(D-18)
• Software Testing: (J-19)
• Software Requirement Specification(SRS):(D-18)
 Software Engineering
• Risk Management (J-19)
• Software Reengineering (D-18)
• Software maintenance (D-18)
• Software availability (D-18)
• Software maturity index (problem)(D-18)
NTA UGC NET Latest Questions
Solving on OS
 OS Problem on Semaphore
(Q.1)A counting semaphore is initialized to 8. 3 wait() operations
and 4 signal() operations are applied. Find the current value of
semaphore variable (NTA NET DEC-19)
A. 9
B. 5
C.1
D. 4
Explanation: Wait(decrease or minus ), Signal(increase or plus)
=8-3+4
=5+4
=9
 Workout
Q.2 At a particular time of computation, the value of
a counting semaphore is 7. Then 20 P (wait)
operations and 15 V (signal) operations are
completed on this semaphore. What is the resulting
value of the semaphore ?(NTA NET J-19)
a) 28
b) 12
c) 2
d) 42
 Solution
Explanation
Given:
Initial semaphore value =7
After 20P operation and 15V operation the value

=7-20+15
=2
Answer: B
 OS Problem on Dead Lock
Q.3 Suppose a system has 12 magnetic tape drives and at time
t0 ,three processes are allotted tape drives out of their need as
given below. Process Maximum Needs Current Needs

P0 10 5

P1 4 2

P2 9 2

At time T0, the system is in safe state. Which of the following is

safe sequence so that deadlock is avoided? (NTA NET DEC-19)
a) (p0,p1,p2) c ) (p1,p0,p2)
b) (p2,p1,p0) d) (p0,p2,p1)
Explanation:
Process Maximum Needs Allocated Need
resources Resources
P0 10 5 5

P1 4 2 2

P2 9 2 7

total 9

Total resources=12, Allocated resource=9, Remaining resource=3

(12-9).
With 3 resource process P1 requirements can be fulfilled.so after
that total resource will be 3 + resources allocated to P1 (3+2=5).
Now process P0 requirement will be fulfilled. So after that
total resource will be 5+ resource allocated to P0 (5+5=10).
Now process P2 requirement will be fulfilled. So after that
total resource will be 5+ resource allocated to P2 (10+2=12).
 Workout
Q.4 Suppose there are four processes in execution with 12
instances of a Resource R in a system. The maximum need of
each process and current allocation are given below(UGC NET)
Current
Process Max. Need Allocation
P1 8 3
P2 9 4
P3 5 2
P4 3 1

With reference to current allocation, is system safe? If so, what is

the safe sequence?
(A) No                            (B) Yes, P1 P2 P3 P4
(C) Yes, P4 P3 P1 P2    (D) Yes, P2 P1 P3 P4
Explanation:
Process Maximum Needs Allocated Need
resources Resources
P1 8 3 5
P2 9 4 5
P3 5 2 3
P4 3 1 2
10

Total resources=12, Allocated resource=10, Remaining resource=2 (12-10).

With 2 resource process P4 requirements can be fulfilled. so after that total
resource will be 2 + resources allocated to P4 (2+1=3).
Now process P3 requirement will be fulfilled. So after that total resource
will be 3+ resource allocated to P3 (3+2=5).
Now process P1 requirement will be fulfilled. So after that total resource
will be 5+ resource allocated to P1 (5+3=8).
Now process P2 requirement will be fulfilled. So after that total resource
will be 8+ resource allocated to P2 (8+4=12).
The system is safe (all the Request fulfilled). The safe sequence is P4,P3,P1,P2.
 OS Problem on Memory
Q.5 Consider a paging system where translation look aside buffer
(TLB) a special type of associative memory is used with hit ratio
of 80%. Assume that memory reference takes 80 nanoseconds
and reference time to TLB is 20 nanoseconds. What will be the
effective memory access time given 80% hit ratio?(NTA NET)
a) 110 nanoseconds
b) 116 nanoseconds
c) 200 nanoseconds
d) 100 nanoseconds
Explanation:
Given:
Hit Ratio=80% (80/100=0.8)
Main Memory Access time= 80 ns
TLB Access Time=20 ns
Miss Ratio=1-HitRatio (20%)(0.2)

Effective access time = Hit Ratio (TLB Access time + Memory access time)]
+Miss Ratio (TLB Access time+2*Memory access time)]
=0.8*(20+80) + 0.2(20+2*80)
=0.8(100)+0.2(180)
=80+36
=116 ns

Answer b.
 workout
Q.6 Consider a paging hardware with a TLB. Assume that
the entire page table and all the pages are in the
physical memory. It takes 10 milliseconds to search the
TLB and 80 milliseconds to access the physical memory.
If the TLB hit ratio is 0.6, the effective memory access
time (in milliseconds) is (GATE/UGC NET)
(A) 120
(B) 122
(C) 124
(D) 118
Explanation:

Given:
Hit Ratio=60% (60/100=0.6)
Main Memory Access time= 80 ns
TLB Access Time=10 ns
Miss Ratio=1-HitRatio (60%)(0.4)

Effective access time = Hit Ratio (TLB Access time + Memory access time)]+Miss
Ratio (TLB Access time+2*Memory access time)]
=0.6*(10+80) + 0.4(10+2*80)
=0.6(90)+0.4(170)
=54+68
=122 ms

Answer:(B)
NTA UGC NET Latest Questions Solving on
Computer System Architecture
 Microprocessor Problem
Q.7 A Non-pipelined system takes 30ns to process a task. The
same task can be processed in a four-segment pipeline with a
clock cycle of 10ns. Determine the speed up of the pipeline for
100 tasks.(NTA NET DEC-19)
a) 3
b) 4
c) 3.91
d) 2.91
Explanation:
Given:
Non pipeline process time(tn)=30ns
4 segment Pipeline process time(tp) =10ns
Segment(k)=4
Total number of task (n) =100
Speed=Non pipeline/pipeline
S=ntn / (n+k-1)tp

= 100*30/(100+4-1)*10
= 3000 / 1030
= 2.91
 Workout
Q.8) A nonpipeline system takes 50 ns to process a task.
The same task can be processed in a six segment
pipeline with a clock cycle of 10 ns.  determine the
speed up ratio of the pipeline for 100 tasks.(GATE)
a. 3.76     
b. 4.76     
c. 5.76     
d. 2.76
Explanation:
Given:
Non pipeline process time(tn)=50ns
6 segment Pipeline process time(tp) =10ns
Segment(k)=6
Total number of task (n) =100
Speed=Non pipeline/pipeline
S=ntn / (n+k-1)tp

= 100*50/(100+6-1)*10
= 5000 / 1050
= 4.76
 Microprocessor Memory Problem
Q.9) A processor can support a maximum memory of 4
GB where memory is word addressable and a word is 2
bytes. What will be the size of the address bus of the
processor? (NTA NET DEC-19)
a) At least 28 bits
b) At least 2 bytes
c) At least 31 bits
d) Minimum 4 bytes
Explanation:
Given:
Maximum memory size= 4GB ( 22  230 =232)
Word size=2 bytes
Number of words =maximum memory/word size
Number of words = 232 / 2 = 231
So, we require 31 bits for the address bus of the
processor
 workout
Q.10) A processor can support a maximum memory of
16 GB where memory is word addressable and a word
is 4 bytes. What will be the size of the address bus of
the processor?
a) At least 32 bits
b) At least 2 bytes
c) At least 30 bits
d) Minimum 6 bytes
Explanation:
Given:
Maximum memory size= 16GB ( 24  230 =234)
Word size= 4 bytes (22)
Number of words = maximum memory/word size
Number of words = 234 / 22 = 232
So, we require 32 bits for the address bus of the
processor
Answer: A
 DLF-Number System
Q.11) Given following equation:
(142)b + (112)b-2 = (75)8. Find base b.(NTA NET D-19)

a) 3
b) 5
c) 7
d) 6
 
Explanation:
Option-A: Definitely wrong. Because 142 having 4 in a number but base is 3 only. So, eliminate it.
Option-B: 5 given: (142)b + (112)b-2 = (75)8.
L.H.S Step-1: Converting (142)5 to base 10.
2*50=2
4*51=20
1*52=25
Adding all to get (47)10
Step-2: Converting (112)3 to base 10.
2*30=2
1*31=3
1*32=9
Adding all to get (14)10
47+14=61(L.H.S)
R.H.S
Step-3: find (75)8 .
5*80=5
7*81=56
5+56=61(R.H.S) L.H.S=R.H.S Answer: Option B

Ans:(75)8

No need to check Option-C & D.

 
 workout
Q.12)Consider the equation (146)​ b​+ (313)​ b-2​=
(246)​ 8​ Which of the following is the value of b?
(j-19)
a) 7
b) 8
c) 6
d) 5
Explanation: Substitute Option A
L.H.S: (146)7+(317)7-2=(246)8
Substitute 7 in b,
(146)7+(317)7-2=(246)8
(146)7+(317)5=(246)8
(146)7=1*72+4*71+6*70
=49+28+6
=83
(313)5=3*52+1*51+3*50
=75+5+3
= 83 (L.H.S=83+83=166)
R.H.S (246)8=2*82+4*81+6*80
=128+32+6
= 166
∴ (146)7+(317)5=(246)8
=83+87
=166
166=166
LHS = RHS equal only if b is 7
NTA UGC NET Latest Questions Solving on
Artificial Intelligence
 Learning Algorithm in AI
Q.13) Consider the following learning algorithms:
(a) Logistic regression
(b) Back propagation
(c) Linear repression
Which of the following option represents classification
algorithms? (NTA UGC NET DEC-19)
1. (a) and (b) only
2. (a) and (c) only
3. (a), (b) and (c) only
4. (b) and (c) only
Explanation:
The most widely used learning algorithms are:
Support Vector Machines.
linear regression.
logistic regression.
naive Bayes.
linear discriminant analysis.
decision trees.
k-nearest neighbor algorithm.
Neural Networks (Multilayer perceptron)
Backpropagtion learning algorithm
 Fuzzy in Artificial Intelligence
(Q.14) Consider the following methods
M1: Mean of maximum
M2: Centre of area
M3: Height method
Which of the following is/are Defuzzification methods? (NTA
UGC NET June-19)
A. Only M1
B. Only M1 and M2
C. Only M2 and M3
D. M1, M2 and M3
 Fuzzy concept
Explanation:
Defuzzification Methods:
 Maxima methods
 Centroid methods
 Weighted average method
 Lambda-cut method
Maxima Methods
• Height method
• First of maxima (FoM)
• Last of maxima (LoM)
 Fuzzy Concept
• Mean of maximam(MoM)
Centroid methods
• Center of gravity method (CoG)
• Center of sum method (CoS)
• Center of area method (CoA)
 Genetic Algorithm in AI
Q.15) Consider the following:
a. Evaluation
b. selection
c. reproduction
d. Mutation
Which of the following in Genetic algorithm (NTA UGC NET June-19)
1) b,c and d only
2) b and d only
3) a, b,c and d
4) a,b and d only
 Explanation
Five phases are considered in a genetic
algorithm.
Initial population.
Fitness function.(Evaluation)
Selection.
Crossover.(Reproduction)
Mutation.
 Reference website for NTA UGC NET
https://www.geeksforgeeks.org/ugc-net-cs-prep
aration
/

https://
www.netcomputerscience.com/p/ugc-net-comp
uter-science-solved.html

https://gateoverflow.in/
 Contact

Mail id: [email protected]

Mobile: 9790085836
Thanks to ALL