P, Q, R are three languages. PQ = R and P and R are regular.
Mathematical Logic, PGCET CSE Exam (Karnataka) 2011, Technical Aptitude, Theory Of Computation, UnSolved
P, Q, R are three languages. PQ = R and P and R are regular. This implies
Mathematical Logic, PGCET CSE Exam (Karnataka) 2011, Technical Aptitude, Theory Of Computation, UnSolved
P, Q, R are three languages. PQ = R and P and R are regular. This implies
If the access time of a symbol table can be made logarithmic, it greatly reduces the search time. This can be implemented by
In a syntax directed translation scheme, the value of an attribute of a node is a function of the attributes of its children. Such an attribute is called a / an
Akilesh Kharvi ? Dec 8 '2016 at 20:7
Answer: synthesised attribute
Explanation:
A synthesized attribute for a nonterminal A at a parse-tree node N is defined by a semantic rule associated with the production at N. Note that the production must have A as its head.
A synthesized attribute at node N is defined only in terms of attribute values at
the children of N and at N itself.
When there is a large variation in the size of incoming jobs, the best method of memory allocation is
Akilesh Kharvi ? Dec 8 '2016 at 20:4
Answer: worst fit
Explanation:
W O R S T - F I T
Worst-fit memory allocation is opposite to best-fit. It allocates free available block to the new job and it is not the best choice for an actual system.
When there is arge variation in the size of incoming jobs, then we cannot apply first fit or best fit or random allocation
In round-robin CPU scheduling, as the time quantum increases, the average turn around time
A dirty bit points to a
Akilesh Kharvi ? Dec 8 '2016 at 20:2
Answer: the page whose data is to be updated because of new computations
Explanation:
A dirty bit is a flag that indicates whether an attribute needs to be updated. Such situations usually occur when a bit in a memory cache or virtual memory page that has been changed by a processor but has not been updated in the storage. this dirty bit is point to the page whose data is to be updated because of new computations so answer is option (d ) the page whose data is to be updated because of new computations.
Which of the following page replacement policies may lead to Belady's anomaly ?
Akilesh Kharvi ? Dec 8 '2016 at 20:0
Answer: FIFO
Explanation:
Belady’s anomaly proves that it is possible to have more page faults when increasing the number of page frames while using the First in First Out (FIFO) page replacement algorithm.
Reference: https://en.wikipedia.org/wiki/B%C3%A9l%C3%A1dy%27s_anomaly