Filter interviews by
Tree, LinkedList, Array
The depth of a tree is the length of the longest path from the root node to any leaf node.
Depth of a tree can be found using depth-first search (DFS) algorithm.
The depth of a tree is equal to the maximum depth of its children plus one.
For example, in a binary tree, the depth of the tree is the maximum depth of the left and right subtrees plus one.
Merge two sorted arrays into a single sorted array
Create a new array to store the merged result
Use two pointers to iterate through both arrays and compare elements
Add the smaller element to the new array and move the pointer for that array
Metrix problem to find the shortest order of the largest matrix in given metrix with all non-zer0's
TCP header contains important information for reliable data transmission.
TCP header includes source and destination port numbers
It also includes sequence and acknowledgement numbers
TCP header has flags for various control functions like SYN, ACK, FIN, etc.
Window size, checksum, and urgent pointer are also included in TCP header
IPv6 offers more IP addresses, better security, and improved performance compared to IPv4.
IPv6 uses 128-bit addresses, providing a virtually unlimited number of unique IP addresses.
IPv6 includes built-in security features, such as IPsec, which provides end-to-end encryption and authentication.
IPv6 also offers improved performance through features like multicast and anycast addressing.
IPv6 simplifies network configurati...
Linked list and sorting. Linux system side programming.
Itron interview questions for popular designations
I applied via Company Website and was interviewed before Dec 2021. There were 4 interview rounds.
Electronic stuff related questions , all analog electronics questions.
Top trending discussions
posted on 22 Mar 2015
I applied via Walk-in and was interviewed before Sep 2020. There were 5 interview rounds.
I applied via Naukri.com and was interviewed before Jun 2019. There were 3 interview rounds.
Implement stack data structure
Use an array or linked list to store elements
Push operation adds element to top of stack
Pop operation removes element from top of stack
Peek operation returns top element without removing it
Global variables are accessible from any part of the program and can be modified by any function.
Global variables are declared outside of any function.
They can be accessed and modified by any function in the program.
If a function modifies the value of a global variable, the new value is visible to all other functions.
Global variables can be useful for sharing data between functions.
However, overuse of global variables
Program to transpose a matrix
Iterate through rows and columns of the matrix
Swap the elements at (i,j) and (j,i) positions
Return the transposed matrix
Pre and post fix operators are used to increment or decrement a value before or after it is used in an expression.
Pre-fix operator (++x) increments the value of x and returns the new value.
Post-fix operator (x++) returns the value of x and then increments it.
Both operators can be used with variables of numeric data types.
They can also be used with pointers to increment or decrement the memory address they point to.
based on 2 interviews
Interview experience
Senior Software Engineer
99
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
91
salaries
| ₹0 L/yr - ₹0 L/yr |
Staff Software Engineer
44
salaries
| ₹0 L/yr - ₹0 L/yr |
Principal Software Engineer
40
salaries
| ₹0 L/yr - ₹0 L/yr |
Firmware Engineer
23
salaries
| ₹0 L/yr - ₹0 L/yr |
Schneider Electric
Siemens
ABB
Honeywell Automation