i
Seclore
Filter interviews by
I applied via Naukri.com and was interviewed in Oct 2024. There was 1 interview round.
The maximum number of EBS volumes that can be attached to a single EC2 instance is 40.
Maximum of 40 EBS volumes can be attached to a single EC2 instance
Each EBS volume can be up to 16 TiB in size
EBS volumes can be attached and detached while the instance is running
Prerequisites for S3 Cross Region Replication include enabling versioning, configuring IAM roles, and ensuring proper bucket policies.
Enable versioning on both source and destination buckets
Configure IAM roles with proper permissions for replication
Ensure proper bucket policies are in place for cross region replication
Docker Restart changes the container's attributes like IP address, hostname, and uptime.
IP address of the container will change after restart
Hostname of the container may change
Uptime of the container will be reset
Any changes made to the container's filesystem will be lost
S3 is ideal for storing static files like images and videos, while EFS is better for shared file storage among multiple EC2 instances.
S3 is object storage, suitable for storing large amounts of unstructured data like images, videos, backups, and logs.
EFS is a file storage service that can be mounted on multiple EC2 instances, making it ideal for shared file systems and databases.
Use S3 for static website hosting, data ...
Top trending discussions
I applied via Job Portal and was interviewed in Apr 2021. There was 1 interview round.
I applied via Naukri.com and was interviewed in Jul 2020. There were 4 interview rounds.
Flip-flops and latches are sequential logic circuits used to store and manipulate binary data.
Flip-flops are edge-triggered devices, while latches are level-sensitive devices.
Flip-flops have separate clock and data inputs, while latches have a single input for both clock and data.
Flip-flops are used in synchronous circuits, while latches are used in asynchronous circuits.
Flip-flops are more complex and require more cir...
Written test was in python where we have output based questions
Move all zeros in an array of strings to the end.
Iterate through the array and move all zeros to the end by swapping with non-zero elements.
Maintain a pointer to keep track of the position to swap with zeros.
Example: Input: ['a', 'b', 'c', '0', 'd', '0'], Output: ['a', 'b', 'c', 'd', '0', '0']
I applied via Approached by Company and was interviewed before Nov 2023. There were 3 interview rounds.
DSA covering graph and linked list hard problems
I have 3 years of experience working with Scala in developing backend applications.
Developed RESTful APIs using Scala Play framework
Utilized Akka for building highly concurrent and distributed systems
Worked on data processing tasks using Apache Spark with Scala
Extensive experience with Java programming language
Proficient in Java programming for over 5 years
Developed multiple applications using Java, including web applications and desktop applications
Strong understanding of object-oriented programming concepts in Java
Experience with Java frameworks such as Spring and Hibernate
Familiar with Java development tools like Eclipse and IntelliJ IDEA
Airflow is an open-source platform to programmatically author, schedule, and monitor workflows.
Airflow is used for orchestrating complex workflows in data pipelines.
It allows users to define workflows as Directed Acyclic Graphs (DAGs).
Airflow provides a web-based UI for monitoring and managing workflows.
It supports various integrations with different systems and tools.
Example: Using Airflow to schedule ETL jobs for dat
posted on 25 Aug 2022
I applied via Campus Placement and was interviewed before Aug 2021. There were 4 interview rounds.
Duration: 1hr
Topics: Array, LinkedList,Stack
Code for insertion in a binary tree
Create a new node with the given data
If the tree is empty, make the new node as root
Else, traverse the tree to find the appropriate position to insert the new node
If the data is less than the current node, go to the left subtree
If the data is greater than the current node, go to the right subtree
Repeat until an appropriate position is found
Set the new node as the child of the appropri
Quick sort is a divide-and-conquer algorithm that sorts an array by partitioning it into two sub-arrays.
Choose a pivot element from the array
Partition the array around the pivot element
Recursively apply quick sort to the left and right sub-arrays
Combine the sorted sub-arrays to get the final sorted array
posted on 5 Oct 2023
I applied via Referral and was interviewed before Oct 2022. There were 3 interview rounds.
Simple coding questions in your preferred language
posted on 17 Feb 2024
I applied via Naukri.com and was interviewed before Feb 2023. There were 2 interview rounds.
posted on 25 Oct 2024
I appeared for an interview before Oct 2023.
It was easy round with 2 questions from hacker rank
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Product Engineer
48
salaries
| ₹7 L/yr - ₹19 L/yr |
Senior Product Engineer
16
salaries
| ₹14.5 L/yr - ₹30 L/yr |
Application Support Engineer
12
salaries
| ₹6 L/yr - ₹13.5 L/yr |
Senior Quality Engineer
12
salaries
| ₹7 L/yr - ₹18 L/yr |
Quality Engineer
11
salaries
| ₹5 L/yr - ₹7.5 L/yr |
Fractal Analytics
Subex
Zeta
Hughes Systique Corporation