Code360 powered by Coding Ninjas X Code360 powered by Coding Ninjas X
Table of contents
What is the UGC NET exam?
What is the exam format for the UGC NET?
Is it possible to take the UGC NET after completing a postgraduate degree?
How can solving PYQs help in my exam preparation?
How many papers are there in the UGC NET exam?
Last Updated: Mar 27, 2024

UGC NET Dec 2015 Paper-III Part-2

Author Aditya Singh
0 upvote
Master Python: Predicting weather forecasts
Ashwin Goyal
Product Manager @


UGC NET Exam is a very popular exam in India for people interested in research. Solving Previous Year Questions are an excellent way to learn about the exam pattern and practice for it. By solving the PYQs, you will get a basic idea about your preparation. In this article, we have given the questions of UGC NET 2015 Dec Paper-III. We have also explained every problem adequately to help you learn better.

Note: This article contains Q.No. 25 to Q.No. 50 out of the 75 questions asked in UGC NET Dec 2015 paper III. You can find Q.No 1 to Q.No 25  in part-1 and Q.No 51 to Q.No 75 in part-3.


Question 1: The context free grammar given by




generates the language which is defined by regular expression:

  1. (a+b)*bbb
  2. abbb(a+b)*
  3. (a+b)*(bbb)(a+b)*
  4. (a+b)(bbb)(a+b)*

Solution: (C) (a+b)*(bbb)(a+b)*


Given context free grammar


X → aX|bX|λ

i.e. (a + b)*

Y → bbb

S → (a + b)*(bbb)(a + b)*

(a+b)*(bbb)(a+b)* is the corresponding RE (Regular Expression) for the preceding grammar, which is equivalent to Set of all strings having bbb as a substring.


Question 2: There are exactly ................ different finite automata with three states x, y and z over the alphabet {a, b} where x is always the start state.

  1. 64
  2. 256 
  3. 1024 
  4. 5832

Solution: (D) 5832


If the number of states is |Q|=n and the number of letters in the input alphabet is m, then

(n(n*m)*2n) is the total number of finite automation required.

Here, n=3 and m=2.


Question 3: Given the following two languages :



Which of the following is correct?

  1. L1 is context free language and Lis not context free language
  2.  L1 is not context free language and L2 is context free language
  3. Both L1 and L2 are context free languages
  4. Both L1 and L2 are not context free languages


Solution: (A) L1 is context free language and Lis not context free language


 L1 is a context-free (deterministic) language, whereas L2 is a context-dependent language.

The number of a's before and after 'b' must be counted for L1, and this length is not finite.

As a result, it's a DCFL (deterministic context-free languages) rather than a normal language.

In addition to the aforementioned comparison, we must confirm that the number of b's following the a's is only one.

This is a second non-finite comparison that requires more than one stack.

As a result, L2 is a CSL ( context-sensitive grammar).


Question 4: Which of the following is used to make an Abstract class ?

  1. Making atleast one member function as pure virtual function
  2. Making atleast one member function as virtual function
  3. Declaring as Abstract class using virtual keyword
  4. Declaring as Abstract class using static keyword

Solution: (A) Making atleast one member function as pure virtual function.


The way for creating an abstract class is to make at least one member function a pure virtual function.


Question 5: Match the following with reference to object oriented modelling :

List I

List II

  1. Polymorphism 

(I) Picking both operator and attributes with

operations appropriate to model an object

  1. Inheritance 
(II) Hiding implementation details of methods from users of objects
                  (C)Encapsulation     (III)Using similar operations to do similar things 
                  (D) Abstraction        (IV)Create new classes from existing class


(a)   (b)  (c)   (d)

(A) (iv)  (iii)   (i)   (ii)

(B) (iii)  (iv)   (i)   (ii)

(C) (iii)  (i)     (ii)  (iv)

(D) (iv)  (iii)   (ii)  (i)

Solution: (B) (iii)  (iv)   (i)   (ii) 


a. Polymorphism——>Performing similar tasks using similar operations

b. Succession ——->Make new classes out of old ones.

c.Encapsulation——>Hiding method implementation details from object consumers.

d.Abstraction—->Choosing the suitable operator and attributes with the relevant operations to model an object


Question 6: In CRC based design, a CRC Team consists of :

  1. one or two users representatives 
  2. several programmers 
  3. project coordinators 
  4. one or two system analysts


  1.  (a) and (c)           
  2.  (a), (b), (c) and (d)
  3.  (a), (c) and (d)    
  4.  (a), (b) and (d)

Solution: (C) (a), (c) and (d) 


A CRC Team consists of one or two users representatives, project coordinators, and one or two system analysts in a critical review committee (CRC) based design.In the Critical Review Committee, there is no coder.


Question 7: The end points of a given line are (0, 0) and (6, 18). Compute each value of y as x steps from 0 to 3, by using equation of straight line :

  1. For x=0, y=0; x=1, y=3; x=2, y=6; x=3, y=9
  2. For x=0, y=1; x=1, y=3; x=2, y=4; x=3, y=9
  3. For x=0, y=2; x=1, y=3; x=2, y=6; x=3, y=9
  4. For x=0, y=0; x=1, y=3; x=2, y=4; x=3, y=6

Solution: (A) For x=0, y=0; x=1, y=3; x=2, y=6; x=3, y=9


 Line passing through two points equation is is given by 

(x1,y1) ,(x2,y2) is y-y1=(y2-y1)*(x-x1)/(x2-x1)

So the equation of line is y-0=(18-0)(x-0)/(6-0) =>y=3x

So when x=0 y=0

x=1 y=3

x=2  y=6

x=3   y=9


Question 8: Which of the following graphic primitives are considered as the basic building blocks of computer graphics ?

(a) Points       (b) Lines     (c) Polylines  (d) Polygons


A. (a) only 

B. (a) and (b) 

C. (a), (b) and (c)

D. (a), (b), (c) and (d)

Solutions: (B) (a) and (b)


 The basic building blocks of computer graphics are points (coordinates) and lines.


Question 9: Javascript and Java has similar name because .................... is/are true.

  1. Javascripts syntax is loosely based on Java’s syntax
  2. Javascript is stripped down version of Java
  3. Java and Javascript are originated from Island of Java


  1.  (a) only                
  2.  (a), (b) and (c)
  3.  (a) and (b)           
  4.  (a) and (c)

Solution: (A) (a) only 


Because Javascript's syntax is closely based on Java's syntax, the two have similar names. Javascript is not a stripped-down version of Java, and both Java and Javascript are incorrectly attributed to the island of Java.


Question 10: Which of the following statements are true with reference to the way of describing XML data ?

A. XML uses DTD to describe the data

B. XML uses XSL to describe the data

C. XML uses a description node to describe the data

  1. (a) only                
  2. (b) only
  3. (a) and (b)           
  4. (a) and (c)

Solution: (D) (a) and (c)


The data is described in XML using Document Type Definitions (DTDs).

XML employs a description node to explain the data, while DTD is a stated document defining and confining definition.

The XML document is transformed and rendered using the Extensible Stylesheet Language (XSL).


Question 11: Which of the following is/are correct with reference to Abstract class and interface ?

(a) A class can inherit only one Abstract class but may inherit several interfaces

(b) An Abstract class can provide complete and default code but an interface has no code.

  1. (a) is true                         
  2. (b) is true
  3. Both (a) and (b) are true 
  4. Neither (a) nor (b) is true

Solution: (C) Both (a) and (b) are true


A class can only inherit one Abstract class, however several interfaces can be inherited.

An interface does not have any code, however an Abstract class can have complete and default code.


Question 12: Match the following with respect to various memory management algorithms :

List I List II
A.Demand paging  (i) degree of multiprogramming
B.Segmentation  (ii) working set
C.Dynamic partitions  (iii) supports user view of memory
D.Fixed partitions (iv) compaction

(a)  (b)   (c)  (d)

  1. (iii)  (iv)  (ii)   (i)
  2. (ii)  (iii)   (i)   (iv)
  3. (iv) (iii)  (ii)   (i)
  4.  (ii)  (iii)  (iv)  (i)

Solution: (D) (ii)  (iii)  (iv)  (i)


  • In demand paging, the working set is the purest form of the page replacement mechanism.
  • Memory is segmented into various size chunks to accommodate user views of memory, and memory portions are allocated to the process in segmentation.
  • For compaction, dynamic partition is used, in which allocated objects move together, leaving vacant space behind.
  • For the degree of multiprogramming, a fixed partition divides memory into blocks of a fixed size.


Question 13: Function of memory management unit is :

  1. Address translation       
  2. Memory allocation
  3. Cache management    
  4. All of the above

Solution: (A) Address translation


The memory management unit's job is to translate addresses and manage the computer's primary memory.


Question 14: Consider a system with twelve magnetic tape drives and three processes P1, P2 and P3. Process P1 requires a maximum 10 tape drives, process P2 may need as many as four tape drives and P3 may need upto nine tape drives. Suppose that at time t1, process P1 is holding five tape drives, process P2 is holding two tape drives and process P3 is holding three tape drives. At time t1, system is in:

  1.  safe state
  2.  unsafe state
  3.  deadlocked state   
  4.  starvation state

Solution: (B) unsafe state


  • P1 has 5 tape drives, but it needs 10 tape drives. P1 also needs 5 tapes.
  • P2 has two tape drives, although it requires four. P2 also requires two tapes.
  • P3 has three tape drives, however it requires nine tape drives and six tapes.
  • We have a total of 12 tapes, 10 of which are allocated and two of which are unallocated.
  • P2 can be assigned to these two tapes.
  • When P2 is finished, it will release four tapes, however these four tapes will not be able to meet the requirements for P1 or P3.
  • As a result, the system is in a dangerous situation.


Question 15: In Unix operating system, special files are used to :

  1.  buffer data received in its input from where a process reads
  2.  provide a mechanism to map physical device to file names
  3.  store list of file names plus pointers associated with i-nodes
  4.  store information entered by a user application program or utility program

Solution: (B) provide a mechanism to map physical device to file names


Special files are used in the Unix operating system to map physical device names to file names.


Question 16:Match the following in Unix file system :

List I List II
(a) Boot block  (i) Information about file system 
(b) Super block (ii) Information about file 
(c) Inode table  (iii) Storage space
(d) Data block  (iv) Code for making OS ready 


  (a)  (b)  (c)  (d)

  1.  (iv)  (i)   (ii)  (iii)
  2.  (i)  (iii) (ii)  (iv)
  3.  (iii)  (i)   (ii)  (iv)
  4.  (iv)  (ii)  (i)   (iii)

Solution: (A) (iv)  (i)   (ii)  (iii)


(a) Boot block  ------------------------------ (iv) Code for making OS ready

(b) Super block------------------------------ (i) Information about file system

(c) Inode table  ------------------------------ (ii) Information about file

(d) Data block -------------------------------(iii) Storage space

Each file system has the following components:

1. a file system's first few sectors contain a boot block.

The first bootstrap programme used to load the Operating System is located in the boot block.

The initial sector usually contains a bootstrap programme that reads in a larger bootstrap programme from the next sectors, and so on.

2. A super block contains information about the file system's current status, such as the partition's total size, block size, pointers to a list of free blocks, the root directory's inode number, magic number, and so on.

3. an inode (short for "index nodes") linear array.

The mapping of files to inodes and vice versa is one to one.

The "inode number," which comprises the information needed to locate the inode on the disc, identifies an inode.

Unix, on the other hand, thinks of files in terms of inodes, whereas users conceive of files in terms of file names.

4. data blocks: these are the blocks that hold the actual contents of files.


Question 17:In an operating system, indivisibility of operation means :

  1.  Operation is interruptable
  2.  Race - condition may occur
  3. Processor can not be pre-empted
  4.  All of the above

Solution: (C)  Processor can not be pre-empted


The indivisibility of operation in an operating system means that the processor cannot be pre-empted.Once a process begins to run, it will not be halted or stopped inside the CPU.


Question 18:  A horn clause is ......................

  1.  A clause in which no variables occur in the expression
  2.  A clause that has at least one negative literal
  3.  A disjunction of a number of literals
  4.  A clause that has at most one positive literal

Solution:(D) A clause that has at most one positive literal


A horn clause in logic programming is a clause with only one positive literal.

When there is exactly one affirmative literal, it is referred to be a definite clause, but when there isn't, it is referred to as a goal clause.


Question 19: In Propositional Logic, given P and P→Q, we can infer .................

  1.  ~Q            
  2.  Q
  3.  P∧Q         
  4. ~P∧Q

Solution: (B) Q


If a conditional statement ('if p then q') is accepted and the antecedent (p) is true (i.e. P and P Q), then the consequent (q) can be deduced.


Question 20: Reasoning strategies used in expert systems include ...............

  1.   Forward chaining, backward chaining and problem reduction
  2.  Forward chaining, backward chaining and boundary mutation
  3.  Forward chaining, backward chaining and back propagation
  4.  Backward chaining, problem reduction and boundary mutation

Solution:(A) Forward chaining, backward chaining and problem reduction


Forward chaining, backward chaining, and problem reduction are all reasoning processes employed in expert systems.The antecedent drives the forward chaining expert system, whereas the consequent drives the backward chaining expert system.


Question 21: Language model used in LISP is .............

  1.  Functional programming                     
  2.  Logic programming
  3.  Object-oriented programming 
  4.  All of the above

Solution: (A) Functional programming


Functional programming is the language model utilised in LISP.

The following are some useful properties of functional languages:

  • Uses the result of evaluating an expression.
  • Invoke functions
  • Mathematics and the theory of functions are related.
  • There are no side effects.


Question 22: In the constraint satisfaction problem, constraints can be stated as .............

  1.  Arithmetic equations and inequalities that bind the values of variables
  2.  Arithmetic equations and inequalities that don’t bind any restriction over variables
  3.  Arithmetic equations that impose restrictions over variables
  4.  Arithmetic equations that discard constraints over the given variables

Solution: (A) Arithmetic equations and inequalities that bind the values of variables


Restrictions can be expressed as arithmetic equations and inequalities that bind the values of variables in a constraint fulfillment problem, which is a mathematical problem defined as a set of objects whose state must satisfy a number of constraints or limitations.


Question 23: As compared to rental and leasing methods to acquire computer systems for a Management Information System (MIS), the purchase method has the following advantage:

  1.  It has high level of flexibility
  2.  It doesn’t require cash up-front
  3.  It is a business investment
  4.  Little risk of obsolescence

Solution: (C) It is a business investment


When acquiring computer systems for a Management Information System (MIS), the purchase method has the following advantage over the rental and leasing methods: it is a business investment.

Other benefits of renting and leasing include:

There are no capital constraints.

There is no need for funding.


Costly Company does not own the system when the agreement occurs.


Question 24:  Consider the conditional entropy and mutual information for the binary symmetric channel. The input source has alphabet X={0,1} and associated probabilities {1/2,1/2}. The channel matrix is

where p is the transition probability. Then the conditional entropy is given by :

  1.   1                                       
  2.  -plog(p)-(1-p)log(1-p)
  3.  1+plog(p)+(1-p)log(1-p)
  4.  0

Solution:(B)  -plog(p)-(1-p)log(1-p)


The conditional entropy is just the Shannon entropy with p(x∣y) replacing p(x), and then we average it over all possible "Y". 

H(X|Y):= sum_{xy} p(x|y)\log p(x|y) p(y).


Question 25: Which of the following is not a lossy compression technique?

  1. JPEG       
  2. MPEG
  3. FFT          
  4. Arithmetic coding

Solution: (D) Arithmetic coding


JPEG, MPEG, and FFT are lossy compression techniques, whereas Arithmetic coding is an entropy coding technique used in lossless data compression.



What is the UGC NET exam?

UGC NET is a national-level exam organized by UGC to determine the eligibility of the candidates for lectureship and JRF.

What is the exam format for the UGC NET?

The UGC NET exam is conducted entirely online.

Is it possible to take the UGC NET after completing a postgraduate degree?

You are qualified to take the exam if you have finished a PG Diploma from a recognized university.

How can solving PYQs help in my exam preparation?

Solving PYQs will give you a good idea about the exam pattern and help you identify your weak topics to prepare them better for the examination.

How many papers are there in the UGC NET exam?

There are two papers, and the candidates get 3 hours for both papers. There are 150 questions in UGC NET combining both papers.


Get the tech career you deserve, faster!
Connect with our expert counsellors to understand how to hack your way to success
User rating 4.7/5
1:1 doubt support
95% placement record
Akash Pal
Senior Software Engineer
326% Hike After Job Bootcamp
Himanshu Gusain
Programmer Analyst
32 LPA After Job Bootcamp
After Job


We have extensively discussed the Dec 2015 paper-III. We hope that this blog has helped you understand the UGC pattern. 

This article contains Q.No. 25 to Q.No. 50 out of the 75 questions asked in NET Dec 2015 paper III. You can find Q.No 1 to Q.No 25  in part-1 and Q.No 51 to Q.No 75 in part-3.

You can refer to this article for more details on UGC NET 2022. 

You can refer to other Previous Year papers using the links given below.

Refer to our carefully curated articles and videos and code studio library if you want to learn more. Refer to our guided paths on Coding Ninjas Studio to learn more about DSA, Competitive Programming, JavaScript, System Design, etc. Enrol in our courses and refer to the mock test and problems available. Take a look at the interview experiences and interview bundle for placement preparations.

Do upvote our blog to help other ninjas grow. 

Happy Learning!!!

Previous article
Dec 2015 Paper-III Part-1
Next article
Dec 2015 Paper-III Part-3
Live masterclass