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 Senior Software Developer Interview Questions and Answers

Updated 3 Oct 2024

AVAYA Senior Software Developer Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
Not Selected

I appeared for an interview in Sep 2024.

Round 1 - Technical 

(2 Questions)

  • Q1. Basic on java collections multithreading
  • Q2. Puzzle networking isp protocol
Round 2 - Technical 

(1 Question)

  • Q1. Coding implement lru cache

Interview questions from similar companies

Interview Questionnaire 

1 Question

  • Q1. Questions related to AWS dynamodb,lambdas,cloudwatch logs,Athena,json filehandling,decorators,classes and others oops concepts ,string manipulation, word frequency problems, dictionary,boto3 scripting

Interview Questionnaire 

1 Question

  • Q1. Basic java questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Verify your project before joining, since they give different project and skill

I applied via LinkedIn and was interviewed in Apr 2021. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. All were technical. Just keep practicing data structures and Algorithms and have good knowledge of the language you're good at.

Interview Preparation Tips

Interview preparation tips for other job seekers - Hey Folks
Just never get discouraged by your failures. Keep working hard and be consistent in your efforts. You will surely achieve what you deserve.

I applied via Naukri.com and was interviewed before Jul 2020. There were 4 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. Questions on java8
  • Q2. Questions on multithreading
  • Q3. Questions on exception handling

Interview Preparation Tips

Interview preparation tips for other job seekers - First round was a coding round where interviewer asked questions randomly and were asked to optimise our code. Next round was a technical round where everyone needs to be thorough with their technical skills

Interview Questionnaire 

1 Question

  • Q1. C++ Program to reverse a string
  • Ans. 

    C++ program to reverse a string

    • Use a loop to iterate through the string

    • Swap the characters at the beginning and end of the string

    • Continue swapping until the middle of the string is reached

  • Answered by AI

Skills evaluated in this interview

I applied via Campus Placement and was interviewed before Sep 2021. There were 4 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 tips
Round 2 - Aptitude Test 

Math and verbal round .

Round 3 - Group Discussion 

General topics to speak

Round 4 - Technical 

(1 Question)

  • Q1. Duplicates in array College Projects Hashmap implementation
  • Ans. 

    Implement a function to find duplicates in an array of strings using Hashmap.

    • Create a Hashmap to store the frequency of each string in the array

    • Iterate through the array and check if the frequency of any string is greater than 1

    • If yes, add it to the list of duplicates

    • Return the list of duplicates

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Answer what you know, be genuine and honest

Skills evaluated in this interview

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

4 questions been asked in coding test

Round 2 - Technical 

(1 Question)

  • Q1. DSA been asked in the interview
Round 3 - HR 

(1 Question)

  • Q1. How do u deal with the members who are having conflict of interest

Interview Questionnaire 

21 Questions

  • Q1. AVL tree balance checking
  • Q2. Median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity
  • Ans. 

    Find median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity

    • Use binary search to find the partition point in both arrays

    • Calculate the median based on the partition point and array sizes

    • Adjust the partition points based on the median value

    • Repeat until the partition points are at the median

    • Handle edge cases such as empty arrays and uneven array sizes

  • Answered by AI
  • Q3. Strings Anagram in O(1) space complexity
  • Ans. 

    Anagram of strings in O(1) space complexity

    • Use a fixed size array of integers to store the frequency of characters in the first string

    • Iterate through the second string and decrement the frequency of each character in the array

    • If all the frequencies are zero, then the strings are anagrams

    • Return true or false accordingly

  • Answered by AI
  • Q4. Level order traversal of a tree using Queue
  • Ans. 

    Level order traversal of a tree using Queue

    • Create a queue and add the root node to it

    • While the queue is not empty, remove the front node and print its value

    • Add the left and right child nodes of the removed node to the queue

    • Repeat until the queue is empty

  • Answered by AI
  • Q5. Reverse level order traversal of a tree using Queue
  • Ans. 

    Reverse level order traversal of a tree using Queue

    • Create a queue and push the root node into it

    • While the queue is not empty, pop the front node and push its children into the queue

    • Add the popped node to a stack

    • Once the queue is empty, pop elements from the stack and print them

  • Answered by AI
  • Q6. BFS and DFS Difference
  • Ans. 

    BFS and DFS are graph traversal algorithms. BFS explores nodes level by level while DFS explores nodes depth by depth.

    • BFS uses a queue while DFS uses a stack or recursion.

    • BFS is optimal for finding shortest path while DFS is optimal for finding a path between two nodes.

    • BFS requires more memory as it stores all the nodes at each level while DFS requires less memory.

    • BFS can be used to find connected components while DFS

  • Answered by AI
  • Q7. OS Concepts – Starvation, Demand Paging, Virtual Memory, Deadlocks
  • Q8. Parenthesis Balance Checking
  • Q9. Three Jars - 1 with apples, 1 with oranges, 1 with apples and oranges. All of them wrongly labelled. Find min no of attempts to find the correct nature of boxes
  • Q10. Find product of each element of an array except that element in O(N) time complexity without using / operation
  • Ans. 

    Find product of each element of an array except that element in O(N) time complexity without using / operation

    • Use prefix and suffix products

    • Multiply prefix and suffix products for each element to get the final product

    • Handle edge cases where array has 0 or 1 element separately

  • Answered by AI
  • Q11. Recursively deleting linked list
  • Ans. 

    Recursively delete a linked list

    • Create a recursive function that takes the head of the linked list as input

    • Base case: if the head is null, return

    • Recursively call the function with the next node as input

    • Delete the current node

  • Answered by AI
  • Q12. Recursively deleting linked list from end
  • Ans. 

    Recursively delete a linked list from the end.

    • Start from the head and recursively traverse to the end of the list.

    • Delete the last node and set the second last node's next pointer to null.

    • Repeat until the entire list is deleted.

    • Use a recursive function to implement the deletion process.

  • Answered by AI
  • Q13. Recursively deleting tree
  • Ans. 

    Recursively delete a tree by deleting all its child nodes and then the parent node.

    • Start from the leaf nodes and delete them first.

    • Then move up to the parent nodes and delete them.

    • Repeat until the root node is deleted.

    • Use post-order traversal to ensure child nodes are deleted before parent nodes.

  • Answered by AI
  • Q14. Recursively deleting from end
  • Ans. 

    Recursively delete elements from the end of an array.

    • Create a recursive function that removes the last element of the array.

    • Call the function recursively until the desired number of elements are removed.

    • Handle edge cases such as empty arrays and removing more elements than the array contains.

  • Answered by AI
  • Q15. Difference between Floyd Warshall and Djikstra
  • Ans. 

    Floyd Warshall finds shortest path between all pairs of vertices while Djikstra finds shortest path from a single source.

    • Floyd Warshall is used for dense graphs while Djikstra is used for sparse graphs.

    • Floyd Warshall has a time complexity of O(n^3) while Djikstra has a time complexity of O((n+m)logn).

    • Floyd Warshall can handle negative edge weights while Djikstra cannot.

    • Floyd Warshall can detect negative cycles while Dj

  • Answered by AI
  • Q16. Shortest path between 2 points in 2-D space in O(log N) time
  • Ans. 

    There is no known algorithm to find shortest path in 2-D space in O(log N) time.

    • The best known algorithm for finding shortest path in 2-D space is Dijkstra's algorithm which has a time complexity of O(N^2).

    • Other algorithms like A* and Bellman-Ford have better time complexity but still not O(log N).

    • If the points are on a grid, Lee algorithm can be used which has a time complexity of O(N).

  • Answered by AI
  • Q17. Design a system for putting newspapers using classes and functions taking different aspects into account
  • Ans. 

    Design a system for putting newspapers using classes and functions

    • Create a Newspaper class with attributes like title, date, and content

    • Create a Publisher class with methods to publish and distribute newspapers

    • Create a Subscriber class with methods to subscribe and receive newspapers

    • Use inheritance to create different types of newspapers like daily, weekly, etc.

    • Implement a database to store newspaper information and ha

  • Answered by AI
  • Q18. SQL commands
  • Q19. Career Prospects - Long Term Plans
  • Q20. Why not higher studies?
  • Ans. 

    I believe practical experience is more valuable than higher studies.

    • I have gained valuable experience through internships and projects.

    • I prefer hands-on learning and problem-solving over theoretical knowledge.

    • I am constantly learning and improving my skills through online courses and workshops.

  • Answered by AI
  • Q21. Machine Learning Concepts - Based on my projects

Interview Preparation Tips

Round: Test
Experience: All Computer Science Topics Covered: Data Structures, Algorithms, Object Oriented Systems, C, C++, Operating Systems, Computer Architectures, Databases, SQL, Basic Quantitative Aptitude
Tips: Solve all of them. Cut off's generally go high.
Duration: 30 minutes
Total Questions: 30

Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.

Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.

Round: Interview
Experience: Nice Experience. Interviewer was friendly.
Tips: Do not fake yourself.

General Tips: Be thorough with all CS related concepts and projects.
Skill Tips: ""Be thorough.""
Skills: Algorithms, Data Structures, Operating Systems, Machine Learning, SQL, Operating Systems, Computer Architecture, Data Analytics
College Name: IIT Kharagpur
Motivation: Kind of application oriented work and the rising nature of the company. Obviously money also.
Funny Moments: Many funny questions and answers like did you have lunch, when did you last eat, etc

Skills evaluated in this interview

Interview Preparation Tips

General Tips: Just be confident. You may not be able to answer all the questions correctly. If you don't know the answer, be honest and confidently answer the questions that you know.
College Name: NIT SURATHKAL

AVAYA Interview FAQs

How many rounds are there in AVAYA Senior Software Developer interview?
AVAYA interview process usually has 2 rounds. The most common rounds in the AVAYA interview process are Technical.
What are the top questions asked in AVAYA Senior Software Developer interview?

Some of the top questions asked at the AVAYA Senior Software Developer interview -

  1. Basic on java collections multithread...read more
  2. Puzzle networking isp proto...read more
  3. Coding implement lru ca...read more

Tell us how to improve this page.

AVAYA Senior Software Developer Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more
AVAYA Senior Software Developer Salary
based on 9 salaries
₹8.7 L/yr - ₹30 L/yr
26% more than the average Senior Software Developer Salary in India
View more details
Software Engineer
146 salaries
unlock blur

₹5.7 L/yr - ₹23 L/yr

Senior Technical Support Engineer
90 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