Ciena SDE (Software Development Engineer) Interview Questions and Answers

90 Mins on amcat global platform, 2 Easy level questions on Array and two pointers

Q1. Print all the Elements not present in a sorted array and tell the time and space complexity of the algorithm.
Ans. 
Print all elements not present in a sorted array with time and space complexity.
• Iterate through array and print missing elements

• Use binary search for faster search

• Time complexity: O(n log n)

• Space complexity: O(1)
Answered by AI
Add your answer
Q2. Print all the elements not present in an unsorted array and tell the time and space complexity of the algorithm.
Ans. 
Print all elements not present in an unsorted array and give time and space complexity.
• Iterate through array and use a hashset to keep track of seen elements.

• Print elements not in hashset.

• Time complexity: O(n), Space complexity: O(n)
Answered by AI
Add your answer

Q1. Tell me about yourself, your college , family, hobbies and projects
Add your answer
Q2. Why do you want to join this company?
Add your answer

Test is proctored and 3 questions were asked out of which 1 is from language other is from data structures and the last one is from sql

Q1. What is a database and explain it
Ans. 
A database is a collection of organized data that can be easily accessed, managed, and updated.
• A database stores data in tables with rows and columns

• It allows for efficient data retrieval and manipulation

• Examples include MySQL, Oracle, and MongoDB
Answered by AI
Add your answer
Q2. What are the projects you have done
Add your answer

Q1. Basic Concept of OOPs, Java, Spring Boot, MySQL.
Add your answer
Q2. Find the kth smallest value in an unsorted array
Ans. 
Find the kth smallest value in an unsorted array
• Sort the array and return the kth element

• Use quickselect algorithm to find the kth smallest element in O(n) time

• Build a min heap of size k and traverse the array to find the kth smallest element
Answered by AI
Add your answer
Q3. Merge Sort Algorithm Implementation
Ans. 
Merge Sort is a divide and conquer algorithm that divides an array into two halves, sorts them and then merges them.
• Divide the array into two halves recursively

• Sort each half recursively using merge sort

• Merge the two sorted halves

• Time complexity is O(nlogn)

• Space complexity is O(n)
Answered by AI
Add your answer

Q1. Detailed discussion on the project I have worked on.
Add your answer
Q2. What is a Load Balancer?
Ans. 
A Load Balancer distributes incoming network traffic across multiple servers to improve performance and availability.
• It helps to avoid overloading a single server

• It improves responsiveness and availability of applications

• It can be hardware or software-based

• Examples include Amazon ELB, F5 BIG-IP, and NGINX

• It can also perform health checks on servers and route traffic accordingly
Answered by AI
Add your answer
Q3. Difference between Spring MVC and Spring Boot
Ans. 
Spring MVC is a framework for building web applications, while Spring Boot is an opinionated framework for building standalone applications.
• Spring MVC requires more configuration and setup compared to Spring Boot

• Spring Boot provides a pre-configured environment with sensible defaults

• Spring Boot includes an embedded server, making it easier to deploy standalone applications

• Spring MVC is more suitable for building tradit...read more
Answered by AI
Add your answer
Q4. Difference between SQL and NoSQL
Ans. 
SQL is a relational database management system while NoSQL is a non-relational database management system.
• SQL databases are structured and use tables with predefined schema while NoSQL databases are unstructured and use collections or documents.

• SQL databases use SQL (Structured Query Language) for querying and managing data while NoSQL databases use various query languages like MongoDB's query language.

• SQL databases ar...read more
Answered by AI
Add your answer
Q5. Find the equilibrium index where the sum of all the values before the equilibrium index is equal to the sum of all the values after the equilibrium index.
Ans. 
Find the equilibrium index where the sum of all values before it is equal to the sum of all values after it.
• Iterate through the array and calculate the total sum.

• Then iterate again and keep track of the left sum and right sum.

• If they are equal at any index, return that index as the equilibrium index.
Answered by AI
Add your answer

Very Very easy coding questions with a lot of time. Basic DSA knowledge could have cracked it easily. The only problem that too not for me but for some my friends was their own test portal which was quite buggy.

Q1. Given a sorted array arr, integer start and end. Find all the elements that are in the range of start and end and are missing in the array.
Ans. 
Find missing elements in a sorted array within a given range.
• Loop through the array and check if each element is within the given range.

• If an element is outside the range, add all the missing elements within the range to a list.

• Return the list of missing elements.
Answered by AI
Add your answer
Q2. What projects have you done?
Add your answer

Q1. Introduce yourself including your family background, education background, technical skills, interest and hobbies.
Add your answer
Q2. What do you know about Jio?
Add your answer