Skip to main content

Posts

All about Reverse Engineering

  What is Reverse Engineering? Reverse engineering is the process of deconstructing an existing product, software, or system to understand its components, functionality, and design without prior access to its source code or blueprints. This technique is widely used to gain insight into proprietary systems, uncover hidden vulnerabilities, understand malware, or improve compatibility and interoperability between systems. When is Reverse Engineering Used? Reverse engineering is applied in various scenarios: Cybersecurity Analysis : To analyze and understand malware, identify vulnerabilities, or create patches for known security issues. Software Interoperability : When building compatible software, developers reverse engineer APIs or protocols to enable communication between systems. Legacy Software Maintenance : In cases where the source code is lost or outdated, reverse engineering allows developers to understand and extend older software. Intellectual Property Research : Reverse eng...

āĻĄোāĻĒাāĻŽিāύ āĻŦাāĻĄ়াāύোāϰ āωāĻĒাāϝ়, āĻ•েāύ āφāĻŽাāĻĻেāϰ āĻĄোāĻĒাāĻŽিāύ āύāϤুāύ āĻ•িāĻ›ু āĻļিāĻ–াāϰ āĻ•্āώেāϤ্āϰে āĻ—ুāϰুāϤ্āĻŦāĻĒূāϰ্āĻŖ

āφāĻŽাāĻĻেāϰ āĻ…āύুāĻ­ূāϤি, āĻŽোāϟিāĻ­েāĻļāύ āĻāĻŦং āύāϤুāύ āĻĻāĻ•্āώāϤা āĻ…āϰ্āϜāύেāϰ āĻ•্āώেāϤ্āϰে āĻĄোāĻĒাāĻŽিāύেāϰ āĻĒ্āϰāĻ­াāĻŦ āĻŦেāĻļ āĻ—āĻ­ীāϰ। āϝāĻ–āύ āφāĻŽāϰা āύāϤুāύ āĻ•িāĻ›ু āĻļিāĻ–ি āĻŦা āĻĻāĻ•্āώāϤা āĻ…āϰ্āϜāύেāϰ āĻĒāĻĨে āϏāĻĢāϞāϤা āĻĒাāχ, āϤāĻ–āύ āĻŽāϏ্āϤিāώ্āĻ• āĻĄোāĻĒাāĻŽিāύ āύিঃāϏāϰāĻŖ āĻ•āϰে, āϝা āφāĻŽাāĻĻেāϰ āφāϤ্āĻŽāĻŦিāĻļ্āĻŦাāϏ āĻāĻŦং āĻļেāĻ–াāϰ āϜāύ্āϝ āφāĻ—্āϰāĻš āĻŦাāĻĄ়িāϝ়ে āĻĻেāϝ়। āĻāχ āĻ•াāϰāĻŖে, āύāϤুāύ āĻ•িāĻ›ু āĻļেāĻ–াāϰ āϏāĻŽāϝ় āĻĄোāĻĒাāĻŽিāύেāϰ āϏ্āϤāϰ āĻŦৃāĻĻ্āϧি āĻĒাāĻ“āϝ়া āφāĻŽাāĻĻেāϰāĻ•ে āφāϰāĻ“ āĻŦেāĻļি āĻ‰ā§ŽāϏাāĻšী āĻāĻŦং āωāĻĻ্āĻĻীāĻĒ্āϤ āĻ•āϰে। āϝāĻ–āύ āφāĻŽāϰা āĻāĻ•āϟি āύāϤুāύ āĻ•িāĻ›ু āĻļিāĻ–āϤে āĻļুāϰু āĻ•āϰি āĻāĻŦং āĻ•িāĻ›ুāϟা āϏāĻĢāϞ āĻšāχ, āϤāĻ–āύ āĻĄোāĻĒাāĻŽিāύ āφāĻŽাāĻĻেāϰ āĻŽāϧ্āϝে āϏাāĻĢāϞ্āϝেāϰ āĻāĻ•āϟি āĻ…āύুāĻ­ূāϤি āϤৈāϰি āĻ•āϰে। āĻāχ āĻ…āύুāĻ­ূāϤি āφāĻŽাāĻĻেāϰ āφāϰāĻ“ āĻ•āĻ োāϰ āĻĒāϰিāĻļ্āϰāĻŽ āĻ•āϰāϤে āĻāĻŦং āĻļেāĻ–াāϰ āĻĒ্āϰāĻ•্āϰিāϝ়াāϝ় āφāϰāĻ“ āφāĻ—্āϰāĻšী āĻ•āϰে āϤোāϞে। āĻāϟি āφāĻŽাāĻĻেāϰ āĻŽāϧ্āϝে āχāϤিāĻŦাāϚāĻ• āĻāĻ•āϟি āϚāĻ•্āϰ āϤৈāϰি āĻ•āϰে, āϝেāĻ–াāύে āφāĻŽāϰা āφāϰāĻ“ āĻŦেāĻļি āϚেāώ্āϟা āĻ•āϰি, āϝা āφāĻŽাāĻĻেāϰ āϏাāĻĢāϞ্āϝেāϰ āĻĻিāĻ•ে āύিāϝ়ে āϝাāϝ়। āύāϤুāύ āĻ•িāĻ›ু āĻļিāĻ–āϤে āĻ—ি⧟ে āϝāĻĻি āφāĻŽāϰা āĻšāϤাāĻļ āĻšāχ āĻŦা āĻĒিāĻ›ি⧟ে āĻĒ⧜ি, āϤāĻŦে āĻĄোāĻĒাāĻŽিāύ āφāĻŽাāĻĻেāϰ āϏেāχ āύেāϤিāĻŦাāϚāĻ• āφāĻŦেāĻ—েāϰ āĻĒ্āϰāĻ­াāĻŦāĻ•ে āĻ•āĻŽিāϝ়ে āĻĻেāϝ়। āĻāϟি āφāĻŽাāĻĻেāϰ āĻŽāύোāĻ­াāĻŦāĻ•ে āχāϤিāĻŦাāϚāĻ• āϰাāĻ–āϤে āϏāĻšাāϝ়āϤা āĻ•āϰে, āϝা āĻļেāĻ–াāϰ āĻĒ্āϰāĻ•্āϰিāϝ়াāĻ•ে āĻ…āĻŦ্āϝাāĻšāϤ āϰাāĻ–āϤে āϏাāĻšাāϝ্āϝ āĻ•āϰে। āĻĄোāĻĒাāĻŽিāύ āφāĻŽাāĻĻেāϰ āĻŽāϏ্āϤিāώ্āĻ•ে āύিāωāϰাāϞ āϏংāϝোāĻ— āϤৈāϰি āĻ•āϰāϤে āϏāĻšাāϝ়āϤা āĻ•āϰে। āϝāĻ–āύ āφāĻŽāϰা āύāϤুāύ āĻ•িāĻ›ু āĻļেāĻ–াāϰ āϚেāώ্āϟা āĻ•āϰি, āϤāĻ–āύ āĻĄোāĻĒাāĻŽিāύ āφāĻŽাāĻĻেāϰ āĻļেāĻ–াāϰ āĻ…āĻ­িāϜ্āĻžāϤাāĻ•ে āφāϰāĻ“ āϏāĻšāϜ...

āχāϏāϞাāĻŽে āϏ্āĻŦāĻĒ্āύেāϰ āĻŦ্āϝাāĻ–্āϝা āύি⧟ে āĻ•িāĻ›ু āĻšাāĻĻিāϏ āĻāĻŦং āĻ•োāϰāφāύেāϰ āĻŦিāĻ­িāύ্āύ āĻĒ্āϰāϏāĻ™্āĻ— āϰ⧟েāĻ›ে। āĻāĻ–াāύে āĻ•ā§ŸেāĻ•āϟি āĻ—ুāϰুāϤ্āĻŦāĻĒূāϰ্āĻŖ āĻšাāĻĻিāϏেāϰ āϰেāĻĢাāϰেāύ্āϏ āĻāĻŦং āĻ•োāϰāφāύেāϰ āϰেāĻĢাāϰেāύ্āϏ āĻĻেāĻ“ā§Ÿা āĻšāϞো

  āχāϏāϞাāĻŽে āϏ্āĻŦāĻĒ্āύেāϰ āĻŦ্āϝাāĻ–্āϝা āύি⧟ে āĻ•িāĻ›ু āĻšাāĻĻিāϏ āĻāĻŦং āĻ•োāϰāφāύেāϰ āĻŦিāĻ­িāύ্āύ āĻĒ্āϰāϏāĻ™্āĻ— āϰ⧟েāĻ›ে। āĻāĻ–াāύে āĻ•ā§ŸেāĻ•āϟি āĻ—ুāϰুāϤ্āĻŦāĻĒূāϰ্āĻŖ āĻšাāĻĻিāϏেāϰ āϰেāĻĢাāϰেāύ্āϏ āĻāĻŦং āĻ•োāϰāφāύেāϰ āϰেāĻĢাāϰেāύ্āϏ āĻĻেāĻ“ā§Ÿা āĻšāϞো: ā§§. āĻ­াāϞো āϏ্āĻŦāĻĒ্āύ āφāϞ্āϞাāĻšāϰ āĻĒāĻ•্āώ āĻĨেāĻ•ে āĻšাāĻĻিāϏে āĻŦāϞা āĻšā§ŸেāĻ›ে, āĻ­াāϞো āϏ্āĻŦāĻĒ্āύāĻ•ে āφāϞ্āϞাāĻšāϰ āĻĒāĻ•্āώ āĻĨেāĻ•ে āĻāĻ•āϟি āϏুāϏংāĻŦাāĻĻ āĻšিāϏেāĻŦে āĻĻেāĻ–া āĻšā§Ÿ। āĻāϟি āĻŦিāĻļ্āĻŦাāϏীāĻĻেāϰ āϜāύ্āϝ āϏাāύ্āϤ্āĻŦāύাāϰ āĻāĻ•āϟি āĻ‰ā§ŽāϏ āĻšāϤে āĻĒাāϰে। āĻĒ্āϰিāϝ় āύāĻŦী āĻŽুāĻšাāĻŽ্āĻŽāĻĻ (āϏা.) āĻŦāϞেāĻ›েāύ: "āĻ¸ā§Ž āϏ্āĻŦāĻĒ্āύ āφāϞ্āϞাāĻšāϰ āĻĒāĻ•্āώ āĻĨেāĻ•ে āĻāĻŦং āĻ–াāϰাāĻĒ āϏ্āĻŦāĻĒ্āύ āĻļāϝ়āϤাāύেāϰ āĻĒāĻ•্āώ āĻĨেāĻ•ে।" āϏāĻšীāĻš āĻŦুāĻ–াāϰি, āĻšাāĻĻিāϏ āύāĻŽ্āĻŦāϰ ā§­ā§Ļā§Ēā§Ē āφāϰেāĻ•āϟি āĻšাāĻĻিāϏে āωāϞ্āϞেāĻ– āφāĻ›ে: "āϝāĻ–āύ āϤোāĻŽাāĻĻেāϰ āĻ•েāω āĻ•োāύো āĻ­াāϞো āϏ্āĻŦāĻĒ্āύ āĻĻেāĻ–ে, āϏে āϝেāύ āφāϞ্āϞাāĻšāϰ āĻĒ্āϰāĻļংāϏা āĻ•āϰে āĻāĻŦং āϏে āϏ্āĻŦāĻĒ্āύেāϰ āĻ•āĻĨা āĻ…āύ্āϝāĻĻেāϰ āϜাāύা⧟। āφāϰ āϝāĻ–āύ āϏে āĻ•োāύো āĻ–াāϰাāĻĒ āϏ্āĻŦāĻĒ্āύ āĻĻেāĻ–ে, āϏে āϝেāύ āφāϞ্āϞাāĻšāϰ āĻ•াāĻ›ে āĻļāϝ়āϤাāύেāϰ āĻ…āύিāώ্āϟ āĻĨেāĻ•ে āφāĻļ্āϰāϝ় āĻĒ্āϰাāϰ্āĻĨāύা āĻ•āϰে āĻāĻŦং āϏে āϏ্āĻŦāĻĒ্āύ āϏāĻŽ্āĻĒāϰ্āĻ•ে āĻ•াāωāĻ•ে āύা āϜাāύাāϝ়।" āϏāĻšীāĻš āĻŦুāĻ–াāϰি, āĻšাāĻĻিāϏ āύāĻŽ্āĻŦāϰ ā§Ŧā§¯ā§Žā§Ģ ⧍. āĻ–াāϰাāĻĒ āϏ্āĻŦāĻĒ্āύ āĻļāϝ়āϤাāύেāϰ āĻĒ্āϰāϰোāϚāύা āĻ–াāϰাāĻĒ āϏ্āĻŦāĻĒ্āύ āϏāĻŽ্āĻĒāϰ্āĻ•ে āχāϏāϞাāĻŽে āĻŦāϞা āĻšāϝ়েāĻ›ে, āĻāĻ—ুāϞো āĻļāϝ়āϤাāύেāϰ āĻĒ্āϰāϰোāϚāύা, āϝা āφāĻŽাāĻĻেāϰ āϚিāύ্āϤা āĻāĻŦং āĻŽāύেāϰ āĻ…āĻļাāύ্āϤি āϏৃāώ্āϟি āĻ•āϰāϤে āĻĒাāϰে। āĻĒ্āϰিāϝ় āύāĻŦী (āϏা.) āĻŦāϞেāĻ›েāύ: "āϝāĻ–āύ āĻ•েāω āĻ–াāϰাāĻĒ āϏ্āĻŦāĻĒ্āύ āĻĻেāĻ–ে, āϏে āϝেāύ āĻŦাāĻŽ āĻĻিāĻ•ে āϤিāύāĻŦাāϰ āĻĨুāϤ...

āϏ্āĻŦāĻĒ্āύ āĻ•ি āϏāϤ্āϝি āĻšā§Ÿ?

  āϏ্āĻŦāĻĒ্āύ āĻ•ি āϏāϤ্āϝি āĻšā§Ÿ? āϏ্āĻŦāĻĒ্āύেāϰ āϏāϤ্āϝāϤা āϏāĻŽ্āĻĒāϰ্āĻ•ে āĻ•িāĻ›ু āϏাāϧাāϰāĻŖ āϧাāϰāĻŖা āĻ“ āĻŦ্āϝাāĻ–্āϝা āφāĻ›ে: ā§§. āĻŽāύāϏ্āϤাāϤ্āϤ্āĻŦিāĻ• āĻŦ্āϝাāĻ–্āϝা āϏ্āĻŦāĻĒ্āύ āϏাāϧাāϰāĻŖāϤ āφāĻŽাāĻĻেāϰ āĻ…āĻŦāϚেāϤāύ āĻŽāύ āĻĨেāĻ•ে āωāĻĻ্āĻ­ূāϤ āĻšāϝ়। āĻāϟি āφāĻŽাāĻĻেāϰ āĻĻৈāύāύ্āĻĻিāύ āϜীāĻŦāύেāϰ āĻ…āĻ­িāϜ্āĻžāϤা, āϚিāύ্āϤা, āωāĻĻ্āĻŦেāĻ—, āφāĻļা āĻāĻŦং āĻ­āϝ়āĻ—ুāϞোāϰ āĻĒ্āϰāϤিāĻĢāϞāύ āĻšāϤে āĻĒাāϰে। āĻ āĻ•াāϰāĻŖে, āϏ্āĻŦāĻĒ্āύে āϝে āϘāϟāύাāϰ āĻĒ্āϰāϤিāϚ্āĻ›āĻŦি āĻĻেāĻ–া āϝাāϝ়, āϤা āĻ•āĻ–āύāĻ“ āĻ•āĻ–āύāĻ“ āĻŦাāϏ্āϤāĻŦেāϰ āϏাāĻĨে āĻŽিāϞে āϝেāϤে āĻĒাāϰে। āϤāĻŦে, āĻāϟি āϏāϰাāϏāϰি āĻ­āĻŦিāώ্āϝāĻĻ্āĻŦাāĻŖী āύāϝ়, āĻŦāϰং āĻŽāύেāϰ āĻ•াāϜেāϰ āĻāĻ•āϟি āĻĒ্āϰāĻ•্āϰিāϝ়া। ⧍. āĻŦৈāϜ্āĻžাāύিāĻ• āĻĻৃāώ্āϟিāĻ•োāĻŖ āĻŦিāϜ্āĻžাāύীāϰা āĻŦāϞেāύ, āϏ্āĻŦāĻĒ্āύ āĻšāϚ্āĻ›ে āĻŽāϏ্āϤিāώ্āĻ•েāϰ āĻ—āĻ­ীāϰ āĻ•াāϰ্āϝāĻ•āϞাāĻĒেāϰ āĻĢāϞাāĻĢāϞ, āϝা āϏাāϧাāϰāĻŖāϤ āφāĻŽাāĻĻেāϰ āϚিāύ্āϤা āĻāĻŦং āφāĻŦেāĻ—েāϰ āϏাāĻĨে āϏāĻŽ্āĻĒāϰ্āĻ•িāϤ। āĻāϟি āφāĻŽাāĻĻেāϰ āĻĻৈāύāύ্āĻĻিāύ āĻ…āĻ­িāϜ্āĻžāϤা āĻĨেāĻ•ে āύেāĻ“āϝ়া āĻ…āύুāĻ­ূāϤি āĻāĻŦং āϤāĻĨ্āϝেāϰ āĻĒ্āϰāϏেāϏিংāϝ়েāϰ āϏāĻŽāϝ় āϘāϟে। āϏ্āĻŦāĻĒ্āύ āĻ­āĻŦিāώ্āϝāϤেāϰ āχāĻ™্āĻ—িāϤ āĻĻেāϝ় āύা, āϤāĻŦে āĻ•āĻ–āύāĻ“ āĻ•āĻ–āύāĻ“ āφāĻŽাāĻĻেāϰ āĻ…āĻŦāϚেāϤāύ āĻŽāύ āϜীāĻŦāύেāϰ āϚāϞāĻŽাāύ āĻĒ্āϰāĻŦāĻŖāϤাāĻ—ুāϞোāĻ•ে āĻŦিāĻļ্āϞেāώāĻŖ āĻ•āϰে āĻāĻŦং āϏেāχ āĻ­িāϤ্āϤিāϤে āĻ•িāĻ›ু āϘāϟāύাāϰ āĻĒূāϰ্āĻŦাāĻ­াāϏ āĻĻিāϤে āĻĒাāϰে, āϝা āĻŽāύে āĻšāϤে āĻĒাāϰে āϏ্āĻŦāĻĒ্āύ "āϏāϤ্āϝি" āĻšāϝ়েāĻ›ে। ā§Š. āφāϧ্āϝাāϤ্āĻŽিāĻ• āĻŦা āϧāϰ্āĻŽীāϝ় āĻŦিāĻļ্āĻŦাāϏ āĻ…āύেāĻ• āϧāϰ্āĻŽ āĻ“ āφāϧ্āϝাāϤ্āĻŽিāĻ• āĻŦিāĻļ্āĻŦাāϏে āĻŦāϞা āĻšāϝ় āϝে, āĻ•িāĻ›ু āϏ্āĻŦāĻĒ্āύ āĻ­āĻŦিāώ্āϝāϤেāϰ āχāĻ™্āĻ—িāϤ āĻĻেāϝ় āĻŦা āĻŦিāĻļেāώ āĻŦাāϰ্āϤা āĻŦāĻšāύ āĻ•āϰে। āχāϏāϞাāĻŽিāĻ• āĻŦিāĻļ্āĻŦাāϏে āϝেāĻŽāύ āωāϞ্āϞেāĻ– āφāĻ›ে āϝে, ...

Which of the following is the key of a relation schema question

  Question: Which of the following is the key of a relation schema R = (M, N, O, P, S, T), when R has the functional dependencies shown below?    O → T  S → M  OS → P  M → N  a) MO           b) MS         c) OP         d) OS Explanation:  To determine the key of the relation schema R = ( M , N , O , P , S , T )  given the functional dependencies, we need to figure out the minimal set of attributes that can determine all the attributes of the relation. This minimal set is the candidate key . Functional Dependencies: O → T O S → M S   O S → P OS M → N M  Step 1: Identify which attributes can be derived From O → T , if we have O , we can determine T . From S → M , if we have S , we can determine M . From M → N , if we know M , we can determine N . From O S → P , if we know both O and S , we can determine P . Step 2: Determine the closure of attri...

pre-order traversal of the tree

 Which of the following is the pre-order traversal of the tree below? Explanation: Pre-order traversal of a tree is a type of depth-first traversal where the nodes of the tree are visited in the following order: Visit the root node first . Traverse the left subtree recursively using pre-order. Traverse the right subtree recursively using pre-order. In simple terms, the pre-order traversal visits the root before its child nodes. The general process is summarized as: Root → Left → Right Example: Consider the following binary tree: 1 / \ 2 3 / \ 4 5 The pre-order traversal would visit the nodes in this order: 1 → 2 → 4 → 5 → 3

The operations for a queue

The operations for a queue are defined as below.   ENQ n: This operation appends data n to the queue.   DEQ: This operation removes data from the queue.   On an empty queue, the operations ENQ 1, ENQ 2, ENQ 3, DEQ, ENQ 4, ENQ 5, DEQ, ENQ 6, DEQ, DEQ are performed. After that, when DEQ is performed, what is the value that is removed? Explanation: Let's walk through the operations step by step on an empty queue. ENQ 1 : Queue = [1] ENQ 2 : Queue = [1, 2] ENQ 3 : Queue = [1, 2, 3] DEQ : Removes 1 → Queue = [2, 3] ENQ 4 : Queue = [2, 3, 4] ENQ 5 : Queue = [2, 3, 4, 5] DEQ : Removes 2 → Queue = [3, 4, 5] ENQ 6 : Queue = [3, 4, 5, 6] DEQ : Removes 3 → Queue = [4, 5, 6] DEQ : Removes 4 → Queue = [5, 6] Now, when the next DEQ is performed, the value that is removed is 5 . So, the value removed by the next DEQ is 5 .