CareerCup

There is an overflow issue with floating point numbers. We want to use our own data structure to define floating points numbers to avoid the overflow and truncation issue?

How would you handle this question??

Hi Guys, Could you tell me what is InMobi Salary for fresher's and 3-4 years experienced? Salary section say 16.8 lakhs for fresher's is it true?

What is the difference in the below two declarations?
char *str ="career cup";
char str[] = "career cup";

How can I use DeDuplicator to avoid duplicate content download in Heritrix 3.1.1.Please help !

How can I use DeDuplicator to avoid duplicate content download in Heritrix 3.1.1.Please help !

I have a project requirement for which I need to store the information of a users system like OS, MAC address, etc. whenever he visits the website so that we can uniquely identify the user's machine. I am developing the project in Spring MVC 3.1. Currently we are using IP address and User agent using JavaScript but both of them are not reliable and can be easily changed. Is there a way to do this through Java/JavaScript/Spring MVC. Thanks in advance.

The same user can register multiple times. To avoid this, we need to identify the user's machine

I want to traverse a single linked list and also want to keep record of previously visited Nodes.
At any time I want to check that my current Node is visited or not.
which kind of structure provide me best way (in terms of space and time complexity)? also faster fetch for a particular Node.

points:
--about Map, but I don't want to waste space for another data as key/value. I want to insert node pointer only.
--about set, but during insertion sorting algo is used in set.
--link list itself. (what if count of nodes is very high)

Hi,

I am using 64 bit compiler.
When I am giving sizeof(int) it is showing 4 byte where as when I am giving sizeof(ptr) it is showing 8 byte .Any Idea Why??

Hi guys,

Would like to know how will you parse a line from a CSV file (e.g. “a,b,c”) into individual fields (“a”, “b” and “c”) in Java?

// Dynamic Programming implementation of edit distance
#include<stdio.h>
#include<stdlib.h>
#include<string.h>

// Change these strings to test the program
#define STRING_X "SUNDAY"
#define STRING_Y "SATURDAY"

#define SENTINEL (-1)
#define EDIT_COST (1)

inline
int min(int a, int b) {
return a < b ? a : b;
}

// Returns Minimum among a, b, c
int Minimum(int a, int b, int c)
{
return min(min(a, b), c);
}

// Strings of size m and n are passed.
// Construct the Table for X[0...m, m+1], Y[0...n, n+1]
int EditDistanceDP(char X[], char Y[])
{
// Cost of alignment
int cost = 0;
int leftCell, topCell, cornerCell;

int m = strlen(X)+1;
int n = strlen(Y)+1;

// T[m][n]
int *T = (int *)malloc(m * n * sizeof(int));

// Initialize table
for(int i = 0; i < m; i++)
for(int j = 0; j < n; j++)
*(T + i * n + j) = SENTINEL;

// Set up base cases
// T[i][0] = i
for(int i = 0; i < m; i++)
*(T + i * n) = i;

// T[0][j] = j
for(int j = 0; j < n; j++)
*(T + j) = j;

// Build the T in top-down fashion
for(int i = 1; i < m; i++)
{
for(int j = 1; j < n; j++)
{
// T[i][j-1]
leftCell = *(T + i*n + j-1);
leftCell += EDIT_COST; // deletion

// T[i-1][j]
topCell = *(T + (i-1)*n + j);
topCell += EDIT_COST; // insertion

// Top-left (corner) cell
// T[i-1][j-1]
cornerCell = *(T + (i-1)*n + (j-1) );

// edit[(i-1), (j-1)] = 0 if X[i] == Y[j], 1 otherwise
cornerCell += (X[i-1] != Y[j-1]); // may be replace

// Minimum cost of current cell
// Fill in the next cell T[i][j]
*(T + (i)*n + (j)) = Minimum(leftCell, topCell, cornerCell);
}
}

// Cost is in the cell T[m][n]
cost = *(T + m*n - 1);
free(T);
return cost;
}

// Recursive implementation
int EditDistanceRecursion( char *X, char *Y, int m, int n )
{
// Base cases
if( m == 0 && n == 0 )
return 0;

if( m == 0 )
return n;

if( n == 0 )
return m;

// Recurse
int left = EditDistanceRecursion(X, Y, m-1, n) + 1;
int right = EditDistanceRecursion(X, Y, m, n-1) + 1;
int corner = EditDistanceRecursion(X, Y, m-1, n-1) + (X[m] != Y[n]);

return Minimum(left, right, corner);
}

int main()
{
char X[] = STRING_X; // vertical
char Y[] = STRING_Y; // horizontal

printf("Minimum edits required to convert %s into %s is %d\n",
X, Y, EditDistanceDP(X, Y) );
printf("Minimum edits required to convert %s into %s is %d by recursion\n",
X, Y, EditDistanceRecursion(X, Y, strlen(X), strlen(Y)));

return 0;
}

Suppose a number n. Multiplying it by 2 gives another number which is the same as n except that the last digit is now the first digit.. Is there such a number..????

For example, abcd*2 = dabc.. the digits can be same...

#include<stdio.h>
#include<stdlib.h>

// Structure for a pair
struct pair
{
int a;
int b;
};

// This function assumes that arr[] is sorted in increasing order
// according the first (or smaller) values in pairs.
int maxChainLength( struct pair arr[], int n)
{
int i, j, max = 0;
int *mcl = (int*) malloc ( sizeof( int ) * n );

/* Initialize MCL (max chain length) values for all indexes */
for ( i = 0; i < n; i++ )
mcl[i] = 1;

/* Compute optimized chain length values in bottom up manner */
for ( i = 1; i < n; i++ )
for ( j = 0; j < i; j++ )
if ( arr[i].a > arr[j].b && mcl[i] < mcl[j] + 1)
mcl[i] = mcl[j] + 1;

// mcl[i] now stores the maximum chain length ending with pair i

/* Pick maximum of all MCL values */
for ( i = 0; i < n; i++ )
if ( max < mcl[i] )
max = mcl[i];

/* Free memory to avoid memory leak */
free( mcl );

return max;
}


/* Driver program to test above function */
int main()
{
struct pair arr[] = { {5, 24}, {15, 25},
{27, 40}, {50, 60} };
int n = sizeof(arr)/sizeof(arr[0]);
printf("Length of maximum size chain is %d\n",
maxChainLength( arr, n ));
return 0;
}

I was going through Cracking the Coding Interview 4th edition.

I was going through a program which checked if two strings are anagrams, by checking if the two strings have identical counts for each unique character.

I could not understand the condition checked in this line.

return i == t.length() - 1;

After understanding the whole algorithm properly, and trying out various test cases, i found that 'return true' would also work in place of this line.

Could anybody please give me any scenario where writing 'return true' instead of the above line would cause the program to fail?

Fastest Sorting algorithm for strings?
Suppose you have file which has many strings. How will you sort all strings in that file. That file size is large.
Time complexity ?
Space complexity?

how to change format of phone numbers in 1000 staatic html pages

queue sort using divide and conquer or dynamic
programing approach with time complexity)with code java to show run and algorithm?

and
queue search using divide and conquer or dynamic
programing approach with time complexity)with code java to show run and algorithm?


please.......please......think you .................

Hi ,

I am not sure if this is with me or with everyone else as I am getting a lot of mails into my private and registered mail id regarding the question / discussion after every user comments from here.

I may have put comment of my own on the same question sometimes back and may becoz of that I am getting the same but the question here is the is no way to unsubscribe those subscriptions.

Although , C C does have the checkbox at the bottom of the question under discussion but I am not sure why it is "Checked" by default and always gets redirected to mail account.

Gayle, Could you please provide the single point of subscription / UnSubscription button which will help user to regulate this mail forwarding option.

Thanks
Prem

You are given a set of positive integers. your task is to solve partition problem.

Lets define the partition problem.

Partition problem is the task of deciding whether a given multiset of positive integers can be partitioned into two subsets S1 and S2 such that the sum of the elements in S1 equals the sum of the elements in S2.

Ex:
Example 1:
array[] = {1, 5, 11, 5}
Output: Yes
This array can be divided into to subsets {1, 5, 5} and {11} these two have equal sum.

array[] = {1, 5, 3}
Output: No
This array cant be divided into two subsets of equal sum.

(stack queue using both divide and conquer and dynamic
programing approach with time complexity)with code java to show run and algorithm?)

Hi ,
What is the logic behind this behaviour?

int i=0;
for(int k=0;k<10;k++){
i++;
}
System.out.println("i="+i);

Output=10; //Exepcted

int i=0;
for(int k=0;k<10;k++){
i=i++;
}
System.out.println("i="+i);

Output=0; //Surprised :)