Please help, trying to complete this by tonight to help me study for my exam, bu

Question

Please help, trying to complete this by tonight to help me study for my exam, but I am stuck after trying many times.

1. True/False Imperative programming paradigm systematically decompose function into more primitive functions, stopping when all functions map to program statements. 2. True/False The assignment statement is fundamental to Imperative Programming 3. True /False In terms of imperative programming a language is Turing complete if in addition to a mechanism for an assignment statement, it has control structures for sequence and conditional, and a mechanism for looping. 4- True /False A programming language is Turing complete if its programs are capable of computing any computable function. 5. True /False Data Abstract extends procedural abstraction to include data. It extends imperative notion of type by providing encapsulation of data functions a separation of interface from implementation. 6. True/False Pure functional programming is state-free and has no assignment statements but is still Turning complete. 7. True/False In Imperative and object oriented Programming, functions have lower status than variables but in functional programming, functions have same status as variables. 8. True/False object oriented Programming uses object decomposition, rather than functional decomposition (as used in Imperative paradigms). 9. True /False A language is object-oriented if it supports encapsulation with information hiding, virtual methods, and inheritance. 10. True/False In object oriented languages Polymorphism refers to the late binding of a call to one of several different implementations of a method in an inheritance hierarch 11. True False In Object oriented languages, Generics and Templates defines a family of classes parameterized by one or more types 12. True /False Prolog works backwards starting from the query. 13. True False Conjunction is denoted by a comma in Prolog. 14. True /False Prolog is non and if asked will give you all possible answers. deterministic 15. True /False Prolog is used satisfactorily to prove theorems

Explanation / Answer

1) True, in imperative programming alogirthm + data structires makes program and it produce program by decomposing function into more primitive functions, stopping when all functions map to program statements.

2) True, The assignment operator is fundamental construct in imperative programming.

3) False, In terms of imperative programming a lagnauge is truing if, in addtion to mechanism for an assignment statement, it has control structures for sequnce and conditional and mechanism for looping.

4) True, language is turing complete if any program that can be solved on turing machine can be solved using programming language.

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---