Question
The Rabin-Karp algorithm uses which technique to
efficiently compare substrings?Solution
The Rabin-Karp algorithm uses hashing to quickly filter out positions in the text that are unlikely to match the pattern. It computes a hash value for the pattern and then computes hash values for all possible substrings of the text of the same length as the pattern. If the hash values match, it then performs a character-by-character comparison to confirm a true match (to handle hash collisions).
Which of the following is used to speed up data retrieval in a relational database?
What does the term "referential integrity" mean in a database context?
In the context of databases, what does the term sharding refer to?
Which database model is based on the mathematical set theory and is the foundation of many modern databases?
Pick the odd one out.
What is the full form of DBMS?
How many types of architecture we have in DBMS
Which of the following joins returns all rows from both tables, filling in NULL values for non-matching rows?
Which of the following is true about Information?
Which of the following storage devices is considered non-volatile?
