Arista Networks Software Test Engineer Intern Interview Questions and Answers

Q1. Bfs tree traversal
Ans. 
BFS tree traversal visits nodes level by level starting from the root.
• Start at the root node and visit its children before moving on to the next level.

• Use a queue data structure to keep track of nodes to visit next.

• BFS is often used to find the shortest path in unweighted graphs.
Answered by AI
Add your answer
Q2. Resume and core
Add your answer

Q1. Give details about your skills
Add your answer
Q2. About your experience ?
Add your answer

Requirement of employee from IT. Sector.

Round duration - 60 minutes
Round difficulty - Medium

There were 25 mcqs and 1 coding question. OS, aptitude, C and C++ concepts were the main focus. 

Q1. Which feature of the operating system is being used here?
Add your answer
Q2. 
Count of Sum of Consecutives Problem Statement
You are given a positive integer 'N'. Your objective is to determine the number of ways to express 'N' as the sum of two or more consecutive natural numbers.
...read more
Ans. Brute Force Approach
Approach:
 
In this brute force approach,. We will iterate from 1 to ‘N’ using the iterator i and will check if there is a possible sequence of consecutive positive integers such that their sum is ‘N’, and the ending integer of the consecutive sequence is 'i'. The checking will be done as follows:
• We know that the ending position is ‘i’. Therefore, we need to find a starting point for the consecut...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

It was of 60 minutes,

Questions asked were
1. Swap without temp variable
2. A problem question in which I was asked to find the ball with odd weight out of the remaining in the least number of attempts and write an algorithm for it.
3. Code to insert in the middle of circular linked list, code to find middle element of a singly linked list with knowing the number of elements in it.
4. Socket programming
5. Operating system concepts
6. Types of joins in DBMS
7. A DBMS query
8. Print in C without a semi colon
9. If I have any questions in the end.

Q1. 
Swap Numbers Without Temporary Variable
Your task is to interchange the values of two numbers given as variables 'X' and 'Y' without using a temporary variable or any additional variable.
Explanation:
Y...read more
Ans. Addition Approach
• Idea is to get the sum of given two-variable ‘X’ and ‘Y’ in an ‘X’ = ‘X’ + ‘Y’.
• Value of swapped ‘Y’ can get by ‘X’ - ‘Y’ = (‘X’ + ‘Y’) - ‘Y’ = ‘X’
• Value of swapped ‘X’ can get by ‘X’ - ‘Y’ = (‘X’ + ‘Y’) - ‘Y’ = (‘X’ + ‘Y’) - ‘X’ = ‘Y’
• The current value of ‘Y’ is the initial value of ‘X’
• Suppose ‘X’ is 10 and ‘Y’ is 20 then
  • ‘X’ = ‘X’ + ‘Y’ = 20+10’
  • Swapped value of ‘Y’ is ‘X’- ‘Y’ = 30-20 = 10’
  • And the swappe...read more
Answered Anonymously
Add your answer

40 MCQ's, 2 Coding question

Q1. Dijkastra's Algorithm
Ans. 
Dijkstra's Algorithm is a graph search algorithm that finds the shortest path between nodes in a graph.
• Dijkstra's Algorithm is used to find the shortest path from a starting node to all other nodes in a weighted graph.

• It works by maintaining a set of nodes whose shortest distance from the starting node is known.

• The algorithm iteratively selects the node with the smallest distance and updates the distances of its neighb...read more
Answered by AI
Add your answer
Q2. Snake and Ladder
Add your answer

There were 3 coding questions rating fron easy to medium.

Q1. Interview was mainly based on oops, dbms, os and networking basic concepts.
Add your answer

Q1. This technical is mostly based on the coding , done basic string based coding questions were asked.
Add your answer

Q1. DSA Medium Questions on arrays & linkedList
Add your answer

DSA, Behavioural, os, some networks basics

1) was asked to write program to fetch certain strings in a given device output
2) basic questions on networking based on the resume

Q1. 1) networking basics based on the team you are interviewing with. 2) certain programs to write
Add your answer

Leetcode medium related to linkedlists, graph and arrays

Q1. 1. Best Time to buy and sell stocks
Ans. 
The best time to buy and sell stocks is when the price is low and high respectively, maximizing profit.
• Buy when the stock price is low and sell when it is high to maximize profit

• Consider factors like market trends, company performance, and economic indicators

• Use technical analysis tools like moving averages, RSI, and MACD to make informed decisions
Answered by AI
Add your answer
Q2. 2. implement replace function of String class
Ans. 
Implement a replace function for the String class.
• Create a new string variable to store the result

• Iterate through the original string and check for the substring to be replaced

• Replace the substring with the new substring in the result string
Answered by AI
Add your answer
Q3. 3. Suggest a Data Structure that will help in scheduling football matches and makes sure each team has played with every other team.
Ans. 
Use a round-robin tournament scheduling algorithm with a matrix data structure.
• Create a matrix where rows represent teams and columns represent opponents.

• Fill in the matrix such that each team plays every other team exactly once.

• Use the round-robin tournament scheduling algorithm to generate the match schedule.

• Ensure that each team plays with every other team by checking the matrix for any missing matches.
Answered by AI
Add your answer