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

UGC NET JUN 2007 : COMPUTER SCIENCE AND APPLICATIONS PAPER III

18 pages, 56 questions, 0 questions with responses, 0 total responses,

	ugc_net	+Fave Message
	Profile Timeline Uploads Q & A

Home > ugc_net >

Formatting page ...

Signature and Name of Invigilator Roll No. (In figures as per admission card) 1. (Signature) (Name) Roll No. 2. (Signature) (Name) J 8 7 0 7 Time : 2 hours] (In words) Test Booklet No. PAPER III COMPUTER SCIENCE AND APPLICATIONS Number of Pages in this Booklet : 40 [Maximum Marks : 200 Number of Questions in this Booklet : 26 Instructions for the Candidates U U 1. Write your roll number in the space provided on the top of this page. 1. U DU U S U U U U U 2. U U U, U S U U 2. Answers 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. U U No Additional Sheets are to be used. 3. U U U, - S U U U - S U U 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) - S U U U U U U U S U U- U S S U U (i) To have access to the Test 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) U DU U U U - S DU U U U U U U S DU / U U U U U S S U U U U U S U U - S U U - S U UQ (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. U U 4. Read instructions given inside carefully. 5. One page is attached for Rough Work at the end of the booklet before the Evaluation Sheet. 5. U U- S (Rough Work) U U DU 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. 6. U- S U , U U U U 7. U # U U- S U U U U U # U U U U 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. / U Z U S U 8. Use only Blue/Black Ball point pen. 9. Use of any calculator or log table etc. is prohibited. 9. U ( U U) U U 10. There is NO negative marking. 10. U U J 8707 1 P.T.O. COMPUTER SCIENCE AND APPLICATIONS PAPER III NOTE : J 8707 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. 2 SECTION - I Note : This section contains five (5) questions based on the following paragraph. Each question should be answered in about thirty (30) words and each carries five (5) marks. (5x5=25 marks) A private consulting company is dealing in sales and purchase of houses, plots and flats. Persons intending to sell their properties have to fill up property information form, register the property with consulting company, show and deposit necessary documents, description of property, expected price. The company displays this information with video clips on website. A person interested in buying such property fills up the order form which contains purchase price. Site visit is arranged by consultant company. If bargain price is accepted by seller, he has to pay some advance and the property is marked as sold . The necessary formalities are completed by consulting company and they charge necessary commission from the seller. You are requested to design following : 1. Context and first level DFD. J 8707 3 P.T.O. 2. Database Design. 3. MIS Reports. J 8707 4 4. Property information form. 5. ER Diagram. J 8707 5 P.T.O. SECTION - II Note : 6. This section contains fifteen (15) questions each to be answered in about thirty (30) words. Each question carries five (5) marks. (5x15=75 marks) What is the role of a microsequencer in Microprogramming Control Unit ? J 8707 6 7. Draw the states of a binary counter for 4 bits. 8. Justify that range queries can benefit, from cluster indexing. J 8707 7 P.T.O. 9. Define : Referential Integrity and Self-referential Integrity. 10. What are the disadvantages of drawing a circle using polar co-ordinates method ? J 8707 8 11. Compare the scan line polygon fill with the boundary fill algorithm. 12. Write a parse - tree for the following assignment statement : a5b1c d1e ; J 8707 9 P.T.O. 13. A network on the Internet has a subnet mask of 255.255.240.0, what is the maximum number of hosts it can handle ? Explain how. 14. What do you mean by binary exponential back off ? J 8707 10 15. Write a function in C-language to find maximum of an arbitrary array having n-elements. 16. Try to structure Furniture , Chair and Table classes in an inheritance hierarchy. J 8707 11 P.T.O. 17. How does the Java runtime handle thread scheduling ? 18. What are the disadvantages of water-fall model ? J 8707 12 19. What are the necessary conditions for a deadlock ? 20. What are the functions of a distributed operating system ? J 8707 13 P.T.O. SECTION - III Note : This section contains five (5) Electives. The candidate has to choose one Elective and has to answer all the five questions from that Elective. Each question carries twelve (12) marks and is to be answered in about two hundred (200) words. (12x5=60 marks) Elective - I 21. Convert the following non-deterministic finite automata (NFA) to deterministic finite automata (DFA). Write the transition for string ab ab abb 22. Define GNF and CNF. Convert the following grammar to CNF. (i) S ABa A aab B Ac (ii) Convert the following grammar to GNF S AB A aA|bB|b B b 23. Write a PDA for the language { L = a n b n |n 1 } 24. Minimize the mates of the following Deterministic Finite Automata (DFA). 25. Write a Turing machine for the following language. { L = a n b n |n 1 } OR J 8707 14 Elective - II 21. Consider a Discrete memory with source probabilities - {0.20, 0.20, 0.15, 0.15, 0.10, 0.10, 0.05, 0.05}. Determine an efficient fixed length code of the source and the Huffman code for the source. Compare these two codes and comment. 22. Consider the binary channel for the figure shown below Let the a priori probabilities of sending the binary symbol be P0 and P 1, where P0 + P1 =1. Find the a posteriori probabilities P (X = 0 | Y = 0 ) and P (X =1 | Y =1). 23. State and prove channel capacity theorem. 24. Compute weight and distance between each pair of the following words : 10010101, 01101011, 11001010. 25. Explain image compression organizing feature of map. OR Elective - III 21. Consider the following LPP : min 3x 1 1 4x 2 2 54x 3 S.t 4x 12 11x 2 7 3x 12 8x 3 211 4x 22 6x 458 x 1 0, x 2 0 , x 3 0 Convert the above numerical Problem to : (i) (ii) J 8707 LPP in the standard form. LPP in the Canonical form. 15 P.T.O. 22. Give Malhotra - Pramod Kumar - Maheshwari Polynomial algorithm for solving Network flow problem 23. Apply the Bellman-Ford s and Dijikstra s algorithms to find the shortest path from A to F in the network shown in the above figure. 24. Define : (a) Convex programming problem. (b) Concave programming problem. (ii) 25. (i) In which (if any) programming problem (of above) does the local external point coincide with the global external point ? Give the mathematical Proof/Justification of your answer. Consider the following region : R = { (x1, x2, .......... xn)Te|Rn|f(x1, x2 .......... xn) 0} Where f is a convex function of n variables. Is R convex ? Is it concave ? Prove your answer using the convex function and region, concave function and region. OR J 8707 16 Elective - IV 21. Discuss Networks Back Propagation (BP) Training algorithm. 22. Prove that the following properties are satisfied by all fuzzy intersection in Yager class (a) Iw (a,0) = 0 (b) Iw (a,1) = a (c) Iw (a,a) a (d) w 0 lim I w (a, b) 5 I min (a, b) 23. Discuss how you would design multilayer perceptron net. 24. Explain with examples - Lambda-cuts of fuzzy sets. 25. What is perceptron ? Give a model for perceptron using the model perceptron, show that two input XOR problem cannot be solved in one layered Neural Network. OR Elective - V 21. What is the syntax of create system call ? Write an algorithm for creating a file. 22. How do exec system calls works ? Explain in detail logical format of an executable file. 23. Write a program to show that the parent and child get separate data segment. 24. What do you mean by object library, import libraries and dynamic link libraries in Windows environment ? 25. Describe briefly six window functions usually called while creating a window. J 8707 17 P.T.O. SECTION - IV Note : This section consists of one essay type question of forty (40) marks to be answered in about one thousand (1000) words on any of the following topics. This question carries 40 marks. (40x1=40 marks) 26. (a) State all rules required to converrt the given WFF to the clavsual form and the rules for skolemnization while converting. (b) Explain architecture and components of an expert system. OR (a) Use the dynamic programming approach to write an algorithm to find the maximum sum in any contiguous sublist of a given list of n real values. Analyze your algorithm, and show the results using order notation. OR (a) Write a recursive descent parser for the following grammar. E E 1T|T T T F|F F (E) |a|b|c (b) Trace the recursive calls for the input a b1 c J 8707 30

Formatting page ...

Additional Info : Ugc Net June 2007 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: