data structures and algo homework help

Boost your journey with 24/7 access to skilled experts, offering unmatched data structures and algo homework help

Trusted by 1.1 M+ Happy Students

4.4Trust Pilot

4.4Edu Reviewer

5App Review

4.8Student

4.2Sitejabber

Place An Orderand save time

^*Get instant homework help from top tutors—just a WhatsApp message away. 24/7 support for all your academic needs!

Recently Asked data structures and algo Questions

Expert help when you need it

Q1: Northeastern University CET2200 – Data Structures and Algorithms Homework 4 1. Order the following functions by growth rate N, N1.5, N2, √N, NlogN, 2N. See Answer
Q2:2. An algorithm takes 0.5 ms for input size 100. How long will it take for input size 500 if the running time is the following (assume low order terms are negligible) a. Linear b. O(NlogN) c. QuadraticSee Answer
Q3:2. Distinguish between reprocessing and rollforward as database recovery techniques.See Answer
Q4:3. Distinguish between statement-level consistency and transaction-level consistency.See Answer
Q5:7. Briefly define the problems that can occur because of concurrent processing that are addressed by resource locking.See Answer
Q6:9. Explain the term cursor. Explain why a transaction may have many cursors. Also, how is it possible that a transaction may have more than one cursor on a given table?See Answer
Q7:What is a default constructor? What is the advantage of having one?See Answer
Q8:Transform the declaration template<class T, int size = 50> class genClass { T storage[size]; .................. void memberFun() { ............ if (someVar < size) { ...... } ............ } }; which uses an integer variable size as a parameter to template, to a declaration of genClass which does not include size as a parameter to template and yet allows for flexibility of the value of size. Consider a declaration of genClass's constructor. Is there any advantage of one version over another? See Answer
Q9:1. Use the STL stack container in a program that reads a string, an arithmetic expression to be exact, one character at a time, and determines if the string contains balanced parenthesis – that is, for each left parenthesis (if there are any) there is exactly one matching right parenthesis later in the string. Use the following strings to test your program. 1. A+ B- C 2. A * B / (C+10) 3. A * ((B / C) + D + (E-10) 4. A * (B / C) + D + (E-10)) Clearly describe the algorithm you will use to determine if the string contains balanced parenthesis. Document the program so I can follow what is going on. The output should look like this: String: A + B – C No parenthesis String: A * B / (C+10) Matching parenthesis String: A * ((B / C) + D + (E-10) Parenthesis don’t match. Missing right parenthesis String: A * (B / C) + D + (E-10)) Parenthesis don’t match. Missing left parenthesis [Hint: Read the expression left to right, one character at a time. If the character read is a left paren ‘(‘, Push the left paren onto the stack. If the character is a right paren ‘)’, pop the stack. If the character is neither, ignore the character. After all characters have been read, if the stack has left over parenthesis, the expression has unbalanced parenthesis, else the parenthesis are balanced.] See Answer
Q10:2. Use the STL queue (std:queue) container to implement a print queue that accepts incoming print jobs, named as PrintJob #1, PrintJob #2, etc. The print jobs arrive in random order in the sense that the first job might be PrintJob #4, the next one might be Printjob #1, etc. The print queue will look something like this: PrintJob #4 PrintJob #2 PrintJob #1 PrintJob #3 .. The program will generate the print job name strings (the digits are random numbers) and inserts these into the queue in the order received. After every second job inserted in the queue, the program will pop the job at the front of the queue displaying a message saying a particular job, identified by its name, is completed and the size of the queue. As each job is inserted in the queue, the program will display a message saying “Added PrintJob #n to the queue. Size of the queue is …”. Insert a total about 10 jobs to the queue. Please remember that the actions of adding jobs to the queue and every so often removing the job at the front of the queue should be interspersed. Submit the code and the output on Camvas. See Answer
Q11:What is the matching number of the bipartite graph shown above (i.e., what is the number of edges in a maximum matching)?See Answer
Q12:Which vertices are in the minimum vertex cover of the above graph? Select one or more: O u1 O u2 O u3 O u4 O v1 O v2 O v3 O v4See Answer
Q13:Consider an execution of Boyer-Moore with the pattern P="goggles" and a host string T. Assume that, with a shift value of i, the algorithm reads character T[i+6] and finds that this character is 'g'. By how much should the shift i be increased (according to the bad character rule)?See Answer
Q14:Consider the DFA for matching the string 'goggles'. Number the states from '0' (having matched no characters) to '7' (having matched the whole pattern). What is the target state of reading a character 'o' from state 3? (Please answer with a number only.)See Answer
Q15:We have discussed DFA:s, i.e., Discrete Finite Automata, and their use in efficient matching of languages. You have also seen them in previous modules. You will also have previously encountered NFA:s, i.e., Non-deterministic Finite Automata. (One way to briefly define them is that they are automata where you sometimes have to make a choice between which of several possible transitions to follow for an input character.) What is true about the relative power of DFA:s and NFA:s? Select one: O a. Anything that can be matched by an NFA can also be matched by a DFA O b. There are problems (formally: languages) that can be expressed via NFA:s that can't be expressed via DFA:s.See Answer
Q16:The lecture on Rabin-Karp string matching covered both the actual Java hash function and a strawman hash function, where the hash value of a string is just the sum of the character values in the string. Assume that we modified the Rabin-Karp string matching algorithm to use the strawman hash instead of the Java hash. (That is, we change the mathematical expressions in the 'update' loop, and change the initial computations of texthash and patternhash before the loop, but do not modifying any other part of the code.) What would be the effect of this change? Select one: O a. It should work exactly as well O b. It should have the same running speed, but it would no longer be guaranteed to be a correct pattern matching algorithm O c. It would still be a correct pattern matching algorithm, but it could be much slower on some data. O d. Both problems could arise (worse running time and an incorrect algorithm)See Answer
Q17:Consider running the Rabin-Karp rolling hash string matching algorithm, except modifying the loop to remove the explicit verification step -- that is, if texthash=-patternhash, then instead of going into an explicit verification loop, we simply report that the pattern matches the text. What is true about the correctness of this algorithm? Select one: O a. It is still a correct string matching algorithm, but might be noticeably slower O b. It can give 'false negatives', i.e., it can miss some occurrences of the pattern, but it will never incorrectly claim that the pattern occurs in the string O c. It can give 'false positives', i.e., it can claim matches which are not real, but it will never falsely claim that the pattern does not occur in the string O d. It can make errors in both directions (both false positives and false negatives)See Answer
Q18:Assume that X and Y are two decision problems. Which of the following are true? Check all that apply. Select one or more: a. If there is a polynomial-time reduction from X to Y, and a polynomial-time algorithm for X, then there is a polynomial-time algorithm for Y b. If there is a polynomial-time reduction from X to Y, and a polynomial-time algorithm for Y, then there is a polynomial-time algorithm for X c. If there is a polynomial-time reduction from X to Y, and X is NP-hard, then Y is NP-hard d. If there is a polynomial-time reduction from X to Y, and Y is NP-hard, then X is NP-hard e. None of these statements are trueSee Answer
Q19:The lecture on Rabin-Karp string matching covered both the actual Java hash function and a strawman hash function, where the hash value of a string is just the sum of the character values in the string. Assume that we modified the Rabin-Karp string matching algorithm to use the strawman hash instead of the Java hash. (That is, we change the mathematical expressions in the 'update' loop, and change the initial computations of texthash and patternhash before the loop, but do not modifying any other part of the code.) What would be the effect of this change? Select one: O a. It should work exactly as well O b. It should have the same running speed, but it would no longer be guaranteed to be a correct pattern matching algorithm O c. It would still be a correct pattern matching algorithm, but it could be much slower on some data. O d. Both problems could arise (worse running time and an incorrect algorithm)See Answer
Q20:Consider running the Rabin-Karp rolling hash string matching algorithm, except modifying the loop to remove the explicit verification step -- that is, if texthash=-patternhash, then instead of going into an explicit verification loop, we simply report that the pattern matches the text. What is true about the correctness of this algorithm? Select one: O a. It is still a correct string matching algorithm, but might be noticeably slower O b. It can give 'false negatives', i.e., it can miss some occurrences of the pattern, but it will never incorrectly claim that the pattern occurs in the string O c. It can give 'false positives', i.e., it can claim matches which are not real, but it will never falsely claim that the pattern does not occur in the string O d. It can make errors in both directions (both false positives and false negatives)See Answer

TutorBin Testimonials

I found TutorBin Data Structures And Algo homework help when I was struggling with complex concepts. Experts provided step-wise explanations and examples to help me understand concepts clearly.

Rick Jordon

TutorBin experts resolve your doubts without making you wait for long. Their experts are responsive & available 24/7 whenever you need Data Structures And Algo subject guidance.

Andrea Jacobs

I trust TutorBin for assisting me in completing Data Structures And Algo assignments with quality and 100% accuracy. Experts are polite, listen to my problems, and have extensive experience in their domain.

Lilian King

I got my Data Structures And Algo homework done on time. My assignment is proofread and edited by professionals. Got zero plagiarism as experts developed my assignment from scratch. Feel relieved and super excited.

Joey Dip

Popular Subjects for data structures and algo

You can get the best rated step-by-step problem explanations from 65000+ expert tutors by ordering TutorBin data structures and algo homework help.

TutorBin helping students around the globe

TutorBin believes that distance should never be a barrier to learning. Over 500000+ orders and 100000+ happy customers explain TutorBin has become the name that keeps learning fun in the UK, USA, Canada, Australia, Singapore, and UAE.