Moderator: Barkha

gravatar for Barkha
Barkha750
Reputation:
750
Status:
Trusted
Location:
Ulhasnagar-3
Last seen:
1 year, 7 months ago
Joined:
2 years, 7 months ago
Email:
b************@ves.ac.in

Academic profile

None
None
None
None

Posts by Barkha

<prev • 193 results • page 2 of 20 • next >
0
votes
1
answer
1.3k
views
1
answers
Answer: A: Explain string matching and apply the same technique to match following pattern,
... **String Matching Algorithm** String matching algorithm is a technique of matching some pattern from given text. A given string of n characters is called the text and a string of m characters is called the pattern (m<=n). Let, text T is denoted by t0….t(n-1) and pattern P is denoted by p0…..p(m- ...
written 21 months ago by Barkha750
0
votes
1
answer
1.3k
views
1
answer
Explain string matching and apply the same technique to match following pattern, txt[]=UNIVERSITY OF MUMBAI, pat[]=MBA
... **Mumbai University > Computer Engineering > Sem 4 > Analysis of Algorithm** **Marks:** 10M **Year:** Dec 2016 ...
mumbai university analysis of algorithm written 21 months ago by Barkha750
0
votes
1
answer
1.2k
views
1
answers
Answer: A: Explain the analysis of quick sort and apply the same to sort following data. [1
... **Analysis of Quick Sort:** T(N) = T(i) + T(N - i -1) + cN The time to sort the file is equal to o the time to sort the left partition with i elements, plus o the time to sort the right partition with N-i-1 elements, plus o the time to build the partitions 1. Worst case analysis The pivot is ...
written 21 months ago by Barkha750
0
votes
1
answer
1.2k
views
1
answer
Explain the analysis of quick sort and apply the same to sort following data. [1 0 7 5 9 12 3].
... **Mumbai University > Computer Engineering > Sem 4 > Analysis of Algorithm** **Marks:** 10M **Year:** Dec 2016 ...
mumbai university analysis of algorithm written 21 months ago by Barkha750
0
votes
1
answer
856
views
1
answers
Answer: A: Sort the following numbers using Quick sort. Also derive the time complexity of
... We have set a pivot for the given numbers by which we can apply quick sort algorithm. ![enter image description here][1] Hence after applying the quick sort technique the sorted numbers are 12, 31, 33, 38, 50, 71, 77, 81. **Complexity of Quick Sort** 1. Worst-case: O(N2) This happens when the pi ...
written 21 months ago by Barkha750
0
votes
1
answer
856
views
1
answer
Sort the following numbers using Quick sort. Also derive the time complexity of quick sort. 50, 31, 71, 38, 77, 81, 12, 33
... **Mumbai University > Computer Engineering > Sem 4 > Analysis of Algorithm** **Marks:** 10M **Year:** Dec 2016 ...
mumbai university written 21 months ago by Barkha750
0
votes
1
answer
3.2k
views
1
answers
Answer: A: Solve the following Job sequencing with deadlines problem n=7, Profits(p1, p2, p
... Let n=7, Profits(p1, p2. ….p7)={3, 5, 20, 18, 1, 6, 30} Deadlines(d1, d2,….d7)={1, 3, 4, 3, 2, 1, 2} The feasible solution and their values are given below. | Sr. No | Feasible Solution | Frequenting Sequence | Value | |--------|-------------------|----------------------|-------| | 1 | (1,2) ...
written 21 months ago by Barkha750
0
votes
1
answer
3.2k
views
1
answer
Solve the following Job sequencing with deadlines problem n=7, Profits(p1, p2, p7)={3, 5, 20, 18, 1, 6, 30}Deadlines(d1, d2, d7)={1, 3, 4, 3, 2, 1, 2}
... **Mumbai University > Computer Engineering > Sem 3 > Analysis of Algorithm** **Marks:** 10M **Year:** Dec 2016 ...
mumbai university analysis of algorithm written 21 months ago by Barkha750
0
votes
1
answer
404
views
1
answers
Answer: A: Explain the asymptotic notations
... 1. Asymptotic analysis of an algorithm refers to defining the mathematical boundation/framing of its run-time performance. Using asymptotic analysis, we can very well conclude the best case, average case, and worst case scenario of an algorithm. 2. Asymptotic analysis is input bound i.e., if there' ...
written 22 months ago by Barkha750
0
votes
1
answer
404
views
1
answer
Explain the asymptotic notations
... **Mumbai University > Computer Engineering > Sem 4 > Analysis of Algorithm** **Marks:** 10M **Year:** Dec 2016 ...
mumbai university analysis of algorithm and design written 22 months ago by Barkha750

Latest awards to Barkha

Teacher 21 months ago, created an answer with at least 3 up-votes. For A: Explain two concurrency control algorithms for a distributed database system
Popular Question 21 months ago, created a question with more than 1,000 views. For Bond Energy Algorithm
Centurion 24 months ago, created 100 posts.