In general, in a recursive and non-recursive implementation of a problem (program): (A) Both time and space complexities are better in recursive than in nonrecursive program (B) Both time and space complexities are better in non-recursive than in recursive program (C) Time complexity is better in recursive version but space complexity is better in non-recursive version of the program  (D) Space complexity is better in recursive version but time complexity is better in non-recursive version of the program

1 Answer

Answer :

Answer: B

Related questions

Description : Abstraction and encapsulation are fundamental principles that underlie the object oriented approach to software development. What can you say about the following two statements? I. Abstraction allows us to focus on what something ... and II are correct. (3) Only II is correct. (4) Only I is correct.

Last Answer : (1) Neither I nor II is correct.

Description : What are the different types of complexities?

Last Answer : A: Time Complexity (Temporal COmplexity) : The measure of the total amount of computer time taken to run for completion of an algorithm is known as time complexity. Space Complexity: The measure ... amount of memory space needed to run for completion of an algorithm is known as space complexity.

Description : Which is the correct statement(s) for Non Recursive predictive parser? S1: First(α) = {t | α => * t β for some string β } => *tβ S2: Follow(X) = { a | S => * αXa β for some strings ... and S2 is correct. (C) S1 is correct and S2 is incorrect. (D) Both statements S1 and S2 are correct. 

Last Answer : (D) Both statements S1 and S2 are correct.

Description : Match the following. a) Completeness i) How long does it take to find a solution b) Time Complexity ii) How much memory need to perform the search. c) Space Complexity iii) Is the strategy guaranteed to find the solution when there in ... , b-ii, c-iii C) a-iii, b-i, c-ii D) a-i, b-iii, c-ii

Last Answer : C) a-iii, b-i, c-ii

Description : STRIPS addresses the problem of efficiently representing and implementation of a planner. It is not related to which one of the following ? (A) SHAKEY (B) SRI (C) NLP (D) None of these

Last Answer : (C) NLP

Description : Given the following statements: S1: Every context-sensitive language L is recursive. S2: There exists a recursive language that is not context sensitive. Which statement is correct? (A) S1 is not correct and S2 is ... (C) S1 is correct and S2 is not correct. (D) S1 is correct and S2 is correct.

Last Answer : (D) S1 is correct and S2 is correct. 

Description : ............... is often used to prove the correctness of a recursive function. (A) Diagonalization (B) Communitivity (C) Mathematical Induction (D) Matrix Multiplication

Last Answer : (C) Mathematical Induction

Description : Which of the following statements is false? (1) Every context-sensitive language is recursive. (2) The set of all languages that are not recursively enumerable is countable. (3) The family ... under union. (4) The families of recursively enumerable and recursive languages are closed under reversal.

Last Answer : The set of all languages that are not recursively enumerable is countable.

Description : A recursive function h, is defined as follows: h(m)=k, if m=0  = 1, if m=1 = 2h(m-1) + 4h(m-2), if m≥2 If the value of h(4) is 88 then the value of k is: (1) 0 (2) 1 (3) 2 (4) -1

Last Answer : (3) 2 

Description : State True or False. i) Binary search is used for searching in a sorted array. ii) The time complexity of binary search is O(logn). A) True, False B) False, True C) False, False D) True, True

Last Answer : D) True, True

Description : Which of the following algorithms has lowest worst case time complexity? a) Insertion sort b) Selection sort c) Quick sort d) Heap sort

Last Answer : d) Heap sort

Description : What is complexity?

Last Answer : A: Complexity refers to the measure of the performance of an algorithm.

Description : Cyclometric complexity of a flow graph G with n vertices and e edges is (A) V(G) = e+n-2 (B) V(G) = e-n+2 (C) V(G) = e+n+2 (D) V(G) = e-n-2

Last Answer : (B) V(G) = e-n+2

Description : Consider a project with the following functional units : Number of user inputs = 50 Number of user outputs = 40 Number of user enquiries = 35 Number of user files = 06 Number of external interfaces = 04 ... average, the function points for the project will be (A) 135 (B) 722 (C) 675 (D) 672

Last Answer : (D) 672

Description : Which one of the following is used to compute cyclomatic complexity ? (A) The number of regions - 1 (B) E - N + 1, where E is the number of flow graph edges and N is the number of flow graph nodes. (C) ... in the flow graph G. (D) P + 1, where P is the number of predicate nodes in the flow graph G.

Last Answer : (D) P + 1, where P is the number of predicate nodes in the flow graph G.

Description : The cyclomatic complexity of a flow graph V(G), in terms of predicate nodes is: (A) P + 1 (B) P - 1 (C) P - 2 (D) P + 2 Where P is number of predicate nodes in flow graph V(G).

Last Answer : (A) P + 1 

Description : What is the major component/components for measuring the performance of problem solving? a) Completeness b) Optimality c) Time and Space complexity d) All of the mentioned

Last Answer : d) All of the mentioned

Description : Consider an implementation of unsorted single linked list. Suppose it has its representation with a head and a tail pointer (i.e. pointers to the first and last nodes of the linked list). Given the ... the front node of the linked list. (D) Deletion of the last node of the linked list.

Last Answer : (D) Deletion of the last node of the linked list. 

Description : State True or False. i) Master Development Plan basically is a schedule of various applications to be comprised. ii) It consists of start and finish dates of a system analysis, design implementation and maintenance activities. ... B) i-False, ii-True C) i-True, ii-False D) i-False, ii-False

Last Answer : A) i-True, ii-True

Description : ……………….. level is where the model becomes compatible executable code A) Abstract level B) Application level C) Implementation level D) All of the above

Last Answer : C) Implementation level

Description : Which if the following is/are the levels of implementation of data structure A) Abstract level B) Application level C) Implementation level D) All of the above

Last Answer : D) All of the above

Description : Which one of the following is a correct implementation of the metapredicate “not” in PROLOG (Here G represents a goal) ? (A) not(G):– !, call(G), fail. not(G). (B) not(G):– call(G), !, fail. not(G). (C) not(G):– call(G), fail, !. not(G). (D) not(G):– call(G), fail. not(G):– !.

Last Answer : (B) not(G):– call(G), !, fail. not(G).

Description : For the implementation of a paging scheme, suppose the average process size be x bytes, the page size be y bytes, and each page entry requires z bytes. The optimum page size that minimizes the total overhead due to the page ... fragmentation loss is given by (A) x/2 (B) xz/2 (C) √2xz (D) (√xz)/2

Last Answer : (C) √2xz 

Description : Which of the following is true ? I. Implementation of self-join is possible in SQL with table alias. II. Outer-join operation is basic operation in relational algebra. III. Natural join and outer join operations are ... (B) II and III are correct. (C) Only III is correct. (D) Only I is correct.

Last Answer : (D) Only I is correct.

Description : Which of the following statements is correct? (A) Every class containing abstract method must not be declared abstract. (B) Abstract class cannot be directly initiated with ‘new’ operator. (C) Abstract class cannot be initiated. (D) Abstract class contains definition of implementation.

Last Answer : Answer: B,C

Description : Which of the following is not an inherent application of stack? (A) Implementation of Stack (B) Evaluation of a postfix expression (C) Job Scheduling (D) Reverse a string

Last Answer : (C) Job Scheduling

Description : Which suggests the existence of an efficient recursive algorithm for online smoothing? a) Matrix b) Constant space c) Constant time d) None of the mentioned

Last Answer : b) Constant space

Description : Which of the following is not typically a benefit of dynamic linking? I. Reduction in overall program execution time. II. Reduction in overall space consumption in memory. III. Reduction in overall space consumption on disk. IV. ... updates. (A) I and IV (B) I only (C) II and III (D) IV only

Last Answer : (B) I only 

Description : Which search uses only the linear space for searching? a) Best-first search b) Recursive best-first search c) Depth-first search d) None of the mentioned

Last Answer : b) Recursive best-first search

Description : The “Turing Machine” showed that you could use a/an _____ system to program any algorithmic task. a) binary b) electro-chemical c) recursive d) semantic

Last Answer : a) binary

Description : Which problem can frequently occur in backward chaining algorithm? a) Repeated states b) Incompleteness c) Complexity d) Both Repeated states & Incompleteness

Last Answer : d) Both Repeated states & Incompleteness

Description : State true of false. i) AWT is an extended version of swing ii) Paint( ) of Applet class cannot be overridden A) i-false, ii-false B) i-false,ii-true C) i-true, ii-false D) i-true, ii-true

Last Answer : A) i-false, ii-false

Description : Javascript and Java has similar name because ........... is/are true. (a) Javascripts syntax is loosely based on Java's syntax (b) Javascript is stripped down version of Java (c) Java and Javascript are originated from Island of Java ... only (B) (a), (b) and (c) (C) (a) and (b) (D) (a) and (c)

Last Answer : Answer: A

Description : The time and space complexity of BFS is (For time and space complexity problems consider b as branching factor and d as depth of the search tree.) a) O(bd+1) and O(bd+1) b) O(b2) and O(d2) c) O(d2) and O(b2) d) O(d2) and O(d2)

Last Answer : a) O(bd+1) and O(bd+1)

Description : Write the time & space complexity associated with depth limited search.

Last Answer : Time complexity =O (bd) ,  b-branching factor,  d-depth of tree Space complexity=o (bl)

Description : What is Difference between recursive and non recursive function?

Last Answer : A non-recursive function is simply an ordinary function. A recursive function only differs from an ordinary function in that it calls itself at some point.Recursive functions are often used to implement naturally recursive algorithms. For ... = 1 * 2 * 3 * ... * n):unsigned f (unsigned n) {if (n

Description : What is Difference between recursive and non recursive function?

Last Answer : A non-recursive function is simply an ordinary function. A recursive function only differs from an ordinary function in that it calls itself at some point.Recursive functions are often used to implement naturally recursive algorithms. For ... = 1 * 2 * 3 * ... * n):unsigned f (unsigned n) {if (n

Description : __________ do not take their decisions on measurements or estimates of the current traffic and topology. a. Static algorithms b. Adaptive algorithms c. Non - adaptive algorithms d. Recursive algorithms

Last Answer : c. Non - adaptive algorithms

Description : Write the recursive and non-recursive difference equations

Last Answer : The recursive system is described by the difference equation of the form N M =−� � y n b ( ) a y(n-k) + x(n-k) k k k k = = 1 0 The output at any instant depends upon the present and ... non-recursive system is described by the M =� y n b ( ) x(n-k) difference equation of the form k

Description : What is meant by recursive and non recursive system?

Last Answer : Prepared by Prof.S.Nagammai, HOD/EIE,KLNCE 243

Description : The control string in C++ consists of three important classifications of characters (A) Escape sequence characters, Format specifiers and Whitespace characters (B) Special characters, White-space ... and Non-white space characters (D) Special characters, White-space characters and Format specifiers

Last Answer : (C) Format specifiers, White-space characters and Non-white space characters

Description : Function points are used to measure the estimated _____ of a project.  a. complexity  b. effort required  c. program size  d. time required

Last Answer : c. program size

Description : A basic feasible solution to a m-origin, n-destination transportation problem is said to be ................... if the number of positive allocations are less than m + n – 1. (A) degenerate (B) non-degenerate (C) unbounded (D) unbalanced 

Last Answer : (A) degenerate

Description : What is the space complexity of Depth-first search? a) O(b) b) O(bl) c) O(m) d) O(bm)

Last Answer : d) O(bm)

Description : The compiled java program can run on any ..................... plateform having Java Virtual Machine (JVM) installed on it. A) program B) java C) hardware D) non java

Last Answer : C) hardware

Description :  A function point is a measure of program size based on the number and complexity of  inputs, outputs, queries, files and program interfaces.

Last Answer : Ans: True

Description : A(n) ____________ is a measure of program size based on the number and  complexity of inputs, outputs, queries, files, and program interfaces.  a. function point  b. line of code  c. project plan  d. standard module  e. workplan

Last Answer : a. function point

Description : Program Complexity:

Last Answer : Although object-oriented programming is often touted as a solution to software complexity, in fact ,overuse of inheritance can often simply replace one from of complexity with another. ... program that uses inheritance may require several multiple scans up and down the inheritance graph.

Description : How is cyclomatic complexity useful in program test? What is sequence of testing? What is testability?

Last Answer : Ans. Cyclomatic complexity measures the amount of decision logic in a single software module. It is used for two related purposes in the structured testing methodology. First, it gives the number of ... a lack of testability may hinder testing parts of the software or software requirements at all.