Upload Button Icon Add office photos

Keysight Technologies

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Keysight Technologies Software Developer Interview Questions, Process, and Tips

Updated 25 Oct 2023

Keysight Technologies Software Developer Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Recruitment Consulltant and was interviewed before Oct 2022. 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 Resume tips
Round 2 - One-on-one 

(4 Questions)

  • Q1. What is a data structure?
  • Ans. 

    A data structure is a way of organizing and storing data in a computer so that it can be accessed and modified efficiently.

    • Data structures define the way data is stored, accessed, and manipulated in a computer program.

    • Examples include arrays, linked lists, stacks, queues, trees, and graphs.

    • Choosing the right data structure is crucial for optimizing the performance of algorithms and applications.

  • Answered by AI
  • Q2. What is a linked list?
  • Ans. 

    A linked list is a data structure where each element is connected to the next element through pointers.

    • Consists of nodes where each node contains data and a reference to the next node

    • Can easily insert or delete elements without shifting other elements

    • Examples: singly linked list, doubly linked list, circular linked list

  • Answered by AI
  • Q3. What is HashSet?
  • Ans. 

    HashSet is a collection that does not allow duplicate elements and does not guarantee the order of elements.

    • HashSet implements the Set interface in Java.

    • It uses a hash table for storage.

    • Example: HashSet set = new HashSet<>();

  • Answered by AI
  • Q4. Explain recursion.
  • Ans. 

    Recursion is a programming technique where a function calls itself in order to solve a problem.

    • Recursion involves breaking down a problem into smaller subproblems and solving them recursively.

    • A base case is needed to stop the recursion and prevent infinite loops.

    • Recursion can be used to solve problems like factorial calculation, Fibonacci sequence, and tree traversal.

  • Answered by AI
Round 3 - One-on-one 

(1 Question)

  • Q1. What is a static constructor?
  • Ans. 

    A static constructor is a special type of constructor in a class that is used to initialize static data members.

    • Static constructors are called only once when the class is first accessed.

    • They are used to initialize static variables or perform any necessary setup for the class.

    • Static constructors do not take any parameters and cannot be called explicitly.

    • Example: public class MyClass { static MyClass() { // initializatio

  • Answered by AI

Skills evaluated in this interview

Interview questions from similar companies

Interview Questionnaire 

3 Questions

  • Q1. Asked me about my answer for a question in the logical test and asked me to find mistake
  • Q2. Some tree question
  • Q3. Some array question

Interview Preparation Tips

Round: Test
Experience: Just logical questions. Maybe create a DFA and NFA.
Duration: 1 hour
Total Questions: 20

Round: Coding
Experience: Given two questions. Each question is written like a story, but once you get the idea, it will be a simple question

College Name: Govt. Model Engineering College

I applied via Campus Placement

Interview Questionnaire 

3 Questions

  • Q1. They asked me optimise the code I had written for the first question
  • Q2. Given a binary tree, find out the maximum sum path from root to leaf. This problem, but they said tree has only positive integers. -----/ . To store the path I had used global array. They asked me alternat...
  • Q3. Given a list of words. Given three operations find out the minimum steps to reach from source string to destination string. Basically, -----/ this is the problem with some modification. For this question I...
  • Ans. 

    The question is about finding the minimum steps to reach from a source string to a destination string using three operations.

    • BFS and DFS are graph traversal techniques that can be used to solve this problem.

    • BFS is typically used when finding the shortest path or exploring all possible paths in a graph.

    • DFS is useful when searching for a specific path or exploring deeply into a graph.

    • In this case, BFS can be used to find...

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: • 1 question was on time complexity of searching an unsorted array.
• 2 questions were on recursion, ie, number of recursive calls.
• 1 question on analysing given function on string.
• 1 question was on probability(Two hotels, say A and B. Probability of moving from A to B is 2/3, staying at A is 1/3. Probability of moving from B to A and staying at B is 1/2. If they make decisions each hour, and if they were at A at 7:00 pm, what is the probability that they will be at B at 10:00 pm).
• If a set has elements {1,2,3,4 .... n}. Then what is the sum of elements of it's power set. (Ex: S = {1,2}. Then power set is {{},{1},{2},{1,2}}. The sum is 6.
• If a set has elements {1,2,3,4,5,6,7,8,9,10}. Then how many subsets of 3 elements has no consecutive elements.
• 1 question was on designing a DFA for a string starting with a and ending with c and has at least b in it.
• 1 question had machine instructions. We had to find out minimum number of cycles needed to execute the given set of instructions. (a) If the instructions are executed in the given order. (b) If the instructions are executed in random order.
• 1 puzzle on bridges.

Tips: In this round they not only see the answer. They also verify how you approached(So, give correct explanation to your answers).
Duration: 90 minutes
Total Questions: 10

Round: Coding Round
Experience: Two questions were there. 3 hours duration.

1. Long question, I don't remember fully. I'll just give input/output examples. It was basically on string decoding. If jon2snow3 is there the decoded string will be jonjonsnowjonjonsnowjonjonsnow. Given a string and an integer k we have print the kth character in the decoded string
input:
jon2snow3
8
output:
n

2. Given an array and an integer k return the number of contiguous sub arrays whose sum is divisible by k.
input format:
n k

input:
4 5
10 0 4 5

output:
4

explaination: {10},{0},{10,0},{5} are the sub arrays with sum divisible by 5.


Tips: You will have lots of time, so try to optimise the solution if you can. Remember here also they review each individual's code.

Round: Technical Interview
Experience: They will help you a lot if you are stuck at some point in the question. You have to be smart enough to grasp the clue.
Tips: They only ask questions only on data structures and algorithms.

Skill Tips: You have to be strong in coding. Algorithm questions will be mostly on dynamic programming. Data structures questions are mostly on trees.
Skills: C Programming, Maths(esp Probability), Algorithms And Data Structures
Duration: 5
College Name: JSS Mahavidyapeetha Sri Jayachamarajendra College Of Engineering, Mysore

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

3 rounds online, dsa, hr

Round 2 - One-on-one 

(2 Questions)

  • Q1. Dsa on dp topic
  • Q2. Dsa on dp topics
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Feb 2024. There were 3 interview rounds.

Round 1 - Coding Test 

It was online coding test consist of 2 question
One from DP and other graph

Round 2 - Coding Test 

One question of DP within in 45 min time constraints

Round 3 - Technical 

(1 Question)

  • Q1. Floor value of square root of a number
  • Ans. 

    Floor value of square root of a number is the largest integer less than or equal to the square root.

    • The floor value of square root of a number can be found using mathematical functions like floor() or integer division.

    • For example, the floor value of square root of 16 is 4, as sqrt(16) = 4.

    • For non-perfect square numbers, the floor value of square root can be calculated using approximation methods.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Go through DSA and core subjects
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Apr 2023. There were 2 interview rounds.

Round 1 - Coding Test 

Level was medium to hard

Round 2 - Technical 

(5 Questions)

  • Q1. Technical interview
  • Q2. Questions on DSA Cs fundamentals
  • Q3. Coding questions
  • Q4. Ques on String array
  • Q5. To print tree in anticlock wise direction
  • Ans. 

    To print a tree in anticlockwise direction, start from the bottom left and traverse each level from right to left.

    • Start from the bottom left of the tree

    • Traverse each level from right to left

    • Print the nodes as you traverse

  • Answered by AI

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
No response

I applied via Naukri.com and was interviewed in May 2024. There were 2 interview rounds.

Round 1 - One-on-one 

(2 Questions)

  • Q1. About my current company
  • Q2. About the work I do in my current company
Round 2 - Coding Test 

Coding round where they ask few coding questions

Interview experience
3
Average
Difficulty level
Easy
Process Duration
-
Result
Selected Selected

I applied via Campus Placement

Round 1 - Technical 

(1 Question)

  • Q1. 1. Variant of Binary Search
  • Ans. 

    Variant of Binary Search

    • Implement a binary search with a twist, such as searching for a range of values instead of a single value

    • Modify the binary search algorithm to handle duplicates in the array

    • Consider implementing a binary search for a rotated sorted array

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Tektronix is a test and measurement company. It mainly focuses on Signal Processing. For software engineers, technical rounds are very easy to crack.

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Not Selected

I applied via LinkedIn and was interviewed in Aug 2024. There was 1 interview round.

Round 1 - Coding Test 

2 coding questions one was greedy and 2nd one was of dp.

Software Developer Interview Questions & Answers

Tektronix user image Bhargav Jayanth Natekar

posted on 24 Mar 2023

Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed in Sep 2022. There were 4 interview rounds.

Round 1 - Coding Test 

Basics of electronics and two coding questions

Round 2 - Technical 

(1 Question)

  • Q1. Basic of DSA,OS,OOPS
Round 3 - Technical 

(1 Question)

  • Q1. About ur projects and basic knowledge
Round 4 - HR 

(1 Question)

  • Q1. About family and general discussions

Interview Preparation Tips

Interview preparation tips for other job seekers - Just get to know about companys product and study basic electronics to impress them
Contribute & help others!
anonymous
You can choose to be anonymous

Keysight Technologies Interview FAQs

How many rounds are there in Keysight Technologies Software Developer interview?
Keysight Technologies interview process usually has 3 rounds. The most common rounds in the Keysight Technologies interview process are One-on-one Round and Resume Shortlist.
What are the top questions asked in Keysight Technologies Software Developer interview?

Some of the top questions asked at the Keysight Technologies Software Developer interview -

  1. what is a data structu...read more
  2. what is a linked li...read more
  3. what is a static construct...read more

Recently Viewed

INTERVIEWS

Keysight Technologies

No Interviews

INTERVIEWS

Movidu Technology

No Interviews

INTERVIEWS

Movidu Technology

No Interviews

INTERVIEWS

ARB Trading Group

No Interviews

INTERVIEWS

Movidu Technology

No Interviews

INTERVIEWS

Keysight Technologies

No Interviews

INTERVIEWS

Keysight Technologies

No Interviews

INTERVIEWS

Movidu Technology

No Interviews

INTERVIEWS

Mckinley Rice

No Interviews

DESIGNATION

Tell us how to improve this page.

Keysight Technologies Software Developer Interview Process

based on 1 interview

Interview experience

4
  
Good
View more
Keysight Technologies Software Developer Salary
based on 27 salaries
Lock Unlock
₹5.2 L/yr - ₹17.2 L/yr
35% more than the average Software Developer Salary in India
View more details

Keysight Technologies Software Developer Reviews and Ratings

based on 3 reviews

1.6/5

Rating in categories

2.1

Skill development

1.6

Work-life balance

1.5

Salary

2.3

Job security

1.6

Company culture

1.6

Promotions

1.6

Work satisfaction

Explore 3 Reviews and Ratings
R&D Engineer
84 salaries
unlock blur Lock Unlock

₹0 L/yr - ₹0 L/yr

Finance Coordinator
57 salaries
unlock blur Lock Unlock

₹0 L/yr - ₹0 L/yr

Software Engineer
52 salaries
unlock blur Lock Unlock

₹0 L/yr - ₹0 L/yr

Finance Program Specialist
48 salaries
unlock blur Lock Unlock

₹0 L/yr - ₹0 L/yr

Financial Associate
47 salaries
unlock blur Lock Unlock

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Keysight Technologies with

Agilent Technologies

4.1
Compare

Rohde & Schwarz

3.8
Compare

Anritsu

4.0
Compare

Tektronix

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