Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by AVAYA Team. If you also belong to the team, you can get access from here

AVAYA Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

AVAYA Member Technical Staff Interview Questions and Answers

Updated 2 Dec 2015

AVAYA Member Technical Staff Interview Experiences

1 interview found

Interview Preparation Tips

Round: Test
Experience: Written test - upto 36 were shortlisted for the interviews (B.Tech, MCA).

Round: Technical Interview
Experience: Questions depended on project work put up on the resume and they asked questions from every subject- N/Ws, DB, OS, OOP.

General Tips: Basics of everything you have studied in 2&3 year.
Not getting placed early is not a reason to bury yourself in depression. Just work hard.
It's going to be exhausting. The placement interviews are more rigorous than internship interviews. Don't be surprised.
Skills:
College Name: NIT Surathkal

Interview questions from similar companies

Interview Questionnaire 

15 Questions

  • Q1. How to find a loop in a Linked List and how to remove it
  • Ans. 

    To find and remove a loop in a Linked List, we can use Floyd's Cycle Detection Algorithm.

    • Use two pointers, slow and fast, to detect if there is a loop in the Linked List

    • If the two pointers meet at some point, there is a loop

    • To remove the loop, set one of the pointers to the head of the Linked List and move both pointers one step at a time until they meet again

    • The meeting point is the start of the loop, set the next poi

  • Answered by AI
  • Q2. Suppose there is an unsorted array. What will be the maximum window size, such that when u sort that window size, the whole array becomes sorted. Eg, 1 2 6 5 4 3 7 . Ans: 4 (6 5 4 3)
  • Ans. 

    Find the maximum window size to sort an unsorted array.

    • Identify the longest decreasing subarray from the beginning and longest increasing subarray from the end

    • Find the minimum and maximum element in the identified subarrays

    • Expand the identified subarrays until all elements in the array are covered

    • The length of the expanded subarray is the maximum window size

  • Answered by AI
  • Q3. How to find longest last occurring word in a sentence with multiple whitespace
  • Ans. 

    Finding the longest last occurring word in a sentence with multiple whitespace.

    • Split the sentence into words using whitespace as delimiter

    • Reverse the list of words

    • Iterate through the list and find the first occurrence of each word

    • Calculate the length of each last occurring word

    • Return the longest last occurring word

  • Answered by AI
  • Q4. What is merge sort and Quick sort. Adv and Disadv of each and which one would u use to sort huge list and Y
  • Ans. 

    Merge sort and Quick sort are sorting algorithms used to sort arrays of data.

    • Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts each half recursively, and then merges the sorted halves.

    • Quick sort is also a divide and conquer algorithm that selects a pivot element and partitions the array around the pivot, sorting the two resulting sub-arrays recursively.

    • Merge sort has a tim...

  • Answered by AI
  • Q5. Define Process &thread
  • Ans. 

    Process is an instance of a program while thread is a subset of a process that can run concurrently with other threads.

    • A process is a program in execution

    • A process can have multiple threads

    • Threads share the same memory space as the process

    • Threads can run concurrently with other threads within the same process

    • Examples of processes include web browsers, word processors, and media players

    • Examples of threads include GUI th

  • Answered by AI
  • Q6. What happens when an recursive function is called
  • Ans. 

    A recursive function calls itself until a base case is reached, then returns the result to the previous call.

    • Each call creates a new instance of the function on the call stack

    • The function continues to call itself until a base case is reached

    • Once the base case is reached, the function returns the result to the previous call

    • The previous call then continues executing from where it left off

  • Answered by AI
  • Q7. Solve and code the problem of a ball falling from staircase. Each jump can be of 1 step or 2. Find the number of combination of reaching step N
  • Ans. 

    Code to find number of combinations of reaching step N by ball falling from staircase with 1 or 2 steps per jump.

    • Use dynamic programming to solve the problem

    • Create an array to store the number of ways to reach each step

    • Initialize the array with base cases for steps 0, 1, and 2

    • Use a loop to fill in the array for steps 3 to N

    • The number of ways to reach step i is the sum of the number of ways to reach step i-1 and i-2

    • Retu

  • Answered by AI
  • Q8. Puzzle: There is a grid of soldier standing. Soldier ‘A’ is chosen: The tallest men from every column and the shortest among them. Soldier ‘B’ is chosen: The shortest men from every row and the tallest amo...
  • Q9. What’s priority queue. How will u make stack and queue with priority queue
  • Ans. 

    Priority queue is a data structure that stores elements with priority levels and retrieves them in order of priority.

    • Priority queue is implemented using a heap data structure.

    • Stack can be implemented using a priority queue by assigning higher priority to the most recently added element.

    • Queue can be implemented using a priority queue by assigning higher priority to the oldest element.

  • Answered by AI
  • Q10. Implement stack using queue
  • Ans. 

    Implementing stack using queue involves using two queues to simulate stack behavior.

    • Create two queues, q1 and q2.

    • Push operation: Enqueue the element to q1.

    • Pop operation: Dequeue all elements from q1 to q2 except the last element. Dequeue and return the last element.

    • Swap the names of q1 and q2 after each pop operation.

    • Top operation: Return the last element of q1 without dequeuing it.

    • isEmpty operation: Check if both q1 a

  • Answered by AI
  • Q11. About myself
  • Q12. About my family. I mentioned my dad is my idol, so he asked y. M I more like my dad or my mom.
  • Q13. My toughest moment in life and how I overcame it
  • Ans. 

    I lost my job during the pandemic and struggled to find a new one

    • Applied to multiple job openings daily

    • Networked with former colleagues and industry professionals

    • Took online courses to improve skills

    • Maintained a positive attitude and stayed motivated

    • Eventually landed a new job in a different industry

  • Answered by AI
  • Q14. What had I been if I hadn’t been an engg
  • Ans. 

    I would have pursued a career in music or writing.

    • I have always had a passion for music and writing.

    • I have played multiple instruments since childhood.

    • I have written and published short stories and poetry.

    • I believe creativity is an important aspect of any profession.

  • Answered by AI
  • Q15. What do I value most in life. (A real life example)
  • Ans. 

    I value my relationships with loved ones the most.

    • Spending quality time with family and friends

    • Making an effort to stay in touch with long-distance loved ones

    • Prioritizing important events and milestones in their lives

    • Being there for them during difficult times

    • Forgiving and working through conflicts to maintain strong bonds

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: He went
through my CV and asked me something about making an android app. (Note: I had
mentioned Android a couple of times in CV) I explained him how a basic app is
made with model (XML) and layout (Java). He told me about connector which
connects model to layout. Then he asked the two questions. For second ques, I gave a N square approach (dynamic).
He suggested a greedy approach of Order N. It was fitting most cases so I wrote
the code on greedy approach. Turned out, greedy wasn’t the solution anyway.
Doesn’t matter. (Note: Boss is always right!!!)

Round: Technical Interview
Experience: He went
through my CV and asked me about my dropped grades in 12th.In third question, interesting part was, he said me to answer only if I knew it. I replied that I know but the definition isn’t totally memorized and he said to let it go then. (PS: Learn basic defs)
Tips: Ans to 5) is Fibonacci and 6) is A is taller than B

Round: Technical Interview
Experience: He
went through my CV and asked my if I had done Intern in Amazon or Training.
Followed by, he asked me why I didn’t get a PPO there. He then asked me, which
subject I m more confident with: Algo types or OS types. I chose algo.
Tips: Keep your cool and code with confidence. Reason I am saying this is because, he was the senior most interviewer and somehow, he knew the art to stress test you.

Round: HR Interview
Experience: 1)     
Be honest

2)     
Sit with open palms

3)     
Don’t cross your hands or legs(if legs can be
visible)

4)     
Keep some back stories ready. Use any names, use your friends story anything to make it real. It will go a long way because nobody is
going to verify it.

5)     
Most imp, Be confident about yourself. If you r not
sure of yourself, you would be useless to the company.

General Tips: Code Daily. Practise. Basics are important in such interviews.
Skill Tips: Do refer the previous question sets. It gives you pretty good idea of what's expected of you.
Skills: Algorithm, Puzzle solving, Technical Knowledge, Soft Skills, Data structures
College Name: IIT DHANBAD
Funny Moments: When in first round, I knew greedy approach isn't right, But I went on with it, because I could hear my dad whispering in my ears from behind, Rule 1: Boss is always Right
Rule 2: In case of doubt, refer Rule 1...

Skills evaluated in this interview

I appeared for an interview before Mar 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Th interviewer asked me questions related to various topics of OS, Data Structures and Algorithm.
Tips: Have a strong hold on topics of OS like segmentation and buddy systems.

  • Q1. What is segmentation?
  • Ans. 

    Segmentation is the process of dividing a larger entity into smaller parts or segments.

    • Segmentation is commonly used in image processing to separate objects of interest from the background.

    • It is also used in marketing to divide a target market into smaller groups based on demographics, behavior, or other factors.

    • In networking, segmentation refers to dividing a network into smaller subnetworks to improve performance and

  • Answered by AI
  • Q2. What are the advantages and disadvantages of the buddy system?
  • Ans. 

    The buddy system has advantages like increased safety and support, but also drawbacks like dependency and lack of independence.

    • Advantages: increased safety, support, accountability, motivation

    • Disadvantages: dependency, lack of independence, potential for conflicts

    • Example: In a buddy system at work, colleagues can support each other in completing tasks and provide motivation to stay on track.

    • Example: However, relying to...

  • Answered by AI
  • Q3. What is a page fault?
  • Ans. 

    A page fault occurs when a program tries to access a page of memory that is not currently in physical RAM.

    • Occurs when a program tries to access a page of memory not in physical RAM

    • Results in the operating system needing to retrieve the page from disk

    • Can lead to a temporary pause in program execution

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

The round consisted of questions of heap, Towers of hanoi and other questions related to CV.
Tips: Time complexity analysis of Towers of Hanoi Problem is important. Good skillset in DS and Algorithms, Bit Manipulation.

  • Q1. 

    Tower of Hanoi Problem Statement

    You have three rods numbered from 1 to 3, and 'N' disks initially stacked on the first rod in increasing order of their sizes (largest disk at the bottom). Your task is to...

  • Ans. 

    Tower of Hanoi problem where 'N' disks need to be moved to another rod following specific rules in less than 2^N moves.

    • Implement a recursive function to move disks from one rod to another following the rules.

    • Use the concept of recursion and backtracking to solve the Tower of Hanoi problem efficiently.

    • Maintain a count of moves and track the movement of disks in a 2-D array/list.

    • Ensure that larger disks are not placed on...

  • Answered by AI
  • Q2. 

    Convert Array to Min Heap Task

    Given an array 'ARR' of integers with 'N' elements, you need to convert it into a min-binary heap.

    A min-binary heap is a complete binary tree where each internal node's va...

  • Ans. 

    Convert the given array into a min-binary heap by modifying the array elements.

    • Iterate through the array and heapify each node starting from the last non-leaf node to the root node.

    • For each node, compare it with its children and swap if necessary to satisfy the min-heap property.

    • Continue this process until the entire array is converted into a min-heap.

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

The HR asked about my hobbies, extra curricular activities and checked my personality.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAVMware Software India Private Limited interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I applied via Naukri.com and was interviewed in Apr 2021. There were 5 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Linux, networking ,Jenkins, ansible from basic to advance.mostly they asked me to write ansible playbook for different scenarios of configuration management.

Interview Preparation Tips

Interview preparation tips for other job seekers - It was ok. Questions were manageable and best thing is they made it clear what they want from candidate. More or less it was a nice experience
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(1 Question)

  • Q1. Design and implement snake game
  • Ans. 

    Snake game involves controlling a snake to eat food and grow in size without hitting walls or itself.

    • Create a grid system to represent the game board

    • Implement logic for snake movement and growth

    • Generate food randomly on the board for the snake to eat

    • Handle collision detection for walls and snake body

    • Keep track of score and game over conditions

  • Answered by AI

Skills evaluated in this interview

I applied via Recruitment Consultant and was interviewed in Mar 2021. There were 3 interview rounds.

Interview Questionnaire 

4 Questions

  • Q1. What is webservice?
  • Ans. 

    A webservice is a software system designed to support interoperable machine-to-machine interaction over a network.

    • Webservices use standardized protocols such as HTTP, XML, SOAP, and REST.

    • They allow different applications to communicate with each other regardless of the programming language or platform used.

    • Webservices can be used for a variety of purposes such as data exchange, business process integration, and applica...

  • Answered by AI
  • Q2. What is Difference between API and Webservice
  • Ans. 

    API is a set of protocols for building software while Webservice is a type of API that uses HTTP for communication.

    • API is a set of protocols for building software applications

    • Webservice is a type of API that uses HTTP for communication

    • API can be used for both internal and external communication

    • Webservice is typically used for external communication over the internet

    • API can be in any form like REST, SOAP, etc.

    • Webservice

  • Answered by AI
  • Q3. What is pesticide paradox in testing
  • Ans. 

    Pesticide paradox refers to the phenomenon where pests develop resistance to pesticides over time.

    • Pesticides are used to kill pests, but over time pests develop resistance to them

    • This happens because the pests that are resistant to the pesticide survive and reproduce, passing on their resistance to their offspring

    • This can lead to the need for stronger and more toxic pesticides, which can have negative environmental and...

  • Answered by AI
  • Q4. Star pattern and palindrome Java program

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare for Java, OOPS and web services concepts.

Skills evaluated in this interview

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

I applied via Naukri.com and was interviewed before Feb 2023. There were 3 interview rounds.

Round 1 - Technical 

(2 Questions)

  • Q1. Related to Software Testing Process Coding questions Puzzle
  • Q2. How to get individual character from string
  • Ans. 

    Use indexing to access individual characters from a string.

    • Use square brackets and the index number to access a specific character in the string.

    • Remember that indexing starts at 0 in most programming languages.

    • Example: str = 'hello', to get the first character 'h', use str[0].

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

(1 Question)

  • Q1. Coding Questions
Round 3 - One-on-one 

(1 Question)

  • Q1. Managerial round
Round 1 - One-on-one 

(1 Question)

  • Q1. Data Structures, Core Java
Round 2 - One-on-one 

(1 Question)

  • Q1. Spring boot, Microservices

Interview Preparation Tips

Interview preparation tips for other job seekers - Learn basic programs. Basic unit tests. Basic Rest API
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed before Oct 2022. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all tips
Round 2 - Coding Test 

Oracle RDBMS concepts, core java, data structures

Round 3 - One-on-one 

(1 Question)

  • Q1. More like a discussion
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed before May 2023. There were 3 interview rounds.

Round 1 - Coding Test 

1 hour coding interview where medium level DSA problems were asked.

Round 2 - Coding Test 

1 hour interview. 1 coding question and some questions related to cloud were asked.

Round 3 - Behavioral 

(1 Question)

  • Q1. General discussion about the role and the work I will be doing.

Interview Preparation Tips

Interview preparation tips for other job seekers - Practice medium level leetcode questions along with some basic understanding of system design.

Tell us how to improve this page.

Interview Questions from Similar Companies

Adobe Interview Questions
3.9
 • 234 Interviews
24/7 Customer Interview Questions
3.5
 • 176 Interviews
Dassault Systemes Interview Questions
4.0
 • 162 Interviews
Oracle Cerner Interview Questions
3.7
 • 157 Interviews
VMware Software Interview Questions
4.4
 • 145 Interviews
ServiceNow Interview Questions
4.1
 • 120 Interviews
Thomson Reuters Interview Questions
4.1
 • 113 Interviews
Amadeus Interview Questions
3.9
 • 107 Interviews
UKG Interview Questions
3.1
 • 102 Interviews
Atlassian Interview Questions
3.5
 • 88 Interviews
View all
Software Engineer
146 salaries
unlock blur

₹5.7 L/yr - ₹23 L/yr

Senior Technical Support Engineer
88 salaries
unlock blur

₹7 L/yr - ₹25 L/yr

Senior Technical Specialist
82 salaries
unlock blur

₹6 L/yr - ₹15 L/yr

Senior Software Engineer
71 salaries
unlock blur

₹9 L/yr - ₹27.3 L/yr

Softwaretest Engineer
69 salaries
unlock blur

₹3.2 L/yr - ₹5.6 L/yr

Explore more salaries
Compare AVAYA with

24/7 Customer

3.5
Compare

Thomson Reuters

4.1
Compare

Oracle Cerner

3.7
Compare

NextComm Corporation

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