Skip to main content

Privacy Policy& Terms

ACCEPTANCE OF TERMS

Usage of www.encious.com is strictly subjected to the following Policies, Terms& Conditions which would be updated any time without prior notice to you. Up to date Terms& condition will be availabe on this page.

WEBSITE USAGE

www.encious.com works to provide information regarding facts, ideas and its logical interpretation of educationally valuable content.Even after implementing all possible precautions for the perfection of data provided by some users, www.encious.com will not take any resposiblity if there is errors and inaccurcy in data and any form of consequence due to those incorrect data. The usage of data is solely on your own risk the site will not have any liability on it. www.encious.com assumes zero percent liablity for disputes on ownership, copyright of data submitted to this website.

ANT-SPAM POLICY

The uasge of assets/services of www.encious.com for the commercial purpose of idividuls is strictly angist our policy. By using our services you are agreed avoid spamming/ illegal uasage of services.

COPYRIGHT POLICY

The all types content publshed by this website is solely under authority of www.encious.com and may not be copied or redistributed in any form with out prior permission from www.encious.com . If you found any content that violated your intellectual rights, please contact us with document proving your authority.

PRIVACY POLICY

Similar to most of other websites www.encious.com may use log files to gather demographic informations in seperated maner so that which will not be linked you any of personal information . The website may use cookies to analyse user preferences, user specific data. Google may use cookies to serve ads and users may disble the use of it may Google ad and content network privacy policy at " www.google.com/privacy_ads.html ". www.encious.com does not have any control over those third party cookies and users have take action on their own individual browser options.

Popular posts from this blog

Operating Systems | Scheduling Algorithms : Round Robin

| FCFS | SJF | SRTS | Round Robin | LJF | Priority Scheduling | HRRN | Round RobinFeatures : Most popular algorithm of allPractically implementableImplementable with basic data structures like queueExtremely lesser starvationOptimum efficiency can be set by controlling time quantumThe round robin algorithm will continuously switch between processes if a process in CPU (under execution) exceeds a time limit set by OS called time quantum.Flow Chart :Scheduler allocated process to for execution.CPU starts monitoring the execution time right after from allocation.If the process completes its execution before exceeding time quantum, OS forwards the process to termination state.else, the processes gets preempted once the time quantum limit exceeded and if the process finished at this moment, OS moves the process to termination state, else it moves to ready queue and iterates over the whole process listed above.Example : Consider the following table of processes and calculate complet…

Operating Systems | Concept of Process

Hard disk drive of the system in called primary memory and secondary memory is Random Access Memory(RAM). Either a program written in High Level Language(HLL) or a executable code generated by the sequence of works done by pre-processor, compiler and assembler, resides in secondary memory of the system. To start an execution, operating system allocates some space in the main memory, for the program to be executed and loads the program in the secondary memory to the allocated space. The piece of work which is loaded by the operating system to the main memory in order to execute program is called processEvery program loaded by operating system will create a focus boundary(or process body), a partitioned memory area where all memory requirements for the execution of program is satisfied.Variable which will not change its value through out life time of process is called static variable and variables which are globally accessible in a process known as global variable.Heap area is reserved f…

Operating Systems | Scheduling Algorithms : SJF

| FCFS | SJF | SRTS | Round Robin | LJF | Priority Scheduling | HRRN | Shortest Job First(SJF)SJF algorithm schedules the shortest job(low burst time) available on main memory at the time of context switching in ready state . It can be either preemptive or non-preemptive depending on the nature of scheduler.Since the SJF select the job which is shorted among available jobs on main memory, Non-preemptive SJF algorithm will have larger waiting time if a job with longer burst time get scheduled first. In short SJF is also vulnerable to Convoy EffectTo find shortest process among min-heap would be the best data structure to be usedExample : Consider the following table of processes and calculate completion time, turn around time and waiting time using SJF algorithm with the following assumptions. No preemption.No I/O request will be there from any process.Arrival time is relative to CPU on time.Process NumberATBT103222324442View Answer

The execution of processes can be visualized …