Roll No...... 479/2004 B. E. EXAMINATION (Third Semester) COMPUTER ENGINEERING CSE-203-C Programming Languages Time : Three Hours Maximum Marks : 100 Note : Attempt any Five questions. “Before answering the question-paper candidates should ensure that they have been supplied to correct and complete question-paper. ‘Complaints in this regard, if any, will not be entertained after the examination. 1, For an elementary data type in a language with which you are familiar, do the following : 20 @ Describe set of values that data objects of that type may contain, PTO.(ii) Define syntactic representation used for constants of that language. (iii) Determine whether static or dynamic type checking is used to determine the validity of each use of each operation of the type. 2. (a) Describe attributes of a vector. What aperations can be performed on a vector ? (b) Differentiate between sequential representation and linked representation of data structures. 10,10 3. (@) Differentiate between implicit and explicit sequence-control. (b) Describe the problems of evaluation of tree representation of the expressions. 10,10 4, (a). Differentiate between call by yalue-result and call by constant-value technique of parameter passing. (b) Consider the following program. Give three numbers printed in the case thet y is trans- mitted to p (@) by value Gi) by reference (ili) by name. “479/204 2program ‘main (....): var Y : integer, Procedure P (X : integer); begin Xi2X+h write (X,Y); and; begin ¥Y 5 PCY); write (¥); vend. 10,10 5, Differentiate between heap storage management and stack-based storage management, 20 6. (a) Deseribe the concept of subprogram sche- duling. (&) Desctibe the issues to be addressed while considering parallelism in programming languages. 10,10 7. (8) Differentiate between C and C-+ on the basis of data objects and sequence control. (b) Differentiate between procedural and nonprocedural programming languages. 15,5 47912004 3 PTO.