Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...


what is real time system?what is the differance between hard
and soft real time systems

Answers were Sorted based on User's Feedback



what is real time system?what is the differance between hard and soft real time systems..

Answer / vishnu948923

real time system processing must be done within a defined
timed constraint otherwise system fails.
hard real time: time is strictly bounded ex: space
crafts,avionics,military application
soft real time : time is not strictly bounded ex: ATMs..

Is This Answer Correct ?    2 Yes 0 No

what is real time system?what is the differance between hard and soft real time systems..

Answer / nilesh chauhan

REAL TIME SYSTEM are the operating system which are defined
with restricted constraint lile time constraint,visuability
constraint etc.
Best example of real time system is QNX
HRTS are those which have great degree of constaint & SRTS
are those which have low degree of constaint.

Is This Answer Correct ?    0 Yes 0 No

Post New Answer

More C Interview Questions

What are the scope of static variables?

0 Answers  


Define circular linked list.

0 Answers  


You have given 2 array. You need to find whether they will create the same BST or not. For example: Array1:10 5 20 15 30 Array2:10 20 15 30 5 Result: True Array1:10 5 20 15 30 Array2:10 15 20 30 5 Result: False One Approach is Pretty Clear by creating BST O(nlogn) then checking two tree for identical O(N) overall O(nlogn) ..we need there exist O(N) Time & O(1) Space also without extra space .Algorithm ?? DevoCoder guest Posted 3 months ago # #define true 1 #define false 0 int check(int a1[],int a2[],int n1,int n2) { int i; //n1 size of array a1[] and n2 size of a2[] if(n1!=n2) return false; //n1 and n2 must be same for(i=0;i<n1-1;i++) { if( !( (a1[i]>a1[i+1]) && (a2[i]>a2[i+1]) ) ) return false; } return true;//assumed that each array doesn't contain duplicate elements in themshelves }

0 Answers   Facebook,


program to find a smallest number in an array

15 Answers   Microsoft, Sony,


How #define works?

0 Answers  


What is indirection in c?

0 Answers  


How do you use a pointer to a function?

0 Answers  


What is the difference between test design and test case design?

0 Answers  


What are the benefits of organizational structure?

0 Answers  


What language is lisp written in?

0 Answers  


What does 3 mean in texting?

0 Answers  


How to calculate sum

2 Answers  


Categories