Trending ▼   ResFinder  

UGC NET JUN 2006 : COMPUTER SCIENCE AND APPLICATIONS PAPER III

18 pages, 63 questions, 0 questions with responses, 0 total responses,    0    0
ugc_net
  
+Fave Message
 Home > ugc_net >   F Also featured on: cvsingh007

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

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 6 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 8706 1 P.T.O. COMPUTER SCIENCE AND APPLICATIONS PAPER III NOTE : J 8706 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) An ABC agency caters the service for various customers and maintains their warranty certificate details and maintenance contracts for TV sets. The complete details of these customers viz. Customer Name, address, Warranty certificate no. and issue date, warranty period validity (date from - date to) and for product items (Picture Tube, Volume control, etc.) and Maintenance Contract Details. If, in case of a customer s complaint, ABC agency sends their person within 2 days of the complaint being lodged to look into the problem and appropriate remedy is suggested. In case of warranty period validity, the customer problem is solved free of cost else a charge is levied for overcoming the problem. In case of warranty period being over, a customer is also given the option of maintenance contract for 2 years on a nominal charge. Maintenance contracts are renewed thereafter if the customer so desires. As a system analyst, design the following : 1. Draw E - R Diagram. J 8706 3 P.T.O. 2. Draw functional decomposition diagram. 3. Give physical Data Flow Diagram. J 8706 4 4. Give Input Screen Design. 5. Draw State Transition Diagram. J 8706 5 P.T.O. SECTION - II Note : This section contains fifteen (15) questions each to be answered in about thirty (30) words. Each question carries five (5) marks. (5x15=75 marks) 6. Implement the switching function F (ABC)5S(0, 1, 5, 7) using a 4 input multiplexer. J 8706 6 7. Write an 8085 assembly language program to pick the largest of three given numbers. 8. What is the time spent in scanning each row of pixels during screen refresh in a raster system with resolution of 6403480 and a refresh rate of 60 frames/second ? J 8706 7 P.T.O. 9. A triangle ABC with vertices A (3, 4), B (7, 2), and C (5, 8) is on the screen. What is the transformation, if the triangle is to be magnified twice its size keeping A (3, 4) fixed ? Obtain the new vertices of the triangle. 10. Show that two - phase locking ensures the serializability. J 8706 8 11. What is the highest normal form of each of the following relation ? (i) R1 (A B C) with A B, A C, and C B (ii) R2 (A,B,C,D) with A BC, CD B (iii) R3 (A,B,C,D,E) with A BC, E CA, CD E Find the candidate keys for each of these relations. 12. How is server crash handled in RPC (Remote Procedure Call) ? J 8706 9 P.T.O. 13. What do you mean by binary exponential backoff ? 14. What do you understand by data-member and member-function of a class ? J 8706 10 15. What is thread ? How is it different from a process ? 16. What are the differences between simple paging and demand paging ? J 8706 11 P.T.O. 17. What characteristics are common to traps, supervisory calls, and subroutine calls, but different in interrupts ? 18. Which of the two parameters a and b in a*KDLOCb, has more evident impact on the values of effort in the basic COCOMO model ? J 8706 12 19. How are reliability and time of delivery co-related with the cost building the software ? 20. Consider the following weighted 2 - tree T. Find the weighted path length P of the tree T. J 8706 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. Consider the following language L5{wwR/w e {0, 1}*} (Note : wR represents reversal of string w) Construct a CFG to represent this language. Prove that L5L(G), for the grammar G you have constructed. 22. Prove that following language are not regular using Pumping Lemma. L5{0 i 1i|i/0} 23. Consider the grammar G (S) with P: S ABC|AB A BS|b B SA|a Convert this grammar into Greibach Normal Form (GNF). 24. Construct an automation M which accepts the language L(M)5{arbs : r > 0 s > 0} 25. Design an Algorithm for obtaining minimum state equivalent DFA for given DFA. OR Elective - II 21. Consider a Discrete memoryless source with three output symbols with probabilities {0.5, 0.4, 0.1}. (a) Determine the Huffman code for this source and the efficiency. (b) Determine the Huffman code for this source taking two symbols at a time and find the efficiency h. J 8706 14 22. Determine the Lampel ziv code for the following bit stream 0100111100101000001010101100110000. 23. Consider the channels A, B and the Cascaded channel AB for the figure shown here : (a) Find CA the capacity of Channel A (b) Find CB the capacity of Channel B (c) Cascade the two channels and determine the combined capacity CAB. Explain the relation between CA, CB and CAB. (d) 24. How can Fourier transformation be used to perform image restoration? 25. Discuss fractral image compression technique and give its advantages. OR Elective - III 21. Solve the Linear Programming Problem by Simplex method : Minimize Z52x123x216x3 Subject to 3 x 124 x 22 6 x 3[2 2 x 1 1 x 21 2 x 3 / 11 x 113 x 222 x 3[5 x1 and x2/0 22. Obtain the Kuhn Tucker s necessary and sufficient conditions for a solution of the following problem : Minimize 1 f ( x )5P T X 1 X T CX 2 Subject to AX5b X/0 Where C is a symmetric positive semi - definite matrix. J 8706 15 P.T.O. 23. Given node - arc chain notions of flow in a network. Prove that a flow f is maximal if and if only there is no flow augmenting path with respect to f. (b) Find a maximal flow in the following network, where the numbers associated with the branches are the capacities in the direction shown. (a) Show that if a linear programming problem has an optimal solution, then atleast one of the basic feasible solution will be optimal. (b) 24. (a) Solve the following Transportation Problem : From 25. (a) A B C Demand Show that if X 1 1 0 0 2 To 2 2 1 0 3 3 0 3 0 3 4 0 0 2 4 5 0 0 5 6 Supply 3 4 7 2 is a solution of the problem 2 2 Minimize f ( ,X)5 PTX1 1T X CX 2 AX5b X / 0, 2 2 is monotonically non- Where is a parameter, T is transposition Then PTX increasing function of . (b) 2 Show that (XTBX) is a convex function of X e En, where B is a real symmetric positive semi - definite. OR J 8706 16 Elective - IV 21. State perceptron learning law. Write learning algorithm for perceptron network. 22. Distinguish between Hebbian learning and competitive learning. 23. Describe Back propagation algorithm in a Neural Network. Mention one of its applications. 24. What do you mean by fuzzy relation ? Illustrate fuzzy relation with simple example. 25. Define a - cut of a fuzzy set A. Illustrate a - cut set with an example. OR Elective - V 21. Explain three categories of files in UNIX. 22. What is the grep used for ? What are its various options ? Give the syntax of the grep command. 23. (a) What is the purpose of a nice command ? (b) What are the advantages of cpio over tar ? (a) Explain the Common Desktop Environment (CDE) of X window system. (b) How does X solve the problem of running the same program on different displays with different characteristics ? 24. 25. Explain the role of X in running X clients Remotely. J 8706 17 P.T.O. SECTION - IV Note : This section consists of one question carrying (40) marks. 26. Consider the grammar G (S) with : (a) P: (40x1=40 marks) S aAbc|BCf A C|e B Cd|c C df|e Construct LR (I) sets of items and construct complete perge table. (b) Give a method of transforming any given Context Free Grammar (CFG) in equivalent Pushdown Automation (PDA). OR (a) Solve the following travelling salesman problem using branch and bound algorithm : Cost matrix 5 (b) 1 2 3 4 1 10 5 19 2 5 6 18 3 10 8 17 4 6 9 12 - Show that the average complexity of SIS (Straight Insertion Sort) is O (N2). OR (a) With a neat diagram, explain components and functions of Expert Systems. (b) Write A* Search Algorithm. Mention advantages over any one search algorithm. J 8706 29 P.T.O.

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

Formatting page ...

 

  Print intermediate debugging step

Show debugging info


 

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

© 2010 - 2025 ResPaper. Terms of ServiceContact Us Advertise with us

 

ugc_net chat