Upload Button Icon Add office photos

FB Cakes N Sweets System Engineer Specialist Interview Questions and Answers

Be the first one to contribute and help others!

Interview questions from similar companies

I was interviewed in Apr 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Medium

  • Q1. Game In Space

    Ninja is in space with his super spaceship having unlimited fuel. Ninja initially has a health level ‘H’ and his spaceship has an armour ‘A’. He decides to play a game, where at any instant h...

  • Ans. Recursive

    The idea is simple, we will check all the possible ways of choosing planets with the help of recursion and find out which combination gives maximum time. 

     

    Along with this, we will prefer to move Mars whenever possible as it is always beneficial to make a move to Mars.

     

    • So we will make a recursive function named SOLVE which will receive 3 parameters ‘H’, ‘A’ and ‘MOVE_MARS’.
    • Initialize a bool varia...
  • Answered Anonymously
  • Q2. Rat In A Maze

    You are given a starting position for a rat which is stuck in a maze at an initial point (0, 0) (the maze can be thought of as a 2-dimensional plane). The maze would be given in the form of a...

  • Ans. Bactracking

    Approach: We can start the traversal of the paths from the rat’s starting position, i.e. (0,0) keeping track of the visited cells during the traversal. We will recursively go through all the paths possible until the last index of the grid (destination) is reached, and add the path information using which the rat successfully reached the end.

     

    Algorithm is as follows:

     

    1. Take the starting position of th...
  • Answered Anonymously
Round 2 - Coding Test 

(2 Questions)

Round duration - 90 Minutes
Round difficulty - Medium

  • Q1. M-Coloring Problem

    You are given an undirected graph in the form of an adjacency matrix along with an integer M. You need to tell if you can color the vertices of the graph using at most M colors such that...

  • Ans. Brute Force
    • We generate all possible combinations of colors possible for coloring the given graph.
    • This can be done recursively by assigning a node each color from 1 to M and doing the same for all nodes.
    • We further check if the adjacent vertices don’t have the same color.
    • If we find such a combination of vertices, we return “YES”. Otherwise, we return “NO”.
    Space Complexity: OtherExplanation:

    O(V) where V is the number of ...

  • Answered Anonymously
  • Q2. Shortest path in an unweighted graph

    The city of Ninjaland is analogous to the unweighted graph. The city has ‘N’ houses numbered from 1 to ‘N’ respectively and are connected by M bidirectional roads. If a...

  • Ans. BFS
    • Store all the edges in the form of an adjacency list ADJ. if ADJ[X][j] = Y which means there is an edge from X to Y.
    • Declare a queue Q and push S in it and also declare two vectors VISITED and DISTANCE which will store whether a house is visited or not and what is a distance of the house from house S respectively.
    • We will also store the PARENT, that store the node from which we will reach the current node. It will hel...
  • Answered Anonymously

Interview Preparation Tips

Professional and academic backgroundI applied for the job as System Engineer Specialist in BangaloreEligibility criteriaNo criteriaInfosys interview preparation:Topics to prepare for the interview - Data structures, Object oriented programming, Operating systems, Database management system, Web developmentTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Solve competitive programming questions regularly.
Tip 2 : Work on some live projects

Application resume tips for other job seekers

Tip 1 : Have some good skills
Tip 2 : Show some live projects

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Nov 2020.

Round 1 - Coding Test 

Round duration - 50 minutes
Round difficulty - Medium

Consisted of two parts- Verbal and quantitative aptitude with 1 mark for each correct answer and -0.33 mark for each wrong answer.

Round 2 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

Took place at 10 a.m morning.
Consisted of 2 questions which has to solved in 1 hour. First problem had to be solved to view the next question. Both were easy implementation adhoc problems.

  • Q1.  Most Cost Efficient Car

    You are given the price of ‘Petrol’ cars, the maintenance cost of the car per month, number of kilometers a car runs in one liter, amount of Petrol per liter, and number of kilomet...

  • Ans. Formula Based

    Approach: The basic idea is that, find the total cost of a ‘Petrol’ car and ‘Diesel’ car for 6 months.

     

    Algorithm is as follows: 

    1. Compute the Cost of both cars:
    2. Cost if we use ‘Petrol’ car:-
      • ‘ACTUALPRICE’ = Price of ‘Petrol’ car
      • ‘MAINTAINANCECOST’ = maintenance cost of ‘Petrol’ car per month’ * 6
      • ‘FUELCOST’ = per kilometer ‘Petrol’ charge * number of kilometers a ‘Petrol’ car run in a month * 6 ( for o...
  • Answered Anonymously
  • Q2. Constellation

    Given a matrix ‘UNIVERSE’ with 3 rows and ‘N’ columns, with the characters { # , * , . } and these characters represent a cluster of stars and galaxies in space. Stars are represented by ‘*’ ...

  • Ans. Recursive Approach

    The key idea is to recursively check every 3x3 grid and see what vowel does it signify and it to the string. This can be easily done using a recursive function.

     

    Here is the algorithm :

     

    1. We take a recursive function ‘generateConstellations()’ and take parameters, ‘CURIDX’, which denotes the current column we are at, a matrix ‘UNIVERSE’ to denote the stars and constellations.
    2. We define ‘MAT’ as ...
  • Answered Anonymously
Round 3 - Video Call 

(1 Question)

Round duration - 50 minutes
Round difficulty - Medium

Took place at 1 pm at noon and I was very confident. Three interviewers were present- One technical , One managerial and One HR .
Initially, the interviewers introduced themselves and asked me to introduce myself.
Then, I was asked about my project.

  • Q1. Word Break II

    You are given a non-empty string S containing no spaces’ and a dictionary of non-empty strings (say the list of words). You are supposed to construct and return all possible sentences after ...

  • Ans. Recursion

    We need to keep exploring the given string from current position ‘i’ to until we wouldn’t find a position such that substring ‘i’ to ‘j’ exists in the dictionary.
     

    Algorithm:

    • Store all words of the dictionary in a set to speed up the process of checking whether a current word exists in the dictionary or not.
    • Base condition, If we have checked for all the substrings, then just return with a list containing on...

  • Answered Anonymously

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from SASTRA Deemed to be University. I applied for the job as System Engineer Specialist in ChennaiEligibility criteria7 CGPATata Consultancy Services (TCS) interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, C++, Java, Operating Systems, Computer Networks, DBMS.Time required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Should be strong in Data structures and Algorithms. 
Tip 2 : Should be proficient Computer Science fundamentals. 
Tip 3 : Try to have good soft skills.

Application resume tips for other job seekers

Tip 1: Should be thorough on all things present in Resume.
Tip 2: Have a minimum of 1 good project in Resume.
Tip 3: Try to keep the resume to 1 page(for freshers) and maximum 2 pages(for experienced).

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Mar 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 180 Minutes
Round difficulty - Medium

Round 1 - Coding Contest on HackerEarth (Elimination round)
Number of questions - 3 ( Level - leetcode Medium)

  • Q1. Palindrome Partitioning

    You are given a string 'S'. Your task is to partition 'S' such that every substring of the partition is a palindrome. You need to return all possible palindrome part...

  • Ans. Backtracking with Dynamic Programming
    • We are iterating each time to check whether a given substring is palindrome or not and there we are iterating the same substring of string again and again. So there are overlapping subproblems.
    • So we use dynamic programming. To overcome the overlapping subproblems we can initially create the DP table which stores if substring[i….j] is palindrome or not. We maintain a boolean dp[N][N]...
  • Answered Anonymously
  • Q2. Rearrange The Array

    You are given an array/list NUM of integers. You are supposed to rearrange the elements of NUM such that no two adjacent elements will be the same or find out if it not possible.

    For e...
  • Ans. Greedy Approach

    The key idea is to put the highest frequency element first (a greedy approach). We will be using the priority queue to pick the elements with the highest frequency. 

     

    So first, we will store the frequency of each element. And then we will store all the numbers with their frequencies into the priority queue in the highest frequency priority manner. 

     

    After that, we will pop elements one ...

  • Answered Anonymously
  • Q3. Ways To Make Coin Change

    You are given an infinite supply of coins of each of denominations D = {D0, D1, D2, D3, ...... Dn-1}. You need to figure out the total number of ways W, in which you can make a cha...

  • Ans. Recursion

     

    1. The idea is to use recursion.
    2. For a particular coin, we have two options either include it or exclude it.
    3. If we include that coin, then calculate the remaining number that we have to generate so recur for that remaining number.
    4. If we exclude that coin, then recur for the same amount that we have to make.
    5. Our final answer would be the total number of ways either by including or excluding.
    6. There will be two edg...
  • Answered Anonymously

Interview Preparation Tips

Eligibility criteriaNo active backlogsInfosys interview preparation:Topics to prepare for the interview - Topics mentioned in Resume, OOPs, DBMS, OS, CN , Some basic System Design questions, Intro, project explanation, questions to ask from the interviewerTime required to prepare for the interview - 6 MonthsInterview preparation tips for other job seekers

Tip 1 : Try to cover all the most asked interview questions for each topic
Tip 2 : Read previous year interview experiences
Tip 3 : Focus on your communication skills

Application resume tips for other job seekers

Tip 1 : Keep your resume of 1 page
Tip 2 : Mention 2-3 descent projects

Final outcome of the interviewRejected

Skills evaluated in this interview

I was interviewed in Feb 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Medium

first round was mcq based on aptitude,dbms and output based questions

  • Q1. DBMS

    theory questions and SQL

Round 2 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Medium

it was coding as well as mcq round

  • Q1. Reset Matrix

    You have given a 2-dimensional array ‘ARR’ with ‘N’ rows and ‘M’ columns in which each element contains only two values,i.e., 0 and 1. Your task is to convert the given matrix into the Good ma...

  • Ans. Brute Force

    A simple method is to create a 2-dimensional array to store the changes we need to update in the original matrix to convert the given matrix into the Good matrix.
     

    Our approach will be to create a 2-dimensional array answer with N rows and M columns, and we will copy all elements value present in the matrix ARR into the matrix answer. We will iterate the variable row from 0 to N - 1, and in each iteratio...

  • Answered Anonymously
Round 3 - HR 

Round duration - 15 minutes
Round difficulty - Easy

Round 4 - Coding Test 

(1 Question)

Round duration - 180 minutes
Round difficulty - Easy

  • Q1. Print Diagonal

    You are given a 2D matrix, your task is to return a 2D vector containing all elements of the matrix in a diagonal fashion.

    Example:

    Following will be the output of the above matrix:

    1...

  • Ans. Ad Hoc approach

    We will try to solve the following problem by dividing it into two parts. In the first part, we will choose each element of the first column as a starting point and print diagonally upward starting at it. In the second part, we will choose each element of the last row as a starting point (except the first element as it has already been processed in the previous part) and print diagonally upward starting ...

  • Answered Anonymously
Round 5 - Face to Face 

Round duration - 25 minutes
Round difficulty - Easy

It was in the late afternoon since it was virtual location and environment didn't affected that much, interviewer was very friendly he asked how my day went and then went on starting with my introduction.

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Department of Mechanical Eng, University Institute of Technology ,RGPV. Eligibility criteriaNo criteriaInfosys interview preparation:Topics to prepare for the interview - Data Structure and algorithm, aptitude and reasoning, projects details, database management system, operating system, object oriented programming language, computer networks.Time required to prepare for the interview - 3-4 monthsInterview preparation tips for other job seekers

Tip 1 : Make at-least 2-3 projects and know those projects inside out, need to have complete understanding of how the project works and how things are working inside project
Tip 2 : Practice DSA at-least 200 questions.
Tip 3 : Practice aptitude and reasoning questions.

Application resume tips for other job seekers

Tip 1: Don't write anything fake in resume
Tip 2: Don't make resume too lengthy.
Tip 3: Have some projects on resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 180 Minutes
Round difficulty - Medium

This round consists of objective and hands-on questions that are needed to be answered within 3 hours. You have to score 65% or above in this round to be eligible for a job interview at Infosys.

  • Q1. Distinct Strings With Odd and Even Swapping Allowed

    You are given an array of strings. Your task is to find the number of unique strings.

    A string is considered unique if it cannot be formed from any oth...

  • Ans. Encoding String Using Sorting
    • The idea behind this approach is to encode every string using the even and odd index characters of the string.
    • For any given string, we split the string into two substrings, one with all the even indexed characters, say evenString and the other with all the odd indexed characters, say oddString.
    • In order to generate the encoded string, we sort both these strings and concatenate them to genera...
  • Answered Anonymously
  • Q2. Ninja Technique

    Ninja has its own technique of making a decision to do something or not. This technique is known as the ninja technique. In this technique, Ninja generates a random string containing only d...

  • Ans. Iterative Approach
    • We have to find out all the substring of our given string. For this, we use the function ‘subString’ which takes the length of our string and our string ‘str’.
    • We have to run three nested loops:
      • First loop iterate starting ‘i’ from ‘0’to size of string ‘str’
      • Iterate second nested loop  ‘i’ from ‘0’to ‘n-i+1
      • Through our third nested loop, we choose a starting point and ending point and provide values ...
  • Answered Anonymously
Round 2 - Coding Test 

(2 Questions)

Round duration - 180 Minutes
Round difficulty - Hard

This exam has 3 coding Questions – Easy( 50 points), Medium (75 points), Hard (100 points), total 225 points, and the points are assigned according to the number of test cases you pass

  • Q1. Flip Bits

    You are given an array of integers ARR[] of size N consisting of zeros and ones. You have to select a subset and flip bits of that subset. You have to return the count of maximum one’s that you c...

  • Ans. Brute force

    The idea is to check for all the possible subarrays and inside each subarray, check for the highest value of the difference between the count for zeroes and ones for this. Let’s consider this highest difference to be MAX and initialize it to zero so formally MAX = count of zeroes in that subarray - count of ones in the same subarray.

     

    • Initialize TOTALONES to zero, which will store the total count of ones...
  • Answered Anonymously
  • Q2. Glowing Bulbs

    There are an infinite number of electric bulbs. Each bulb is assigned a unique integer starting from 1. There are ‘N’ switches also and each switch is labeled by a unique prime number. If a...

  • Ans. Brute Force

    This approach is straightforward, we will keep a ‘COUNTER’ initialized with 0. Then we iterate over integers starting from 2. For each integer, we will check whether it is multiple of any of the given ‘N’ prime numbers in the list ‘LABELS’ or not.  If it is multiple of any of those prime numbers then we increment the ‘COUNTER’ by ‘1’.  When the value of ‘COUNTER’ becomes ‘K’ then we return the curr...

  • Answered Anonymously
Round 3 - HR 

Round duration - 45 Minutes
Round difficulty - Medium

Basic Introduction and detailed discussion on the projects, after that i was given some basic coding problems and after that some discussion on Oops and detailed discussion on Database,
Interviewer was cool and being supportive so overall it was a good experience.

Interview Preparation Tips

Professional and academic backgroundI completed Information Technology from Oriental Institute of Science and Technology. I applied for the job as System Engineer Specialist in BangaloreEligibility criteria60% throughout with no standing arrearsInfosys interview preparation:Topics to prepare for the interview - OOPS, DBMS, Data Structures, Cloud Computing, Operating System, Computer NetworkingTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Tip 1 : Never answer any question that you do not know, try to answer as precisely as you can
Tip 2 : Prepare your resume, they can any thing from that and you can't deny that you don't know
Tip 3 : Projects increase your chances so prepare atleast two

Application resume tips for other job seekers

Tip 1 : Be honest, make sure what are you mentioning on it, one false information can leads to disqualification
Tip 2 : Projects are mandatory, basically it reflects your practical skills so focus on this part.
Tip 3 : Any experience like an internship would be appreciated.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview Questionnaire 

3 Questions

  • Q1. What are ACID properties?
  • Ans. 

    ACID properties are a set of properties that ensure database transactions are processed reliably.

    • ACID stands for Atomicity, Consistency, Isolation, and Durability.

    • Atomicity ensures that a transaction is treated as a single, indivisible unit of work.

    • Consistency ensures that a transaction brings the database from one valid state to another.

    • Isolation ensures that concurrent transactions do not interfere with each other.

    • Du...

  • Answered by AI
  • Q2. Thrashing in OS?
  • Ans. 

    Thrashing is a phenomenon in OS where excessive paging occurs, leading to a decrease in system performance.

    • Occurs when the system is overcommitted with too many processes or tasks

    • Causes excessive swapping of pages between RAM and disk

    • Can be resolved by adding more RAM or reducing the number of processes

    • Can be identified by monitoring page fault rates

  • Answered by AI
  • Q3. What are NOSQL databases?
  • Ans. 

    NOSQL databases are non-relational databases that store and retrieve data in a flexible and scalable manner.

    • NOSQL stands for 'Not Only SQL'

    • They are designed to handle large volumes of unstructured or semi-structured data

    • They offer high scalability and availability

    • Examples include MongoDB, Cassandra, and Couchbase

  • Answered by AI

Skills evaluated in this interview

I was interviewed in Oct 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 180 minutes
Round difficulty - Easy

Timing :- They conducted test in day time on weekends.
Problems :- Round consist of 3 coding problems.
Environment :- Test was web proctored.
Other :- Only 1 problem is needed to clear this round.

  • Q1. Prime time again

    You have been given two integers ‘DAY_HOURS’ and ‘PARTS’. Where ‘DAY_HOURS’ is the number of hours in a day and a day can be divided into ‘PARTS’ equal parts. Your task is to find total in...

  • Ans. Brute Force
    • This is a Naive/Brute Force approach
    • Create a 2-d array of size ‘P’ rows and ‘D/P’ columns and assign 1 to ‘D’ value in each cell.
    • Take an example with ‘D’ being 12 and ‘P’ being 2, then create an array [  [1,2,3,4,5,6]  [7,8,9,10,11,12]  ]
    • Keep track of the number of prime group instances using a ‘PRIME_GROUP’ variable, which would be initialized to 0.
    • We can easily observe that each column in th...
  • Answered Anonymously
Round 2 - Coding Test 

(1 Question)

Round duration - 180 minutes
Round difficulty - Medium

Timing :- 10 a.m. - 1 p.m. ( 3 hours )
Problems :- 3 coding problems were in this round ( Easy, Medium, Hard ) basis. You can not check the submission results in this round. So, can't be sure whether solution you submitted is correct or not. PPI oppurtunity for roles in infosys (SE, SES, Power Programmer) were based on this round.

  • Q1. Rotting Oranges

    You have been given a grid containing some oranges. Each cell of this grid has one of the three integers values:

  • Value 0 - representing an empty cell.
  • Value 1 - representing a fresh...
  • Ans. Naïve Solution

    The idea is very simple and naive. We will process the rotten oranges second by second. Each second, we rot all the fresh oranges that are adjacent to the already rotten oranges. The time by which there are no rotten oranges left to process will be our minimum time.

     

    In the first traversal of the grid, we will process all the cells with value 2 (rotten oranges). We will also mark their adjacent cells ...

  • Answered Anonymously
Round 3 - Face to Face 

(1 Question)

Round duration - 50 minutes
Round difficulty - Medium

After getting the PPI offer from Infosys and waiting for long 2 months. On 12th October my interview was scheduled, it was a 1 hour interview 12 noon - 1 p.m. Interview was conducted on Infosys Meridian ( Infosys Own Platform ). A meeting id was provided in mail, and we can not join before interviewer. HR contact number was provided in mail.

Interview begin :-

Interviewer :- Good afternoon, So tell me something about your family forget about your acdemics now. ( He was trying to make me comfortable ).
Me :- Told about my family, what they are doing and something about myself.

Interviewer :- You are from electrical, then why you preferred coding instead of going Navratna Electrical companies ( Bhel, NTPC)
Me :- I started coding from 2nd year and i found myself more interested in this. So, i just followed my passion.

Interviewer :- In which programming language are you comfortable ?
Me :- C++

Interviewer :- Why?
Me :- Because its faster than Java and Python and easy to implement. And i take part in competitive programming contest on Codechef, Codeforces so, C++ consists of Standard Template Library which is beneficial.

Interviewer:- What is this pointer?
Me:- This pointer represents to the current object in a class.

Then he asked few more question on C++ ( difference between call be value and call be reference, namespace, some C++ libraries)

Interviewer:- In which CSE topics are you comfortable?
Me:- DS and Algo, OOPS

Interviewer:- Can you write some queries?
Me:- I practised one day before few SQL queries but i was not confident. So, dont want to give a try I answered "No sir".

Interviewer:- What is flux?
Me:- Magnetic flux passing through a unit area.

Then he start asking few more question form electrical core. I was not able to answer. I said him I am not good in electrical core. I am more interested to solve any DS/Algo question.

Interviewer:- Make a doubly linked list of 5 elements and apply merge sort on it. He asked me to share the screen and open any of my favourite online editor.
Me:- I coded on Codechef-IDE. First dicuss the logic with him and then coded witn explaining him each line. Th code run successfully and Interviwer seems to satisfy.

Then, he pasted a piece of code in Python in a doc sheet and send me. He asked me to solve that problem. It was based on concepts of OOPS. Consisting of 3 classes and relation of Inheritance, Copy constructor, Parameterised Constructor was there in that problem. I step by step solve that problem and gave final output to interviewer. Interviewer was satisfied with output and said it was correct.

Interviewer:- I am done with interviewer. I check your coding knowledge. Do you have any questions for me?
Me:- Asked about training process in infosys.

Verdict:- Selected

  • Q1. MergeSort Linked List

    For a given Singly Linked List of integers, sort the list using the 'Merge Sort' algorithm.

    Input format :
    The first and the only line of input contains the elements of the ...
  • Ans. Merge Sort Linked List
    1. The idea is to take a recursive approach by calling the sort function on the left half and right half of the list.
    2. In order to do so, get the middle node and split the list into two halves. We can use a two-pointer technique to get the middle node by running a slow and a fast pointer.
      1. The idea here is to move both the slow and fast pointer simultaneously until fast reaches the end of the list.
      2. Here, ...
  • Answered Anonymously

Interview Preparation Tips

Professional and academic backgroundI completed Electrical Engineering from National Institute of Technology, Meghalaya. Eligibility criteriaShould be in BTECH final yearInfosys interview preparation:Topics to prepare for the interview - C, C++, DBMS, OOPS, Data Structure and AlgorithmTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Go through your resume properly and mention only those points in which you are comfortable to answer.
Tip 2 : Prepare interview question on any one programming language properly 
Tip 3 : Be prepared with any one of your project ( if done )

Application resume tips for other job seekers

Tip 1 : Have at least one project or experience in your resume.
Tip 2 : Do not put false things on your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Nov 2020.

Interview Questionnaire 

3 Questions

  • Q1. Questions aroud CS Funfamentals and basic programming questions.
  • Q2. Write a program to check if a number is a palindrome or not.
  • Ans. 

    Program to check if a number is a palindrome or not.

    • Convert the number to a string

    • Reverse the string

    • Compare the reversed string with the original string

    • If they are the same, the number is a palindrome

  • Answered by AI
  • Q3. Find the sum of all the even numbers in an array
  • Ans. 

    Sum of even numbers in an array

    • Loop through the array and check if each element is even

    • If even, add it to a running sum

    • Return the sum

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident while answaering the questions.

Speak out loud what you are thinking while coding.

Good Luck!

Skills evaluated in this interview

I applied via Company Website and was interviewed before Dec 2019. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. There were questions on Dbms, final year project, Data structures.

Interview Preparation Tips

Interview preparation tips for other job seekers - Do not think that you know everything. The interviewer is already in that field from a long time.
Answer only those questions in which you think you are confident.
If you don't know the answer simply tell him/her that you don't know.
Foe more information ping me on LinkedIn- Apoorva Agnihotri

I applied via Company Website and was interviewed before Dec 2019. There were 4 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Questions were on Dbms, Data structures, final year project, etc

Interview Preparation Tips

Interview preparation tips for other job seekers - Keep it simple.
Interviewer knows much more than you.
Don't argue and if you don't know the answer simply say that you don't know
Contribute & help others!
anonymous
You can choose to be anonymous

Tell us how to improve this page.

Anonymously discuss salaries, work culture, and many more

Get Ambitionbox App

Interview Questions from Similar Companies

TCS Interview Questions
3.7
 • 10.3k Interviews
Accenture Interview Questions
3.9
 • 8.1k Interviews
Infosys Interview Questions
3.7
 • 7.6k Interviews
Wipro Interview Questions
3.7
 • 5.6k Interviews
Cognizant Interview Questions
3.8
 • 5.5k Interviews
Amazon Interview Questions
4.1
 • 5k Interviews
Capgemini Interview Questions
3.8
 • 4.8k Interviews
Tech Mahindra Interview Questions
3.5
 • 3.8k Interviews
HCLTech Interview Questions
3.5
 • 3.7k Interviews
Genpact Interview Questions
3.9
 • 3k Interviews
View all
Compare FB Cakes N Sweets with

TCS

3.7
Compare

Accenture

3.9
Compare

Wipro

3.7
Compare

Cognizant

3.8
Compare
Did you find this page helpful?
Yes No
write
Share an Interview