I'm looking to learn some theory about data/audio/video compression, and would be glad to get some recommendations. Online and print resources are both fine.
We have multiple threads calling add(obj) on an ArrayList.
My theory is that when add is called concurrently by two threads, that only one of the two objects being added is really added to the ArrayList. Is this plausable?
If so, how do you get around this? Use a synchronized collection like Vector?
This is kind of a philosophical question.
Basically people often ask if I am logging - and since I am not a full time programmer, but someone who programs often but is actually more of a requirements analyst, I don't know all the best practices.
I use Java a lot so I often do things like
System.out.println()
What's the difference in theory between the two? Ultimately aren't I also logging? Esp, if I prefix my comments with something like "ERROR:" or "WARN:" ?
hi,
I've just imported a Flex component into my project.
I have a theory question about importing.
all the imports statements in the component source files started with "com.subFolder.etc", but I have preferred to move the component folders into "componentName" and to replace all import statements as "componentName.com.subFolder.etc"
Is this ok ? Everything works perfectly, but I was wondering if the method is correct.
thanks
Hi all,
does anyone know if it is possible to do a file upload using the BITS protocoll? The protocol is HTML1.1, so in theory it should be possible.
Any ideas are appriciated.
Thanks,
. Ivar
Hi,
I've taken over a legacy application and I have the exe created. If I can configure the BDE then in theory it should be possible to run this. Someone indicated that Delphi needs to be installed in order for the app to run. I'm unsure of that - it doesn't quite make sense to me as there is an exe file. Any input from Delphi experts would be appreciated.
Roddy
Assuming I have extracted the CGPDFDictionaryRef from a PDF document using the iPhone SDK, how do I get the document's title from the dictionary? More generally, how can I get a list of the keywords for that dictionary? In theory I could ask the customer, but surely there must be some canonical keywords? Is there a list somewhere?
This is a simple question from algorithms theory. The difference between them is that in one case you count number of nodes and in other number of edges on the shortest path between root and concrete node. Which is which?
Hi,
After some serious googleing I found out that the RandomAccessFile-class is not thread-safe. Now I could use one semaphore to lock all reads and writes but I don't think that performs very well. In theory it should be possible to do multiple reads and one write at a time.
How can I do this in Java? Is it possible at all?
Thanks!
If you had the opportunity to take one computer science course now, and as a result significantly increase your knowledge in a subject area, what would it be? Undergraduate or graduate level.
Compilers? Distributed algorithms? Concurrency theory? Advanced operating systems?
Let me know why.
(Note that I appreciate this isn't a far fetched scenario - but time and inertia might be preventing people from taking the course or reading the book or whatever)
I've been banging my head on an issue and before I continue injuring myself some more, I'd like to confirm:
Is it possible to have a GCC project that uses libraries that are compiled with and without RTTI?
So, for example, I have project A (compiled without RTTI) that uses library B (compiled with RTTI) and library C (compiled without RTTI). In theory, is all that supposed to compile and link with no problems?
Has anyone ever had an incidence of downloading software from a genuine site, where an MD5 or SHA series hash for the download is also supplied and then discovered that the hash calculated from the downloaded artifact doesn't match the published hash?
I understand the theory but am curious how prevalent the problem is. Many software publishers seem to discount the threat.
I often read about dependency injection and I did research on google and I understand in theory what it can do and how it works, but I'd like to see an actual code base using it (Java/guice would be preferred).
Can anyone point me to an open source project, where I can see, how it's really used? I think browsing the code and seeing the whole setup shows me more than the ususal snippets in the introduction articles you find around the web. Thanks in advance!
How would I go about creating a cross-browser script, that would intercept all events firing on
a page/browser window/DOM-tree (regardless of browser)?
What I'm hoping to accomplish is basically to get a better understanding of the different handling
of events in different browsers; I know the basic theory, but need to see to believe...
This is common interview question (according to some interview sites) but I can find no normal answers in Internet - some are wrong and some point to complex theory I expect not looked for in interview (like Bressenham algorithm).
The question is simple:
The circle equation is: x^2 + y^2 =
R^2. Given R, draw 0,0-centered circle
as best as possible without using any
floating point (no trigo, square roots, and so on, only integers)
Basically I don't know from where to start, I need to add a line script for my application that is not so complicated, just to execute pre-defined commands, for instance:
command New Invoice -- create new invoice
command customer profile -- open customer form where cust id = CustID
command run End-Of-Day - run the end of day process
command scr 1020 -- open form id = 1020
How can I start?
I have no problem of recommending any third party components (parsers,evaluators,etc..).
whats missing is the basic structure no details, just a theory for implementation.
Thanks,
Objectberg
Hi,
What is a good book to learn about networking 'theory' (i.e. different layers: physical, tcp/ip, etc.). I don't want anything too technical -- just something so I can apply it to network programming.
Thanks.
I am trying to compare the current url in webView with a defined url say google.com
so in theory..
NSURLRequest *currentRequest = [webView request];
NSURL *currentURL = [currentRequest URL];
would give us our current url...
NSString *newurl = @"http://www.google.com";
this would give us the compared to defined url
while (!currentURL == newurl) {
//do whatever here because currentURL does not equal the newurl
}
This does not seem to work though.. solutions?
Is that possible? How is this done in theory? Would I simply make a very small buffer packet size and then delay the playback artificially? I assume that's the low-brain way? How could I do it in such a way that the sound is smooth and doesn't suck?
I'm not much into audio engineering, so please be easy on me. I'm receiving an audio file as input, and need to detect whether the speaker is male or female. Any ideas how to go about doing this?
I'm using php, but am open to using other languages, and don't mind learning a little bit of sound theory as long as the time is proportionate to the task.
Now that i have learned the theory of OOPS in good number of books , and practised a little.
Still i am not comfortable when i look into OOPS being applied in some of the Open Source projs.
Can someone suggest any problem / solution kind of book , or any resources , that covers OOPS end - end. (C# , Java preferably)
The original link of the problem is here: https://code.google.com/codejam/contest/90101/dashboard#s=p2&a=2
In simple words we need to find how many times the string S="welcome to code jam" appears as a sub-sequence of given string S, e.g.
S="welcome to code jam"
T="wweellccoommee to code qps jam"
I know the theory but not good at DP in practice. Would you please explain step-by-step process to solve this DP problem on example and why it works?
I know relational databases are based on set-theory, functional programming is based on lambda calculus, logic programming is based on logic (of course :)), and now that I think of it; I'm not sure if imperative and generic programming is based on any particular branch of mathematics either.
Before you stone me for being a heretic, There is a sort that proclaims to be O(1), called "Bead Sort" (http://en.wikipedia.org/wiki/Bead_sort) , however that is pure theory, when actually applied I found that it was actually O(N * M), which is pretty pathetic.
That said, Lets list out some of the fastest sorts, and their best case and worst case speed in Big O notation.
~~ FlySwat ~~