Unisys Interview Questions and Answers

I am a highly motivated individual with a passion for learning and problem-solving.

• I have a degree in computer science and have worked as a software engineer for 3 years.

• I am proficient in programming languages such as Java, Python, and C++.

• I enjoy working in a team and collaborating with others to achieve common goals.

• In my free time, I like to read books on technology and watch documentaries on science and history.

Stack is LIFO and Queue is FIFO data structure. Stack is like a stack of plates and Queue is like a queue of people.

• Stack is Last In First Out (LIFO) and Queue is First In First Out (FIFO)

• Stack is like a stack of plates where the last plate added is the first one to be removed

• Queue is like a queue of people where the first person to enter is the first one to leave

• Stack is used in undo-redo functionality in text editors

• ...read more

It depends on the use case. QuickSort is generally the fastest, but MergeSort is more stable and efficient for larger datasets.

• QuickSort is generally the fastest sorting algorithm, but can be unstable for certain datasets.

• MergeSort is more stable and efficient for larger datasets, but can be slower than QuickSort for smaller datasets.

• InsertionSort is efficient for small datasets, but can be slow for larger datasets.

• Hea...read more

Semaphore and mutex are synchronization mechanisms used in multi-threaded environments.

• Semaphore allows multiple threads to access a shared resource simultaneously, while mutex allows only one thread at a time.

• Semaphore is used to control access to a pool of resources, while mutex is used to protect a single resource.

• Semaphore uses a counter to keep track of the number of available resources, while mutex uses a lock to...read more

Find the repeating number in an array.

• Iterate through the array and store each element in a hash table or set.

• If an element is already present in the hash table, it is a repeating number.

• Alternatively, sort the array and check for adjacent elements with the same value.

• Time complexity: O(n) or O(nlogn) depending on the approach used.

Paging and segmentation are memory management techniques used by operating systems.

• Paging divides memory into fixed-size pages and stores data in these pages.

• Segmentation divides memory into logical segments and stores data in these segments.

• Paging is simpler and more efficient, but can lead to external fragmentation.

• Segmentation is more flexible, but can lead to internal fragmentation.

• Both techniques are used to manag...read more

Developed a smart irrigation system using IoT

• Used Arduino and Raspberry Pi to collect data on soil moisture, temperature, and humidity

• Developed a web application to display real-time data and control the irrigation system remotely

• Implemented machine learning algorithms to predict optimal watering times based on weather forecasts

• Reduced water usage by 30% and increased crop yield by 20%

• Presented the project at a nationa...read more