Fw: Zoho Pattern Programs - for preparation - reg
3,178 views
Skip to first unread message
Anuradha Ravi
Jun 8, 2015, 10:50:45 AM6/8/15
to Vellamal_csenotes_c
Dear All,
Greetings !!!
Pls. find Zoho pattern programs for your preparation.
Kindly forward this to all your friends immediately.
*question 1*
7 8 9
6 1 2
5 4 3
the sum of the diagonal elements is 25.. if we have n*n or 1001*1001 then
what is the sum.
for the above same we have a question to print like this
7 8 9 2 1 6 5 4 3
1 6 7 8 9 2 3 4 5
*question 2*
0,1,2
the permunatation is 012, 021,102,201 and so on..
like this 0123456789 what will be 100000th element....
*question 3*
1
89 98
101 103 106
trace the maximum summation path.. show it.. you can move only downwards....
*question 4*
1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 18
trace the highest summantion path.. you can move down and right...
*question 5*
viswa prasath
prabhu ram
ram viswa
o/p will be
viswa prasath - ram viswa
prabhu ram - ram viswa
if the first name of one name is equal to second name of another name then
print them..
*question 6*
this is a most beautiful flower..
n=3
then o/p will be
a is this flower beautiful most...
n=4
most a is this flower beautiful...
*question 7*
139534795325345792
find its largest prime factor...
*question 8*
an integer array will be given.. have to find unique number of instance...
*question 9*
simulation election systems
*question 10*
check whether a string has a posibility for panlindrome or not...
*From Mepco*
1. You are given with few anagrams. You have to split them into anagram
sets and others.
Eg: tar, rat, atr, banana, ananab, abcd
Ans : Anagrams - rat,tar,atr,ananab,banana
Others - abcd
2. Find the maximum sum of given series. Keep in mind that maximum sum
should be series.
Eg: -8,12,15,1,-10
Ans : 20 (-8+12+15+1)
3. You are given with a string. Find the character count. It is case
sensitive. Atlast delete the characters with maximum count.
Eg: abc Abc aac
Ans :
a 3
b 2
c 2
A 1
Result String : bc Abc c
4. Replace the string word wise.
Eg: first second third fourth
Ans : fourth third second first
5. Consider a train ticket system. Maintain the passenger details for each
train. Display train wise, berth wise, PNR number wise. Note: one PNR can
contain many passengers.
use only java..
*From amirta*
Portions:
Only C and C coding, may be java(be deponds)
1st Round
Type 1:
Output of the given code(25-30 questions).
eg:
for(I=0;i<n;i++)
{
for(j=0;j<I;j++)
count++;
}
and also see some basic AP,GP formulas
Type 2:
Choose 2 code option from the given 4 codes such that
they produce same output for any value of n
2nd Round:(the next day )
Around 100+ people got selected and the coding round in system started at 9.30
Am and ended approx. at 5 PM.
Three stages of question paper was there .
Every one should code and attend all the questions in the linear fashion.
Time of finish will be noted after each question.
The question will be given one after the another.
Each stages questions will be starting and its difficulty will keep on
increasing.
stage 1:
PATTERN PRINTING
eg 1:
*
***
*****
eg 2:
*
**
***
****
***** (LIKE a triangle pointing towards left and using only 2
for loops)
****
***
**
*
eg 3:
\ U U U /
L \ U / R
L L \ R R
L / D \ R
/ D D D\
eg 4:
_
| |
_ _
| | (For n=3 print 3 steps similarly for any n value (may be
even of odd))
And also 1 or 2 simple pattern questions with the same constraints as in eg
2.
Stage 2:
ARRAY MANIPULATION
This stage is based on Array manipulations
eg 1:
Given an array shift it based on the start and the shift value.
Shift in general is shift right
Sample input:
Array: 5 10 15 20 25 30
Start : 2
Shift : 2
Output:
5 20 15 30 25 0
And some more based on this type Like
-> Making it as a circular shift
-> In circular shift determining loop shifts and more
Totally 5 questions in this round.
Stage 3:
STRING (PALINDROME)
1. Checking whether the given string(i.e only one word without spaces) is
palindrome.
2. Finding the substring given string ,start index and end index.
3. Finding the palindromes in a given sentence.
4. Finding the largest substring palindrome in a given word.
5. Finding the largest substring palindrome in a given sentence (ie
including spaces) If 2 palindrome have the same length then print both in
the order present in the input sentence.
6. Splitting the given word as following
-> INPUT:
amadamkak123
Output:
a-madam-kak-123
-> INPUT:
palindrome
Output:
p-a-l-I-n-d-r-o-m-e.
Round 3:(The Last day)
GAMING BASED QUESTION
It is also a coding round. Around 70 were selected.
In this round the question is based on one game .
No need for the usage of GRAPHICS.
This game question is based on just matrix insertion of values in the
pattern mentioned and some deletion of the inserted values.
This will also have 8-10 questions.
After this TECHNICAL interview and HR in the same day.
Results also will announced in the same day (for as it was around 11PM and
$# got selected)
NOTE: Use only C language and also only in TURBO C and we SHOULD NOT use
HELP.
and also SHOULD NOT use INBUILT LIBRARY functions.
POINTS TO REMEMBER:
When u have started coding from round 2 Please USE FUNCTIONS so that it
will be useful for the upcoming questions.
ALL THE BEST ............ :)
after this round in off campus depending on the team .There will be 2
technical or 1 technical + 1 HR
in Technical Java(threads,collections, basics), C(pointers,static,struct)
DBMS(SQL-joins), Javascript(DOM)
HR will be general...
*Note:*
the question will have better standard than which we had now.. the team
coming there will be big.. and it is main team...
check this website for practicing
http://www.hackerearth.com/
http://www.careercup.com/
https://www.hackerrank.com/
7 8 9
6 1 2
5 4 3
the sum of the diagonal elements is 25.. if we have n*n or 1001*1001 then
what is the sum.
for the above same we have a question to print like this
7 8 9 2 1 6 5 4 3
1 6 7 8 9 2 3 4 5
*question 2*
0,1,2
the permunatation is 012, 021,102,201 and so on..
like this 0123456789 what will be 100000th element....
*question 3*
1
89 98
101 103 106
trace the maximum summation path.. show it.. you can move only downwards....
*question 4*
1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 18
trace the highest summantion path.. you can move down and right...
*question 5*
viswa prasath
prabhu ram
ram viswa
o/p will be
viswa prasath - ram viswa
prabhu ram - ram viswa
if the first name of one name is equal to second name of another name then
print them..
*question 6*
this is a most beautiful flower..
n=3
then o/p will be
a is this flower beautiful most...
n=4
most a is this flower beautiful...
*question 7*
139534795325345792
find its largest prime factor...
*question 8*
an integer array will be given.. have to find unique number of instance...
*question 9*
simulation election systems
*question 10*
check whether a string has a posibility for panlindrome or not...
*From Mepco*
1. You are given with few anagrams. You have to split them into anagram
sets and others.
Eg: tar, rat, atr, banana, ananab, abcd
Ans : Anagrams - rat,tar,atr,ananab,banana
Others - abcd
2. Find the maximum sum of given series. Keep in mind that maximum sum
should be series.
Eg: -8,12,15,1,-10
Ans : 20 (-8+12+15+1)
3. You are given with a string. Find the character count. It is case
sensitive. Atlast delete the characters with maximum count.
Eg: abc Abc aac
Ans :
a 3
b 2
c 2
A 1
Result String : bc Abc c
4. Replace the string word wise.
Eg: first second third fourth
Ans : fourth third second first
5. Consider a train ticket system. Maintain the passenger details for each
train. Display train wise, berth wise, PNR number wise. Note: one PNR can
contain many passengers.
use only java..
*From amirta*
Portions:
Only C and C coding, may be java(be deponds)
1st Round
Type 1:
Output of the given code(25-30 questions).
eg:
for(I=0;i<n;i++)
{
for(j=0;j<I;j++)
count++;
}
and also see some basic AP,GP formulas
Type 2:
Choose 2 code option from the given 4 codes such that
they produce same output for any value of n
2nd Round:(the next day )
Around 100+ people got selected and the coding round in system started at 9.30
Am and ended approx. at 5 PM.
Three stages of question paper was there .
Every one should code and attend all the questions in the linear fashion.
Time of finish will be noted after each question.
The question will be given one after the another.
Each stages questions will be starting and its difficulty will keep on
increasing.
stage 1:
PATTERN PRINTING
eg 1:
*
***
*****
eg 2:
*
**
***
****
***** (LIKE a triangle pointing towards left and using only 2
for loops)
****
***
**
*
eg 3:
\ U U U /
L \ U / R
L L \ R R
L / D \ R
/ D D D\
eg 4:
_
| |
_ _
| | (For n=3 print 3 steps similarly for any n value (may be
even of odd))
And also 1 or 2 simple pattern questions with the same constraints as in eg
2.
Stage 2:
ARRAY MANIPULATION
This stage is based on Array manipulations
eg 1:
Given an array shift it based on the start and the shift value.
Shift in general is shift right
Sample input:
Array: 5 10 15 20 25 30
Start : 2
Shift : 2
Output:
5 20 15 30 25 0
And some more based on this type Like
-> Making it as a circular shift
-> In circular shift determining loop shifts and more
Totally 5 questions in this round.
Stage 3:
STRING (PALINDROME)
1. Checking whether the given string(i.e only one word without spaces) is
palindrome.
2. Finding the substring given string ,start index and end index.
3. Finding the palindromes in a given sentence.
4. Finding the largest substring palindrome in a given word.
5. Finding the largest substring palindrome in a given sentence (ie
including spaces) If 2 palindrome have the same length then print both in
the order present in the input sentence.
6. Splitting the given word as following
-> INPUT:
amadamkak123
Output:
a-madam-kak-123
-> INPUT:
palindrome
Output:
p-a-l-I-n-d-r-o-m-e.
Round 3:(The Last day)
GAMING BASED QUESTION
It is also a coding round. Around 70 were selected.
In this round the question is based on one game .
No need for the usage of GRAPHICS.
This game question is based on just matrix insertion of values in the
pattern mentioned and some deletion of the inserted values.
This will also have 8-10 questions.
After this TECHNICAL interview and HR in the same day.
Results also will announced in the same day (for as it was around 11PM and
$# got selected)
NOTE: Use only C language and also only in TURBO C and we SHOULD NOT use
HELP.
and also SHOULD NOT use INBUILT LIBRARY functions.
POINTS TO REMEMBER:
When u have started coding from round 2 Please USE FUNCTIONS so that it
will be useful for the upcoming questions.
ALL THE BEST ............ :)
after this round in off campus depending on the team .There will be 2
technical or 1 technical + 1 HR
in Technical Java(threads,collections, basics), C(pointers,static,struct)
DBMS(SQL-joins), Javascript(DOM)
HR will be general...
*Note:*
the question will have better standard than which we had now.. the team
coming there will be big.. and it is main team...
check this website for practicing
http://www.hackerearth.com/
http://www.careercup.com/
https://www.hackerrank.com/
Arun Ramaswami A
Head - Training and Placement
Velammal Engineering College | Chennai
Velammal Institute of Technology | Chennai
Velammal College of Engineering & Technology | Madurai
Hand Phone : +91 9940127839 | +91 9444008233
Direct Desk : +91 4439666028
Website : www.velammal.edu.in
Reach us : plac...@velammal.edu.in | vec_pl...@yahoo.com
Reply all
Reply to author
Forward
0 new messages