#1
 
 
UGC NET Computer Science Solved Paper II
Will you please provide the UGC NET Computer Science Solved Paper II?

#2
 
 
Re: UGC NET Computer Science Solved Paper II
Here is the list of few questions of UGC NET Computer Science Solved Paper II exam which you are looking for . 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 1. 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 nonfunctional 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+n2 (B) V(G) = en+2 (C) V(G) = e+n+2 (D) V(G) = en2 6. When the following code is executed what will be the value of x and y? int x = l, 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+l) (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 10. Which of the following is not a type of Database Management System? (A) Hierarchical (B) Network (C) Relational (D) Sequential 11. Manager's salary details are to be hidden from Employee Table. This Technique is called as (A) Conceptual level Datahiding (B) Physical level Datahiding (C) External level Datahiding (D) Logical level Datahiding 12. A Network Schema (A) restricts to one to many relationship (B) permits many to many relationship (C) stores Data in a Database (D) stores Data in a Relation 13. Which normal form is considered as adequate for usual database design ? (A) 2NF (B) 3NF (C) 4NF (D) 5NF 14. If D1, D2,…. Dn are domains in a relational model, then the relation is a table, which is a subset of (A) D1+D2+…. + Dn (B) D1x D2x… x Dn (C) D1U D2U….U Dn (D) D1 D2…. Dn 15. Which of the following addresses is used to deliver a message to the correct application program running on a host? (A) Port (B) IP (C) Logical (D) Physical 16. In substitution, a character in the plaintext is always changed to the same character in the ciphertext, regardless of its position in the text. (A) polyalphabetic (B) monoalphabetic (C) transpositional (D) multialphabetic 17. In classful addressing, the IF address 190.255.254.254 belongs to (A) Class A (B) Class B (C) Class C (D) Class D 18. In hierarchical routing with 4800 routers, what region and cluster sizes should be chosen to minimize the size of the routing table for a threelayer hierarchy? (A) 10 clusters, 24 regions and 20 routers (B) 12 clusters, 20 regions and 20 routers (C) 16 clusters, 12 regions and 25 routers (D) 15 clusters, 16 regions and 20 routers 19. In IPv4 header, the field is needed to allow the destination host to determine which datagram a newly arrived fragments belongs to. (A) identification (B) fragment offset (C) time to live (D) header checksum 20. Given L1 = L(a*baa*) and L2 = L(ab*) The regular expression corresponding to language L3 = Ll/L2 (right quotient) is given by (A) a*b (B) a*baa* (C) a*ba* (D) None of the above 21. Given the production rules of a grammar GI as S1 à AB  aaB A à a  Aa B à b and the production rules of a grammar G2 as S2 à aS2bS2  bS2aS2  λ Which of the following IS correct statement? (A) G1 is ambiguous and G2 is not ambiguous. (B) GI is ambiguous and G2 is ambiguous. (C) GI is not ambiguous and G2 is ambiguous. (D) GI is not ambiguous and G2 is not ambiguous. 22. Given a grammar : S1 à Sc, S àSA  A, A à aSb  ab, there is a rightmost derivation S1 => Sc => SAC => SaSbc Thus, SaSbc is a right sentential form, and its handle is (A) SaS (B) be (C) Sbe (D) aSb 23. The equivalent production rules corresponding to the production rules S à Sα1  Sα2  β1  β2 is (A) S à β1  β2, A à α1A  α2A  λ (B) S à β1  β2  β1A  β2A, Aà α1A  α2A (C) Sàβ1  β2, A à α1A  α2A (D) S à β1  β2  β1A  β2A, A à α1A  α2A  λ 24. Given a Nondeterministic Finite Automation (NFA) with states p and r as initial and final states respectively transItion table as given below ab pq qrs rrs srs The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is (A) 5 (B) 4 (C) 3 (D) 2 25. Which is the correct statement(s) for Non Recursive predictive parser? S1: First(α) = {t  α => * t β for some string β } => *tβ S2: Follow(X) = { a  S => * αXa β for some strings α and β } (A) Both statements S1 and S2 are incorrect. (B) S1 is incorrect and 52 IS correct. (C) S1 is correct and S2 IS incorrect. (D) Both statements S I and S2 are correct. 26. Given an open address hash table with load factor α < 1, the expected number of probes in a successful search is (A) Atmost 1/α 1n (1α/α) (B) Atmost 1/α 1n (1/1α) (C) Atleast 1/α 1n (1/1α) (D) Atleast 1/α 1n (α/1α) 27. For a Btree of height h and degree t, the total CPU time used to insert a node is (A) O(h log t) (B) O(t log h) (C) O(t2h) (D) O(th) 28. The time complexity to build a heap with a list of n numbers is (A) O(log n) (B) O(n) (C) O(n log n) (D) O(n2) 29. The value of postfix expression: 8 3 4 +  3 8 2 / + * 2 ^ 3 + is (A) 17 (B) 131 (C) 64 (D) 52 Note: Given $ symbol instead of ^ in the question paper given by UGC 30. Consider the following statements for priority queue: S1 : It is a data structure in which the intrinsic ordering of the elements does determine the result of its basic operations. S2: The elements of a priority queue may be complex structures that are ordered on one or several fields. Which of the following is correct? (A) Both S1 and S2 are incorrect. (B) S1 is correct and S2 is incorrect. (C) SI is incorrect and S2 is correct. (D) Both S1 and S2 are correct. 31. Repository of information gathered from multiple sources, storing under unified scheme at a single site is called as (A) Data mining (B) Meta data (C) Data warehousing (D) Database 32. The task of correcting and pre processing data is called as (A) Data streaming (B) Data cleaning (C) Data mining (D) Data storming 33. Using data p=3, q=11, n=pq, d=7 in RSA algorithm find the cipher text of the given plain text SUZANNE (A) BUTAEEZ (B) SUZANNE (C) XYZABCD (D) ABCDXYZ Explanation: 35. Give as good a bigQ estimate as possible for the following functions: (nlogn+n2)(n3+2) and (n!+2n) (n3+log(n2+ 1)) (A) O(n5+2n2) & O(n3*n!) (B) O(n5) & O(n3*2 n) (C) O(n5) & O(n3* n!) (D) O(n5+2n2) & O(n3*2 n) 36. A test contains 100 true/false questions. How many different ways can a student answer the questions on the test, if the answer may be left blank also. (A) 100P2 (B) 100C2 (C) 2100 (D) 3100 37. Which of the following connected simple graph has exactly one spanning tree? (A) Complete graph (B) Hamiltonian graph (C) Euler graph (D) None of the above 38. How many edges must be removed to produce the spanning forest of a graph with N vertices, M edges and C connected components? (A) M+NC (B) MNC (C) MN+C (D) M+N+C 39. Which of the following shall be a compound proposition involving the propositions p, q and r. that is true when exactly two of the p. q and rare true and is false otherwise? (A) (p∨q∧˥r) ∨ (p∨q∧r) ∧ (˥p∧q∨r) (B) (p∧q∨r) ∧ (p∧q∧r) ∨ (˥q∨˥p∧˥r) (C) (p∧q∧˥r) ∨ (p∨˥q∧r) ∨ (˥p∧q∧r) (D) (p∨r∧q) ∨ (p∧q∧r) ∨ (˥p∧q∧r) 40. The truth value of the statements: ∃!xP(x) à ∃xP(x) and ∃!x˥P(x) à ˥∀xP(x), (where the notation ∃!xP(x) denotes the proposition "There exists a unique x such that P(x) is true'') are : (A) True and False (B) False and True (C) False and False (D) True and True
__________________ Answered By StudyChaCha Member 
#4
 
 
Re: UGC NET Computer Science Solved Paper II
The previous year question paper of University Grants Commission (UGC) National Eligibility Test (NET) of Computer Science Paper II as you need it for preparation is as follows: 1. How many strings of 5 digits have the property that the sum of their digits is 7? A. 66 B. 330 C. 495 D. 99 2. Consider an experiment of tossing two fair dice, one black and one red. What is the probability that the number on the black die divides the number on red die ? A. 22 / 36 B. 12 / 36 C. 14 / 36 D. 6 / 36 3. In how many ways can 15 indistinguishable fishes be placed into 5 different ponds, so that each pond contains atleast one fish? A. 1001 B. 3876 C. 775 D. 200 4. Consider the following statements (a) Depth  first search is used to traverse a rooted tree. (b) Pre  order, Postorder and Inorder are used to list the vertices of an ordered rooted tree. (c) Huffman's algorithm is used to find an optimal binary tree with given weights. (d) Topological sorting provides a labelling such that the parents have larger labels than their children. Which of the above statements are true ? A. (a) and (b) B. (c) and (d) C. (a) , (b) and (c) D. (a), (b) , (c) and (d) 5. Consider a Hamiltonian Graph (G) with no loops and parallel edges. Which of the following is true with respect to this Graph (G) ? (a) deg (v) >= n / 2 for each vertex of G (b)  E(G)  >= 1 / 2 (n1) (n2) + 2 edges (c) deg (v) + deg (w) >= n for every v and w not connected by an edge A. (a) and (b) B. (b) and (c) C. (a) and (c) D. (a), (b) and (c) UGC NET Computer Science Solved Paper II more paper detail attached a pdf file;
__________________ Answered By StudyChaCha Member Last edited by Aakashd; August 12th, 2018 at 08:46 PM. 
