Yesterday I appeared for ACM USA Regionals, there I got the problem
https://icpc-qual-14.kattis.com/problems/flipfive
Can anyone help how to solve this kind of problem.
Any links for similar problems ?
--
You received this message because you are subscribed to the Google Groups
Algorithm
There is a Blank Paper Sheet, Given a list of characters and their sizes,
for ex. A, P, O, N, Q with different font sizes and designs.
Now we need to cut characters from given sheet of paper of all sizes
atleast once. And also try to maxmize number of characters cut. Along with
this, when you
Can u clear Round3 --- Qstn-3. the language is not cleared
On Wed, Jun 5, 2013 at 1:52 PM, sourabh jain wsour...@gmail.com wrote:
Round 1:
1.Design a Data Structure supporting 3 queries a)push b)pop c) find
minimum
Ans : Do it using Two Stacks . in first stack use it as normal stack.
@DAve
any proper reason or link to proof that at least twice can be solved using
greedy but others are not??
On Tue, May 28, 2013 at 12:41 PM, Shashwat Kumar
shashwatkmr@gmail.comwrote:
This seems to be Coin Change problem. Just google that.
On Tue, May 28, 2013 at 12:42 AM, Adolfo
You have a two dimensional array of size m*n. The
elements in the rows are sorted and every row has
unique elements means( in a row no two elements are same) but
the elements can repeat across the rows.
For example:
you have following 2-D array:
2 5 7 9 14 16
3 6 8 10 15 21
4 7 9 15 22 35
7 8 9 22
qstn src---
http://cm.baylor.edu/ICPCWiki/attach/Problem%20Resources/2008WorldFinalsProblemSet.pdf
the first problem
Problem A
Air Conditioning Machinery
I did it through backtracking but is there in other n good approach to
solve it. can DP be used??
Any Specific algorithm exists for
biku u also dere in this group... coool bro :)
--
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
#includeiostream.h
int rec(int i)
{
static int d=1;
if(i=5)
return i;
d=d+i;
i=i+i;
rec(d);
}
int main()
{
coutrec(1);
return 0;
}
various compilers give diffrent result... why so???
n how d value is calculated by differnt compilers.. whhat is d correct
output n which compiler to trust??
--
You
@atul
so 8 will be the answer or is it not fixed???
--
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
khalid mugal - A Programmers guide to Java certification
--
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
@atul
agreed with u dat it can be solved through hungarian method.. but what
about the condition a[i][i] entry is invalid
if all elements lie on diagonal n d sum is also maximum den a[i][i]
condition will be violated but Hungarian method still works
--
You received this message because you are
use quad tree
--
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
.
--
*Regards
*Ravi Maggon
Member Technical - IT/Front Office
D.E. Shaw Co.
--
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
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
*Ravi Maggon
, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
*Regards
*Ravi Maggon
Member Technical - IT/Front Office
D.E. Shaw Co.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
You are given many slabs each with a length and a breadth. A slab i can be
put on slab j if both dimensions of i are less than that of j. In this
similar manner, you can keep on putting slabs on each other. Find the
maximum stack possible which you can create out of the given slabs
and for
*Ravi Maggon
Member Technical - IT/Front Office
D.E. Shaw Co.
--
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
@all
they might use all the info n someone else can publish his book on
algorithm problems
--
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
one can modify dutch national flag algo for two colors(2 types positive n
negative)
--
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
for the beginners. It
covers the various aspects of cloud computing and virtualization and
services provided by all the major cloud providers in all the service
models like IaaS, PaaS SaaS. You
can find the the book here: http://www.amazon.com/dp/B0083TC47C
Be Well,
Ravi Shankar
--
You received this message
We have been given a deck of cards and each combination has a rating eg 3
As is higher than 2 As 1K etc.
Write an algorithm such that the probability of picking 3 or 5 or 7 cards
from the deck results in high rating
plzzz tell how to approach these kind of problems???
--
You received this
@wladimir
can u upsate the site in English???
--
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
Nice work yaari have added it .
Can you explain how do u make bolt.
On Sun, Mar 25, 2012 at 11:29 AM, amrit harry dabbcomput...@gmail.comwrote:
'slangdeco...@gmail.com'
--
-
Thanks and Regards
Ravi Mohan
Technical Field Officer(Information
@ if for a given number more than 1 answer exist then whats the answer???
--
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
@atul
two nodes were given in the qstn...
i did
1) calculate the level of one node through level order traversal similarly
for other
2) then find the Least Common Anscestor
3) then dist(LCS - node1) + dist(LCS - node2)
but i think this was not optimized bcse he was not very much satisfied
@atul
thanx dude..
yeah it is the soln...
i think in interview i quite tired thats why unable to think in this simle
way...
again thanx a lot atul and all other GEEKS :) :)
--
You received this message because you are subscribed to the Google Groups
Algorithm
@all
3 round liye
1.5 hours each only data structure n algorithm n 2 qstns from OS but
ultimately the code for synchronization(a mix situation of linked-list n
semaphore)
they asked linked list tree programs their variations(all to implement in C)
i stuck at this place when they tell me to
hey Geeks thanx a lot .. for the valuable information in the
discussions
i got selected in Yatra.com (R n D profile)
thanx a lot for the algorithms explained by to guys
THANX A LOT
:D:D:D:D
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
@all
same doubt qstn appears to be of binary tree DS
but the diagram given in between qstn is not like Binary tree so
sharing is there
so how sharing is done plz explain??
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this
|_|
|_| |_|
|_| |_| |_|
|_| |_| |_| |_|
|_| |_| |_| |_| |_|
Each cup has capacity C and once a cup gets full, it drops half extra
amount to left child and half extra amount to right child
for Eg : let' first cups get 2C amount of liquid then extra amount C(2C-C)
will be divided equally to left
#include stdio.h
#include stdlib.h
#define SIZEOF(arr) (sizeof(arr)/sizeof(arr[0]))
#define PrintInt(expr) printf(%s:%d\n,#expr,(expr))
int main(int argc, char *argv[])
{
/* The powers of 10 */
int pot[] = {
0001,
0010,
0100,
1000
};
@all
thanx for the explanation..
--
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
guys..
can u please refer me the best book for graph theory for algorithm
purpose
thanx
ravi
--
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
ravi
--
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
Implement a MS key suggest like tool where on typing the first letters will
give a list of words starting with the typed text. The corpus will be
provided as a text file. Max number of characters in a word is 10.
- Say you type 'i', it should provide 'include | if ' as the words in the
dropdown
@atul
true... :P:P:P:P
and definately linux will develop within a year after release of
windows95...:P
On Jan 30, 11:20 am, Karthikeyan V.B kartmu...@gmail.com wrote:
hi,
can anyone tell me how i can convert exe back to c source?
--
You received this message because you
its not possible to convert exe back to C.
u can get the assembly code of that only.
for that u can use the tool
IDA
or
olly debugger
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
i wanna write the spell check function
like when we put some word with spelling mistake then it tell the most
suitable word matching to it( green error line of spelling in MS-Word)
i used levenshtein distance algorithm to find the subset from the
dictionary
but it is a linear search... and
i m searching for the approach to solve. can u please tell the
approach instead of answer
--
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,
@all
it was said subset rectangle with max sum.
since every square is also a rectangle
for m*n take the square matrix of n*n (nm)
only m -n +1 options will have to comareuse backtracking to compare the
next column's sum to present
it will take O(n) time using backtracking..
please
An ant moves on a regular grid of squares that are coloured either black or
white.
The ant is always oriented in one of the cardinal directions (left, right,
up or down) and moves from square to adjacent square according to the
following rules:
- if it is on a black square, it flips the color of
*Problem 1: Number of Tilings, (K Narayan Kumar, CMI)*
You have to tile a room that is two units wide and *N* units long. You have
with you two types of tiles: a rectangle that is one unit wide and two
units long, and an L-shaped tile covering three square units. Here are
pictures of the two
Hey,
There is a basic Dp solution.
have two indexes. one at 0 and another at n-1(n is the length of the string)
let it be i and j
if(string[i]==string[j])
then do solve(i+1,j-1)
else
min(solve(i+1,j),solve(i,j-1);
--
Regards,
R.KARTHIKEYAN
BE CSE 3rd year,
Anna university,Chennai-600025.
@Luccifer:
Yes. It is the same!!
Regards,
R.KARTHIKEYAN
BE CSE 3rd year,
Anna university,Chennai-600025.
--
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
@ dave
what about the problem if it dsnt satisfy the 2 conditions(odd/even)
--
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
use eucleid algorithm to calculate HCF n den use
function
a * b = HCF*LCM
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
traversing the entire linklist one can determine the merge point
--
Ravi Ranjan Sinha
final yr
computer science
NIT Jalandhar
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
i got my mistake..
den how to fulfill all the conditions??
--
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
here conversion from derived to base class takes place
so finally only base class get called
output will be
baseClass Des called
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
ya
i tried it on dev c++ dats why i m telling..
--
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
Lets' say,
0i=3(n)
0j=5(m)
for(k=2 to n+m)
{
find_set_of(i,j) s.t. i+j =k
print all the matrix elements for (i,j);
}
Regards,
Ravi Shankar,
R D,
Cloud Life Cycle Management
HCL Comnet,
Noida,
Ph:995369
On Mon, Oct 3, 2011 at 8:32 PM, Hatta tmd...@gmail.com wrote:
Zig Zag gets
=en.
--
Regards
Ravi Maggon
B.E. CSE, Final Year
Thapar University
www.algorithmguru.com
*Failure is the opportunity to begin again more intelligently*
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email
in the first loop the value of k shuld vary from 0 to j-i.
On Oct 1, 7:26 am, rahul sharma rahul23111...@gmail.com wrote:
You are given two 32-bit numbers, N and M, and two bit positions, i and j.
Write a method to set all bits between i and j in N equal to M (e.g., M
becomes a substring of N
Hey can anyone tell me about the procedure and questions of Indus Valley
Partners??
--
Regards
Ravi Maggon
B.E. CSE, Final Year
Thapar University
www.algorithmguru.com
*Failure is the opportunity to begin again more intelligently*
--
You received this message because you are subscribed
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
Ravi Maggon
B.E. CSE, Final Year
Thapar University
www.algorithmguru.com
*Failure
/algogeeks?hl=en.
--
Regards
Ravi Maggon
B.E. CSE, Final Year
Thapar University
www.algorithmguru.com
*Failure is the opportunity to begin again more intelligently*
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email
.
--
Regards
Ravi Maggon
B.E. CSE, Final Year
Thapar University
www.algorithmguru.com
*Failure is the opportunity to begin again more intelligently*
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks
ohh sorry, I thought it was i=9. Yes only 9 times Hello will be printed.
On Thu, Sep 22, 2011 at 12:52 AM, Rashmi Jain rashmi.jain...@gmail.comwrote:
@ravi
can u plz explain how 10 processes are created..? shouldn't it be 9..??
On Thu, Sep 22, 2011 at 12:23 AM, ravi maggon maggonr
This is the output I am getting
-
result: Success time: 0smemory: 1720 kB returned value: 0
input: no
output:
HelloHelloHelloHelloHelloHelloHelloHelloHelloHello
On Thu, Sep 22, 2011 at 1:40 AM, teja bala pawanjalsa.t...@gmail.comwrote:
@ ravi but compile
..??
On Thu, Sep 22, 2011 at 1:52 AM, ravi maggon maggonr...@gmail.com
wrote:
This is the output I am getting
-
result: Success time: 0smemory: 1720 kB returned
value: 0
input: no
output
Did juniper visit any campus for training or job recruitment?
--
Regards
Ravi Maggon
B.E. CSE, Final Year
Thapar University
www.algorithmguru.com
*Failure is the opportunity to begin again more intelligently*
--
You received this message because you are subscribed to the Google Groups
Something like this was asked in written test of Tally. We had to find the
cause why this program crased during run time.
File *f;
int count=0;
if(f=fopen(file.txt,r))
{
while(f.get()!=EOF)
{
count++;
}
}
--
Regards
Ravi Maggon
B.E. CSE, Final Year
Thapar University
sorry fclose was also written in the last line. I missed it while asking.
On Wed, Sep 14, 2011 at 6:10 PM, abhinav gupta guptaabhinav...@gmail.comwrote:
file not closed.
On Wed, Sep 14, 2011 at 5:56 PM, ravi maggon maggonr...@gmail.com wrote:
Something like this was asked in written test
://groups.google.com/group/algogeeks?hl=en.
--
Regards
Ravi Maggon
B.E. CSE, Final Year
Thapar University
www.algorithmguru.com
*Failure is the opportunity to begin again more intelligently*
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
...@gmail.comwrote:
ravi can u please tell usa bout the written test what type of question
asked etc?
--
'Life can be filled with disappointment but being happy is a choice'
Manoj Bagari
National Institute Technology Kernataka
--
You received this message because you are subscribed
?hl=en.
--
Regards
Ravi Maggon
B.E. CSE, Final Year
Thapar University
www.algorithmguru.com
*Failure is the opportunity to begin again more intelligently*
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email
://groups.google.com/group/algogeeks?hl=en.
--
Regards
Ravi Maggon
B.E. CSE, Final Year
Thapar University
www.algorithmguru.com
*Failure is the opportunity to begin again more intelligently*
--
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
Ravi Maggon
B.E. CSE, Final Year
Thapar University
if you have to find only the repeated element, you can use the below
mentioned code.
for (int i = 1; i N; i++)
{
array[i] = array[i] ^ array[i-1] ^ i;
}
printf(Answer : %d\n, array[N-1]);
Thinking for the missing no.
On Sun, Sep 11, 2011 at 4:06 PM, ravi maggon maggonr...@gmail.com wrote
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
Ravi Maggon
B.E. CSE, Final Year
Thapar University
www.algorithmguru.com
Failure is the opportunity to begin again more
int bitcount (unsigned int n) {
int count = 0 ;
while (n) {
count++ ;
n = n (n - 1) ;
}
return count ;
}
On Sun, Sep 11, 2011 at 5:08 PM, ravi maggon maggonr...@gmail.com wrote:
I found this algo on
http://stackoverflow.com/questions/109023/best-algorithm-to-count
we have page table having 64 entries of 10 bits each. and page size is of
512 bytes.
tell the no of bits required for physical and logical address.
--
Regards
Ravi Maggon
Final Year, B.E. CSE
Thapar University
--
You received this message because you are subscribed to the Google Groups
if you don't know the size of stack and it grows during run time then which
data structure will you prefer for stack and why?
1. BST
2. Linked list
3. Arrays
4. Hash Tables
Asked in written test of informatica
--
Regards
Ravi Maggon
Final Year, B.E. CSE
Thapar University
--
You received
1. can recursive func be converted to iterative func always
Yes/No
is vice versa True/False
if False give the example.
2. can recursion be done without stack when converted to iterative sort of
thing or we need to implement our own stack?
--
Regards
Ravi Maggon
Final Year, B.E. CSE
Thapar
let their be two classes A and B having a virtual function.
class C derives both class A and B.
How many virtual table does class C have?
--
Regards
Ravi Maggon
Final Year, B.E. CSE
Thapar University
--
You received this message because you are subscribed to the Google Groups
Algorithm
What is the complexity of this code
for(i=0;in;i++)
{
for(j=0;ji*i;j++)
{
for(k=0;kj;k++)
}
}
1. O(n^3)
2. O(n^4)
3. O(n^5)
4. O(n^6)
--
Regards
Ravi Maggon
Final Year, B.E. CSE
Thapar University
--
You received this message because you are subscribed to the Google Groups
give some traversal other then pre,in and post order to print all elements
of tree?
Asked in informatica interview.
--
Regards
Ravi Maggon
Final Year, B.E. CSE
Thapar University
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
tell the out of the below code related to mutex and semaphore
process1
wait(mutex);
print 0
print 1
signal(mutex);
process2
wait(mutex)
print 1
print 0
signal(mutex)
--
Regards
Ravi Maggon
Final Year, B.E. CSE
Thapar University
--
You received this message because you are subscribed
can u elaborate its algo
On Sat, Sep 10, 2011 at 10:58 AM, Shravan Kumar shrava...@gmail.com wrote:
zigzag, level by level ?
On Sat, Sep 10, 2011 at 10:48 AM, ravi maggon maggonr...@gmail.comwrote:
give some traversal other then pre,in and post order to print all elements
of tree?
Asked
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
Ravi Maggon
Final Year, B.E. CSE
Thapar University
--
You received this message because you are subscribed to the Google
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
Ravi Maggon
Final Year, B.E. CSE
@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
Ravi Maggon
Final Year, B.E. CSE
Thapar University
--
You received this message because you
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
Ravi Maggon
Final Year, B.E. CSE
which is better Subquery or Join in sql and why?
--
Regards
Ravi Maggon
Final Year, B.E. CSE
Thapar University
--
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
for what reason?
On Thu, Sep 1, 2011 at 5:44 PM, sukran dhawan sukrandha...@gmail.comwrote:
subquery
On Thu, Sep 1, 2011 at 5:25 PM, ravi maggon maggonr...@gmail.com wrote:
which is better Subquery or Join in sql and why?
--
Regards
Ravi Maggon
Final Year, B.E. CSE
Thapar University
can any one tell me about the pattern of american express and the topics it
focus upon in written test and interview.
reply asap.
--
Regards
Ravi Maggon
Final Year, B.E. CSE
Thapar University
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group
.
--
Regards
Ravi Maggon
Final Year, B.E. CSE
Thapar University
--
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
What memory is allocated to a function, to a variable, to a object created
at run time using new or malloc and to a function containing a object with
run time memory allocation.
--
Regards
Ravi Maggon
Final Year, B.E. CSE
Thapar University
--
You received this message because you
but why the output coming in both of these codes is different?
On Wed, Aug 31, 2011 at 8:10 PM, rahul sharma rahul23111...@gmail.comwrote:
these two are same
On Aug 31, 7:36 pm, ravi maggon maggonr...@gmail.com wrote:
I check out the code:
#includestdio.h
main()
{
static int i
Can anyone tell me about this code
#include stdio.h
#include unistd.h
int main()
{
fork();
fork() fork() || fork();
fork();
printf(forked\n);
return 0;
}
The no. of processes spawned and its logic.
--
Regards
Ravi Maggon
Final Year, B.E. CSE
Thapar University
--
You
+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
Regards
Ravi Maggon
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks
One more ques asked was:
output of printf(%x,-l4);
where l can be any positive number.
On Tue, Aug 30, 2011 at 1:11 PM, ravi maggon maggonr...@gmail.com wrote:
@birju:
I am elaborating 2nd ques below:
let us suppose their is 2-d array say A[100][2];
here 100 signifies that their are 100
Can anyone give me reviews about The Smart Cube company and its placement
procedure.
What kind of work it has and is it better then Core IT companies for CSE
student
reply asap.
--
Regards
Ravi Maggon
Final Year, B.E. CSE
Thapar University
--
You received this message because you
;
class emp
{
public:
char *n;
int age;
};
int main ()
{
emp e={xyz,21};
emp e2;
e2=e;
printf(%d,e2.age);
system(pause);
}
--
Regards
Ravi Maggon
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group
class{
int bit1:1;
}
please explain the meaning of line 2.
--
Regards
Ravi Maggon
--
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
.
On Aug 28, 3:29 pm, ravi maggon maggonr...@gmail.com wrote:
Hi
Can you explain the below mentioned code. As far as I know we need to
overload = operator in order to equate object of a class and below code
should give error. But it is running perfectly on gcc compiler. Please
correct me
SELECT DISTINCT(NAME) FROM TABLE1;
write a query to produce same result as that of above one but without using
DISTINCT.
Is this thing possible?
--
Regards
Ravi Maggon
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group
First step would be a written test.In the test you will have to answer two
papers, one is a simple aptitude paper(no english) and
the other one is one of your like from CS,EE and DSP.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to
oops sorry...it will be (root3-1)R/(root3+1)
...the above answer will be for 2d..
Ravi Shankar,
R D,HCL Comnet,
Noida,
Ph:995369
On Sat, Aug 20, 2011 at 4:04 PM, Ravi Shankar ravi.iiit...@gmail.comwrote:
I guess the correct answer is (root2-1)R/(root2+1)
?
Ravi Shankar,
R D, HCL
heyy nitin.. it says da file izz locked .. can u mail me da buk.. thanx in
advance
--
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
1 - 100 of 143 matches
Mail list logo
