Fundamentals of



Download 9.46 Mb.
Page4/57
Date09.01.2017
Size9.46 Mb.
#8172
1   2   3   4   5   6   7   8   9   ...   57

Q. 12 What is/are the main differences between the 3rd and 4th generation languages?

(i) Both follow procedural code.



(ii) Third generation languages are mostly compiled languages.

(iii) Fourth generation languages are in-line with the minimum work and skill concept.

(iv) Third generation languages are user friendly and have intelligent default options.




(a) i & iv only

(c) c. i & iii only

(b) b. ii & iii only

(d) d. none of the above





Q. 13 Which of the features below would make the next generation of PL popular?

(i) They are highly portable and are offered on a wide range of systems .

(ii) They are suitable for development of programs of arbitrary size and complexity.

(iii) They are reasonably stable during changes in hardware and system software. (iv) They both have procedural and non-procedural features.




(a) i & ii only.

(c) iii & iv only



(b) i, iii & iv

(d) All of the above









Q. 15 Which of the following languages is the newest?

(a) C (b) Fortran (c) Lisp (d) Simula

Q. 16 Which of the following languages is the oldest?

(a)Perl (b)PHP (c)Python (d)Ruby

Q. 17 Which of the following languages introduced the notion of inheritance?

(a) Simula (b) Smalltalk (c) Algol 68 (d) C++

Q. 18 Which of the following are language processors?

(a) Assembler (b) Compiler (c) Interpreter (d) All of the above

Q. 19 A program in execution is called


(a) process (b) function

Q. 20 An assembly language is a

(a) low level programming language



(c) High level programming language

Q. 21 An assembler is

(a) Programming language dependent.



(c) Machine dependant.

(c) CPU (d) Memory
(b) Middle level programming language

(d) Internet based programming language
(b) Syntax dependant. (d) Data dependant


Q. 22 Translator for low level programming language were termed as

(a) Assembler (b) Compiler (c) Linker (d) Loader

Q. 23 What is the name of the category of programming languages whose structure is dictated by the von

Neuman computer architecture?


(a) Imperative (c) Functional (e) Constraint

(b) Denotational

(d) Non-procedural

(f) Object-oriented


Q. 24 A paradigm that allows specification of what has to be computed rather than just how a

computation is to be carried out.


(a) Imperative (c) Functional (e) Constraint

(b) Denotational

(d) Non-procedural

(f) Object-oriented


Q. 25 A paradigm incorporating encapsulation. Inheritance and dynamic type binding.


(a) Imperative (c) Functional (e) Constraint

(b) Denotational

(d) Non-procedural

(f) Object-oriented


Q. 26 Which language is considered to be the first fully object-oriented language?


(a) FORTRAN (c) LISP

(e) JAVA

(b) COBOL (d) C



(f) SMALLTALK


Q.27 In what language is UNIX written?


(a) FORTRAN (c) LISP

(e) JAVA

(b) COBOL (d) C



(f) SMALLTALK


Q. 28 What programming language has dominated scientific computing over the past 35 years?


(a) FORTRAN (c) LISP

(e) JAVA

(b) COBOL (d) C



(f) SMALL TALK


Q. 29 What programming language has dominated artificial intelligence programming over the past

35years?


(a) FORTRAN (c) LISP

(e) JAVA

(b) COBOL (d) C



(f) SMALL TALK




Q.30 What programming language has dominated business applications over the past 35 years?


(a) FORTRAN (e) JAVA

(b) COBOL

(f) SMALL TALK

(c) LISP (d) C


Q.31 What language has slogan 'write once run anywhere'?


(a) FORTRAN (c) LISP

(e) JAVA

(b) COBOL (d) C



(f) SMALLTALK


Q. 32 How is Scheme opposite to Common Lisp?

(a) Scheme is large and complex; Common Lisp is small. (b) Common Lisp is not an ANSI standard; Scheme is.

(c) Scheme is exclusively statically scoped; Common Lisp supports dynamic scoping. (d) Common Lisp is interpreted; Scheme is compiled.

Q. 33 Why must local variables in Lisp generally be allocated in the heap, rather than on the Stack

(a) Because we don't know their sizes at compile time.



(b) Because local variables in Lisp have unlimited extent.

(c) Because Lisp subroutines don't follow strict LIFO calling conventions.

(d) Because the Lisp garbage collector is unable to manipulate addresses in the stack.

Q 34 through Q 38 refer to the following program in Scheme:

(define add-n (lambda (n) (lambda (m) (+ m n))))



(let ((n 4)

(f (add-n 3))) (+ n (f 2)))

Q.34 What does this program print?

(a) 8 (b) 9 (c) 10 (d) none of the above


Download 9.46 Mb.

Share with your friends:
1   2   3   4   5   6   7   8   9   ...   57




The database is protected by copyright ©ininet.org 2024
send message

    Main page