Upload Button Icon Add office photos

TIBCO Software

Compare button icon Compare button icon Compare

Filter interviews by

TIBCO Software Software Developer Interview Questions and Answers

Updated 27 Sep 2024

TIBCO Software Software Developer Interview Experiences

2 interviews found

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

I applied via Naukri.com and was interviewed before Sep 2023. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. Angular directives,html,css
  • Q2. Javascript,github

I applied via Approached by Company and was interviewed in Mar 2022. There were 4 interview rounds.

Round 1 - Aptitude Test 

Reasoning , Techincal

Round 2 - Technical 

(2 Questions)

  • Q1. Explain migration of tibco from bw 5 to 6
  • Ans. 

    Migration from Tibco BW 5 to 6 involves upgrading the platform, converting projects, and testing.

    • Upgrade the Tibco platform to version 6

    • Convert existing BW 5 projects to BW 6 format

    • Test the migrated projects thoroughly to ensure compatibility and functionality

    • Consider any necessary changes to configuration and deployment processes

    • Ensure compatibility with any dependent systems or applications

  • Answered by AI
  • Q2. Explain saop serices in tibco BW 5 & 6
  • Ans. 

    SOAP services in Tibco BW 5 & 6 are used for communication between applications using XML-based messages over HTTP or HTTPS.

    • SOAP stands for Simple Object Access Protocol

    • Tibco BW 5 & 6 support both SOAP 1.1 and SOAP 1.2

    • SOAP services use WSDL (Web Services Description Language) to describe the service

    • SOAP services can be implemented using Tibco Designer in BW 5 & 6

    • SOAP services can be secured using SSL/TLS encryption and

  • Answered by AI
Round 3 - Technical 

(1 Question)

  • Q1. Explain about saop, EMS Tibco Migration
  • Ans. 

    SOAP is a protocol used for exchanging structured data between applications over the internet. EMS Tibco Migration is the process of migrating from Tibco EMS to other messaging systems.

    • SOAP stands for Simple Object Access Protocol

    • It uses XML for message exchange

    • It is commonly used in web services

    • EMS Tibco Migration involves moving from Tibco EMS to other messaging systems like Apache Kafka or RabbitMQ

    • It requires carefu...

  • Answered by AI
Round 4 - HR 

(2 Questions)

  • Q1. Share details of your previous job.
  • Ans. 

    I worked as a Software Developer at XYZ Company.

    • Developed and maintained software applications using Java and Python.

    • Collaborated with a team of developers to design and implement new features.

    • Performed code reviews and debugging to ensure software quality.

    • Worked closely with clients to gather requirements and provide technical support.

    • Implemented unit tests and conducted system testing to identify and fix bugs.

    • Partici...

  • Answered by AI
  • Q2. Why are you looking for a change?
  • Ans. 

    Seeking new challenges and growth opportunities in a different environment.

    • Looking for a change to expand my skill set and learn new technologies.

    • Seeking a more collaborative and innovative work culture.

    • Wanting to work on larger and more complex projects.

    • Desire for career advancement and professional development.

    • Relocation or proximity to family and personal reasons.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Confidence, tell them if you don t the answer

Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
asked in Amazon
Q2. Minimum Number of Platforms Needed Problem Statement You are give ... read more
asked in Rakuten
Q3. Merge Two Sorted Arrays Problem Statement Given two sorted intege ... read more
asked in Cognizant
Q4. Nth Fibonacci Number Problem Statement Calculate the Nth term in ... read more
Q5. Find Duplicate in Array Problem Statement You are provided with a ... read more

Interview questions from similar companies

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

4 coding questions on hackerrank.

  • Q1. 

    Dice Throws Problem Statement

    You are given D dice, each having F faces numbered from 1 to F. The task is to determine the number of possible ways to roll all the dice such that the sum of the face-up num...

  • Ans. 

    The task is to determine the number of possible ways to roll all the dice such that the sum of the face-up numbers equals the given 'target' sum.

    • Use dynamic programming to solve the problem efficiently.

    • Create a 2D array to store the number of ways to achieve each sum with the given number of dice.

    • Iterate through the dice and faces to calculate the number of ways to reach each sum.

    • Return the result modulo 10^9 + 7.

    • Optim...

  • Answered by AI
  • Q2. 

    Stack using Two Queues Problem Statement

    Develop a Stack Data Structure to store integer values using two Queues internally.

    Your stack implementation should provide these public functions:

    Explanation:

    ...
  • Ans. 

    Implement a stack using two queues to store integer values with specified functions.

    • Use two queues to simulate stack operations efficiently.

    • Maintain the top element in one of the queues for easy access.

    • Ensure proper handling of edge cases like empty stack.

    • Example: Push elements 5, 10, 15; Pop elements; Check top element.

    • Example: Check if stack is empty; Get stack size.

  • Answered by AI
  • Q3. 

    Maximum Subarray Sum Problem Statement

    Given an array 'ARR' of integers with length 'N', the task is to determine the sum of the subarray (including an empty subarray) that yields the maximum sum among al...

  • Ans. 

    Find the maximum sum of a subarray in an array of integers.

    • Iterate through the array and keep track of the maximum sum subarray ending at each index.

    • Use Kadane's algorithm to efficiently find the maximum subarray sum.

    • Consider the case where all elements are negative to handle edge cases.

    • Example: For input [1, -2, 3, -1, 2], the maximum subarray sum is 4.

  • Answered by AI
Round 2 - Video Call 

Round duration - 60 minutes
Round difficulty - Medium

My 1st technical round began with a small introduction and a discussion on my projects. After that, my complete interview revolved around Object-oriented principles and 1 basic coding question. The interviewer asked all the pillars of Object-oriented along with use cases and where have I implemented them in my projects.

Round 3 - Video Call 

(1 Question)

Round duration - 45 minutes
Round difficulty - Easy

In my 2nd technical round, the interviewer began with the complete discussion of my projects. He asked me everything about them like which technologies I have used, why I have used them, what are the alternatives, what are the real-life applications of these projects. After this, He asked questions on Computer Networks, Operating system, Database Management system and at the end, some of the SQL queries. SQL queries were quite easy, I found one of the queries tricky and harder as compared to other i.e print nth largest salary of the employees. The interviewer also asked me why I was not able to code one of the questions in the coding round. I explained the complete approach of that question and he was quite satisfied. This technical round was of 1 hour long.

  • Q1. Print the nth largest salary from a given list of salaries.
  • Ans. 

    Find the nth largest salary from a list of salaries.

    • Sort the list of salaries in descending order.

    • Remove duplicates from the sorted list.

    • Return the salary at index n-1 from the sorted list.

  • Answered by AI
Round 4 - HR 

(1 Question)

Round duration - 35 minutes
Round difficulty - Easy

There were two panellists in this round and they began with a small introduction. One of them asked me about my capstone project which was based on object recognition task and deep learning. He just told me to explain deep learning in complete detail and how can it be used on my college campus. Then, He asked me what technologies are being used and how I trained my model as the model was quite heavy and computationally intensive. Then, they asked me how I cope up with my team members in the pandemic situation and how I managed to interact with them.

  • Q1. What are the basic applications of deep learning, and how can I implement it in my college?
  • Ans. 

    Deep learning has applications in image and speech recognition, natural language processing, autonomous vehicles, etc.

    • Image recognition - identifying objects in images, used in self-driving cars, medical imaging, etc.

    • Speech recognition - converting spoken language into text, used in virtual assistants like Siri, Alexa, etc.

    • Natural language processing - understanding and generating human language, used in chatbots, lang...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaAbove 8 CGPACloudera interview preparation:Topics to prepare for the interview - Object-oriented programming in C++, Data Structure and algorithms, Computer Networks, Operating Systems, Database Management SystemsTime required to prepare for the interview - 5 monthsInterview preparation tips for other job seekers

Tip 1 : Practice at least 600 questions from leetcode.
Tip 2 : Make sure you participate in every long challenge of CodeChef.
Tip 3 : Focus more on your projects.

Application resume tips for other job seekers

Tip 1 : Do not put false things on a resume.
Tip 2 : Have some projects on a resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Coding test was simple with 3 questions, 1 with SQL and other 2 with dsa questions

Round 2 - Technical 

(2 Questions)

  • Q1. Resume based questions
  • Q2. Resume based question

Interview Questionnaire 

11 Questions

  • Q1. Asked about my project? Also asked me questions about ACID properties of database and indexing in a database
  • Q2. There were also questions related to OOPS concepts including polymorphism, composition, aggregation, inheritance, Abstract classes, interface; difference between usage of abstract class and interface, can ...
  • Q3. There was another question on run time and compile time binding and under which category do we classify method overloading
  • Q4. Code for deleting the duplicate nodes in a sorted link list?
  • Ans. 

    Code to delete duplicate nodes in a sorted linked list

    • Traverse the linked list and compare adjacent nodes

    • If nodes are equal, delete one of them

    • Repeat until all duplicates are removed

  • Answered by AI
  • Q5. Printing root to leaf paths in a binary search tree
  • Ans. 

    Printing all root to leaf paths in a binary search tree

    • Traverse the tree recursively and keep track of the current path

    • When a leaf node is reached, add the current path to the list of paths

    • Print all the paths in the list

    • Use an array of strings to store the paths

  • Answered by AI
  • Q6. Given an Array of Integers, Find two elements in the array whose sum is closest to zero?
  • Ans. 

    Find two integers in an array whose sum is closest to zero.

    • Sort the array in ascending order.

    • Initialize two pointers at the beginning and end of the array.

    • Move the pointers towards each other until the sum is closest to zero.

  • Answered by AI
  • Q7. What are virtual functions, what is their role? Questions related to virtual functions?
  • Q8. You are given the details of each transaction of each item i.e. item_name, quantity, price. So at the end of the day, you want top 50 items that have been sold. There are two cases: - In the first case you...
  • Q9. How do you quickly count the number of set bits in a 32-bit integer in linear time (with respect to the number of set bits)?
  • Ans. 

    Count set bits in a 32-bit integer in linear time

    • Use bit manipulation to count set bits

    • Divide the integer into 16-bit chunks and count set bits in each chunk

    • Use lookup tables to count set bits in each 8-bit chunk

    • Use parallel processing to count set bits in multiple integers simultaneously

  • Answered by AI
  • Q10. Determining width of binary tree i.e. using breadth wise traversal
  • Ans. 

    To determine the width of a binary tree using breadth-wise traversal, we need to count the number of nodes at each level.

    • Perform a breadth-first traversal of the binary tree

    • Count the number of nodes at each level

    • Keep track of the maximum number of nodes seen at any level

    • Return the maximum number of nodes seen

  • Answered by AI
  • Q11. Why files are preferred over databases?
  • Ans. 

    Files are preferred over databases for certain types of data and applications.

    • Files are faster for small amounts of data.

    • Files are easier to manage and backup.

    • Files are more flexible for certain types of data, such as images or videos.

    • Databases are better for complex data relationships and queries.

    • Databases are more secure and scalable for large amounts of data.

    • The choice between files and databases depends on the spec

  • Answered by AI

Interview Preparation Tips

Round: Test
Experience: There were questions from Operating Systems, C, Algorithms, Data Structures

Round: Test
Experience: This round had 15 questions.Data structures, C++ questions, algorithms (DFS/BFS)

Skills: java, OOP, Algorithm
College Name: IIT KANPUR

Skills evaluated in this interview

Interview Questionnaire 

16 Questions

  • Q1. Simple linked list questions-find middle element,given a pointer to second last element delete it
  • Q2. Explain insertion sort,quicksort
  • Ans. 

    Insertion sort and quicksort are sorting algorithms used to sort arrays of data.

    • Insertion sort: iterates through the array and inserts each element into its proper position.

    • Quicksort: selects a pivot element and partitions the array into two sub-arrays, one with elements less than the pivot and one with elements greater than the pivot.

    • Insertion sort is best for small arrays, while quicksort is best for large arrays.

    • Bot...

  • Answered by AI
  • Q3. Concept of virtual destructors,runtime polymorphism
  • Q4. Test cases for an installation software like check if sufficient memory available,check for a previous version,check to undo all the changes made to the system while quitting the installation. 5.2 puzzles
  • Q5. Merge two sorted linked lists using recursion
  • Ans. 

    Merge two sorted linked lists using recursion

    • Create a recursive function that compares the first nodes of both lists

    • Set the smaller node as the head of the merged list and call the function again with the next node of the smaller list

    • Base case: if one list is empty, return the other list

    • Return the merged list

  • Answered by AI
  • Q6. Given an integer(consider 4 bytes) find which byte is zero
  • Ans. 

    Given an integer, determine which byte is zero.

    • Convert the integer to a byte array using bitwise operations.

    • Iterate through the byte array and check for a zero value.

    • Return the index of the zero byte.

    • Consider endianness when converting to byte array.

  • Answered by AI
  • Q7. Program to check whether your machine is little endian or big endian
  • Ans. 

    To check endianness, create a 4-byte integer with a known value and check the byte order.

    • Create a 4-byte integer with a known value

    • Check the value of the first byte to determine endianness

    • If the first byte is the least significant, the machine is little endian

    • If the first byte is the most significant, the machine is big endian

  • Answered by AI
  • Q8. Print something before execution of main()(use static objects)
  • Ans. 

    Static objects can be used to print something before main() execution.

    • Static objects are initialized before main() execution

    • They can be used to print something before main()

    • Example: static int x = printf("Hello World!");

    • Output: Hello World! will be printed before main() execution

  • Answered by AI
  • Q9. Memory allocation for static varibles(when,which segment etc)
  • Ans. 

    Static variables are allocated memory in the data segment of the program's memory space.

    • Static variables have a fixed memory location throughout the program's execution.

    • They are initialized to zero by default.

    • If initialized explicitly, they are stored in the data segment.

    • Static variables can be accessed by any function in the program.

  • Answered by AI
  • Q10. Find space and time complexity for a recursive function(he wrote it)
  • Ans. 

    Finding space and time complexity of a recursive function.

    • Space complexity is the amount of memory used by the function.

    • Time complexity is the amount of time taken by the function to execute.

    • Recursive functions have higher space complexity due to the call stack.

    • Time complexity can be calculated using Big O notation.

    • Examples of recursive functions include factorial and Fibonacci sequence.

  • Answered by AI
  • Q11. Some questions on major project
  • Q12. Preprocessor directives,volatile keyword
  • Q13. Virtual pointer table,operator overloading,friend functions,semaphores
  • Q14. Diamond heirarchy problem
  • Ans. 

    Diamond hierarchy problem is a problem in object-oriented programming where a class inherits from multiple classes in a diamond-shaped hierarchy.

    • Occurs when a class inherits from two classes that share a common base class

    • Can lead to ambiguity in method calls and data members

    • Solved using virtual inheritance or by using interfaces

  • Answered by AI
  • Q15. Fibonacci series.(:P)
  • Q16. Puzzle

Interview Preparation Tips

Round: Test
Experience: 1. Aptitude-Mostly caselets on ordering and some easy quant questions.
2. c/c++-No objective questions.Mostly on basics(function pointers,give output of string based codes).Some simple progams(Find smallest of three numbers using conditional operators.gcd using recursion)
3.Data Structures-LCA for BST,2's compliment,reverse a doubly linked list.

College Name: NA

Skills evaluated in this interview

Interview Questionnaire 

20 Questions

  • Q1. He asked me my specialization?
  • Q2. Why not further studies? (He had noted that I was third in my batch. He appeared impressed by that
  • Q3. He asked me to tell him about my favorite project
  • Q4. He then looked at my grades. He commented that my lowest grade – B- was in Digital Image Processing. I just looked at him like a doofus thinking of what to say. But he quickly added, ‘don’t worry, it happe...
  • Q5. He then asked me a question that had been asked in Round 4, written test:Describe an optimal algorithm to find the second minimum number in an array of numbers. What is the exact number of comparisons requ...
  • Q6. Given a polygon (could be regular, irregular, convex, concave), find out whether a particular point lies inside it or outside it
  • Ans. 

    To determine if a point is inside a polygon, use the ray casting algorithm.

    • Create a line from the point to a point outside the polygon

    • Count the number of times the line intersects with the polygon edges

    • If the count is odd, the point is inside the polygon; otherwise, it is outside

  • Answered by AI
  • Q7. He asked me to explain Canny’s algorithm to him. (this was because my DIP project was related to this)
  • Q8. Then, he gave me a practical problem to solve: Suppose you are given an image which contains some text and some photos. How do you find the location of the image?
  • Q9. Which are the four storage classes in C
  • Ans. 

    The four storage classes in C are auto, register, static, and extern.

    • Auto: default storage class for all local variables

    • Register: used to define local variables that should be stored in a register instead of RAM

    • Static: used to define local variables that retain their value between function calls

    • Extern: used to declare a global variable that is defined in another file

  • Answered by AI
  • Q10. Given a program: int i; int main() { int j; int *k = (int *) malloc (sizeof(int)); … } Where are each of these variables stored?
  • Ans. 

    i is stored in global data segment, j is stored in stack, k is stored in heap.

    • i is a global variable and is stored in the global data segment

    • j is a local variable and is stored in the stack

    • k is a pointer variable and is stored in the stack, while the memory it points to is allocated on the heap using malloc()

  • Answered by AI
  • Q11. Question on polymorphisms
  • Q12. He again went back to the first question he had asked me. Once again
  • Q13. Then he wrote out some code and asked me how the compiler will generate code for it. I gave some answer, but he was clearly not satisfied. I thought it was all over by then. Then, he asked me a DIP quest...
  • Q14. Given a set of words one after another, give me a data structure so that you’ll know whether a word has appeared already or not
  • Ans. 

    Use a hash table to store the words and check for existence in constant time.

    • Create a hash table with the words as keys and a boolean value as the value.

    • For each new word, check if it exists in the hash table. If it does, it has appeared before. If not, add it to the hash table.

    • Alternatively, use a set data structure to store only the unique words and check for existence in the set.

  • Answered by AI
  • Q15. He asked me some questions on Interprocess Communication: What’s a semaphore? How are they used? He would often pick out words from my answers and ask me what they meant. He wanted to make sure that I rea...
  • Q16. He then asked me some DB fundas. Transaction. Serializability, Consistent state, etc
  • Q17. Finally, he asked me whether I had any questions
  • Q18. There is a clock at the bottom of the hill and a clock at the top of the hill. The clock at the bottom of the hill works fine but the clock at the top doesn’t. How will you synchronize the two clocks. Obv...
  • Q19. There was one more puzzle.. I don’t remember it. but I do remember that we started discussing ways of generating large prime numbers
  • Q20. We also talked a bit about my phone browser project

Interview Preparation Tips

Round: Test
Duration: 15 minutes
Total Questions: 1

Round: Test
Duration: 30 minutes
Total Questions: 2

Round: Test
Duration: 30 minutes
Total Questions: 3

Round: Test
Total Questions: 4

Round: Technical Interview
Experience: 1.When I told him that I had none as I didn’t want to specialize in this stage, he was a little surprised but appeared satisfied with my reason.2.I told him that my profile clearly indicated that I’ve been trying to get into the industry via internships, industry-funded projects right from second year, second sem. I said that I was fully sure that I didn’t want to do MS anytime soon.3.I told him about the web-browser that I had developed for cell-phones. I thought that was the only project which was closest to what Adobe was working on. He appeared satisfied with my answers.4. So people, be fully prepared to explain any anomalous grades. I was prepared with the explanation of the W in the my grade-sheet but not of the B- in DIP. I know that this is really stupid considering that I was interviewing with Adobe. Don’t make this mistake.5.I screwed up, big time in this question. I had superficially discussed this question with my friend a while ago and he had outlined an algorithm which I thought that I had understood, but I hadn’t. I started off explaining it but got stuck in the middle. He sternly told me to read it up again. One solution that I could tell him, and which I had written in the test was this Use two variables – min and second min. Initialize them by comparing the first two elements of the array. This is (1) comparison. Then, go through the entire array, from index 2 to n-1 comparing each element, first with min and then with second min, updating each variable as necessary. This will involve a worst case of two comparisons for each element. Therefore, total number of comparisons = 2*(n-2) + 1 = 2*n – 3 comparisons.I’ll try to update this with a better solution, sometime soon.6.This is an easy, straight question from graphics. You shoot a ray parallel to the x-axis passing through this point. Start with odd parity. Change parity of ray each time it intersects an edge of the polygon (consider special case of when the line passes through a vertex of the polygon. Change parity only if it passes through a vertex which has one edge above it and one edge below the ray). If the parity of ray is even when it passes through the point, it is inside the polygon, else it is not.7.This is simple. Study DIP8.I gave various alternatives – from searching for RGB components, to using OCR.. he didn’t appear fully satisfied. I think he was looking for edge-detection, but that would fail, if the text contained tables, etc.

Round: Technical Interview
Experience: He was friendly at the start but this interview was my worst. He asked me my favorite subject. I said that it was Programming. (He laughed at that)

1. static, extern, register, auto2.I started off correctly, but he was able to confuse me. He brought in shared libraries, static libraries fundas into the discussion. We had a discussion for about twenty-minutes on this. Finally, he was happy with one of my answers because I had deduced which policy made sense and answered correctly. He said that out of all the people interviewed so far (I was second last), nobody had been able to answer all of these questions correctly.3.this is easy – get it from any C++ book. He tried to confuse me again, but this time I was ready and he was finally satisfied.Then he looked at my grades and said that out of all your grades, you have only two Bs and one of them is in Compilers. Why? (Damn it. three non-A grades and that’s all they ask about. What’s wrong with this world?!)Didn’t you like Compilers? “Not in particular”, I replied. “Fine. Now, I HAVE to ask you questions on compilers”, he said.4.He again went back to the first question he had asked me. Once again5.I first suggested that we capture only a small portion of the board. To locate that portion, we could search for the chalk in the prof’s hand – of course, taking care that it had the blackboard in the background (no point capturing a video of the prof scratching his chin, na?). Further, if the prof was writing only text, we could convert the video into text by OCR and then transmitting. Simple diagrams could also be reduced to a set of vector-graphics instructions (we rarely, see the prof shading stuff). I think he liked my approach, but was not completely satisfied. Anyway, we left it at that and went forward.6.I suggested various alternatives. but he kept helping me and finally, we came up with an array of pointers to 26-trees (each node of the tree has 26 children). Store every word as a path from the root to a leaf with pointers in the correct places. For example, hello would be stored as – pointer from ‘h’ index of the root array to a node which had a pointer from ‘e’ index of it’s array to a node which had a pointer from ‘l’ index of the array.. and so on. This is both time and space efficient.7.I was able to answer all his questions, but I made the mistake of telling him, when we started off that I didn’t know much about this subject as I had done it a long time ago. He was very annoyed at that, apparently because a lot of people before me had said this.8.I was able to answer all of them. I stumbled around a bit in a few questions where I was explaining correctly, but not using the keywords that he was looking for.9.I thought that I should say something to make him realize that I was not completely stupid and so asked him whether there was any logic to the order in which the short-listed candidates were called. This turned out to be a dumb move. The order was alphabetic and he sent me off with a parting shot, saying “You guys do pattern recognition and stuff and still you can’t recognize such a simple pattern” Me and my big mouth! Moral of the story: Don’t ask questions for the sake of asking.

Round: Puzzle Interview
Experience: After the first two interviews, this one was like having a warm batch after being cold and wet for days! I did well in this one.1.You have to go up the hill and come back, with horse, without horse, getting four equations to solve four unknowns – time to go uphill – with horse, without horse, time to go downhill – with horse, without horse. Then you can go up the hill and set the clock to ‘(time when you left) + (time to go uphill with horse)’2.  I told him the funda of Mersenee primes (luckily remembered it) and he was decently impressed.

General Tips: Finally hired by Adobe. Special thanks to AmbitionBox team. Really amazing site for sharing experience. That’s all for the Adobe. They are focusing on your approach and your coding skills. All the best.
Skills: Algorithm, Data structure, C++, C, DIP
College Name: BIT Mesra

Skills evaluated in this interview

Interview Questionnaire 

12 Questions

  • Q1. Given a binary tree and an integer x, return whether the binary tree has a path from root to a leaf whose values sum to x
  • Q2. Gievn a binary tree and return all root to leaf node pathss row,col and value
  • Ans. 

    Return all root to leaf node paths in a binary tree with row, col and value.

    • Traverse the binary tree recursively and keep track of the current path.

    • When a leaf node is reached, add the path to the result array.

    • Include row, col and value of each node in the path.

    • Use an array of strings to store the paths.

  • Answered by AI
  • Q3. He then asked me to give test cases for testing this program
  • Q4. Given two unsorted arrays of numbers and asked me to find the intersection
  • Q5. GetMax() function for a stack in O(1)
  • Ans. 

    To get max value from a stack in O(1), maintain a separate stack to keep track of maximum values.

    • Create a separate stack to keep track of maximum values

    • Push the maximum value onto the stack whenever a new maximum is encountered

    • Pop the maximum value stack whenever the top element of the main stack is popped

    • Return the top element of the maximum value stack to get the maximum value in O(1)

  • Answered by AI
  • Q6. GetMax() function for a queue in O(1)
  • Ans. 

    To get max element from a queue in O(1) time complexity

    • Maintain a separate variable to keep track of the maximum element in the queue

    • Update the maximum element variable whenever a new element is added or removed from the queue

    • Return the maximum element variable when getMax() function is called

  • Answered by AI
  • Q7. Given an array in which consecutive elements differ by 1, i.e. a[i] – a[i + 1] = 1 or -1, and an element x, find the element in the array
  • Q8. Given an array, find the Next Greatest Element to the right for each element
  • Ans. 

    Find the Next Greatest Element to the right for each element in an array of strings.

    • Iterate through the array from right to left

    • Use a stack to keep track of elements

    • Pop elements from stack until a greater element is found

    • If no greater element is found, assign -1

    • Return the result array

  • Answered by AI
  • Q9. Given an expression, remove unnecessary parenthesis. For example if (((a + b)) * c) is given make it (a + b) * c, as it evaluates in the same way without those parenthesis also
  • Ans. 

    To remove unnecessary parenthesis from an expression, we need to apply a set of rules to identify and eliminate them.

    • Identify and remove parenthesis around single variables or constants

    • Identify and remove parenthesis around expressions with only one operator

    • Identify and remove parenthesis around expressions with operators of equal precedence

    • Identify and remove parenthesis around expressions with operators of different ...

  • Answered by AI
  • Q10. Given an array of integers, find the maximum product which can be formed by three numbers
  • Ans. 

    Find the maximum product of three integers in an array.

    • Sort the array in descending order.

    • Check the product of the first three numbers and the product of the first and last two numbers.

    • Return the maximum of the two products.

  • Answered by AI
  • Q11. Given an array of integers, find the length of the longest consecutive sub array which forms an AP
  • Ans. 

    Find length of longest consecutive sub array forming an AP from given array of integers.

    • Sort the array in ascending order

    • Iterate through the array and find the longest consecutive sub array forming an AP

    • Use a variable to keep track of the length of the current consecutive sub array forming an AP

    • Use another variable to keep track of the length of the longest consecutive sub array forming an AP seen so far

  • Answered by AI
  • Q12. Given a binary tree, connect all the nodes at the same level. Each node will have a next pointer; you have to make it point to the next node to its right in the same level. If there is no such node, make ...

Interview Preparation Tips

Skills: Algorithm, Data structure
College Name: NA

Skills evaluated in this interview

I was interviewed before Jan 2021.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

The interviewer asked me 2 questions related to DS/Algo in this round . Both the questions were of Easy-Medium difficulty and I was also required to code them in a production ready manner.

  • Q1. 

    Maximum Sum Path in a Binary Tree Problem Statement

    You are provided with a binary tree consisting of N nodes where each node has an integer value. The task is to determine the maximum sum achievable by a...

  • Ans. 

    Find the maximum sum achievable by a simple path between any two nodes in a binary tree.

    • Traverse the binary tree to find all possible paths and calculate their sums.

    • Keep track of the maximum sum encountered during traversal.

    • Consider paths that may include the same node twice.

    • Implement a recursive function to explore all possible paths.

    • Handle cases where nodes have negative values.

  • Answered by AI
  • Q2. 

    Intersection of Two Arrays Problem Statement

    Given two arrays A and B with sizes N and M respectively, both sorted in non-decreasing order, determine their intersection.

    The intersection of two arrays in...

  • Ans. 

    The problem involves finding the intersection of two sorted arrays efficiently.

    • Use two pointers to iterate through both arrays simultaneously.

    • Compare elements at the pointers and move the pointers accordingly.

    • Handle cases where elements are equal, and update the intersection array.

    • Return the intersection array as the result.

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

This round had 2 questions of DS/Algo to solve under 50 minutes and one question related to Operating Systems.

  • Q1. 

    Next Greater Element Problem Statement

    You are provided with an array or list ARR containing N positive integers. Your task is to determine the Next Greater Element (NGE) for each element in the array.

    T...

  • Ans. 

    Find the Next Greater Element for each element in an array.

    • Iterate through the array from right to left

    • Use a stack to keep track of elements with no greater element to the right

    • Pop elements from the stack until finding a greater element or stack is empty

  • Answered by AI
  • Q2. 

    Number In Arithmetic Progression Problem

    Given three integers X, C, and Y, where X is the first term of an arithmetic sequence with a common difference of C, determine if Y is part of this arithmetic sequ...

  • Ans. 

    Check if a given number is part of an arithmetic sequence with a given first term and common difference.

    • Calculate the arithmetic sequence using the formula: nth term = X + (n-1) * C

    • Check if Y is equal to any term in the sequence to determine if it belongs to the sequence

    • Return 'True' if Y belongs to the sequence, otherwise return 'False'

  • Answered by AI
  • Q3. Can you define process and threads in operating systems?
  • Ans. 

    Processes are instances of programs in execution, while threads are smaller units within a process that can execute independently.

    • A process is a program in execution, consisting of code, data, and resources.

    • Threads are smaller units within a process that can execute independently.

    • Processes have their own memory space, while threads share the same memory space within a process.

    • Processes are heavyweight, while threads ar...

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

This round had 2 questions of DSA of Easy-Medium difficulty and at the end I was asked a Puzzle to check my general problem solving ability.

  • Q1. 

    Max Product Subset Problem Statement

    Given an array/list arr of size n, determine the maximum product possible by taking any subset of the array/list arr. Return the result modulo 10^9+7 since the product ...

  • Ans. 

    Find the maximum product of a subset of an array modulo 10^9+7.

    • Iterate through the array and keep track of the maximum positive product and minimum negative product encountered so far.

    • Handle cases where the array contains zeros separately.

    • Return the maximum product modulo 10^9+7.

  • Answered by AI
  • Q2. 

    Populating Next Right Pointers in Each Node

    Given a complete binary tree with 'N' nodes, your task is to determine the 'next' node immediately to the right in level order for each node in the given tree.

    ...
  • Ans. 

    Implement a function to update 'next' pointers in a complete binary tree.

    • Iterate level by level using a queue

    • Connect nodes at each level using 'next' pointers

    • Handle null nodes appropriately

    • Ensure the tree is a complete binary tree

  • Answered by AI
  • Q3. You have two wires of different lengths that are both capable of burning for exactly one hour when ignited at both ends. How can you measure a time interval of 45 minutes using these two wires?
Round 4 - Face to Face 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Medium

This round consisted of 2 questions from DSA where I was first asked to explain my approach to the interviewer with proper complexity analysis and then code the problems. The interviewer was quite friendly and also provided me some hints when I was stuck.

  • Q1. 

    Stack with getMin Operation

    Create a stack data structure that supports not only the usual push and pop operations but also getMin(), which retrieves the minimum element, all in O(1) time complexity witho...

  • Ans. 

    Implement a stack with push, pop, top, isEmpty, and getMin operations in O(1) time complexity without using extra space.

    • Use two stacks - one to store the actual elements and another to store the minimum element at each level.

    • When pushing an element, check if it is smaller than the current minimum and update the minimum stack accordingly.

    • When popping an element, also pop from the minimum stack if the popped element is t...

  • Answered by AI
  • Q2. 

    Split Array Into Maximum Subarrays Problem Statement

    You are given an integer array arr of size N. Your task is to split the array into the maximum number of subarrays such that the first and last occurre...

  • Ans. 

    Given an array, split it into maximum subarrays with first and last occurrence of each element in a single subarray.

    • Iterate through the array and keep track of the first and last occurrence of each element.

    • Use a hashmap to store the indices of each element.

    • Split the array whenever the last occurrence of an element is found.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAAdobe interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 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

Interview Questionnaire 

10 Questions

  • Q1. They started with something I did not even think of, Images fundamentals. Making images blurry, making them shaggy
  • Q2. Operating on images in parallel
  • Ans. 

    Operating on images in parallel involves dividing the image into smaller parts and processing them simultaneously.

    • Divide the image into smaller parts using techniques like tiling or splitting

    • Use parallel processing techniques like multi-threading or GPU acceleration

    • Combine the processed parts to form the final image

    • Examples: image segmentation, object detection, image enhancement

  • Answered by AI
  • Q3. Hardware engines support for parallelism
  • Ans. 

    Hardware engines support parallelism through multiple cores and threads.

    • Hardware engines can have multiple cores and threads to execute tasks simultaneously.

    • Parallelism can improve performance and efficiency in hardware-based tasks.

    • Examples include GPUs, FPGAs, and ASICs that have parallel processing capabilities.

    • Hardware parallelism can also be achieved through distributed computing and clustering.

    • Programming language...

  • Answered by AI
  • Q4. OS support for parallelism
  • Ans. 

    Modern OSes support parallelism through multi-core processors and threading.

    • Modern OSes like Windows, macOS, and Linux support parallelism through multi-core processors and threading.

    • Parallelism can be achieved through processes or threads.

    • Parallelism can improve performance and efficiency of software.

    • Examples of parallel programming frameworks include OpenMP and MPI.

  • Answered by AI
  • Q5. Recursion, heap and stack management
  • Q6. Memory protection in OS?
  • Ans. 

    Memory protection is a feature of an operating system that prevents unauthorized access to memory locations.

    • Memory protection is achieved through the use of memory management units (MMUs) and virtual memory.

    • MMUs map virtual addresses to physical addresses and enforce access permissions.

    • Virtual memory allows the OS to allocate memory to processes in a way that isolates them from each other.

    • Examples of memory protection ...

  • Answered by AI
  • Q7. Interviewer asked my laptop’s configuration and then asked some hardware questions about it
  • Q8. You have a lot of small integers in an array. You have to multiply all of them. You need not worry about overflow and range, you have enough support for that. What can you do to speed up the multiplication...
  • Ans. 

    To speed up multiplication of small integers in an array, we can use bitwise operations and parallel processing.

    • Use bitwise operations like shifting and ANDing to perform multiplication faster.

    • Divide the array into smaller chunks and perform multiplication in parallel using multi-threading or SIMD instructions.

    • Use lookup tables for frequently used values to avoid repeated calculations.

    • Use compiler optimizations like lo...

  • Answered by AI
  • Q9. Design a data structure for excel spreadsheet?
  • Ans. 

    Design a data structure for excel spreadsheet

    • Use a 2D array to store cell values

    • Implement formulas using a stack

    • Include formatting options for cells

  • Answered by AI
  • Q10. Tower of hanoi?

Interview Preparation Tips

Round: Technical Interview
Experience: Some other fundamentals Adobe people were amazingly helpful about computer architecture because I had written it in CV.

Round: Technical Interview
Experience: They started with OS and other subjects of their requirements such as data structures.

Round: Technical Interview
Experience: It was the best one. coding questions and algorithmic thinking was checked. Project work was also discussed.

Skills: Data Structure, Algorithm, OS
College Name: MNIT Jaipur

Skills evaluated in this interview

TIBCO Software Interview FAQs

How many rounds are there in TIBCO Software Software Developer interview?
TIBCO Software interview process usually has 2-3 rounds. The most common rounds in the TIBCO Software interview process are Technical, Aptitude Test and HR.
What are the top questions asked in TIBCO Software Software Developer interview?

Some of the top questions asked at the TIBCO Software Software Developer interview -

  1. Explain migration of tibco from bw 5 t...read more
  2. Explain about saop, EMS Tibco Migrat...read more
  3. Explain saop serices in tibco BW 5 ...read more

Tell us how to improve this page.

TIBCO Software Software Developer Interview Process

based on 1 interview

Interview experience

4
  
Good
View more
TIBCO Software Software Developer Salary
based on 26 salaries
₹3.8 L/yr - ₹15 L/yr
18% more than the average Software Developer Salary in India
View more details

TIBCO Software Software Developer Reviews and Ratings

based on 2 reviews

4.0/5

Rating in categories

3.1

Skill development

4.1

Work-life balance

3.0

Salary

4.0

Job security

3.1

Company culture

3.0

Promotions

3.0

Work satisfaction

Explore 2 Reviews and Ratings
Softwaretest Engineer
246 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate Consultant
175 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Consultant
166 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Member Technical Staff
154 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Quality Analyst
112 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare TIBCO Software with

Informatica

3.5
Compare

Mulesoft

4.6
Compare

SAP

4.2
Compare

IBM

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