General Compiler Design MCQs

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. Is garbage collection available in Common Lisp implementations?

5. What is the return value of the subtype 'predicate', in case it CANNOT decide what is the relation between types it is asked about?

6. Which of the following problems prevents garbage collectors from being used in the real-time systems?

7. What is the advantage of using a suballocator in a memory management system?

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

9. What is amortized analysis is used for?

10. What is a bytecode interpreter?

11. What is a generated code optimization method which is NOT suitable for use in a compiler?

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

13. What is the difference between a general binary search tree and an optimal binary search tree?

14. What is a heapsort?

15. What is an NP-complete problem?

16. What is the difference between a Static Single Assignments graph (SSAG) and a Control Flow Graph (CFG) which are used for the intermediate compiled sources representation in a compiler?

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

18. Which of the following is NOT a valid Common Lisp symbol name?

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

20. What branching instructions type is more resource-consuming on the RISC processor?

21. What functionality of the listed below is NOT common to a parser?

22. What is the relationship between lexical and syntax analysis?

23. Which of the following options is NOT a technique used in 'peephole optimization' of the generated code in a compiler?

24. 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?

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

26. What is the main advantage of using segregated lists usage in the manual memory management?

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

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

29. Which of the following is a dispatch macro character in Common Lisp?

30. What is the fastest way to establish a relationship between two objects?

31. What does it mean if when an algorithm A, belongs to the O(n) algorithms:

32. Which of the following is NOT a garbage collection algorithm?

33. Is it possible to prove the theoretical stability (that is, prove that a collection algorithm will work as expected) of a garbage collector used in conjunction with C language?

34. When using 'optional' keyword for declaring a lambda, such as 'optional (x y z)', what does x, y and z signify?

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

36. What is the main disadvantage of the bitmapped memory allocation scheme of the manual memory management?

37. When does a memory leak happen?

38. Which data structure does a compiler use to solve the register allocation problem?

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

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