
	Trending ▼ ICSE CBSE 10th ISC CBSE 12th CTET GATE UGC NET Vestibulares ResFinder

2003 Course Real Time System (Elective II)

4 pages, 46 questions, 0 questions with responses, 0 total responses,

	pune_eng	+Fave Message
	Profile Timeline Uploads Q & A

Home > pune_eng >

Instantly get Model Answers to questions on this ResPaper. Try now!
NEW ResPaper Exclusive!

Formatting page ...

Total No. of Questions : 12] P1384 [Total No. of Pages : 4 [3764]-442 B.E. (Information Technology) REAL TIME SYSTEM (2003 Course) (Elective - II) (414451) Time : 3 Hours] [Max. Marks : 100 Instructions to the candidates: 1) 2) 3) 4) Answer question 1 or 2, 3 or 4, 5 or 6 from Section I and question 7 or 8, 9 or 10, 11 or 12 from Section II. Answers to the two sections should be written in separate books. Neat diagrams must be drawn wherever necessary. Assume suitable data, if necessary. SECTION - I Q1) a) Draw a block diagram of Real-Time System and explain the different component. [8] b) Explain the following properties of good performance measure. i) Efficient encoding. ii) Objective basis for ranking. iii) Objective optimization criteria. iv) Varifiable facts. [8] OR Q2) a) Consider a traffic light control system. A traffic light will be normally green for G second, yellow for Y second and red for R second. During night for certain period of time the intersection will automatically suspend normal service and its will flash yellow. [10] Consider an intersection two-two way street. i) Find accomplishment level. ii) Find hierarchical view performance. b) What are the various factor, that are to be consider while estimating the program run time. [6] Q3) a) State the assumption made for the implementation of the Rate-Monotonic Scheduling algorithm. What is the easy schedulability test for this algorithm. [6] P.T.O. b) Consider : Task 1 = (p1, e1) = (2, 0.9) Task 2 = (p2, e2) = (5, 2.3) i) Find total processing utilization. ii) Find necessary and sufficient condition. iii) Draw the cycle for Rate-Monotonic task scheduling. [8] c) Explain the classification of Real-Time Scheduling with example. [4] OR Q4) a) Describe the Focused Addressing and Bidding (FAB) algorithm used for task set containing both critical and non-critical real time tasks. [6] b) Explain the priority inversion problem in handling the critical section. How is it solved? Explain with suitable example. [8] c) Consider : Task 1 = (p1, e1) = (2, 0.9) Task 2 = (p2, e2) = (5, 2.3) Draw the cycle for earliest deadline first algorithm. Q5) a) Mention the desired characteristics of Real Time language. [4] [6] b) Describe the Adaptive Earliest Deadline (AED) algorithm used in transaction priorities. State the drawback of AED algorithm. How Adaptive Earliest Virtual Deadline (AEVD) avoid this drawback. [10] OR Q6) a) Explain how the two-phase locking approach used in pessimistic concurrency control is disadvantage to real time system. How can it be modified to overcome the problem? [10] b) How are time stamps assigned to transaction so that serialization consistency is maintained? Explain with suitable example. [6] SECTION - II Q7) a) Explain the Virtual-Time-Carrier-Sensed-Access-Minimum-Laxity Priority algorithm (VTCSAM-L) [4] b) Consider VTCSAM-L. Suppose following table. Node M RC at arrival 1 1 0 2 2 10 3 3 20 4 4 20 [3764]-442 2 the packet arrive according to the [6] TM DM 32 16 36 20 56 40 72 60 Let us assume that for each packet is TM = 15, propagation time = 1 . i) ii) Draw the trajectory for n = 2 Draw the trajectory for n = 4 c) What is Timed-Token protocol? How it is implemented? Draw the flow chart for Synchronous and Asynchronous packet transmission. [8] OR Q8) a) Write a short notes on (Any Two) : [10] i) Wormhole-Routing. ii) Deadline-Based Protocol. iii) Passive Star Network and Wavelength Division Multiplexing (WDM) Network. iv) Stop and Go Multihop protocol. b) What is the Polled Bus Protocol? [4] c) Consider Nodes 1, 2 and 3 have priorities 4, 7, 4 respectively; with higher value indicating higher priority. They are connected to a common bus that implements polled Bus protocol. Assign a poll number to each node and indicate the order in which they access the bus for data transfer. [4] Q9) a) Draw the functionality block diagram of real time operating system. [4] b) Explain the difference between SRTOS and HRTOS. [4] [8] c) Describe the following capability of real time operating system. i) External-internal interrupt handling. ii) Memory management through virtual memory mapping and memory locking. OR Q10) a) Write short notes on the following mechanism present in real time operating system. [10] i) Time Service. ii) Scheduling Mechanism. b) With the help of block diagram explain the capability of RT-Linux. [6] Q11) a) How is hardware redundancy implemented through voting and consensus. Explain the working of formalized majority votor. [8] [3764]-442 3 b) Write short notes on (Any Two) : i) Time Redundancy. ii) Information Redundancy. iii) Data Diversity. [8] OR Q12) a) Explain reliability model for hardware redundancy. State reliability model require for permanent fault only. [8] b) Define the following term : i) Hardware fault. ii) Error latency. iii) Fault latency. iv) Backward error require. [8] [3764]-442 4

Formatting page ...

Tags : Pune, Engineering, University of Pune, Engineering question papers, Pune University, previous year question papers, question papers, india, model question paper, pune university paper pattern, pune university syllabus, old question papers

pune_eng chat

Horizontal lines at:
Guest Horizontal lines at:
AutoRM Data:
Box geometries: