cross popup-offer
Call Back
cross cross
logo

24x7 Support Available

call-back

To Get the Best Price Chat With Our Experts

chat now

In A Hurry? Get A Callback

Close Button
Signup/Login
Back All services Close Button

World's Leading Assignment Library

Continued assistance through writing and revision till final submission by the professional and experienced writers.

  • 10 subjects

  • 2,10,1000
    solved Questions

  • 500 Solved Questions
    Added Everyday

  • Download Solution
    in Seconds

Write a program to implement the Boyer-Moore algorithm. Your program should ask the user to enter a text and a pattern, then output the following: (a) bad-symbol table (b) good suffix table (c)

Question Preview:

Write a program to implement the Boyer-Moore algorithm. Your program should ask the user to enter a text and a pattern, then output the following: (a)  bad-symbol table   (b)  good suffix table  (c)  the searching result (whether the pattern is in the text or not)

Please make sure that the good suffix table is generated correctly. Use the following examples to test your program before submitting your assignment.

Examples:

Good suffix table for the pattern BAOBAB

k =...

View complete question »

Question Preview:

Write a program to implement the Boyer-Moore algorithm. Your program should ask the user to enter a text and a pattern, then output the following: (a)  bad-symbol table   (b)  good suffix table  (c)  the searching result (whether the pattern is in the text or not)

Please make sure that the good suffix table is generated correctly. Use the following examples to test your program before submitting your assignment.

Examples:

Good suffix table for the pattern BAOBAB

k = 1   d2 = 2;     k = 2,   d2 = 5;     k = 3   d2 = 5;     k = 4   d2 = 5;      k = 5   d2 = 5

Good suffix table for the pattern AACCAC

k = 1   d2 = 2;     k = 2,   d2 = 3;     k = 3   d2 = 6;     k = 4   d2 = 6;      k = 5   d2 = 6

Good suffix table for the pattern AACCAA

k = 1   d2 = 1;     k = 2,   d2 = 4;     k = 3   d2 = 4;     k = 4   d2 = 4;      k = 5   d2 = 4

Good suffix table for the pattern 10000

k = 1   d2 = 3;     k = 2,   d2 = 2;     k = 3   d2 = 1;     k = 4   d2 = 5

Good suffix table for the pattern 01010

k = 1   d2 = 4;     k = 2,   d2 = 4;     k = 3   d2 = 2;     k = 4   d2 = 2

 

2. (50 points) Design a greedy algorithm to solve the activity selection problem. Suppose there are a set of activities: a1, a2, ... an that wish to use a lecture hall. Each activity ai has a start time si and a finish time fi. A lecture hall can be used by only one activity at a time. Two activities can be scheduled in the same lecture hall if they are nonconflicting (fi <= sj or fj <= si ) Your algorithm should find out the minimum number of lecture halls needed to hold all the activities. Write a program to implement your algorithm. For example: if the activities you need to schedule have the following start times and finish times,

4 7

6 9

7 8

1 3

1 4

2 5

3 7

then the output of your program is “the minimum number of lecture halls required is 3”. Also indicate which activity will be scheduled in which lecture hall.

 

View less »

Solution preview

Program:

import java.io.IOException;
import java.util.Scanner;
import java.io.BufferedReader;
import java.io.InputStreamReader;

Get solution

whatappWhatsApp Order whatappWhatsApp Order

STAY UPDATED WITH LIVEWEBTUTORS

java assignment help

we provide assignment help melbourne

free turnitin report get free turnitin
Free turnitin

DMCA.com Protection Status © Livewebtutors. All Rights Reserved 2019

Arrow up