#1
4th August 2014, 08:13 AM
| |||
| |||
Last year question papers of UGC NET Exam in Computer Science & Applications
Will you please share with me the last year question papers of UGC NET Exam in Computer Science & Applications?
|
#2
4th August 2014, 11:52 AM
| |||
| |||
Re: Last year question papers of UGC NET Exam in Computer Science & Applications
As you want to get the last year question papers of UGC NET Exam in Computer Science & Applications so here it is for you: Some content of the file has been given here: 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 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) D1×D2× … ×Dn (C) D1∪D2∪ … ∪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 IP 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 = L1/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 G1 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) G1 is ambiguous and G2 is ambiguous. (C) G1 is not ambiguous and G2 is ambiguous. (D) G1 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) bc (C) Sbc (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 Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively and transition table as given below : a b p – q q r s r r s s r s 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 S2 is correct. (C) S1 is correct and S2 is incorrect. (D) Both statements S1 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 27. For a B-tree 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 logn) (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 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) S1 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 34. The relation “divides” on a set of positive integers is ________. (A) Symmetric and transitive (B) Anti symmetric and transitive (C) Symmetric only (D) Transitive only 35. Give as good a big–O 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*2n) (C) O(n5) & O(n3* n!) (D) O(n5+2n2) & O(n3*2n) 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+N–C (B) M–N–C (C) M–N+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 r are 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 41. How many different Boolean functions of degree 4 are there ? (A) 24 (B) 28 (C) 212 (D) 216 42. A Boolean operator s is defined as follows : 1 s 1 = 1, 1 s 0 = 0, 0 s 1 = 0 and 0 s 0 = 1 What will be the truth value of the expression (x s y) s z = x s (y s z) ? (A) Always false (B) Always true (C) Sometimes true (D) True when x, y, z are all true 43. Which one of the following is decimal value of a signed binary number 1101010, if it is in 2’s complement form ? (A) – 42 (B) – 22 (C) – 21 (D) – 106 44. A set of processors P1, P2, ……, Pk can execute in parallel if Bernstein’s conditions are satisfied on a pairwise basis; that is P1 || P2 || P3 || ….. || Pk if and only if : (A) Pi || Pj for all i ≠ j (B) Pi || Pj for all i = j+1 (C) Pi || Pj for all i < j (D) Pi || Pj for all i > j 45. When a mobile telephone physically moves from one to another cell, the base station transfers ownership to the cell getting strongest signal. This process is known as _______. (A) handoff (B) mobile switching (C) mobile routing (D) cell switching 46. A virtual memory based memory management algorithm partially swaps out a process. This is an example of (A) short term scheduling (B) long term scheduling (C) medium term scheduling (D) mutual exclusion 47. Assuming that the disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O block requests are 98, 37, 14, 124, 65, 67 : (A) 310 (B) 324 (C) 320 (D) 321 48. Let the page fault service time be 10 millisecond(ms) in a computer with average memory access time being 20 nanosecond(ns). If one page fault is generated for every 106 memory accesses, what is the effective access time for memory ? (A) 21 ns (B) 23 ns (C) 30 ns (D) 35 ns 49. Consider the following UNIX command : sort <in> temp; head – 30 <temp; rm temp Which of the following functions shall be performed by this command ? (A) Sort, taking the input from “temp”, prints 30 lines from temp and delete the file temp (B) Sort the file “temp”, removes 30 lines from temp and delete the file temp (C) Sort, taking the input from “in” and writing the output to “temp” then prints 30 lines from temp on terminal. Finally “temp” is removed. (D) Sort, taking the input from “temp” and then prints 30 lines from “temp” on terminal. Finally “temp” is removed. 50. The mv command changes (A) the inode (B) the inode-number (C) the directory entry (D) both the directory entry and the inode Contact Details: University Grants Commission New Delhi Bahadur Shah Zafar Marg, Balmiki Basti, Vikram Nagar, New Delhi, Delhi 110002 093 33 778791 India Map Location: [MAP]https://www.google.co.in/maps?q=University+Grants+Commission+New+Delhi,+Bah adur+Shah+Zafar+Marg,+Balmiki+Basti,+Vikram+Nagar, +New+Delhi,+Delhi&hl=en&ll=28.632445,77.245216&spn =0.009511,0.013046&sll=21.125498,81.914063&sspn=20 .602762,26.71875&oq=University+Grants+Commission+& hq=University+Grants+Commission&hnear=Bahadur+Shah +Zafar+Marg,+Balmiki+Basti,+Vikram+Nagar,+New+Delh i,+Central+Delhi,+Delhi&t=m&z=16&iwloc=A[/MAP] |
#3
1st March 2016, 04:08 PM
| |||
| |||
Re: Last year question papers of UGC NET Exam in Computer Science & Applications
Hii Buddy , Here I am looking for UGC NET Exam Last Year Question Papers of Computer Science & Applications , Will you please provide me Same for my help ?
|
#4
1st March 2016, 04:08 PM
| |||
| |||
Re: Last year question papers of UGC NET Exam in Computer Science & Applications
Friend On your Asking here I am, Providing UGC NET Exam Last Year Question Papers of Computer Science & Applications : 1. The number of integers between 1 and 250 that are divisible by 2, 5 and 7 is (A) 2 (B) 3 (C) 5 (D) 8 Answer: B 2. An undirected graph possesses an eulerian circuit if and only if it is connected and its vertices are (A) all of even degree (B) all of odd degree (C) of any degree (D) even in number Answer: A 3. A partially ordered set is said to be a lattice if every two elements in the set have (A) a unique least upper bound (B) a unique greatest lower bound (C) both (A) and (B) (D) none of the above Answer: C 4. The minimum number of edges in a connected graph with ‘n’ vertices is equal to (A) n(n–1) (B) n(n–1)/2 (C) n2 (D) n–1 Answer: D 5. Consider the problem of connecting 19 lamps to a single electric outlet by using extension cords each of which has four outlets. The number of extension cords required is (A) 4 (B) 5 (C) 6 (D) 7 Answer: C 6. The decimal number equivalent of (4057.06)8 is (A) 2095.75 (B) 2095.075 (C) 2095.937 (D) 2095.0937 Answer: D 7. AB+(A+B)’ is equivalent to (A) AÅB (B) AʘB (C) (AÅB)ʘA (D) (AʘB) ÅA Answer: B 8. An astable multivibrator has (A) one stable state (B) two stable states (C) no stable states (D) none of these Answer: C 9. 12-bit 2’s complement of –73.75 is (A) 01001001.1100 (B) 11001001.1100 (C) 10110110.0100 (D) 10110110.1100 Answer: C 10. Encoding of data bits 0011 into 7-bit even Parity Hamming Code is (A) 0011110 (B) 0101110 (C) 0010110 (D) 0011100 Answer: A Handoff is the mechanism that (A) transfer an ongoing call from one base station to another (B) initiating a new call (C) dropping an ongoing call (D) none of above Ans:-A Which one of the following statement is false ? (A) Context-free languages are closed under union. (B) Context-free languages are closed under concatenation. (C) Context-free languages are closed under intersection. (D) Context-free languages are closed under Kleene closure. Ans:-C Explanation:- CFL's are closed under union, concatenation, and Kleene closure. But not under intersection or difference. So the correct answer is option C. All of the following are examples of real security and privacy risks except (A) Hackers (B) Spam (C) Viruses (D) Identify theft Ans:-B Identify the incorrect statement : (A) The ATM adoption layer is not service dependent. (B) Logical connections in ATM are referred to as virtual channel connections. (C) ATM is streamlined protocol with minimal error and flow control capabilities (D) ATM is also known as cell delays. Ans:-A Software risk estimation involves following two tasks : (A) Risk magnitude and risk impact (B) Risk probability and risk impact (C) Risk maintenance and risk impact (D) Risk development and risk impact Ans:-B The number of bits required for an IPV6 address is (A) 16 (B) 32 (C) 64 (D) 128 Ans:-D The proposition ~ q–vp is equivalent to A)p→q (B) q→p (C) p↔q (D) p∨q Ans:-B Enterprise Resource Planning (ERP) (A) has existed for over a decade. (B) does not integrate well with the functional areas other than operations. (C) is inexpensive to implement. (D) automate and integrates the majority of business processes. Ans:-D 45. Which of the following is false concerning Enterprise Resource Planning (ERP) ? (A) It attempts to automate and integrate the majority of business processes. (B) It shares common data and practices across the enterprise. (C) It is inexpensive to implement. (D) It provides and access information in a real-time environment. Ans:-C To compare, overlay or cross analyze to maps in GIS (A) both maps must be in digital form (B) both maps must be at the same equivalent scale. (C) both maps must be on the same coordinate system (D) All of the above Ans:-D Web Mining is not used in which of the following areas ? (A) Information filtering (B) Crime fighting on the internet (C) Online transaction processing (D) Click stream analysis. Ans:-B A telephone conference call is an example of which type of communications ? (A) same time / same place (B) same time / different place (C) different time / different place (D) different time / same place Ans:-B What is the probability of choosing correctly an unknown integer between 0 and 9 with 3 chances ? (A) 963/1000 (B) 973/1000 (C) 983/1000 (D) 953/1000 What is Granularity ? (A) The size of database (B) The size of data item (C) The size of record (D) The size of file Suppose that a given application is run on a 64-processor machine and that 70 percent of the application can be parallelized. Then the expected performance improvement using Amdahl’ s law is (A) 4.22 (B) 3.22 (C) 3.32 (D) 3.52 |
|