CareerCup

Given a string (for example: "a?bc?def?g"), write a program to generate all the possible strings by replacing ? with 0 and 1.
Example:
Input : a?b?c?
Output: a0b0c0, a0b0c1, a0b1c0, a0b1c1, a1b0c0, a1b0c1, a1b1c0, a1b1c1.

Given the following directory structure:

org

 | -- Robot.class

 | -- ex

      |-- Pet.class

     |

     |-- why

          |-- Dog.class

And the following source file:

class MyClass {

 Robot r;

 Pet p;

 Dog d;

Which statement(s) must be added for the source file to compile? (Choose all that apply.)

A. package org; 

B. import org.*; 

C. package org.*; 

D. package org.ex; 

E. import org.ex.*; 

F. package org.ex.why; 

G. package org.ex.why.Dog;

Here is a small program which will be of my help.
Please code it in JAVA. If you are successful, please send me the code as early as possible by tomorrow.
If you are not able to get, please send me the update.

The Definition is given as below:
1. A File contains string for Example: GCDNPQACKSPEGF...FIM
2. Read each character from this file and ASSIGN the values as below:
A,C,S = 3
F,D,N,T= 4
P,F,Y = 9
M,E,G = 2
Q,H,I,K,R,L = 6
3. AFTER ASSIGNING CHECK THE FILE FOR MAPPING
4. Sum THE VALUES in that sequence for Eg: 2+ 3+ 4...... = SUM = 60
5. FIND THE total LENGTH of the sequence for E: L = 20
6. Find the AVERAGE A = SUM/L =60/20 =3
7. USE THE PATTERNS as triplets from the same file as given below AND CALCULATE EACH PATTERN'S WEIGHTAGE as for Eg:
GCD = 2 + 3 + 4 = 9 (G = 2, C=3, D=4 from the mapping)
CDN = 3+4+4 = 11
...........
for all possible patterns
8. FinD THE MAXIMUM OF ALL THE PATTERN'S WEIGHTAGE

So, the o/p should be : Average -->
Triplet and its Weightage as :GCD : 2 + 3+ 4 = 9 for all possible triplets
Maxi Weightage -->

A matrix will be given which contains nos. and dots. will have to output another matrix in which the nos. are surrounded by single loop. the value of each number in a matrix equals the number of lines surrounding it.
Empty spaces in matrix/dots may be surrounded by any number of lines.
When completed, the solution forms a single continuous loop with no crossings or branches.

Value of each no. should connect the adjacent dots horizontally and vertically so that the lines form a simple loop with no loose ends based on the above rules.

eg

input Matrix

1.31.3
...3..
.3.21.
.02.1.
..2...
2.23.3


output Matrix

- -
1 .|3|1 .|3|
- - | - |
|. . .|3|. .|
| - - -
|.|3|. 2 1|.
- - - _
. 0 2 .|1 .|
- - - -
|.|.|2 . .|.
| - - -
|2 . 2|3|. 3|
- - - - -

i tried making rules and then call the function to make lines, but couldnt succeed in gettin desired output.

for any queries please comment

A matrix will be given which contains nos. and dots. will have to output another matrix in which the nos. are surrounded by single loop. the value of each number in a matrix equals the number of lines surrounding it.
Empty spaces in matrix/dots may be surrounded by any number of lines.
When completed, the solution forms a single continuous loop with no crossings or branches.

Value of each no. should connect the adjacent dots horizontally and vertically so that the lines form a simple loop with no loose ends based on the above rules.

eg

input Matrix

1.31.3
...3..
.3.21.
.02.1.
..2...
2.23.3


output Matrix

- -
1 .|3|1 .|3|
- - | - |
|. . .|3|. .|
| - - -
|.|3|. 2 1|.
- - - _
. 0 2 .|1 .|
- - - -
|.|.|2 . .|.
| - - -
|2 . 2|3|. 3|
- - - - -

i tried making rules and then call the function to make lines, but couldnt succeed in gettin desired output.

for any queries please comment

Multiple threads are running in my program. Exception occurs in one of the thread. There is no exception handling done.

What will happen to my program? Will it terminate the complete program? What will happen to other threads?

i) Explain Polymorphism

ii) Output of the below code snippet :-

public class ParentTest {

	public int x = 0;

    public void print() {
        System.out.println("In Parent");
    }

}

public class ChildTest extends ParentTest {
	public int x = 1;

	public void print() {
        System.out.println("In Child");
    }
	
	public static void main( String args[] )
	{
		ParentTest s = new ChildTest();
		System.out.println(s.x);
		s.print();   
	}
}

In synchronous request from browser how do you get results if you have to access 2 different databases

In assembly line situation, how do you pass a job from thread1 to thread2 to thread3?

in a web request you want to send results to the browser/client only if the caching operation goes success. how do you accomplish this.

public class Gen {

    public static void main(String[] args) {

        Integer i1 = new Integer(1);
        Integer i2 = new Integer(1);


        System.out.println(i1 != i2);
        System.out.println(i1 <= i2);
        System.out.println(i1 >= i2);


    }
}

WHY THE OUTPUT IS TRUE IN ALL CASES?

A non-empty zero-indexed array A consisting of N integers is given. The leader of this array is the value that occurs in more than half of the elements of A.
Write a function:
int arrLeader(int A[], int N);
int arrLeader(NSMutableArray *A);
int arrLeader(const vector<int> &A);
class Solution { int arrLeader(int[] A); }
class Solution { public int arrLeader(int[] A); }
function arrLeader(A);
function arrLeader(A)
function arrLeader($A);
function arrLeader(A : array of longint; N : longint) : longint;
def arrLeader(A)
sub arrLeader { my (@A)=@_; ... }
def arrLeader(a)
Private Function arrLeader ( A As Integer() ) as Integer
that, given a non-empty zero-indexed array A consisting of N integers, returns the leader of array A. The function should return -1 if array A does not contain a leader.
Assume that:
l N is an integer within the range [1..1,000,000];
l each element of array A is an integer within the range [0..2,147,483,647].
For example, given array A consisting of ten elements such that:
A[0] = 4 A[1] = 2 A[2] = 2 A[3] = 3 A[4] = 2 A[5] = 4 A[6] = 2 A[7] = 2 A[8] = 6 A[9] = 4
the function should return -1, because the value that occurs most frequently in the array, 2, occurs 5 times, and 5 is not more than half of 10.
Given array A consisting of five elements such that:
A[0] = 100 A[1] = 1 A[2] = 1 A[3] = 50 A[4] = 1
the function should return 1.
Complexity:
l expected worst-case time complexity is O(N);
l expected worst-case space complexity is O(1), beyond input storage (not counting the storage required for input arguments).
Elements of input arrays can be modified.
// you can also use includes for example:
// #include <algorithm>
int arrLeader ( const vector<int> &A ) {
// write your code here

}

Implement multiple producer and multiple consumer problem in java.

i) Difference between HashMap & HashTable

ii) How will you implement your own sorting algorithm in java?

Input will be a matrix consiting of only 1's n 0's.
The 1's represent the lines and 0's its absence.
For eg a matrix 6X7 is shown

0 0 0 1 1 1 1
0 1 1 1 0 1 1
0 1 0 1 0 1 1
0 1 0 1 0 1 1
0 1 1 1 0 1 1
0 0 0 1 1 1 1


In the above matrix, the sequence of 1’s represents the lines. These eight lines constitute three
rectangles.

Conditons :

1. The rectangles will always enclose some 0’s. e.g. last two vertical lines does not constitute a
rectangle.

2. A rectangle can contain multiple rectangles


Output : should be no. of rectangles formed in the matrix(intersecting rectangles are also counted).

Threre are two interfaces A , B which contains the same method methodC()...and C class implements A&B

which interface method it should be implemented A or B

Given a number N, find the smallest even number E such that E > N and digits in N and E are same.
Print NONE otherwise.
Sample:
Input
N = 34722641
Output
E = 34724126
Input
N = 8234961
Output
E = 8236194 (instead of 8236149)
Java solution

Given two words, determine if the first word, or any anagram of it, appears in consecutive characters of the second word. For instance, tea appears as an anagram in the last three letters of slate, but let does not appear as an anagram in actor even though all the letters of let appear in slate.
Return the anagram of the first word that has appeared in the second word.
Sample Input 1
tea
slate

Sample Output1
ate
Sample Input 2
let
slate

Sample Output2
NONE

java solution

Given a string, complete the given function to recursively remove the adjacent duplicate characters and return the resultant string. If there are no characters left in the resultant string, return "-1" (without quotes).
Sample Test Cases
Sample Input: ABCCBCBA
Output: ACBA

Explanation: (ABCCBCBA --> ABBCBA --> ACBA)
Sample Input: AA
Sample Output: -1
Java solution

Class A
{ void print(){}
}

Class B extends A
{ void print(){}
public static void main(String args[])
{
B b = new A();
}
}


Whats wrong with the above piece of code?
will below mentioned line work?
B b = (B)new A();

Unable to get what exactly the Question Is?

so What is the whole logic behind this question .It seems to be complete Math problem to me.

There is a Grasshopper in a tropical forest. The grasshopper can jump only vertically and horizontally, and the length of jump is always equal to x centimeter. A GRasshopper has found herself at the center of some cell of the chess board of the size pxq centimeters(each cell is 1x1 centimeters). She can jump as she wishes for an arbitrary number of times, she can even visit a cell more than once. the only restriction is that she cannot jump out of the board.
The grasshopper can count the number of cells that she can reach from the starting position(x,y). Let's denote this amount by dx,y. your task is to find the number of such starting position(x,y), which have the maximum possible value of dx,y
Input
The integer array contains three integers p,q,x

p= length of the board
q= width of the board
x=length of the grasshoppers jump.

Output
Output the only integer - the number of the required starting position of the Grasshopper
Example

input 2 3 1000000
output 6

input 3 3 2
output 4

Regards,
JSD

We can start a Thread using either of two methods start() and run().What is the difference between these two?

how to print this pattern

input N=4
output :
4444444
4333334
4322234
4321234
4322234
4333334
4444444

input N=3
output :
33333
32223
32123
32223
33333

String pool, equals method, create immutable class Person
collection Concurrency, blocked collection, dQueue, multi threading

Construct an iterator of iterator

Here is the below question format:

// E next();
// Boolean hasNext();

// input: Iterator<Iterator<E>>
// output: Iterator<E>

// [[1], [2, 3]] => [1, 2, 3]

What are the different ways of sorting the arrays in Java which is other than Arrays.sort(a1)

A professor wants to see if two students have cheated when writing a paper. Design a function : hasCheated(String s1,String s2, int N) that evaluates to true if two strings have a common substring of length N. Additional question after implementation. Assume you don't have the possibility of using String.contains() and String.substring(). How would you implement this?

Given a list of 4 billion integers, find an integer not in the list using 4MB of memory. (interview was in Java)

Make a JAVA program for an array of classes.
class should have 4 or 5 attribute and Array should contain 10 data which all have that 4 or 5 attribute of class. And Retrieve each attribute from all data. (Like Array of structure in C).

Make a Java/C program that takes n as input and gives you all sequence of n by using recurssion. For example if n=3, output will be:
111
112
113
121
.........
........
331
332
333.