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

UGC NET DEC 2009 : COMPUTER SCIENCE AND APPLICATIONS PAPER III

18 pages, 74 questions, 1 questions with responses, 2 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) ____________________________ Roll No. (In figures as per admission card) Roll N o.____________________________ (In words) Test Booklet No. D-8709 Time : 2 1/2 hours] [Maximum Marks : 200 PAPER-III COMPUTER SCIENCE AND APPLICATIONS Number of Pages in this Booklet : 40 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. D-8709 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 & 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. D-8709 2 SECTION-I This section contains five (5) questions based on the following paragraph. Each question should be answered in about thirty (30) words and carries five (5) marks. (5 5 = 25 Marks) Read the passage given below and answer the questions that follow based on your understanding of the passage : A travel company is in an air-line service. It has two types of aircrafts and has three classes Executive, Business and Economy with different fare structure and facilities. Ticket bookings are computerised and done through agents or directly on phone or in person at the company s booking offices. Booking can be preponed, postponed or cancelled. Only cancellations at any time before 12 hours is charged 20%, after 12 hours but before one hour charged 40% and after that it is charged 60% but in case of loss of ticket there is no refund. Customers are offered a choice of veg, non-veg meals in flight. The customers are allowed to carry one piece of hand baggage of permitted size and weight. Excess weight baggage is charged separately. The full ticket amount is to be paid at the time of issue of ticket by cash, cheque, credit card or debit card is given for 15 days to accredited agents. Draw UML diagrams. 1. Use case diagram _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ D-8709 3 P.T.O. 2. Class diagram _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ 3. Sequence diagram _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ D-8709 4 4. Activity diagram _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ 5. State chart diagram _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ D-8709 5 P.T.O. SECTION-II This section contains fifteen (15) questions, each to be answered in about thirty (30) words. Each question carries five (5) marks. (15 5 = 75 Marks) 6. Implement the following with NAND and NOR logic F = (A + B) (C + D) _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ 7. Write assembly language program to execute A B/C+M _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ D-8709 6 8. Given the set of functional dependencies {A BCD, CD E, E CD, D AH ABH BD, DH BC} Find a non-redundant cover. Is this the only non-redundant cover ? _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ 9. Why are fragmentation and data replication useful in DDBMS ? What are the main types of fragmentations ? What sort of considerations are used to decide about the type and extent of Data fragmentation and replications ? _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ D-8709 7 P.T.O. 10. Draw the line between (30, 20) and (40, 28) by determining the pixel locations table using DDA technique. _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ 11. Define Aspect ratio, refresh rate, resolution. _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ D-8709 8 12. Explain the layer of OSI model, which is responsible for providing node-to-node communications with reliable service. _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ 13. Why do asynchronous communications require additional start and stop bits ? What is wrong with letting the first bit in a transmission act as a start bit and the last one act as a stop bit ? _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ D-8709 9 P.T.O. 14. Consider an array of 10 integers 5, 3, 8, 9, 1, 7, 0, 2, 6, 4 using quick sort s algorithm, using 5 as pivot value. Write down the resulting array after 1st iteration/partition. _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ 15. Write an applet that display the string COMPUTER SCIENCE & APPLICATION in the different font sizes at the centre of the screen. _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ D-8709 10 16. Write recursive function code in C to reverse the given integer. _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ 17. What is difference between validation and verification ? _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ D-8709 11 P.T.O. 18. Define reliability and explain its importance in software development models. _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ 19. What are differences between binary sema-phore and general sema-phore ? _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ D-8709 12 20. Given the following information draw a timeline for using Round-robin Scheduling techniques : Job No. 1 2 3 4 5 Arrival Time 0 1 2 3 4 CPU Cycles 10 2 3 1 5 _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ _______________________________________________________________________________________________ D-8709 13 P.T.O. SECTION III This section contains five (5) questions from each of the electives/specializations. The candidate has to choose only One elective/specialization 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. (5 12 = 60 Marks) ELECTIVE I 21. Design Deterministic Finite Automata to accept the following sets of strings over the alphabet {0, 1} (a) At strings containing exactly 3 0 's and at least 2 1 's. (b) All strings whose binary interpretation is divisible by 5. 22. Consider the following two languages : L1 = {an b2n cm | m, n 0} L2 = {an bm c2m | m, n 0} Determine if the sets L1 L2 and L1 L2 are context free languages or not. 23. Determine using CYK algorithm if the string abbab is present in the language of the following grammar : S ab B | aa S | b B | a | b A bB|aS B a A | bA | a | b 24. Write down the CFG for a small programming language which consists of only assignment, goto, if then else, I/O and stop statements. The maximum size of the variable can be 6 characters and they are made up of digits, underscore and small letters. The first character cannot be underscore character. 25. Design a Turing Machine to evaluate the square of an integer. OR ELECTIVE II 21. What is a Huffman Code ? Give example. What is the Huffman s no prefix property ? 22. (a) (b) D-8709 Let C = {001, 101, 110}. Determine whether C will detect the error patterns of 011, 001, 000. For each of the following code C determine whether or not C detects u : C = {00000, 10101, 00111, 11100} (i) u = 10101 (ii) u = 01010 (iii) u = 11011 14 23. (a) Find a parity check matrix from each of the following codes : (i) C = {000, 001, 010, 011} (ii) C = {00000, 11110, 01111, 10001} (b) Prove that equivalent linear codes always have the same length, dimension and distance. 24. What is the importance of image registration in image processing ? Explain any one method of image registration. 25. Explain a method of image compression which are lossless compression. OR ELECTIVE III 21. A necessary and sufficient condition for a vector X in a convex set S to be an extreme point is that X is a feasible solution satisfying the system AX = b, X 0. In other words, a point is a basic feasible solution to AX = b if and only if it is an extreme point of the convex set of the feasible solution. 22. Discuss the economic interpretation of Lagrangian multipliers, the dulity theory and state and prove Kuhn-Tucker necessary and sufficients condition for a non-linear programming problem : Max Z = f(x) subject to the constraint gi(x) bi i = 1 m 23. Solve the following convex programming problem : 2 2 Max Z = 4x1 + 6x2 2x1 2x1x2 2x2 Subject to x1 + 2x2 10 x1 + x 2 9 x1, x2 0 24. Use dual simplex method to solve the following Linear Programming problem. Minimize Z = 3x1 + x2 Subject to the constraints x1 + x 2 1 2x1 + 3x2 2 x1, x2 0 D-8709 15 P.T.O. 25. Apply Moore s and Dijkstra s algorithms to find the shortest path from A to H in the following network : OR ELECTIVE IV 21. Following medical documentation exists concerning the relations of symptoms S1, S2 and S3 to diseases d1 and d2 : (i) Symptoms S1 occurs very seldom in patients with disease d1. (ii) Symptoms S1 often occurs in patients with disease d2 but seldom confirms the presence of disease d2. (iii) Symptom S2 always occurs with disease d1 and always confirms the presence of disease d1; S2 never occurs with disease d2 and (obviously) its presence never confirms disease d2. (iv) Symptom S3 very often occurs with disease d2 and often confirms the presence of d2. (v) Symptom S3 seldom occurs in patients with disease d1. (a) Model the above stated fuzzy information. You may construct relations. Ro, Rc for symptoms and diseases ( o for occurs and c for confirmed respectively) and Rs to represent degree of presence of symptoms in patients. (b) What could be the information provided by the following ? (a) Rs O Ro (b) Rs O Rc (c) Rs O (1 Ro) (c) (d) D-8709 How would you construct a nonsymptom indication relation in this case ? For your constructed Ro, Rc and Rs, compute the values of Rs O Ro, Rs O Rc, and Rs O (1 Ro) 16 22. Think of the parameters that cause noise in the interpersonal communication. Explain how fuzzy set theory could be employed to enhance the speech signals (speech signals could be sentences and parts of sentence) to facilitate a quality conversation. Remember, the psychological states of the senders and the receivers as well add noise to the interpersonal communication. How would you extend your ideas to the manmachine interaction ? Discuss at least one specific application of your proposal. 23. (a) (b) How would you compare the abilities of ANNs with that of Von Nauman machine ? Hence or otherwise discuss the models of ANN classifiers for (i) Linearly separable data (ii) Multilinearly separable data (iii) Non-linearly separable data Following are 2 arguments. Accept or refute them by providing proofs or counter examples to support your stand. (i) ANNs are black boxes. (ii) If an architecture cannot represent knowledge it cannot learn it either. 24. Describe an ANN solution to the handwritten character recognition problem. Provide mathematical analysis of the learning algorithm that you propose. Comment on the performance of your model in comparison with the conventional algorithms (if employed any) along with its cost analysis in this context. 25. Discuss with a suitable case study of your choice, how fuzzy logic enhances the capability of an ANN solution and conversely show that ANN could help in defining more appropriate fuzzy values in the fuzzy control system. OR 21. (a) (b) 22. What is the context of a process ? What are different situations under which Kernel needs to save the context of a process ? 12 23. Write Unix shell script to : (a) opening a device file. (b) putting a process to sleep. (c) waking up sleeping process. 24. (a) (b) 25. D-8709 ELECTIVE V Compare parent and child process of Unix operating system. Compare Unix system calls and library functions. 6 6 What is multithreading ? Explain how thread synchronization can be achieved using events. Distinguish between model and modeless. Explain the differences between : (i) Static link library and dynamic link library. (ii) MFC extension DLL, MFC regular DLL and Non-MFC DLL. 17 P.T.O. SECTION-IV 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. (1 40 = 40 Marks) 26. (a) Consider the following grammar : S asb|s s|sy|z Determine which of the following strings are ambiguous (i.e. have more than one parse tree) axbxz, azxzbyxz, zxzy, azbxazb 15 (b) Write a parallel program for matrix multiplication. (c) Explain with an example how dynamic polymorphism is implemented in C++. 10 15 OR (a) Define Decision-making process. Explain Herbert-Simon model of DSS. What are the differents aspects of information quality in terms of the perceptions of the decision maker ? 20 (b) For the search tree use BFS and list the elements of the queue just before selecting and expanding each next state until a goal node is reached. Goal states designated with . 10 (c) Discuss the approaches of conflict resolution. 10 OR Write a function in C/C++ to delete the root node of a Binary Search Tree. 15 Determine the running time of linear search in average and worst case. 10 (3) D-8709 (1) (2) 26. Design and analyse a divide-and-conquer algorithm for finding the maximum element in a list of n elements. 15 29 P.T.O.

Formatting page ...

Top Contributors
to this ResPaper
(answers/comments)

angel
(1)

Sangeeta
(1)

Formatting page ...

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