EMBEDDED COMPUTING SYSTEM - 10CS72                   
                     UNIT – 5 RTOS- I
(questions struck off are not there)
1)    What is RTOS? Explain the Basic functionalities used in Operating systems. 10 Marks
2)    Explain different types of Operating systems. 10 Marks
3)    Compare Threads and Process in detail. 10 Marks
4)    Differentiate the following: Threads and Process and explain Thread preemption.10 Marks
5)    Explain the factors for selecting a scheduling criterion/algorithm in Task scheduling process. 10 Marks
6)    Explain the following Non-preemptive scheduling Process: i) FCFS/FIFO scheduling. 5Marks ii) LCFS/LIFO  scheduling.  5Marks
7)    Explain the following Non-preemptive scheduling: i) SJF scheduling. 5Marks ii) Priority Based scheduling. 5Marks
8)    Explain the following preemptive scheduling Process: i) Preemptive SJF scheduling/SRT. 5Marks ii) Round Round (RR) scheduling.  5Marks
9)    Explain Shared Memory Process in detail. 10 Marks
10)    Explain Message Passing system in detail. 10 Marks
11)    What is a deadlock? Explain where deadlock situation can arise and methods to avoid deadlocks. 10 Marks
12)    Explain Dining Philosopher's Problem in detail. 10 Marks
13)    Explain Producer-Consumer/Bounded Buffer Problem. 10 Marks
14)    Explain Task synchronization Techniques. 10 Marks
15)    Describe SEMOPHORE in detail. 10 Marks
16)    Explain the role of Device driver in Embedded OS based Products.And describe the functional and non-functional requirements in using an RTOS. 10 Marks
17)    Three Processes with process ID's P1,P2,P3 with estimated completion time 10,5,7 milliseconds respectively enters the ready queue together in order P1,P2,P3. Calculate the Waiting time and Turn Around Time(TAT) for each process and the Average Waiting time and Turn Around Time(TAT) (Assuming there is no I/O waiting for the processes) in the FIFO scheduling. 10 Marks
18)    Three Processes with process ID's P1,P2,P3 with estimated completion time 6,4,2 milliseconds respectively enters the ready queue together in order P1,P2,P3. Calculate the Waiting time and Turn Around Time(TAT) for each process and the Average Waiting time and Turn Around Time(TAT) (Assuming there is no I/O waiting for the processes) in RR algorithm with Time slice = 2ms. 10 Marks
19)    Three Processes with process ID's P1,P2,P3 with estimated completion time 12,10,2 milliseconds respectively enters the ready queue together in order P2,P3,P1. A new process P4 with estimated execution completion time 4 milliseconds enters the ready queue enters the ready queue after 8 milliseconds. Calculate the Waiting time and Turn Around Time(TAT) for each process and the Average Waiting time and Turn Around Time(TAT) (Assuming there is no I/O waiting for the processes) in the Non-preemptive LIFO scheduling. 10 Marks.
20)    Three Processes with process ID's P1,P2,P3 with estimated completion time6,8,2
milliseconds respectively enters the ready queue together . A new process P4 with estimated execution completion time 4 milliseconds enters the ready queue enters the ready queue after 1 milliseconds. Calculate the Waiting time and Turn Around Time(TAT) for each process and the Average Waiting time and Turn Around Time(TAT) (Assuming there is no I/O waiting for the processes) in the Non-preemptive SJF scheduling. 10 Marks.
21)    Three Processes with process ID's P1,P2,P3 with estimated completion time 4,6,5
milliseconds and priorities 1,0,3 (0--Highest priority and 3-- Lowest priority) respectively enters the ready queue together. A new process P4 with estimated execution completion time 6 milliseconds and priority 2 enters the ready queue enters the ready queue after 5 milliseconds. Calculate the Waiting time and Turn Around Time(TAT) for each process and the Average Waiting time and Turn Around Time(TAT) (Assuming there is no I/O waiting for the processes) in the Non-preemptive Priority-Based scheduling. 10 Marks.
22)    Three Processes with process ID's P1,P2,P3 with estimated completion time 4,6,5
milliseconds and priorities 1,0,3 (0--Highest priority and 3-- Lowest priority) respectively enters the ready queue together. Calculate the Waiting time and Turn Around Time(TAT) for each process and the Average Waiting time and Turn Around Time(TAT) (Assuming there is no I/O waiting for the processes) in the Preemptive Priority-Based scheduling. 10 Marks.
23) Three Processes with process ID's P1,P2,P3 with estimated completion time 12,10,6
milliseconds respectively enters the ready queue together . A new process P4 with estimated execution completion time 2 milliseconds enters the ready queue enters the ready queue after 3 milliseconds. Calculate the Waiting time and Turn Around Time(TAT) for each process and the Average Waiting time and Turn Around Time(TAT) (Assuming there is no I/O waiting for the processes) in the SRT scheduling. 10 Marks.


                        UNIT – 6 RTOS-II

    1) CASE STUDY: Telephone Answering Machine. Write the Theory of operation and             requirements along with detailed specifications. 10 Marks
    2) Explain briefly the procedure of evaluating operating system performance. 10 Marks
    3) Describe various interprocess communication mechanisms. 10 Marks
    4) Explain Rate-Monotonic scheduling under priority based scheduling. 10 Marks
    5) Explain Earliest-Deadline-First scheduling under priority based scheduling. 10 Marks
    6) Describe various platforms under preemptive Real-time operating systems and              explain any two in detail. 10 Marks
    7) Describe the following: I) CPU Metrics 5 Marks  II)Timing requirements on process.              5 Marks
    8) Define Tasks and process. Explain Multirate systems. 10 Marks

Advanced Computer Architecture-IInd Internal Question Bank

Unit-5

1) Explain the computer structures of SISD, SIMD, MISD and MIMD with a neat diagram.

2) What is distributed shared memory architecture?

3) What is symmetric shared memory architecture? Explain with a block diagram.

4) Explain bus snooping protocols with block diagram.

5) Explain state diagram for a cache block in directory based system.

Unit-6

6) Explain first and second optimization for increasing cache performance.

7) Explain the Third optimization in detail.

8) Explain the Fourth optimization in detail of a cache performance.

9) Explain the Fifth optimization in detail.

10) Explain the Sixth optimization in detail.

Question_Bank-Advanced_Computer_Architecture(ACA)-VTU-VII-A&B

Question Bank- ACA- VII A & B- 1st Internal

1) Explain various classes of computers? And the 7 dimensions of ISA?

2) Write a note on recent trends in computer design or explain trends in technology?

3) What is Amdahl’s law? Explain in detail with example?

4) What is trends in performance of parallel computers. Explain in detail.

5) How to measure and report the performance of the parallel computing systems?

6) What is a structural Hazard? Explain with a neat diagram?

7) What is a data hazard? Explain with a neat diagram?

8) What is control hazard? Explain with a neat diagram?

9) Explain the implementation of MIPS pipeline with a neat diagram?

10) What are the types of dependencies? Explain the data dependencies?

11) Explain the name dependencies?

12) Explain the control dependencies?

Information and Network Security - IIIrd Internal QB

Download

Hope this helps.

System Simulation and Modelling - IIIrd internal Question Bank

Final QB:

Download

Reduced number of questions from 19 to 14. They are from unit 6 and 8. 4 questions in unit 6 and 10 from unit 8.

System Simulation and Modeling - IInd Internal Question Bank

SYSTEM MODELLING & SIMULATION QUESTION BANK II INTERNALS

VIII CS 10CS82

Unit-III

1. Explain the following in Discrete Distributions:

a) Bernoulli’s Distributions/Trials. (5)

b) Binomial Distributions (5).

2. Generate Three Poisson variates with mean α=0.2.Compute e-α. Generate Three Random

  Numbers and compute the results in Tabular form.

3. a) Explain Uniform Distributions in detail(5).

b) Explain Weibull Distributions in detail(5).

4. Explain Poisson process.

5. a) Explain the procedure for generating a Poisson random variate (5).

b) Explain Triangular distributions (5).

6. Explain the following Continuous Distributions:

a) Log Normal Distributions.(5)

b) Triangular Distributions.(5)

7. Explain the following Continuous Distributions:

a) Gamma Distributions.(5)

b) Erlang Distributions.(5)

8. Explain the following Continuous Distributions:

a) Uniform Distributions. (5)

b) Exponential Distributions. (5)

9. Explain Empirical Distributions.

Unit-V

1a) Explain the Properties of Random Numbers?

b) Explain the Generation of Pseudo-Random Numbers?

2. Explain Various Tests for Random Numbers?

3. The sequence of numbers 0.44,0.81,0.14,0.05,0.93 has been generated. Use kolmogorov- smirnov test with alpha=0.05 to determine if the hypothesis that its number are uniformly distributed on interval (0,1) can be rejected. First the numbers must be ranked fro smallest to largest. Compare F(x) and Sn (x) on a graph?

4. Test for whether the 3^rd,8^th 13^th and so on, numbers in the sequence at the beginning are autocorrelated using alpha=0.05.Here, i=3(beginning with the third number),m=5(every five numbers),N=30(30 numbers n the sequence),and M=4(Largest integer such that 3+(M+1)5<=30).

0.12 0.01 0.23 0.28 0.89 0.31 0.64 0.28 0.83 0.93

0.99 0.15 0.33 0.35 0.91 0.41 0.60 0.27 0.75 0.88

0.68 0.49 0.05 0.43 0.95 0.58 0.19 0.36 0.69 0.87

5. Differentiate between Chi-square and K-S Test?

6. Using χ2(Chi Square) test, Test for Hypothesis that the data given follows Uniform Distribution at alpha=0.05.The Critical value is 16.9

O(i)

8

8

10

9

12

8

10

14

10

11

7. Explain in detail the Inverse Transform technique for Exponential Distributions (10).

System Simulation and Modelling - 1st Internal Question Bank

CITY ENGINEERING COLLEGE

DEPARTMENT OF COMPUTER SCIENCE & ENGG

SSM QUESTION BANK (VIII CS A & B)

1. With the aid of flow diagram, explain various steps in a Simulation Study?

2.  A Newspaper seller buys newspaper for 33 cents each and sells them for 50 cents each. Papers not sold at the end of the day are sold as scrap for 5 cents each.

Papers can be purchased in bundles of 10 only. There are 3 types of News days they are “Good”, “Fair”, and “poor” with probabilities 0.35, 0.45 and 0.2 respectively.

Determine the optimal number of papers by simulating demands for 10 days.

Use the random numbers {94,77,49,45,43,32,49,00,16,24} for the type of Newsday

and the random numbers for the daily demand are as follows {80,20,15,88,98,65,86,73,24,60}.

The distributions of newspapers demanded are shown in the table below. 

Demand - Probability Distribution for various Newsday

Demand	Good	Fair	Poor
40	0.03	0.10	0.44
50	0.05	0.18	0.22
60	0.15	0.40	0.16
70	0.20	0.20	0.12
80	0.35	0.08	0.06
90	0.15	0.04	0.00
100	0.07	0.00	0.00

Simulate assuming 70 newspapers are purchased in one day as a policy.

3. a. What are the Advantages and Disadvantages of using Simulation?

    b. Differentiate between Discrete and Continuous System?

4  a. Explain Event Scheduling/Time Advance Algorithm?

    b. World Views.

5. A grocery store has one checkout counter. Customers arrive at this checkout counter

    at random from 1 to 8 min apart and each Inter arrival time has the same probability of occurrence. The service time vary from 1 to 6 minutes with probabilities as given below.

Service Time(Mins)	1	2	3	4	5	6
Probability	0.1	0.2	0.3	0.25	0.1	0.05

                    Simulate the arrival of 5 customers and calculate

 i)         Average Waiting time for a customer

ii)                  Probability that a customer has to wait

iii)                Probability of a Server being Idle  

iv)                Average Service time and

v)                  Average time between arrivals. Use the following sequence of random numbers.

RD  Arrival:	913	727	15	948	309	922
RD Service Time :	84	10	74	53	17	79

             Assume that first customer arrives at time 0. Depict the simulation in a tabular form.

6. Explain the following terms with an example for each:-

System, Model, System State, Event List, Delay, Event Notice, List, Activity, Entity,

Attributes.

7. Explain the concept of Simulation in GPSS in detail?

8. Explain the concept of Simulation in java in detail?

9. Explain List Processing and World Views?

10. Differentiate between:

   a) Static and Dynamic Model.

   b) Deterministic and Stochastic Simulation.

11. What is a System, Simulation and System Environment? List the advantages and disadvantages of Simulation?

12. Explain the Various Areas of Application of Simulation?

13. Name Entities, Attributes, Activities, Events, state Variables for the following Systems:

I)                   University Library.

II)                Bank.

III)             Call Centre.

IV)             Hospital Blood Bank.

V)                Departmental Store.

14. a) Explain Simulation of Inventory Systems?

      b)  Explain Simulation of Queuing Systems?

15. Briefly explain the Execution of Arrival Event process for single channel queue in an event scheduling/time advance algorithm?

16. Briefly explain the Execution of Departure Event process for single channel queue in an event scheduling/time advance algorithm?

17. Consider a Computer Technical Support Centre where personnel take calls and provide service. The time between calls ranges from 1 to 4 minutes. There are two technical support people Able and Baker. Able is more experienced than Baker and can provide faster service than Baker. Simulate for 10 Customers.

Interarrival distribution of calls for Technical Support

Time-between Arrivals (Min):1           2          3          4

Probability:                              0.25     0.40     0.20     0.15

Service Distribution Of Able:

Service Time (Min):     2          3          4          5

Probability:                  0.30     0.28     0.25     0.17

Service Distribution ofBaker:

Service Time (Min):     3          4          5          6

Probability:                  0.35     0.25     0.20     0.20

 18. Explain when Simulation is an Appropriate Tool and when it is not?