University of Rajasthan 2008 B.Tech Information Technology Object Oriented Programming - Question Paper

B.Tech II Year (Sem. IV) Examination, MAY- 2008
Object Oriented Programming
Information Technology

[Time : three hours] [Total marks : 80]
[Min passing marks :24]


1 (a) Highlight the main features of subsequent programming paradigm:
(i) Interactive Programming
(ii) Object-Oriented Programming
(iii) Functional Programming
(iv) Logic Programming
(b) Write a grammar for If-then-else statements which does not have any ambiguity and eliminates 'dangling else' issue.
[8]

OR

1 (a)Describe the subsequent properties of good programming language:
(i) Abstraction
(ii) Orthogonality
(iii) Clarity about binding
(iv) Reliability and support

(b)Consider the expression x+y/z in the language C. How many various meanings does this expression have, depending on the kinds of x and y?

(c) Write a regular grammar for subsequent regular expression:
(111+100)*0


2 (a) There is an equivalence of arrays and pointers in C/C++. discuss

(b) define the implementation of structures and unions.

OR

2 (a) define the implementation of character string in programming languages.
(b) define kind conversion and kind equivalence roles used for programming language.



3 (a)Consider the subsequent C-like program:
void swap(int [] list, int i, int j)
{
int temp=list[i];
list[i]=list[j];
list[j]=temp;
}
void main()
{
int x[3]={5,2,4};
swap(x,1,2);
}
What is the final value of the array x for every of the subsequent parameter passing assumptions?
(i) Argument x is passed by value
(ii) Argument x is passed by reference
(iii) Argument x is passed by value-result.

(b) What is exception? How these exceptions are handled and propagated to other programs?



OR

3 (a) define sequence control methods for recursive subprograms?

(b)What are activation records? How are they useful in subprogram calls?


4 (a) discuss implementation of dynamic arrays.

(b) explain the issue of garbage, dangling references, and fragmentation that outcomes with every of these possible implementations of 'new' and 'dispose' (free).

OR

4 (a) explain all the elements of a program which require storage. discuss how references counts help in garbage collection and recovery?
(b) discuss subsequent terms in object-oriented programming, abstract data types, visibility and info hiding, templates.


5 (a) define life cycle of a Thread. define the Thread synchronization mechanism in JAVA.

(b) What do you mean by raceconditions and deadlocks. discuss a mechanism for synchronizing access to the shared

OR

5 (a) Write monitor constructs for solving synchronization issue pf producer-consumer issue.

(b) discuss message passing mechanism for synchronization. Write a protocol using message passing for solving producer-consumer issue.

Earning:   Approval pending.