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.
Three statements are given followed by four conclusions numbered I, II, III and IV. Assuming that the statements are true even if they seem to be at variance from commonly known facts, decide which of the conclusions logically follows from the statements. Statements: 1. All carpets are beds. 2. Some tables are carpets. 3. All pillows are tables. Conclusions: I. All pillows are beds. II. Some pillows are beds. III. Some beds are tables. IV. All tables are beds.
Five tables T1, T2, T3, T4 and T5 are kept one above the other (Not necessarily in the same order) Number of tables above T4 are same as the number of tables below T5. T3 is just above T1. T5 is at the bottom. There are two tables between T2 and T5. Which of the following is the correct position of T1?
Statements : Some tables are TVs. Some TVs are radios.

Conclusions :
I. Some tables are radios.
II. Some radios are tables.
III. All radios are TVs.
IV. All TVs are tables.
Statements : Some tables are T.V. Some T.V. are radios.

Conclusions :
I. Some tables are radios.
II. Some radios are tables.
III. All the radios are T.V.
IV. All the T.V. are tables.
Ranjan purchased 120 tables at a price of Rs. 110 per table. He sold 30 tables at a profit of Rs. 12 per table and 75 tables at a profit of Rs. 14 per table. The remaining tables were sold at a loss of Rs. 7 per table. What is the average profit per table ?
Suppose, you begin reading a book on page h and end on page k. If you read each page completely and the pages are numbered and read consecutively, then how many page shave you read?
Determine the number of page faults when references to pages occur in the following order : 1, 2, 4, 5, 2, 1, 2, 4. Assume that the main memory can accommodate 3 pages and the main memory already has the pages 1 and 2, with page one having brought earlier than page 2. (LRU page replacement algorithm is used) 
Recall that Belady’s anomaly is that the page-fault rate may increase as the number of allocated frames increases. Now, consider the following statements: S1: Random page replacement algorithm (where a page chosen at random is replaced) Suffers from Belady’s anomaly S2: LRU page replacement algorithm suffers from Belady’s anomaly Which of the following is CORRECT?
How many page faults occur in a system with LRU page replacement policy having 3 (initially empty) page frames for the following string of page reference - 5, 1, 2, 3, 4, 3, 2, 3, 1, 2, 4, 3?