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

IGNOU UNIVERSITY MCA - I (SEM 2) JUN 2010 : Data And File Structures

4 pages, 12 questions, 0 questions with responses, 0 total responses,

	mca_india	+Fave Message
	Profile Timeline Uploads Q & A

Home > mca_india >

Formatting page ...

No. of Printed Pages : 3 I MCS-021 I MCA (Revised) cV Term-End Examination 14 "1" June, 2010 O MCS -021 : DATA AND FILE STRUCTURES Maximum Marks : 100 (Weightage 75%) Time : 3 hours Note : Question number 1 is Compulsory. Attempt any three questions from the rest. All algorithms should be written nearer to C language. 1. (a) Write a program to store the roll numbers and names of students in a binary search tree. Write a function to accept a number and display the name of the student, whose roll number matches with this number. Give suitable messages if the roll number does not exist in the binary search tree. (b) Consider the algorithm given below : Scanf ("%d"; & max); {for (int i =1; i< = max; i + + ){ for (int j =1; j<= max; j + + ) Printf ("%d", i * j); Calculate the complexity (both space and time) of the above code by using Big '0' notation. MCS-021 1 15 10 P.T.O.

Formatting page ...

Additional Info : Mca - I (sem 2) June 2010 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

mca_india chat

Horizontal lines at:
Guest Horizontal lines at:
AutoRM Data:
Box geometries: