Shaheed Udham Singh College of Engg. & Technology Tangori(Mohali) Department of computer science & Engg. Question an!

Su"#ect Code$ CS%&'( Su"#ect ,ame$ -eal Time system )ear* Sem$ &rd * +th

.repared y$ % Er. -a#/inder 0aur 1ery Short 2ns/er *-ecall Type Questions
1.Define Real time system. 2.Define Multiprocessing system. 3.Name various Real-time operating system. 4.Differentiate Tightly coupled system !oosly "oupled system. #.Define $u%%y logic fu%%ification. &.Define Tas'. (..Differentiate )et*een periodic +peroidic tas's. ,.Define various traditional performance measures. -.Define cost function hard deadline. 1.. /o* a Real time system is different from a general 0purpose system1 12.Differentiate )et*een a)solute relative consistency. 13.Define contention )ased protocols. 14.Define release time. 1#.Define a)solute deadline of tas'. 1&./o* fault 0tolerance is dealt *ith claim 0to'en pac'et in timed to'en protocol1 1(.!ist various assumptions made for 2D$ algorithm. 1,. 3tate t*o necessary features of Real time programming languages. 1-.Name 4arious Real time programming languages. 2..Differentiate )et*een hard & Soft Real time systems. 21.Define TM- systems. 22.Define deterministic tas' scheduling. 23.list four ma5or hard*are soft*are faults. 24.Define computational relia)ility. 2#.!ist different tas' classes. 2&.Define e6pected capacity survival time. 2(. Define gracefully degrada)le system. 2,.Dra* 3-dimensional hypercu)e net*or'.

Short 2ns/er *Comprehension Type Questions
1.26plain structure of Real time system *ith diagram . 2.26plain Mar!o3 diagram for a gracefully degrada)le system. 3.Discuss various issues related to main memory data)ases.

"2 9.26plain multi3ersion scheme used in pessimistic concurrency control.Discuss relia)ility issues in Real time systems..Discuss 1TCSM2 algorithm in detail. 26plain -ate monotonic scheduling algorithm in detail using various e6amples. 26plain various Net*or' topologies used in Real time systems.4.26plain the t*o categories of traffic generated in a net*or' )y Real time system *ith e6ample. 1&. T1 T2 T3 T4 T# T# T( T. &. T11 2i # ( 3 1 1.. 4. 3. 1. ## (. (. . 1#. .26plain the properties of a good performance measure for a Real time system. 4. #. 12.. 26plain various performance measures.Then the follo*ing ta)le lists the utili%ation )ounds corresponding to each class C52SS 6U. #.2&:.41. 26plain all to!en "ased protocols in detail.7ive an overvie* of pre-emptive scheduling in uniprocessor systems./o* the +"=D properties can )e rela6ed. 1& 1 3 1( 21 <i 1. . 26plain *ith -ate monotonic 2lgorithm.D "1 9. "4 9.1-:.7enerate an e6ample of an application *here it is permissi)le to rela6 the 2C4D properties of a Real time system. 21 22 24 3.26plain ... TT1.1-.26plain commit algorithm in optimistic concurrency control.. (... -.26plain the pro)lems of implementing main memory data)ases in Real time systems. 5ong 2ns/er*2pplication Type Questions 1. 14. Discuss various net*or' architecture issues in detail. /o* main memory data)ases are useful for implementing Real time systems.:. "3 9... 11. -# /o* tas' assignment to multiple processors is done using ne6t-fit algorithm for RM scheduling1 13.26plain 7armhole routing. Dra* 26plain schematic Diagram of Real time systems . 26plain various tas' scheduling methodologies in detail. 2. 26plain ED8 algorithm in detail using various e6amples 26plain 2C4D properties.41:1. -..26plain t/o phase loc!ing to handle concurrency control issues in Real time data)ases./o* traffic characteristics may change as pac'ets flo* through multiple hops of net*or' in Real time systems. -. #. &.olled "us protocol. 1. 26plain 6ptimistic concurrency control algorithm and its variant )roadcast algorithm . "onsider the follo*ing periodic tas' set..3uppose *e have m84 classes.2&..