Scribd
Upload
279 views3 pages

BCS 042 PDF

This 3-page document contains the questions for a Bachelor of Computer Applications (BCA) term-end examination on the topic of Introduction to Algorithm Design. It includes questions that assess understanding of big-O notation, Fibonacci sequence, fractional knapsack problem, graph representations, time complexity analysis, searching and sorting algorithms like depth-first search, breadth-first search, binary search, quicksort, bubble sort, and divide and conquer techniques like Karatsuba multiplication. Students are required to answer one compulsory question with multiple parts carrying 20 marks, and three questions out of the remaining carrying 10-15 marks each.

Uploaded by

TSN Prasad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
279 views3 pages

BCS 042 PDF

This 3-page document contains the questions for a Bachelor of Computer Applications (BCA) term-end examination on the topic of Introduction to Algorithm Design. It includes questions that assess understanding of big-O notation, Fibonacci sequence, fractional knapsack problem, graph representations, time complexity analysis, searching and sorting algorithms like depth-first search, breadth-first search, binary search, quicksort, bubble sort, and divide and conquer techniques like Karatsuba multiplication. Students are required to answer one compulsory question with multiple parts carrying 20 marks, and three questions out of the remaining carrying 10-15 marks each.

Uploaded by

TSN Prasad
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

No.

of Printed Pages : 3 I BCS-042 I

BACHELOR OF COMPUTER APPLICATIONS


(BCA) (Revised)

Term-End Examination

June, 2018
CI 6 .7 ._"_1*

BCS-042 : INTRODUCTION TO ALGORITHM DESIGN

Time : 2 hours Maximum Marks : 50


Note : Question no. 1 is compulsory and carries
20 marks. Answer any three questions from the
rest.

1. (a) Define 0 (Big-"Oh") notation. By using


basic definition of 0, show that
(3x2 + 4x + 1) = 0(x2). 4

(b) The recurrence relation for Fibonacci


sequence is given by to = tn_i + tn_2, such
that to = 0 and ti = 1. Find the solution of
this recurrence.

(c) Find the optimal solution to the fractional


knapsack instance n = 5, capacity(M) = 10;
(Pi, 132, •••, P5) = (12, 32, 40, 30, 50)
(wi, w2, w5) = (4, 8, 2, 6, 1) 5
BCS-042 1 P.T.O.
(d) Write Adjacency list and Adjacency matrix
representation for the following graph :

(e) Find time complexity of the following code :


for (i = 1; i <= n; i ++)
for (j = 1; j <= n; = j * 2)
Sum[i] = Sum[i] + i x j.

2. (a) Differentiate between Depth-First Search


(DFS) and Breadth-First Search (BFS) in
terms of time and space complexity.
Traverse the following graph using
(i) DFS, (ii) BFS, the starting node is A.

(b) List all the steps to be used to search 30 in


the following list using binary search :
6 8 10 12 30 32 35
BCS-042 2
(a) Write Quick-sort algorithm and find its
time complexity in worst case. 5
(b) Multiply 10265 x 2573 using Divide and
Conquer technique. Apply Karatsuba
method. 5

4. Write any two applications of spanning tree.


Write Prim's algorithm and apply it to find the
minimum cost spanning tree for the following
graph 10

5. (a) Write all the 0 cases of Master method for


solving Recurrence. Apply Master method
to solve the following recurrence :

T(n) = 3T( —
n ) + n log n
4
(b) Write algorithm of bubble sort.

BCS-042 7,000

You might also like