Associate Software Development Engineer
Associate Software Development Engineer Interview Questions and Answers

Asked in S&P Global

Q. Given a binary array, move all 0s to the left and all 1s to the right in O(1) time and space complexity.
Rearrange a binary array to move all 0s to the left and 1s to the right using a two-pointer approach.
Use two pointers: one starting from the left (i) and one from the right (j).
Iterate through the array until i is less than j.
If arr[i] is 0, increment i. If arr[j] is 1, decrement j.
If arr[i] is 1 and arr[j] is 0, swap them and adjust both pointers.
Continue until all elements are sorted.

Asked in S&P Global

Q. Given an array with repeated elements, such as arr=[2,1,2,3,4,3,4,4], remove the repeated elements and print the result without changing the original relative order. For input = [2,1,2,3,4,3,4,4], the expected...
read moreRemove duplicates from an array while maintaining the original order of elements.
Use a set to track seen elements and a list to store the result.
Iterate through the array, adding elements to the result if they haven't been seen.
Example: For arr=[2,1,2,3,4,3,4,4], the output will be [2,1,3,4].
This approach ensures O(n) time complexity, where n is the length of the array.
Associate Software Development Engineer Interview Questions and Answers for Freshers

Asked in Publicis Sapient

Q. What is OS, explain threading, explain paging, database transactions - acid properties, 2-3 questions related to computer networks
Explanation of OS, threading, paging, database transactions (ACID properties), and computer networks.
OS (Operating System) is a software that manages computer hardware resources and provides services for computer programs.
Threading involves the ability of a program to execute multiple parts concurrently.
Paging is a memory management scheme that eliminates the need for contiguous allocation of physical memory.
Database transactions follow ACID properties - Atomicity, Consistenc...read more

Asked in Craft Silicon

Q. Have you worked on .NET Core?
Yes, I have worked on dot net core.
I have experience developing applications using .NET Core framework.
I have worked on projects involving ASP.NET Core for web development.
I am familiar with the features and capabilities of .NET Core for cross-platform development.

Asked in Publicis Sapient

Q. Describe your experience based on your resume and your knowledge of sorting algorithms, including writing code for them.
The interview focused on sorting algorithms and required coding solutions based on the candidate's resume.
Sorting algorithms include Bubble Sort, Quick Sort, and Merge Sort.
Bubble Sort: Simple but inefficient for large datasets; O(n^2) time complexity.
Quick Sort: Efficient for large datasets; average time complexity O(n log n).
Merge Sort: Stable and efficient; divides the array into halves and merges them back; O(n log n) time complexity.
Example: Sorting an array of integers ...read more

Asked in Craft Silicon

Q. Are you comfortable with this pay band?
I am open to discussing the payband and negotiating if needed.
Express willingness to discuss payband
Be open to negotiation if necessary
Provide examples of how your skills and experience align with the payband
Associate Software Development Engineer Jobs




Asked in TCS

Q. What is object-oriented programming?
Object oriented programming is a programming paradigm based on the concept of objects, which can contain data and code.
Objects: Instances of classes that encapsulate data and behavior
Classes: Blueprints for creating objects with shared attributes and methods
Inheritance: Ability for classes to inherit attributes and methods from other classes
Polymorphism: Ability for objects to take on multiple forms or behaviors
Encapsulation: Hiding the internal state of an object and requiri...read more

Asked in Knowledgeworks Global

Q. What is a schema?
Schema is a structure that represents the organization of data in a database.
Schema defines the tables, fields, relationships, and constraints in a database.
It ensures data integrity and consistency by enforcing rules on the data.
Examples of schema elements include tables, columns, primary keys, foreign keys, and indexes.
Share interview questions and help millions of jobseekers 🌟

Asked in ZS

Q. Write a few SQL queries.
SQL queries for various scenarios
Retrieve all records from a table: SELECT * FROM table_name;
Filter records based on a condition: SELECT * FROM table_name WHERE condition;
Join two tables: SELECT * FROM table1 JOIN table2 ON table1.id = table2.id;
Aggregate data using GROUP BY: SELECT column_name, COUNT(*) FROM table_name GROUP BY column_name;

Asked in Cogoport

Q. Merge sort algorithm
Merge sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.
Divide the array into two halves
Sort each half recursively
Merge the two sorted halves
Time complexity is O(nlogn)
Space complexity is O(n)
Interview Questions of Similar Designations
Interview Experiences of Popular Companies








Reviews
Interviews
Salaries
Users

