CS8493 Question Bank Operating Systems

CS8493 Question Bank Operating Systems Regulation 2017 Anna University free download. Operating Systems Question Bank CS8493 pdf free download.

Sample CS8493 Question Bank Operating Systems:

 

2 MARK QUESTIONS:

1. Define system process
2. What is an interrupt?
3. What is a system call?
4. What is an interrupt vector?
5. Define bootstrap program
6. Define operating system
7. What is a resource allocator?
8. What is Moore’s law?
9. What is kernel?
10. Draw the storage device hierarchy

16 MARK QUESTIONS: CS8493 Question Bank Operating Systems

1. Explain in detail the modern computer system
2. Explain the astract view of the components of a computer system
3. Explain Von Neumann architecture
4. Explain multiprocessor system
5. Explain operating system structure in detail
6. Explain computing environments
7. Explain open source operating system
8. Explain in detail the operating system services
9. Explain in detail operating system structure
10. Write about OS generation

2 MARK QUESTIONS: CS8493 Question Bank Operating Systems

1. Define Process
2. What are the Process State
3. What Is PCB?
4.Define Threads.
5. What are the types of Schedulers?
6. What is Context Switch?
7. What is Co-operative Process?
8. Define IPC.
9. What is Remote procedure Calls? CS8493 Question Bank Operating Systems
10. Define threads.

16 MARK QUESTIONS:

1. Explain the various process state
2. Explain the interprocess communication
3. Explain about remote procedure calls
4. Explain about Multi threading models
5. Consider the following set of processes with the length of the CPU burst time given in milliseconds CS8493 Question Bank Operating Systems
Process Burst Time Priority
P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2
The processes are assumed to have arrived in the order p1,p2,p3,p4,p5 all at time 0.
a.
Draw four Gantt charts illustrating the execution of these processes using FCFS,SJF,anon
preemptive priority (a smaller priority number implies a higher priority)and RR (quantum=1)scheduling.
b. CS8493 Question Bank Operating Systems
What is the turnaround time of each process for each of the scheduling algorithms
in part a?
c. What is the waiting time of each process for each of the scheduling algorithms in part a? CS8493 Question Bank Operating Systems
d. Which of the schedules in part a results in the minimal average waiting time?
6.Explain about various scheduling algorithms

 

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

CS8493 Operating Systems Question Bank Click Here To Download

CS8493 Operating Systems Syllabus

---

CS8493 Operating Systems Notes

---

CS8493 Operating Systems Important Questions

---

CS8493 Operating Systems Question Paper

CS8492 Question Paper Database Management Systems

CS8492 Question Paper Database Management Systems Regulation 2017 Anna University free download. Database Management Systems Question Paper CS8492 pdf free download.

Sample CS8492 Question Paper Database Management Systems:

1. What is a view? How can it be created? Explain with an example.
2. Discuss in detail the operators SELECT, PROJECT, UNION with suitable
examples.
3. Explain static and dynamic SQL in detail.
4. Diagrammatically illustrate and discuss the steps involved in processing a query. CS8492 Question Paper Database Management Systems
5. Give briefly about Query evaluations cost & Selection operation
6. How does a DBMS represent a relational query evaluation plan?
7. Since indices speed query processing, why might they not be kept on several search CS8492 Question Paper Database Management Systems
keys? List as many reasons as possible.
8. Consider the database given by the following schemes.
Customer (Cust_No, Sales_ Person_No ,City)
Sales_ Person(Sales_ Person_No
,Sales_ Person_Name,
Common_Prec,Year_of_Hire)
Give an expression in SQL for each of the following queries:
Display the list of all customers by Cust_No with the city in which each is
located. Select Cust No, city from Customer
List the names of the sales persons who have accounts in Delhi.
Select Sales_Person_Name from Sales_Person_Name where( select * from
customer where city = delhi) CS8492 Question Paper Database Management Systems

9. Write short notes on the following:
Data Manipulation Language (DML), Data Definition Language
(DDL) Transaction Control Statements (TCS),Data Control
Language (DCL) CS8492 Question Paper Database Management Systems

10. Consider the employee database , where the primary keys are Underlined.
employee(empname,street,city) works(empname,companyname,salary)
company(companyname,city)
manages(empname,management)
Give an expression in the relational algebra for each request.
1) Find the names of all employees who work for First Bank Corporation.

2) Find the names, street addresses and cities of residence of all employees who work for First Bank Corporation and earn more than 200000 per annum.
3) Find the names of all employees in this database who live in the same city as the company for which they work. CS8492 Question Paper Database Management Systems
4) Find the names of all employees who earn more than every employees of small Bank Corporation.

 

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

CS8492 Database Management Systems Question Paper Click Here To Download

CS8492 Database Management Systems Important Questions

---

CS8492 Database Management Systems Syllabus

---

CS8492 Database Management Systems Notes

---

CS8492 Database Management Systems Question Bank

CS8492 Question Bank Database Management Systems

CS8492 Question Bank Database Management Systems Regulation 2017 Anna University free download. Database Management Systems Question Bank CS8492 pdf free download.

Sample CS8492 Question Bank Database Management Systems:

1. What are the disadvantages of file processing system?
2. Explain the basic structure of a relational database with an example.
3. What do you mean by weak entity set? CS8492 Question Bank Database Management Systems
4. Give example for one to one and one to many relationships.
5. What is the need of normalization?
6. Write a note on functional dependencies.
7. Who is a DBA? What are the responsibilities of a DBA?
8. What is a data model? List the types of data models used.
9. What are the components of storage manager?
10. What is a data dictionary? CS8492 Question Bank Database Management Systems
11. What is an entity relationship model?
12. Define single valued and multi valued attributes.
13. What are stored, composite and derived attributes?
14. What is meant by the degree of relationship set?
15. Define weak and strong entity sets? CS8492 Question Bank Database Management Systems
16. Explain the two type’s o f participation constraint.
17. Define the two levels of data independence. CS8492 Question Bank Database Management Systems
18. Write down any two major responsibilities of a database administrator.
19. Define irreducible sets of dependencies.
20. Define the normal forms.

1. List the string operations supported by SQL?
2. List the set operations of SQL?
3. What are aggregate functions? And list the aggregate functions supported by SQL? CS8492 Question Bank Database Management Systems
4. What is the use of group by clause?
5. What is the use of sub queries? CS8492 Question Bank Database Management Systems
6. What is view in SQL? How is it defined?
7. Write a SQL statement to find the names and loan numbers of all customers who have a loan at Chennai branch.
8. Consider the following relation :
EMP (ENO, NAME, DATE_OF_BIRTH, SEX, DATE_OF_JOINING, BASIC_PAY,
DEPT) Develop an SQL query that will find and display the average BASIC_PAY in each DEPT.

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

CS8492 Database Management Systems Question Bank Click Here To Download

CS8492 Database Management Systems Important Questions

---

CS8492 Database Management Systems Syllabus

---

CS8492 Database Management Systems Notes

---

CS8492 Database Management Systems Question Paper

MA8402 Question Paper Probability And Queuing Theory

MA8402 Question Paper Probability And Queuing Theory Regulation 2017 Anna University free download. Probability And Queuing Theory Question Paper MA8402 pdf free download.

Sample MA8402 Question Paper Probability And Queuing Theory:

4. In a partially destroyed laboratory, record of an analysis of correlation data, the following results only are legible: variance of X = 9; Regression equations are 8X – 10Y + 66 = 0 and 40 X – 18 Y = 214. What are the mean values of X and Y?

5. Is poission process stationary? Justify.

6. What is a random process? When do you say a random process is a random variable?

7. What do the letters in the symbolic representation (a/b/c) (d/e) of a queueing model represent?

8. What do you mean by balking and reneging?

9. State Jackson’s theorem for an open network.

10.What do you mean by Eh in the M/Eh / I queueing model?

PART B – (5 X 16 = 80 marks)

11. (a) (i) The CDF of the random variable of X is given by

(ii) Find the moment generating function of a geometrically distributed
random variable and hence find the mean and variance. (8)
Or

(b)(i) Message arrive at a switch board in a poisson manner at an average
rate of six per hour. Find the probability for each of the following events.

(1) Exactly two messages arrive within one hour

(2) No message arrives within one hour
(3) At least three message arrive within one hour. (8)
(ii) The peak temperature T, as measured in degrees Fahrenheit, on a
particular day is the Gaussian (85, 10) random variable. What is
P(T > 100), P (T < 60) and P (70 ≤ ???? ≤ 100)? (8)

12. (a) (i) Find the equation of the regression line Y on X from the
following data:

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

MA8402 Probability And Queuing Theory Question Paper Click Here To Download

 MA8402 Probability And Queuing Theory Important Questions

---

MA8402 Probability And Queuing Theory Syllabus

---

MA8402 Probability And Queuing Theory Notes

---

MA8402 Probability And Queuing Theory Question Bank

MA8402 Question Bank Probability And Queuing Theory

MA8402 Question Bank Probability And Queuing Theory Regulation 2017 Anna University free download. Probability And Queuing Theory Question Bank MA8402 pdf free download.

Sample MA8402 Question Bank Probability And Queuing Theory:

1. (a) The marks obtained by a number of students for a certain subject is assumed to be normally distributed with mean 65 and standard deviation 5.If 3 students are taken at random from this set Find the probability that exactly 2 of them will have marks over 70? MA8402 Question Bank Probability And Queuing Theory

(b) A bag contains 5 balls and it is not known how many of them are white.
Two balls are drawn at random from the bag and they are noted to be white. What
is the change that all balls in the bag are white? MA8402 Question Bank Probability And Queuing Theory

2. (a) Out of 2000 families with 4 children each , Find how many family would you
expect to have i) at least 1 boy ii) 2 boys iii) 1 or 2 girls iv) no girls MA8402 Question Bank Probability And Queuing Theory

(b) In an Engineering examination, a student is considered to have failed, secured
second class, first class and distinction, according as he scores less than
45%,between 45% and 60% between 60% and 75% and above 75%respectively.
In a particular year 10% of the students failed in the examination and 5% of the
students get distinction. Find the percentage of students who have got first class
and second class. Assume normal distribution of marks.

3. (a) In a certain city , the daily consumption of electric power in millions of
kilowatt hours can be treated as a RV having Gamma distribution with parameters
λ = ½ and k =3.If the power plant of this city has a daily capacity of 12 million
kilowatt – hours, Find the probability that this power supply will be inadequate on
any given day? MA8402 Question Bank Probability And Queuing Theory

(b) Suppose that the life of a industrial lamp in 1,000 of hours is exponentially
distributed with mean life of 3,000 hours. Find the probability that (i) The lamp
last more than the mean life (ii) The lamp last between 2,000 and 3,000 hours (iii)
The lamp last another 1,000 hours given that it has already lasted for 250 hours. MA8402 Question Bank Probability And Queuing Theory

4. (a) Assume that 50% of all engineering students are good in mathematics.
Determine the probabilities that among 18 engineering students (i) exactly 10, (ii)
atleast 10 are good in mathematics. MA8402 Question Bank Probability And Queuing Theory

(b) The life (in years) of a certain electrical switch has an exponential distribution
with an average life of 2. MA8402 Question Bank 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 Question Bank Click Here To Download

MA8402 Probability And Queuing Theory Important Questions

---

MA8402 Probability And Queuing Theory Syllabus

---

MA8402 Probability And Queuing Theory Notes

---

MA8402 Probability And Queuing Theory Question Paper

CS8491 Question Paper Computer Architecture

CS8491 Question Paper Computer Architecture Regulation 2017 Anna University free download. Computer Architecture Question Paper CS8491 pdf free download.

Sample CS8491 Question Paper Computer Architecture:

1 Describe the main idea of ILP.

2 Illustrate the overall speedup if a webserver is to be enhanced with a new CPU which is 10 times faster on computation than an old CPU .The original CPU spent 40% of its time processing and 60% of its time waiting for I/O. BTL 3 Apply

3 List the three important properties of vector instructions.
BTL 1 Remember

4 Analyze the main characteristics of SMT processor.
BTL 4 Analyze

5 Quote the importance of loop unrolling technique.
BTL1 Remember

6 Define VLIW processor.
BTL1 Remember CS8491 Question Paper Computer Architecture

7 Express anti-dependence. How is it removed?
BTL 2 Understand

8 State the efficiency of superscalar processor.
BTL 1 Remember

9 Differentiate between strong scaling and weak scaling.
BTL 2 Understand CS8491 Question Paper Computer Architecture

10 Show the performance of cluster organization.
BTL 3 Apply

11 Compare SMT and hardware multithreading.
BTL 5 Evaluate

12 Define the Flynn classification.
BTL 1 Remember

13 Integrate the ideas of in-order execution and out-of-order execution. BTL 6 Create

14 Discriminate UMA and NUMA.
BTL 5 Evaluate CS8491 Question Paper Computer Architecture

15 Quote fine grained multithreading.
BTL 1 Remember

16 Express the need for instruction level parallelism.
BTL 2 Understand

17 Formulate the various approaches to hardware multithreading.
BTL 6 Create

18 Categorize the various multithreading options.
BTL 4 Analyze CS8491 Question Paper Computer Architecture

19 Differentiatefine grained multithreading and coarse grained multithreading. BTL 4 Analyze

20 Classify shared memory multiprocessor based on the memory access latency BTL 3 Apply

PART-B

1 i).Define parallelism and its types.
ii).List the main characteristics of Instruction level parallelism.
(4) (9) BTL 1 Remember

2 i).Give the concept of parallel processing.
ii).Summarize the challenges faced by parallel processing.
(4) (9) BTL 2 Understand

3 Express in detail about hardware multithreading.
(13) BTL 2 Understand CS8491 Question Paper Computer Architecture

4 Solve: suppose you want to achieve a speed up to 90 times faster with 100 processors. What percentage of the original computation can be sequential? (13) BTL 3 Apply

5 List the software and hardware techniques to achieve Instruction

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

CS8491 Computer Architecture Question Paper Click Here To Download

 CS8491 Computer Architecture Syllabus

---

CS8491 Computer Architecture Notes

---

CS8491 Computer Architecture Important Questions

---

CS8491 Computer Architecture Question Bank

 

CS8491 Question Bank Computer Architecture

CS8491 Question Bank Computer Architecture Regulation 2017 Anna University free download. Computer Architecture Question Bank CS8491 pdf free download.

Sample CS8491 Question Bank Computer Architecture:

1 Express the equation for the dynamic power required per transistor.
BTL 2 Understand

2 Identify general characteristics of Relative addressing mode with an example. BTL 4 Analyze CS8491 Question Bank Computer Architecture

3 Define Computer Architecture. BTL 1 Remember

4 Tabulatethe components of computer system.
BTL 1 Remember

5 Give the addressing modes in MIPS.
BTL 2 Understand

6 Interpret the instruction set Architecture.
BTL 2 Understand CS8491 Question Bank Computer Architecture

7 Differentiate DRAM and SRAM.
BTL 4 Analyze

8 Give the difference between auto increment and auto decrement addressing mode. BTL 2 Understand

9 What are the functions of control unit?
BTL 1 Remember

10 Calculate throughput and response time.
BTL 3 Apply CS8491 Question Bank Computer Architecture

11 Compose the CPU performance equation.
BTL 6 Create

12 Measure the performance of the computers:
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 CS8491 Question Bank Computer Architecture

13 Formulate the equation of CPU execution time for a program.
BTL 6 Create

14 State the need for indirect addressing mode. Give an example.
BTL 1 Remember

15 Show the formula for CPU clock cycles required for a program.
BTL 3 Apply

16 Define Stored Program Concept.
BTL 1 Remember

17 What are the various units in the computer?
BTL 1 Remember

18 Compare multi-processor and uniprocessor.
BTL 4 Analyze

19 Classify the instructions based on the operations they perform and give one example to each category.

 

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

CS8491 Computer Architecture Question Bank Click Here To Download

 CS8491 Computer Architecture Syllabus

---

CS8491 Computer Architecture Notes

---

CS8491 Computer Architecture Important Questions

---

CS8491 Computer Architecture Question Paper

 

CS8451 Question Paper Design and Analysis Of Algorithms

CS8451 Question Paper Design and Analysis Of Algorithms Regulation 2017 Anna University free download. Design and Analysis Of Algorithms Question Paper CS8451 pdf free download.

Sample CS8451 Question Paper Design and Analysis Of Algorithms:

2 MARK QUESTIONS:

1. Define brute force method
2. Write an algorithm for brute force closest –pair problem
3. Define convex hull problem
4. Define exhaustive search CS8451 Question Paper Design and Analysis Of Algorithms
5. Give formula for Manhattan distance computation
6. What is median of three partitioning?
7. Write an algorithm for binary search.
8. What is worst case complexity of binary search?
9. What is Hamiltonian circuit?
10. Define Hungarian method. CS8451 Question Paper Design and Analysis Of Algorithms

16 MARK QUESTIONS: CS8451 Question Paper Design and Analysis Of Algorithms

1. Explain selection sort and bubble sort algorithm using brute force method and analyze with examples
2. Describe Sequential search and brute force string matching using brute force method
3. Explain the following in detail CS8451 Question Paper Design and Analysis Of Algorithms
i) Closest pair problem
ii) Convex hull problem
4. Describe exhaustive search in detail
5. Explain in detail quick sorting method. Provide a complete analysis of quick sort
with example. CS8451 Question Paper Design and Analysis Of Algorithms
6. Explain in detail merge sort. Illustrate the algorithm with a numeric example. Provide complete analysis of the same.
7. Describe binary search in detail? And provide the complete analysis with example CS8451 Question Paper Design and Analysis Of Algorithms
8. Write short notes on the following
i. Strassen’s Matrix Multiplication
ii.Multiplication of largest integer.
9. Apply strassen’s algorithm to compute CS8451 Question Paper Design and Analysis Of Algorithms

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

CS8451 Design and Analysis Of Algorithms Question Paper Click Here To Download

 CS8451 Design and Analysis Of Algorithms Important Questions

---

CS8451 Design and Analysis Of Algorithms Syllabus

---

CS8451 Design and Analysis Of Algorithms Notes

---

CS8451 Design and Analysis Of Algorithms Question Bank

CS8451 Question Bank Design and Analysis Of Algorithms

CS8451 Question Bank Design and Analysis Of Algorithms Regulation 2017 Anna University free download. Design and Analysis Of Algorithms Question Bank CS8451 pdf free download.

Sample CS8451 Question Bank Design and Analysis Of Algorithms:

1. What is an Algorithm?
2. Write the Euclid’s algorithm for GCD calculation?
3. What is algorithm design Technique?
4. Differentiate time and Space efficiency?
5. Design an algorithm to compute the area and Circumference of a circle CS8451 Question Bank Design and Analysis Of Algorithms
6. List the important problem types
7. How will you measure input size of algorithms
8. Define best, worst and average case efficiency?
9. Define big oh(O),Big omega(Ω ) and big theta(Ө) notations
10. List the basic efficiency classes CS8451 Question Bank Design and Analysis Of Algorithms
11. Define recurrence relation?
12. What is non recursion relation?
13. Define nonrecursive algorithm? CS8451 Question Bank Design and Analysis Of Algorithms

16. Write an algorithm using recursive function to find the sum of n numbers.
17. What is algorithm optimality
18. List the factors which affects the running time of the algorithm.
19. What is meant by substitute methods?
20. Write the general plan for analyzing Time efficiency of recursive algorithm CS8451 Question Bank Design and Analysis Of Algorithms

16 MARK QUESTIONS: CS8451 Question Bank Design and Analysis Of Algorithms

1. Discuss in detail about fundamentals of algorithmic problem solving?
2. Explain the important problem types in detail
3. Explain the necessary steps for analyzing the efficiency of recursive algorithms
4. Explain the general framework for analyzing the efficiency of algorithm. CS8451 Question Bank Design and Analysis Of Algorithms
5. Write the asymptotic notations used for best case ,average case and worst case analysis of algorithms and Write an algorithm for finding maximum element of an array perform best , worst and average case complexity with appropriate order notations
6. Explain the method of solving recurrence equations with suitable example.
7. Explain the method of solving Non recursive equations with suitable examples CS8451 Question Bank Design and Analysis Of Algorithms
8. i)Describe the basic efficiency classes in detail.
ii) Write an algorithm for Fibonacci numbers generation and compute the following
a) How many times is the basic operation executed
b) What is the efficiency class of this algorithm
9. Solve the following recurrence relations CS8451 Question Bank Design and Analysis Of Algorithms

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

CS8451 Design and Analysis Of Algorithms Question Bank Click Here To Download

CS8451 Design and Analysis Of Algorithms Important Questions

---

CS8451 Design and Analysis Of Algorithms Syllabus

---

CS8451 Design and Analysis Of Algorithms Notes

---

CS8451 Design and Analysis Of Algorithms Question Paper

IC8451 Question paper Control Systems

IC8451 Question paper Control Systems Regulation 2017 Anna University free download. Control Systems Question paper IC8451 pdf free download.

Sample Questions from IC8451 Question paper Control Systems

1. For the system described byC S Show the nature of the timeresponse.
BTL 3
Applying
2. Classify the time domain specifications. BTL 3 Applying
3. Define Delay time, Rise time, Peak time. BTL 1 Remembering
4. Define Step, Ramp & Parabolic signal BTL 1 Remembering
5. Calculate the acceleration error coefficient for
Applying IC8451 Question paper Control Systems
6.Evaluate the type and order of the system.
BTL 5 Evaluating IC8451 Question paper Control Systems
7. How is a system classified depending on the value of damping? BTL 2 Understanding
8. Give the type and order of the following system.
G S H S BTL 2 Understanding
9. What is steady state error? Mention the 3-different static error constants. BTL 2 Understanding IC8451 Question paper Control Systems
10. Distinguish between type and order of the system. BTL 4 Applying
11. List the drawback of static coefficients. BTL 1 Remembering
12. Give the relation between static and dynamic error coefficients. BTL 1 Remembering IC8451 Question paper Control Systems
13. Explain the need for a controller and different types of controller. BTL 5 Evaluating IC8451 Question paper Control Systems
14. State the basic properties of root locus. BTL 1 Remembering
15. Give the transfer function G(s) of a PID Controller.

16. What is the effect on system performance when a Proportional Controller is used
in a system?.
BTL 6 Creating
17. Infer why derivative controller is not separately used in control systems. BTL 4 Analyzing IC8451 Question paper Control Systems
18. Explain about the PI Controller. BTL 4 Analyzing
19. Express the PID Controller Equation. BTL 2 Understanding
20. Generalize the effect of PI Controller on the system performance.

1. Define the terms (i) Phase margin (ii) Gain margin (iii) Gain
Cross-over frequency (iv) Phase Cross-over Frequency.
BTL 1 Remembering IC8451 Question paper Control Systems
2. Give the advantages of Frequency response analysis.

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

IC8451 Control Systems Question Paper Click Here To Download

 IC8451 Control Systems Syllabus

---

IC8451 Control Systems Notes

---

IC8451 Control Systems  Important Questions

---

IC8451 Control Systems Question Bank