CompTIA Exam PT0-002 Topic 1 Question 43 Discussion

Actual exam question for CompTIA's PT0-002 exam

Question #: 43
Topic #: 1

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?

AA list

BA tree

CA dictionary

DAn array

Show Suggested Answer

Suggested Answer: C

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.

by Derick at Jul 29, 2023, 03:01 AM

Limited Time Offer

25%

Off

Get Premium PT0-002 Questions as Interactive Web-Based Practice Test or PDF

Contribute your Thoughts:

Submit Cancel

Currently there are no comments in this discussion, be the first to comment!