MCA (Revised)

Term-End Examination

December, 2005

MCS-024 (S) : OBJECT ORIENTED TECHNOLOGIES AND JAVA PROGRAMMING

Time: 3 hours
Maximum Marks: 100
Note : Question number 1 is compulsory. Answer any three questions from the rest

1. (a) What is a global variable ? Explain two major problems that may occur due to global
variables. (5)

(b) What is inheritance ? Explain two benefits of inheritance, with an example of each. (5)

(c) “One object in Java can be assigned as reference to another object of the same type.” To
explain this concept write a complete Java program and explain how a reference object works.
(5)

(d) What is a constructor ? Write a Java program to explain how super class constructors are
called in their subclasses. (5)

(e) What is multithreading ? Explain this with an example of how interthread communication
takes place in Java. (5)

(f) Explaln how a string class object can be created using an existing ‘String Buffer’ object. Also,
explain how can you find the location of the last occurrence of ‘a’ in the string “Java
Programming”.

(g) What is a checkbox ? How would you put checkboxes on an applet ? Explain how checkbox
group is created in Java. (5)

(h) What is a datagram ? Explain how objects of the class Datagram Packet can be created. (5)

2. (a) What is an instance variable ? Explain how an instance variable of a class can have
different value for each object of that class. (5)

(b) What is encapsulation ? Explain how encapsulation provides modularity and information
hiding. (5)

(c) What is a URL connection ? Write a Java program to explain the processes of reading from
and writing to a URL. (5)

(d) What is a language paradigm ? Explain two basic features of an object oriented paradigm. (5)
3. (a) List four differences between a Java applications program and Java applet program, with
an example of each type of program. (8)

(b) Find the errors in the following Java program, and correct them. (6)

public class My_String

{
public vold main(string)
{ String str = “Java Programming”;
Str.reverse();
System.out.println(“Capacity:” + str.capacity());
}
}

(c) Write a program in Java which creates a file reference and finds the following :
(i) Path of the file;
(ii) Whether file exists or not;
(iii) Whether the file is writable or not;
(iv) Size of the file.

4. (a) What is multithreaded programming ? Explain how threads are created in Java. Explain the
need lot thread synchronization, with an example. (10)

(b) What is a package ? Explain, with an example, how name conflicts are resolved during
package import. (4)

(c) Write a program to explain how parameters are passed in an applet Program. (6)

5. (a) What is a container ? Explain how components are added to a container. What is a default
layout of an applet ? How can you change it ? (5)

(b) What is a bitwise operator ? If i is int i = 32, what will the value of i be after (5)
(i) i = < < < 3 ;
(ii) i = i + i < < < 2 ?

(c) What is JDBC ? Explain how SQL statements are written and executed in Java. (5)

(d) What is an exception ? write an exception subclass which throws an exception if the variable
age passed as argument to a method and the value of age is less than 20. (5)

MCA (Revised)
Term-End Examination

December, 2005

MCS-021 (S) : DATA AND FILE STRUCTURES

Time: 3 hours
Maximum Marks: 100
(Weightage 75%)
Note : Question number 1 is compulsory. Attempt any three questions from the rest. All
algorithms should be written nearer to ‘C’ language.

1. (a) Write an algorithm for the multiplication of two polynomials in one variable. (10)

(b) Define a Queue. Explain the operations that can be performed on a queue. How is a circular
queue implemented using arrays ? (10)

(c) Define a “strongly connected component” of a digraph. Write an algorithm for finding
strongly connected components of a graph. (10)

(d) Sort the following numbers using Quick Sort :

5, 10, 2, 16, 18, 3, 19, 41, 8
Clearly write all the steps involved in sorting the numbers. (10)

2. (a) Give simplified big-O notation for the following functions: (5)
(i) 10n3 + 6n2
(ii) 5n log n + 30n

(b) Write an algorithm for the implementation of a stack using linked list. (15)

3. (a) Define a Binary Search Tree. Write the process of insertion of a node into a Binary Search
Tree. (10)

(b) What are the properties of a Red-Black Tree ? How do AA-trees differ from Red-Black Trees
? Give an example each of a Red-Black Tree and an AA-tree. (10)

4. (a) Write at least three differences between a Circularly linked list and a Doubly linked list.
Write an algorithm for the creation and insertion operations on a Doubly linked list. (10)

(b) Write an algorithm for the implementation of a tree using arrays. (10)

5. (a) Explain Sequential File Organisation. (5)

(b) Write an algorithm for the multiplication of two sparse matrices. (15)

M.C.A. (S) DEGREE EXAMINATION, MAY 2008.

Third Semester
RDBMS
(2005 onwards)

Time : Three hours Maximum : 100 marks

Answer any FIVE questions.
All questions carry equal marks.
(5 × 20 = 100)

1. (a) What are the pitfalls of DBMS? Explain.

(b) Explain Subschema with an example.

2. (a) Explain the advantages of Relational Model.

(b) Explain the Data Control facilities in Relational Model.

3. (a) Explain Client Server architecture with a diagram.

(b) Write short notes on Physical files.

4. (a) Explain the FOUR DCL commands with example.

(b) Explain with the example how you will select distinct values using a query.

5. (a) Explain with example how tables are created and values are inserted.

(b) Explain the Object Oriented concept in Oracle.

6. (a) Explain different user interfaces of DBMS.

(b) Explain any FIVE DML commands with example.

7. (a) Explain Network system tables with example.

(b) Write short notes on Embedded SQL.

8. (a) Create a table called EMPLOYEE with fields name, id, department, age, DOB and Basic–
pay. Write queries to view.

(i) All the employees in a neat format.

(ii) Employees department wise.
(iii) Age greater than 55.
(iv) Students in a particular DOB.

(b) Explain how can you work with NULL values.

2005 Madras University M.C.A Computer Applications Micro Processor Question paper

Part A(5*2=10)
1.What is the difference between a CMP instruction and a CMPS instruction in 8086?
2.List the seven string instruction of 8086?
3.What is the function of the BHE control signal in 8086?
4.State the advantage of hankshaking over simple parallel I/O.
5.What is cache memory?Why is its capacity small?

Part B(4*5=20)

6.State and explain any two development tools available for writing assembly language programs
for 8086.
7.What are assembler directives? State any five assembler directives of 8086 and give their
meaning.
8.Distinguish between minimum mode system and maximum mode system of 8086.
9.A in terrupt with vector (75) to the base 10 hs its service routine written in memory address
location 12345 to the base M. show how this is loaded in the interrupt vector table.
10.Explain how handshaking is done. Explain any three hankshaking signals used in 8086.
11.Describe how a DRAM is constructed. Give its advantages and disadvantages over SRAM.

Part C(5*10=50)

12. a) Explain any four standard programs structures used in 8086 with examples.
or
b)Write an assembly language program for 8086 to convert a four digit BCD number stored in
the BX register into its binary equivalent and store the result in the DX register.

13. a) Write an assembly language program for 8086 to find from a character string whether the
alphabet ‘A’ occurs. If its occurs store FFFF in AX and if not store 0000 in Ax
or
b) What is Macro? With example expalin any five feature of a macro/

14. a) Describe with a diagram the architecture of the execution unit of 8086.
or
b) Describe with a block diagram the architecture of any one programmable timer/counter.

15. a) Explain with the suitable diagrams how an ADC is interfaced with 8086.
or
b) Describe in detail how a stepper motor is controlled using 8086.

16. a) Explain how an I/O Coprocessor is used with 8080.What are the uses of an I/O
Coprocessor
or
b) Bring out the salient features of 80386