(6 pages) u/id 46431/ucca · 1. convert the following decimal number to binary (a) 673.23 (b) 1998....

$: (6 pages) U/ID 46431/UCCA · 1. Convert the following decimal number to binary (a) 673.23 (b) 1998. RÌUPsh u\© GsPøÍ C¸© GsPÍõP ©õØÖ. (A) 673.23 (B) 1998. 2. Find 10’s$
DECEMBER 2017 U/ID 46431/UCCA

Time : Three hours Maximum : 100 marks

PART A — (10 3 = 30 marks)

Answer any TEN questions.

1. Find the inverse of the function RRf : defined by 54)( xxf for Rx .

54)( xxf & Rx GßÖ Áøμ¯ÖUP¨£mh

RRf : GßÓ \õº¤ß ÷|º©õÖ PõsP

2. Define power set. Find the power set of },,{ cba .

AkUS uÍzøu Áøμ¯Ö. },,{ cba &ß AkUS

uÍzøuU PõsP.

3. Prove that compositions of two translations on 2R is also a translation.

2R &À Cμsk ö©õÈ ö£¯º¦PÎß CnUP®

J¸ö©õÈ ö£¯º¦ GÚ Põs¤.

4. Find the equation of the sphere which has the line joining the points )5,7,2( and )1,5,8( as diameter.

)5,7,2( ©ØÖ® )1,5,8( GßÓ ¦ÒÎPøÍ CønUS®

÷PõmiøÚ Âmh©õPU öPõsh ÷PõÍzvß

\©ß£õmiøÚU PõsP.

(6 pages)

U/ID 46431/UCCA 2

5. Find the eccentricity of the ellipse

044460727 22 yxyxyx .

044460727 22 yxyxyx GßÓ

}ÒÁmhzvß ø©¯U ÷PõmhzvøÚU PõsP.

6. Write the equation of the plane through )2,1,1( and parallel to 0432 zyx .

)2,1,1( GßÓ ¦ÒÎ°ß ÁÈa ö\À¾® \©uÍzvß

\©ß£õmiøÚ 0432 zyx &ß Cøn¯õPU

PõsP.

7. Find the equation of the tangent to the curve

1

62

xxy at the point )4,2( .

1

62

xxy GßÓ ÁøÍÁøμ°ß öuõk÷Põmiß

\©ß£õmiøÚ )4,2( GßÓ ¦ÒÎ°À PõsP.

8. Find the length of the complete arch of the cycloid )sin( ax , )cos1( ay .

)sin( ax , )cos1( ay GßÓ

E¸ÒÁøÍ°ß }Ízvß \©ß£õmiøÚU PõsP.

9. Find dxxI 4cosec .

dxxI 4cosec &IU PõsP.

U/ID 46431/UCCA 3

10. Write the P.I of )sin()( 2 yxZDDD .

)sin()( 2 yxZDDD &ß ]Ó¨¦ öuõøPU

öPÊÂøÚ GÊxP.

11. Find )(sin4 xdxdn .

)(sin4 xdxdn &ø¯U PõsP.

12. Find the Fourier sine transform of xe 3 .

§›¯›ß sine E¸©õØÓzvøÚ xe 3

&øÚU PõsP.

PART B — (5 × 6 = 30 marks)

Answer any FIVE questions.

13. Show that the lattices pictured in below are non distributive.

÷©÷» öPõkUP¨£mkÒÍ £hzvß £S¨£õ´ÁØÓx

GÚ {ÖÄP.

U/ID 46431/UCCA 4

14. Find the inverse of the matrix

342476

268

.

342476

268

GßÓ Ao°ß ÷|º©õÖ Ao

PõsP.

15. Solve by Cramer’s rule :

.354172;24103;32428

zyxzyxzyx

Qμõ©›ß Âvø¯ E£÷¯õQzx wºUP :

.354172;24103;32428

zyxzyxzyx

16. Find the equation of the plane passing through )1,2,2( and )6,3,9( and perpendicular to the

plane 9662 zyx .

\©uÍzvß \©ß£õmiøÚ )1,2,2( ©ØÖ® )6,3,9(

GßÓ ¦ÒÎ°ß ÁÈa ö\À¾® ö\[SzuõÚ uÍzvß

9662 zyx &À \©ß£õmiøÚU PõsP.

[P.T.O.]

U/ID 46431/UCCA 5

17. A stone thrown vertically upwards rises ‘S’ feet in ‘t’ seconds, where 21680 ttS . What is its velocity after 2 seconds? Find the acceleration.

÷©÷» ÷|õUQ GÔ¯¨£mh J¸ PÀ ‘S’ AiPÒ ‘t’ Â|õiPÎÀ E¯º¢xÒÍx, C[S

21680 ttS

BS®. 2 Â|õiPÐUS ¤ÓS Auß vø\÷ÁP®

GÆÁÍÄ? •kUPzøuU Psk¤i.

18. Find dds

and drds

for the cardioid )cos1( ar .

)cos1( ar &ÂØS dds

, ©ØÖ® drds

&IU PõsP.

19. Solve yxZDDDD 222 )6( .

yxZDDDD 222 )6( I wºUP.

PART C — (4 × 10 = 40 marks)

Answer any FOUR questions.

20. Let BAf : and CBg : be both one-to-one

and onto functions. Show that 111)( gffg .

BAf : ©ØÖ® CBg : GßÓ Cμsk®

Jß&k&Jß ©ØÖ® Bßk \õº¦ GßP. 111)( gffg GÚ {ÖÄP.

21. Express )(].).([),,( xzzyxzyxf in canonical form.

)(].).([),,( xzzyxzyxf Gß£øu Auß {¯©Ú

ÁiÂÀ öÁÎ°k.

U/ID 46431/UCCA 6

22. Find the shortest distance and the equation of the line of shortest distance in symmetrical form of the lines.

710

169

38

zyx

and 55

829

315

zyx

.

710

169

38

zyx

©ØÖ® 55

829

315

zyx

«a]Ö öuõø»Ä ©ØÖ® Auß \©ß£õk BQ¯ÁØøÓ

\©a^º ÁiÂÀ EÒÍ C¢u ÷PõkPÐUS PõsP.

23. Find the nth differential coefficient of 75 sincos .

n&BÁx ÁøPUöPÊ SnPzøu 75 sincos &ÂØS

PõsP.

24. Find the Fourier series of

).2,(in,2

),0(in,1)(

xf

§›¯›ß öuõhøμ

)2,(,2

),0(,1)(

xf &À PõsP.

25. Find the equation of the plane passing through the point )3,5,2( , )5,3,2( and )3,3,5( .

)3,5,2( , )5,3,2( ©ØÖ® )3,3,5( &ß ÁÈ¯õPa

ö\À¾® \©uÍzvß \©ß£õmiøÚU PõsP.

———————

DECEMBER 2017 U/ID 46432/UCCB


PART A — (10 × 3 = 30 marks)


1. Convert the following decimal number to binary

(a) 673.23

(b) 1998.

RÌUPsh u\© GsPøÍ C¸© GsPÍõP ©õØÖ.

(A) 673.23

(B) 1998.

2. Find 10’s complement of 52520 and 25.639.

52520 ©ØÖ® 25.639 BQ¯ÁØÔß 10ß {μ¨¦U

TøÓU Psk¤i.

3. Give the logic diagram and characteristic table for clocked RS Flip-flop.

RS ¤¼¨ &¤»õ¤ß uºUP Áøμ£h® ©ØÖ® £s¦

AmhÁøn BQ¯ÁØøÓ u¸P.

(6 pages)

U/ID 46432/UCCB 2

4. What are shift registers?

ö£¯ºa]¨ £vÁP® GßÓõÀ GßÚ?

5. Write a note on ripple counters.

›¨¤Ò PÄshºPÒ £ØÔ SÔ¨ö£Êx

6. Define the status flags.

Status flags ø¯ Áøμ¯Ö.

7. List the rules for the variable names in C.

C ö©õÈ°ß ©õÔ ö£¯ºPÐUPõÚ ÂvPøÍ

£mi¯¼kP.

8. Differentiate between ‘break’ and ‘continue’.

‘break’ ©ØÖ® ‘continue’ BQ¯ÁØøÓ

÷ÁÖ£kzvUPõmk.

9. Give the general format of a function.

J¸ ö\¯ÀTØÔß ö£õx ÁiÁzøuz u¸P.

10. Define recursive function.

_ÇÀ {ø» ö\¯ØTØøÓ Áøμ¯Ö.

U/ID 46432/UCCB 3

11. Write the necessary statements in initialize a matrix as a 33 identity matrix.

J¸ 33 •ØöÓõ¸© AoUS öuõhUP

©v¨£Î¨£uØS ÷uøÁ¯õÚ TØÖPøÍ GÊx.

12. Differentiate between structure and union.

‘structure’ ©ØÖ® ‘union’ BQ¯ÁØøÓ ÷ÁÖ£kzvU

PõmkP.

PART B — (5 × 6 = 30 marks)


13. Demonstrate by means of truth tables the validity of the following theorems of Boolean algebra.

(a) Associative law

(b) De Morgan’s theorem.

RÌUPsh §¼¯ß Gs Pou ÷uØÓ[PÎß

ö\À¾£izußø©ø¯ ö©´ AmhÁønPÎß

‰»©õP ö\¯À ÂÍUP©Î.

(A) A÷\õ]÷¯miÆ Âv

(B) i ©õºPßì ÷uØÓ®.

U/ID 46432/UCCB 4

14. Explain Half – Adder.

AøμU Tmiø¯ ÂÁ›.

15. Explain the operators in C language.

C ö©õÈ°À EÒÍ ö\¯ØSÔPøÍ ÂÍUSP

16. Explain while loop. How does it differ from do-while?

‘While loop’ ø¯ ÂÍUSP. Ax ‘do-while’ À¼¸¢x

GÆÁõÖ ©õÖ£kQÓx.

17. Explain the storage classes.

Storage Classes PøÍ ÂÍUSP.

18. Explain the ‘structure’ with an example.

‘Structure’ ø¯ Kº Euõμnz÷uõk ÂÍUSP.

19. Write a program to sort a set of numbers in ascending order.

J¸ GsPÎß öuõS¨ø£ HÖÁ›ø\°À

Á›ø\¨£kzu J¸ {μÀ GÊx.

[P.T.O.]

U/ID 46432/UCCB 5

PART C — (4 × 10 = 40 marks)


20. Simplify the following Boolean function using map method.

(a) CBCBABACAF '''

(b) zyxwF ,,, )14,13,12,9,8,6,5,4,2,1,0( .

Áøμ£h •øÓø¯¨ £¯ß£kzv RÌUPsh §¼¯ß

ö\¯ÀTÖPøÍ GÎø©¨£kzx

(A) CBCBABACAF '''

(B) zyxwF ,,,

)14,13,12,9,8,6,5,4,2,1,0( .

21. Explain Decoders.

SÔÂÍUQPøÍ ÂÍUSP.

22. Discuss the design of ALU.

ALU Âß ÁiÁø©¨ø£ ÂÁõvUP.

23. Explain the different forms of ‘if’ statement with examples.

‘if’ TØÔß öÁÆ÷ÁÖ ÁiÁ[PøÍ Euõμn[PÐhß

ÂÍUSP.

U/ID 46432/UCCB 6

24. Write a program to multiply two matrices of different orders.

öÁÆ÷ÁÖ AÍÄÒÍ C¸ AoPøÍ ö£¸USÁuØS

J¸ {μÀ GÊx.

25. Explain the file handling functions.

÷Põ¨ø£ øP¯õÐ® ö\¯ÀTÖPøÍ ÂÍUSP.

–––––––––––

DECEMBER 2017 U/ID 46433/UCCC


PART A — (10 3 = 30 marks)


1. Write a note on: Configuration Section.

Põß¤Q÷μ\ß £Svø¯ £ØÔ J¸ SÔ¨¦ GÊxP.

2. Give the general syntax of simple MOVE statement with an example.

GÎ¯ ‰ÆTØÔß ö£õxÁiÁzøu J¸

GkzxUPõmkhß u¸P.

3. Write a note on: Figurative Constants in COBOL.

÷Põ£õ¼À EÒÍ ©øÓö£õ¸ÐÒÍ ©õÔ¼PøÍ £ØÔ

J¸ SÔ¨¦ GÊxP.

4. Write a note on: Picture Clause 9 Character.

£h ÁõUQ¯ 9 GÊzxøÁ £ØÔ J¸ SÔ¨¦ GÊxP.

5. Write about Indexed File Organization.

_mk ÷Põ¨¦ {ÖÁÚ® £ØÔ GÊxP.

6. What are Identifiers in C++? List the rules for forming valid Identifiers.

]++ EÒÍ SÔ¨£õßPÒ GßÓõÀ GßÚ? \›¯õÚ

SÔ¨£õßPÒ Aø©¨£uØPõÚ Âv•øÓPøÍ

£mi¯¼kP.

U/ID 46433/UCCC 2

7. Write a note on : Message passing.

ö\´v AÝ¨¦uÀ £ØÔ J¸ SÔ¨¦ GÊxP.

8. What is meant by Function Overloading?

\õº¦ KÁºP»õi[ GßÓõÀ GßÚ?

9. Give the general form of a class declaration in C++.

]++À EÒÍ J¸ ÁS¨¦ ÂÍ®£μ¨£kzxÁuØPõÚ

ö£õxÁiÁ® u¸P.

10. What are Friend Functions?

|s£ß \õº¦PÒ GßÓõÀ GßÚ?

11. What are the operators that cannot be overloaded?

G¢u C¯UPºPøÍ JÁº÷»õk ö\´¯ •i¯õx?

12. List the types of Inheritance.

©μ¦ºø©°ß ÁøPPøÍ £mi¯¼kP.

PART B — (5 6 = 30 marks)


13. Write Short Notes on: Literals in COBOL.

÷Põ£õ¼À EÒÍ {ø» E¸PøÍ¨£ØÔ ]ÖSÔ¨¦

GÊxP.

U/ID 46433/UCCC 3

14. Discuss briefly on: COMPUTE statement in COBOL with examples.

÷Põ£õ¼À EÒÍ COMPUTE TØøÓ

GkzxUPõmkPÐhß _¸UP©õP ÂÁõvUP.

15. Write about Basic Data Types in C++ with examples.

]++À EÒÍ Ai¨£øh uμÄ ÁøPPøÍ

GkzxUPõmkPÐhß GÊxP.

16. Write a C++ program to illustrate the use of endl and setw manipulators.

endl ©ØÖ® setw øP¯õÐ£ÁºPÎß £¯øÚ

ÂÍUS® ]++ ö©õÈ°ß ö\¯Àvmh® JßøÓ

GÊxP.

17. Discuss briefly about the special characteristics of member functions with examples.

EÖ¨¤Úº \õº¦PÎß ]Ó¨¦ £s¦PøÍ

GkzxUPõmkPÐhß _¸UP©õP ÂÁõvUP.

18. Write short notes on: Stream Classes for Console Operations.

Pmk¨£õmk ö\¯ÀPÐUPõÚ öuõhº ÁS¨¦PøÍ

£ØÔ ]ÖSÔ¨¦ GÊxP.

19. Write a C++ program to illustrate inline function.

Inline function&I GkzxUPõmk® C++ ö©õÈ°ß

ö\¯Àvmh® JßøÓ GÊxP.

U/ID 46433/UCCC 4

PART C — (4 10 = 40 marks)


20. Explain about ACCEPT and DISPLAY statements in COBOL with suitable examples.

÷Põ£õ¼À EÒÍ ACCEPT ©ØÖ® DISPLAY TØÖPøÍ £ØÔ uS¢u GkzxUPõmkPÐhß ÂÍUSP.

21. Describe about Master-Transaction File Processing in COBOL with example programs.

÷Põ£õ¼ß •u»õÎ – £›©õØÓ ÷Põ¨¦ ö\¯»õUSuÀ

£ØÔ GkzxUPõmk ö\¯Àvmh[PøÍ £ØÔ ÂÁ›UP.

22. Explain the usage of various operators in C++ with suitable examples.

]++&À EÒÍ £À÷ÁÖ C¯UPºPÎß £¯øÚ uS¢u

GkzxUPõmkPÐhß ÂÍUSP.

23. Write a C++ Program to illustrate operator Overloading.

C¯UPº JÁº÷»õi[-&ø¯ ÂÍUS® ]++&ß

ö\¯Àvmh® JßøÓ GÊxP.

24. Explain the various rules for Virtual Functions in C++.

]++ß ©õ¯ \õº¦PÐUPõÚ £À÷ÁÖ ÂvPøÍ

ÂÍUSP.

25. Explain about Sequential Input and Output Operations in C++ with examples.

]++ß Á›ø\•øÓ EÒÏk ©ØÖ® öÁÎ±k

BQ¯ÁØøÓ GkzxUPõmkPÐhß ÂÍUSP.

———————

DECEMBER 2017 U/ID 46434/UCCD


SECTION A — (10 × 3 = 30 marks)


1. State kinds of cash book.

öμõUP Hmiß ÁøPPøÍ TÖP.

2. Define compensating errors. Give suitable example.

\›Pmk® ¤øÇPøÍ ÂÁ›. uS¢u Euõμn® öPõkUPÄ®.

3. State 3 defects of single entry system.

JØøÓ¨ £vÄ •øÓ°ß ‰ßÖ SøÓPøÍU TÖP.

4. Write short notes on stock and dibtors method.

\μUS ©ØÖ® PhÜ¢÷uõº •øÓø¯¨ £ØÔ ]Ö SÔ¨¦ ÁøμP.

5. Define instalment purchase.

uÁønU öPõÒ•uø» ÂÁ›.

6. What do you mean by cum-interest and ex-interest purchase of securities?

Ámi²hß AÀ»x Ámi°À»õ©À Áõ[S® BÁn[PøÍ¨ £ØÔ }

AÔÁøu TÖP.

7. Define floating capital method.

©õÖ® ‰»uÚ •øÓø¯ ÂÁ›.

8. What are the items will be included while calculating amount due to retiring partner?

K´Ä ö£ØÓ TmhõÎUS öPõkUP ÷Ási¯ öuõøP°À

Ah[Q²ÒÍøÁPÒ ¯õøÁ?

9. State the rules of Garner vs Murray case.

PõºÚº ÷©õ÷μ Cøh÷¯ TÓ¨£mh ÂvPÒ ¯õøÁ?

U/ID 46434/UCCD

2

10. Define fund flow statement.

{v Kmh £mi¯ø» Áøμ¯Ö.

11. Define dual apportionment.

Cμmøh JxURmøh Áøμ¯Ö.

12. What are the two methods of wage payment?

T¼ öPõk¨£uß Cμsk •øÓPÒ ¯õøÁ?

SECTION B — (5 6 = 30 marks)


13. Define marginal costing. What are its features?

©õºâÚÀ APÂø»¨£i ÂÁ›. Auß |ßø©PÒ ¯õøÁ?

14. What are the distinction between allocation and apportionment?

JxURk ©ØÖ® J¨£øh¨¤US® Cøh÷¯ EÒÍ ÷ÁÖ£õkPÒ

¯õøÁ?

15. Narrate the difference between single entry and double entry systems.

JØøÓ¨ £vÄ •øÓ ©ØÖ® Cμmøh¨ £vÄ •øÓUS Cøh÷¯ EÒÍ

÷ÁÖ£õkPÒ ¯õøÁ?

16. Ramu sells goods to his approved customers on sale or return basis at a profit of 20% on sales treating as actual sales. On 15th September, good costing Rs. 1,000 were sent to Usha traders. No confirmation has been received from Usha traders until 31st December. Give necessary journal entries in the books of Ramu.

μõ• ußÝøh¯ HØÖU öPõÒÍ¨£mh ÁõiUøP¯õÍºPÐUS

Esø© ÂØ£øÚ°À 20% \uÃu® C»õ£® öPõsk ÂØ£øÚ

AÀ»x v¸¨£® GßÖ ö£õ¸ÒPøÍ ÂØ£øÚ ö\´uõº. ö\¨h®£º 15

B® |õÒ Eåõ i÷μhºìUS ¹. 1,000 ©v¨¦ÒÍ ö£õ¸ÒPÒ

AÝ¨£¨ £mhx. i\®£º 31 Áøμ AÁºPÎhª¸¢x G¢u Â£μ•®

ö£Ó¨£hÂÀø». μõ• PnUQÀ •uØSÔ¨÷£mk £vÄPøÍ u¸P.

U/ID 46434/UCCD

3

17. A and B are partners sharing their profits and losses in the ratio of 2 : 1. C was admitted for 1/4th share in profit. Calculate new profit sharing ratio.

A ©ØÖ® B TmhõÎPÒ. AÁºPÒ 2:1 GßÓ ÃuzvÀ »õ£ |mhzøu

¤›zxU öPõÒQßÓÚº. C»õ£zvÀ 1/4 £õPzvØS C Gß£Áº ¦v¯

TmhõÎ¯õP AÝ©vUP¨£mhõº. ¦v¯ C»õ£ |mh Ãuzøu PõsP.

18. Calculate the economic order quantity and number of orders placed during the year :

Annual consumption - 120 units

Buying cost per order - Rs. 20

Per unit price - Rs. 100

Storage and carrying cost - 12% of average inventory.

]UPÚ Bøn AÍøÁ²®, C¢u BsiÀ AÝ¨£ ÷Ási¯

BønPÎß GsoUøPø¯²® PõsP.

BsiÀ ÷uøÁ (E£÷¯õPzvØS) & 120 A»SPÒ

Áõ[S® Âø» Bøn JßÖUS & ¹. 20

J¸ A»Qß Âø» & ¹ .100

C¸¨¦ øÁ¨£x ©ØÖ® AÝ¨¥mka ö\»ÄPÒ & \μõ\› \μUS

C¸¨¤À 12 \uÃu®.

19. The following information is obtained from a concern for the month of December, 2012 :

Rs.

Wages for normal hours worked 20,500

Wages for over time 2,200

Leave wages 1,700

Deduction towards E.S.I. 500

Deduction towards P.F. 1,600

Deduction towards house rent @ Rs. 15 p.m. per employee

Average gross wage per employee Rs. 1,220

Find the cash required for payment of wages.

U/ID 46434/UCCD

4

2012 B® Bsk i\®£º ©õuzvØPõÚ J¸ {ÖÁÚzvß Â£μ® R÷Ç

öPõkUP¨£mkÒÍx.

¹.

ö£õx ©o ÷|μ® ÷Áø» ö\´uuØPõÚ T¼ 20,500 AvP¨£i¯õÚ ÷|μU T¼ 2,200 Âk•øÓ T¼ 1,700 öuõÈ»õÍº Põ¨¥mkUS ¤izu® 500 ö£õx {vUS ¤izu® 1,600 J¸ öuõÈ»õÎUS ©õu® JßÖUS ¹.15 Ãu® Ãmk ÁõhøP¨ ¤izu® J¸ öuõÈ»õÎUS \μõ\› ö©õzuU T¼ ¹. 1,220

T¼ öPõkUP ÷uøÁ¯õÚ £nzøu PõsP.

SECTION C — (4 × 10 = 40 marks)


20. Describe the managerial uses of fund flow statement.

{v Kmh £mi¯»õÀ ÷©»õsø© {ºÁõPzvØS QøhUS®

£¯ßPøÍ ÂÁ›.

21. Enumerate the benefits of management accounting.

÷©»õsø© PnUQ¯¼ß £¯ß£õmøh TÖP.

22. The following are the particulars of transactions that have taken place between A and B for a period of six months. In the books of A :

Rs.

July 1 Balance (dr) 4,000

10 Purchased goods from B 3,000

25 Paid cash by B 1,000

Aug. 10 Sold goods to B 10,000

25 Given two months acceptance to B 5,000

Sept. 10 Paid cash to B 3,000

Purchased goods from B 7,000

You are required to prepare an account current to be rendered by A and B for the period upto December 31, 2011. Interest is to be charged at an agreed rate of 12% P.A.

U/ID 46434/UCCD

5

6 ©õu Põ»zvØS ‘A’ ©ØÖ® ‘B’ &ÄUS Cøh÷¯ |øhö£ØÓ

|hÁiUøPPÒ R÷Ç öPõkUP¨£mkÒÍx. ‘A’ ¦zuP[PÎÀ.

¹.

áúø» 1 C¸¨¦ (£) 4,000

10 ‘B’ Âhª¸¢x Áõ[Q¯ ö£õ¸ÒPÒ 3,000

25 ‘B’ öPõkzu öμõUP® 1,000

BPìm 10 ‘B’ US ÂØ£øÚ ö\´u ö£õ¸ÒPÒ 10,000

25 ‘B’ US Cμsk ©õu HØ¦ öPõkzux 5,000

ö\¨h®£º 10 ‘B’ US öPõkzu £n® 3,000

‘B’ Âhª¸¢x Áõ[Q¯ ö£õ¸ÒPÒ 7,000

i\®£º 31, 2011 Áøμ ‘A’ ¦zuPzvÀ |h¨¦U PnUøP u¯õº

ö\´P. Ámi BsiØS 12 \uÃu® PnUQhÄ®.

23. Prepare departmental trading and profit and loss account for the year ended 31st March 2013.

Departments

A Rs.

B Rs.

Stock (April 2012) 40,000 -

Purchases 2,00,000 20,000

Wages 10,000 1,000

Transfer to goods from Dept. A - 50,000

Stock (March 2013) at cost to the Dept. 30,000 10,000

Sales 2,00,000 71,000

B’s entire stock represents goods from Dept. A which transfers them at 25% above its cost. Administrative expenses Rs. 15,000 which is to be allocated between depts. A and B in the ratio 4 : 1 respectively.

U/ID 46434/UCCD

6

31.3.2013 Ähß •iÁøh²® BsiØS xøÓ Â¯õ£õμ ©ØÖ®

C»õ£ |mhU PnUøP u¯õº ö\´P.

xøÓPÒ

A

¹.

B

¹.

\μUS (H¨μÀ 2012) 40,000 -

öPõÒ•uÀ 2,00,000 20,000

T¼ 10,000 1,000

xøÓ A & Â¼¸¢x \μUS ©õØÓ® - 50,000

\μUS (©õºa&2013) AhUP Âø»°À 30,000 10,000

ÂØ£øÚ 2,00,000 71,000

B& Ähß C¸US® AøÚzx¨ ö£õ¸ÒPÐ® xøÓ A & ÂÝøh¯x.

Ax AhUP Âø»°À 25% AvP®. {ºÁõPa ö\»ÄPÒ ¹. 15,000, 4:1

ÃuzvÀ A ©ØÖ® B xøÓPÐUS JxURk ö\´¯Ä®.

24. Calculate the value of goodwill in the following cases :

(a) Goodwill estimated at 3 years purchase of the average profits of the last 4 years. Profits - 1 st year Rs. 8,000, 2nd year Rs. 10,000, 3rd year Rs. 16,000; 4th year Rs. 14,000.

(b) Total capital invested Rs. 1,00,000; actual profit Rs. 20,000; normal rate of interest is 10%. Partners salary Rs. 6,000. Goodwill at 3 years purchase of the super profits.

RÌPsh uPÁÀ Ai¨£øh°À |ß©v¨ø£ PõsP.

(A) |õßS BskPÒ \μõ\›°ß ‰ßÖ BskPÒ Âø» GÚ

|ß©v¨ø£ PnUQhÄ®.

C»õ£® 1 B® Bsk & ¹. 8,000, 2 B® Bsk & ¹. 10,000,

3 B® Bsk & ¹. 16,000, 4 B® Bsk & ¹. 14,000.

(B) •u½k ö\´ux ¹. 1,00,000, Esø©¯õÚ C»õ£® ¹. 20,000,

Ámi Ãu® 10 \uÂu®, TmhõÎPÎß \®£Í® ¹. 6,000,

|ß©v¨¦ ]Ó¨¦ C»õ£zvß 3 BskPÒ ©v¨¦.

U/ID 46434/UCCD

7

25. From the following information relating to Sun Traders Ltd; you are required to find

(a) p.v. ratio

(b) break even point

(c) profit

(d) volume of sales to earn profit of Rs. 7,000.

Rs.

Total fixed costs 4,500

Total variable costs 7,500

Total sales 15,000

R÷Ç öPõkUP¨£mkÒÍ \ß i÷μhº]ß Â£μ[PÎ¼¸¢x PõsP.

(A) C»õ£ ÂØ£øÚ \uÃu®

(B) \©Ãu¨ ¦ÒÎ

(C) C»õ£®

(D) ¹. 7,000 C»õ£® Aøh¯ ö\´¯ ÷Ási¯ ÂØ£øÚ°ß

AÍÄ.

¹.

ö©õzu {μ¢uμ AhUP Âø» 4,500

ö©õzu ©õÖ£k® AhUP Âø» 7,500

ö©õzu ÂØ£øÚ 15,000

—————————

DECEMBER 2017 U/ID 46435/UCCE


PART A — (10 3 = 30 marks)


1. Write the formula for Newton’s Raphson method.

{³mhß μõ¨\ß •øÓ°ß `zvμzøu GÊxP.

2. Find the approx. value of the root of 0533 xxxf by the method of False

position, the root lying between 2 and 3.

False position •øÓ°À ÷uõμõ¯©õÚ ¹miøÚ

0533 xxxf GßÓ \©ß£õmiØS PõsP

(root lying between 2 and 3)

3. Write the fourth order Taylor algorithm.

|õßPõÁx Á›ø\°ß öh´»º ÁÈ•øÓø¯ GÊxP.

4. What is Normal distribution?

\õuõμn Â{÷¯õP® GßÓõÀ GßÚ?

5. What is Skewness? Write down the Moment coefficient of Skewness.

\õ´Ä GßÓõÀ GßÚ? Pn® SnP® \õ´Ä–ø¯

GÊxP.

(7 pages)

U/ID 46435/UCCE 2

6. What is Chi-square test for goodness of fit?

chi-square ÷\õuøÚ°ß goodness of fit GßÓõÀ

GßÚ?

7. Define the term – Large sample.

ö£›¯ ©õv› Áøμ¯ÖUP.

8. What is Data structure?

uμÄ Pmhø©¨¦ GßÓõÀ GßÚ?

9. What are Asymptotic notations?

Asymptotic notations GßÓõÀ GßÚ?

10. What is a Graph?

Áøμ£h® GßÓõÀ GßÚ?

11. What is a Tree data structure?

©μ®–uμÄ Pmhø©¨¦ GßÓõÀ GßÚ?

12. Write the Divide and conquer strategy.

Divide ©ØÖ® Conquer Ezvø¯ GÊxP.

U/ID 46435/UCCE 3



13. Solve 1210 zyx ; 13102 zyx ; 141022 zyx by Gauss Jordan Method.

Gauss Jordan •øÓ°ß ‰»® wºUP.

1210 zyx ;

13102 zyx ; 141022 zyx

14. Calculate the Arithmetic mean for the following distribution. Variable value : 0-1 1-3 3-5 5-10 10-15

Frequency : 8 8 10 12 18

Variable value : 15-25 25-28 28-30 30-45 45-50

Frequency : 11 10 9 8 6

¤ßÁ¸® £μÁ¼ß Tmk\õμõ\›ø¯ PnUQkP.

©õÔ ©v¨¦ : 0-1 1-3 3-5 5-10 10-15

AvºöÁs : 8 8 10 12 18

©õÔ ©v¨¦ : 15-25 25-28 28-30 30-45 45-50

AvºöÁs : 11 10 9 8 6

15. Calculate the Correlation coefficient for the following data : X : 65 66 67 67 68 69 70 72

Y : 67 68 65 68 72 72 69 71

U/ID 46435/UCCE 4

¤ßÁ¸® uμÄPÎß correlation coefficient ø¯

PnUQkP.

X : 65 66 67 67 68 69 70 72

Y : 67 68 65 68 72 72 69 71

16. Compute the real root of 2.1log10 xx correct to

three decimal places using Newton’s Raphson method )4343.0(log10 e .

{³mhß μõ¨\ß •øÓ°ß ‰»® 2.1log10 xx –ß

¹miøÚ ‰ßÖ u\© GsoÀ PnUQhÄ®

)4343.0(log10 e .

17. Write short notes representation of Doubly Linked List.

Doubly linked list–ß E¸Áø©¨ø£ _¸UP©õP

GÊxP.

18. Explain briefly the Linear representation of a Binary tree.

Binary tree–ß E¸Áø©¨ø£ _¸UP©õÚ ÂÍUSP.

19. Explain the Merge sort algorithm with suitable example.

JßÔøn¨¦ ÁøP¯õÚ (merge sort) ÁÈ•øÓø¯

ö£õ¸zu©õÚ Euõμnzxhß ÂÍUSP.

[P.T.O.]

U/ID 46435/UCCE 5

PART C — (4 10 = 40 marks)


20. Apply Runge-Kutta method to find an approximate value of y for 2.0x in steps of 0.1.

If 2yxdxdy

, 11.0 y , correct to four decimal

places.

Runge-Kutta •øÓø¯ £¯ß£kzv y –ß

÷uõμõ¯©õÚ ©v¨ø£ 2.0x GßÓ £i°À |õßS

u\©zvÀ PnUQkP. 2yx

dxdy

, 11.0 y .

21. Calculate Pearson’s coefficient of skewness from the table given below :

Life time (hours) No. of tubes

300–400 14

400–500 46

500–600 58

600–700 76

700–800 68

800–900 62

900–1000 48

1000–1100 22

1100–1200 6

U/ID 46435/UCCE 6

RÌUPsh AmhÁønø¯ £¯ß£kzv Pearson’s

coefficient of skewness ø¯ PnUQkP.

ÁõÌ|õÒ ÷|μ®

(©o ÷|μ®)

SÇõ´ GsoUøP

300–400 14

400–500 46

500–600 58

600–700 76

700–800 68

800–900 62

900–1000 48

1000–1100 22

1100–1200 6

22. The following table gives the score obtained by

11 students in English and Tamil translation.

Find the Rank correlation coefficient.

Score in English : 40 46 54 60 70 80

Score in Tamil : 45 45 50 43 40 75

Score in English : 82 85 85 90 95

Score in Tamil : 55 72 65 42 70

U/ID 46435/UCCE 7

11 ©õnÁºPÎß B[Q»® ©ØÖ® uªÌ

ö©õÈö£¯º¨¤À ö£ØÓ ©v¨ö£sPøÍ

AmhÁøÚ£kzu¨£mkÒÍx. Rank correlation coefficient ø¯ Psk¤i.

B[Q» ©v¨ö£s : 40 46 54 60 70 80

uªÌ ©v¨ö£s : 45 45 50 43 40 75

B[Q» ©v¨ö£s : 82 85 85 90 95

uªÌ ©v¨ö£s : 55 72 65 42 70

23. Explain the Manipulation of polynomial using Linked list.

Linked list–ø¯ £¯ß£kzv £À¾Ö¨¦ ÷PõøÁø¯–

ø¯ £¯ß£kzxÁøu ÂÍUSP.

24. Explain the Traversal method in Binary tree with example.

Binary tree £¯ozuÀ •øÓø¯ Euõμnzxhß

ÂÍUSP.

25. What is meant by Hashing? Explain how to access the data in the hash table with suitable example.

Hashing GßÓõÀ GßÚ? uμÄPøÍ (data) GÆÁõÖ

hash AmhÁøn°À E£÷¯õP¨£kzxÁx Gß£øu

ÂÍUSP.

——————–––––—

DECEMBER 2017 U/ID 46436/UCCF


PART A — (10 × 3 = 30 marks)


1. List out the components of Operating System.

C¯UP •øÓø©°ß TÖPøÍ £mi¯¼kP.

2. What is meant by CPU Scheduling?

CPU vmhªhÀ GßÓõÀ GßÚ?

3. Define: Critical-Section Problem.

•UQ¯ ¤›Ä ]UPÀ – Áøμ¯Ö.

4. What is meant by Address Binding?

•PÁ› ¤øn¨¦ GßÓõÀ GßÚ?

5. What is meant by Fragmentation?

xshõUSuÀ GßÓõÀ GßÚ?

6. Define: Authentication.

A[RPõμ® – Áøμ¯Ö.

7. What is meant by Threat Monitoring?

Aa_ÖzuÀ PsPõo¨¦ GßÓõÀ GßÚ?

U/ID 46436/UCCF 2

8. Define: Dynamic Debugging.

©õÖ® ¤øÇ v¸zu® – Áøμ¯Ö.

9. What is meant by Stack?

AkUS GßÓõÀ GßÚ?

10. Define assembler.

Aö\®¨Íº – Áøμ¯Ö.

11. Give an expansion of ASCII.

ASCII&ß •Êø©ø¯ GÊxP.

12. Define: Access Matrix.

AqPÀ Ao – Áøμ¯Ö.

PART B — (5 × 6 = 30 marks)


13. Write short notes on: Semaphores.

Semaphore – £ØÔ ]ÖSÔ¨¦ GÊxP.

14. Describe briefly about: Virtual Memory.

ö©´{Pº {øÚÁP® £ØÔ _¸UP©õP ÂÁõvUP.

15. Discuss about the 8085 Microprocessor.

~sö\¯¼ & 8085 £ØÔ ÂÁõvUP.

U/ID 46436/UCCF 3

16. Write short notes on: Random Access Memory.

^μØÓ AqPÀ {øÚÁP® £ØÔ ]Ö SÔ¨¦ GÊxP.

17. Write short notes on: Sub- routine.

xøn ÁÇUP® £ØÔ ]ÖSÔ¨¦ GÊxP.

18. Discuss about the Memory Interface.

{øÚÁP Cøh•P® £ØÔ ÂÁõvUP.

19. Discuss about the DMA Microprocessor.

÷|μi {øÚÁP AqPÀ ~s ö\¯¼ £ØÔ ÂÁõvUP.

PART C — (4 × 10 = 40 marks)


20. Explain the concept of Scheduling Algorithms.

vmhªhÀ ÁÈ•øÓPÒ £ØÔ ÂÍUSP.

21. Describe the concept of Paging and Segmentation.

£UP©õUPÀ ©ØÖ® ¤›ÁõUPÀ £ØÔ ÂÁ›.

22. Elaborate about the Microprocessor Architecture an its operations.

~sö\¯¼ Aø©¨¦ ©ØÖ® |hÁiUøPPøÍ Â›ÁõP

GÊxP.

U/ID 46436/UCCF 4

23. Explain the concept of Arithmetic and Logical Operations.

Pou ©ØÖ® uºUP |hÁiUøPPøÍ ÂÍUSP.

24. Explain the following :

(a) BCD — Binary conversion

(b) Binary — BCD Conversion

(c) BCD — Hexadecimal Conversion.

¤ßÁ¸ÁÚÁØøÓ ÂÍUSP :

(A) BCD — Binary ©õØÓ®

(B) Binary — BCD ©õØÓ®

(C) BCD — Hexadecimal ©õØÓ®.

25. Explain the concept of Encryption with an example.

SÔ¯õUP® £ØÔ Â›ÁõP J¸ GkzxUPõmkhß

ÂÍUSP.

——————

DECEMBER 2017 U/ID 46437/UCCG


PART A — (10 3 = 30 marks)


1. Write a note on : Arrays in Java.

áõÁõÂÀ EÒÍ Á›ø\PÒ £ØÔ J¸ SÔ¨¦ GÊxP.

2. What are Constructors in Java?

áõÁõÂÀ EÒÍ BUQPÒ GßÓõÀ GßÚ?

3. Write a note on : Interfaces.

Cøh•P[PøÍ £ØÔ J¸ SÔ¨¦ GÊxP.

4. What is meant by Multithreading?

©Àivμi[ GßÓõÀ GßÚ?

5. Write a note on : URL.

URL ø¯ £ØÔ J¸ SÔ¨¦ GÊxP.

6. List any three AWT Controls.

AWT Pmk¨£õkPÒ H÷uÝ® ‰ßøÓ £mi¯¼kP.

7. What is meant by Protocol?

Áøμ•øÓ GßÓõÀ GßÚ?

U/ID 46437/UCCG 2

8. Write a note on : Serial Transmission.

öuõhº{ø»a ö\¾zu® £ØÔ J¸ SÔ¨¦ GÊxP.

9. What is the function of Network Layer?

Áø»¯ø©¨¦ AkUQß ö\¯ÀTÖ ¯õx?

10. Write a note on : Packet Switching.

£õUöPm {ø»©õØÖ £ØÔ J¸ SÔ¨¦ GÊxP.

11. What is ISDN?

ISDN GßÓõÀ GßÚ?

12. What are Bridges?

£õ»[PÒ GßÓõÀ GßÚ?



13. Write Short Notes on: Operators in Java.

áõÁõÂÀ EÒÍ C¯UP[PøÍ £ØÔ ]Ö SÔ¨¦

GÊxP.

14. Discuss briefly on Exception Handling in Java.

áõÁõÂÀ ÂvÂ»USPøÍ øP¯õÐuÀ £ØÔ

_¸UP©õP ÂÁõvUP.

U/ID 46437/UCCG 3

15. Discuss about Synchronization in Java.

áõÁõÂÀ EÒÍ Jzv¯UP® £ØÔ ÂÁõvUP.

16. Write about any ONE Layout Manager in Java with an example program.

áõÁõÂÀ EÒÍ H÷uÝ® J¸ Ch Aø©Ä {ºÁõQø¯

£ØÔ J¸ GkzxUPõmk ö\¯Àvmh® GÊxP.

17. Discuss briefly on different components of Data Communication.

uμÄ öuõhº¤À EÒÍ £À÷ÁÖ £SvPøÍ _¸UP©õP

ÂÁõvUP.

18. Discuss Token Ring.

ÂÀø» ÁøÍ¯® £ØÔ ÂÁõvUP.

19. Write short notes on : Broadband ISDN.

AP»¨£møh ISDN £ØÔ ]Ö SÔ¨¦ GÊxP.

PART C — (4 10 = 40 marks)


20. Explain the different Control statements in Java with suitable illustrations.

áõÁõÂÀ EÒÍ £À÷ÁÖ Pmk¨£õmk TØÖPøÍ

uS¢u Euõμn[PÐhß ÂÍUSP.

U/ID 46437/UCCG 4

21. Write a Java Program to illustrate the use of Packages.

ö£õvPÎß £¯øÚ GkzxUPõmk® J¸ áõÁõÂß

ö\¯Àvmh® GÊxP.

22. Explain the usage of TCP/IP Sockets in Java with example program.

áõÁõÂÀ EÒÍ TCP/IP xøÍPÎß £¯øÚ

GkzxUPõmk ö\¯Àvmh® ‰»® ÂÍUSP.

23. Discuss in detail, Classification of Networks.

Áø»¯ø©¨¤ß ÁøP¨£kzxuø» ÂÍUP©õP

ÂÁõvUP.

24. Explain about Unguided Transmission Media.

ÁÈPõmhõu ö\¾zu® Fh[PøÍ £ØÔ ÂÍUSP.

25. Discuss briefly on ATM Topology.

ATM Chzv¯À £ØÔ _¸UP©õP ÂÁõvUP.

——————–––––—

DECEMBER 2017 U/ID 46438/UCCH


SECTION A — (10 × 3 = 30 marks)


1. Define Data Dictionary and Data Independence.

uμÄ APμõv ©ØÖ® uμÄ _u¢vμ® – Áøμ¯Ö.

2. What are the limitations of a file system?

÷Põ¨¦ •øÓø© Áμ®¦PÒ ¯õøÁ?

3. What is logical data Independency and DML?

u¸UP uμÄ {»•® ©ØÖ® DML GßÓõÀ GßÚ?

4. Define the terms :

(a) Entity set

(b) Relationship set.

Áøμ¯ÖUP :

(A) E¸ö£õ¸Ò Pn®

(B) EÓÄ Pn®.

5. What do you mean by interactive computer Graphics?

Fhõk® PoÛ ÁøμPø» GßÓõÀ GßÚ?

U/ID 46438/UCCH 2

6. What is meant by RGB? RGB GßÓõÀ GßÚ?

7. What are the features of Inkjet printers? CßUöám Aa_¨ ö£õÔPÎß A®\[PÒ ¯õøÁ?

8. What are the disadvantages of DDA algorithm? DDA ÁÈ•øÓ°ß wø©PÒ ¯õøÁ?

9. Define Reflection and Shear. Áøμ¯ÖUP : ¤μv£¼¨¦ ©ØÖ® öÁmk.

10. What are the types of Clipping? QÎ¨¤[&ß ÁøPPÒ ¯õøÁ?

11. What are the steps in animation sequence? AÛ÷©åß Á›ø\ |hÁiUøPPÒ ¯õøÁ?

12. Define Clipping and view port. Áøμ¯ÖUP : QÎ¨¤[ ©ØÖ® view port.

SECTION B — (5 × 6 = 30 marks)


13. Write a note on DDL and Events. DDL ©ØÖ® {PÌÄPÒ «x SÔ¨¦ GÊxP.

14. Write about Data Clustering and Partitioning. uμÄ öuõS¨¦ ©ØÖ® £QºÄ £ØÔ GÊxP.

U/ID 46438/UCCH 3

15. Write a note on Graphical objects and Procedural Languages.

ÁøμPø» ö£õ¸mPÒ ©ØÖ® |øh•øÓ ö©õÈPÒ

£ØÔ GÊxP.

16. Write short notes on Inquiry functions and output primitives.

Â\õμøn ö\¯À£õkPÒ ©ØÖ® öÁÎ±k ‰»[PÒ

£ØÔ GÊxP.

17. Write about Clipping algorithms and basic transformation.

QÎ¨¤[ ö|Ô•øÓPÒ ©ØÖ® Ai¨£øh ©õØÓ®

£ØÔ GÊxP.

18. Write a note on Hidden line removal and backface removals.

©øÓUP¨£mh Á› }UP® ©ØÖ® backface }USuÀ

£ØÔ GÊxP.

19. Write short notes on Viewing transformation and Depth Cueing.

Viewing ©õØÓ® ©ØÖ® BÇ® Q³°[ £ØÔ ]Ö

SÔ¨¦ u¸P.

U/ID 46438/UCCH 4

SECTION C — (4 × 10 = 40 marks)


20. Describe Normal Forms and Integrity. C¯À£õÚ £iÁ[PÒ ©ØÖ® J¸ø©¨£õk £ØÔ

ÂÁ›UP.

21. Explain Data storage methods and Custom reports.

uμÄ ÷\ª¨¦ •øÓPÒ ©ØÖ® uÛ£¯ß AÔUøPPÒ

£ØÔ ÂÍUSP.

22. Discuss on hard copy devices and graphics software.

PiÚ ¤μv \õuÚ[PÒ ©ØÖ® Qμõ¤Uì ö©ßö£õ¸Ò

£ØÔ ÂÁõvUP.

23. Describe Line drawing algorithms and Circle generating algorithms.

Á› ÁÈ•øÓ ÁøμuÀ ©ØÖ® Ámh E¸ÁõPÒ

ÁÈ•øÓPÒ £ØÔ ÂÁ›UPÄ®.

24. Discuss on Logical classification of input devices and Line attributes.

EÒÏk \õuÚ[PÒ ©ØÖ® Á› £s¦PøÍ uºUP

Ÿv¯õÚ ÁøP¨£õkPÒ £ØÔ ÂÁ›UP.

25. Describe Three dimensional display methods and projection.

‰ßÖ £›©õn Põm] •øÓPÒ ©ØÖ® projection £ØÔ ÂÁ›UP.

———————

DECEMBER 2017 U/ID 46439/UCCJ


PART A — (10 3 = 30 marks)


1. What is toolbox? List the common collection of tools.

P¸Â ö£mi GßÓõÀ GßÚ? ö£õxÁõP

öuõSUP¨£mh P¸ÂPøÍ £mi¯¼kP.

2. Write any three string functions with example. H÷uÝ® ‰ßÖ \μ (string) ö\¯À£õkPøÍ

Euõμnzxhß GÊxP.

3. List out any three graphics files can be loaded into a picture box.

£h¨ö£mi°À HØÓUTi¯ H÷uÝ® ‰ßÖ ÁøμÂ¯À

÷Põ¨¦PøÍ £mi¯¼kP.

4. Write the advantages of OLE. OLE–ß £¯ßPøÍ GÊxP.

5. What is meant by trapping? ¤øÇ ö£õÔ GßÓõÀ GßÚ?

6. What is meant by software engineering? ö©ßö£õ¸Ò ö£õÔ°¯À Gß£uß ö£õ¸Ò GßÚ?

7. List out any three factors involved in software cost estimation.

ö©ßö£õ¸Ò ö\»Ä ©v¨¥k öuõhº¦øh¯ H÷uÝ®

‰ßÖ PõμoPøÍ £mi¯¼kP.

U/ID 46439/UCCJ 2

8. What is Real-time Software Design? {PÌ ÷|μ ö©ßö£õ¸Ò ÁiÁø©¨¦ GßÓõÀ GßÚ?

9. What are the fundamental aspects of design concepts?

ÁiÁø©¨¦ P¸zuõUP[PÎß Ai¨£øh A®\[PÒ

GßÚ?

10. List the errors that commonly found during unit test phase?

A»S ÷\õuøÚ Pmhzvß ÷£õx ö£õxÁõP

Põn¨£k® ¤øÇPøÍ £mi¯¼kP.

11. What is meant by static analysis? Write the use of Static Analysis.

©õÓõ{ø»¨ £S¨£õ´Ä GßÓõÀ GßÚ? ©õÓ{ø»¨

£S¨£õ´Âß £¯ßPøÍ GÊxP.

12. What is Software Quality Assurance? ö©ßö£õ¸Ò uμ EÖv¨£kzuÀ GßÓõÀ GßÚ?



13. Explain how to manage the forms in Visual Basic. Â_ÁÀ ÷£]UQÀ EÒÍ ÁiÁ[PøÍ (forms) GÆÁõÖ

{ºÁQ¨£x Gß£uøÚ ÂÍUSP.

14. What are the three types of Combo Box controls? Explain.

÷Põ®÷£õö£mi Pmk£õkPÎß ‰ßÖ ÁøPPÒ

¯õøÁ? ÂÍUSP.

U/ID 46439/UCCJ 3

15. Explain how to add and remove the VB controls and their uses with example.

Â_ÁÀ ÷£]UQÀ EÒÍ Pmk¨£õkPøÍ GÆÁõÖ

÷\º£x ©ØÖ® }USÁx Gß£uøÚ²®, Auß

£¯ßPøÍ²® ÂÍUSP.

16. Discuss the managerial issues in brief. {ºÁõP ¤μa\øÚPøÍ _¸UP©õP ÂÁõvUP.

17. Discuss the structured coding techniques in brief. Pmhø©zu SÔ¯õUP ~m£[PøÍ _¸UP©õP

ÂÁõvUP.

18. Discuss how to enhance the level of maintenance during software development.

GÆÁõÖ ö©ßö£õ¸Ò ÷©®£õmiß ÷£õx Auß

£μõ©›¨¤ß AÍøÁ AvP›UPa ö\´Áx Gß£uøÚ

ÂÁõvUP.

19. Explain briefly the distributed system design.

ÂμÁÀ Aø©¨¦ ÁiÁø©¨¤øÚ _¸UP©õP

ÂÍUSP.

PART C — (4 10 = 40 marks)


20. Explain determinate loops and indeterminate loops with example code.

{ºn¯zu _ÇÀPÒ ©ØÖ® PoUP•i¯õu _ÇÀPøÍ

GkzxUPõmk SÔ±khß ÂÍUSP.

U/ID 46439/UCCJ 4

21. Explain the following : (a) Control Arrays (b) DoEvent and Submenu. ¤ßÁ¸ÁÚÁØøÓ ÂÍUSP :

(A) Pmk¨£õmk Ao Á›ø\PÒ

(B) DoEvent ©ØÖ® xønö©Ý.

22. Explain the following : (a) File System Controls (5) (b) DLL Server. (5) ¤ßÁ¸ÁÚÁØøÓ ÂÍUSP :

(A) ÷Põ¨¦ •øÓø© Pmk¨£kzuÀ

(B) DLL \ºÁº.

23. Explain in detail the planning of the software project.

ö©ßö£õ¸Ò vmhzvß vmhªhø» Â›ÁõP

ÂÍUSP.

24. Discuss briefly the design techniques and detailed design considerations.

ÁiÁø©¨¦ EzvPÒ ©ØÖ® Â›ÁõÚ ÁiÁø©¨¦

£›^»øÚPøÍ ÂÁõvUP.

25. Discuss the source code matrices and maintenance tools in detail.

‰» SÔ±k AÍÄ ©ØÖ® £μõ©›¨¦ P¸ÂPøÍ

Â›ÁõP ÂÁõvUP.

——————–––––—

DECEMBER 2017 U/ID 46440/UCCK


PART A — (10 3 = 30 marks)


1. Define: “Operations Research”.

Áøμ¯Ö: ö\¯À•øÓ Bμõ´a].

2. What is meant by LPP?

LPP GßÓõÀ GßÚ?

3. Write a short note on assignment problem.

JxURk PnUS £ØÔ GÊxP.

4. What is a travelling salesman problem ?

£¯n ÂØ£øÚ¯õÍº PnUS GßÓõÀ GßÚ?

5. Write the expansion of PERT and CPM.

PERT ©ØÖ® CPM Â›ÁõUP® GßÚ?

6. Define: “Game Theory”.

Áøμ¯Ö : “ÂøÍ¯õmk ÷Põm£õk”.

7. What are the attributes of list tag?

GßöÚßÚ £s¦PÒ £mi¯À tagÀ EÒÍx?

(6 pages)

U/ID 46440/UCCK 2

8. What is a JavaScript?

Javascript GßÓõÀ GßÚ?

9. What is event handling?

{PÌa] øP¯õhÀ GßÓõÀ GßÚ?

10. Write down any two applications of ASP.NET.

ASP.NET À H÷uÝ® Cμsk £¯ß£õkPøÍ GÊxP.

11. What is the use of IIS?

IIS &ß £¯ß£õk GßÚ?

12. Define: “Database”.

Áøμ¯Ö : “uPÁÀ uÍ®”.



13. Solve the following LPP problem graphically

Maximize 21 40100 xxZ

Subject to constraints

0,and

5002

90023

100025

21

21

21

21

xxxxxxxx

÷©ØPsh PnUøP Áøμ£h Áõ°»õP wºÄ PõsP.

U/ID 46440/UCCK 3

14. Write an algorithm for dual simplex method.

C¸ø© •øÓ°À EÒÍ ö|Ô•øÓPÒ £ØÔ GÊxP.

15. Solve the transportation problem. Destination

C»US

A B C D SupplyÁÇ[Rk

Source Buõμ®

1 11 20 7 8 50

2 21 16 20 12 40

3 8 12 18 9 40

Demand ÷uøÁ

30 25 35 40

÷©ØPsh PnUøP ÷£õUSÁμzx PnUPõP wºUP.

16. Solve the following 22 game B

A 5 1

3 4

÷©ØPsh 22 ÂøÍ¯õmk PnUPõP wºUP.

17. Explain about the attributes of <frame> tag.

Pmhø©¨¦ Tag À EÒÍ £s¦PøÍ £ØÔ ÂÍUS.

U/ID 46440/UCCK 4

18. What are the data types supported by Javascript? Give examples.

Jasvascript ß £À÷ÁÖ ÁøP¯õÚ uμÄPøÍ

Euõμnzxhß ÂÍUSP.

19. Explain the repeater and data list web server controls in ASP.NET.

ASP.NET EÒÍ TÔ¯x TÖ£Áº ©ØÖ® uμÄ

£mi¯À Cøn¯® ÁÇ[Q Pmk¨£õkPÒ £ØÔ

ÂÍUSP.

PART C — (4 10 = 40 marks)


20. Use simplex method to solve the LPP problem

Maximize 21 104 xxz


0,and

9032

10052

502

21

21

21

21

xxxxxxxx

÷©ØPsh PnUøP uÛ¨£ß•P •øÓø¯¨

£¯ß£kzv wºUP.

[P.T.O.]

U/ID 46440/UCCK 5

21. Use Big-M method to solve

Minimize 21 34 xxz


0,

6

623

102

21

21

21

21

xxandxx

xxxx

÷©ØPsh PnUøP Big-M •øÓ°À wºUP.

22. Find the staring solution of the following transportation problem by using

(a) Matrix minima method

(b) Vogel’s approximation method 1 2 6 7 0 4 2 12 3 1 5 11

10 10 10

÷£õUSÁμzx PnUøP £¯ß£kzv wºUP

(A) Ao]Ö©® •øÓ

(B) Vogel’s À ÷uõμõ¯® •øÓ

1 2 6 7 0 4 2 12 3 1 5 11

10 10 10

U/ID 46440/UCCK 6

23. Solve the following sequencing problem giving an optimal solution if passing is not allowed

Machines C¯¢vμ[PÒ

M1 M2 M3 M4

A 13 8 7 14

B 12 6 8 19

C 9 7 8 15

Jobs ÷Áø»PÒ

D 8 5 6 15

÷©ØPsh PnUøP öuõhº {PÌÄ PnUPõP wºUP.

24. What are the tags and attributes for a table in HTML document? Explain.

Table À EÒÍ £À÷ÁÖ Tº¦› ©ØÖ® £s¦PÒ EÒÍ

HTML À EÒÍøu £ØÔ ÂÍUSP.

25. Describe the procedure for creating a simple ASP.NET application.

ASP.NET £¯ß£õkPÒ E¸ÁõUSÁuØPõÚ

|øh•øÓ £ØÔ Â›ÁõP ÂÍUSP.

———————

(6 pages) u/id 46431/ucca · 1. convert the following decimal number to binary (a) 673.23 (b) 1998....

Documents