Infotech Associate Software Engineer Interview Questions and Answers

Quicksort is a sorting algorithm that uses divide and conquer approach to sort an array.

• It selects a pivot element and partitions the array around the pivot.

• It recursively sorts the sub-arrays created by partitioning.

• It has an average time complexity of O(nlogn) and worst case time complexity of O(n^2).

Abstraction can be achieved by hiding unnecessary details and only exposing essential features.

• Identify the essential features of the system

• Hide unnecessary details by encapsulating them

• Use interfaces to define essential features

• Implement the interfaces to provide functionality

• Example: A car's interface is the steering wheel, pedals, and dashboard. The engine and transmission are encapsulated.

• Example: A software interf...read more

Recursion is a programming technique where a function calls itself to solve a problem.

• Recursion involves a base case and a recursive case

• Recursion can be used to solve problems like factorial, Fibonacci sequence, and binary search

• Recursion can be less efficient than iterative solutions for some problems

A string can be both mutable and immutable depending on the programming language.

• In languages like Java and Python, strings are immutable.

• In languages like C++ and C#, strings are mutable.

• Immutable strings cannot be modified once created, while mutable strings can be modified.

• Example of immutable string: 'hello world'.replace('o', '0') returns 'hell0 w0rld'.

• Example of mutable string: string s = 'hello'; s[0] = 'j'; s n

OOPS is a programming paradigm based on the concept of objects.

• OOPS stands for Object-Oriented Programming System

• It focuses on creating objects that contain both data and functions

• Encapsulation, Inheritance, and Polymorphism are the three main pillars of OOPS

• Example: A car is an object that has properties like color, model, and functions like start, stop, and accelerate