Experiences, Technical and HR Questions and more of RVCE Information
Science students in Campus Placements 2011.
https://docs.google.com/document/d/1k5O1ijA-4M5pwxcvMhOYMFtWnJVoV5PM7aoF987SLhU/edit?hl=en_US
--
You received this message because you are subscribed to the Google Groups
Algorithm
Which is the data Structure used to store the IP addresses in a
network ?
Please Elaborate?
--
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
Given a Hexadecimal value as a string, give a C Code to convert it
into decimal value?
If 0xff then output should be 255.
--
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
Give an algorithm/C Code to reverse a string using a recursive
function without swapping or using any extra memory?
--
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
Please explain this ...
#includestdio.h
int main()
{
int *p[10];
printf(%d,sizeof(*p));
return 0;
}
Output is 4
For this program
#includestdio.h
int main()
{
int *p[10][20];
printf(%d,sizeof(*p));
return 0;
}
Output is 80 (10*20*sizeof(int))
--
You received this message because
A hash table can store a maximum of 10 records, currently there are
records in location 1, 3,4,7,8,9,10. The probability of a new record
going into location 2, with hash functions resolving collisions by
linear probing is
a. 0.1b. 0.6 c. 0.2 d. 0.5
I think the answer is 0.6
What do you
This question is already discussed,please search the group before
asking questions ..
https://groups.google.com/group/algogeeks/browse_thread/thread/2597c9730a43977b
Thank you
On Aug 11, 10:46 pm, Mani Bharathi manibharat...@gmail.com wrote:
A complete n- array tree in which each node has n
How is floating number 5.375 represented in memory . What is the
normalised form of the number 5.375 .
The normalised form of 5.375 is
0100 1010 1100
How it is done.Explanation?
Thanks
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
@all : I Think the output depends on whether it is row major or column
major representation in memory .
Does he row major or column major representations matter
in calculations above???
On Aug 6, 11:49 pm, aditi garg aditi.garg.6...@gmail.com wrote:
oh @ akshay y ru doing 10x4??? 10
You're given an array containing both positive and negative integers
and required to find the sub-
array with the largest sum (O(N) a la KBL). Write a routine in C for
the above
Is this problem as simple as just adding the positive numbers with the
subarray with largest sum being the set of
This is the code to reverse the bits in an unsigned integer .
Could anyone please explain the logic of this approach ? Thank You !!
#define reverse(x) \
(x=x16|(0xx)16, \
x=(0xff00ff00x)8|(0x00ff00ffx)8, \
x=(0xf0f0f0f0x)4|(0x0f0f0f0fx)4, \
x=(0xx)2|(0xx)2, \
Write a routine to draw a circle (x ** 2 + y ** 2 = r ** 2) without
making use of any floating point
computations at all.
--
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
@amol and saurabh : How exactly is that formula derived for this
problem ?
I need to know the method to evaluate such problems in the future .
Thank you
On Jul 30, 1:13 pm, saurabh singh saurab...@gmail.com wrote:
Thanx mate...You rock.:)
On Sat, Jul 30, 2011 at 1:40 PM, Amol
Problem statement goes as :
Consider square root of integers form 1 to 100. Now partition the
square roots of integers as being from 1 to 50 and 51 to 100.
Now find the sum in the two partitions which is as close as possible
or minimum?
Give the algorithm ?? and das structures to be used??
--
scanf(%[^a-z],z);
On Jul 27, 12:13 am, TUSHAR tusharkanta.r...@gmail.com wrote:
write an scanf that reads only a to z charchter.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
Give an algorithm to implement an atoi() function ?
--
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
#includestdio.h
int main()
{
int i=1;
printf(%d%d%d%d,++i,++i,++i,i++);
return 0;
}
Explain how it will be evaluated ?? and the output obtained ..
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
Come Up with an Algorithm to implement the insertion of a node in
circular linked list without actually traversing the list ?
--
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
Algorithm Please ... Thank You
On Jul 23, 12:17 am, vaibhav shukla vaibhav200...@gmail.com wrote:
maintain just a tail pointer
On Sat, Jul 23, 2011 at 12:45 AM, rShetty rajeevr...@gmail.com wrote:
Come Up with an Algorithm to implement the insertion of a node in
circular linked list
for corner
cases.
On Sat, Jul 23, 2011 at 12:50 AM, rShetty rajeevr...@gmail.com wrote:
Algorithm Please ... Thank You
On Jul 23, 12:17 am, vaibhav shukla vaibhav200...@gmail.com wrote:
maintain just a tail pointer
On Sat, Jul 23, 2011 at 12:45 AM, rShetty rajeevr
list, what is avoiding you from maintaining a tail
pointer.
You just need to tweak insert and delete function a little bit for corner
cases.
On Sat, Jul 23, 2011 at 12:50 AM, rShetty rajeevr...@gmail.com wrote:
Algorithm Please ... Thank You
On Jul 23, 12:17 am, vaibhav shukla
How to sort Linked lists in O(n) time ??
Give the algorithm or the explanation or clue to tackle the problem
--
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
You can try recursively calling main() function and keep a count and
then find the count value just before the stack overflow condition.
Then multiply count with the size of the memory used in one recursive
call . Guys does this work ???
On Jul 21, 7:04 pm, Deoki Nandan deok...@gmail.com wrote:
@ankit Could you please explain your code and the logic behind ...
Thank You
On Jul 21, 6:22 pm, ankit sambyal ankitsamb...@gmail.com wrote:
int add(int x, int y)
{
int c;
while(y)
{
c = x y;
x ^= y;
y = c 1;
}
return(x);}
int mult(int x, int y)
// File Handling
#includestdio.h
#includestdlib.h
int main()
{
unsigned char ch; // I think there is problem somewhere in this
line ! Help !!
FILE *fp;
fp = fopen(abc,r);
if(fp==NULL)
{
printf(Unable to Open);
exit(1);
}
while((ch = getc(fp)!=EOF))
printf(%c,ch);
fclose(fp);
#includestdio.h
int main()
{
char str[] = Zingle Bell Zingle Bell;
printf(%.#s %.2s\n,str,str);
return 0;
}
I need the help to figure out the output of the program and please
expalin the behaviour of the printf statement here ?
--
You received this message because you are subscribed to the
Given a very big file of words, a word in each line, sort the words .
Please provide the algorithm and 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
What is the most efficient algorithm to count the number of bits in an
unsigned integer ?
Explain your approach to the problem ?
--
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.
, 12:44 pm, rShetty rajeevr...@gmail.com wrote:
What is the most efficient algorithm to count the number of bits in an
unsigned integer ?
Explain your approach to the problem ?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
#includestdio.h
int main()
{
int i=0,j=1,k=1,z=0;
z = j || k i ;
printf(%d,z);
return 0;
}
The output is 1 for the above program .
But according to associativity of logical operators , the evaluation
should be from left to right , But is it taking from right to left ?
What is the exact
||
the expression is evaluated as
z=j || ( k i );
hence the output i.e 1 ;)
On Sun, Jul 10, 2011 at 11:06 PM, rShetty rajeevr...@gmail.com wrote:
#includestdio.h
int main()
{
int i=0,j=1,k=1,z=0;
z = j || k i ;
printf(%d,z);
return 0;
}
The output is 1 for the above program
#includestdio.h
#includestring.h
int main()
{
char str[]=This is rajeev\n;
char str1[10];
memset(str,'0',4);
printf(%s,str);
memcpy(str1,str,10);
printf(\n this is string 1\n);
printf(%s\n,str1);
return 0;
}
Output is :
is rajeev
this is string 1
is ra is rajeev
it
#includestdio.h
int findMax(int *arr , int len)
{
int i;
int max = arr[0];
for(i=0;ilen;i++)
{
if(arr[i]=max)
max= arr[i];
}
printf(%d\n,max);
return max;
}
int findMin(int *arr ,int len)
{
int min,i;
for(i=0;ilen;i++)
{
min=arr[0];
if(arr[i]arr[i+1])
min= arr[i];
}
Given a byte, write a code to swap every two bits. [Using bit
operators]
Eg: Input: 10 01 11 01 Output: 01 10 11 10
--
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
Reversing a String without using a temporary variable ?
Rajeev N B
--
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
such problems ?
On Mon, Jun 27, 2011 at 6:17 PM, Dave dave_and_da...@juno.com wrote:
y = ((x 0x55) 1) | ((x 1) 0x55).
Note, 0x55 = 01010101 in binary.
Dave
On Jun 27, 7:18 am, rShetty rajeevr...@gmail.com wrote:
Given a byte, write a code to swap every two bits
Suggest the most efficient Data Structures and algorithms to implement
Undo and Redo operations in any of the Office Suites ?
--
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
, rShetty rajeevr...@gmail.com wrote:
Collection of Algorithmic Pioneers can be Found here
http://openprobe.blogspot.com/2011/06/pioneers-in-algorithm-deisgn-an...
Suggestion for addition of more Pioneers are welcome .
--
You received this message because you are subscribed to the Google
http://techbrother.blogspot.com/2007/11/incrementing-void-pointer.html
Regards
Rajeev N B
On Jun 24, 6:29 pm, RITESH SRIVASTAV riteshkumar...@gmail.com wrote:
C standard doesn't say anything about void pointer increment.
If you will do sizeof(void) ,I guess your gcc compiler will give you 1
Collection of Algorithmic Pioneers can be Found here
http://openprobe.blogspot.com/2011/06/pioneers-in-algorithm-deisgn-and.html
Suggestion for addition of more Pioneers are welcome .
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post
40 matches
Mail list logo
