Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

Which of the following are true? (i) A programming language option does not permit global variables of any king and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation (ii) Multi-level access link (or display) arrangement is needed to arrange activation records-only if the programming language being implemented has nesting of procedures/function (iii) Recursion in programming languages cannot be implemented with dynamic storage allocation (iv) Nesting of procedures/functions and recursion require a dynamic heap allocation scheme and cannot be implemented with a stack-based allocation scheme for activation records (v) Languages which permit a function to return a function as its result cannot be implemented with a stack-based storage allocation scheme for activation records.
Consider the following statements. I. Symbol table is accessed only during lexical analysis and syntax analysis. II. Compilers for programming languages that support recursion necessarily need heap storage for memory allocation in the run-time environment. III. Errors violating the condition ‘any variable must be declared before its use’ are detected during syntax analysis. Which of the above statements is/are TRUE?
Which languages necessarily need heap allocation in the run time environment
Study the accompanying Venn diagram that represents groups of persons speaking five different languages as follows. Oblong circle = Marathi ; Rectangle = Kannada, Circle = English, Triangle = Gujarati, Equilateral quadrangle = Hindi Using above information select the false statement/s from following list. (a) Area c represent persons speaking 5 languages but area d represents persons speaking 4 languages only. (b) Areas b and d represent persons speaking same number of languages. (c) Areas f, b and e represent persons speaking same languages. (d) Areas g and h represent persons who speak two languages only. 
Consider the following statements: I. The smallest element in a max-heap is always at a leaf node II. The second largest element in a max-heap is always a child of the root node III. A max-heap can be constructed from a binary search tree in Θ(n) time IV. A binary search tree can be constructed from a max-heap in Θ(n) time Which of the above statements are TRUE?
An operator delete(i) for a binary heap data structure is to be designed to delete the item in the i-th node. Assume that the heap is implemented in an array and i refers to the i-th index of the array. If the heap tree has depth d (number of edges on the path from the root to the farthest leaf), then what is the time complexity to re-fix the heap efficiently after the removal of the element? 
United Nations has declared the year 2019 as 'Indigenous Languages Year'. The purpose is : (a) To protect the Indigenous Languages in the world. (b) To create consciousness about decaying Indigenous Languages. (c) Resurrection of declining these languages. (d) To realise the contribution of these languages to the world cultural diversity. Which of the above purpose/purposes is/are correct ?
A,B,C,D,E,G and I are seven friends who study in three different standards namely 5th, 6th and 7th such that not less than two friends study in the same standard. Each friend also has a different favorite subject namely History, Civics, English, Bangla, Science , Maths , and Economics but not necessarily in the same order. A likes Maths and studies in the 5th standard with only one other friend who likes Bangla. I studies with tow other friends . Both the friends who study with I like languages (Here languages include only Science , English and Bangla ) . D studies in the 6th standard with only one person and does not like Civics . E studies with only one friend . The one who likes history does not study in 5th or 6th standard . E does not like languages. C does not like English , Science or Civics. Which combination represents E's favorite subject and the standard in which he studies?
Which of the following statement(s) is/are TRUE? (i) The family of context-free languages are the proper subset of the family of regular languages. (ii) The family of recursive languages is a proper subset of the family of recursively enumerable languages.
A max-heap is a heap where the value of each parent is greater than or equal to the value of its children. Which of the following is a max-heap?