BCS1223 Data Structure And Algorithms : Lab 22 Nov 2017

1. Write a program to sort an array as follows.

a. Use Selection sort to sort the array using the function selctionSort given in class. Print the number of comparisons and the number of item movements.

b. Use Bubble sort  to sort the array using the function bubbleSort given  in class. Print the number of comparisons and the number of item movements.

c. Test your program on a list of 1,000 elements and on a list of 10,000 elements.

DCT1144 Programming Fundamentals LAB 20/11/2017

1. Consider the following function main:

int main()
{
   int inStock[10][4];
   int alpha[20];
   int beta[20];
   int gamma[4] = {11, 13, 15, 17};
   int delta[10] = {3, 5, 2, 6, 10, 9, 7, 11, 1, 8};
   .
   .
   .
}

 a. Write the definition of the function setZero that initializes any one dimensional

array of type int to 0.


b. Write the definition of the function inputArray that prompts the user to input 20 numbers and stores the numbers into alpha.


c. Write the definition of the function doubleArray that initializes the elements of beta to two times the corresponding elements in alpha. Make sure that you prevent the function from modifying the elements of alpha.


d. Write the definition of the function copyGamma that sets the elements of the first row of inStock to gamma and the remaining rows of inStock to three times the previous row of inStock. Make sure that you prevent the function from modifying the elements of gamma.


e. Write the definition of the function copyAlphaBeta that stores alpha into the first five rows of inStock and beta into the last five rows of

inStock. Make sure that you prevent the function from modifying the elements of alpha and beta.


f. Write the definition of the function printArray that prints any onedimensional array of type int. Print 15 elements per line.


g. Write the definition of the function setInStock that prompts the user to input the elements for the first column of inStock. The function should then set the elements in the remaining columns to two times the corresponding element in the previous column, minus the corresponding element in delta.


h. Write C++ statements that call each of the functions in parts a through g.


i. Write a C++ program that tests the function main and the functions discussed in parts a through g. (Add additional functions, such as printing a two-dimensional array, as needed.)


* A function definition is  the actual body of the function



2. Write a program that uses a two-dimensional array to store the highest and lowest temperatures for each month of the year. The program should output the average high, average low, and the highest and lowest temperatures for the year. Your program must consist of the following functions:


a. Function getData: This function reads and stores data in the two dimensional array.

b. Function averageHigh: This function calculates and returns the average high temperature for the year.

c. Function averageLow: This function calculates and returns the average low temperature for the year.

d. Function indexHighTemp: This function returns the index of the highest high temperature in the array.

e. Function indexLowTemp: This function returns the index of the lowest low temperature in the array.


(These functions must all have the appropriate parameters.)

BCS1223 Data Structure And Algorithms : Assignment 2

Write a program to find the number of comparisons using the binary search and sequential search algorithms as follows:
Suppose list is an array of 1000 elements.

a. Use a random number generator to fill list. (You may refer to http://www.cplusplus.com/reference/cstdlib/rand/)
b. Use any sorting algorithm to sort list. (You may refer to http://www.geeksforgeeks.org/sort-c-stl/)
c. Search the list for some items, as follows:

     i. Use the sequential search algorithm to search the list. (You might need to modify the seqSearch   function given in  http://mohdnazri.blogspot.my/2017/11/bcs1223-data-structure-and-algorithms.html to count the number of comparisons.)

     ii. Use the binary search algorithm to search the list. (You might need to modify the binSearch function  given in http://mohdnazri.blogspot.my/2017/11/bcs1223-data-structure-and-algorithms.html    to count the number of comparisons.)

     iii. Use the binary search algorithm to search the list, switching to a sequential search when the size of the search list reduces to less than 15.(Use the sequential search algorithm for a sorted list.)


d. Print the number of comparisons for Steps c.i c.ii and c.iii. If the item is found in the list, then print its position.

due date: 23 November 2017

Students may refer to the following C++ program to get the idea.

DCT1144 Programming Fundamentals LAB 08/11/2017

Write a program statement that will do the following to array MyArray shown below:
int MyArray[10];
for(i=0;i<=9;i++)
MyArray[i]=i*2;

i.    Print all elements of array MyArray.

ii.     Print all element of array MyArray in reverse.

iii.    Print the first element.

iv.    Replace the value of third elements with 7.

v.    Copy the value of fifth elements into the first one.

vi.    Find the sum of the first five elements

vii.    Display all even-numbered elements on one line.

DCT1144 Programming Fundamentals LAB 06 Okt 2017

1. Write a C++ program that declares an array alpha of 50 components of type double. Initialize the array so that the first 25 components are equal to the square of the index variable, and the last 25 components are equal to three times the index variable. Output the array so that 10 elements per line are printed.

2. Write a C++ function, smallestIndex, that takes as parameters an int array and its size and returns the index of the first occurrence of the smallest element in the array. Also, write a program to test your function.

3. Write a C++ function, lastLargestIndex, that takes as parameters an int array and its size and returns the index of the last occurrence of the largest element in the array. Also, write a program to test your function.

4. Write a program that prompts the user to input a string and outputs the string in uppercase letters. (Use a character array to store the string.)

BCS1223 Data Structure And Algorithms : LAB 2 Nov 2017

1. Rewrite and run the following C++ program.

 

2. Rewrite and run the following C++ program.

 

3. The sequential search algorithm as given in Question 1 does not assume that the list is in order. Therefore, it usually works the same for both sorted and unsorted lists. However, if the elements of the list are sorted, you can somewhat improve the performance of the sequential search algorithm. For example, if the search item is not in the list, you can stop the search as soon as you find an element in the list that is larger than the search item. Write the function seqOrdSearch to implement a version of the sequential search algorithm for sorted lists.