Filter interviews by
BFS algorithm is used to traverse a graph in a breadth-first manner.
BFS starts at the root node and explores all the neighboring nodes at the current depth before moving to the next depth.
It uses a queue data structure to keep track of the nodes to be visited.
BFS can be used to find the shortest path between two nodes in an unweighted graph.
Example problem: Given a binary tree, find its minimum depth.
I applied via Company Website and was interviewed before Sep 2021. There were 4 interview rounds.
Logical Aptitude, Verbal, Numerical
2 codes one small and easy , another big and medium difficultly
I applied via LinkedIn and was interviewed before Sep 2021. There were 3 interview rounds.
Good problemtic Skills and knowledge check and sharpness
C Language use for programs and Oracle and Java in learning process
Yes, there are many operators and logical programs used in various fields.
Operators like +, -, *, / are used in mathematical calculations.
Logical programs like if-else, switch-case are used in programming.
Operators like AND, OR, NOT are used in boolean logic.
Operators like >, <, == are used in comparisons.
Examples of logical programs include sorting algorithms, search algorithms, etc.
I applied via Referral and was interviewed in Nov 2020. There were 5 interview rounds.
I applied via Naukri.com and was interviewed in Apr 2021. There were 3 interview rounds.
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Sales Executive
4
salaries
| ₹2.6 L/yr - ₹4 L/yr |
TCS
Accenture
Wipro
Cognizant