
	Trending ▼ ICSE CBSE 10th ISC CBSE 12th CTET GATE UGC NET Vestibulares ResFinder

UGC NET JUN 2010 : COMPUTER SCIENCE AND APPLICATIONS PAPER III

14 pages, 55 questions, 0 questions with responses, 0 total responses,

	ugc_net	+Fave Message
	Profile Timeline Uploads Q & A

Home > ugc_net > F Also featured on: abhijay22

Instantly get Model Answers to questions on this ResPaper. Try now!
NEW ResPaper Exclusive!

Formatting page ...

Signature and Name of Invigilator 1. (Signature) __________________________ (Name) ____________________________ 2. (Signature) __________________________ (Name) ____________________________ J 87 Time : 2 1/2 hours] 10 (In figures as per admission card) Roll N o.____________________________ (In words) Test Booklet No. [Maximum Marks : 200 PAPER-III COMPUTER SCIENCE & APPLICATIONS Number of Pages in this Booklet : 24 Instructions for the Candidates 1. Write your roll number in the space provided on the top of this page. 2. Answer to short answer/essay type questions are to be given in the space provided below each question or after the questions in the Test Booklet itself. No Additional Sheets are to be used. 3. At the commencement of examination, the question booklet will be given to you. In the first 5 minutes, you are requested to open the booklet and compulsorily examine it as below : (i) To have access to the Question Booklet, tear off the paper seal on the edge of this cover page. Do not accept a booklet without sticker-seal and do not accept an open booklet. (ii) Tally the number of pages and number of questions in the booklet with the information printed on the cover page. Faulty booklets due to pages/questions missing or duplicate or not in serial order or any other discrepancy should be got replaced immediately by a correct booklet from the invigilator within the period of 5 minutes. Afterwards, neither the Question Booklet will be replaced nor any extra time will be given. 4. Read instructions given inside carefully. 5. One page is attached for Rough Work at the end of the booklet before the Evaluation Sheet. 6. If you write your name or put any mark on any part of the Answer Sheet, except for the space allotted for the relevant entries, which may disclose your identity, you will render yourself liable to disqualification. 7. You have to return the test booklet to the invigilators at the end of the examination compulsorily and must not carry it with you outside the Examination Hall. 8. Use only Blue/Black Ball point pen. 9. Use of any calculator or log table etc., is prohibited. J-8710 Roll No. Number of Questions in this Booklet : 26 1. 2. , 3. , - - : (i) - - (ii) - / - - 4. 5. - (Rough Work) 6. - , 7. - 8. / 9. ( ) P.T.O. COMPUTER SCIENCE AND APPLICATIONS PAPER III Note : This paper is of two hundred (200) marks containing four (4) sections. Candidates are required to attempt the questions contained in these sections according to the detailed instructions given therein. J-8710 2 SECTION I Note : This section consists of two essay type questions of twenty (20) marks, each to be answered in about five hundred (500) words each. (2 20 = 40 marks) 1. 1. 1. 1. Elective I 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 (a) For each of the following generating matrices encode the given messages. If G is given as 1 0 0 1 1 G= 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 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 (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) (a) _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ J-8710 3 P.T.O. _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ 2. (a) (b) J-8710 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, TY D, 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) 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 6 2. (a) (b) Explain the difference between bit rate and baud rate. What baud rate required to realize a 10 mbps data rate using Manchester encoding ? Given a complete binary tree with 7 nodes. The inorder traversal GDEABCF. Find preorder and postorder traversals of the tree. is (10) is (10) _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ J-8710 7 P.T.O. Note : 3. 4. SECTION II 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 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. (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) = Ux L 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) (b) J-8710 State and prove Channel Capacity theorem. Compute weight and distance between each pair of the following words : 10010101, 11011000, 11000011, 00110101 10 5. 3. 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 Use the revised simplex method to solve the following Linear Programming Problem. Maximize Z = 2x1 + x2 Subject to the constraints 4. 3x1 + 4x2 6 6x1 + x2 3 x1, x2 0 Solve the following convex programming to get the optimal solution. Maximize Z = 2x1 + x2 x2 1 Subject to the constraints 5. 2x1 + 3x2 6 2x1 + x2 4 x1, x2 0 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. n n Max f(X) = Cj Xj 1/2 j=1 n xj djk, xk j=1 k=1 Subject to the constraints n aij xj bi i=1 m j=1 xj 0 3. j=1 n OR Elective IV 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. lower 0 .6 .5 0 D1 = upper .2 1 .7 0 lower 0 .9 .3 .2 D2 = upper 0 1 1 .4 J-8710 11 P.T.O. lower 0 0 .7 0 upper .3 0 .9 0 Weight matrix W is given below. d1 d2 d3 .4 .8 1 S D3 = 1 W= S2 S3 .5 .7 .9 .6 .3 .1 .9 S4 .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 (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 ? 3. 4. (a) (b) 5. Explain the concept of demand paging in Unix. What is syntax of Creat system call ? Write an algorithm for creating a file. (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. _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ J-8710 12 _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ 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) _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ J-8710 18 _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ 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 _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ J-8710 19 P.T.O. 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. _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ J-8710 20 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 _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ J-8710 21 P.T.O. _______________________________________________________________________________________________ _______________________________________________________________________________________________ 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. _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ J-8710 22 _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ 16. The class diagram. _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ 17. Sequence diagram. _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ 18. Activity diagram. _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ 19. State chart diagram. _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ ____________ J-8710 23 P.T.O.

Formatting page ...

Additional Info : Ugc Net June 2010 Question Paper - Computer Science And Applications Paper III
Tags : cbse ugc net question papers, UGC NET Solved Sample Question Paper, UGC NET Exam Papers, ugc net past question papers, ugc net syllabus, ugc net specimen, ugc net study material, UGC NET Study Materials FREE, UGC NET Exam Pattern, Free Ugc Net Online Practice Tests, ugc net previous question papers, central board of secondary education,

ugc_net chat

Horizontal lines at:
Guest Horizontal lines at:
AutoRM Data:
Box geometries: