BCSL-045
1. Write a
programme to perform matrix multiplication of 3 x 3 using Strassen’s algorithm.
Calculate total number of addition and multiplication operations while
computing the matrix multiplication. (6 marks)
2. Implement
a Bubble Sort algorithm for sorting the following list of numbers and showing
the list obtained at each step. (5 marks)
17 10 7 9 25 30 8
Calculate the total number of exchange operations. How
many times will the loop execute ?
3. Write a programe
to implement a connected graph (all vertices are connected to each other) with
five vertices in form of an adjacency list and then implement DFS to find a
Spanning Tree of the graph. (6 marks)
4. Given an
ordered list of n integers and integer x. Find the number of comparisons used
to determine the position of an integer x in the list using a Liner Search
Algorithm. (6 marks)
5. Write a
program to check whether a string is a palindrome or not and calculate
(a) Total number
of swap operations
(b) Number of
times the loop will execute. (6 marks)
6. Write
a programme to locate the last occurrence of the smallest element in a finite
list of integers. How many comparison operations will occur ?
7. Implement Merge Sort
algorithm to sort the following array
|
85
|
95
|
35
|
102
|
15
|
60
|
70
|
25
|
9
|
|
****************************************************************
Note: Answer
with Dotcom Books
www.dotcombooks4u.com
(Last 5 year
solved question paper with Assignment solutions)
9825183881
***************************************************************
No comments:
Post a Comment