Upload Button Icon Add office photos

Keysight Technologies

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Keysight Technologies Collection Associate Interview Questions and Answers

Updated 21 Sep 2023

Keysight Technologies Collection Associate Interview Experiences

1 interview found

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(1 Question)

  • Q1. Technical questions
Round 2 - Behavioral 

(1 Question)

  • Q1. Roles and responsibilities

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
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
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
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Some old coding platform with limited testcases

Round 2 - Technical 

(1 Question)

  • Q1. Normal dp problems
Round 3 - Manegeral 

(1 Question)

  • Q1. About resume and projects
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
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

2 coding questions, aptitude and electronics

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

I applied via LinkedIn and was interviewed before Apr 2023. There were 2 interview rounds.

Round 1 - Coding Test 

Leetcode questions, not very hard

Round 2 - HR 

(1 Question)

  • Q1. General hr questions

I applied via Naukri.com and was interviewed in Nov 2021. There were 6 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. Questions related to variance analysis like threshold limit, reason behind the variances, AOM, cash flow related question. More relating to current work experiences.
  • Q2. Reason behind job change, long term/short term goal, what motivates you? personality test by HR manager, about your like/dislike.

Interview Preparation Tips

Interview preparation tips for other job seekers - It is of 4 rounds.(1st- functional manger or team lead,2nd- US manager,3rd- with panel of HR manager, Finance Director, functional manager,4th-activity round)
Be yourself. They test your knowledge base from work experience, personality test .
Contribute & help others!
anonymous
You can choose to be anonymous

Keysight Technologies Interview FAQs

How many rounds are there in Keysight Technologies Collection Associate interview?
Keysight Technologies interview process usually has 3 rounds. The most common rounds in the Keysight Technologies interview process are Resume Shortlist, One-on-one Round and Behavioral.

Recently Viewed

INTERVIEWS

Keysight Technologies

No Interviews

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

Tell us how to improve this page.

Keysight Technologies Collection Associate Interview Process

based on 1 interview

Interview experience

4
  
Good
View more

Interview Questions from Similar Companies

Flex Interview Questions
4.0
 • 185 Interviews
Foxconn Interview Questions
3.9
 • 150 Interviews
Navitasys India Interview Questions
4.2
 • 101 Interviews
TE Connectivity Interview Questions
4.1
 • 83 Interviews
Wistron Interview Questions
3.9
 • 82 Interviews
Secure Meters Interview Questions
4.1
 • 66 Interviews
DBG Technology Interview Questions
3.8
 • 63 Interviews
View all
R&D Engineer
84 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Finance Coordinator
57 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
52 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Finance Program Specialist
48 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Financial Associate
47 salaries
unlock blur

₹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