General MCQ for Compiler Design

1. Which of the following is NOT a characteristic of a greedy algorithm?

2. Which of the following algorithms is NOT related to a graph mining?

3. Is it possible to multiply two matrices with dimensions 4*6 for the first matrix and 8*10 for the second matrix?

4. What is the difference between eq and eql type predicates in Common Lisp?

5. What is amortized analysis is used for?

6. What is a bytecode interpreter?

7. Which of the following sorting algorithms has average speed estimation defined as : O(n)?

8. What is a heapsort?

9. What is an NP-complete problem?

10. Which of the following is NOT a standard Common Lisp type testing predicate?

11. Which among the following is NOT a common element of parser internals?

12. Assume that two instructions L1 and L2 are dependent in a flow graph. What does it mean when one says that they are output-dependent?

13. What is the optimal way of copying the contents of one array to another in C language?

14. Which among the following is NOT a standard Common Lisp stream?

15. What does the following Common Lisp line describes? (vector 'integer 1234567890)

16. Which of the following is NOT a garbage collection technique?

17. What is the most important problem of the a conservative garbage collector?

18. Which of the following is NOT a Common Lisp equality test predicate?