HISTORY OF UNIX



In the late 1960’s researchers and scientists from BELL LAB’S were given the task to develop a multiuser and multitasking operating system. So they invented operating system known as ‘MULTICS’ this operating system was not able to get attention of majority of people, but it inspired ‘KEN THOMPSAN’, was the researcher at ‘BELL LAB’ to develop a simple version of ‘MULTICS’ and name it as ‘UNICS’.
‘KEN THOMPSAN’ then joined with ‘DENNIS RICHIE’, author of first ‘C’ compiler. They both rewrote and rename ‘UNICS’ to ‘UNIX’.
So ‘UNIX’ was develop in ‘BELL LAB’S ’ in ‘AT’ and ‘T’s’ in 1969 and further modifications were done in 1975-76 at the university of ‘CALAFORNIA’ and was released as ‘UNIX’ version 6.0 . By 1980 ‘UNIX’ could be moved to virtually any computer system and was available as system ‘THREE’. In the year 1993 a free open source ‘UNIX’ operating system was introduced and was given the name as ‘LINUX’.

Comments

Post a Comment

Popular posts from this blog

Write a program to add two number using inline function in C++?

#include<iostream.h> #include<conio.h> class bca {   public:   inline int sum(int x, int y)   {   return(x+y);   } }; int main() { clrscr(); int r,a,b; bca obj; cout<<"enter two integers :"<<endl; cin>>a>>b; r=obj.sum(a,b); cout<<" the sum of two integers is :"<<r<<endl; getch(); return 0; }   OUTPUT:- enter two integers :    3    6 the sum of two integer is :   9  
Read more

Traversing of elements program with algorithm and Flowchart

Image
ALGORITHM VARIABLES: §   i:      loop counter of array. §   A:    array name. §   LB: lower bound. §   UB: upper bound. ALGORITHM: STEP 1:         set i =LB STEP 2:         repeat steps 3 & 4                            While i<=UB STEP 3:         apply process to A[i] STEP 4:         i = i+1            STEP 5:         exit EXPLANATION: §   To traverse the elements of the array, firstly set the loop counter ‘i’ equal to last element of the array called the LOWER BOUND. §   Now, repeat step 3 & 4 for accessing all the elements of the array until loop counter ‘i’ is not less than or equal first element of array. §   Now, after checking the above condition, the whole process will repeat for all the elements of array. §   After applying process upon a[i], increment the loop counter by 1, until the condition is not satisfied. IMPLEMENTATION
Read more