CS9212 DATA STRUCTURES AND ALGORITHMS Question Paper

M.E/M.Tech DEGREE EXAMINATION, JANUARY 2010

First Semester

Computer Science and Engineering

CS9212 – DATA STRUCTURES AND ALGORITHMS

(Common to M.Tech- Information Technology)

(Regulation 2009)

Time: Three hours Maximum: 100 Marks

Answer all the questions

Part A – (10*2=20 Marks)

1. Consider the two functions f (n) =3n^2+5 and g (n) =n^2. Prove with graphical representation that asymptotic upper bound of f (n) is g (n)?
2. Solve the recurrence equation of Merge sort to show that the worst-case complexity is
O (nlogn)?
3. Define Null Path length? What is the role of NPL in Leftist Heap?
4. Is the height of every tree in a Binomial heap that has n elements O (log n)? If not what is the worst-case height as a function of n?
5. What is the maximum and minimum height of a binary tree with 28 nodes? Mention the suitable tree traversal to sort the values in increasing order?
6. Compare the worst case height of a red-black tree with n nodes and that of an AVL tree with the same number of nodes?
7. Why it is necessary to have the auxiliary array billow: high in function Merge? Give an example that shows why-in-place merging is insufficient?
8. Find an optimal placement for 13 programs on three tapes T0, T1 and T2. Where the programs are of lengths 12,5.8,3,2,7,5.1,8.2,4,3,11,10, and 6.
9. Give an example of a set of knapsack instances for which |s^i| = 2^I, 0<i<n. Your set should include one instance for each n.
10. Present a backtracking algorithm for solving the knapsack optimization problem using the variable tuple size formulation.

Part B – (5*16=80 Marks)

11. (a)(i)Discuss Strassen’s matrix multiplication as well as classical O (n^2) one. Determine when Strassen’s method outperforms the classical one. (8)
(ii)Code the divide and conquer algorithm DCHull () in C++ and last it in appropriate data. (8)

(Or)

(b)Code and distinguish the JS and FJS functions for job sequencing with suitable data. Analyze the complexities of these two functions. (16)
12. (a)Find the minimum cost path from S to T in the multistage graph of the given figure. Do this first using forward approach and then using backward approach. (16)

(Or)

(b)Give an n x n chess board, a knight is placed on an arbitrary square with coordinates (x, y). The problem is to determine (n^2-1) knight moves such that every square of the board is visited once if such a sequence of moves exists. Write a C++ program to solve this problem. (16)

M.E/M.Tech DEGREE EXAMINATION, MAY/JUNE 2010

First Semester

Computer Science and Engineering

CS9212 – DATA STRUCTURES AND ALGORITHMS

(Common to M.Tech- Information Technology)

(Regulation 2009)

Time: Three hours Maximum: 100 Marks

Answer all the questions

Part A – (10*2=20 Marks)

1. Define big Oh notation.
2. Give two examples for NP hard problem.
3. Give an example of Fibonacci heap
4. Define binomial heap.
5. Define AVL trees.
6. What is the purpose of Red black trees?
7. What is the run time complexity of Quick Sort?
8. Define the advantages of greedy algorithms?
9. What are the advantages of dynamic programming?
10. List two example problems which can be solved by back tracking.

Part B – (5*16=80 Marks)

11. (a)(i)Write algorithm to perform in order and preorder traversal of binary tree. (8)
(ii)Explain about recurrence equation with an example. (8)

(Or)

(b)(i)Explain the principle of Amortized Analysis. (10)
(ii)Write algorithm to insert a node in the beginning of a list. (6)
12. (a)Write algorithm to construct Fibonacci heap with suitable example. (16)

(Or)

(b) Write algorithm to construct Binomial heap with suitable example. (16)
13. (a)(i)Construct a B-tree to insert the following(order of the tree is 3) 5,25,3,75,4,43,6,8,10
(ii)What are the properties of Red black trees? (4)

(Or)

(b)(i)What is the need for splay trees? Give an example. (8)
(ii)Write algorithm to construct tries. (8)
14. (a)(i)Write algorithm for Quick Sort. (8)
(ii)Write intermediate steps to perform Quick Sort for the following: 5,25,4,33,6,9,47,50,2. (8)

(Or)

(b)Write algorithm for Tree Vertex Splitting. (16)
15. (a)Describe how Eight Queen’s problem can be solved using back tracking. Write the algorithm. (16)

(Or)

(b)State the Knapsack Problem and explain how it can be solved using branch and bound algorithm. (16)

MA9219 OPERATIONS RESEARCH Question Paper

M.E/M.Tech DEGREE EXAMINATION, JANUARY 2010

First Semester

Computer Science and Engineering

MA9219- OPERATION RESEARCH

(Common to M.E-Network Engineering, M.E-Software Engineering and M.Tech- IT)

(Regulation 2009)

Time: Three hours Maximum: 100 Marks

Answer all the questions

Part A – (10*2=20 Marks)

1. Explain the main characteristics of the queuing system
2. State the steady state measures of performance in a queuing system.
3. State Pollaczek-Khinctchine formula for non-Markovian queuing system.
4. Mention the different types of queuing models in series.
5. What is Monte Carlo simulation? Mention its advantages.
6. Give one application area in which stochastic simulation can be used in practice.
7. Define slack and surplus variable in a linear programming problem.
8. Mention the different methods to obtain an initial basic feasible solution of a transportation problem.
9. State the Kuhn-Tucker conditions for an optimal solution to a Quadratic programming problem.
10. Define Non-linear programming problem. Mention its uses.

Part B – (5*16=80 Marks)

11. (a) (i) Explain M/M/1 (N/FCFS) system and solve it under steady state condition. (8)
(ii) In a railway marshalling yard, goods trains arrive at a rate of 30 trains per day. Assuming that the inter-arrival time follows an exponential distribution and the service time (the time taken to bump a train) distribution is also exponential with an average 36 minutes. Calculate the following The average no of trains in the queue The probability that the queue size exceeds 10. If the input of trains increases to an average 33 per day, what will be changed in (1) and (2)? (8)

(Or)

(b) (i) Explain the model M/M/S in case of first come first serve basis. Give a suitable illustration. (8)
(ii) An automobile inspection in which there are three inspections stalls. Assume that cars wait in such a way that when stall becomes vacant, the car at the head of the line pulls up to it. The station can accommodate almost four cars waiting (Seven in station) at one time. The arrival pattern is Poisson with a mean of one car every minute during the peak hours. The service time is exponential with mean of 6 minutes. Find the average no of customers in the system during peak hours, the average waiting time and the average number per hour that cannot enter the station because of full capacity. (8)
12. (a)(i) Discuss the queuing model which applied to queuing system having a single service channel, Poisson input, exponential service, assuming that there is no limit on the system capacity while the customers are served on a first in first out basis. (7)
(ii)At a one-man barber shop, customers arrive according to Poisson distribution with a mean arrival rate of 5 per hour and his hair cutting time was exponentially distributed with an average hair cut taking 10 minutes. It is assumed that because of his excellence, reputation customers were always willing to wait. Calculate the following Average number of customers in the shop and the average no of customers waiting for a haircut. The percentage of customers who have to wait prior getting into the Barber’s chair. The percent of time an arrival can walk without having to wait. (9)

(Or)

(b)(i) Explain briefly open and closed networks models in a queue system. (8)
(ii)Truck drivers who arrive to unload plastic materials for recycling currently wait an average of 15 minutes before unloading. The cost of driver & truck time wasted while in queue is valued Rs. 100 per hour. A new device is installed to process truck loads at a constant rate of 10 trucks per hours at a cost of Rs. 3 per truck unloaded. Trucks arrive according to a Poisson distribution at an average rate of 8 per hour. Suggest whether the device should be put to use or not. (8)
13. (a)(i) Distinguish between solutions derived from simulation models & solutions derived from analytical models. (6)
(ii)Describe the kind of problems for which Monte Carlo will be an appropriate method of solution. (5)
(iii)Explain what factors must be considered when designing a simulation experiment.

(Or)

(b)(i)Discuss stochastic simulation method of solving a problem. What are the advantages & limitations of stochastic simulation? (9)
(ii)What are random numbers? Why are random numbers useful in simulation models and solutions derived from analytical models? (7)
14. (a)(i)Explain various steps of the simplex method involved in the computation of an optimum solution to a linear programming problem? (4)
(ii)Explain the meaning of basic feasible solution and degenerate solution in a linear programming problem. (4)
(iii)Solve the following LPP using the simplex method. (8)
Max z=5x1+3x2
subject to x1+x2<=2
5x1+2x2<=10
3x1+8x2<=12
X1, X2>=0

(Or)

(b)(i)What is degeneracy in transportation problem? How is transportation problem solved when demand and supply are not equal? (8)
(ii)A company has factories at F1, F2 and F3 which supply to warehouses at W1, W2 and W3. Weekly factory capacities are 200,180,120 and 150 units respectively. Unit shipping costs (in rupees) are as follows.
Warehouse
W1 W2 W3 Supply
F1 16 20 12 200
Factor F2 14 8 18 160
F3 26 24 16 90
Demand 180 120 150 450
Determine the optimal distribution for this company to minimize total shipping cost. (8)
15. (a)(i)What is meant by quadratic programming? How does a quadratic programming differ from a linear programming problem? (8)
(ii)Explain briefly the various methods of solving a quadratic programming pbm. (8)

(Or)

(b)(i)Explain the role of Lagrange multipliers in a non-linear programming problem. (6)
(ii)Solve the following quadratic programming problem: (10)
Maximize=2x1+x2-x1^2
Subject to the constraints 2x1+3x2<=6
2x1+x2<=4
And
X1,x2>=0

M.E/M.Tech DEGREE EXAMINATION, JUNE 2010

First Semester Computer Science and Engineering 

MA9219- OPERATION RESEARCH 

(Common to M.E-Network Engineering, M.E-Software Engineering and M.Tech- IT) 

(Regulation 2009) 

Time: Three hours Maximum: 100 Marks Answer all the questions 

Part A – (10*2=20 Marks)

1. Define queue discipline.
2. What do you mean by (a) steady state and (b) transient state in a queuing system?
3. Write down Pollaczek Khintchine formulae.
4. What is meant by closed queuing network?
5. Mention the types of simulation.
6. Specify any two advantages of simulation.
7. Define Basic feasible solution of a LPP.
8. Write down the mathematical formulation of a transportation problem.
9. What are the Kuhn-Tucker conditions for solving a non-linear programming problem?
10. What is Quadratic programming?

Part B – (5*16=80 Marks)

11. (a)Arrivals at a telephone booth are considered to be Poisson, with an average time of 10 minutes between one arrival and the next. The length of the phone call is assumed to be distributed exponentially. (i) What is the probability that a person arriving at the booth will have to wait? (ii)What is the average length of the queues that form from time to time? (iii)The telephone department will install a second booth when convinced that an arrival would expect to have a wait atleast three minutes for the phone. By how much must the flow of arrivals be increased in order to justify a second booth? (16)

(Or)

(b)A super market has two salesmen ringing up sales at the counters. If the service time for each customer is exponential with mean 4 minutes, and if people arrive in a Poisson fashion at the counter at the rate of 10 per hour. (i) Calculate the probability that an arrival will have to wait for service (ii) Find the expected percentage of idle time for each salesman (iii)If a customer has to wait, find the expected length of his waiting time. (16)
12. (a)An automatic car wash facility operates with only one bay. Cars arriving according to Poisson distribution with a mean of 4 cars per hour may wait in the facility’s parking lot if the bay is busy. The time of washing and cleaning a car is exponential, with a mean of 10 minutes. Cars that cannot park in the lot can wait in the street bordering the wash facility. The manager of the facility wants to determine the size of the parking lot. Suppose that a new system is installed so that the service time for all cars is constant and equal to 10 minutes, how does the new system affect the operation facility.(16)

(Or) 

(b)Consider two servers. An average of 8 customers per hour arrive from outside at server1, and an average of 17 customers per hour arrive from outside at server2. Inter-arrival times are exponential. Server1 can serve at an exponential rate of 20 customers per hour and server 2 can serve at an exponential rate of 30 customers per hour. After completing service at serve 1, half the customers leave the system and half go to server2. After completing server2, ¾ of the customers complete service and ¼ returns to server 1. 

(i)What fraction of the time is server1 idle? 

(ii) Find the expected no of customers at each server (iii)Find the average time a customer spends in the system 

(iv)How would the answers to parts (1)-(3) change if server 2 could serve only an average of 20 customers per hour. (16)

13. (a)The occurrence of rain in a city on a day depends upon whether or not it rained on the previous day. If it has rained on the previous day, the rain distribution is
Event : No rain 1cmrain 2cmrain 3cmrain 4cmrain 5cmrain Probability: 0.5 0.25 0.15 0.05 0.03 0.02 If it did not rain on the previous day, the distribution is, Event : No rain 1cmrain 2cmrain 3cmrain Probability: 0.75 0.15 0.06 0.04 Simulate the city’s weather for 10 days and determine by simulation, the total rainfall during the period. Use the random numbers 67 63 39 55 29 78 70 06 78 76 for simulation. Assume that for the 1st day of the simulation it had not rained the day before.

(Or) 

(b)Records of 100 truckloads of finished jobs arriving in a department’s check out area show the following: Checking out takes 5 minutes and checker takes care of only one truck at a time. The data is summarized in the following table: Truck Inter Arrival time: 1 2 3 4 5 6 7 8 9 10 Frequency : 1 4 7 17 31 23 7 5 3 2 (total=100) As soon as the trucks are checked out, the truck drivers take them to the next departments. Using Monte-Carlo simulations determine: What is the average waiting time before service? What is likely to be the largest?

14. (a)Use two phase simplex method to solve the problem.
Minimize Z= ((15/2) x1) – (3x2) Subject to the constraints 3x1 - x2 - x3>=3 X1 – x2 + x3>=2 And x1, x2, x3>=0

(Or) 

(b)A company has 5 jobs to be done. The following matrix shows the return in rupees on assigning ith (i=1, 2, 3, 4, 5) machine to the jth job (j=A, B, C, D, E). Assign the five jobs to the five machines so as to maximize the total expected profit. A B C D E 1 5 11 10 12 4 2 2 4 6 3 5 Machine 3 3 12 5 14 6 4 6 14 4 11 7 5 7 9 8 12 5

15. (a)Find the dimensions of a rectangular parallelepiped with largest volume whose sides are parallel to the coordinate planes, to be inserted in the ellipsoid, G(x, y, z) = ((x^2/a^2) +(y^2/b^2) + (z^2/c^2)-1) =0 (Or) (b)Apply Wolfe’s Method for solving the quadratic programming problem Maximize Z=4x1+6x2 – (2(x1^2)) - 2x1x2 – (2(x2^2)) Subject to X1+2x2<=2 And x1,x2>=0

CS9211 COMPUTER ARCHITECTURE Question Paper

M.E/M.Tech DEGREE EXAMINATION, JANUARY 2010

First Semester

Computer Science and Engineering

CS9211 – COMPUTER ARCHITECTURE

(Common to M.Tech - Information Technology)

(Regulation 2009)

Time: Three hours Maximum: 100 Marks

Answer all the questions

Part A – (10*2=20 Marks)

1. What is hazard? State its types.
2. Mention the techniques available to measure the performance.
3. What is dynamic scheduling?
4. Give the limitation of ILP.
5. Distinguish between hardware and software speculation mechanisms.
6. What is static branch prediction?
7. What are the synchronization issues?
8. What is multithreading?
9. Define cache miss penalty?
10. What is RAID?

Part B – (5*16 = 80 Marks)

11. (a)How does one classify ISA? Discuss their design issues. (16)

(Or)

(b)What is pipelining? Explain various hazards involved in implementing pipelining. (16)
12. (a)Explain the instruction level parallelism with dynamic approaches. (16)

(Or)

(b)What is dynamic hardware prediction? Explain it in detail. (16)
13. (a)Explain the different hardware support for exposing ILP. (16)

(Or)

(b)Explain the different hardware support for more parallelism. (16)
14. (a)Explain distributed shared memory architecture with necessary life cycle diagram. (16)

(Or)

(b)(i)Differentiate software and hardware multithreading approaches. (8)
(ii)Explain the models of memory consistency. (8)
15. (a)How does one reduce cache miss penalty and miss rate? Explain. (16)

(Or)

(b)What are the ways available to measure the I/O performance? Explain each of them in detail. (16)

M.E/M.Tech DEGREE EXAMINATION, JUNE 2010

First Semester

Computer Science and Engineering

CS9211 – COMPUTER ARCHITECTURE

(Common to M.Tech - Information Technology)

(Regulation 2009)

Time: Three hours Maximum: 100 Marks

Answer all the questions

Part A – (10*2=20 Marks)

1. State the principle of locality and its types.
2. What are the choices for encoding instruction set.
3. What is speculation? Give an example.
4. Mention the effects of imperfect alias analysis.
5. What is loop unrolling?
6. Give the uses of sentinel.
7. Define multiprocessor cache coherence.
8. What are the approaches used for multithreading?
9. Which block should be replaced on a cache Miss?
10. How is cache performance improved?

Part B – (5*16=80 Marks)

11. (a)(i)Explain the operations designed for media and signal processing. (10)
(ii)Explain the ways in which a computer architect can help the compiler writer. (6)

(Or)

(b)(i)Discuss the addressing modes used for signal processing instructions. (7)
(ii)Describe the addressing modes and instructions designed for control flow. (9)
12. (a)Explain the techniques to overcome data hazards with dynamic scheduling. (16)

(Or)

(b)Describe the limitations of Instruction level Parallelism. (16)
13. (a)(i)Explain the basic VLIW approach used for static multiple issues. (8)
(ii)Enumerate the crosscutting issues in hardware and s/w speculation mechanisms. (8)

(Or)

(b)(i)Explain the hardware support for exposing more parallelism at compile time. (8)
(ii)Describe the basic compiler techniques for exposing ILP. (8)
14. (a)(i)Describe the design challenges in SMT processors. (8)
(ii)Discuss the performance of shared memory multiprocessors. (8)

(Or)

(b)(i)Explain synchronization mechanisms designed for large scale multiprocessors. (9)
(ii)Discuss the details of memory consistency models. (7)
15. (a)(i)Explain the concept of miss penalty and out of order execution in processors. (6)
(ii)Discuss the methods of interface between CPU and memory. (10)

(Or)

(b)Discuss in detail the different levels of RAID. (16)

CS9223 ADVANCED SYSTEM SOFTWARE Question Paper

M.E. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2010

Second Semester

Computer Science and Engineering

CS 9223 — ADVANCED SYSTEM SOFTWARE

(Regulation 2009)

Time : Three hours Maximum : 100 Marks

Answer ALL questions

PART A — (10 × 2 = 20 Marks)

1. What is Lex compiler?
2. List the importance of device drivers.
3. Differentiate local symbol table from global symbol table.
4. What is ICAN for intermediate code?
5. Define Alias analysis.
6. What do you mean by local stack frame?
7. What are the two parts of a P-Code virtual machine?
8. State the features of CLI.
9. What do you mean by code-location problem?
10. Name the various classes of Grid users.

PART B — (5 × 16 = 80 Marks)

11. (a) (i) Explain the different phases of a compiler. (8)
(ii) Discuss the issues in the design of a code generator. (8)

Or

(b) (i) Describe the memory management strategies. (8)
(ii) Explain the dynamic binding of method calls to methods. (8)
12. (a) (i) Explain the structure of symbol table. (8)
(ii) Discuss the features of high level, medium level and high level
languages. (8)

Or

(b) Explain the Optimization in detail. (16)
13. (a) Explain the leaf routine optimization and shrink wrapping. (16)

Or

(b) Discuss the following:
(i) Code scheduling (8)
(ii) Speculative scheduling (8)
14. (a) Explain the Java Virtual Machine architecture in detail. (16)

Or

(b) Describe the various garbage collectors. (16)
15. (a) (i) Discuss the instruction set issues of IA-32. (8)
(ii) Explain the migration of Virtual Machines in VMotion. (8)

Or

(b) (i) What is profiling? Explain the profiling during interpretation. (8)
(ii) Discuss the characteristics of an ideal grid. (8)
———————————

M.E. DEGREE EXAMINATION, JUNE 2010

Second Semester

Computer Science and Engineering

CS9223 — ADVANCED SYSTEM SOFTWARE

(Regulation 2009)

Time : Three hours Maximum : 100 Marks

Answer ALL Questions

PART A — (10 × 2 = 20 Marks)

1. What is the use of lexical analyzer?
2. What is device driver?
3. Draw the symbol table structure.
4. Differentiate high level languages from medium level languages.
5. What do you mean by in-line expansion?
6. What is the advantage of code sharing?
7. Write down the features of object-oriented virtual machine.
8. List the steps involved in garbage collection.
9. What do you mean by emulation?
10. What are the issues in instruction set?

PART B — (5 × 16 = 80 Marks)

11. (a) (i) Explain the parameter passing methods. (8)
(ii) Explain the steps involved in implementing subprograms. (8)

Or

(b) (i) Explain the dynamic binding of method calls. (8)
(ii) Describe the memory management unit. (8)
12. (a) Discuss the local and global symbol table formats and their management.
(16)

Or

(b) What is the need for optimization? Discuss the early and loop
optimization techniques. (16)
13. (a) Discuss the following:
(i) Shrink wrapping (8)
(ii) Register allocations and assignment. (8)

Or

(b) Explain the logic behind speculative scheduling and instruction
scheduling with their relative merits and demerits. (16)
14. (a) Discuss the java virtual machine architecture. (16)

Or

(b) Explain the following:
(i) Various issues in dynamic class loading (8)
(ii) Security issues in virtual machines. (8)
15. (a) Discuss the various issues in profiling and migration. (16)

Or

(b) Give two examples for the real world implementation of system software
and discuss any one of it. (16)
———————————

M.E./M.Tech. DEGREE EXAMINATION, JUNE 2011.

M.E. — Computer Science and Engineering

Second Semester

241206 — ADVANCED SYSTEM SOFTWARE

(Regulation 2010)

Time : Three hours Maximum : 100 marks

Answer ALL questions.

PART A — (10 x 2 = 20 marks)

1. What is the use of symbol table?
2. List the possible actions of a shift reduce parser.
3. What are the issues in designing an intermediate languages?
4. How do you identify the induction variables used in loop optimization?
5. Differentiate register allocation and register assignment.
6. What do you meant by Speculative scheduling?
7. What are the key features of network oriented High Level Languages Virtual
machines?
8. What is the function of system virtual machine and process virtual machine?
9. Define Emulation, Interpretation, Binary Translation.
10. What are the advantages of profiling?

PART B — (5 ´ 16 = 80 marks)

11. (a) (i) Explain about the various phases of compiler with a neat sketch. (8)
(ii) Discuss in detail about the various methods of parameter passing.
(8)

Or

(b) Construct the SLR Parsing table for the following grammar.
E ® E + T / T
T ® T* F / F
F ®F* | a / b. (16)
12. (a) Summarize the syntax, semantics, instructions set, operations and
functions used in LIR, HIR, MIR of intermediate language. (16)

Or

(b) (i) Discuss about what are the symbol attributes in symbol table
entries and its purpose. (6)
(ii) Explain briefly about how do you manage a local symbol table and
global symbol table structure. (10)
13. (a) (i) Explain about the register allocation mechanism by graph coloring
with suitable example graph. (8)
(ii) Explain briefly about the inter procedural and intra procedural
methods for improving instruction cache hit rate. (8)

Or

(b) Explain briefly about the various approaches of software pipelining in code
scheduling. (16)
14. (a) Explain briefly about the functions of memory hierarchy used by a Java
program and Java instruction set in Java Virtual Machine Architecture.
(16)

Or

(b) Discuss about the following Garbage collectors:
(i) Mark-and-Sweep Collectors (5)
(ii) Copying Collectors (5)
(iii) Compacting Collectors. (6)

15. (a) Explain briefly about the various issues of instruction set emulations in
the case of translating and interpreting a complete instruction set. (16)

Or

(b) Explain about the major functional blocks and data structures of a
process virtual machine with neat diagram. (16)
–––––––––––

CS9221 DATABASE TECHNOLOGY Question Paper

Question Paper Code : 31283
M.E./M.Tech. DEGREE EXAMINATION, JUNE 2011.
Common to M.E. Computer Science and Engineering/ M.E. Computer
and Communications
Second Semester

241204 — DATABASE TECHNOLOGY
(Regulation 2010)

Time : Three hours Maximum : 100 marks

Answer ALL questions.

PART A — (10 ´ 2 = 20 marks)
1. State the advantages of distributed databases.
2. List the types of data fragmentation? Give reasons for fragmenting a relation
in the distributed system.
3. What is persistence in object oriented data base? Why it is important?
4. How does the concept of an object in the object-oriented model differ from the
concept of an entity in the entity-relationship model?
5. Compare and contrast data warehouse and operational database.
6. Specify the different categories of data available in the Mobile databases.
7. How do spatial databases differ from regular databases?
8. What is multivalued dependency? Specify the procedure for eliminating it from
a relation.
9. Mention the applications of deductive databases.
10. What are the different types of multimedia sources?



PART B — (5 ´ 16 = 80 marks)

11. (a) Explain the issues that are addressed for a distributed database design.
(16)
Or
(b) (i) During the transaction execution, it passes through several states,
until it finally commits or aborts. List all possible sequences of
states through which a transaction may pass. Explain why each
state transition may occur. (6)
(ii) Consider the following undo/redo log with check pointing (CKPT).
The third and fourth values in entries that have 4 values are the
old and the new value, respectively.
<START, T1>
<T1, A, 4, 5>
<START,T2>
<T2, B, 9, 10>
<START CKPT (T1; T2)>
<COMMIT T2>
<START T3)>
<T3, C, 14, 15>
<END CKPT>
<COMMIT T3>
<COMMIT T1>
Suppose that there is a crash, and the last log entry to appear on
disk is <T2, B, 9, 10>.That is; only the first 4 log entries shown
above actually appear in the log. The remaining 7 entries are never
recorded on the log. Describe the actions of the recovery manager,
including changes to both the disk and log. Describe the actions at
recovery time. Specify the actions happened in the disk and log for
both the cases. (10)
12. (a) (i) What are main features of object oriented database? How it is
advantageous over RDBMS? (8)
(ii) Compare inheritance in the Extended ER model to inheritance in
the Object Oriented model with an example. (8)
Or
(b) Discuss in detail about the concurrency control in object oriented
databases. (16)
2120 2120 2120 2120
3 31283
13. (a) (i) Explain the various client/server architectures commonly used in
the database environment. (8)
(ii) Explain web databases in details. (8)
Or
(b) (i) What is data mining? How does data mining technology relate to
data warehousing technology? (8)
(ii) Describe the steps of building a data warehouse. (8)
14. (a) What is meant by the term heuristic optimization? Discuss the main
heuristics that are applied during query optimization. (16)
Or
(b) Suppose that a city transportation department would like to perform
data analysis on highway traffic for the planning of highway construction
based on the city traffic data collected at different hours every day.
Design a spatial data base for the given scenario ,to store the highway
traffic information such as average and peak time traffic flow by
highway, by time of day, and by weekdays, and the traffic situation
when a major accident occurs. (16)
15. (a) Discuss the features of active databases and deductive databases. (16)
Or
(b) (i) What are parallel databases? What are its benefits? (8)
(ii) Explain multimedia databases in detail. (8)
———————

Question Paper Code: J7658

M.E. DEGREE EXAMINATION, JUNE 2010
Second Semester
Computer Science and Engineering
CS9221 — DATABASE TECHNOLOGY
(Common to M.E. Computer and Communication)
(Regulation 2009)
Time : Three hours Maximum : 100 Marks

Answer ALL Questions
PART A — (10 × 2 = 20 Marks)
1. What is Fragmentation?
2. What is Concurrency Control?
3. What is Persistence?
4. What is Transaction Processing?
5. What is Client/Server Model?
6. What is the difference between data warehousing and data mining?
7. Why do we need Normalization?
8. What is Integrity?
9. Give two features of Multimedia Databases.
10. What are Deductive Databases?


PART B — (5 × 16 = 80 Marks)

11. (a) Explain the architecture of Distributed Databases.
Or
(b) Write notes on the following :
(i) Query processing. (8)
(ii) Transaction processing. (8)
12. (a) Discuss the Modelling and design approaches for Object Oriented
Databases.
Or
(b) Explain the Multi-Version Locks and Recovery in Query Languages.
13. (a) Discuss in detail Data Warehousing and Data Mining.
Or
(b) Discuss the features of Web Databases and Mobile Databases.
14. (a) With an example, explain E-R Model in detail.
Or
(b) Explain the features of Temporal and Spatial-Databases in detail.
15. (a) Explain the features of Parallel Databases and Text Databases in detail.
Or
(b) Discuss the Rules, Knowledge Bases and Image Databases.
——————

M.E. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2010

Second Semester

Computer Science and Engineering

CS 9221 — DATABASE TECHNOLOGY

(Common to M.E. Computer and Communication)

(Regulation 2009)

Time : Three hours Maximum : 100 Marks

Answer ALL questions

PART A — (10 × 2 = 20 Marks)

1. What is query processing?
2. Define concurrency control.
3. What is persistence?
4. Give two features of object oriented databases.
5. What is Data warehousing?
6. List any two features of web databases.
7. What is Normalization?
8. Define Integrity.
9. What are Deductive Databases?
10. Mention two features of parallel Databases.

PART B — (5 × 16 = 80 Marks)

11. (a) Compare Distributed databases and conventional databases.

Or

(b) Discuss in detail the architecture of distributed databases.
12. (a) Explain the multi–version locks and recovery in query languages.

Or

(b) Describe modeling and design approaches for object oriented databases.
13. (a) Explain the features of Data warehousing and data mining.

Or

(b) Discuss client/server model and mobile databases.
14. (a) Give the features of Temporal and spatial databases.

Or

(b) (i) Explain E–R model with an example. (8)
(ii) Discuss the optimization and research issues. (8)
15. (a) Discuss multimedia databases in detail.

Or

(b) Explain the features of active and deductive databases in detail
————––––——

ANNA UNIVERSITY, Chennai - 25 TIME TABLE FOR M.E./M.Tech. DEGREE EXAMINATIONS -JUNE/JULY-2013

ANNA UNIVERSITY, Chennai - 25
TIME TABLE FOR M.E./M.Tech. DEGREE EXAMINATIONS -JUNE/JULY-2013

click

M.E / M.Tech Admission 2013

M.E / M.Tech Admission 2013

M.E /M.Tech Admission 2013 in anna university(Kerala working professionals) pls contact this email id murugan_siva@yahoo.com