32
1. ¯ÖÆü»Öê ¯ÖéÂü êú ú¯Ö¸ü ×-ÖµÖÖ Ã£ÖÖ-Ö ¯Ö¸ü ¯Ö-ÖÖ ¸üÖê»Ö -Ö´²Ö¸ü ×»Ö×Ö 2. »ÖÖã ¯ÖÏ¿-Ö Ö£ÖÖ ×-Ö²ÖÓ¬Ö ¯ÖÏúÖ¸ü êú ¯ÖÏ¿-ÖÖë êú ¢Ö¸ü, ¯ÖϵÖêú ¯ÖÏ¿-Ö êú -ÖßÖê µÖÖ ¯ÖÏ¿-ÖÖë êú ²ÖÖ¤ü ´Öë פüµÖê Æãü ׸üÖ Ã£ÖÖ-Ö ¯Ö¸ü Æüß ×»Ö×ÖµÖê ÃÖêú ×»Ö úÖêÔ ×Ö׸üÖ úÖÖÖ úÖ ¯ÖµÖÖêÖ -ÖÆüà ú¸ü-ÖÖ Æîü 3. ¯Ö¸üßÖÖ ¯ÖÏÖ¸ü´³Ö ÆüÖê-Öê ¯Ö¸ü, ¯ÖÏ¿-Ö-¯ÖãÛÃÖúÖ Ö¯ÖúÖê ¤êü ¤üß ÖÖµÖêÖß ¯ÖÆü»Öê ¯ÖÖÑÖ ×´Ö-Öü Ö¯ÖúÖê ¯ÖÏ¿-Ö-¯ÖãÛÃÖúÖ ÖÖê»Ö-Öê Ö£ÖÖ ÃÖúß ×-Ö´-Ö×»Ö×ÖÖ ÖÖÑÖ êú ×»Ö ×¤üµÖê ÖÖµÖëÖê, ×ÖÃÖúß ÖÖÑÖ Ö¯ÖúÖê ¾Ö¿µÖ ú¸ü-Öß Æîü : (i) ¯ÖÏ¿-Ö-¯ÖãÛÃÖúÖ ÖÖê»Ö-Öê êú ×»Ö ÃÖêú ú¾Ö¸ü ¯ÖêÖ ¯Ö¸ü »ÖÖß úÖÖÖ úß ÃÖᯙ úÖê ±úÖÍü »Öë Öã»Öß ÆãüÔ µÖÖ ×²Ö-ÖÖ Ãüßú¸ü -ÃÖᯙ úß ¯ÖãÛÃÖúÖ Ã¾ÖßúÖ¸ü -Ö ú¸ëü (ii) ú¾Ö¸ü ¯ÖéÂü ¯Ö¸ü û¯Öê ×-Ö¤ìü¿ÖÖ-ÖãÃÖÖ¸ü ¯ÖÏ¿-Ö-¯ÖãÛÃÖúÖ êú ¯ÖéÂü Ö£ÖÖ ¯ÖÏ¿-ÖÖë úß ÃÖÓµÖÖ úÖê ûß Ö¸üÆü Öîú ú¸ü »Öë ×ú µÖê ¯Öæ¸êü Æïü ¤üÖêÂÖ¯ÖæÖÔ ¯ÖãÛÃÖúÖ ×Ö-Ö´Öë ¯ÖéÂü/¯ÖÏ¿-Ö ú´Ö ÆüÖë µÖÖ ¤ãü²ÖÖ¸üÖ Ö ÖµÖê ÆüÖë µÖÖ ÃÖß׸üµÖ»Ö ´Öë -Ö ÆüÖë £ÖÖÔÖ ×úÃÖß ³Öß ¯ÖÏúÖ¸ü úß ¡Öã×ü¯ÖæÖÔ ¯ÖãÛÃÖúÖ Ã¾ÖßúÖ¸ü -Ö ú¸ëü Ö£ÖÖ ÃÖß ÃÖ´ÖµÖ ÃÖê »ÖÖîüÖú¸ü ÃÖêú ãÖÖ-Ö ¯Ö¸ü ¤æüÃÖ¸üß ÃÖÆüß ¯ÖÏ¿-Ö-¯ÖãÛÃÖúÖ »Öê »Öë ÃÖêú ×»Ö Ö¯ÖúÖê ¯ÖÖÑÖ ×´Ö-Öü פüµÖê ÖÖµÖëÖê ÃÖêú ²ÖÖ¤ü -Ö ÖÖê Ö¯Öúß ¯ÖÏ¿-Ö-¯ÖãÛÃÖúÖ ¾ÖÖ¯ÖÃÖ »Öß ÖÖµÖêÖß Öî¸ü Æüß Ö¯ÖúÖê ×Ö׸üÖ ÃÖ´ÖµÖ ×¤üµÖÖ ÖÖµÖêÖÖ 4. -¤ü¸ü פüµÖê ÖµÖê ×-Ö¤ìü¿ÖÖë úÖê ¬µÖÖ-Ö¯Öæ¾ÖÔú ¯ÖÍëü 5. ¢Ö¸ü-¯ÖãÛÃÖúÖ úêú -Ö ´Öë úÖÖ úÖ´Ö (Rough Work) ú¸ü-Öê êú ×»Ö ´Ö滵ÖÖÓú-Ö ¿Ößü ÃÖê ¯ÖÆü»Öê ú ¯ÖéÂü פüµÖÖ ÆãüÖ Æîü 6. µÖפü Ö¯Ö ¢Ö¸ü-¯ÖãÛÃÖúÖ ¯Ö¸ü ¯Ö-ÖÖ -ÖÖ´Ö µÖÖ êÃÖÖ úÖêÔ ³Öß ×-Ö¿ÖÖ-Ö ×ÖÃÖÃÖê Ö¯Öúß ¯ÖÆüÖÖ-Ö ÆüÖê ÃÖêú, ×úÃÖß ³Öß ³ÖÖÖ ¯Ö¸ü ¤ü¿ÖÖÔÖê µÖÖ Ó×úÖ ú¸üÖê Æïü ÖÖê ¯Ö¸üßÖÖ êú ×»ÖµÖê µÖÖêµÖ ÖÖê×ÂÖÖ ú¸ü פüµÖê ÖÖµÖëÖê 7. Ö¯ÖúÖê ¯Ö¸üßÖÖ ÃÖ´ÖÖ¯Ö ÆüÖê-Öê ¯Ö¸ü ¢Ö¸ü -¯ÖãÛÃÖúÖ ×-Ö¸üßÖú ´ÖÆüÖê¤üµÖ úÖê »ÖÖîüÖ-ÖÖ Ö¾Ö¿µÖú Æîü Öî¸ü ÃÖê ¯Ö¸üßÖÖ ÃÖ´ÖÖÛ¯Ö êú ²ÖÖ¤ü ¯Ö-Öê ÃÖÖ£Ö ¯Ö¸üßÖÖ ³Ö¾Ö-Ö ÃÖê ²ÖÖÆü¸ü -Ö »Öêú¸ü ÖÖµÖë 8. êú¾Ö»Ö -Öß»Öê/úÖ»Öê ²ÖÖ»Ö ¯¾ÖÖÕü ¯Öê-Ö úÖ Æüß ÃÖê´ÖÖ»Ö ú¸ëü 9. ×úÃÖß ³Öß ¯ÖÏúÖ¸ü úÖ ÃÖÓÖÖú (îú»Öãú»Öêü¸ü) µÖÖ »ÖÖÖ êü²Ö»Ö Öפü úÖ ¯ÖϵÖÖêÖ ¾ÖÙÖÖ Æîü 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-87-10 P.T.O. Signature and Name of Invigilator Roll No. (In words) 1. (Signature) __________________________ (Name) ____________________________ 2. (Signature) __________________________ (Name) ____________________________ Roll No.________________________________ D PAPER-III [Maximum Marks : 200 Time : 2 1 / 2 hours] Number of Pages in this Booklet : 32 Number of Questions in this Booklet : 19 Instructions for the Candidates ¯Ö¸üßÖÖÙ£ÖµÖÖë êú ×»Ö ×-Ö¤ìü¿Ö (In figures as per admission card) COMPUTER SCIENCE AND APPLICATIONS 87 1 0 www.solutionsadda.in

PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

  • Upload
    others

  • View
    2

  • Download
    0

Embed Size (px)

Citation preview

Page 1: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

1. ¯ÖÆü»Öê ¯ÖéÂ�ü �êú �ú¯Ö¸ü ×­ÖµÖ�Ö Ã£ÖÖ­Ö ¯Ö¸ü �¯Ö­ÖÖ ¸üÖê»Ö ­Ö´²Ö¸ü ×»Ö×�Ö� �

2. »Ö�Öã ¯ÖÏ¿­Ö �Ö£ÖÖ ×­Ö²ÖÓ¬Ö ¯ÖÏ�úÖ¸ü �êú ¯ÖÏ¿­ÖÖë �êú �¢Ö¸ü, ¯ÖÏ�µÖê�ú ¯ÖÏ¿­Ö �êú ­Öß�Öê µÖÖ¯ÖÏ¿­ÖÖë �êú ²ÖÖ¤ü ´Öë פüµÖê Æãü� ׸ü��Ö Ã£ÖÖ­Ö ¯Ö¸ü Æüß ×»Ö×�ÖµÖê �

�ÃÖ�êú ×»Ö� �úÖê�Ô �×�Ö׸ü��Ö �úÖ�Ö�Ö �úÖ �¯ÖµÖÖê�Ö ­ÖÆüà �ú¸ü­ÖÖ Æîü �

3. ¯Ö¸üß�ÖÖ ¯ÖÏÖ¸ü´³Ö ÆüÖê­Öê ¯Ö¸ü, ¯ÖÏ¿­Ö-¯ÖãÛÃ�Ö�úÖ �Ö¯Ö�úÖê ¤êü ¤üß �ÖÖµÖê�Öß � ¯ÖÆü»Öê ¯ÖÖÑ�Ö×´Ö­Ö�ü �Ö¯Ö�úÖê ¯ÖÏ¿­Ö-¯ÖãÛÃ�Ö�úÖ �ÖÖê»Ö­Öê �Ö£ÖÖ �ÃÖ�úß ×­Ö´­Ö×»Ö×�Ö�Ö �ÖÖÑ�Ö �êú×»Ö� פüµÖê �ÖÖµÖë�Öê, ×�ÖÃÖ�úß �ÖÖÑ�Ö �Ö¯Ö�úÖê �¾Ö¿µÖ �ú¸ü­Öß Æîü :

(i) ¯ÖÏ¿­Ö-¯ÖãÛÃ�Ö�úÖ �ÖÖê»Ö­Öê �êú ×»Ö� �ÃÖ�êú �ú¾Ö¸ü ¯Öê�Ö ¯Ö¸ü »Ö�Öß �úÖ�Ö�Ö �úßÃÖᯙ �úÖê ±úÖ�Íü »Öë � �Öã»Öß Æãü�Ô µÖÖ ×²Ö­ÖÖ Ã�üß�ú¸ü-ÃÖᯙ �úß ¯ÖãÛÃ�Ö�úÖþÖß�úÖ¸ü ­Ö �ú¸ëü �

(ii) �ú¾Ö¸ü ¯ÖéÂ�ü ¯Ö¸ü �û¯Öê ×­Ö¤ìü¿ÖÖ­ÖãÃÖÖ¸ü ¯ÖÏ¿­Ö-¯ÖãÛÃ�Ö�úÖ �êú ¯ÖéÂ�ü �Ö£ÖÖ ¯ÖÏ¿­ÖÖë�úß ÃÖÓ�µÖÖ �úÖê ���ûß �Ö¸üÆü �Öî�ú �ú¸ü »Öë ×�ú µÖê ¯Öæ¸êü Æïü � ¤üÖêÂÖ¯Öæ�ÖÔ¯ÖãÛÃ�Ö�úÖ ×�Ö­Ö´Öë ¯ÖéÂ�ü/¯ÖÏ¿­Ö �ú´Ö ÆüÖë µÖÖ ¤ãü²ÖÖ¸üÖ �Ö �ÖµÖê ÆüÖë µÖÖ ÃÖß׸üµÖ»Ö´Öë ­Ö ÆüÖë �£ÖÖÔ�Ö ×�úÃÖß ³Öß ¯ÖÏ�úÖ¸ü �úß ¡Öã×�ü¯Öæ�ÖÔ ¯ÖãÛÃ�Ö�úÖ Ã¾Öß�úÖ¸ü ­Ö�ú¸ëü �Ö£ÖÖ �ÃÖß ÃÖ´ÖµÖ �ÃÖê »ÖÖî�üÖ�ú¸ü �ÃÖ�êú ãÖÖ­Ö ¯Ö¸ü ¤æüÃÖ¸üß ÃÖÆü߯ÖÏ¿­Ö-¯ÖãÛÃ�Ö�úÖ »Öê »Öë � �ÃÖ�êú ×»Ö� �Ö¯Ö�úÖê ¯ÖÖÑ�Ö ×´Ö­Ö�ü פüµÖê �ÖÖµÖë�Öê ��ÃÖ�êú ²ÖÖ¤ü ­Ö �ÖÖê �Ö¯Ö�úß ¯ÖÏ¿­Ö-¯ÖãÛÃ�Ö�úÖ ¾ÖÖ¯ÖÃÖ »Öß �ÖÖµÖê�Öß �Öî¸ü ­ÖÆüß �Ö¯Ö�úÖê �×�Ö׸ü��Ö ÃÖ´ÖµÖ ×¤üµÖÖ �ÖÖµÖê�ÖÖ �

4. �­¤ü¸ü פüµÖê �ÖµÖê ×­Ö¤ìü¿ÖÖë �úÖê ¬µÖÖ­Ö¯Öæ¾ÖÔ�ú ¯Ö�Íëü �

5. �¢Ö¸ü-¯ÖãÛÃ�Ö�úÖ �úêú �­�Ö ´Öë �ú��ÖÖ �úÖ´Ö (Rough Work) �ú¸ü­Öê �êú ×»Ö�´Ö滵ÖÖÓ�ú­Ö ¿Öß�ü ÃÖê ¯ÖÆü»Öê ��ú ¯ÖéÂ�ü פüµÖÖ Æãü�Ö Æîü �

6. µÖפü �Ö¯Ö �¢Ö¸ü-¯ÖãÛÃ�Ö�úÖ ¯Ö¸ü �¯Ö­ÖÖ ­ÖÖ´Ö µÖÖ �êÃÖÖ �úÖê�Ô ³Öß ×­Ö¿ÖÖ­Ö ×�ÖÃÖÃÖê�Ö¯Ö�úß ¯ÖÆü�ÖÖ­Ö ÆüÖê ÃÖ�êú, ×�úÃÖß ³Öß ³ÖÖ�Ö ¯Ö¸ü ¤ü¿ÖÖÔ�Öê µÖÖ �Ó×�ú�Ö �ú¸ü�Öê Æïü �ÖÖê¯Ö¸üß�ÖÖ �êú ×»ÖµÖê �µÖÖê�µÖ �ÖÖê×ÂÖ�Ö �ú¸ü פüµÖê �ÖÖµÖë�Öê �

7. �Ö¯Ö�úÖê ̄ Ö¸üß�ÖÖ ÃÖ´ÖÖ¯�Ö ÆüÖê­Öê ̄ Ö¸ü �¢Ö¸ü-¯ÖãÛÃ�Ö�úÖ ×­Ö¸üß�Ö�ú ́ ÖÆüÖê¤üµÖ �úÖê »ÖÖî�üÖ­ÖÖ�Ö¾Ö¿µÖ�ú Æîü �Öî¸ü �ÃÖê ¯Ö¸üß�ÖÖ ÃÖ´ÖÖÛ¯�Ö �êú ²ÖÖ¤ü �¯Ö­Öê ÃÖÖ£Ö ¯Ö¸üß�ÖÖ ³Ö¾Ö­Ö ÃÖê²ÖÖÆü¸ü ­Ö »Öê�ú¸ü �ÖÖµÖë �

8. �êú¾Ö»Ö ­Öß»Öê/�úÖ»Öê ²ÖÖ»Ö ¯¾ÖÖ�Õ�ü ¯Öê­Ö �úÖ Æüß �Ã�Öê´ÖÖ»Ö �ú¸ëü �

9. ×�úÃÖß ³Öß ¯ÖÏ�úÖ¸ü �úÖ ÃÖÓ�Ö�Ö�ú (�îú»Ö�ãú»Öê�ü¸ü) µÖÖ »ÖÖ�Ö �êü²Ö»Ö �Öפü �úÖ¯ÖϵÖÖê�Ö ¾ÖÙ�Ö�Ö Æîü �

1. Write your roll number in the space provided on the topof this page.

2. Answer to short answer/essay type questions are to begiven in the space provided below each question orafter the questions in the Test Booklet itself.

No Additional Sheets are to be used.

3. At the commencement of examination, the questionbooklet will be given to you. In the first 5 minutes, youare requested to open the booklet and compulsorilyexamine it as below :

(i) To have access to the Question Booklet, tear off thepaper seal on the edge of this cover page. Do notaccept a booklet without sticker-seal and do notaccept an open booklet.

(ii) Tally the number of pages and number of questionsin the booklet with the information printed on thecover page. Faulty booklets due to pages/questionsmissing or duplicate or not in serial order or anyother discrepancy should be got replacedimmediately by a correct booklet from theinvigilator within the period of 5 minutes.Afterwards, neither the Question Booklet will bereplaced 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 thebooklet before the Evaluation Sheet.

6. If you write your name or put any mark on any part ofthe Answer Sheet, except for the space allotted for therelevant entries, which may disclose your identity, youwill render yourself liable to disqualification.

7. You have to return the test booklet to the invigilators atthe end of the examination compulsorily and must notcarry 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-87-10 P.T.O.

Signature and Name of Invigilator

Roll No.

(In words)

1. (Signature) __________________________

(Name) ____________________________

2. (Signature) __________________________

(Name) ____________________________

Roll No.________________________________

D

PAPER-III

[Maximum Marks : 200Time : 2 1/2 hours]

Number of Pages in this Booklet : 32 Number of Questions in this Booklet : 19

Instructions for the Candidates ¯Ö¸üß�ÖÖÙ£ÖµÖÖë �êú ×»Ö� ×­Ö¤ìü¿Ö

(In figures as per admission card)

COMPUTER SCIENCE AND APPLICATIONS

8 7 1 0

www.solutionsadda.in

Page 2: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

D-87-10 2

COMPUTER SCIENCE AND 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.

www.solutionsadda.in

Page 3: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

D-87-10 3 P.T.O.

SECTION – I

Note : This section consists of two essay type questions of twenty (20) marks each, to be

answered in about five hundred (500) words each. (2 ×× 20 = 40 marks)

1. (a) Given the inorder and preorder sequences of a binary tree, design an algorithm

to generate inorder sequence of binary tree. Illustrate with an example.

(b) Illustrate a general formula to calculate size of a queue which works on the

basis of modulo function. Show different cases with example. (10+10)

OR

(a) Write a backtracking algorithm for the N-Queen’s problem.

(b) Show that the vertex cover problem is NP-complete. (10+10)

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

www.solutionsadda.in

Page 4: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

D-87-10 4

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

www.solutionsadda.in

Page 5: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

D-87-10 5 P.T.O.

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

www.solutionsadda.in

Page 6: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

D-87-10 6

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

www.solutionsadda.in

Page 7: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

D-87-10 7 P.T.O.

2. (a) Shannon and Nyquist formulas of channel capacity places upper limit on the

bit rate of a channel. Are they related and how ? What are key factors that

affect channel capacity ?

(b) Explain SSL objective & layer. Give block diagram of SSL protocol stack.

Discuss SSL Record and SSL Alert protocols. (10+10)

OR

(a) Given the relation R (ABCDEF) with the set H = {A → CE, B → D, C → ADE,

BD → F}. Find the closure of BCD.

(b) Given R(A, B, C, D, E, F) and the set of function dependency on R given by

F = {ABC → DE, AB → D, DE → ABC, E → C}. In what normal form is R ?

If it is not in 3 NF, decompose R and find a set 3 NF projection of R. Is this set

lossless and dependency preserving ? (10+10)

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

www.solutionsadda.in

Page 8: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

D-87-10 8

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

www.solutionsadda.in

Page 9: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

D-87-10 9 P.T.O.

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

www.solutionsadda.in

Page 10: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

D-87-10 10

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

www.solutionsadda.in

Page 11: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

D-87-10 11 P.T.O.

SECTION – II

Note : This section contains three (3) questions from each of the electives/specializations.

The candidate has to choose only one elective/specialization and answer all the

three questions contained therein. Each question carries fifteen (15) marks and is to

be answered in about three hundred (300) words. (3 ×× 15 = 45 Marks)

Elective – I

3. Construct a Turing machine that computes the function

f(x, y) = 1, if x < y

0, otherwise 15

4. Show that the intersection of a content free language L and a regular language R is a

content free language. 15

5. Find a Greibach normal form grammar equivalent to the following content free

grammar :

S → AA | 0, A → SS|1 15

Elective – II

3. State and prove channel capacity theorem. 15

4. Describe MPEG1 and MPEG2 standards of compression. 15

5. Explain following properties of 2D-Fourier transformation in image processing :

(a) Translation (b) Rotation (c) Linearity 15

Elective – III

3. (a) What is convex function ? Prove that X’HX is a convex function, where H is

n × n, +ve definite matrix and X is 1 × n vector. 6

(b) Use Wolfe’s method in solving the following quadratic programming

problem :

Maximize Z = 4x1 + 6x2 – 2x

2

1 – 2x1x2 – 2x

2

2

Subject to the constraints : x1 + x2 < 2, x1, x2 > 0 9

4. Use dual simplex method to solve the following L.P.P.

Minimize Z = 10x1 + 6x2 + 2x3,

Subject to the constraints : – x1 + x2 + x3 > 1, 3x1 + x2 – x3 > 2, 15

x1, x2, x3 > 0

5. Use Dijkstra’s Algorithm, to find the length of shortest path between the vertices a

and z for the following network : 15

www.solutionsadda.in

Page 12: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

D-87-10 12

Elective – IV

3. Discuss how do you design multilayer perceptron net. Justify with an example. 15

4. Describe back propagation algorithm in Neural network. Mention one application

where back propagation effectively works. 15

5. Bring out the significance of fuzzy theory. Consider fuzzy sets A, B and C defined in

the interval X = [0, 10] of real numbers

A(x) = x

x + 2 , B(x) = 2–x

C(x) = 1

1 + 10 (x – 2)2

Calculate the α-cuts and strong α-cuts of these fuzzy sets for the values α = 0.2, 0.5

and 0.8. 15

Elective – V

3. Describe different two methods used in UNIX to change the access permission. 15

4. In UNIX operating system how exec system call works ? Brief in detail logical format

of an executable file in UNIX. 15

5. Describe structure of WINDOWS-2000 operating system with a sketch. Mention

differences between WINDOWS-XP and WINDOWS-7. 15

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

www.solutionsadda.in

Page 13: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

D-87-10 13 P.T.O.

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

www.solutionsadda.in

Page 14: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

D-87-10 14

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

www.solutionsadda.in

Page 15: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

D-87-10 15 P.T.O.

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

www.solutionsadda.in

Page 16: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

D-87-10 16

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

www.solutionsadda.in

Page 17: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

D-87-10 17 P.T.O.

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

www.solutionsadda.in

Page 18: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

D-87-10 18

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

www.solutionsadda.in

Page 19: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

D-87-10 19 P.T.O.

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

www.solutionsadda.in

Page 20: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

D-87-10 20

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

SECTION – III

Note : This section contains nine (9) questions of ten (10) marks, each to be answered in

about fifty (50) words. (9 ×× 10 = 90 Marks)

6. Draw the circuit diagram and explain the functioning of JK flip-flop. 10

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

www.solutionsadda.in

Page 21: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

D-87-10 21 P.T.O.

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

7. Consider the following graph based locking protocol, which allow only exclusive lock

modes and which operate on datagraph that are in the form of a rooted directed

acyclic graph.

– A transaction can lock any vertex point.

– To lock any other vertex, the transaction must have visited all the parents of

that vertex and must be having a lock on one of the parents of the vertex.

Show that the protocol ensures serializability and deadlock freedom. 10

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

www.solutionsadda.in

Page 22: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

D-87-10 22

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

8. Explain Bezier technique for generating curves. 10

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

9. Write an algorithm to delete a node from binary search tree. 10

_______________________________________________________________________________________________

www.solutionsadda.in

Page 23: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

D-87-10 23 P.T.O.

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

10. What is the purpose of multiplexing ? What are the three major multiplexing

techniques ? 10

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

www.solutionsadda.in

Page 24: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

D-87-10 24

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

11. Explain ‘Demand paged memory management’ in memory management system of

operating system. What are its advantages ? 10

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

www.solutionsadda.in

Page 25: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

D-87-10 25 P.T.O.

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

12. Explain how to overload [ ] and ( ) operators. 10

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

13. What are the attributes of good software ? In what ways software quality is connected

with formal technical review ? 10

_______________________________________________________________________________________________

_______________________________________________________________________________________________

www.solutionsadda.in

Page 26: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

D-87-10 26

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

14. Explain with diagram different components of an expert system. 10

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

www.solutionsadda.in

Page 27: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

D-87-10 27 P.T.O.

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

SECTION – IV

Note : This section contains five (5) questions of five (5) marks each based on the following

passage. Each question should be answered in about thirty (30) words.

(5 ×× 5 = 25 Marks)

Consider the following relations concerning a driving school. The primary key of

each relation is in bold face / underlined :

STUDENT : (St.Name, Class#, Th_Mark, Dr_Mark)

STUDENT_DRIVING_TEACHER : (St_Name, Dr_T_Name)

TEACHER_THEORY_CLASS : (Class#, Th_T_Name)

TEACHER_VEHICLE : (Dr_T_Name, License#)

VEHICLE : (License#, Make, Model, Year)

A student takes one theory class as well as driving lessons and at the end of the

session receives marks for theory and driving. A Teacher may teach theory, driving,

or both. Write the following queries in relational algebra.

15. Find the list of teachers, who teach theory and give driving lessons on all the

vehicles. 5

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

www.solutionsadda.in

Page 28: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

D-87-10 28

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

16. Find the pairs of students satisfying the following conditions :

They have different theory teachers and

They have the same theory marks

They have the same driving marks and

They have different driving teacher 5

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

www.solutionsadda.in

Page 29: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

D-87-10 29 P.T.O.

17. Find the list of students who are taught neither theory lessons nor driving lessons by

“Johnson” (teacher). 5

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

18. Find the list of students who have better marks than “John” in both theory and

driving. 5

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

www.solutionsadda.in

Page 30: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

D-87-10 30

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

19. Find the list of students who have more marks than the average theory marks of class

8 (class #). 5

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

_______________________________________________________________________________________________

____________

www.solutionsadda.in

Page 31: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

D-87-10 31 P.T.O.

Space For Rough Work

www.solutionsadda.in

Page 32: PAPER-III COMPUTER SCIENCE AND APPLICATIONS · 5. Find a Greibach normal form grammar equivalent to the following content free grammar : S → AA | 0, A → SS|1 15 Elective – II

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

Question

Number

Marks Obtained

FOR OFFICE USE ONLY

Total Marks Obtained (in words) ...........................................

(in figures) ..........................................

Signature & Name of the Coordinator ...................................

(Evaluation) Date .........................

D-87-10 32

Marks

Obtained

www.solutionsadda.in