Go Back   2021-2022 StudyChaCha > StudyChaCha Discussion Forum > General Topics

  #1  
Old December 30th, 2013, 02:53 PM
Super Moderator
 
Join Date: Jun 2013
Default

I am doing preparation for UGC NET Computer Science exam so need some solved question paper, will you please provide here?

The UGC NET Computer Science exam questions are follows:

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)

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

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}

4. Which sentence can be generated by S → d/bA, A → d/ccA :
(A) bccddd
(B) aabccd
(C) ababccd
(D) abbbd

5. Regular expression a+b denotes the set :
(A) {a}
(B) {Epsilon, a, b}
(C) {a, b}
(D) None of these

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

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

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

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'

For more papers here is attachment;
Attached Files Available for Download
File Type: pdf UGC NET CS Question paper.pdf (244.7 KB, 50 views)
File Type: pdf UGC NET CS Question paper 1.pdf (115.3 KB, 64 views)

Last edited by GaganD; June 27th, 2019 at 01:37 PM.
Reply With Quote
Other Discussions related to this topic
Thread
UGS NET solved question papers for computer science
5 years solved past paper of ugc computer science paper II?
Computer Science Solved Paper
Solved Computer Science Paper for KVS PGT Exam
PGT Computer Science Previous Solved Paper
UGC NET Computer Science Solved Paper II
UGC NET Computer Science Solved Paper III
Solved Papers GATE Computer Science and Engineering
Solved Paper for GATE Computer Science
SAIL (MT) Computer Science Solved Exam Paper
NET Computer Science Exam Solved Paper
UGC NET JRF Computer Science Paper II Exam Solved Question Papers
UGC NET computer science solved Question papers
NET Exam in Computer Science Applications Solved papers
GATE computer science solved question papers
NET exam (Computer Science) Solved Question Papers
Last Year Solved Question Paper of GATE - Computer Science (CS)
Board Exam Computer Science Solved Paper
GATE Computer Science and IT Solved Paper
UGC NET computer science and applications solved papers






  #2  
Old December 30th, 2013, 05:20 PM
Super Moderator
 
Join Date: Jun 2013
Default Re: UGC NET Computer Science Solved Paper

Here is the UGC NET Computer Science Solved Paper:

1. COCOMO stands for
(A) COmposite COst MOdel
(B) COnstructive COst MOdel
(C) COnstructive COmposite
MOdel
(D) COmprehensive COnstruction
Model

2. Match the following :
a. Good quality i. Program does
not fail for a
specified time in
a given
environment
b. Correctness ii. Meets the
functional
requirements
c. Predictable iii. Meets both
functional and
non-functional
requirements
d. Reliable iv. Process is under
statistical
control
Codes :
a b c d
(A) iii ii iv i
(B) ii iii iv i
(C) i ii iv iii
(D) i ii iii iv

3. While estimating the cost of
software, Lines Of Code (LOC) and
Function Points (FP) are used to
measure which one of the following ?
(A) Length of code
(B) Size of software
(C) Functionality of software
(D) None of the above

4. A good software design must have
(A) High module coupling, High
module cohesion
(B) High module coupling, Low
module cohesion
(C) Low module coupling, High
module cohesion
(D) Low module coupling, Low
module cohesion

5. Cyclometric complexity of a flow
graph G with n vertices and e edges
is
(A) V(G) = e+n–2
(B) V(G) = e–n+2
(C) V(G) = e+n+2
(D) V(G) = e–n–2

6. When the following code is executed
what will be the value of x and y ?
int x = 1, y = 0;
y = x++;
(A) 2,1
(B) 2,2
(C) 1,1
(D) 1,2

7. How many values can be held by an
array A(–1,m;1,m) ?
(A) m
(B) m2
(C) m(m+1)
(D) m(m+2)

8. What is the result of the expression
(1&2)+(3/4) ?
(A) 1
(B) 2
(C) 3
(D) 0

9. How many times the word ‘print’
shall be printed by the following
program segment ?
for (i=1, i<2,i++)
for (j=1,j<2,j++)
for(k=1,k<2,k++)
printf("print/n")
(A) 1
(B) 3
(C) 6
(D) 8

For detailed paper here is attachment:
Attached Files Available for Download
File Type: pdf UGC NET Question paper with answer key.pdf (196.6 KB, 73 views)
File Type: pdf UGC NET Question paper with answer key 1.pdf (10.5 KB, 69 views)
__________________
Answered By StudyChaCha Member
Reply With Quote
  #3  
Old January 11th, 2014, 10:39 AM
Unregistered
Guest
 
Default UGC NET Computer Science Solved Paper

I am going to participate in UGC NET computer Science exam, so need previous year question paper, will you please provide here?
Reply With Quote
Reply


Reply to this Question / Ask Another Question
Your Username: Click here to log in

Message:
Options



All times are GMT +6.5. The time now is 03:18 AM.


Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, vBulletin Solutions, Inc.
Search Engine Friendly URLs by vBSEO 3.6.0 PL2

1 2 3 4 5 6 7 8