Docsity
Docsity
Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity

Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips
Guidelines and tips
Sell on Docsity
Sell on Docsity
Docsity AI
Docsity AI
Log inSign up

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search for your university

Find the specific documents for your university's exams

Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents
download point icon20 Points

For each uploaded document

Answer questions
download point icon5 Points

For each given answer (max 1 per day)

All the ways to get free points
Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

Homework 5 Questions for Data Structures and Algorithms | CSCE 310, Assignments of Algorithms and Programming

University of Nebraska–Lincoln (UNL)Algorithms and Programming

Material Type: Assignment; Class: Data Structures and Algorithms; Subject: Computer Science and Engineering ; University: University of Nebraska - Lincoln; Term: Spring 2009;

Typology: Assignments

Pre 2010

Uploaded on 08/30/2009

koofers-user-ycv-1
koofers-user-ycv-1 🇺🇸

9 documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CSE 310 Homework5 Spring 2009
Due 9:30AM Monday, April 27
Name:
Student ID:
Instructions Follow instructions carefully, failure to do so will result in points being
deducted. It is highly recommended that you write your homework using LATEX or Word.
Staple this cover page to the front of your assignment for easier grading. Be sure to submit a
hardcopy of your problem answers and your program analysis in class. Clearly label each
problem and submit the answers in order. Put your program analysis to the end. In addition,
submit your homework including the problem answers, all the program files and the program
analysis via the webhandin (http://www.cse.unl.edu/~cse310/handin). Late homework policy
specified in course syllabus will be strictly followed. Be sure to show sufficient work to justify
your answer(s). Numerical and yes/no answers with no explanation will NOT be granted full
points. If you are asked to prove something, you must give as formal, rigorous, and complete
proof as possible. You are to work individually, and all work should be your own. The CSE
academic dishonesty policy is in effect (http://cse.unl.edu/undergrads/academic
integrity.php).
Problem Page Points Score
7.2.8 264 10
7.2.9 265 10
7.3.1 270 10
7.3.2 270 10
7.3.7 271 10
Program
Correctness 30
Style/Doc 10
Analysis 10
Total 100
pf3

Partial preview of the text

Download Homework 5 Questions for Data Structures and Algorithms | CSCE 310 and more Assignments Algorithms and Programming in PDF only on Docsity!

CSE 310 Homework5 Spring 2009

Due 9:30AM Monday, April 27 Name: Student ID: Instructions Follow instructions carefully, failure to do so will result in points being deducted. It is highly recommended that you write your homework using LATEX or Word. Staple this cover page to the front of your assignment for easier grading. Be sure to submit a hardcopy of your problem answers and your program analysis in class. Clearly label each problem and submit the answers in order. Put your program analysis to the end. In addition, submit your homework including the problem answers, all the program files and the program analysis via the webhandin (http://www.cse.unl.edu/~cse310/handin). Late homework policy specified in course syllabus will be strictly followed. Be sure to show sufficient work to justify your answer(s). Numerical and yes/no answers with no explanation will NOT be granted full points. If you are asked to prove something, you must give as formal, rigorous, and complete proof as possible. You are to work individually, and all work should be your own. The CSE academic dishonesty policy is in effect (http://cse.unl.edu/undergrads/academic integrity.php). Problem Page Points Score 7.2.8 264 10 7.2.9 265 10 7.3.1 270 10 7.3.2 270 10 7.3.7 271 10 Program Correctness 30 Style/Doc 10 Analysis 10 Total 100

Program

Implement the Horspool’s algorithm, the Boyer-Moore algorithm, and the brute-force algorithm of Section 3.2 that, for a given binary pattern and a binary text, outputs: (i) if a matching substring is found in the text or not; (ii) how many character comparisons are made by each of the three algorithms. Your program must be written in C++, execute correctly on the CSE unix environment, and compile using the g++ compiler using a makefile. The makefile should compile your program into an executable called string_matching. Your main.cpp program should take input from a file via the command line (example: prompt:> string_matching inputfile) with the following structure in the input file (you may assume that an input file will be well structured so you don’t have to error check the input). Each line of the input file represents a pattern and a text. The first string in a line specifies the binary pattern and the second string gives the text. An example of an input file is as follows: 01010 000000000 100 100111 It specifies two instances of string matching problem. The first instance is to search for the pattern 01010 in the text 000000000. The second instance is to search for 100 in 100111. Proper output should look (something) like: //////////////////////////////////////////////////// String-Matching1: Horspool’s algorithm: No Matching Substring 6 Character Comparisons Boyer-Moore algorithm: No Matching Substring 4 Character Comparisons Brute-force algorithm: No Matching Substring 10 Character Comparisons String-Matching2: Horspool’s algorithm: Found Matching Substring 3 Character Comparisons Boyer-Moore algorithm: Found Matching Substring 3 Character Comparisons Brute-force algorithm: Found Matching Substring 3 Character Comparisons /////////////////////////////////////////////////// Points will be awarded based on the following categories:  Correctness – Your code must compile and execute as expected. You must include a makefile that will compile your code into an executable called string_matching.  Style/Documentation – Your code should be readable, properly indented and spaced with sufficient comments to explain. Good naming style should be followed.  Analysis – For this homework, your analysis should include two parts. First, you need to