How to run a C/C++ program in Linux mint/ubantu/other

Run A C/C++ program in mint / ubantu / other linux

Hello friends, here we are going to run a c program file in linux mint.

Here is some step which return below the video ,

You can simply watch the video or follow the step ....

VIDEO

Steps for Run C program file in terminal

first open software manager/ store and download the "G++" or you can also " apt get" for install g++.
Open any editor and make a c/c++ file and save it on any location.
Now open terminal and go to your file location (lets say it "Desktop" then go to Desktop by cd Desktop command).
Now Type g++ filename.c -o outputfilename then press enter. (filename = your file name and outputfilename = what output name you want)

Comments

Shortest Remaining Time First (SRTF) Program in C++ || dot clu

Shortest Remaining Time First (SRTF) Program in C++ || dot clu Shortest Remaining Time First (SRTF) Shortest Remaining Time First (SRTF) Algorithm is preemptive version of Shortest Job First Algorithm. In this current process is executed until it is completed or a new process is added having lower burst time compare to the the remaining time for current process. SRTF algorithm may lead to starvation, if processes with lower burst time continues to add to cpu scheduler then the current process will never get a chance to get executed. For example consider the following table Process Arrival Time Burst Time P1 0 10 P2 1 6 P3 2 9 P4 3 4 At time t=0, Process P1 will start get executing as it is only the process present at that time. Then at t=1, Process P2 added to the CPU scheduler, at this time remaining time(Burst time) for Process P1 gets 9, as Burst time of P2 is less than the remaining time of other processes (for now there is only process P1) therefore process

Program for Worst Fit algorithm in Memory Management || dot clu

Program for Worst Fit algorithm in Memory Management Worst Fit allocates a process to the partition which is largest sufficient among the freely available partitions available in the main memory. If a large process comes at a later stage, then memory will not have space to accommodate it. Suggestion: 1. First Fit 2. Best Fit 3. Worst Fit Example: Input : blockSize[] = {100, 500, 200, 300, 600}; processSize[] = {212, 417, 112, 426}; Output: Process No. Process Size Block no. 1 212 5 2 417 2 3 112 5 4 426 Not Allocated Implementation: 1- Input memory blocks and processes with sizes. 2- Initialize all memory blocks as free. 3- Start by picking each process and find the minimum block size that can be assigned to current process i.e., find min(bockSize[1], blockSize[2],.....blockSize[n]) > processSize[current], if found then assign it to the current process. 5- If not then leave that process and keep checking the fu

C++ Program For PRIORITY WITH NON - PREEMPTIVE Scheduling Algorithm || dot clu

C++ Program For PRIORITY WITH NON - PREEMPTIVE Scheduling Algorithm It is important to distinguish preemptive from non - preemptive scheduling algorithms. Preemption means the operating system moves a process from running to ready without the process requesting it. Without preemption , the system implements ``run to completion (or yield or block)''. Non-Preemptive Scheduling Non-Preemptive Scheduling means once a process starts its execution or the CPU is processing a specific process it cannot be halted or in other words we cannot preempt (take control) the CPU to some other process. A computer system implementing this cannot support the execution of process in a multi task fashion. It executes all the processes in a sequential manner. It is not practical as all processes are not of same priority and are not always known to the system in advance. Source Code: #include <iostream> using namespace std; int main() { int n; cout

dot clu

Search This Blog