Informatica Interview Questions
- 0of 0 votes
AnswersCreate corpus reader and tokenizer
- fgfsdgs November 06, 2014 in United States
Write a program that creates an inverted index for this corpus, allowing searching for free
text, e.g. [dor cabeça], [efeitos adversos]
a) Use the index structure and contents that you consider more suitable/relevant;
b) Use a default list of stopwords and accept as optional argument a text file with
stopwords; Add the option to disable the use of the stopword filter;
c) Use the Porter stemmer as default, but you should allow disabling this;
d) Add the option to write / read the index to / from a text file.
2. Implement a ranked retrieval method based on the vector-space model and using the tf-idf
weighting scheme.
2.1. Use the queries and the list of relevant documents to evaluate your implementation (note:
these will be available later). Calculate and report the average precision for each query and
the mean average precision (MAP) over all queries.
docs-> EMEA Corpus ->https://drive.google.com/folderview?id=0B3Slz0zk1PRUSkxuTlE2VVl1Ym8&usp=sharing| Report Duplicate | Flag | PURGE
Informatica Java Developer - -2of 4 votes
AnswersLook at the following pseudo-code, which computes the n-th Fibonacci number:
- Eliana December 24, 2013 in United States for interviews
int fibonacci(int n)
{
if (n == 0)
{
print(0)
return 0
}
if (n == 1)
{
print(1)
return 1
}
return fibonacci(n - 1) + fibonacci(n - 2)
}
If one calls fibonacci(3), then the following will happen:
* fibonacci(3) calls fibonacci(2) and fibonacci(1) (the first call).
* fibonacci(2) calls fibonacci(1) (the second call) and fibonacci(0).
* The second call of fibonacci(1) prints 1 and returns 1.
* fibonacci(0) prints 0 and returns 0.
* fibonacci(2) gets the results of fibonacci(1) and fibonacci(0) and returns 1.
* The first call of fibonacci(1) prints 1 and returns 1.
* fibonacci(3) gets the results of fibonacci(2) and fibonacci(1) and returns 2.
In total, 1 will be printed twice and 0 will be printed once.
We want to know how many times 0 and 1 will be printed for a given integer N.
INPUT
The first line contains an integer T, denoting the number of test cases.
The next T lines contain an integer N.
OUTPUT
For each test case, print one line of output which contains 2 integers separated by a space. The first integer is the number of times 0 is printed. The second integer is the number of times 1 is printed.
CONSTRAINTS
1 <= T <= 50
0 <= N <= 40
SAMPLE INPUT
2
0
3
SMAPLEOUTPUT
1 0
1 2| Report Duplicate | Flag | PURGE
Informatica iOS Developer C++ - -2of 2 votes
AnswersThe way a Knight Given a chessboard, consisting of n×n cells, several of them are cut. Find the path of minimum length for a Knight from one cell to another. The Knight can’t go through cut cells.
- Eliana December 24, 2013 in United States for interviews
Specifications
Input
The first row is set to the number n (2 ≤ n ≤ 50). Each of the next n lines contains n symbols. The symbol # denotes the cut cell, the point - not cut cell, the symbol @ denotes the initial and final cell of the Knight's path (the chessboard contains two such characters).
Output If the path can not be constructed, print "Impossible". Otherwise display the same map as the input, but check all Knight intermediate positions with symbol @. Example
Example input
5
.....
.@@..
.....
.....
.....
5
@..@.
..##.
.....
.....
.....
5
@....
..#..
.#...
.....
....@
Example output
Sample 1
...@.
.@@..
....@
.....
.....
Sample 2
@..@.
..##.
.@..@
..@..
@....
Sample 3
Impossible| Report Duplicate | Flag | PURGE
Informatica iOS Developer C - -1of 3 votes
AnswersI was asked this ques in my first phone interview.
- Anonymous October 03, 2013 in United States
Replace a string within another string WITHOUT LIBRARY FUNCTIONS.
I/p:
Str="anonymous";
O/p:
str1="anonykggse";| Report Duplicate | Flag | PURGE
Informatica Software Engineer / Developer - -1of 1 vote
AnswersPrint 010101010.... or 1010101010... without using arithmatic operations.
- Anonymous October 01, 2013 in United States| Report Duplicate | Flag | PURGE
Informatica Software Engineer / Developer - 0of 0 votes
AnswersGiven a fixed length linked list(for example max elements allowed is 10), to add 11th element,Least Recently Used element must be removed from LL in o(1) time.
- gopalkrishna2 September 06, 2012 in India| Report Duplicate | Flag | PURGE
Informatica Software Engineer / Developer Algorithm - 0of 0 votes
AnswersHow do you delare a constant in java..other that using final keyword..
- shine June 14, 2012 in India
example, how will you create a constant StringBuffer??? What does using final mean in this case - it doesn't make StringBuffer constant..| Report Duplicate | Flag | PURGE
Informatica Software Engineer / Developer Java - 0of 0 votes
AnswersWhy do we use volatile? it doesn't ensure atomicity?
- shine June 14, 2012 in India
How is volatile used for objects?
How do you synchronize an object across all instances (static synchronization)| Report Duplicate | Flag | PURGE
Informatica Software Engineer / Developer Java - 0of 0 votes
AnswersWhy are static inner class used in the design? Are they really needed?
- shine June 14, 2012 in India| Report Duplicate | Flag | PURGE
Informatica Software Engineer / Developer Java - 0of 0 votes
AnswersWhy is enum added to java? Everything that it does can be done by a class..
- shine June 14, 2012 in India
I said it groups all constants of the same type at one place, he said - we can add static final variable in the class to achieve this...| Report Duplicate | Flag | PURGE
Informatica Software Engineer / Developer