Engineer i Interview Questions | Glassdoor.co.in

# Engineer i Interview Questions

487

engineer i interview questions shared by candidates

## Top Interview Questions

Sort: RelevancePopular Date

16 Jun 2012
 Puzzle question: A Floating ship contains 1 stone , If I drop that stone in sea,,What will happen with water level??? Is it increase or decrease n why?? 8 Answersafter long discussion... concluded that it will decrease..nothing will happeneven i feel nothing will happen to the level.plz explain the ans.Show more responsesLevel will decreaseYes It will decrease, as per Arcemedes object with same masses upward buoyant force is higher for object which has larger volume area, so when stone is on boat, it increase boat weight and so upward buoyant force is high for boat, but when It is thrown its upward buoyant force is less with compare to when it is on boat, and upward buoyant force of boat also decreases because stone is thrown, so ultimately upward buoyant force decrease than means decrease in water level, hope it will help :)I think it will decrease as when the stone is on the boat the volume of water it displaces is more than when it is thrown into the sea. as more volume of water is displaced the more water level goes up we can say that water level will be higher when the stone is on the boat.The amount of water displaced is equal to the mass of the object immersed. Since the net mass of objects in water is the same, the same amount of water needs to be displaced. Hence no change in the water level.It solely depends upon the density of stone. If density of stone is higher than boat material then it will increase the water level .. Otherwise decrease

### Software Engineer Level I at Syncfusion was asked...

3 May 2016
 1. Find vowels from the given string in the first round. 2. They provided small small c# programs for each sessions5 Answersusing System; using System.Collections.Generic; using System.Linq; using System.Text; namespace ConsoleApplication1 { class Program { static void Main(string[] args) { string word; int i, j, length; int count=0; char[] vow = { 'a', 'e', 'i', 'o', 'u' }; Console.WriteLine("Enter word to find vowels"); word = Console.ReadLine(); length = word.Length; for (i = 0; i < length; i++) { for (j = 0; j < 5; j++) { if (word[i] == vow[j]) { count++; Console.WriteLine("{0}", vow[j]); } } } Console.ReadLine(); } } }please tell me what type question they will ask in programming round as well as aptitude#include int main(void) { char input[500], chars[5] = {'a','e','i','o','u'}; int i, len=0, vow[5]={0}; gets(input); while(input[len] != '\0') len++; if(len %d\n",chars[i],vow[i]); } return 0; }Show more responses#include int main(void) { char input[500], chars[5] = {'a','e','i','o','u'}; int i, len=0, vow[5]={0}; gets(input); while(input[len] != '\0') len++; if(len %d\n",chars[i],vow[i]); } return 0; }hey what the hack, why my answer not showing properly. it merge my code and sunk 3-4 lines of code. see line 10. ??? what am i suppose to do now!!!

### Software Development Engineer I at Flipkart was asked...

20 May 2016
 Design a Data Structure SpecialStack that supports all the stack operations like push(), pop(), isEmpty(), isFull() and an additional operation getMin() which should return minimum element from the SpecialStack. All these operations of SpecialStack must be O(1). To implement SpecialStack, you should only use standard Stack data structure and no other data structure like arrays, list, etc.4 AnswersUse two stacks: one to store actual stack elements and other as an auxiliary stack to store minimum values. The idea is to do push() and pop() operations in such a way that the top of auxiliary stack is always the minimum.how it can be in O(1) all these operationsYou have to maintain 2 stack. One is where first latest element is being added second is where the top element is the minimum one. While adding the element itself you can sort the stack to find perticular position with the help of a temporary stack(third stack) Below is the code for how can you add element public void push(int n) { mainStack.push(n); if(sortedStack.isEmpty()) { sortedStack.push(n); } else { int topnumber = -1; if(n= sortedStack.peek() && !sortedStack.isEmpty()) { topnumber = sortedStack.pop(); temp.push(topnumber); } sortedStack.push(n); while(!temp.isEmpty()) { topnumber = temp.pop(); sortedStack.push(topnumber); } } } } How to get minimum with O(1) public int getMin() { int n = -1; if(!sortedStack.isEmpty()) { n = sortedStack.pop(); } return n; } This will always return with complexity as O(1)Show more responsesIn that case complexity for push and pop will be o(n) as we are finding and replacing the correct position in the stack containing minimum values, push and pop should also be constant according to question

### Software Developer I at Ansys was asked...

10 Jul 2013
 Prove that limit theta tends to zero sin(theta) / (theta) tends to one?3 AnswersIt requires the understanding of trigonometry and circle geometry.Use taylor expansionSimply use L'Hôpital's rule, it's Calculus I.

### Software Development Engineer I at Microsoft was asked...

17 Aug 2012
 You've a singly linked list where every node in the list has a field "random" which points to other node in the same list. Write a function to clone this list (create a new copy of the same). Don't use extra space (just the pointer variables are fine).3 AnswersIf any problem has the condition, "Don't use extra space", it in-directly means that, you can modify the list. Clarify it. It took some time for me to clarify that I'm allowed to modify the source list.didnt get the point can you please elaborate ???There is a singly linked list: A -> B -> C -> D -> E Each node has another variable called "random". It points to another node in the same list. For example, the "random" variable in the node "B", points to some other node in this list. Say, "E". Now the question is to clone this list. Got it?!

### Software Development Engineer I at Amazon was asked...

24 Mar 2012
 Find the longest palindrome in a string3 AnswersCheck out the nice C code.. http://justprogrammng.blogspot.com/2012/05/find-longest-palindrome-in-string-onn-c.html/* * To change this template, choose Tools | Templates * and open the template in the editor. */ package towerofhanoi; import java.util.Enumeration; import java.util.Hashtable; import java.util.Vector; /** * * @author sanal */ public class PalindromeEx { public boolean isPalindrome(String str){ char[] chars = str.toCharArray(); int left = 0; int right = chars.length-1; int mid = chars.length/2; for(left=0;left One or more comments have been removed. Please see our Community Guidelines or Terms of Service for more information.

### Software Engineer On Java Technologies Having I Yr Experiance at Manhattan Associates was asked...

13 Feb 2016
 Programming Round: 1) Write a program count 1 to 50 number. Every multiple of 3 it should print " Manhattan " and Every 5 multiple it should print " Associate " and combination of 3 and 5 multiple. it should print "Manhattan Associate". 2) How to create class for Smartphone feature using oops concept. Databse: They Given Three table : shellar name,Customer,order: 1) find out all shellarename who ever purches Maruti car. 2) find out all shellername who ever purches Honda and indika car.2 Answersclass R { public static void main(String args[]) { int i=0; for(i=0;i<=50;i++) { if(i % 3==0) { System.out.println("Manhattan"); } if(i% 5==0) { System.out.println("Associate"); } if ((i%3==0) && (i%5==0)) { System.out.println("Manhattan Associate"); } else System.out.println(i); } } }public static void main(String [] args) throws Exception { System.out.println("enter the input number: "); Scanner s = new Scanner(System.in); int n = s.nextInt(); for(int i=1;i<=n;i++){ if((i%3==0)&&(i%5==0)) System.out.println(i+" Manhattan Associates"); else if(i%3==0) System.out.println(i+" Manhattan"); else if(i%5==0) System.out.println(i+" Associate"); else System.out.println(i+" conditions not met"); } }

### R&D Engineer, Senior I at Synopsys was asked...

19 Nov 2010
 Joan and Jim agree to meet at the library after school between 3 and 4 p.m. Each agrees to wait no longer than 15 min for the other. What is the probability that they will meet?3 Answers1 - (1/2)*(3/4)^2 = 0.4375(2*45*15)/(60 *60 ) = 3/8 One or more comments have been removed. Please see our Community Guidelines or Terms of Service for more information.

### Associate Engineer Level I at Publicis Sapient was asked...

29 Aug 2015
 In the Technical Interview, as I was from computer science background. They tested by basic skills in coding and asked me to solve a number of puzzles. Then I was asked to briefly explain my projects. I think this is where they expect you to express yourself as much as possible. The HR round was chill. They just get to know you better and understand where you can fit the job role.2 AnswersI was very calm. Even though I did not know the answer to a few question, I discussed it with the people from the panel and got to the solution eventually. They were very helpful and open to learning. was a good experiencedid you receive any offer letter or mail after the completion of interview???????????

### Software Engineer I at Citrix was asked...

26 May 2017
 Every number between two twin primes is a number divisible by 6 can you prove it?2 AnswersThink about it.A number between two twin primes is divisible by 6 is not always true. As 3 and 5 are also twin primes and 4 is not divisible by 6.
110 of 487 Interview Questions