Trending ▼   ResFinder  

IGNOU UNIVERSITY MCA - I (SEM 2) DEC 2009 : Data And File Structures

4 pages, 16 questions, 0 questions with responses, 0 total responses,    0    0
mca_india
   		+Fave Message
ProfileTimelineUploadsQ & A
 Home > mca_india >

Formatting page ...

MCS-021 I MCA (Revised) Term-End Examination December, 2009 0 MCS-021 : DATA AND FILE STRUCTURES tr) Time : 3 hours Maximum Marks : 100 (VVeightage 75%) Note : Question number 1 is Coinpulsory. Attempt any three questions from the rest. All algorithms should be written nearer to C language. 1. (a) Consider the algorithm given below : 10 Scanf ("%d", & n) ; for (i =1; m= 3n ; i<m ; it = 2) {Printf ("%d In", i); for (j 1/10 m= Y5 ; j <=m ; j++) {Printf ("%d In", j); H Calculate the complexity of the following code by using Big '0' notation. Also, compute the overall complexity of this code. MCS-021 1 P.T.O.

Formatting page ...

Formatting page ...

Formatting page ...

 

  Print intermediate debugging step

Show debugging info


 

Additional Info : Mca - I (sem 2) December 2009 Question Paper - Data And File Structures(Revised Course)
Tags : mca exam papers, mca question papers, ignou mca question papers, ptu mca question papers, mca sample question paper, mca mumbai university question papers, mca exam syllabus, mca exam question paper, online mca exam papers, online mca exam preparation, mumbai university mca question papers, ignou university mca question papers  

© 2010 - 2024 ResPaper. Terms of ServiceContact Us Advertise with us

 

mca_india chat