Kangaroo HackerRank Solution in C/C++/Java/Python
In HackerRank Challenges, the number line jumps problem states the location of starting point of two kangaroos on the number line (x1 & x2). Both Kangaroos have their own jump …
Month: December 2020
diagonal difference hackerrank solution
In the diagonal difference challenge of hackerrank, the user is provided a square matrix of N*N size and the challenge is to calculate the absolute difference between the left to …
Block Diagram of Computer System
A computer is an electronic device that has the ability to perform mathematical operations at an enormous speed. The computer performs these mathematical operations on some information or data. This …
Round Robin Scheduling In C
Round Robin (RR) is a CPU process Scheduling algorithm in which all the processes are given their fair share of time to execute by the CPU. In Round Robin, the …
Services provided by operating system
There are various services that are offered by the operating system to the end-users as well as to the application program which in turn provide service to the user. Let’s …
Types of unguided media
The unguided media is also known as the wireless media and uses electromagnetic and light signals to transmit the information. There are various advantages of using unguided media such as …
Difference Between Single User and Multiuser Operating System
The operating system’s reason for existence is to serve the end-users by using the hardware resources. The operating system can be designed to serve the need of the single superuser …
Degree of relationship in DBMS
The number of entities that are participating in the relationship or known as the degree of that relationship. The degree of relationship can be binary, ternary, or quaternary. For example, …
Single Level Directory Program In C
There are many types of structures of directory in the Operating System. The simplest one of them is Single Level Directory structure. In this type of structure, there is one …
Bisection Method Program in C and C++
Bisection method is a method used to find the root of a function present between two given values of x. The main idea behind bisection is that the function needs …
