Summer 2015 ASSIGNMENT
PROGRAM - Master of Science in
Information Technology (MSc IT)Revised Fall 2011
SEMESTER - 2
SUBJECT CODE & NAME – mca4040-
ANALYSIS AND DESIGN OF ALGORITHMS
CREDIT 4 BK ID B1480 MAX.
MARKS 60
Get fully solved assignment. Buy online from website
online store
or
plz drop a mail with your sub code
we will revert you within 2-3 hour or immediate
Charges rs
125/subject and rs 500/semester only.
if urgent then call us on 08791490301, 08273413412
Q1. Write the steps
involved in analyzing the efficiency of non-recursive algorithms.
Answer: Answer:
The steps involved in analyzing the efficiency of
non-recursive algorithms are as follows:
Decide the input size based on the
constraint n
Identify the basic operations of
algorithm
2 Define selection sort and
explain how to implement the selection sort? 3+7=10
Answer:
Definition: Selection sort is one of the simplest
and performance oriented sorting techniques that work well for small files. It
has time complexity as O(n2) which is unproductive on large
3 What is mean by
Topological sort? And explain with example. 5+5=10
Answer: Topological sort is done using a
directed acyclic graph (DAG), which is a linear ordering of all vertices G= (V,
E) is an ordering of all vertices such that if G contains an edge (u, v), then
u appears before v in the ordering. A topological sort of a particular graph
can be looked upon as a horizontal line where all directed edges travel from
left to right. Thus, topological sort differs
4. Explain good-suffix and
bad-character shift in Boyer-Moore algorithm. 5+5=10
Answer:
Good suffix Shift
This shift helps in shifting a matched
part of the pattern, and is denoted by Q. Good suffix shift Q is applied after
0 < k < m characters are matched.
Q =
5 Solve the Knapsack problem
using memory functions.
Item 1 2 3 4
Weight 2 6 4 8
Value (in Rs.) 12 16 30 40
Knapsack capacity is given
as W=12. Analyze the Knapsack problem using memory functions with the help of
the values given above. 10
Answer:
Knapsack Problem by Memory Functions
|
I
|
0
|
1
|
2
|
3
|
|
4
|
5
|
6
|
7
|
8
|
9
|
10
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
6 Describe Variable Length
Encoding and Huffman Encoding.
Answer:
Variable Length Encoding
Variable-length
codes can allow sources to be compressed and decompressed with zero error
(lossless data compression) and still be read back symbol by symbol. With the
right coding strategy an
Get fully solved assignment. Buy online from website
online store
or
plz drop a mail with your sub code
we will revert you within 2-3 hour or immediate
Charges rs
125/subject and rs 500/semester only.
if urgent then call us on 08791490301, 08273413412
No comments:
Post a Comment