TIBCO Software OB Engineer Interview Questions and Answers

Q1. Explain OOPS concept and how you apply it in your implementation
Ans. 
OOPS is a programming paradigm based on the concept of objects, which can contain data in the form of fields and code in the form of procedures.
• OOPS focuses on the concept of classes and objects

• Encapsulation: bundling data and methods that operate on the data within a single unit

• Inheritance: allows a class to inherit properties and behavior from another class

• Polymorphism: ability to present the same interface for diffe...read more
Answered by AI
View 1 more answer
Q2. Difference between Comparable and Comparator. Difference between Abstract Class and Interface
Ans. 
Comparable is an interface used for natural ordering, Comparator is an interface used for custom ordering. Abstract class can have method implementations, Interface cannot.
• Comparable interface is used to define the natural ordering of objects. Example: String class implements Comparable interface for natural ordering based on alphabetical order.

• Comparator interface is used to define custom ordering of objects. Example:...read more
Answered by AI
View 1 more answer
Q3. Given a string. Find the number of occurrences of each character
Ans. 
Count occurrences of each character in a given string
• Create an array to store the count of each character

• Iterate through the string and increment the count of each character in the array

• Return the array with counts for each character
Answered by AI
Add your answer
Q4. Given an array. Remove the number of duplicates
Ans. 
Remove duplicates from an array of strings
• Iterate through the array and store each element in a set to keep track of unique values

• Create a new array with the unique values from the set
Answered by AI
Add your answer
Q5. Given a student object having name and grade data variables. Sort the object on the basis of highest grade.
Add your answer

Karat Interview for next filtering the candidate

Q1. Design Snake Game (Nokia based)
Ans. 
Design a classic Snake game based on Nokia phones.
• Use a 2D array to represent the game board.

• Implement logic for snake movement and growth.

• Include collision detection with walls and itself.

• Add food items for the snake to eat and grow.

• Display the game on a grid-based interface.
Answered by AI
Add your answer
Q2. Ballot based voter
Add your answer

The topic given to me is AI is good or bad

Q1. Program to find prime number
Ans. 
A program to find prime numbers in a given range.
• Iterate through numbers in the given range

• Check if each number is divisible by any number other than 1 and itself

• If not divisible, then the number is prime
Answered by AI
Add your answer
Q2. Program to find the duplicates
Ans. 
Program to find duplicates in an array of strings
• Iterate through the array and store each element in a hash set

• If an element is already in the hash set, it is a duplicate

• Return a list of all duplicates found
Answered by AI
Add your answer

Q1. Self introduction
Add your answer
Q2. Explanation of project code
Ans. 
The project code is a web application that allows users to create and share interactive quizzes.
• The code uses HTML, CSS, and JavaScript to create the front-end interface.

• It utilizes Node.js and Express for the back-end server.

• MongoDB is used as the database to store user-generated quizzes.

• Socket.io is used for real-time communication between users during quiz sessions.
Answered by AI
Add your answer

Q1. Problem solving question
Add your answer
Q2. Java , stream , Spring fundamentals
Add your answer

Q1. Some basic String array problem solving question
Add your answer
Q2. Java questions like junit , Spring boot
Add your answer

Q1. String questions , DSA problem
Add your answer
Q2. Java questions in brief
Add your answer

Based on os , linux , nutanix

Q1. Related to networking
Add your answer
Q2. What is dns , NET , Scenario based questions
Add your answer

Q1. Questions regarding DSA and java
Add your answer
Q2. Find if Linked list is circular
Ans. 
Check if a linked list is circular by using two pointers moving at different speeds.
• Initialize two pointers, slow and fast, both pointing to the head of the linked list.

• Move slow pointer by one node and fast pointer by two nodes in each iteration.

• If the fast pointer reaches the end of the list or meets the slow pointer, the list is circular.
Answered by AI
Add your answer

Q1. One more round on DSA on stack queues and trees
Add your answer

Logically and mathematical

Question related to QA