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

UGC NET JUN 2005 : COMPUTER SCIENCE AND APPLICATIONS PAPER III

17 pages, 60 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 5 Time : 2 hours] (In words) Test Booklet No. PAPER III COMPUTER SCIENCE AND APPLICATIONS Number of Pages in this Booklet : 36 [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 Test booklet, 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 8705 1 P.T.O. COMPUTER SCIENCE & APPLICATIONS PAPER III - III NOTE : J 8705 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. (5 x 5 = 25 marks) Consider following table structures for a library system : STUDENT (membership_no, name, course) BOOK (book_id, category, title, author, price, status) BOOK_STATUS (book_id, membership_no, issue_date, return_date, fine_charged, fine_period) Write SQL statement for the following. 1. Create Book table with proper constraints. J 8705 3 P.T.O. 2. Delete all books where status is lost . 3. Increase fine charged by 10%, for all students whose return date is two weeks overdue. J 8705 4 4. 5. Display membership_no; name of student who did maximum number of issue transaction in this academic year. Draw STD (State Transition Diagram) for above. J 8705 5 P.T.O. SECTION - II U II NOTE : This section contains fifteen (15) questions each to be answered in about thirty (30) words. Each question carries five (5) marks. (5 3 15 575 marks) 6. Show the sequence of instruction required in stack oriented machine with twoaddresses to execute : a/b+b*c/d. J 8705 6 7. Draw neat diagram of a BCD adder. 8. What is an attribute inheritance and why is it important ? J 8705 7 P.T.O. 9. What are the different methods of maintaining synchronous replicas in a Distributed DBMS ? 10. What is anti-aliasing ? J 8705 8 11. What are the limitations of Z-buffer algorithm ? 12. Describe the function of lexical analyser and identify the tokens in the following C language statement : Cost = price * quantity : J 8705 9 P.T.O. 13. What is the need for a separate layer, as transport layer, when error handling is done at data link layer ? 14. DNS uses UDP instead of TCP. If a DNS packet is lost, there is no automatic recovery. Does this cause a problem, and if so, how is it solved ? J 8705 10 15. 16. Define Big-0 notation and list the complexity of Bubble sort, Quick sort and Merge sort using Big-0 notation What do you understand by data members and member function of a class. J 8705 11 P.T.O. 17. What is the use of Z-index attributes. 18. What is the use of SRS in software testing ? J 8705 12 19. Why compaction is necessary and list the over heads in compaction ? 20. How systems calls are executed in Unix Operating System, explain with an example ? J 8705 13 P.T.O. SECTION - III U III NOTE : This section contains five (5) questions from each of the electives / specialisations. The candidate has to choose only one elective / specialisation and answer all the five questions from it. Each question carries twelve (12) marks and is to be answered in about two hundred (200) words. (12 x 5 = 60 marks) Elective - I 21. Convert the following non-deterministic finite automata (NFA) to deterministic finite automata (DFA). Write the transitions for string abababa . 22. Minimize the states of the deterministic finite automata given below and draw the transition diagram of the same. 23. Show that the following languages are not regular. (i) L = { an b n | n / 1 } (ii) L = {an bm cm dn | n, m / 1} 24. Write a pushdown automata for the following language : L 5 { w w R | w e { 0, 1} * } 25. Write a turing machine for the following language. L= {an bn cn | n / 1} OR J 8705 14 Elective - II 21. Consider a discrete memoryless source probabilities : { 0.35, 0.25, 0.20, 0.15, 0.05}. (I) (II) 22. 23. Determine the Huffman code for this source and the average length R of the codewords. What is the efficiency of the code ? Discuss Lamped-Ziev Codes and its information content. Compare this with Huffman Code. 1 0 0 1 1 If the generating matrix G = 0 1 0 1 0 encode the message { 100, 010, 111 } 0 0 1 0 1 24. Sampling and Quantization process are lossy processes, Justify. Also explain the relevence of Sampling and Quantization. 25. Discuss fractral image. Compression technique and give its advantages. OR Elective - III 21. (i) (ii) Define Linear Programming Problem (LPP) in (a) Standard form (b) Cabonical form Give an algorithm to convert the LPP in the standard form to the LPP in Cononical form. 22. Apply the Dijkstra s algorithms to find the shortest path from A to F in the above shown figure. 23. Given Kuhn-Tucker optimality conditions for non-linear program. Apply KT method to solve the following. (i) Min Z 5 x 121 x 2 S.t x121x2219 50 2 (x 11 x 22) 11 / 0 J 8705 15 P.T.O. (ii) Min (2 x121x2214 x226x 2) S.t x113x2 [ 3 ; x1/0 (i51, 2) 24. (i) (ii) 25. A company sales two types of items A and B. Item A sales for Rs 25 per unit. No Quantity discount is given. The sales revenue for item B decreases as the no. of units sold increases and is given by : Sales revenue = ( 30 - 0.30 x2) x2 where x2 is the no. of units sold of item B. Define Convex functions and Convex-regions. Define the following : 1. Slack Variables 2. Surplus Variables 3. Optimal Solution 4. Basic Solution OR Elective - IV 21. Give the classification and explain the separability of XOR problem. 22. Explain Auto-associative memories and Hetero-associative memories with examples. 23. What is a -cut of a fuzzy set A ? Does the a-cut of a fuzzy set A give us another fuzzy set ? Explain. 24. Discuss the significance of Boltzmann learning Law and discuss its difficulties. 25. What do you mean by closure of a fuzzy binary relation ? Give an example. OR Elective - V 21. What are different Windows messages used in mouse processing ? Explain each one of them. 12 22. Write program statements using windows functions to define an edit box of the size of the client area. It should occupy the whole client area even when the window size is changed. 12 23. What is an asynchronous socket ? How does it support synchronization ? 12 24. Explain, how to create a background process. How will you provide input to background process ? How will you terminate background process ? 12 25. Define and differentiate among foreground, background and deamon processes. 12 J 8705 16 SECTION - IV U 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. (40 x 1 = 40 marks) 26. (a) Write minmax algorithm and explain with suitable example the concept of AlphaBeta Cut-off. (b) Explain natural language processsing in detail. OR (a) Discuss the principle of backtracking Algorithms and write a program in either C or C++ to solve n-queen problem. (b) Write tree diagram for solving a 4-queen problem. OR (a) Design a predictive parser for the grammer given below : E E1T|T T T F|F F (E)|a|b|c (b) J 8705 Show how the parser accepts the input (a + b) * c 27 P.T.O.

Formatting page ...

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