CS8493 Important Questions Operating Systems

CS8493 Important Questions Operating Systems Regulation 2017 Anna University free download. Operating Systems Important Questions CS8493 pdf free download.

Sample CS8493 Important Questions Operating Systems:

8. What is means by Resuming a Process?
Resuming a process involves restarting it from the point at which it was suspended. CS8493 Important Questions Operating Systems

9. What is meant by Suspending a Process? Suspending is often performed by the system to remove certain processes temporarily to reduce the system load during a peak loading situation. CS8493 Important Questions Operating Systems

10. What is meant by Context Switching? When an interrupt occurs, the operating system saves the status of the interrupted process routes control to the appropriate first level interrupt handler.

11. What is meant by PSW?
Program Status Words (PSW) controls the order of instruction execution and contains various information about the state of a process. There are three types of PSW’s namely
Current PSW
New PSW
Old PSW CS8493 Important Questions Operating Systems

12. Define Mutual Exclusion. Each process accessing the shared data excludes all others from doing simultaneously called as Mutual Exclusion.

13. What is meant by Co-operating process? If a process can affect or be affected by the other processes executing in the system, that process which shares data with other process is called as Co-operating process.

14. What is meant by Interrupt? An Interrupt is an event that alters the sequence in which a processor executes instructions. It is generated by the hardware of the computer System. CS8493 Important Questions Operating Systems

15. What is meant by Degree of Multiprogramming? And when it is said to be Stable?
Degree of Multiprogramming means the number of processes in memory. And it is said to be stable when the average rate of the number of process creation is equal to the average

Subject name	Operating Systems
Short Name	OS
Semester	4
Subject Code	CS8493
Regulation	2017 regulation

CS8493 Operating Systems Important Questions Click Here To Download

CS8493 Operating Systems Important 16 Mark Questions

---

CS8493 Operating Systems Syllabus

---

CS8493 Operating Systems Notes

---

CS8493 Operating Systems Question Bank

---

CS8493 Operating Systems Question Paper

CS8492 Important 16 Mark Questions Database Management Systems

CS8492 Important 16 Mark Questions Database Management Systems Regulation 2017 Anna University free download. Database Management Systems Important 16 Mark Questions CS8492 pdf free download.

Sample CS8492 Important 16 Mark Questions Database Management Systems:

1.Briefly explain about Database system architecture:
2.Explain about the Purpose of Database system.
3. Briefly explain about Views of data. CS8492 Important 16 Mark Questions Database Management Systems
4. Explain E-R Model in detail with suitable example.
5. Explain about various data models.
6. Draw an E – R Diagram for Banking, University, Company, Airlines, ATM, Hospital, Library, Super market, Insurance Company. CS8492 Important 16 Mark Questions Database Management Systems
7. Explain 1NF, 2Nf and BCNF with suitable example.
8. Consider the universal relation R={ A,B,C,D,E,F,G,H,I} and the set of functional
dependencies F={(A,B)->{C],{A}>{D,E},{B}->{F},{F}->{G,H},{D}->[I,J}.what is the key for Decompose R into 2NF,the 3NF relations.
9. What are the pitfalls in relational database design? With a suitable example, explain the role of functional dependency in the process of normalization.
10. What is normalization? Explain all Normal forms. CS8492 Important 16 Mark Questions Database Management Systems
11. Write about decomposition preservation algorithm for all FD s.
12.Explain functional dependency concepts
13.Explain 2NF and 3NF in detail CS8492 Important 16 Mark Questions Database Management Systems
14.Define BCNF .How does it differ from 3NF.
15.Explain the codd s rules for relational database design

1.How the records are represented and organized in files . Explain with suitable example
2.Write about the various levels of RAID with neat diagrams
3. Construct a B+ tree with the following (order of 3)
5,3,4,9,7,15,14,21,22,23 CS8492 Important 16 Mark Questions Database Management Systems
4. Explain detail in distributed databases and client/server databases.
5.Explain in detail about Dataware housing and data mining
6.Explain in detail about mobile and web databases

Subject name	Database Management Systems
Short Name	DMS
Semester	4
Subject Code	CS8492
Regulation	2017 regulation

CS8492 Database Management Systems Important 16 Mark Questions Click Here To Download

 CS8492 Database Management Systems Important 2 Mark Questions

---

CS8492 Database Management Systems Syllabus

---

CS8492 Database Management Systems Notes

---

CS8492 Database Management Systems Question Bank

---

CS8492 Database Management Systems Question Paper

CS8492 Important Questions Database Management Systems

CS8492 Important Questions Database Management Systems Regulation 2017 Anna University free download. Database Management Systems Important Questions CS8492 pdf free download.

Sample CS8492 Important Questions Database Management Systems:

1. Define the terms i) DDL ii) DML

DDL:

Data base schema is specified by a set of definitions expressed by a special language called a data definition language.

DML:

A data manipulation language is a language that enables users to access or manipulate data as organized by the appropriate data model CS8492 Important Questions Database Management Systems

2. What is embedded SQL? What are its advantages? April/May-2011

Embedded SQL is a method of combining the computing power of a programming language and the database manipulation capabilities of SQL. Embedded SQL statements are SQL statements written in line with the program source code of the host language.

The embedded SQL statements are parsed by an embedded SQL preprocessor and replaced by host-language calls to a code library. The output from the preprocessor is then compiled by the host compiler. This allows programmers to embed SQL statements in programs written in any number of languages such as: C/C++, COBOL and Fortran CS8492 Important Questions Database Management Systems

3. Write short notes on relational model
The relational model uses a collection of tables to represent both data and the relationships
among those data. The relational model is an example of a record based model.

4. Define tuple and attribute
• Attributes: column headers
• Tuple : Row CS8492 Important Questions Database Management Systems

5. Define the term relation.
Relation is a subset of a Cartesian product of list domains.

6. Define tuple variable
Tuple variable is a variable whose domain is the set of all tuples.

7. Define the term Domain.
For each attribute there is a set of permitted values called the domain of that
attribute. CS8492 Important Questions Database Management Systems

8. What is a candidate key?
Minimal super keys are called candidate keys.

Subject name	Database Management Systems
Short Name	DMS
Semester	4
Subject Code	CS8492
Regulation	2017 regulation

CS8492 Database Management Systems Important Questions Click Here To Download

 CS8492 Database Management Systems Important 16 Mark Questions

---

CS8492 Database Management Systems Syllabus

---

CS8492 Database Management Systems Notes

---

CS8492 Database Management Systems Question Bank

---

CS8492 Database Management Systems Question Paper

 

MA8402 Important 16 Mark Questions Probability And Queuing Theory

MA8402 Important 16 Mark Questions Probability And Queuing Theory Regulation 2017 Anna University free download. Probability And Queuing Theory Important 8 Mark Questions MA8402 pdf free download.

Sample MA8402 Important 16 Mark Questions Probability And Queuing Theory:

1. Find the mean and variance of the following distributions:
Binomial, Poisson( Refer B: page no:179,183)

2. Find the mean and variance of the following distributions :
Geometric and Exponential(Refer B : page no:185,212)

3. Prove that Poisson distribution is the limiting form of
Binomial distribution. MA8402 Important 16 Mark Questions Probability And Queuing Theory (Refer B: page no : 181)

4. For a triangular distribution
Find the mean, variance and moment generating function.
(Refer C: page no : 1.122) MA8402 Important 16 Mark Questions Probability And Queuing Theory

5.It is known that the probability of an item produced by a certain
machine will be defective is 0.05. If the produced items are sent to the
market in packets of 20, fine the no. of packets containing at least,
exactly and atmost 2 defective items in a consignment of 1000 packets
using (i) Binomial distribution (ii) Poisson approximation to binomial
distribution. MA8402 Important 16 Mark Questions Probability And Queuing Theory (Refer C: page no : 2.28)

6. The daily consumption of milk in excess of 20,000 gallons is
approximately exponentially distributed with θ = 3000. The city has a
daily stock of 35,000 gallons. What is the probability that of two days
selected at random, the stock is insufficient for both days.
(Refer C: page no : 2.74)

7. Each of the 6 tubes of a radio set has a life length (in yrs) which may
be considered as a RV that follows a weibull distribution with parameters
α = 25 and β = 2. If these tubes function independently of one another, what is the probability that no tube will have to be replaced during the first 2 months of service? (Refer C: page no : 2.82) MA8402 Important 16 Mark Questions Probability And Queuing Theory

Subject name	Probability And Queuing Theory
Short Name	PQT
Semester	4
Subject Code	MA8402
Regulation	2017 regulation

MA8402 Probability And Queuing Theory Important 16 mark Questions Click Here To Download

MA8402 Probability And Queuing Theory Important 2 mark Questions

---

MA8402 Probability And Queuing Theory Syllabus

---

MA8402 Probability And Queuing Theory Notes

---

MA8402 Probability And Queuing Theory Question Bank

---

MA8402 Probability And Queuing Theory Question Paper

MA8402 Important Questions Probability And Queuing Theory

MA8402 Important Questions Probability And Queuing Theory Regulation 2017 Anna University free download. Probability And Queuing Theory Important Questions MA8402 pdf free download.

Sample MA8402 Important Questions Probability And Queuing Theory:

1. Define Random process. (Pg – 337)
Solution: A random process is a collection of random variables
{X(s,t)} that are functions of a real variable, namely t where s∈ (sample space) and t∈T(parameter set). MA8402 Important Questions Probability And Queuing Theory

2. Give the classification of Random Processes.(Pg – 338)
Solution: Discrete random sequence, Continuous random sequence,
Discrete random process, Continuous random process.

3. Define Stationary processes. (Pg – 339)
Solution: If certain probability distribution or averages do not depend
on t, then the random process {X(t)} is called stationary. MA8402 Important Questions Probability And Queuing Theory

4. Define SSS process.(Pg – 340)
Solution: A random process is called a strongly stationary process or
strict sense stationary process, if all its finite dimensional distributions
are invariant under translation of time parameter.

5. Define WSS process.(Pg – 341)
Solution: A random process {X(t)} with finite first and second order
moments is called a weakly stationary process or covariance
stationary process or wide-sense stationary process, if its mean is a
constant and the auto correlation depends only on the time difference.

6. Is Poisson process covariance stationary? Justify.(Pg – 343)
Solution: No. Mean of poisson process = λt ≠ a constant. MA8402 Important Questions Probability And Queuing Theory

7. Show that the random process X(t)=A cos(w0t + θ) is WSS,
if A and w0 are constants and θ is a uniformly distributed RV in (0 , 2π).
(Pg – 344)
Solution: Mean = 0 = a constant.
Autocorrelation = (A2/2)cosw0 (t1 – t2).
Hence WSS process.

8. If {X(t)} is a wss process with autocorrelation R(τ)=Ae-α|τ| ,
determine the second-order moment of the RV X(8) – X(5).
Solution: 2A(1 – e-3α) MA8402 Important Questions Probability And Queuing Theory

9. Define Markov process. (Pg – 446)
Solution: Markov process is one in which the future value is
independent of the past values, given the present value

Subject name	Probability And Queuing Theory
Short Name	PQT
Semester	4
Subject Code	MA8402
Regulation	2017 regulation

MA8402 Probability And Queuing Theory Important Questions Click Here To Download

MA8402 Probability And Queuing Theory Important 16 mark Questions

---

MA8402 Probability And Queuing Theory Syllabus

---

MA8402 Probability And Queuing Theory Notes

---

MA8402 Probability And Queuing Theory Question Bank

---

MA8402 Probability And Queuing Theory Question Paper

CS8491 Important Questions Computer Architecture

CS8491 Important Questions Computer Architecture Regulation 2017 Anna University free download. Computer Architecture Important Questions CS8491 pdf free download.

Sample CS8491 Important Questions Computer Architecture:

1. What are the eight great ideas in computer architecture?
2. What are the five classic components of a computer?
3. What is the function of data path and control path?
4. What is instruction set Architecture? CS8491 Important Questions Computer Architecture
5. Define application binary interface
6. Differentiate DRAM and SRAM.
7. Compare Volatile and nonvolatile memory.
8. List the advantages of Network Computer.
9. Define VLSI CS8491 Important Questions Computer Architecture
10. Differentiate Throughput and Response Time
11. Write the CPU performance equation.
12. If computer A runs a program in 10 seconds, and computer B runs the same program
in 15 seconds, how much faster is A over B. CS8491 Important Questions Computer Architecture
13. Write the formula for CPU execution time for a program
14. Write the formula for CPU clock cycles required for a program.
15. How will you measure the dynamic power dissipppation?
16. Define – Stored Program Concepts
17. What are the fields in an MIPS instruction?
18. List the advantages of multiprocessor over uniprocessor.
19. What are the different types ofoperands? Give examples
20. List the different addressing modes CS8491 Important Questions Computer Architecture

1. Add 610 to 710 in binary and Subtract 610 from 710 in binary
2. Write the overflow conditions for addition and subtraction.
3. Draw the Multiplication hardware diagram
4. List the steps of multiplication algorithm
5. What is fast multiplication? CS8491 Important Questions Computer Architecture
6. List the steps of division algorithm
7. What is scientific notation and normalization? Give an example
8. Give the representation of single precision floating point number
9. Define overflow and under flow with examples CS8491 Important Questions Computer Architecture
10. Give the representation of double precision floating point number

Subject name	Computer Architecture
Short Name	CA
Semester	4
Subject Code	CS8491
Regulation	2017 regulation

CS8491 Computer Architecture Important Questions Click Here To Download

 CS8491 Computer Architecture Syllabus

---

CS8491 Computer Architecture Notes

---

CS8491 Computer Architecture Question Bank

---

CS8491 Computer Architecture Question Paper

CS8451 Important 16 mark Questions Design and Analysis Of Algorithms

CS8451 Important 16 mark Questions Design and Analysis Of Algorithms Regulation 2017 Anna University free download. Design and Analysis Of Algorithms Important Questions CS8451 pdf free download.

Sample CS8451 Important 16 mark Questions Design and Analysis Of Algorithms:

4. Discuss Fundamentals of the analysis of algorithm efficiency elaborately.
 Algorithm‘s efficiency
 Three notations
 Analyze of efficiency of Mathematical Analysis of Recursive Algorithms
 Analyze of efficiency of Mathematical Analysis of non-Recursive Algorithms
Analysis of algorithms means to investigate an algorithm’s efficiency with respect to
resources: running time and memory space. CS8451 Important 16 mark Questions Design and Analysis Of Algorithms
 Time efficiency: how fast an algorithm runs.
 Space efficiency: the space an algorithm requires.
 Measuring an input‘s size
 Measuring running time
 Orders of growth (of the algorithm‘s efficiency function)
 Worst-base, best-case and average efficiency
 Measuring Input Sizes
 Efficiency is defined as a function of input size.
 Input size depends on the problem.
 Example 1, what is the input size of the problem of sorting n numbers? CS8451 Important 16 mark Questions Design and Analysis Of Algorithms
 Example 2, what is the input size of adding two n by n matrices?

 Units for Measuring Running Time
 Measure the running time using standard unit of time measurements,
such as seconds, minutes? CS8451 Important 16 mark Questions Design and Analysis Of Algorithms
 Depends on the speed of the computer.
 count the number of times each of an algorithm‘s operations is
executed.
 Difficult and unnecessary
 count the number of times an algorithm‘s basic operation is executed.
 Basic operation: the most important operation of the algorithm, the
operation contributing the most to the total running time.
 For example, the basic operation is usually the most time-consuming CS8451 Important 16 mark Questions Design and Analysis Of Algorithms
operation in the algorithm‘s innermost loop.
 Orders of Growth
 consider only the leading term of a formula

Subject name	Design and Analysis Of Algorithms
Short Name	DAA
Semester	4
Subject Code	CS8451
Regulation	2017 regulation

CS8451 Design and Analysis Of Algorithms Important 16 mark Questions Click Here To Download

 CS8451 Design and Analysis Of Algorithms Important 2 mark Questions

---

CS8451 Design and Analysis Of Algorithms Syllabus

---

CS8451 Design and Analysis Of Algorithms Notes

---

CS8451 Design and Analysis Of Algorithms Question Bank

---

CS8451 Design and Analysis Of Algorithms Question Paper

CS8451 Important Questions Design and Analysis Of Algorithms

CS8451 Important 2 mark Questions Design and Analysis Of Algorithms Regulation 2017 Anna University free download. Design and Analysis Of Algorithms Important Questions CS8451 pdf free download.

Sample CS8451 Important Questions Design and Analysis Of Algorithms:

1. Define Algorithm.
An algorithm is a sequence of unambiguous instructions for solving a problem in
a finite amount of time.
2.Write a short note on Algorithm Design and Analysis of Process.
o Understand the problem
o Decide onComputational DeviceExact Vs Approximate Algorithms
o Algorithm Design Techniques
o Design an algorithms
o Prove Correctness
o Analyze the Algori thm
o Code the Algorithm CS8451 Important Questions Design and Analysis Of Algorithms
3. What are the 2 kinds of Algorithm Efficiency
Time Efficiency-How fast your algorithm runs?
Space Efficiency-How much extra memory your algorithm needs?
4. How can you specify Algorithms?
Algorithms can be specified natural language or pseudo code.
5. What is Pseudo Code?
Pseudo Code is a mixture of Natural Language and Programming Language Constructs such as
functions, loops, decision making statements..etc
6. What are the Important Problem Types? CS8451 Important Questions Design and Analysis Of Algorithms
• Sorting
• Searching
• String Processing
• Graph Problem
• Combinatorial Problem
• Geometric Problem
• Numerical Problem
7.How can you Classify Algorithms
Among several ways to classify algorithms, the 2 principal alternatives are
• To group algorithms according to types of problem they solve com
• To group algorithms according to underlying design techniques they are based upon
8. What is Sorting Problem? CS8451 Important Questions Design and Analysis Of Algorithms
Sorting algorithm is rearrange the items of given list descending/ascending order. Sorting
algorithms classified into
• Stable Sorting Algorithm
• Non-Stable Algorithm
9.What is Searching Problem?
Finding a given value, called search key given set. Searching Algorithms needs more CS8451 Important Questions Design and Analysis Of Algorithms
memory space and sorted array.

Subject name	Design and Analysis Of Algorithms
Short Name	DAA
Semester	4
Subject Code	CS8451
Regulation	2017 regulation

CS8451 Design and Analysis Of Algorithms Important Questions Click Here To Download

CS8451 Design and Analysis Of Algorithms Important 16 mark Questions

---

CS8451 Design and Analysis Of Algorithms Syllabus

---

CS8451 Design and Analysis Of Algorithms Notes

---

CS8451 Design and Analysis Of Algorithms Question Bank

---

CS8451 Design and Analysis Of Algorithms Question Paper

 

IC8451 Important 16 Mark Questions Control Systems

IC8451 Important 16 Mark Questions Control Systems Regulation 2017 Anna University free download. Control Systems Important 16 Mark Questions IC8451 pdf free download.

Sample IC8451 Important 16 Mark Questions Control Systems:

1. Write the differential equation governing the mechanical rotational systems shown in the figure and find the transfer function (MAY/JUNE 2016).

2. Write the differential equation governing the mechanical rotational systems shown in the figure and find the transfer function (NOV/DEC 2013)

3. Write the differential equation governing the mechanical rotational systems shown in the figure and find the transfer function. Consider the angular displacement in J1 as θ1 (MAY/JUNE 2013) IC8451 Important 16 Mark Questions

4. Obtain the transfer function of the given mechanical system. Hence the draw electrical analogous circuits. (NOV/DEC 2014)

5. Write the differential equation governing the mechanical translational systems shown in the figure. Draw the Electrical analogous circuits. (MAY/JUNE 2015)

6. Write the differential equation governing the mechanical translational systems shown in the figure. Draw the Electrical analogous circuits. (MAY/JUNE 2013) IC8451 Important 16 Mark Questions

7. Write the differential equation governing the mechanical rotational systems shown in the figure. Draw the Electrical analogous circuits with two angular displacement θ1 and θ2 (NOV/DEC 2016)

8. Reduce the given block diagram and find the overall transfer function. (NOV/DEC 2016)

9. Reduce the given block diagram and find the overall transfer function. (NOV/DEC 2014) IC8451 Important 16 Mark Questions

10. For the system represented by the block diagram given below, evaluate the closed loop transfer
function, when input R is (i) at Station 1 and (ii) at Station 2 (NOV/DEC 2013) (16 Marks)
Signal Flow Graph Technique (8 Marks)

11. For the given signal flow graph find C(S)/R(S) using Mason’s Gain formula. (NOV/DEC 2014)

12. For the given signal flow graph find C(S)/R(S) using Mason’s Gain formula. (NOV/DEC 2013) IC8451 Important 16 Mark Questions

13. For the given signal flow graph find C(S)/R(S) using Mason’s Gain formula. (NOV/DEC 2013)

Subject name	Control Systems
Short Name	CS
Semester	4
Subject Code	IC8451
Regulation	2017 regulation

IC8451 Control Systems Important 16 mark Questions Click Here To Download

 IC8451 Control Systems Syllabus

---

IC8451 Control Systems Notes

---

IC8451 Control Systems Question Bank

---

IC8451 Control Systems Question Paper

 

IC8451 Important Questions Control Systems

IC8451 Important Questions Control Systems Regulation 2017 Anna University free download. Control Systems Important Questions IC8451 pdf free download.

Sample IC8451 Important Questions Control Systems:

1. Specify the time domain Specification? (NOV/DEC 2016, MAY/JUNE 2016)
The time domain specifications are:
 Delay time.
 Rise time.
 Settling time.
 Maximum over shoot.
 Peak time.

2. What is meant by steady state error? (NOV/DEC 2016, NOV/DEC 2015)
The difference between the desired output and the actual output of the system is called steady state error, which is indicates the accuracy and plays an important role in designing the system. IC8451 Important Questions Control Systems

3. What is dominant pole? (NOV/DEC 2016, NOV/DEC 2015, MAY/JUNE 2015)
The dominant pole is a pair of complex conjugate pole which decides the transient response of the system. In higher order systems the dominant poles are very close to origin and all other poles of the system are widely separated and so they have less effect on transient response of the system.

4. List the Standard test signal used in time domain analysis. (MAY/JUNE 2016, MAY/JUNE 2014, NOV/DEC 2015)
The standard test signals employed for time domain studies are
i. Step signal,
ii. Ramp signal,
iii. Parabolic signal and
iv. Impulse signal. IC8451 Important Questions Control Systems

5. State the effect of PI Compensation in system performance. (MAY/JUNE 2016)
The PI controller is increases the order of the system by one, which results in
reducing the steady state error. But the system becomes less stable than the original system.

6. How will you find the root locus on real axis? (MAY/JUNE 2016)
To find the root locus on real axis, choose a test point on the real axis. If the total number of poles and zeros on the real axis to the right of this test point is odd number, then the test point lies on the root locus. If it is even number means, then the test point does not lie on the root locus. IC8451 Important Questions Control Systems

Subject name	Control Systems
Short Name	CS
Semester	4
Subject Code	IC8451
Regulation	2017 regulation

IC8451 Control Systems Important Questions Click Here To Download

 IC8451 Control Systems Important 16 mark Questions

---

IC8451 Control Systems Syllabus

---

IC8451 Control Systems Notes

---

IC8451 Control Systems Question Bank

---

IC8451 Control Systems Question Paper