adplus-dvertising
frame-decoration

Question

What is the difference between linear sweep and recursive traversal disassemblers?

a.

Linear sweep disassemblers are easier to trick than recursive traversal disassemblers.

b.

Recursive traversal disassemblers are easier to trick than linear sweep disassemblers.

c.

Linear sweep disassemblers perform a recursive traversal on the code, while recursive traversal disassemblers contain specific heuristics that deal with complex code sequences.

d.

Recursive traversal disassemblers perform a recursive traversal on the code, while linear sweep disassemblers contain specific commands that inform the disassembler whether a certain byte is code or data.

Posted under Reverse Engineering

Answer: (a).Linear sweep disassemblers are easier to trick than recursive traversal disassemblers. Explanation:Linear sweep disassemblers are easier to trick than recursive traversal disassemblers because they do not have specific heuristics to deal with complex code sequences.

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. What is the difference between linear sweep and recursive traversal disassemblers?

Similar Questions

Discover Related MCQs

Q. Which disassemblers can properly disassemble code with opaque predicates?

Q. What is the purpose of the pseudorandom values in the macro?

Q. Why is the LINE macro used in the macro?

Q. What is the potential downside of using too many copies of this macro in a program?

Q. Are these techniques effective at deterring experienced and determined reversers from reversing or cracking an application?

Q. What is the recommended approach for implementing powerful antireversing techniques?

Q. What is code obfuscation?

Q. What is potency in code obfuscation?

Q. What is a deobfuscator?

Q. What is the primary goal of many obfuscators?

Q. What is the associated cost of an obfuscating transformation?

Q. What is the primary goal of code obfuscation?

Q. What is potency in the context of code obfuscation?

Q. What is the primary advantage of automatic code obfuscation?

Q. What are control flow transformations?

Q. What are computation transformations aimed at achieving?

Q. How do aggregation transformations affect the high-level structure of a program?

Q. What do ordering transformations do?

Q. What are opaque predicates?

Q. How can opaque predicates be used to confuse reversers and automated decompilation tools?