ExamGecko
Question list
Search
Search

List of questions

Search

Related questions











Question 248 - PT0-002 discussion

Report
Export

An exploit developer is coding a script that submits a very large number of small requests to a web server until the server is compromised. The script must examine each response received and compare the data to a large number of strings to determine which data to submit next. Which of the following data structures should the exploit developer use to make the string comparison and determination as efficient as possible?

A.
A list
Answers
A.
A list
B.
A tree
Answers
B.
A tree
C.
A dictionary
Answers
C.
A dictionary
D.
An array
Answers
D.
An array
Suggested answer: C

Explanation:

data structures are used to store data in an organized form, and some data structures are more efficient and suitable for certain operations than others. For example, hash tables, skip lists and jump lists are some dictionary data structures that can insert and access elements efficiently3.

For string comparison, there are different algorithms that can measure how similar two strings are, such as Levenshtein distance, Hamming distance or Jaccard similarity4. Some of these algorithms can be implemented using data structures such as arrays or hashtables5.

asked 02/10/2024
Daniel williams
51 questions
User
Your answer:
0 comments
Sorted by

Leave a comment first