No.
of Printed Pages : 1 BCSL 045(P)/S1
-
BACHELOR OF COMPUTER APPLICATIONS (Revised)
(BCA)
Term-End Practical Examination
02038 June, 2017
BCSL-045(P)/S1 : INTRODUCTION TO ALGORITHM DESIGN LAB
Time : 1 Hour Maximum Marks : 50
Note : (i) There are two compulsory questions.
(ii) Each question carries 20 marks.
(iii) The rest 10 marks are for viva-voce.
(iv) All programs are to be written in 'C' language.
,
1. Write a program to generate 10 numbers in Fibonacci series and calculate how
many times the loop, addition and assignment operations will execute. 20
2. Write a program to sort the following list of numbers using Bubble Sort
algorithm :
15 27 5 2 85 45 30
Calculate
(a) how many times the outer loop and inner loop will execute, and
(b) how many exchange operations will execute. 20
BCSL-045(P)/S 1 1 3,000
No. of Printed Pages : 1 BCSL-045(P)/S1
BACHELOR OF COMPUTER APPLICATIONS (Revised)
(BCA)
Term-End Practical Examination
December, 2017
BCSL-045(P)/S1 : INTRODUCTION TO ALGORITHM DESIGN LAB
Time : 1 Hour Maximum Marks : 50
Note : (i) There are two compulsory questions.
(ii) Each question carries 20 marks.
(iii) The remaining 10 marks are for viva-voce.
(iv) All programs are to be written in 'C' language.
1. Write a program to evaluate a polynomial using Horner's rule and count how
many times the loop will execute. 20
2. Write a 'C' program to perform linear search and apply it to the following set of
integers to search for a number 28 :
9 15 22 5 4 25 28
Calculate the number of comparison operations required. 20
BCSL-045(P)/S1 1 2,000
No. of Printed Pages : 1 I BCSL 045(P)/S1
-
BACHELOR OF COMPUTER APPLICATIONS (Revised)
(BCA)
02602 Term-End Practical Examination
June, 2018
BCSL-045(P)/S1 : INTRODUCTION TO ALGORITHM DESIGN LAB
Time : 1 Hour Maximum Marks : 50
Note : (i) There are two compulsory questions.
(ii) Each question carries 20 marks.
(iii) The rest 10 marks are for viva-voce.
(iv) All programs are to be written in 'C' language.
1. Write a program to calculate the length of a string. Calculate the number of
times the loop will execute and the number of comparison operations required in
this program. 20
2. Implement the Bubble Sort algorithm to sort an array of 10 integer numbers
showing all the intermediate steps.
25 15 10 5 4 8 16 13 7 9
How many times will the inner and outer loops execute ? 20
BCSL-045(P)/S1 1 3,000
No. of Printed Pages : 2 1 . . 1")
/.:
•
BCSL-04581
Bachelor of Computer
Application (Revised) (BCA)
Term-End Examination
December. 2018
•
INTRODUCTION TO ALGORITHM
DESIGN LAB
Time :1 Hour Maximum Maths 50
Note : (i) There are two compulsory auestions.
(ii) Each question-carries 20 marks.
(iii) The rest 10 marks are for viva-voce.
(iv) All programs are to be written in 'C' language.
(A4) P. T. 0.
[2]
1. Write a program to combine any two given strings. Calculate the number
of times the loop will execute and the number of comparison operations
required in this program. 20
2. Implement the selection sort algorithm to sort an array of 10 integer
numbers showing all the intermediate steps :
35, 25, 15, 5, 14, 18, 16, 13, 17, 19
How many times will the inner loop execute and number of key
comparisons required. 20
BCSL-045/S1(R) 500
(A-8)
