Posted by faadoocoders at 9:00 AM
Read our previous post
Josh Technology Group Interview Questions
Hi I am pursuing B.E in CSE. I recently sat for
the internship selection process organized by Josh technologies,
gurgaon.
Online test :
Online test from amcat was conducted. The test had aptitude questions , two coding questions(array easy question and pattern printing question) and c code snippets. This was followed by another round I.e. written test.
Written test:
Programs for four coding questions from data structures were suppose to be written on the paper.
Online test :
Online test from amcat was conducted. The test had aptitude questions , two coding questions(array easy question and pattern printing question) and c code snippets. This was followed by another round I.e. written test.
Written test:
Programs for four coding questions from data structures were suppose to be written on the paper.
Also view
Flipkart Interview Experience | SDE | Set 1
Wipro Interview Experience for 2014 batch
Questions were:
1. To check if two given binary trees are identical or not.
2. To check if the given tree is a sum tree I.e. to check if the sumvalue of each node is equal to the sum of its left and right child's values.
3. To merge two sorted arrays.
4. To remove from a given linked list, nodes that have even values.
After this a written objective test for c code snippets was also there.
After these rounds, two students were shortlisted for the next face to face interview round from our university and called to their gurgaon office.
1. To check if two given binary trees are identical or not.
2. To check if the given tree is a sum tree I.e. to check if the sumvalue of each node is equal to the sum of its left and right child's values.
3. To merge two sorted arrays.
4. To remove from a given linked list, nodes that have even values.
After this a written objective test for c code snippets was also there.
After these rounds, two students were shortlisted for the next face to face interview round from our university and called to their gurgaon office.
Arun Sharma Quantitative Aptitude for CAT PDF FREE EBOOK DOWNLOAD
Interview 1 :
Two programs were asked in this round . Questions were
1. Given two sorted lists of even but different lengths. You need to balance the lists I.e. the two lists should be of same length finally and sorted too. Complexity should be O(m +n)
2. Given a binary tree. Find the maximum sum (of node values) in the tree that we can get between a path between two leaves. Complexity should be O(n)
Interview 2:
Again two questions were asked. Questions were:
1. Given a binary tree (note not a binary search tree) and two node values. Print the path between two nodes in the tree.
2. You are given a value of n. Print all valid combinations of parentheses using only n number of pairs of parentheses.
E.g. for n=1 , ()
For n =2 -- ()(), (())
For n =3-- ()()(), ()(()), (()()), (())(), ((()))
Two programs were asked in this round . Questions were
1. Given two sorted lists of even but different lengths. You need to balance the lists I.e. the two lists should be of same length finally and sorted too. Complexity should be O(m +n)
2. Given a binary tree. Find the maximum sum (of node values) in the tree that we can get between a path between two leaves. Complexity should be O(n)
Interview 2:
Again two questions were asked. Questions were:
1. Given a binary tree (note not a binary search tree) and two node values. Print the path between two nodes in the tree.
2. You are given a value of n. Print all valid combinations of parentheses using only n number of pairs of parentheses.
E.g. for n=1 , ()
For n =2 -- ()(), (())
For n =3-- ()()(), ()(()), (()()), (())(), ((()))
My advice to all is practise Data Structure & Algorithm as much as you can.
Now its your turn.
All the best.
TCS Campus Placement Experience
DO NOT FORGET TO SHARE THE POST AND COMMENT BELOW IF YOU NEED any other EBOOK.
There is a list of more competitive Ebooks that others are downloading very much:
R S Agarwal Quantitative Aptitude PDF | FREE EBOOK | DOWNLOAD
Arun Sharma Quantitative Aptitude for CAT PDF FREE EBOOK DOWNLOAD
R S Agarwal Quantitative Aptitude PDF | FREE EBOOK | DOWNLOAD
Arun Sharma Quantitative Aptitude for CAT PDF FREE EBOOK DOWNLOAD
Harrah's Las Vegas - Mapyro
ReplyDelete› harrahs-las-vegas › 김해 출장안마 harrahs-las-vegas 제주 출장샵 Find hotels 동해 출장샵 near 속초 출장마사지 Harrah's Las 보령 출장샵 Vegas in Las Vegas, NV.