Upload Button Icon Add office photos

STMicroelectronics

Compare button icon Compare button icon Compare

Filter interviews by

STMicroelectronics Developer Interview Questions and Answers

Updated 16 May 2017

STMicroelectronics Developer Interview Experiences

1 interview found

Developer Interview Questions & Answers

user image Anonymous

posted on 16 May 2017

I appeared for an interview in May 2017.

Interview Preparation Tips

Round: Resume Shortlist
Experience: Resume selection by mail

Round: Test
Total Questions: 40

College Name: Chitkara University

Top trending discussions

View All
Interview Tips & Stories
1w (edited)
a team lead
Why are women still asked such personal questions in interview?
I recently went for an interview… and honestly, m still trying to process what just happened. Instead of being asked about my skills, experience, or how I could add value to the company… the questions took a totally unexpected turn. The interviewer started asking things like When are you getting married? Are you engaged? And m sure, if I had said I was married, the next question would’ve been How long have you been married? What does my personal life have to do with the job m applying for? This is where I felt the gender discrimination hit hard. These types of questions are so casually thrown at women during interviews but are they ever asked to men? No one asks male candidates if they’re planning a wedding or how old their kids are. So why is it okay to ask women? Can we please stop normalising this kind of behaviour in interviews? Our careers shouldn’t be judged by our relationship status. Period.
Got a question about STMicroelectronics?
Ask anonymously on communities.

Interview questions from similar companies

Interview Questionnaire 

9 Questions

  • Q1. Tree questions related like traversal?
  • Q2. Locate the sum of 2 numbers in a linear array (Unsorted and sorted) and their complexities
  • Ans. 

    Locate sum of 2 numbers in a linear array (unsorted and sorted) and their complexities

    • For unsorted array, use nested loops to compare each element with every other element until the sum is found

    • For sorted array, use two pointers approach starting from the beginning and end of the array and move them towards each other until the sum is found

    • Complexity for unsorted array is O(n^2) and for sorted array is O(n)

  • Answered by AI
  • Q3. Pointers with increment/decrement, address of and value at operators (++,–,*,&)
  • Ans. 

    Pointers are used to manipulate memory addresses and values in C++. Increment/decrement, address of and value at operators are commonly used.

    • Incrementing a pointer moves it to the next memory location of the same data type

    • Decrementing a pointer moves it to the previous memory location of the same data type

    • The address of operator (&) returns the memory address of a variable

    • The value at operator (*) returns the value sto...

  • Answered by AI
  • Q4. A point and a rectangle is present with the given coordinates. How will you determine whether the point is inside or outside the rectangle?
  • Q5. There is a point inside the rectangle. How will you determine the line that passes through the point and divides the rectangle into 2 equal halves?
  • Q6. There is a scheme which contains 8-bit and 16-bit signed numbers. How many such combinations are possible?
  • Ans. 

    There are multiple combinations of 8-bit and 16-bit signed numbers. How many such combinations are possible?

    • There are 2^8 (256) possible combinations of 8-bit signed numbers.

    • There are 2^16 (65,536) possible combinations of 16-bit signed numbers.

    • To find the total number of combinations, we can add the number of combinations of 8-bit and 16-bit signed numbers.

    • Therefore, the total number of possible combinations is 256 + ...

  • Answered by AI
  • Q7. You are given an array of elements. Some/all of them are duplicates. Find them in 0(n) time and 0(1) space. Property of inputs – Number are in the range of 1..n where n is the limit of the array
  • Ans. 

    Find duplicates in an array of elements in 0(n) time and 0(1) space.

    • Use the property of inputs to your advantage

    • Iterate through the array and mark elements as negative

    • If an element is already negative, it is a duplicate

    • Return all the negative elements as duplicates

  • Answered by AI
  • Q8. Given a array of digits. print all combination of of these i.e all no formed by these. repetition allowed. and then repetition not allowed example: i/p: arr={1,2,3} o/p: (without repetition) 123, 132, 213,...
  • Ans. 

    Generate all combinations of digits from an array, allowing and disallowing repetition.

    • Use recursion or backtracking to generate combinations.

    • For repetition allowed: e.g., arr={1,2}, combinations are 11, 12, 21, 22.

    • For repetition not allowed: e.g., arr={1,2,3}, combinations are 123, 132, 213, 231, 312, 321.

    • Utilize a set to track used digits when repetition is not allowed.

  • Answered by AI
  • Q9. Questions on project

Interview Preparation Tips

Round: Test
Duration: 90 minutes
Total Questions: 3

Round: HR Interview
Experience: HR interview was all about my projects, my background and a few more typical HR questions. It was pretty easy to answer them.

Skills: Algorithm, Data structure, C++
College Name: IIT ROORKEE

Skills evaluated in this interview

Developer Interview Questions Asked at Other Companies

asked in HARMAN
Q1. Which programming language do you regularly use at work?
Q2. Given a 2D array, find an element which is the maximum in its col ... read more
asked in HARMAN
Q3. What steps do you take to ensure accurate project estimates?
Q4. Write a formula to display A if A is present, display B if B is p ... read more
Q5. Can you describe method overloading versus method overriding? Doe ... read more

I appeared for an interview before May 2016.

Interview Preparation Tips

Round: written test
Experience: it was elitmus test conducted by the company itself on campus. As per my knowledge only those scoring 90 percentile got selected for round 2.
Tips: Attempt only those ques that are necessary for scoring 90+ in e litmus. Specially in verbal don't attempt more then required questions, though you might be tempted. The aim is not to score max bt to score 90+

Round: Technical Interview
Experience: This was a programming based round. I was asked to write algorithms for various array linked list based problems. There was cross questioning prompting to reduce complexity and to use different data structures for same problems.

Mostly it focused on subjects like c, data structures and ADA.
Tips: Be clear with basic of data structures and algorithms. Pointers, queue, stacks, array linked lists, sorting etc are the keywords.

Round: Technical Interview
Experience: This was a information security specific round since that was my major. In depth cross questioning on my thesis topics, honeypots, network intrusion etc. Security certificates, and on the go problems to provide security solution layer wise in different scenarios. Security concept of torrents was also asked in detail.
Tips: It was more of a security discussion and throwing of ideas about how things in a particular case could work or could not. Don't worry about right or wrong answer just be clear with your reasoning about the solution you are suggesting.

Round: Other Interview
Experience: I don't know what to name this round, but it focused mainly on developing test cases for an object. Say they gave me a stapler and said to develop a test plan listing down test cases for a given object to pass so that it can be confirmed that it is a stapler. Another scenario was with a lift.
Tips: This is one round where your presence of mind and inter personal skills matter. I think the way you present your thoughts was most important here.

Round: Behavioural Interview
Experience: This was was mostly about how would you react in a given professional situation
Like your assigned work could not be completed on time, or if you are doing something wrong with the work assigned.
Tips: This is all about inter personal skills and putting your best foot forward :)

College Name: Indira Gandhi Delhi Technical University For Women, Delhi

I appeared for an interview in Sep 2016.

Interview Preparation Tips

Round: Test
Experience: Questions aren't tough but they take more time to read itself.
Tips: First try to attempt the questions which are seemingly small. Reading bigger questions first and wasting more time on that isnt a good idea at all.
Duration: 30 minutes
Total Questions: 30

Skills: Technical Skill, Analytical Skills
College Name: IIT Kharagpur

I applied via Campus Placement

Interview Questionnaire 

4 Questions

  • Q1. What is a program, task and threads
  • Ans. 

    A program is a set of instructions that tells a computer what to do. A task is a unit of work performed by a program. A thread is a sequence of instructions within a task.

    • A program is a collection of instructions that are executed by a computer to perform a specific task.

    • A task is a unit of work that is performed by a program. It can be a specific action or a set of actions.

    • A thread is a sequence of instructions within...

  • Answered by AI
  • Q2. Delete a node in a linked list
  • Q3. What is a function pointer and volatile type in c
  • Q4. Summarise your resume
  • Ans. 

    Experienced software developer with expertise in Java, Python, and SQL

    • Proficient in Java, Python, and SQL programming languages

    • Developed web applications using Java Spring framework

    • Experience with database management and optimization using SQL

    • Worked on various software projects in a team environment

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: Paper was challenging and It was well set.

Duration: 90 minutes
Total Questions: 60

Round: Technical Interview
Experience: It was a very good experience overall. Interviewer helped to ease the tension.
Tips: Waiting time can be reduced.

General Tips: Prepare for precedence of operators in C.
Try to be fast in solving the problems.
Skills: Knowledge Of Your Resume Points, Pointers In C, Operating System Basics
Duration: 2
College Name: IIT Madras
Motivation: Qualcomm is a

Skills evaluated in this interview

Interview Questionnaire 

5 Questions

  • Q1. In C programming they asked about storage classes, Volatile , Whole compilation process steps by steps, Dangling pointer , Memory leak, Memory corruption
  • Q2. In data structure they asked question on String , Linked List and array
  • Q3. Data structure question section is easy don't go for complex algorithms just study basic algorithms. like reverse the linked list in group on given size
  • Q4. They also asked question on bit manipulation. Like Check that given number binary representation is palindrome or not?
  • Q5. Swap even and odd bits in given number
  • Ans. 

    Swap even and odd bits in a given number

    • Create a mask for even bits and odd bits

    • Shift even bits to right and odd bits to left

    • Combine even and odd bits using bitwise OR operator

  • Answered by AI

Interview Preparation Tips

College Name: NA

Skills evaluated in this interview

I applied via Referral and was interviewed before Dec 2020. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Signal and power integrity question
  • Ans. Refer book by Eric bogatin
  • Answered by Saahil Naik

Interview Preparation Tips

Interview preparation tips for other job seekers - Learn about package design also
Are these interview questions helpful?

I appeared for an interview before Apr 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 75 minutes
Round difficulty - Medium

This was an online coding round where I had 2 questions to solve under 75 minutes. Both the coding questions were of Medium to Hard level of difficulty.

  • Q1. 

    Smallest Window Problem Statement

    Given two strings, S and X, your task is to find the smallest substring in S that contains all the characters present in X.

    Example:

    Input:
    S = "abdd"
    X = "bd"
    Output:
    ...
  • Q2. 

    K - Sum Path In A Binary Tree

    Given a binary tree where each node contains an integer value, and a value 'K', your task is to find all the paths in the binary tree such that the sum of the node values in ...

  • Ans. 

    Find all paths in a binary tree where the sum of node values equals a given value 'K'.

    • Traverse the binary tree using DFS and keep track of the current path and its sum.

    • At each node, check if the current sum equals 'K' and add the path to the result.

    • Continue traversal to the left and right child nodes recursively.

    • Return the list of paths that sum up to 'K'.

  • Answered by AI
Round 2 - Video Call 

(4 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 questions of DS/Algo to solve under 60 minutes and 2 questions related to Operating Systems.

  • Q1. 

    Validate Partial Binary Search Tree (BST) Problem Statement

    You are provided with a binary tree containing 'N' nodes. Your task is to determine if this tree is a Partial Binary Search Tree (BST). Return t...

  • Ans. 

    Validate if a binary tree is a Partial Binary Search Tree (BST) by checking if each node's left subtree contains nodes with data less than or equal to the node's data, and each node's right subtree contains nodes with data greater than or equal to the node's data.

    • Check if each node's left subtree follows BST property (data <= node's data) and right subtree follows BST property (data >= node's data)

    • Recursively che...

  • Answered by AI
  • Q2. 

    Longest Increasing Subsequence Problem Statement

    Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...

  • Q3. Can you define process and threads in operating systems?
  • Q4. What are the different types of semaphores?
Round 3 - Video Call 

(3 Questions)

Round duration - 60 Minutes
Round difficulty - Hard

In this round, I was asked 3 coding questions out of which I had to implement the first two and for the last question I was only asked the optimal approach. The main challenge in this round was to implement the first two questions in a production ready manner without any bugs and so I had to spent some time thinking about some Edge Cases which were important with respect to the question.

  • Q1. 

    Next Greater Element Problem Statement

    You are given an array arr of length N. For each element in the array, find the next greater element (NGE) that appears to the right. If there is no such greater ele...

  • Q2. 

    Power Set Generation

    Given a sorted array of 'N' integers, your task is to generate the power set for this array. Each subset of this power set should be individually sorted.

    A power set of a set 'ARR' i...

  • Q3. 

    Counting Sort Problem Statement

    Ninja is learning about sorting algorithms, specifically those that do not rely on comparisons. Can you help Ninja implement the counting sort algorithm?

    Example:

    Input:
    ...

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPACadence Design Systems interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, OS, DBMS, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I appeared for an interview in Aug 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 75 minutes
Round difficulty - Medium

This was an online coding round where I had 2 questions to solve under 75 minutes. Both the coding questions were related to DP and were of Medium to Hard level of difficulty.

  • Q1. 

    Longest Common Prime Subsequence Problem Statement

    Imagine Ninja is tackling a puzzle during his long summer vacation. He has two arrays of integers, each with lengths 'N' and 'M'. Ninja's task is to dete...

  • Q2. 

    Maximum Sum Problem Statement

    You are given an array ARR of N integers. Your task is to perform operations on this array until it becomes empty, and maximize the sum of selected elements. In each operatio...

Round 2 - Video Call 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This round had 2 Algorithmic questions wherein I was supposed to code both the problems after discussing their approaches and respective time and space complexities . After that , I was grilled on some OOPS concepts related to C++.

  • Q1. 

    Cycle Detection in a Linked List

    Your task is to determine if a given Singly Linked List of integers forms a cycle.

    Explanation: A cycle in a linked list occurs when there is a node in the list that conn...

  • Ans. 

    Detect if a given singly linked list of integers forms a cycle.

    • Use Floyd's Tortoise and Hare algorithm to detect cycle in linked list

    • Maintain two pointers, one moving at double the speed of the other

    • If they meet at some point, there is a cycle in the linked list

  • Answered by AI
  • Q2. 

    Check If Preorder Traversal Is Valid

    Determine whether a given array ARR of positive integers is a valid Preorder Traversal of a Binary Search Tree (BST).

    A binary search tree (BST) is a tree structure w...

  • Q3. What are Vtable and VPTR in C++?
  • Q4. What are friend functions in C++?
Round 3 - Video Call 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was also a DS/Algo round where I was given 2 questions to solve and I was expected to come up with the optimal approach as far as possible. I solved both the questions with the optimal time and space complexities and then I was asked some more questions related to DBMS towards the end of the interview.

  • Q1. 

    Top View of a Binary Tree

    You are given a binary tree. Your task is to print the Top View of the Binary Tree, displaying the nodes from left to right order.

    Input:

    The first line contains an integer 't'...
  • Ans. 

    The task is to print the Top View of a Binary Tree from left to right order.

    • Use a map to store the horizontal distance of each node from the root.

    • Perform a level order traversal of the tree and keep track of the horizontal distance of each node.

    • Print the nodes in the map in ascending order of their horizontal distance.

    • Handle the case where multiple nodes have the same horizontal distance by printing the one that appear...

  • Answered by AI
  • Q2. 

    Count Palindromic Substrings Problem Statement

    Given a string STR, determine the total number of palindromic substrings within STR.

    Input:

    The first line contains an integer 't' representing the number ...
  • Ans. 

    Count the total number of palindromic substrings in a given string.

    • Iterate through each character in the string and expand around it to find palindromic substrings.

    • Use dynamic programming to store previously calculated palindromic substrings.

    • Consider both odd and even length palindromes while counting.

    • Example: For input 'abbc', palindromic substrings are ['a', 'b', 'b', 'c', 'bb']. Total count is 5.

  • Answered by AI
  • Q3. What is the difference between the DELETE and TRUNCATE commands in a DBMS?
  • Ans. 

    DELETE removes specific rows from a table, while TRUNCATE removes all rows and resets auto-increment values.

    • DELETE is a DML command, while TRUNCATE is a DDL command.

    • DELETE can be rolled back, while TRUNCATE cannot be rolled back.

    • DELETE triggers delete triggers, while TRUNCATE does not trigger any triggers.

    • DELETE is slower as it maintains logs, while TRUNCATE is faster as it does not maintain logs.

    • Example: DELETE FROM t...

  • Answered by AI
  • Q4. What is meant by normalization and denormalization?

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPACadence Design Systems interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Medium coding qs with technical interview

Round 2 - Technical 

(1 Question)

  • Q1. Reverse an array

Tell us how to improve this page.

Interview Questions from Similar Companies

Qualcomm Interview Questions
3.8
 • 273 Interviews
Intel Interview Questions
4.2
 • 225 Interviews
Texas Instruments Interview Questions
3.9
 • 126 Interviews
Synopsys Interview Questions
3.9
 • 96 Interviews
Molex Interview Questions
3.9
 • 58 Interviews
Lam Research Interview Questions
3.8
 • 50 Interviews
View all
Technical Lead
91 salaries
unlock blur

₹20.9 L/yr - ₹37 L/yr

Design Engineer
56 salaries
unlock blur

₹11.9 L/yr - ₹19.7 L/yr

Senior Design Engineer
51 salaries
unlock blur

₹16.9 L/yr - ₹29.8 L/yr

Staff Engineer
50 salaries
unlock blur

₹24.5 L/yr - ₹43 L/yr

Intern
22 salaries
unlock blur

₹2 L/yr - ₹5 L/yr

Explore more salaries
Compare STMicroelectronics with

Qualcomm

3.8
Compare

Intel

4.2
Compare

Molex

3.9
Compare

TDK India Private Limited

3.8
Compare
write
Share an Interview