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.
A manufacturer of TV wants to make a profit of Tk. 300,000 on sale of 200 TV sets. It costs Tk. 10,000 each to make the first 100 TV sets and Tk. 7,500 each to make TV sets after the first 100 sets. What should be the selling price of each TV sets in Taka?
Consider the following statements in respect of sets: 1. The union over the intersection of sets is distributive. 2. The complement of the union of two sets is equal to the intersection of their complements. 3. If the difference between the two sets is equal to the empty set, then the two sets must be equal. Which of the above statements are correct?
Three statements are given, followed by three conclusions numbered I, II and III. Assuming the statements to be true, even if they seem to be at variance with commonly known facts, decide which of the conclusions logically follow(s) from the statement. Statement: All refrigerators are television sets. Some speakers are television sets. All speakers are fans. Conclusion: I. Some fans are television sets. II. Some television sets are refrigerators. III. No fans is a speaker
A queue is implemented using a non-circular singly linked list. The queue has a head pointer and a tail pointer, as shown in the figure. Let n denote the number of nodes in the queue. Let enqueue be implemented by inserting a new node at the head, and dequeue be implemented by deletion of a node from the tail. Which one of the following is the time complexity of the most time-efficient implementation of enqueue and dequeue, respectively, for this data structure?
A manufacturer of TV wants to make a profit of Tk. 3,00,000 on sale of 200 TV sets. It costs Tk. 10000 to make each of the first 100 TV sets and Tk. 7500 make each TV set after the first 100 sets. What should be the selling price of each TV set?
The given bar chat represents the Televisions Sets (TV) manufactured (in thousands) and the respective percentage of those TV Sets sold by five different companies A, B, C, D and E in 2015. Study the chart carefully and answer the question that follows. What is the ratio of the number of TV sets sold by company A to that of company B in 2015?
Consider the following two sets of LR(1) items of an LR(1) grammar. X → c.X, c/d           X → c.X, $ X → .cX, c/d           X → .cX, $ X → .x, c/d             X → .d, $ Which of the following statements related to merging of the two sets in the corresponding LALR parser is/are FALSE? 1. Cannot be merged since look aheads are different. 2. Can be merged but will result in S-R conflict. 3. Can be merged but will result in R-R conflict. 4. Cannot be merged since goto on c will lead to two different sets.
At an Electronic Data processing unit, five out of the eight program sets P,Q,R,S,T,U,V and W are to be operated daily. On any one day, except for the first day of a month, only three of the program sets must be the ones that were operated on the previous day. The program operating must also satisfy the following conditions: 1. If program P is to be operated on a day, V can’t be operated on that day. 2. If Q is to be operated on a day, T must be one of the programs to be operated after Q. 3. If R is to be operated on a day, V must be one of the programs to be operated after R. 4. The last program to be operated on any day must be either S or U. If the program sets R and W are to be operated on the first day, which of the following could be the other program on that day?
Two statements are given followed by two conclusions numbered I and II. Assuming the statements to be true, even if they seem to be at variance with commonly known facts, decide which of the conclusions logically follow(s) from the statements. Statements: All beds are sofa sets. Some sofa sets are mattresses. Conclusions: I. Some sofa set are beds. II. Some mattresses are sofa sets.