Addresses with 0x at the beginning [closed] - memory-address

It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.
Closed 11 years ago.
In some kind of applications that I used to "change" something in the executable files requires a proper addresses with the 0x in the beginning. For example: 0x2FF0C4.
The question is, what are those addresse and how can I get them?
I've searched a lot before creating this question, but the address phrase in the search engines provides large amount of records, because I don't know the way, how can I 'name' it.
I guess it's some kind of memory address ?

Can't beat Rouhani's simple answer but here's a little more information on memory addresses:
"Addresses" on computers are usually assumed to be "memory addresses" that identify locations on RAM. By convention, locations on RAM are denoted by hexadecimal because they are commonly encountered in powers of two i.e. pages; thus, it's arithmetic is easier with hexadecimal.
Edit: I realized that you answered your own question.

Related

Algorithm to find where exactly two strings match/differ [closed]

It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.
Closed 9 years ago.
I am working on finding the similarity/differences in the source code of different java programs.
I've used an implementation of the Levenshtein algorithm to find how similar two programs are.
I want to know if there is any algorithm that can help in finding the exact positions where two strings differ.
You will find more than you ever wanted to know by looking at the inner workings of diff - see for example this link or simply the wiki article

How do I create a PSP emulator? [closed]

It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.
Closed 10 years ago.
I know that I need to know at least C and Assembly. In your own opinion what else does one need to know apart from knowing how to program in C and Assembly efficiently? Are there any books you can suggest to get me started? I also read that you need to know about the hardware architecture of the platform you are emulating. Would you also recommend the books listed here?
For experts only
You would have to know all the inner workings and hardware details of PSP, which are business secrets of Sony and therefore not published. The way most emulators are made is reverse engineering, a process in which the device itself is disassembled and its inner workings are studied. That includes analyzing the chips thoroughly, reading the contents of ROM chips and sometimes even deciphering encrypted data. Full analysis usually requires specialized equipment and years of engineering experience.

Data structure for content based search [closed]

It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.
Closed 10 years ago.
I am implementing a virtual file system. As part of it, i am trying to add the content based search feature to it.
Basically content based search feature allows user to search for a "word" and the system returns all the file names which contain the "word" in their content.
In my view trie would serve my purpose. But it is not space efficient and while constructing it, it seems i need to populate wit with all the words from the entire content.
Please suggest me with a better get around solution.
Patricia tries could be a little more space efficient than the normal tries. Check if they might serve your purpose although I am not very sure.

Parallel computing in image processing? [closed]

It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.
Closed 10 years ago.
Can anybody give me some examples and brief explanation of parallel computing in image processing (that could make use of CUDA kernels on an Nvdia GPU) ? For example with regards to pixels my perception so far is that the image could be split into smaller sections and same process applied to those sections to build the overall objective, but is there more to it than that? Also how would that be achieved in terms of programming?
Check this : http://supercomputingblog.com/cuda/intro-to-image-processing-with-cuda/
The linked page contains direct answers to your questions, and example code for a quick start.

Const compiler/runtime [closed]

It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.
Closed 11 years ago.
How are treated constants in various languages/compilers? They take up space in RAM in runtime or are replaced with their values ​​at compile time?
A compiler is free to go either way. The typical way to handle this is to use scalars directly while keeping larger objects like arrays in memory.
In addition, if you build an embedded system, they typically go into read-only memory like flash rather than RAM.

Resources