Question

9. Referring again to the problem of dynamic programming problem considered in Question 8, what is the cost of matching the t
10. Which of the following statements is/are true? (i) Dijkstras algorithm and the Fast Marching algorithm are identical (ii


8. Following the example in lectures, we wish to use dynamic programming to match two strings. The LEFT string is EALEPANT an
9. Referring again to the problem of dynamic programming problem considered in Question 8, what is the cost of matching the two substrings ELEPHAN and EALEP? (a) 3 (b) 4 (c) 5 (d) 6 (e) None of the above
10. Which of the following statements is/are true? (i) Dijkstra's algorithm and the Fast Marching algorithm are identical (ii) Dijkstra's algorithm finds the shortest Euclidean path in space (ii) Dijkstra's algorithm finds the shortest path in a network (a) (i) only (b) (i) only (c) (ii) only (d) Both (i) and (i) (e) Both (ii) and (ii) 11.Which of the following statements is/are true? (i) Radiance represents perceived luminance (ii) Luminance gives a measure of the energy an observer perceives from a light source (i) Saturation is the aspect of colour that varies as white light is added to monochromatic light (a) (i) only (b) (ii) only (c) (i) only (d) Both (i) and (ii) (e) Both (ii) and (ii) 12. Which of the following statements is/are true? (i) Subtractive primary colours are used for printer inks (i) By mixing the three additive primary colours red, green, and blue, we can create all possible colours the eye can see (ii) Cone receptors are mainly used for night and peripheral vision (a) (i) only (b) (ii) only (c) (iii) only (d) Both (i) and (ii) (e) Both (ii) and (iii)
8. Following the example in lectures, we wish to use dynamic programming to match two strings. The LEFT string is EALEPANT and the TOP string is ELEPHANT. The following string operations have the conventional costs: Delete LEFT 1 Delete TOP 1 Match 0 What is the cost of matching two substrings ELEP to EALE illustrated by the shaded square d(3,4) in the table below? (a) 2 (b) 3 (c) 4 (d) 5 (e) None of the above E P H T E A L E P A T Z 0.
0 0
Add a comment Improve this question Transcribed image text
Answer #1

9.C = 5

The Cost of the Matching of the Two substrings of ELEPHAN and EALEP is 5.

10.E = Both 2 and 3

Dijkstra's Algorithm Finds the shortest Euclidian Path in space.

Dijkstra's Algorithm Finds the shortest path in a network

11.B = II only

Luminous Gives the Measure of the Energy an Observer Perceives from a Light Source

12.A and B (Option A and B )

Option A = Subtractive Primary Colours are used for Printer Inks.

Option B = By Mixing of three additive Primary Colours Red, Green and Blue, we can create all possible colors the Eye can see.

8.= 3

The Cost of the Matching Two substrings ELEP to EALE that is illustrated by the shaded square of d ( 3,4 ) is 3.

Add a comment
Know the answer?
Add Answer to:
9. Referring again to the problem of dynamic programming problem considered in Question 8, what is...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • 5. If we apply binary dilation to the same large object twice using the same small...

    5. If we apply binary dilation to the same large object twice using the same small structuring element, the effect, if any, of the second dilation on the object is that the object: (a) is unchanged (b) is completely removed (c) becomes larger (d) becomes smaller (e) does not change 6. Which of the following is/are true? (a) Dijkstra's algorithm can be used to find shortest paths in a network (b) Dijkstra's algorithm is a method to find straight lines...

  • 1. Consider the Viterbi algorithm. Which of the following statements is/are true. if any? (i) It...

    1. Consider the Viterbi algorithm. Which of the following statements is/are true. if any? (i) It is an algorithmused for optimal thresholding (ii) It is an algorithm to find shortest paths in on a network (ii)It is an algorithm to detect lines in images (a) (i) (b) (ii) (c) (ii) (d) All of the above (e) None of the above 4. If we apply a binary opening to the same object twice using the same structuring element, the effect. if...

  • Problem 1: Dynamic Programming in DAG Let G(V,E), |V| = n, be a directed acyclic graph...

    Problem 1: Dynamic Programming in DAG Let G(V,E), |V| = n, be a directed acyclic graph presented in adjacency list representation, where the vertices are labelled with numbers in the set {1, . . . , n}, and where (i, j) is and edge inplies i < j. Suppose also that each vertex has a positive value vi, 1 ≤ i ≤ n. Define the value of a path as the sum of the values of the vertices belonging to...

  • Give pseudocode that performs the traceback to construct an LCS from a filled dynamic programming table...

    Give pseudocode that performs the traceback to construct an LCS from a filled dynamic programming table without using the “arrows”, in O(n + m) time. 2. Suppose we are given a “chain” of n nodes as shown below. Each node i is “neighbors” with the node to its left and the node to its right (if they exist). An independent set of these nodes is a subset of the nodes such that no two of the chosen nodes are neighbors....

  • C. 7. True/False Questions. (2 points each) a. Applying Horner's Rule, an n-degree polynomial can be...

    C. 7. True/False Questions. (2 points each) a. Applying Horner's Rule, an n-degree polynomial can be evaluated at a given point using only n multiplications and n additions. b. Quick Sort and Merge Sort are comparison-based sorting algorithms. Heap Sort and Distribution Counting Sort are not comparison-based sorting algorithms. An AVL tree applies four types of rotations: RIGHT, LEFT, RIGHT-LEFT, and LEFT-RIGHT. d. When an AVL tree's left sub-tree is left-heavy, a LEFT rotation is needed. e. When an AVL...

  • Psuedocode works! DP is dynamic programming for this algorithm Problem 4.2. (Difficulty 3) Seam carving is...

    Psuedocode works! DP is dynamic programming for this algorithm Problem 4.2. (Difficulty 3) Seam carving is a real-world application of DP for content- aware image resizing. The simplest way to reduce the size of an image is cropping and scaling, i.e. cutting out parts of the image and scaling down the size. However, cropping leaves visible crop lines of incontinuity while scaling reduces the details of the image. We would like to intelligently reducing the size while accounting for the...

  • Data Structures and Algorithm Analysis – Cop 3530 Module 3 – Programming Assignment This assignment will...

    Data Structures and Algorithm Analysis – Cop 3530 Module 3 – Programming Assignment This assignment will access your skills using C++ strings and dynamic arrays. After completing this assignment you will be able to do the following: (1) allocate memory dynamically, (2) implement a default constructor, (3) insert and remove an item from an unsorted dynamic array of strings, (4) use the string class member functions, (5) implement a copy constructor, (6) overload the assignment operator, (7) overload the insertion...

  • can anyone provide answers with explaination ? thanks a lot I. In the example of recycling...

    can anyone provide answers with explaination ? thanks a lot I. In the example of recycling the elements of a list in O1) time, which situation holds? A. Both lists are circular B. Both ists are not circular C. The list to be recycled is circular, the garbage list is not D. The garbage list is circular, the list to be recycled is not 2. What is the worst-case time to perform MINIMUML) for a sorted, doubly-linked list with nodes?...

  • [C++]Project #3 – Traversing Property Graphs EDIT: in reply to the comment, what excerpt are you...

    [C++]Project #3 – Traversing Property Graphs EDIT: in reply to the comment, what excerpt are you talking about? EDIT #2 : Need to construct a directed graph, where the property names label edges connecting nodes; either using array or linked list implementation. Learning Objectives Implement a data structure to meet given specifications Design, implement, and use a graph data structure Perform analysis of algorithm performance Utilize Dijkstra's algorithm Overview Your task for this assignment is to implement a graph data...

  • java programming 1 Solving the Game [30 Marks] The solution developed in assignment 2 was solving...

    java programming 1 Solving the Game [30 Marks] The solution developed in assignment 2 was solving the game starting from a board that is completely OFF. We first need to generalize this work and be able to compute the solutions starting from any board positions. 1.1 GameModel The class GameModel is used to capture the current state of the board. Its specification is as follows: • GameModel(int width, int height): the constructor. Creates an all OFF game of width width...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT