Computer sciences and Information technology

Questions in Theory of Computation

Project description
Hello there,
I have some of questions in Theory of Computation.
1) I need someone who understands well in Theory of Computation to answer those questions.
2) I want all the answers, true and accurate
3) On the other hand, I want all the answers to be easily understood.

Note:
1) I want a writer (writer’s ID is 135511).
2) Those questions are final midterm. So please be careful.

CS 345: Spring 2014
Page
1
of
5
Final
D
Final
D
Name______________________
200
points
CS 345: Spring, 2014
1.
a.
Describe what is meant by a
greedy
algorithm. [5
points]
b.
Describe what is meant by a
divide
–
and
–
conquer
algorithm. [5 points]
2.
Describe the steps necessary to c
reate a
dynamic programming
algorithm. [10 points]
3
.
Why can an algorithm that uses
dynamic programming
solve some problems that an
algorithm that uses a
greedy
approach cannot? [10 points]
4
.
What algorithmic paradigm was used to sol
ve the
Knight’s Tour
problem?
[10
points]
CS 345: Spring 2014
Page
2
of
5
Final
D
5
.
A standard problem in Computer Science is the
Clique
problem. Describe the basic
problem. [10 points]
6
.
a.
What is the
definition
of T( n ) = O( g( n ) )? [5 points]
b.
Use the definition to
show that T( n ) = 3n
2
+ 4n + 1 is O( n
2
). [5 points]
7
.
Describe what is meant by the complexity class
P
. [10 points]
8
.
Describe what is meant by an
algorithmic gap
. [10 points]

PLACE THIS ORDER OR A SIMILAR ORDER WITH US TODAY AND GET AN AMAZING DISCOUNT 🙂