## Moderator: Barkha

Barkha ♦

**750**- 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

0

votes

1

answer

1.3k

views

1

answers

... **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
Barkha ♦

**750**0

votes

1

answer

1.3k

views

1

answer

... **Mumbai University > Computer Engineering > Sem 4 > Analysis of Algorithm**
**Marks:** 10M
**Year:** Dec 2016
...

written 21 months ago by
Barkha ♦

**750**0

votes

1

answer

1.2k

views

1

answers

... **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
Barkha ♦

**750**0

votes

1

answer

1.2k

views

1

answer

... **Mumbai University > Computer Engineering > Sem 4 > Analysis of Algorithm**
**Marks:** 10M
**Year:** Dec 2016
...

written 21 months ago by
Barkha ♦

**750**0

votes

1

answer

856

views

1

answers

... 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
Barkha ♦

**750**0

votes

1

answer

856

views

1

answer

... **Mumbai University > Computer Engineering > Sem 4 > Analysis of Algorithm**
**Marks:** 10M
**Year:** Dec 2016
...

written 21 months ago by
Barkha ♦

**750**0

votes

1

answer

3.2k

views

1

answers

... 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
Barkha ♦

**750**0

votes

1

answer

3.2k

views

1

answer

... **Mumbai University > Computer Engineering > Sem 3 > Analysis of Algorithm**
**Marks:** 10M
**Year:** Dec 2016
...

written 21 months ago by
Barkha ♦

**750**0

votes

1

answer

404

views

1

answers

... 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
Barkha ♦

**750**0

votes

1

answer

404

views

1

answer

written 22 months ago by
Barkha ♦

**750**#### 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.