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

UGC NET DEC 2008 : COMPUTER SCIENCE AND APPLICATIONS PAPER III

19 pages, 57 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 Roll No. (In figures as per admission card) 1. (Signature) (Name) Roll No. 2. (Signature) (Name) D 8 7 0 8 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 D 8708 1 P.T.O. COMPUTER SCIENCE AND APPLICATIONS PAPER III NOTE : D 8708 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 big campus of a university has different departments located within it. Each department conducts examination of one or more programmes. Further, examination may not begin on the same date as well as time for each programme. Each department may or may not have sufficient number of invigilators to conduct the examination. You are required to carry out the following to automate the task of invigilator allocation which may not be limited to one s own department. 1. Draw the E-R diagram including attributes. D 8708 3 P.T.O. 2. Draw the UML diagram. 3. Draw the DFD upto 2nd level. D 8708 4 4. Prepare Data base Design including Data Dictionary. 5. Comment on the Security aspects and Information reporting. D 8708 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) Write the steps for generating frame based animation. Explain each step briefly. D 8708 6 7. Write an 8085 assembly language program that finds the largest of three given numbers. 8. The urn protocol is used with 200 users of whom 40 are ready to send. Determine the probabilities of collision and success. D 8708 7 P.T.O. 9. With reference to average behaviour, determine the complexity of linear search. 10. How will you find x29 using Divide and Conquer Technique ? D 8708 8 11. What is partitioning in ORACLE ? What are its benefits ? 12. What is an XML Parser ? How parsers read in and deliver XML data to an application ? D 8708 9 P.T.O. 13. Is < > all identical to not in in SQL ? In either case, justify your answer by giving example. 14. Describe the various methods of passing parameters in procedural programming languages. D 8708 10 15. What are the advantages and disadvantages of prototyping model ? 16. List various types of coupling and explain three of them in detail. D 8708 11 P.T.O. 17. What are the functions of data link layer ? Compare OSI data link layer with IEEE 802 with suitable examples. 18. Compare the main memory Organization schemes of contiguous memory allocation, pure segmentation and pure paging with respect to the following issues : a External Fragmentation b Internal Fragmentation c ability to share code across processes D 8708 12 19. What memory management technique is used in UNIX system ? How is system performance maintained with the particular memory management technique ? 20. Why is the use of hill climbing technique limited in AI ? D 8708 13 P.T.O. SECTION - 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. (12x5=60 marks) Elective - I 21. Explain why a finite state machine can not recognise a palindrome. 22. Determine if the grammar G 5 ( { S, A }, { a }, P, S ) Where P5{ ( S A ), ( A aAa ), (A a) } is ambiguous. 23. Show that the function if x50 0 LOG (x)5 log 2 ( x ) 11 if x > 0 is primitive recursive. 24. Describe Chomsky classification of languages. 25. Construct a Turing machine that enumerates {0n 1n/ n 1}. OR Elective - II 21. What do you mean by lossy compression of images ? Describe one lossy compression technique for images. 22. What do you mean by minimum distance of a linear code ? State and prove Hamming bound for a linear code over GF (q). 23. Describe the construction of a typical parity check matrix for Hammig codes over GF(2). Give its code words and error correction capability. 24. Define binary symmetric channel. Derive the expression for capability of symmetric channel and hence show that the capacity of binary symmetric channel is 12H (b, 12b). The symbols have the usual meaning. D 8708 14 25. Consider a binary symmetric channel with capacity C. Suppose the source produces binary digits at the fixed rate R digits per second. Given R>C, 0 l<1, show that for sufficiently large n, no code ([2nR], n) can have average probability of error less than l. OR Elective - III (Operations Research) 21. Describe Karmakar s method for solving linear programming problem and compare it with the ellipsoid method. 22. Using Dijkstra s shortest path algorithm, determine the shortest path from vertex V0 to every other vertex : 23. State and explain Kuhn-Tucker Conditions. 24. Explain the meaning of matroid . Distinguish between graphic and cographic matroids. 25. Determine the maximum flow from source to sink : The capacities of the links are as indicated. OR D 8708 15 P.T.O. Elective - IV 21. Distinguish between randomness and fuzziness. 22. Show that the EX-OR switching function is not linearly separable. 23. Explain the following statement : Fuzzy systems are shallow but fully interactive . 24. State and explain differential Hebbian Learning Law. 25. What are fuzzy cognitive maps ? Describe their use. OR Elective - V 21. Describe which data structures are associated with processes. How are these affected by exec, fork and exit system calls ? 22. Draw the block diagram of the structure of UNIX operating system and explain each component of it. 23. Write a shell script which does the following : If the number of users are 50 or more, it should print the (i) (ii) 24. login names of users who have logged in last 5 minutes and login names of users who have logged out in last 5 minutes. What is a thread ? How is a thread created in windows operating system ? What are priority class and thread priority class ? What are the advantages of using threads ? Explain thread priority with an example. D 8708 16 25. Write short notes on : (i) Scroll bar control (ii) WM - COMMAND (iii) WM - TIMER (iv) Status bar messages with examples. D 8708 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 one of the following topics. (40x1=40 marks) 26. (a) Draw a neat sketch showing a pushdown stack memory machine and explain it. (b) Show that a pushdown stack memory machine has a power lying between finite state machine and the Turing Machine. OR (a) (b) 1 1 1111 ,,, , and . 2 4 8 16 32 32 Determine the Huffman Code. Determine the average length of the code. A source emits six symbols with the probabilities Describe JPEG compression of graphics. OR Consider a complete undirected graph with 8 nodes and the following distance matrix : From 1 2 3 4 To 2 3 4 5 6 41 19 99 83 108 120 140 35 88 96 121 137 151 80 70 95 108 127 53 66 87 86 26 42 57 22 34 5 6 7 7 8 27 Show that the distance matrix has metric property. Using an approximate algorithm, obtain a solution to the travelling salesman problem for this graph. OR D 8708 29 P.T.O. B is an N dimensional bit vector. p(B) is defined as follows : 1 if B contains an odd number of 1 s p(B)5 0 if B contains an even number of 1 s Construct a feedforward multilayer neural network that implements the parity function p(B) for 5 dimensional bit vectors. OR (a) Draw a neat sketch showing the architecture of Windows NT and explain it. (b) How is cache managed in Windows XP ? D 8708 30

Formatting page ...

Additional Info : Ugc Net December 2008 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: