Summer 2014
ASSIGNMENT
PROGRAM - Master of Science in
Information Technology (MSc IT)Revised Fall 2011
SEMESTER - 2
SUBJECT CODE & NAME – MIT203-
ANALYSIS AND DESIGN OF ALGORITHMS
CREDIT 4 BK ID
B1480 MAX. MARKS 60
Get fully solved assignment, plz drop a mail with your sub code
computeroperator4@gmail.com
Charges rs
125/subject and rs 700/semester only.
our website is www.smuassignment.in
if urgent then call us
on 08791490301, 08273413412
1 Define
Recursion and explain the use of recursion.
Answer: In computer programming, a
recursion (noun, pronounced ree-KUHR-zhion) is programming that is recursive
(adjective), and recursive has two related meanings:
1) A recursive procedure or routine is one that has the
ability to call itself. This usually means that it has the capability to save
the condition it was in or the particular process it is serving
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 lists.
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
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.
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
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 independent and
identically-distributed source may be compressed almost
Get fully solved assignment, plz drop a mail with your sub code
computeroperator4@gmail.com
Charges rs
125/subject and rs 700/semester only.
our website is www.smuassignment.in
if urgent then call us
on 08791490301, 08273413412
No comments:
Post a Comment