[algogeeks] Suggest a solution using BFS
i have been trying this problem first i brute forced it and i was right using brute force but can someone suggest a BFS solution to the problem http://uva.onlinejudge.org/index.php?option=com_onlinejudgeItemid=8category=6page=show_problemproblem=347 suggest something better than brute force -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Suggest a solution using BFS
please suggest a solution for this problem using BFS i m nt able to get how we apply bfs here though brute force would do http://uva.onlinejudge.org/index.php?option=com_onlinejudgeItemid=8category=6 thnxx in advance please explain in detail so that i become able to tackle such problems in future -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: Suggest a solution using BFS
Since there are no more than 83681 unique words (and there are only 5letters words), the simplest approach is using recursive function for words generation (similar to DFS). At each step add new letter which is greater than the last added (last letter in the word). Also it can be done using BFS in the same fashion. After you've generated all words. put them into a dicitonary (set) for the fast searching. P.S. you may use also 5 nested FOR statements for the letters to add. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Count number of digits
How can i count the number of digits 0s,1s,2s,3s,... 9s in a number n for example if n=33902 number of 0s=1 number of 3s=2 number of 9s=1 number of 2s=1 -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Count number of digits
Mod 10 and divide by 10 to get each digit and then hash that digit to an array and add one to the array entry. Array from 0 to 9 and initialize to each array value 0. Sent from my BlackBerry -Original Message- From: rgap rgap...@gmail.com Sender: algogeeks@googlegroups.com Date: Tue, 18 Jan 2011 03:31:12 To: Algorithm Geeksalgogeeks@googlegroups.com Reply-To: algogeeks@googlegroups.com Subject: [algogeeks] Count number of digits How can i count the number of digits 0s,1s,2s,3s,... 9s in a number n for example if n=33902 number of 0s=1 number of 3s=2 number of 9s=1 number of 2s=1 -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Count number of digits
If the number is larger that 64 bits then treat it as a string but do the same thing apart from mod 10 divide bt 10. Sent from my BlackBerry -Original Message- From: rgap rgap...@gmail.com Sender: algogeeks@googlegroups.com Date: Tue, 18 Jan 2011 03:31:12 To: Algorithm Geeksalgogeeks@googlegroups.com Reply-To: algogeeks@googlegroups.com Subject: [algogeeks] Count number of digits How can i count the number of digits 0s,1s,2s,3s,... 9s in a number n for example if n=33902 number of 0s=1 number of 3s=2 number of 9s=1 number of 2s=1 -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: Count number of digits
This code prints the number of digits 0,1,2,... 9sbetween A and B
How does it works?
#include iostream
using namespace std;
int pot10(int i) {
int n = 1;
while (i--) n *= 10;
return n;
}
int digits(int n, int d) {
if (n 10 n d - 1) return d ? 1 : 0;
int s = 0, r = 0, i = 1;
int p = pot10(i);
while (n / (p / 10) = 1) {
if (!d) s -= 1 * (p / 10);
if ((n % p) ((d + 1) * (p / 10) - 2)) {
s += (n / p + 1) * p / 10;
r = 0;
} else {
r = (n % p)(d * (p / 10) - 2) ? (n % p)-(d * (p / 10) -
2) - 1 : 0;
s += (n / p) * (p / 10) + r;
}
i++;
p = pot10(i);
}
return s;
}
int main() {
int A, B, a, b, i;
while (cin A B, A, B) {
for (i = 0; i 9; i++) {
a = digits(A - 1, i);
b = digits(B, i);
cout b - a ;
}
a = digits(A - 1, i);
b = digits(B, i);
cout b - a endl;
}
return 0;
}
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: Hellof Friends. Regarding Microsoft Internship test
Thanks for the replies @Sunny Last year when they came to our college, they also asked questions relating to Operating Systems and Database. Did you forgot to mention it or is MS avoiding such questions now? Regards Rahul -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: Google
there will be 1 or 2 rounds of telephonic interviews. How and what to prepare for that? -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Google
hi guys, Google is coming in my college for internship. Apart from general algorithmic questions, can someone please tell me are there any specific areas from where google mostly asks questions. I will appreciate any advice regarding how to prepare for Google. -- Harshal -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: Count number of digits
digits(n, d) - returns how many times digit d is in the numbers [0, n]. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Hellof Friends. Regarding Microsoft Internship test
from last 2 years they haven't asked questions on OS in written. it depends if written contains objective type questions also, OS may also be there -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Hellof Friends. Regarding Microsoft Internship test
from last 2 years i mean from last 2 years @IIT Roorkee On Tue, Jan 18, 2011 at 6:12 PM, sunny agrawal sunny816.i...@gmail.comwrote: from last 2 years they haven't asked questions on OS in written. it depends if written contains objective type questions also, OS may also be there -- Sunny Aggrawal B-Tech IV year,CSI Indian Institute Of Technology,Roorkee -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Google
wch college u are in ? -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] C++ MCQs
Q1) How to declare a multidimensional array using new operator ?? Q2) What's the use of virtual friend function ? Give egs. Q3) What's the order of construction of objects for a class Derived which - contains an object of class Data1 , inherits a class Base1 and then inherits virtual base class Base2 . And why ?? Q4) Is there any data member which can be initialized using initialization list but the same can't be done using constructor body ?? Q5) Why should we avoid throwing exceptions from destructor ? -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Google
nitk On Tue, Jan 18, 2011 at 6:36 PM, shubham singh shubhamsisodia0...@gmail.com wrote: wch college u are in ? -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com . For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] partition array
. There is an array, how will you partition that into two parts so that the sum of both the sub set is minimum -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: amazon c questn
@avpostnikov In my reply I meant TCHAR ( maybe it doesnt apply to the example given in the problem) when your project is being compiled as Unicode, the TCHAR would translate to wchar_t. If it is being compiled as ANSI/MBCS, it would translated to char Not always we explicitly use wchar_t. On Fri, Jan 14, 2011 at 12:44 PM, juver++ avpostni...@gmail.com wrote: @Harish You are wrong. It doesn't matter when it is Unicode or ASCII application. Size of the char type is ALWAYS 1 byte. To use unicode characters introduce wchar_t or something related. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com . For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] L values and r values
Do l values and r values hold any practical significance how do we find l and r values of things like \\*((A))\\ if A is an integer if A is an array of integers If A in itself is a reference -- Rahul K Rai rahulpossi...@gmail.com -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: google mcqs
Pipeline : Choice B : 165 ( this pipeline wastes 20 ns between last 2 stages for each item ) Scheduling : Choice B Ram : Choice B Synchronization : Choice B On Mon, Jan 17, 2011 at 10:01 AM, Bhavesh agrawal agr.bhav...@gmail.comwrote: On Mon, Jan 17, 2011 at 10:00 AM, Bhavesh agrawal agr.bhav...@gmail.comwrote: sry ,answer is a mistakingly written b. On Mon, Jan 17, 2011 at 9:58 AM, Sarma Tangirala tvssarma.ome...@gmail.com wrote: Are larger RAMs faster? I am so sure about that. Sent from my BlackBerry -- *From: * Bhavesh agrawal agr.bhav...@gmail.com *Sender: * algogeeks@googlegroups.com *Date: *Mon, 17 Jan 2011 09:36:20 +0530 *To: *algogeeks@googlegroups.com *ReplyTo: * algogeeks@googlegroups.com *Subject: *Re: [algogeeks] Re: google mcqs answer is b Increasing the RAM of a computer typically improves performance because: a. Virtual memory increases b. Larger RAMs are faster c. Fewer segmentation faults occur d. Fewer page faults occur -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com . For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com . For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com . For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Bit Manipulation
No. It can be applied to any positive number N.
The solution above splits the numbers by the least significant bit,
choose the group with missing number, and then drop the last bit and
continue.
In this way the set [0,N] is partitioned (almost) evenly into 2 groups:
{2k | k=0,1,...,N/2} and {2k+1 | k=0,1,...(N-1)/2}
and the one with missing number is no more than N/2 numbers.
So the total number of fetch_bit operations is no more than 2N.
On 2011-1-17 15:43, juver++ wrote:
@awesomeandroid
Your solution for Q1 is wrong. It can be applied only for such numbers
N = 2^k, so number should power of 2.
--
You received this message because you are subscribed to the Google
Groups Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google Groups Algorithm
Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] bfs doubt
Let G = (V, E) be a **, cONNECTED undirected graph. Give an O(V + E)-time algorithm to compute a path in G that traverses each edge in E exactly once in each direction. Describe how you can find your way out of a maze if you are given a large supply of pennies. from clrs -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Sites for Interview Questions
Hi, Can someone suggest good books/websites/blogs for interview related questions. thanks-- YS -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] bfs doubt
one possible solution can be that while storing the graph using adjacency lists u can associate a color variable with each edge so that u color the edge as u traverse it like if u want to check wether edge (u,v) has been traversed while traversing u's adjacecny list check wether (u,v) has been colored while scanning v's adjacency list or not if so then discard the edge as this operation will take O(1) time and there is a bound on the number of memory locations u check which is O(V+E) the time of the algorithm is O(V+E). the color variable is a single bit variable 0 or 1 correct me if i m wrong and to find a path out of a maze just find the exit point using BFS. all corrections are welcomes thnxx On Tue, Jan 18, 2011 at 12:06 AM, rahul rai raikra...@gmail.com wrote: Let G = (V, E) be a **, cONNECTED undirected graph. Give an O(V + E)-time algorithm to compute a path in G that traverses each edge in E exactly once in each direction. Describe how you can find your way out of a maze if you are given a large supply of pennies. from clrs -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com . For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: Google
thats cool i am from uptu google didnt visit here so no idea :D :D -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: bfs doubt
Path you mentioned to find is an Euler-path. It can be traversed during DFS. Here http://en.wikipedia.org/wiki/Eulerian_path is an algorithm. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: bfs doubt
However, Eulerian path traverses each edge (in one direction) exactly once. You may repeat the path in backward order. So you traverses edges in each directions once. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: partition array
Did you mean absolute difference between two subsets is minimal? -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: bfs doubt
I found that Euler's algo cannot be applied here. Please ignore my above posts. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: bfs doubt
But if we represent undirected edge (A, B) as (A-B) and (B-A) then after this problem can be reduced to searching Eulerian path -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Sites for Interview Questions
try http://www.careercup.com/ http://www.careercup.com/Thanks, rajiv. On Tue, Jan 18, 2011 at 7:57 AM, Yellow Sapphire pukhraj7...@gmail.comwrote: Hi, Can someone suggest good books/websites/blogs for interview related questions. thanks-- YS -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com . For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Thank You Rajeev Kumar -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: Sites for Interview Questions
http://code-forum.blogspot.com On Jan 19, 7:10 am, rajeev kumar rajeevprasa...@gmail.com wrote: tryhttp://www.careercup.com/ http://www.careercup.com/Thanks, rajiv. On Tue, Jan 18, 2011 at 7:57 AM, Yellow Sapphire pukhraj7...@gmail.comwrote: Hi, Can someone suggest good books/websites/blogs for interview related questions. thanks-- YS -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2Bunsubscribe@googlegroups .com . For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Thank You Rajeev Kumar -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Call for Papers: The 2011 International Conference on Computer Graphics and Virtual Reality (CGVR'11), USA, July 18-21, 2011
CALL FOR PAPERS CGVR'11 The 2011 International Conference on Computer Graphics and Virtual Reality Date and Location: July 18-21, 2011, USA http://www.world-academy-of-science.org/ Location: See the above web site for venue/city You are invited to submit a full paper for consideration. All accepted papers will be published in the CGVR conference proceedings (in printed book form; later, the proceedings will also be accessible online). Those interested in proposing workshops/sessions, should refer to the relevant sections that appear below. SCOPE: Topics of interest include, but are not limited to, the following: O Computer animation O Software tools for computer graphics O Rendering methods O Compression methods O Computational geometry O Fractal geometry and applications O Sound rendering technologies O Color and texture O Modeling techniques O Visualization O Surface modeling O Web 3D and applications O Machine architectures/engines for graphics and VR O Modeling of natural scenes and phenomena O Computer art and entertainment (including games) O Shadows, translucency and visibility O e-Learning applications and computer graphics O Illumination and reflection techniques O Interactive digital media O 3D reconstruction O Curves and meshes O Visual computing and graphics O Image data structures for computer graphics O Graphics algorithms and applications O Case studies and emerging technologies --- O Virtual environments O Virtual and augmented reality O Virtual humans and artificial life O Real-time collision detection algorithms O Immersive virtual reality O Virtual reality, visualization, and education O Interactive techniques O Learning and assessment based on virtual reality approaches O Virtual laboratories O Virtual reality tools/languages (X3D, Kinect, VRML, Java3D, OpenGL, ...) O Real-time rendering for VR O Emerging display technologies O Virtual reality techniques for behavioral and cognitive assessment O Simulation and virtual reality O Software tools for virtual reality O Human-computer interfaces O Multimodal display systems O Integration of virtual reality and multimedia O Haptic devices and techniques O Virtual reality and emerging applications USEFUL WEB LINKS: To see the DBLP list of accepted papers of CGVR 2009, go to: http://www.informatik.uni-trier.de/~ley/db/conf/cgvr/cgvr2009.html The DBLP list of accepted papers of CGVR 2010 will soon appear at: http://www.informatik.uni-trier.de/~ley/db/conf/cgvr/cgvr2010.html CGVR 2011 URL: http://www.world-academy-of-science.org/worldcomp11/ws/conferences/cgvr11 IMPORTANT DATES: March 10, 2011: Submission of papers (about 5 to 7 pages) April 03, 2011: Notification of acceptance (+/- two days) April 24, 2011: Final papers + Copyright/Consent + Registration July 18-21, 2011: The 2011 International Conference on Computer Graphics and Virtual Reality (CGVR'11) ACADEMIC CO-SPONSORS: Currently being prepared - The Academic sponsors of the last offering of CGVR (2010) included research labs and centers affiliated with (a partial list): University of California, Berkeley; University of Southern California; University of Texas at Austin; Harvard University, Cambridge, Massachusetts; Georgia Institute of Technology, Georgia; Emory University, Georgia; University of Minnesota; University of Iowa; University of North Dakota; NDSU-CIIT Green Computing Comm. Lab.; University of Siegen, Germany; UMIT, Austria; SECLAB (University of Naples Federico II + University of Naples Parthenope + Second University of Naples, Italy); National Institute for Health Research; World Academy of Biomedical Sciences and Technologies; Russian Academy of Sciences, Russia; International Society of Intelligent Biological Medicine (ISIBM); The International Council on Medical and Care Compunetics; Eastern Virginia Medical School the American College of Surgeons, USA. SUBMISSION OF PAPERS: Prospective authors are invited to submit their papers by uploading them to the evaluation web site at: http://world-comp.org Submissions must be uploaded by March 10, 2011 and they must be in either MS doc (but not docx) or pdf formats (about 5 to 7 pages - single space, font size of 10 to 12). All reasonable typesetting formats are acceptable (later, the authors of accepted papers will be asked to follow a particular typesetting format to prepare their final papers for publication.) Papers must not have been previously published or currently submitted for publication elsewhere. The first page of the paper should include: title of the paper, name, affiliation, postal address, and email address for each author. The first page should also identify the name of the Contact Author and a maximum of 5 topical keywords that would best represent the content of the paper. Finally,
Re: [algogeeks] Re: partition array
this could be solved by using dynamic programing (knapsack problem) On 1/19/2011 12:30 AM, juver++ wrote: Did you mean absolute difference between two subsets is minimal? -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Regards Aditya -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
Re: [algogeeks] Re: google mcqs
For RAM question I guess it's answer : A see -: http://www.computermemoryupgrade.net/memory-influence-on-performance.html On Mon, Jan 17, 2011 at 12:59 PM, Algoose chase harishp...@gmail.comwrote: Pipeline : Choice B : 165 ( this pipeline wastes 20 ns between last 2 stages for each item ) Scheduling : Choice B Ram : Choice B Synchronization : Choice B On Mon, Jan 17, 2011 at 10:01 AM, Bhavesh agrawal agr.bhav...@gmail.comwrote: On Mon, Jan 17, 2011 at 10:00 AM, Bhavesh agrawal agr.bhav...@gmail.comwrote: sry ,answer is a mistakingly written b. On Mon, Jan 17, 2011 at 9:58 AM, Sarma Tangirala tvssarma.ome...@gmail.com wrote: Are larger RAMs faster? I am so sure about that. Sent from my BlackBerry -- *From: * Bhavesh agrawal agr.bhav...@gmail.com *Sender: * algogeeks@googlegroups.com *Date: *Mon, 17 Jan 2011 09:36:20 +0530 *To: *algogeeks@googlegroups.com *ReplyTo: * algogeeks@googlegroups.com *Subject: *Re: [algogeeks] Re: google mcqs answer is b Increasing the RAM of a computer typically improves performance because: a. Virtual memory increases b. Larger RAMs are faster c. Fewer segmentation faults occur d. Fewer page faults occur -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com . For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com . For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com . For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups.com . For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- Pratik Kathalkar CoEP BTech IT 8149198343 -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Operating System
Does anyone has solution to Operating System by Galvin or by William Stallings ?? -- You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
