Tag: Introduction to Programming Languages

(A) spacifing the syntex of a language
(B) spacifing a context free grammer
(C) discribing how a program works
(D) both a and b

(A) Simplex method for solving a liner programing problem
(B) Newton-Raphson Method for finding the roots of an equation
(C) 8 Queen’s problem
(D) both a and b

(A) l-value
(B) either l-value or r-value
(C) r-value
(D) none of the above

(A) when seprately compiled modulus are being linked together
(B) during loading
(C) while writing a program
(D) none of the above

(A) In general there is always an ittative equivilant of a recrusive information
(B) Recrusion and itiation are equally powerful
(C) In itiation the body is carried out to completion before the condition of termination is started
(D) All of the above

(A) it include symbols that are not present in keyboard
(B) it does not have a well defined syntex
(C) it is anbiguos
(D) Computers do not understand English

(A) only A and B are variable parameters
(B) only B and C are variable parameters
(C) only A and C are variable parameters
(D) all variable parameters

(A) :
(B) :#
(C) end
(D) <