We are given with the n number of processes i.e. P1, P2, P3, ..., Pn and their corresponding burst times. The task is to find the average waiting time and average turnaround time using FCFS CPU Scheduling algorithm.What is Waiting Time and Turnaround Time?Turnaround Time is the time interval between ... Read More

We are given a positive integer of digits and the task is to calculate the count of odd and even digits in a number using PL/SQL.PL/SQL is a combination of SQL along with the procedural features of programming languages. It was developed by Oracle Corporation in the early 90's to ... Read More

Dictionary in python is just like a map in C++ and Java. The Iike Map dictionary consists of two things: first is key and second is value. Dictionary is dynamic in nature. You can add more keys and values to the dictionary after creating the dictionary and also you can ... Read More

Monkey patching is the technique of dynamic modification of a piece of code at the run time. Actually by doing monkey patch we change the behavior of code but without affecting the original source code. History The monkey patch comes from the word guerrilla patch, guerrilla nearly means gorilla which ... Read More

Python is a very popular programming language among the Developers and very easy to understand. Its syntax is also very simple to understand, like JAVA and C. But this popular language has some problems and one of the major problems is that it takes so long to start. There can ... Read More

We are given the array, let's say arr[] of 2n integers. We have to make the pair group of the integer elements like(a1, b1), (a2, b2)....(an, bn) which makes the sum of min(ai, bi) for all elements in the array as large as possible. The task is to find the ... Read More

As you know Python is ranked in topmost used programming language. Python programming language is easy to learn and easy to use. If you know the basics of python you can develop some easy projects like the TIC TAC TOE game and also you can enroll in easy python coding ... Read More

We are given an integer array, a set of segment start and end pointers and a key value and the problem statement here is to find all the values in the given range which are smaller than or equal to the given key value.Let us understand with exampleInput − arr[] = ... Read More

We are given an unsorted integer array. The task is to sort the array using merge sort technique implemented via Multi-threadingMerge SortMerge sort is a sorting technique which is based on divide and conquer technique where we divide the array into equal halves and then combine them in a sorted ... Read More

Memorization is a technique based on dynamic programming which is used to improve the performance of a recursive algorithm by ensuring that the method does not run for the same set of inputs more than once by keeping a record of the results for the provided inputs(stored in an array).Memorization ... Read More