UGS NET solved question papers for computer science

Hello sir, my friend is going to take part in UGS NET exam, so, for his excellent preparation of UGS NET exam I need the previous year solved paper for computer science. Please provide me.

University Grants Commission (UGC) organized the National Eligibility Test (NET). It is a is the national level entrance examination for postgraduate candidates who wish to qualify for university level teaching jobs in India and/or admission to PhD research programmes.

Here I am sharing the Solved question paper of UGC NET - Computer Science

1. The context-free languages are closed for :
(i) Intersection (ii) Union
(iii) Complementation (iv) Kleene Star
then
(A) (i) and (iv) (B) (i) and (iii)
(C ) (ii) and (iv) (D) (ii) and (iii)
Ans:-C

2. Which of the following is not true ?
(A) Power of deterministic automata is equivalent to power of non-deterministic automata.
(B) Power of deterministic pushdown automata is equivalent to power of non-deterministic pushdown automata.
(C) Power of deterministic turing machine is equivalent to power of non-deterministic
turing machine. (D) All the above
Ans:-B

3. Identify the language which is not context - free.
(A) L={wwR|w is a member of {0,1}*}
(B) L={anbn|n>=0}
(C )L={ww|w is a member of {0,1}*}
(D) L={anbmcmdn|n,m>=0}
Ans:-B
4. Which sentence can be generated by S → d/bA, A → d/ccA :
(A) bccddd
(B) aabccd
(C) ababccd
(D) abbbd
Ans:-A

5. Regular expression a+b denotes the set :
(A) {a}
(B) {Epsilon, a, b}
(C) {a, b}
(D) None of these
Ans:-C
6. Which of the following strings is in the language defined by grammar
S → OA, A → 1A/0A/1
(A) 01100
(B) 00101
(C ) 10011
(D) 11111
Ans:-B

7. The logic of pumping lemma is a good example of :
(A) pigeon hole principle
(B) recursion
(C) divide and conquer technique
(D) iteration
Ans:-A

8. Which of the regular expressions corresponds to this grammar ? S → AB/AS, A → a/aA, B → b
(A) aa*b+
(B) aa*b
(C ) (ab)*
(D) a(ab)*
Ans:-B

9. The regular expression given below describes :
r=(1+01)*(0+λ)
(A) Set of all string not containing '11'
(B) Set of all string not containing '00'
(C) Set of all string containing '01'
(D) Set of all string ending in '0'
Ans:-B

21. A* algorithm uses f' = g + h' to estimate the cost of getting from the initial state to the goal state, where g is a measure of the cost of getting from initial state to the current node and the function h' is an estimate of the cost of getting from the current node to the goal state. To find a path involving the fewest number of steps, we should set
(A) g=1
(B) g=0
(C) h'=0
(D) h'=1
Ans:-A

22. The transform which possesses the highest ‘energy compaction’ property is
(A) Slant transform
(B) Cosine transform
(C) Fourier transform
(D) Karhunen-Loeve transform
Ans:-D

23. Which one of the following prolog programs correctly implement “if G succeeds then execute goal P else execute goal θ ?”
(A) if-else (G, P, θ) :- !, call(G), call(P). if-else (G, P, θ) :- call(θ).
(B) if-else (G, P, θ) :- call(G), !, call(P). if-else (G, P, θ) :- call(θ).
(C) if-else (G, P, θ) :- call(G), call(P), !. if-else (G, P, θ) :- call(θ).
(D) All of the above
Ans:-B

24. The _______ memory allocation function modifies the previous allocated space.
(A) calloc( )
(B) free()
(C) malloc( )
(D) realloc()
Ans:-D

25. Which is not the correct statement(s) ?
(i) Every context sensitive language is recursive.
(ii) There is a recursive language that is not context sensitive.
(A) (i) is true, (ii) is false.
(B) (i) is true and (ii) is true.
(C) (i) is false, (ii) is false.
(D) (i) is false and (ii) is true.
Ans:-B

26. The mechanism that binds code and data together and keeps them secure from outside world is known as
(A) Abstraction
(B) Inheritance
(C) Encapsulation
(D) Polymorphism
Ans:-C

27. Identify the addressing modes of below instructions and match them :
(a) ADI (1) Immediate addressing
(b) STA (2) Direct addressing
(C )CMA (3) Implied addressing
(d) SUB (4) Register addressing
(A) a-1,b-2,c-3,d-4
(B) a-2,b-1,c-4,d-3
(C ) a-3,b-2,c-1,d-4
(D) a-4,b-3,c-2,d-1
Ans:- A


28. Which one of the following is not a Greibach Normal form grammar ?
(i) S → a | bA | aA | bB
A→a B→b
(ii) S→a|aA|AB
A→a
B→b
(iii) S→a|A|aA
A→a
(A) (i) and (ii)
(B) (i) and (iii)
(C) (ii) and (iii)
(D) (i), (ii) and (iii)
Ans:-C

29. Which of the following IP address class is a multicast address ?
(A) Class A
(B) Class B
(C) Class C
(D) Class D
Ans:-D

30. While unit testing a module, it is found that for a set of test data, maximum 90% of the code alone were tested with a probability of success 0.9. The reliability of the module is
(A) atleast greater than 0.9
(B) equal to 0.9
(C) atmost 0.81
(D) atleast 1/0.81
Ans:-C

18. Consider a schema R(A, B, C, D) and functional dependencies A → B and C → D. Then the decomposition R1(A, B) and R2(C, D) is
(A) Dependency preserving but not lossless join
(B) Dependency preserving and lossless join
(C) Lossless Join but not dependency preserving
(D) Lossless Join
Ans:-A
19. The quantiser in an image-compression system is a
(A) lossy element which exploits the psychovisual redundancy
(B) lossless element which exploits the psychovisual redundancy
(C) lossy element which exploits the statistical redundancy
(D) lossless element which exploits the statistical redundancy
Ans:-A

20. Data Warehouse provides
(A) Transaction Responsiveness
(B) Storage, Functionality Responsiveness to queries
© Demand and supply Responsiveness
(D) None of the above
Ans:-B

11. X.25 is ________ Network.
(A) Connection Oriented Network
(B) Connection Less Network
(C) Either Connection Oriented or Connection Less
(D) Neither Connection Oriented nor Connection Less
Ans:-A

12. Which of the following can be used for clustering of data ?
(A) Single layer perception
(B) Multilayer perception
(C) Self organizing map
(D) Radial basis function
Ans:-C

13. Which of the following is scheme to deal with deadlock ?

(A) Time out
(B) Time in
(C) Both (A) & (B)
(D) None of the above
Ans:-A

14. If the pixels of an image are shuffled then the parameter that may change is
(A) Histogram
(B) Mean
(C) Entropy
(D) Covariance
Ans:-D

15. The common property of functional language and logical programming language :
(A) Both are declarative
(B) Both are based on λ-calculus
(C) Both are procedural
(D) Both are functional
Ans:-A
16. Given the following statements :
(i) The power of deterministic finite state machine and non- deterministic finite state machine are same.
(ii) The power of deterministic pushdown automaton and non- deterministic pushdown automaton are same.
Which of the above is the correct statement(s) ?
(A) Both (i) and (ii)
(B) Only (i)
(C) Only (ii)
(D) Neither (i) nor (ii)
Ans:-B
17. LetQ(x,y)denote “x+y=0” and let there be two quantifications given as
(i) ∃y∀x Q(x, y)
(ii) ∀x∃y Q(x, y)
where x & y are real numbers. Then which of the following is valid ?
(A) (i) is true & (ii) is false.
(B) (i) is false & (ii) is true.
(C) (i) is false & (ii) is also false.
(D) both (i) & (ii) are true.
Ans:-B
10. In an image compression system 16384 bits are used to represent 256 × 256 image with 256 gray levels. What is the compression ratio for this system ?
(A) 1
(B) 2
(C) 4
(D) 8
Ans:- 
28. On receiving an interrupt from an I/O device, the CPU

(A) halts for predetermined time
(B) branches off to the interrupt service routine after completion of the current instruction
(C) branches off to the interrupt service routine immediately.
(D) hands over control of address bus and data bus to the interrupting device.
Ans:-B
29. The maximum amount of information that is available in one portion of the disk access arm for a removal disk pack (without further movement of the arm with multiple heads)

(A) a plate of data
(B) a cylinder of data
(C) a track of data
(D) a block of data
Ans:-B
30. Consider a logical address space of 8 pages of 1024 words mapped with memory of 32 frames. How many bits are there in the physical address ?

(A) 9 bits
(B) 11 bits
(C) 13 bits
(D) 15 bits
Ans:-D
31. CPU does not perform the operation

(A) data transfer
(B) logic operation
(C) arithmetic operation
(D) all of the above
Ans:-D
32. A chip having 150 gates will be classified as

(A) SSI
(B) MSI
(C) LSI
(D) VLSI
Ans:-B
33.If an integer needs two bytes of storage, then the maximum value of unsigned integer is

(A) 216 –1
(B) 215 –1
(C) 216
(D) 215
Ans:-A
34. Negative numbers cannot be represented in

(A) signed magnitude form
(B) '1’ s complement form
(C) '2’ s complement form
(D) none of the above
Ans:-D
Explanation:-
Negative numbers can be represented in signed magnitude form, or '1' complement form or '2''s complement form. So the option is D.
35. The cellular frequency reuse factor for the cluster size N is

(A) N
(B) N2
(C) 1/N
(D) 1/N2
Ans:-C

you are asking for UGS NET computer science solved papers so i am sharing it with you here;

1. India abolished the quantitative
restrictions on imports of 1429 items
in 2000 and 2001 as per the
commitment to which of the
following ?
(A) South Asian Free Trade
Association (SAFTA)
(B) General Agreement on Tariffs
and Trade (GATT)
(C) World Trade Organisation
(WTO)
(D) Non-Aligned Movement
2. Globalization is a term used to
describe the process of removal of
restrictions on which of the
following ?
(A) Foreign Trade
(B) Investment
(C) (A) and (B) above
(D) None of the above
3. When a company takes over another
one and clearly becomes a new
owner, the action is called
(A) Merger
(B) Acquisition
(C) Strategic Alliance
(D) None of the above

for read whole UGS NET computer science solved papers you can click on following link;

http://studychacha.com/discuss/8026-...html#post55952

__________________
Answered By StudyChaCha Member

Hello sir, I am going to take part in UGS NET exam, so, for his excellent preparation of UGS NET exam I need the previous year solved paper for computer science. Please provide me.[/QUOTE]

I am interested in teaching and want to apply for UGC National Eligibility Test (NET). Will you provide UGS NET Solved Question Papers For Computer Science for doing preparation?

The National Eligibility Test (NET), also known as UGC NET or CBSE NET, is a test to determine eligibility for college and university level lecturership and for the award of Junior Research Fellowship (JRF) for Indian nationals.

It aims to ensure minimum standards for the entrants in teaching professions and research.

Please find the below attached file for the UGS NET Solved Question Papers For Computer Science:

UGS NET Computer Science paper







Important dates:

UGC NET Notification Release Date by 16th March 2020
Release of Application form 16th March 2020
Last date to Submit UGC NET Application 16th April 2020 (upto 11:50 pm)
Last date to Pay Fee 16th April 2020 (upto 11:50 pm)
Correction in particulars of Application Form on website only 16th April to 23rd Aapril 2020
Downloading of Admit Cards from NTA website 15th May, 2020
UGC NET 2020 Exam Dates 15th to 20th June 2020
Duration of UGC Exam 180 minutes (03 hours)
No break between Paper 1 & Paper 2
Timing of Examination First Shift: 9.30 am to 12.30 pm
Second Shift: 02.30 pm to 05.30 pm
UGC NET 2020 Result Date by 5th July 2020

Attached Files Available for Download

	UGS NET Computer Science paper1.pdf (251.6 KB, 16 views)
	UGS NET Computer Science paper2.pdf (172.8 KB, 13 views)

__________________
Answered By StudyChaCha Member