DOEACC Society 2006 DOEACC B Level BE1 Embedded Systems ( ) - Question Paper

BE1-R3: EMBEDDED SYSTEMS
NOTE:
Time: three Hours Total Marks: 100
1.
a) What is an embedded system? elaborate the characteristics of an embedded system?
b) What do you understand by exception handling? Explain, how you can handle
exceptions using a programming language of your option.
c) How data word length is key feature when developing audio algorithms free from noise
artifacts?
d) Consider the subsequent preemptive priority- scheduling algorithm based on dynamically
changing priorities. Larger priority numbers imply higher priority. When a process is
waiting for CPU (in the ready queue, but not running), its priority modifications at a rate of a
(i.e., P(t) = P0 +a * (t - t0) where t0 is the time at which the process joins the ready queue).
Similarly, when it is running, its priority modifications at a rate b. All processes are provided a
priority 0 when they enter the ready queue. The parameters a and b can be set to find
many various scheduling algorithms.
What is the algorithm that outcomes from b > a > 0?
What is the algorithm that outcomes from a < b < 0?
e) elaborate the benefits of using a Digital Signal Processing to process audio signals?
f) What is mutual exclusion? discuss software solution of this problem?
g) What is CAN? define different features of CAN.
(7x4)
2.
a) What is Programmable Interrupt Controllers and how Interrupts are handled?
b) The DSP Architecture is optimized for complex mathematical calculations by virtue of
its different computational units. explain this by bringing out the design aspects of ALU,
MAC and BARREL SHIFTER.
(9+9)
3.
a) What is modulation and define different modulation techniques.
b) What is RTOS and define architecture of real time Kernel.
(9+9)
4.
a) What is the various optimizing design metrics involved in designing an embedded
system?
b) Which kind of communication network is used by Embedded Systems?
(9+9)
5.
a) elaborate Serial Communication and Handshaking?
b) What is Scheduling? describe Priority-Based Scheduling.
(9+9)
BE1-R3 Page one of two July, 2006
1. ans ques. one and any 4 ques. from two to 7.
2. Parts of the identical ques. should be answered together and in the identical
sequence.
6.
a) Why Timer Units are most crucial components of Embedded Systems?
b) Differentiate registers from memory. Compare Princeton architecture and Harvard
architecture. How is Cache memory related to embedded computing system?
(9+9)
7.
a) As a system administrator you have noticed that usage peaks ranging from 10:00AM to
5:00PM and ranging from 7:00PM to 10:00PM. The company's CEO decided to call on you
to design a system where during these peak hours there will be 3 levels of users.
Users in level one are to enjoy better response time than users in level 2, who in turn will
enjoy better response time than users in level 3. You are to design such a system so
that all users will still get a few progress, but with the indicated preferences in place.
Will a fixed priority scheme with pre-emption and three fixed priorities work? Why, or why
not?
Will a UNIX-style multi-feedback queue work? Why, or why not?
If none of the above works, could you design a scheduling scheme that meets the
requirements?
b) Most round-robin schedulers use a fixed size quantum. provide an argument in favor of and
against a small quantum.
(9+9)
BE1-R3 Page two of two July, 2006

Earning:   Approval pending.