Warm Welcome to all the Freshers!

This blog will be dedicated to freshers. Find all the latest news for freshers, ways to get a good job & DOs & DONTs as a fresher.

You can find all possible resources needed for a fresher such as interview tips, previous papers & virtually anything you may need!

Kyocera Test Pattern

Kyocera Recruitment Process is carried out on similar lines as mentioned here

1.logical resoning 25 questions in 25 minutes
(propositions and etc.but very simple).

2.Analytical reasoning 25 questions in 20 minutes
(7 questions in apti and etc.simple)

3.Mental ability 20 questions 15 minutes
Note: maintain time
(most importantly concentrate on + replacing as -,* replace as / like that(10 ques))

4.C and Data structure 40 questions in 40 minutes

20 C questions (very easy)+ 20 data structure(very difficult)
for data structure please refer Tenanbaum book.

This is followed by HR round

Oracle Test Pattern

There are 4rounds

1. Aptitude
2.GD
3.Technical-pl/sql , java c,c++
4.HR

Aptitude for aptitude prepare R.S. Aggarwal -
man and work,
ratio and proportion
time & distance
Pl/sql

prepare pl/sql to crack the written test

technical section will have questions from C,C++,Java

questions from C++ and Java were simple

but most of the question were from pl/sql. so prepare that the most!

Motorola placement paper

bubble sorting is
a)two stage sorting
b).....
c)....
d)none of the above

c++ supports
a) pass by value only
b) pass by name
c) pass by pointer
d) pass by value and by reference

Selection sort for a sequence of N elements
no of comparisons = _________
no of exchanges = ____________

Insertion sort
no of comparisons = _________
no of exchanges = ____________

what is a language?
a) set of alphabets
b)set of strings formed from alphabets
c)............
d)none of the above

Which is true abt heap sort
a)two method sort
b)has complexity of O(N2)
c)complexity of O(N3)
d)..........

In binary tree which of the following is true
a)binary tree with even nodes is balanced
b)every binary tree has a balance tree
c)every binary tree cant be balanced
d)binary tree with odd no of nodes can always be balanced

Which of the following is not conducive for linked list implementation of array
a)binary search
b)sequential search
c)selection sort
d)bubble sort

In c++ ,casting in C is upgraded as
a)dynamic_cast
b)static_cast
c)const_cast
d)reintrepret_cast

Which of the following is true abt AOV(Active On Vertex trees)
a)it is an undirected graph with vertex representing activities and edges representing precedence relations
b)it is an directed graph "" "" """ "" "" "" "" "" "
c)........
d).......

Question on worst and best case of sequential search

question on breadth first search

char *p="abcdefghijklmno"
then printf("%s",5[p]);

what is the error
struct { int item; int x;}
main(){ int y=4; return y;}
error:absence of semicolon

Which of the following is false regarding protected members
a)can be accessed by friend functions of the child
b) can be accessed by friends of child's child
c)usually unacccessible by friends of class
d) child has the ability to convert child ptr to base ptr

What is the output of the following
void main()
{
int a=5,b=10;
int &ref1=a,&ref2=b;
ref1=ref2;
++ ref1;
++ ref2;
cout < < a < < b < < endl;
} value of a and b
a)5 and 12
b)7 and 10
c)11 and 11
d)none of the above

What does this return
f(int n)
{
return n < 1?0:n==1?1:f(n-1)+f(n-2)
}
hint:this is to generate fibonacci series
code for finding out whether a string is a palindrome,reversal of linked list, recursive computation of factorial with
blanks in the case of some variables.we have to fill it out

for eg; for palindrome
palindrome(char * inputstring)
{
int len=strlen ( ?);
int start= ?;
end =inputstring + ?-?;
for(; ? < end && ?==?;++ ?,--?);
return(?==?); }
we have to replace the question marks(?) with corresponding variables

.linked list reversal
Linked (Link *h)
{
Link *temp,*r=0,*y=h;
while(y!= ?) (ans:Null)
{
temp = ?;(ans:y - >next)
some code here with similar fill in type
}

fill in the blanks type question involving recursive factorial computation

Top 10 YAHOO Placements Questions

1. In a village in each family they give birth to children till they
get a boy. IF girl child they try again. What is the ratio of boys to
girls.

2. 2n+1 numbers in a list except for 1 num all had duplicates, how to
find duplicate in O(n)

3. In 1000 wine bottles stack 10 are poisoned given 10 rats what is
the minimum number of tries to find the poisoned one. Rat dies once it
licks the poisoned wine.

4. Write 1,3,6,4 using +,-,*,/ to get 24 (no repeat of numbers)

5. Which is the DS used in dictionary mode in mobile (t9)

6. Which is DS used for chess program...to predict move each and every
time..

7. There are $1070 dollars how to split them into bags such that asked
for any denomination from $1 to $1070 , u must b able to give without
opening bag...

If any one has idea do mail me qrio.qrio at gmail.com (qrio dot qrio
at gmail dot com).. Eagerly waiting...


8. First fit issues!

9. Algorithm to partition set of numbers into two s.t. diff bw their
sum is min and they hav equal num of elements

10. Prog: given Numerator & Denominator.... print 0.3333333333 as .(3)
0.123123 as .(123)

Good news for freshers

This blog would be dedicated to all the freshers featuring placement papers, hotjobs, interview tips, and loads of other goodies!!

So keep visiting for more freshers' resources! :)

freshers

Hi this is a dedicated site for freshers..!!

Powered by Om | Bloggerized by Webfosys | Latest TechNews | Free Online Programming Tutorials
- Copyright Reserved FreshersSpace 2008-2012