Documente Academic
Documente Profesional
Documente Cultură
com
UNIT-I
1. a) Explain the activities of Language processing.
b) With example explain the phases and passes of a language processor.
(OR)
2. Explain the search data structures.
UNIT-II
3. a) Explain a Finite State Automation.
b) Explain deterministic finite state automation.
(OR)
4. a) With example explain the implementation of top down parsing.
b) Explain the design of a two pass assembler.
UNIT-III
5. a) Explain Macro definition and call.
b) Explain Macro expansion.
(OR)
6. a) Explain three important tasks in memory allocation
b) Explain the compilation of controller structures.
UNIT IV
7. Explain how you can reduce the relocation request of a program.
(OR)
8. Explain the linker for MS DOS.
UNIT V
9. a) Explain various types of editors.
b) What is a software tool.
(OR)
10. What are debug monitors explain.
Visit: kumca2010.xtgem.com
UNIT-I
1. a) Discuss the main characteristics of the Database approach. Compare each charcteristic
with traditional file system. (7)
b) Briefly describe the database system environment and different component modules of
DBMS. (7)
UNIT-II
3. What is ER model? Discuss ER model with suitable example with notion and convention
used
to draw ER diagram. (14)
(OR)
4. Design a generalization – specialization hierarchy for a motor vehicle sales company. The
company sells motor cycles, passenger cars, vans and buses. Justify th placement of
attributes at each level of the hierarchy. Explain all the assumptions you make.
(14)
UNIT-III
5. a) Discuss various JOIN operation of relations algebra with example. (7)
b) Compare tuple calculus and domain calculus with example. (7)
(OR)
6. a) Give the complete syntax of SQL select statement. Explain all the phrases of select
statement. (7)
b) How a view is created in the database? Explain Triggers with an example. (7)
7. a) What is functional dependency? Discuss how normalization uses functional dependency.
(7)
b) Explain 2NF and 3NF with suitable examples.
Visit: kumca2010.xtgem.com
(OR)
UNIT-IV
9. a) What is a Transaction? Explain ACID properties of Transaction.
b) Explain Basic Time Stamp Ordering protocol for Concurrency control.
(OR)
10. a) Explain validation concurrency control techniques.
b) What are different types of Distributed database systems?
Visit: kumca2010.xtgem.com
UNIT-I
1. a) Write a program to test various operations of the class clock type.
b) Explain with examples data abstraction, classes and abstract data types.
(OR)
2. a) Explain the difference between a shallow cop and a deep copy of data.
b) Draw the UML diagram of the class polynomial type. Also show the Inheritance
hierarchy.
UNIT-II
3. a) Explain some important properties of linked list.
b) Explain with example how an item is inserted and deleted from linked list.
(OR)
4. a) Explain how class defines the linked list as an ADT.
b) Write a program to test various operations of the class doubly linked list.
UNIT-IV
5. a) Explain the tower of Hanoi problem with 3 disks and give its solution.
b) Write a recursive function that finds and returns the sum of the elements of an int array.
Also write a program to test your function.
(OR)
6. a) What are the advantages of open hashing?
b) Give a numerical expression to show that the collusion resolution by chaining isbetter
than
Quadratic probing.
UNIT-V
7. a) Explain how stacks are implemented as arrays.
b) Write equivalent infix expression for the following postfixexpressions.
i) ab*c+
Visit: kumca2010.xtgem.com
ii) ab+cd-*
iii) ab-c-d*
(OR)
8. a) Explain linked list implementation as stacks.
b) Write a program that uses a stack to print the prime factor of a positive integer in
descending
order.
UNIT-V
9. a) The following keys are inserted (in the order given ) into an initially empty AVL Tree
show
AVL tree after insertion 24, 39, 31, 46, 48, 34, 19, 5, 29.
b) Write the definition of the class template that implements an AVL tree as an ADT.
(OR)
10. a) Write a program that outputs the minimal spanning tree for a given graph.
b) Write a program that outputs the nodes of a graph in depth first traversal.
Visit: kumca2010.xtgem.com
b) Explain and illustrate the any two disk scheduling algorithms with examples. (7)
(OR)
10. Describe the following Kernal I/O subsystem services: (14)
i) Buffering.
ii) Caching.
Iii) Error handling.
Second Semester
PROBABILITY AND STATISTICS(Regulation 2010-11)
Time:3hrs Maximum: 70M