Infibeam Interview Questions and Answers

My day was productive and fulfilling. As for myself, I am a driven and detail-oriented individual with a passion for problem-solving.

• I tackled several challenging tasks at work and made significant progress on each of them.

• I also took some time to exercise and clear my mind, which helped me stay focused throughout the day.

• As for myself, I have a background in engineering and enjoy using my analytical skills to find cre...read more

Optimizing code involves identifying and removing bottlenecks to improve performance.

• Identify the parts of the code that are taking the most time to execute

• Use efficient algorithms and data structures

• Minimize the number of function calls and loops

• Avoid unnecessary calculations or operations

• Use caching or memoization to avoid repeating calculations

• Profile the code to measure performance improvements

Optimized version of given code

• Use efficient data structures and algorithms

• Avoid unnecessary loops and conditions

• Minimize function calls and variable assignments

My day was productive and fulfilling. As for myself, I am a driven and detail-oriented individual with a passion for problem-solving.

• I tackled several challenging tasks at work and made significant progress on each of them.

• I also took some time to exercise and clear my mind, which helped me stay focused throughout the day.

• As for myself, I have a background in engineering and enjoy applying my analytical skills to a var...read more

Yes, I prefer coding in C and have read The C Programming Language book. I have also explored the concept of Inheritance in C.

• I find C to be a powerful and efficient language for system programming.

• Yes, I have read The C Programming Language book by Dennis Retchie and found it to be a great resource.

• Recently, I have been exploring the concept of Inheritance in C through various online resources and tutorials.

• While C do...read more

Inheritance allows a class to inherit properties and methods from another class.

• Inheritance promotes code reusability and saves time and effort in programming.

• It allows for the creation of a hierarchy of classes with shared characteristics.

• For example, a class Animal can be inherited by classes such as Dog, Cat, and Bird, which share common properties and methods.

• Inheritance can be implemented using the 'extends' keywo...read more

Liskov substitution principle is a principle in object-oriented programming that states that objects of a superclass should be able to be replaced with objects of its subclasses without affecting the correctness of the program.

• Subtypes must be substitutable for their base types

• Derived classes must not change the behavior of the base class

• Violating the principle can lead to unexpected behavior and errors

• Example: A squar...read more

Explanation of OOPs concepts with programs

• Encapsulation: Wrapping data and functions into a single unit. Example: Class in Java

• Abstraction: Hiding implementation details and showing only necessary information. Example: Abstract class in C#

• Inheritance: Acquiring properties and behavior of a parent class. Example: Child class extending parent class in Python

• Polymorphism: Ability of an object to take many forms. Example: ...read more

Dynamic polymorphism is achieved through virtual functions and inheritance in object-oriented programming.

• Create a base class with virtual functions

• Create derived classes that override the virtual functions

• Use pointers or references of the base class to call the virtual functions

• The appropriate derived class function will be called based on the object being pointed to or referred to

Global variables can lead to unexpected changes and make debugging difficult.

• Global variables can be accessed and modified from any part of the code, making it difficult to track changes.

• They can cause naming conflicts if multiple variables with the same name are used in different parts of the code.

• Using global variables can make it harder to test and debug code, as it can be difficult to isolate the cause of errors.

• Th...read more

Using 'goto' can make code hard to read, maintain and debug.

• Goto statements can create spaghetti code that is difficult to follow.

• It can make it harder to understand the flow of the program.

• It can also make debugging more difficult.

• There are usually better alternatives to using goto, such as using loops or functions.

• Some programming languages, such as Java and Python, do not even have a goto statement.

• Using goto can al...read more

My favorite subject is history because it helps me understand the present and learn from the past.

• I enjoy learning about different cultures and how they have evolved over time

• I find it fascinating to study the causes and effects of major historical events

• One of my favorite books on history is 'Guns, Germs, and Steel' by Jared Diamond

Modularity enhances code maintainability and reusability by breaking it into smaller, manageable components.

• Use functions to encapsulate repetitive tasks. Example: A function to calculate the average of a list.

• Implement classes for related data and behaviors. Example: A 'Student' class with attributes like name and grades.

• Organize code into modules or packages. Example: Separate files for data processing, visualization...read more

DRY stands for 'Don't Repeat Yourself', a principle aimed at reducing code duplication in software development.

• Promotes code reusability, making maintenance easier.

• Example: Instead of repeating a function, define it once and call it multiple times.

• Encourages modular design, leading to cleaner and more understandable code.

• Helps prevent bugs by reducing the number of places where changes need to be made.

Implicit objects are pre-defined objects in JSP that can be accessed without being explicitly declared.

• Implicit objects are created by the JSP container during the translation phase.

• They can be accessed using predefined names such as request, response, session, application, out, pageContext, config, and exception.

• For example, the request object can be used to retrieve parameters from a form or URL.

• The session object ca...read more

Apache is a popular web server and Tomcat is a widely used application server.

• Apache is an open-source web server that supports multiple operating systems and is known for its stability and security.

• Tomcat is a Java-based application server that is used to deploy Java web applications and supports servlets and JSPs.

• Other popular web servers include Nginx and Microsoft IIS.

• Other popular application servers include JBoss...read more

To deploy a web application on Apache Tomcat, the application needs to be packaged as a WAR file and then deployed to the Tomcat server.

• Create a WAR file of the web application

• Copy the WAR file to the Tomcat webapps directory

• Start the Tomcat server

• Access the web application using the URL http://localhost:8080/

• Collections in Java are classes that implement collections of objects, such as lists, sets, and ...read more

Analyzing the time complexity of printing binary tree elements in spiral order involves understanding tree traversal methods.

• Spiral order traversal alternates between left-to-right and right-to-left at each level.

• Using two stacks can help manage the alternating order efficiently.

• For a binary tree with 'n' nodes, each node is visited once, leading to O(n) time complexity.

• Example: For a tree with nodes 1, 2, 3, 4, 5, the...read more

A program to swap two pointers.

• Declare two pointers of the same data type

• Assign the first pointer to a temporary variable

• Assign the second pointer to the first pointer

• Assign the temporary variable to the second pointer

Dijkstra's algorithm finds shortest path between nodes in a graph

• Create a graph with nodes and edges

• Initialize distances from source node to all other nodes as infinity

• Set distance from source node to itself as 0

• Create a set of unvisited nodes

• While unvisited set is not empty, select node with minimum distance

• For each neighbor of selected node, calculate distance from source node

• If calculated distance is less than curre...read more

Floyd-Warshall's algorithm is used to find the shortest path between all pairs of vertices in a weighted graph.

• Create a 2D array to store the distances between all pairs of vertices.

• Initialize the array with the weights of the edges in the graph.

• Use nested loops to iterate over all pairs of vertices and update the distances if a shorter path is found through a third vertex.

• The final array will contain the shortest dist...read more

Program to print matrix elements in spiral order recursively

• Create a recursive function to print the elements in spiral order

• Define the boundaries of the matrix and traverse the matrix in spiral order

• Call the recursive function to print the elements in spiral order

• Handle edge cases such as empty matrix or matrix with only one row/column

Find two numbers in an unsorted array that add up to a given sum in O(n)

• Use a hash table to store the difference between the sum and each element in the array

• Iterate through the array and check if the current element is in the hash table

• If it is, return the current element and the corresponding difference

• If not, add the current element to the hash table

Indexing is a technique used in DBMS to improve the performance of queries.

• Indexing creates a separate data structure that allows faster retrieval of data.

• It works by creating a pointer to the location of data in the table.

• Indexes can be created on one or more columns of a table.

• Types of indexing include B-tree, hash, and bitmap indexing.

• Indexes can also be clustered or non-clustered.

• Clustered indexes determine the phy...read more

B and B+ trees are data structures used for efficient searching and sorting of large datasets.

• B trees are balanced trees used for disk-based storage systems.

• B+ trees are similar to B trees but have all data stored in the leaf nodes for faster searching.

• B trees have a variable number of keys per node, while B+ trees have a fixed number.

• B trees have a higher fanout than B+ trees, making them more efficient for smaller da...read more

Check if a binary tree has a root-to-leaf path with a specified sum.

• Use Depth-First Search (DFS) to traverse the tree.

• At each node, subtract the node's value from the target sum.

• If a leaf node is reached, check if the remaining sum is zero.

• Example: For a tree with root 5, left child 4, right child 8, and sum 9, the path 5 -> 4 is valid.

Program to find lowest common ancestor of two nodes in binary search tree and binary tree with brute force approach.

• For binary search tree, traverse from root to both nodes and store the path. Then compare paths to find LCA.

• For binary tree, traverse from root to both nodes and store the path. Then compare paths to find LCA.

• Brute force approach involves checking each node's descendants to see if they contain both nodes.

• ...read more

Program to print all ancestors of a node in a binary tree

• Create a recursive function to traverse the binary tree

• Check if the current node is the target node

• If yes, print all the nodes in the call stack

• If not, recursively call the function for left and right subtrees