Filter interviews by
I applied via Naukri.com and was interviewed in Feb 2023. There were 2 interview rounds.
I am not currently planning on getting married.
I am currently focused on my career and personal growth.
Marriage is not a priority for me at this time.
I believe in taking the time to find the right person and building a strong foundation before getting married.
Yes, I know Java.
I have experience in Java programming.
I am familiar with Java syntax and concepts.
I have worked on Java projects in the past.
To retrieve data from the back end, you can use APIs or database queries.
Use API calls to fetch data from the back end server.
Execute database queries to retrieve data from the database.
Parse the response or query result to extract the required data.
Handle any necessary authentication or authorization for accessing the back end.
Examples: GET request to an API endpoint, SELECT query in SQL.
OOP is a programming paradigm based on the concept of objects, which can contain data and code.
OOP stands for Object-Oriented Programming
It focuses on creating objects that interact with each other to solve a problem
Encapsulation, inheritance, and polymorphism are key concepts in OOP
Example: A car object can have properties like color, make, and model, and methods like start and stop
OOP promotes code reusability and ma
I am a software engineer with experience in developing web applications and mobile apps.
I have a degree in Computer Science
I have worked with Java, Python, and JavaScript
I have experience with front-end frameworks like React and Angular
I have developed mobile apps using React Native
I am familiar with Agile methodologies
I have a passion for software development and enjoy the challenges it presents.
I have always been interested in technology and programming
I have taken courses and completed projects in software development
I enjoy problem-solving and finding efficient solutions
I believe software engineering is a constantly evolving field with endless opportunities for growth
A program to check if a given number is prime or not.
A prime number is a number that is only divisible by 1 and itself.
Start checking from 2 up to the square root of the number.
If the number is divisible by any number in the range, it is not prime.
Otherwise, it is prime.
Optimization: check only odd numbers after 2.
Fibonacci program generates a series of numbers where each number is the sum of the two preceding ones.
The program can be implemented using recursion or iteration.
The first two numbers in the series are always 0 and 1.
The next number is the sum of the previous two numbers.
Example: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418,...
Flowchart for two programs
Identify inputs and outputs
Determine program logic
Create decision points and loops
Connect program components
Include error handling
Test and debug
Document the flowchart
based on 3 reviews
Rating in categories
Information Technology Recruiter
6
salaries
| ₹1.9 L/yr - ₹2.8 L/yr |
HR Recruiter
3
salaries
| ₹2.4 L/yr - ₹2.9 L/yr |
TCS
Accenture
Wipro
Cognizant