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

CS9228 Web Technology Lab

CS9228 Web Technology Lab

Newversion
Indexpage&Record


Older version
Record Soft Copy

Index Page

CS9227 Operating System Lab

CS9227 Operating System Lab

Record Soft copy

Index Page

CS9223 ADVANCED SYSTEM SOFTWARE

CS9223 ADVANCED SYSTEM SOFTWARE

UNIT I

Basic Compiler Functions – Grammars – Lexical Analysis – Syntactic Analysis – Code Generation – Heap Management – Parameter Passing Methods – Semantics of Calls and Returns – Implementing Subprograms – Stack Dynamic Local Variables – Dynamic binding of method calls to methods – Overview of Memory Management, Virtual Memory, Process  Creation – Overview of I/O Systems, Device Drivers, System Boot

UNIT II

Introduction and Overview – Symbol table structure – Local and Global Symbol table management Intermediate representation – Issues – High level, medium level, low level intermediate languages – MIR, HIR, LIR – ICAN for Intermediate code – Optimization – Early optimization – loop optimization

UNIT III

Procedure optimization – in-line expansion – leaf routine optimization and shrink wrapping – register allocation and assignment – graph coloring – data flow analysis – constant propagation – alias analysis – register allocation – global references – Optimization for memory hierarchy - Code Scheduling – Instruction scheduling – Speculative scheduling – Software pipelining – trace scheduling – Run-time support – Register usage – local stack frame – run-time stack – Code sharing – position–independent code

UNIT IV

Introduction to Virtual Machines (VM) – Pascal P-Code VM – Object-Oriented VMs – Java VM

Architecture – Common Language Infrastructure – Dynamic Class Loading – Security – Garbage Collection – Optimization

UNIT V

Emulation – Interpretation and Binary Translation – Instruction Set Issues – Process Virtual Machines – Profiling – Migration – Grids – Examples of real world implementations of system software

TEXT BOOKS:

1. Steven S. Muchnick, “Advanced Compiler Design Implementation”, Morgan Koffman –

    Elsevier Science, India, First Edition 2004

2. James E Smith and Ravi Nair, “Virtual Machines”, Elsevier, 2005. (Units 4, 5) (Sections

    1.0-1.6, 2.0-2.5, 2.8, 3.0-3.6, 4.2, 5.0-5.3, 5.5-5.6, 6.0-6.3, 6.5-6.6, 10.2, 10.3)

3. Robert W. Sebesta, “Concepts of Programming Languages”, 7th ed., Pearson Education,

   2006. (Unit 3) (Sections 6.9, 9.3, 9.5, 10.1-10.3, 12.10.2)