Upload Button Icon Add office photos

Filter interviews by

Comcast India Engineering Center Associate Engineer Interview Questions and Answers

Updated 28 Dec 2022

Comcast India Engineering Center Associate Engineer Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed before Dec 2021. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Aptitude Test 

Questions on Aptitude+ CS subjects+ Coding problems

Round 3 - Technical 

(3 Questions)

  • Q1. Why do want to work for us?
  • Q2. What is Prime Indexing and how is it different from Secondary indexing?
  • Ans. 

    Prime indexing is the use of a unique identifier as the primary index for a database table, while secondary indexing uses other attributes.

    • Prime indexing is faster than secondary indexing as it directly accesses the data.

    • Primary index is usually the first column in a table, while secondary index can be any other column.

    • Primary index ensures uniqueness of data, while secondary index improves query performance.

    • Example of...

  • Answered by AI
  • Q3. Questions on resume and indepth discussion on projects

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident and true to yourself. Try to drive the conversation only on your strengths and don't panic if you don't know something, just admit it and give your best, All the best

Interview questions from similar companies

I appeared for an interview before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Medium

It was Technical + Aptitude MCQ round.The technical section consisted if MCQ related to DSA,OS,DBMS.The aptitude section consisted of questions related to basic mathematics.

  • Q1. 

    Candies Distribution Problem Statement

    Prateek is a kindergarten teacher with a mission to distribute candies to students based on their performance. Each student must get at least one candy, and if two s...

  • Ans. 

    The task is to distribute candies to students based on their performance while minimizing the total candies distributed.

    • Create an array to store the minimum candies required for each student.

    • Iterate through the students' ratings array to determine the minimum candies needed based on the given criteria.

    • Consider the ratings of adjacent students to decide the number of candies to distribute.

    • Calculate the total candies req...

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 30 minutes
Round difficulty - Medium

It was a technical interview testing the basic skills of OS and DBMS of candidates along with few project discussions from your CV.

  • Q1. Can you write 15 Linux commands along with their functions?
  • Ans. 

    List of 15 Linux commands with their functions

    • ls - list directory contents

    • pwd - print working directory

    • cd - change directory

    • mkdir - make a new directory

    • rm - remove files or directories

    • cp - copy files and directories

    • mv - move or rename files and directories

    • grep - search for patterns in files

    • chmod - change file permissions

    • ps - display information about running processes

    • top - display and update sorted information about pr...

  • Answered by AI
  • Q2. What are DDL (Data Definition Language) and DML (Data Manipulation Language)?
  • Ans. 

    DDL is used to define the structure of database objects, while DML is used to manipulate data within those objects.

    • DDL includes commands like CREATE, ALTER, DROP to define database objects like tables, indexes, etc.

    • DML includes commands like INSERT, UPDATE, DELETE to manipulate data within tables.

    • Example of DDL: CREATE TABLE employees (id INT, name VARCHAR(50));

    • Example of DML: INSERT INTO employees VALUES (1, 'John Doe

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Vellore Institute of Technology. I applied for the job as System Engineer in BangaloreEligibility criteriaAbove 8 CGPACerner Corporation interview preparation:Topics to prepare for the interview - Data Structures, DBMS, Linux, Algorithms,Cloud computing, Operating systemsTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Be clear about the concepts of Linux and shell scripting.
Tip 2 : Learn about the basics of Data structures and Algorithm.
Tip 3 : Be prepared to explain your projects mentioned in your CV.

Application resume tips for other job seekers

Tip 1 : Use professional Keywords in your resume.
Tip 2 : Don't mention anything you are not confident in.

Final outcome of the interviewSelected

Interview Preparation Tips

Round: Interview
Experience: They asked to write 2 codes on recursion. Then some questions on resume. I asked them about the job profile and after knowing that they were hiring candidates for frontend programming, about which they didn’t mention in JAF. I told them that I was not interested in frontend development. And didn’t even answer any question after that. Unfortunately, I was selected.

General Tips: Plan your schedule judiciously keeping your capacity in mind. There is no point of making ideal plans and then not able to do even 50% of it.
Don’t get into unnecessary arguments or debate with people.
Don’t think about what others are doing. Focus on your preparation.
How you carry yourself matters. So, make sure you portray yourself in the way you want the other person to perceive you.
Be selective while applying for companies.
College Name: IIT Kanpur

I applied via Recruitment Consultant and was interviewed in May 2019. There were 4 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. What is your day to day work?
  • Q2. What new you have to offer the organization?
  • Q3. The most recent issues that you faced in the organization?

Interview Preparation Tips

Interview preparation tips for other job seekers - Be true to yourself and the interviewer, he/she doesn't want you to be full of all technical skills. He/she wants you to be atleast good at the things mentioned in your resume. Showcase that you're ready to switch to any language even if it is uncomfortable for you

Software Engineer Interview Questions & Answers

Chetu user image Nirban Chatterjee

posted on 11 Oct 2020

I applied via Naukri.com and was interviewed before Oct 2019. There was 1 interview round.

Interview Questionnaire 

2 Questions

  • Q1. Normal php questions like overriding,overloading,traits,interface,abstarct class nothing else.. It was online but in 2016.
  • Q2. Go though those topic as they are very important and asked in most companies.

Interview Preparation Tips

Interview preparation tips for other job seekers - Read those topics and try to understand with example and doing on your own.Before entering Chetu prepare yourself that you may get fire anytime.Because hiring and firing is lot in Chetu but in terms of salary it is good.

Interview Preparation Tips

Round: Test
Experience: Though technical questions were not that difficult but the quant section was way too hard and almost impossible to solve completely in given time limit.
Tips: It’s better if you attempt less questions (in quant) but do them right (I attempted less than 40% quant and still got through).

Round: Technical Interview
Experience: Next they would have 2-3 technical rounds where they cover most of the areas of CS. Some of the areas where they concentrated more would be Algorithms, OOPS Concepts and Logical Puzzles.
Tips: Brush up important concepts from various areas such as Operating System, OOPS, Software Engineering. Be ready for some really challenging questions in Algorithms. Also they do ask quite a few logical puzzles so it’s important you practice a lot of them online before the interview.

General Tips: D E Shaw selects very few candidates + comes in starting weeks of placement season, so competition is immense. Multiple companies come on same day, so it becomes a little tedious. Surely I wasn't the better candidate that day.
Skill Tips: D E Shaw focuses more on your ability to solve logical problems, so make sure you are in best state of your mind and speak while solving any problem because what they are looking for is not the right answer (well of course they are) but also how are you approaching the problem.
Skills: Operating System, OOPS, Algorithms, CS, logical puzzles, Quant
College Name: NIT SURATHKAL

Interview Questionnaire 

21 Questions

  • Q1. AVL tree balance checking
  • Q2. Median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity
  • Ans. 

    Find median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity

    • Use binary search to find the partition point in both arrays

    • Calculate the median based on the partition point and array sizes

    • Adjust the partition points based on the median value

    • Repeat until the partition points are at the median

    • Handle edge cases such as empty arrays and uneven array sizes

  • Answered by AI
  • Q3. Strings Anagram in O(1) space complexity
  • Ans. 

    Anagram of strings in O(1) space complexity

    • Use a fixed size array of integers to store the frequency of characters in the first string

    • Iterate through the second string and decrement the frequency of each character in the array

    • If all the frequencies are zero, then the strings are anagrams

    • Return true or false accordingly

  • Answered by AI
  • Q4. Level order traversal of a tree using Queue
  • Ans. 

    Level order traversal of a tree using Queue

    • Create a queue and add the root node to it

    • While the queue is not empty, remove the front node and print its value

    • Add the left and right child nodes of the removed node to the queue

    • Repeat until the queue is empty

  • Answered by AI
  • Q5. Reverse level order traversal of a tree using Queue
  • Ans. 

    Reverse level order traversal of a tree using Queue

    • Create a queue and push the root node into it

    • While the queue is not empty, pop the front node and push its children into the queue

    • Add the popped node to a stack

    • Once the queue is empty, pop elements from the stack and print them

  • Answered by AI
  • Q6. BFS and DFS Difference
  • Ans. 

    BFS and DFS are graph traversal algorithms. BFS explores nodes level by level while DFS explores nodes depth by depth.

    • BFS uses a queue while DFS uses a stack or recursion.

    • BFS is optimal for finding shortest path while DFS is optimal for finding a path between two nodes.

    • BFS requires more memory as it stores all the nodes at each level while DFS requires less memory.

    • BFS can be used to find connected components while DFS

  • Answered by AI
  • Q7. OS Concepts – Starvation, Demand Paging, Virtual Memory, Deadlocks
  • Q8. Parenthesis Balance Checking
  • Q9. Three Jars - 1 with apples, 1 with oranges, 1 with apples and oranges. All of them wrongly labelled. Find min no of attempts to find the correct nature of boxes
  • Q10. Find product of each element of an array except that element in O(N) time complexity without using / operation
  • Ans. 

    Find product of each element of an array except that element in O(N) time complexity without using / operation

    • Use prefix and suffix products

    • Multiply prefix and suffix products for each element to get the final product

    • Handle edge cases where array has 0 or 1 element separately

  • Answered by AI
  • Q11. Recursively deleting linked list
  • Ans. 

    Recursively delete a linked list

    • Create a recursive function that takes the head of the linked list as input

    • Base case: if the head is null, return

    • Recursively call the function with the next node as input

    • Delete the current node

  • Answered by AI
  • Q12. Recursively deleting linked list from end
  • Ans. 

    Recursively delete a linked list from the end.

    • Start from the head and recursively traverse to the end of the list.

    • Delete the last node and set the second last node's next pointer to null.

    • Repeat until the entire list is deleted.

    • Use a recursive function to implement the deletion process.

  • Answered by AI
  • Q13. Recursively deleting tree
  • Ans. 

    Recursively delete a tree by deleting all its child nodes and then the parent node.

    • Start from the leaf nodes and delete them first.

    • Then move up to the parent nodes and delete them.

    • Repeat until the root node is deleted.

    • Use post-order traversal to ensure child nodes are deleted before parent nodes.

  • Answered by AI
  • Q14. Recursively deleting from end
  • Ans. 

    Recursively delete elements from the end of an array.

    • Create a recursive function that removes the last element of the array.

    • Call the function recursively until the desired number of elements are removed.

    • Handle edge cases such as empty arrays and removing more elements than the array contains.

  • Answered by AI
  • Q15. Difference between Floyd Warshall and Djikstra
  • Ans. 

    Floyd Warshall finds shortest path between all pairs of vertices while Djikstra finds shortest path from a single source.

    • Floyd Warshall is used for dense graphs while Djikstra is used for sparse graphs.

    • Floyd Warshall has a time complexity of O(n^3) while Djikstra has a time complexity of O((n+m)logn).

    • Floyd Warshall can handle negative edge weights while Djikstra cannot.

    • Floyd Warshall can detect negative cycles while Dj

  • Answered by AI
  • Q16. Shortest path between 2 points in 2-D space in O(log N) time
  • Ans. 

    There is no known algorithm to find shortest path in 2-D space in O(log N) time.

    • The best known algorithm for finding shortest path in 2-D space is Dijkstra's algorithm which has a time complexity of O(N^2).

    • Other algorithms like A* and Bellman-Ford have better time complexity but still not O(log N).

    • If the points are on a grid, Lee algorithm can be used which has a time complexity of O(N).

  • Answered by AI
  • Q17. Design a system for putting newspapers using classes and functions taking different aspects into account
  • Ans. 

    Design a system for putting newspapers using classes and functions

    • Create a Newspaper class with attributes like title, date, and content

    • Create a Publisher class with methods to publish and distribute newspapers

    • Create a Subscriber class with methods to subscribe and receive newspapers

    • Use inheritance to create different types of newspapers like daily, weekly, etc.

    • Implement a database to store newspaper information and ha

  • Answered by AI
  • Q18. SQL commands
  • Q19. Career Prospects - Long Term Plans
  • Q20. Why not higher studies?
  • Ans. 

    I believe practical experience is more valuable than higher studies.

    • I have gained valuable experience through internships and projects.

    • I prefer hands-on learning and problem-solving over theoretical knowledge.

    • I am constantly learning and improving my skills through online courses and workshops.

  • Answered by AI
  • Q21. Machine Learning Concepts - Based on my projects

Interview Preparation Tips

Round: Test
Experience: All Computer Science Topics Covered: Data Structures, Algorithms, Object Oriented Systems, C, C++, Operating Systems, Computer Architectures, Databases, SQL, Basic Quantitative Aptitude
Tips: Solve all of them. Cut off's generally go high.
Duration: 30 minutes
Total Questions: 30

Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.

Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.

Round: Interview
Experience: Nice Experience. Interviewer was friendly.
Tips: Do not fake yourself.

General Tips: Be thorough with all CS related concepts and projects.
Skill Tips: ""Be thorough.""
Skills: Algorithms, Data Structures, Operating Systems, Machine Learning, SQL, Operating Systems, Computer Architecture, Data Analytics
College Name: IIT Kharagpur
Motivation: Kind of application oriented work and the rising nature of the company. Obviously money also.
Funny Moments: Many funny questions and answers like did you have lunch, when did you last eat, etc

Skills evaluated in this interview

I applied via Campus Placement and was interviewed before Apr 2021. There were 2 interview rounds.

Round 1 - Assignment 

Basic gocube test

Round 2 - One-on-one 

(1 Question)

  • Q1. Company work expectation and past experience questions

Interview Preparation Tips

Topics to prepare for Axtria Associate interview:
  • SQL
  • Python
Interview preparation tips for other job seekers - Go through ur resume and build strong profile

I applied via Approached by Company and was interviewed before Jun 2021. There were 2 interview rounds.

Round 1 - System test 

(1 Question)

  • Q1. Advantage and disadvantage of framework.
  • Ans. 

    Frameworks provide structure and pre-built components for software development, but can also limit flexibility and require learning curve.

    • Advantage: Provides structure and pre-built components for faster development

    • Advantage: Can improve code quality and maintainability

    • Disadvantage: Can limit flexibility and customization

    • Disadvantage: Requires learning curve and potential dependency issues

    • Example: ReactJS provides a fr...

  • Answered by AI
Round 2 - Technical 

(1 Question)

  • Q1. What is Oops? Advantage and disadvantage
  • Ans. 

    Oops stands for Object-Oriented Programming. It is a programming paradigm that uses objects to represent real-world entities.

    • Advantages: code reusability, modularity, encapsulation, inheritance, polymorphism

    • Disadvantages: complexity, steep learning curve, performance overhead

    • Example: creating a class 'Car' with properties like 'make', 'model', and 'year', and methods like 'start_engine' and 'stop_engine'

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare basics in server side and client side coding

Skills evaluated in this interview

I applied via Company Website and was interviewed before Jun 2020. There were 5 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. If fresher is attending the interview then mostly they'll ask questions from resume What are generics, UML diagram for the proper medicine suggestions based on the patient allergies to a particular drug ...

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well with the contents of resume,
First round: versant test
Second round: Technical Interview 1
Third round: Technical Interview 2

Feedback of best of the 2 technical interviews will be considered.

IF selected will receive a call from HR

Comcast India Engineering Center Interview FAQs

How many rounds are there in Comcast India Engineering Center Associate Engineer interview?
Comcast India Engineering Center interview process usually has 3 rounds. The most common rounds in the Comcast India Engineering Center interview process are Resume Shortlist, Aptitude Test and Technical.

Tell us how to improve this page.

Comcast India Engineering Center Associate Engineer Interview Process

based on 1 interview

Interview experience

4
  
Good
View more
Software Development Engineer II
116 salaries
unlock blur

₹10 L/yr - ₹15 L/yr

Software Development Engineer 3
48 salaries
unlock blur

₹13.6 L/yr - ₹24 L/yr

Devops Engineer
42 salaries
unlock blur

₹6.4 L/yr - ₹18 L/yr

Data Engineer
41 salaries
unlock blur

₹8 L/yr - ₹28.9 L/yr

Development Engineer 3
40 salaries
unlock blur

₹13.5 L/yr - ₹23 L/yr

Explore more salaries
Compare Comcast India Engineering Center with

Thomson Reuters

4.1
Compare

Oracle Cerner

3.7
Compare

NextComm Corporation

4.8
Compare

Chetu

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