#1
25th July 2014, 01:59 PM
| |||
| |||
Last year question papers of UGC NET of Computer Science & Applications
Will you please share with me the last year question papers of UGC NET of Computer Science & Applications?
|
#2
25th July 2014, 02:36 PM
| |||
| |||
Re: Last year question papers of UGC NET of Computer Science & Applications
As you want to get the last year question papers of UGC NET of Computer Science & Applications so here it is for you: Some content of the file has been given here: 1. (a) Design NFA with the specified number of states recognizing each of the following languages. The alphabet is {0, 1}. (i) {W | W = x 01| where x has exactly one | and any number of 0s} (4 states) (4) (ii) {W | every odd position of W is a 1} (2 states) (2) (iii) {W | W contains either the substring 000 or substring 010} (4 states) (4) (b) Design a Turing Machine for accepting the language {an bn cn | n 1} (10) OR Elective – II 1. (a) For each of the following generating matrices encode the given messages. If G is given as G = _ _ _ _ _ _ _ _ 1 0 0 1 1 0 1 0 1 0 0 0 1 0 1 (i) u = 100 (ii) u = 010 (iii) u = 111 (10) (b) Find a generator matrix in standard form for a Hamming code of length 15, then encode the message ‘11111100000’. (10) OR Elective – III 1. For a Network flow problem prove max flow = Minimum Cut. (20) OR Elective – IV (a) Compare the functionality of soft computing tools namely ANNs and fuzzy sets with that of expert system. In particular you may comment on the traceability and knowledge representation aspects. (10) (b) Discuss application of Fuzzy and Neuro systems in providing the solutions to the classical problem of categorization. (You may select text document categorization, categorization of students or categorization of experts etc. as a specific domain to deal with the queries). (10) OR Elective – V 1. (a) What are the two types of pipes in Unix O.S. supports ? How they differ from each other ? (10) (b) What is asynchronous socket ? How does it support synchronization ? (10) __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ _______________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ ______________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ 2. (a) Given the relation scheme R[Truck(T), Capacity (C), Data (Y), Cargo (G), Destination (D), Value (V)] with the following FO’s {T C, TY G, TYD, CG V}. Is the decomposition of R into R1 (TCD) and R2 (TGDVY) dependency preserving ? Justify. Is this decomposition lossless ? Justify. Find lossless join and dependency preserving decomposition of R in 3 NF. (10) (b) Different memory partition of 100 K, 500 K, 200 K, 300 K and 600 K in order are given. How would each of the First-fit, Worst-fit and Best-fit algorithm places process of 212 K ? (10) OR 2. (a) Explain the difference between bit rate and baud rate. What baud rate is required to realize a 10 mbps data rate using Manchester encoding ? (10) (b) Given a complete binary tree with 7 nodes. The inorder traversal is GDEABCF. Find preorder and postorder traversals of the tree. (10) __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ SECTION – II Note : This section contains three (3) questions from each of the electives/specializations. The candidate has to choose only one elective/specialization and answer all the three questions from it. Each question carries fifteen (15) marks and is to be answered in about three hundred (300) words. (3 15 = 45 marks) Elective – I 3. A ‘square’ is a string of the fans xx, such as the English word hotshots. If w is a (finite or infinite) string containing no nonempty sub-word of this form, then it is said to be squarefree. A string producing function Fn (n 1), is defined as follows : F1 = 0; F2 = 1; Fn = Fn – 1 Fn – 2 for n 3 i.e. F3 = 10; F4 = 101; and so on (i) Develop an algorithm to check if the strings produced by Fn are squarefree. (Checking squarefreeness is important. Say for example, in chess game, if sequence of moves occurs twice in succession and is immediately followed by the first move of a third repetition, it indicates that no progress is to happen and hence draw.) (ii) Prove that no Fi contains either 00 or 111 as a substring. What could be an application of this check ? (iii) Guess the relationship between Fi Fi + 1 and Fi + 1 Fi, prove your guess by induction. 4. (i) Define the operation perm on strings as follows : perm (x) is the set of all permutations of the letters of x. For example, Perm (0121) = {0112, 0121, 0211, 1012, 1021, 1102, 1120, 1201, 1210, 2011, 2101, 2110} Extend perm to languages as follows : perm (L) = UxL perm(x). If L is regular, need perm (L) be regular ? Justify your answer. (ii) What are the applications of theory of formal languages to the study of Natural Languages ? Discuss at least one. 5. (a) Parsing is an essential feature of compiler. Parsing is also a feature of Natural Language Recognition system. If the grammar G is in Chomsky Normal Form (CNF), can we parse an arbitrary string w L(G) of length n in 0(n3) time ? Prove. Alternatively, for a given G, as follows (which is in CNF) S AB | b A CB | AA | a B AS | b C BS | c Generate parse table and hence the parse tree for the input c a b a b. (b) What would be the time complexity if G is an unambiguous grammar ? (c) What if G is LR(I) grammar ? OR Elective – II 3. What is Lempel-ZIV encoding ? Both the Lempel-ZIV and Huffmen algorithm are similar in that they take the advantages of repetitions then how do, they differ ? 4. (a) State and prove Channel Capacity theorem. (b) Compute weight and distance between each pair of the following words : 10010101, 11011000, 11000011, 00110101 5. Justify DCT form of coding is lossy. Illustrate with an example, why zigzag sequence of run length encoding is associated with it during the compression. OR Elective – III 3. Use the revised simplex method to solve the following Linear Programming Problem. Maximize Z = 2x 1 + x 2 Subject to the constraints 3x 1 + 4x 2 6 6x 1 + x 2 3 x 1, x 2 0 4. Solve the following convex programming to get the optimal solution. Maximize Z = 2x 1 + x 2– x 2 1 Subject to the constraints 2x 1 + 3x 2 6 2x 1 + x 2 4 x 1, x 2 0 5. Write down the necessary and sufficient Kuhn-Tucker conditions to get an optimal solution to the problem of maximizing the given quadratic objective function subject to the linear constraints. Max f(X) = n_ j = 1 Cj Xj – 1/2 n_ j = 1 n_ k = 1 x j djk, x k Subject to the constraints n_ j = 1 aij x j bi i = 1 – m x j 0 j = 1 – n OR Elective – IV 3. If Sx = {S1, S2, S3, S4} indicates the severity level of the symptoms Si for the patient x, A matrix Di gives the upper and lower bounds of the normal range of severity of each of the four symptoms that can be expected in a patient with the disease i. A matrix W is to provide information about the weight of symptom Si for disease dj; construct a model that uses the matrices. W and Dis and helps diagnosis of a patient x when provided with Sn. Use following data to illustrate the logic of your system to come to the conclusion of the most likely disease for a given patient. State explicitly your assumptions if any. Data : We have 3 diseases D1, D2 and D3 for which Dis are given below. D1 = lower upper _ _ _ _ _ _ _ _ 0 .6 .5 0 .2 1 .7 0 D2 = lower upper _ _ _ _ _ _ _ _ 0 .9 .3 .2 0 1 1 .4 D3 = lower upper _ _ _ _ _ _ _ _ 0 0 .7 0 .3 0 .9 0 Weight matrix W is given below. d1 d2 d3 W = S1 S2 S 3 S4 _ _ _ _ _ _ _ _ .4 .8 1 .5 .6 .3 .7 .1 .9 .9 .6 .3 In a specific case of patient, Sx is given as Sx = {(S1, .1), (S2, .7), (S3, .4) (S4, .6)} 4. It is argued that ANNs can effectively be used for learning membership function, fuzzy inference rules and other content dependent patterns. On the other hand, fuzzification of ANNs extends their capabilities and applicability. Assessment of students based upon their responses in the written tests is an intelligent activity. The growing number of students and the scarcity of teachers has called for a computer assisted evaluation system for the students responses in the written tests. Assuming that the most part of the students’ responses is text; occasionally there are drawings and formulae. Design a model hybrid system comprising of neuro-fuzzy and fuzzyneuro approaches. 5. What are the supervised, unsupervised and reinforced learnings in the content of ANNs ? Explain, how would you employ them in a typical facial expression recognition system. Discuss the real time models that you would be using in the system. Justify your choice. [Hint : Vector quantization, self organizing maps, cognition, simulated annealing etc., are the examples of real time models in ANNs] OR Elective – V 3. (a) Explain when a process incurs a protection fault, how Kernal handles it. (b) What are three different ways in which a process can respond to ‘death of child’ signal ? 4. (a) Explain the concept of demand paging in Unix. (b) What is syntax of “Creat” system call ? Write an algorithm for creating a file. 5. (a) What do you mean by Object library and Dynamic link library in Windows environment ? (b) Describe briefly six Window functions usually called while creating a Window. __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ SECTION – III Note : This section contains nine (9) questions of ten (10) marks, each to be answered in about fifty (50) words. (9 10 = 90 marks) 6. Realize the function of four variables using 8 : 1 multiplexer for F = _M (0, 3, 5, 6, 9, 10, 12, 15) __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ ______________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ 7. How does Cohen-Sutherland algorithm decide whether the following lines are to be displayed, clipped or rejected totally for two different lines having there two ends points respectively [(10, 15) and (15, 30)] and [(150, 100) and (250, 100)] for the window having lower left corner at (20, 40) and the top higher corner at (200, 200) ? __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ _______________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ 8. Draw the equivalent DFA and Regular expression for CFG S xSy/Z __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ 9. Consider following sequence of memory reference from a 460 word program : 10, 11, 104, 170, 73, 309, 185, 245, 246, 434, 458, 364 Give the reference string, assume a page size of 100 words. __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ 10. Attendance of students is taken on a blank sheet. Suggest a data structure that would be storage and retrieval efficient. Will your choice vary in the following cases ? Justify your answer by providing efficiency analysis. Remember, there is a connection between the data structures and algorithm and therefore the efficiency of the system. Case 1 : Number of students appearing for the exam are 10 to 100 and the exam is conducted centrally. Case 2 : Number of students appearing for the exam would range from 5,000 to 50,000 and the exam is conducted centrally. Case 3 : Number of students appearing for the exam would range from 5,000 to 50,000 and the exam is conducted at distributed places and attendance record is maintained centrally. You may consider insertion (one time deletion rarely) and search (frequently) as the operations to be provided to handle this data. __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ ______________ 11. Explain the role of entities play in XML DTD’s and documents. Describe the different type of entities and how they are used in DTD’s and documents. __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ _______________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ 12. Explain with example, why Quicksort is called a “Divide and Conquer” algorithm. __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ ____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ 13. Give conceptual dependency diagram for the following : “Since Smoking Can Kill You, I Stopped” __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ _______________________________ __________________________________________________ _____________________________________________ 14. State several factors that will directly affect the cost of maintenance of a software product. __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ SECTION – IV Note : This section contains five (5) questions of five (5) marks each based on the following passage. Each question should be answered in about thirty (30) words. (5 5 = 25 marks) A DISC TV service provider provides services to various customers. Each customer pays Rs. 300 as the monthly service charge. The service provider takes Rs. 500 as deposit and 200 for installation for new connections. These charges are revised after one year for new customer but only monthly revised charges are applicable to old customers. The service provider employees go to the customers for collection of monthly charge, to receive complaints if any and also to get the names of 4 movies the customer would like to see on the channel in a month. The receipt is issued on the spot for the monthly collection. The movie schedule is prepared for the month keeping in mind the popular movies. The channel named screen-2 shows 2 movies daily. Extra request of movies are charged separately and charges are added into the customer monthly charges bill. The customer may request for dis-connection, the customer should request in advance to the service provider or employee visiting him for monthly collection. For permanent disconnect, the employee refunds the deposit after adjusting dues if any during next month visit. The refund payment is made by cheque only. The customer pays their various charges by cheque/credit card/cash. As a system designer study the above problem and design the system using OOP Concept. Draw the following UML diagram. 15. Use case diagram. __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ 16. The class diagram. __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ 17. Sequence diagram. __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ 18. Activity diagram. __________________________________________________ _____________________________________________ __________________________________________________ ______________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ 19. State chart diagram. __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ __________________________________________________ _____________________________________________ For more detailed information I am uploading PDF files which are free to download: Contact Details: Union Public Service Commission UPSC, Man Singh Road Area, New Delhi, Delhi 110069 India Map Location: [MAP]https://www.google.co.in/maps?q=`+Public+Service+Commision,+UPSC,+Man+Singh +Road+Area,+New+Delhi,+Delhi&hl=en&ll=28.608656,77 .227728&spn=0.009513,0.013046&sll=23.814107,86.441 138&sspn=0.009914,0.013046&oq=`+Pu&t=m&z=16&iwloc= A[/MAP] |
#3
18th May 2015, 12:24 PM
| |||
| |||
Re: Last year question papers of UGC NET of Computer Science & Applications
Ok, as you want the question paper of Computer Science & Applications of UGC NET exam so here I am providing you. UGC NET Computer Science & Applications question paper 1. Beam-penetration and shadow-mask are the two basic techniques for producing color displays with a CRT. Which of the following is not true ? I. The beam-penetration is used with random scan monitors. II. Shadow-mask is used in rasterscan systems. III. Beam-penetration method is better than shadow-mask method. IV. Shadow-mask method is better than beam-penetration method. (A) I and II (B) II and III (C) III only (D) IV only 2. Line caps are used for adjusting the shape of the line ends to give them a better appearance. Various kinds of line caps used are (A) Butt cap and sharp cap (B) Butt cap and round cap (C) Butt cap, sharp cap and round cap (D) Butt cap, round cap and projecting square cap 3. Given below are certain output primitives and their associated attributes. Match each primitive with its corresponding attributes : List – I List – II a. Line i. Type, Size, Color b. Fill Area ii. Color, Size, Font c. Text iii. Style, Color, Pattern d. Marker iv. Type, Width, Color Codes : a b c d (A) i ii iii iv (B) ii i iii iv (C) iv iii ii i (D) iii i iv ii UGC NET Computer Science & Applications question paper ![]() ![]() ![]() ![]() ![]() For more questions here is the attachment; |
#4
20th June 2015, 03:21 PM
| |||
| |||
Re: Last year question papers of UGC NET of Computer Science & Applications
Will you please share with me the last year question papers of UGC NET of Computer Science & Applications?
|
#5
14th October 2015, 10:48 AM
| |||
| |||
Re: Last year question papers of UGC NET of Computer Science & Applications
I think you should visit ugcnetonline Dot in for answer keys. Actually I got keys of exam papers there. I think you should try it.
|
|