**IGNOU BCA/MCA all semester new revised (first semester,second semester,third semester,fourth**

**semester,fifth semester and six semester) solved assignments,term-end exam notes,study materials,important**

**questions,books/blocks (June-December) free download.**

**IGNOU BCA BCSL-045 4th semester Term-End Practical Examination (INTRODUCTION TO ALGORITHM DESIGN LAB**

**) books/block,term-end exam notes,upcoming guess paper,important questions,study materials,previous year papers download.**

**SET-1**

1. Given an ordered list of n integers and an integer x, find the number of comparisons used to determine the position of an integer in the list using a binary search.

2. Write a program to multiply two matrices of order 4 x 4 and calculate the total number of assignment, multiplication and addition operations.

**SET-2**

1. Implement a selection sort algorithm to sort an array of 10 integer numbers :

9 45 35 15 20 5 4 10 19 27

Calculate the number of exchange and comparison operations in best case and worst case.

2. Write a program to reverse a string and count how many times the exchange operation and the loop will execute.

**SET-3**

1. Write a program that finds the sum of all the integers in an array. Calculate the total time taken to execute the program.

2. Write a program to generate 10 Fibonacci numbers and calculate the time taken to execute each statement of the program and the total time. How many times will the loop execute ?

**SET-4**

1. Implement a bubble sort algorithm for sorting the following list of numbers :

27 5 10 8 16 2 37

Calculate how many times the loop will execute. Count the number of comparison operations needed in this program.

2. Write a program to calculate the length of a string. Calculate the total time taken to execute this program.

**SET-1(A)**

**1. Write a program to multiply two matrices of order 4 x 4 and calculate total number of comparison, assignment, multiplication and addition operations.**

2. Write a program to compute xn, where both x and n are integer numbers.Calculate how many times the loop will execute.

**SET-2(B)**

2. Given an array of n distinct integers, determine the location of an integer in an array using a linear search. Calculate the number of times a comparison operation will execute.

**SET-3(C)**

**1. Implement a selection sort algorithm to sort an array of 10 integer numbers**

25 18 12 14 3 30 35 17 4 11

Calculate the number of exchange and comparison operations.

2. Write a program to count the number of times an integer number 10 has occurred in the following array :

5, 10, 15, 2, 10, 8, 7, 10, 11

**SET-4(D)**

**1. Implement a binary search algorithm for searching for an item 16 from the following sorted array A with 10 elements :**

2 4 8 12 16 25 30 32 40 50

Calculate the number of comparison operations, divide operation and total time taken to execute a program.

2. Write a program to combine two strings and calculate the number of times the loop will execute.

###
IGNOU BCA BCSL-045 4th semester Term-End Practical Examination (INTRODUCTION TO ALGORITHM DESIGN LAB) term-end exam notes** Download **

**Also available:-**