i
Seclore
Filter interviews by
Object-oriented programming is a programming paradigm based on the concept of objects, which can contain data and code.
Objects are instances of classes, which define the structure and behavior of the objects.
Encapsulation, inheritance, and polymorphism are key principles of OOP.
Example: In Java, a class 'Car' can have attributes like 'color' and 'model', and methods like 'drive' and 'stop'.
Default method in Java is a method defined in an interface with a default implementation.
Introduced in Java 8 to allow adding new methods to interfaces without breaking existing implementations
Default methods are declared with the 'default' keyword
They can be overridden in implementing classes if needed
I applied via Company Website and was interviewed before Jun 2023. There was 1 interview round.
Joins in SQL are used to combine rows from two or more tables based on a related column between them.
Joins are used to retrieve data from multiple tables based on a related column between them
Types of joins include INNER JOIN, LEFT JOIN, RIGHT JOIN, and FULL JOIN
INNER JOIN returns rows when there is at least one match in both tables
LEFT JOIN returns all rows from the left table and the matched rows from the right table
...
Objects are instances of classes in OOPs. Classes are blueprints for creating objects with attributes and methods.
Objects are instances of classes
Classes are blueprints for creating objects
Classes define attributes and methods for objects
Example: Class 'Car' with attributes like 'color' and methods like 'drive'
posted on 28 Feb 2025
What is javascripts, html and css
I applied via LinkedIn and was interviewed in May 2023. There were 3 interview rounds.
We will get a coding question which could be from Leetcode, If we are good at Leetcode we will easily make it, they are focusing on DP questions.
I applied via Campus Placement and was interviewed in Feb 2024. There were 4 interview rounds.
Percentage, logical reasoning
10 min and topics were chosen by ourselves
I applied via Campus Placement
Os,c,ds,aptitude(quants and logical)
posted on 30 Jul 2024
It was easy to crack.questions were quants and logical..amd some technical mcqs
Technical gd..questions were asked from cs fundamentals
Again a technical gd
I applied via Campus Placement and was interviewed in Sep 2024. There were 2 interview rounds.
OOPS , DBMS , OS , and DSA concepts
I applied via Campus Placement and was interviewed in Aug 2022. There were 5 interview rounds.
Apti round took place in online mode but it is not proctored
This one is technical GD and shortlisted people will be divided into batches and will asked technical qns for which ppl has to answer
People who got shortlisted will be having another technical GD and the same process will be continued
Paging is a memory management technique used by the operating system to store and retrieve data from secondary storage.
Paging divides the memory into fixed-size pages and stores them in secondary storage.
When a process needs a page, the operating system retrieves it from secondary storage and loads it into memory.
Paging allows for efficient use of memory and helps prevent fragmentation.
Examples of operating systems tha
Various searching methods include BFS, DFS, binary search, and linear search.
BFS (Breadth-First Search) explores all the vertices at the same level before moving to the next level.
DFS (Depth-First Search) explores as far as possible along each branch before backtracking.
Binary search is a divide and conquer algorithm that searches a sorted array by repeatedly dividing the search interval in half.
Linear search checks ea...
Quick sort works by selecting a pivot element and sorting the array by divide and conquer.
Select a pivot element from the array
Divide the array into two sub-arrays, one with elements smaller than the pivot and the other with elements greater than the pivot
Recursively apply the above steps to the sub-arrays
Combine the sorted sub-arrays to get the final sorted array
Max heap has the largest element at the root while Min heap has the smallest element at the root.
Max heap is a complete binary tree where the parent node is greater than or equal to its child nodes.
Min heap is a complete binary tree where the parent node is less than or equal to its child nodes.
Heaps are commonly used in sorting algorithms like Heap Sort and Priority Queues.
Insertion and deletion operations in heaps ta
Array duplicates and burn binary tree
based on 1 interview
Interview experience
Product Engineer
45
salaries
| ₹6 L/yr - ₹19 L/yr |
Senior Product Engineer
14
salaries
| ₹14.5 L/yr - ₹30 L/yr |
Senior Quality Engineer
12
salaries
| ₹7 L/yr - ₹18 L/yr |
Application Support Engineer
10
salaries
| ₹6 L/yr - ₹14 L/yr |
Software Developer
10
salaries
| ₹5 L/yr - ₹11.5 L/yr |
Fractal Analytics
Subex
Zeta
Hughes Systique Corporation