Answer question 29, 30, 31 showing fully all the steps. Solution should be perfect(very correct), clear, brief and explicit enough! A. Always liberate space in thecomputer memoryB. Needs an express liberation ofspace by the programmer afterremoval of element from listC. Needs simply that the element beremoved from the listD. Needs no pointer manipulation36. In debugging of a program,A. We are searching for the.availability of errorsB. We want to see howa programF. z= fyG. z= xy()x =Z H20. interrupt driven input output leads toA. wastage of CPU timeB.optimum use of CPU timeC. adequate execution of real timeprocessesD. non-execution of priority process30. The hardware instruction cycle isA. Fetch decode storeB. Fetch execute decodeC. Decode execute storeD. Fetch decode execute store31. A problem is said to be computable ifA. A solution can be foundB. The problem is a mathematicalproblemC. The problem has a feasiblemathematical solutionD. The problem is a classicalcomputer problemThe program counter (PC)A. An index number that in creasesevery time a loop is executedB. A CPU register that indicates theaddress of the next instruction in aC. We want to prove that theprogram is workingD. We are correcting errors37. The following data structures arearranged in decreasing order ofpreference in terms of search speedA. Linked-list Arrays, Binary-search,TreesB. Binary search, Trees, Linked-list,ArraysC. Binary search, Trees, Array,Linked-listD. Arrays, Linked-list, Binary-search,TreesThe function f defined asany kind32.programC. A CPU register which stores thestate of a processD. A CPU register that signals changeof context=(u)s0=u 'O

29.Interrupt driven input output leads to 30.The hardware instruction cycle is 31.A problem is said…

A. Always liberate space in the computer memory B. Needs an express liberation of space by the programmer after removal of element from list Needs simply that the element be removed from the list D. Needs no pointer manipulation 36. In debugging of a program, A. We are searching for the. availability of errors B. We want to see howa program executes C. We want to prove that the program is working D. We are correcting errors 37. The following data structures are arranged in decreasing order of preference in tems of search speed A. Linked-list Arrays, Binary-search, Trees B. Binar search, Trees, Linked-list, Arrays C. Binary search, Trees, Array, Linked-list D. Arrays, Linked-list, Binary-search, Trees 6x = 2 ()x = 2 ot driven input output leads to tage of CPU time mum use of CPU time quate execution of real time cesses execution of priority process hardware instruction cycle is Fetch decode store Fetch execute decode Decode execute store Fetch decode execute store plem is said to be computable if olution can be found of any kind e problem is a mathematical oblem problem has a feasible athematical solution e problem is a classical mputer problem rogram counter (PC) is index number that increases rery time a loop is executeda CPU register that indicates the Idress of the next instruction in a ogram CPU register which stores the ate of a process 38 The function f defined as =(u)) nf(n-1), n>0 0=u 'L context Is said to be A. A recursive function B. A composite function C. An iterative function D.A stack nested function Given the functions for n!, defined as 39. lexity which is jear garithmic olynomial ponential ary search tree (BST) is said to etter than binary search in an because in 38 (NR) above with f(n) and as nl-1x2x3x......xn (NI) A. NI runs faster than NR for all values of n B. NI takes more memory space than NR C. NI may not execute for certain values of n ne complexity is different ne BST does not use an index ne array has a limited size ne BST uses pointers while an rray does not tion of an element from a linked- 40. A low level programming language D.NR has more lines of code than NI A. Makes more system calls than a high level language