My Courses

  • C++ Programming Multiple Choice questions(MCQ)

    Welcome to the C++ Programming MCQ section! This collection of Multiple Choice Questions (MCQs) is designed to help you prepare for various interviews, placement exams, entrance tests, and competitive exams. Whether you’re a beginner or fresher, an IT professional, or someone preparing for exams, these C++ MCQs will strengthen your understanding of C++ programming concepts and enhance your problem-solving skills. Why Practice C++ MCQs?…

  • Compilers Questions and Answers – Transformation from NFA to DFA

    This set of Compilers Multiple Choice Questions & Answers (MCQs) focuses on “Transformation from NFA to DFA ”.   Can a DFA simulate NDFA a) No b) Yes c) Sometimes d) Depends on NDFA 2. Find the wrong statement? a) The language accepted by finite automata are the languages denoted by regular expression b) Every…

  • Compilers Questions and Answers – The NFA with epsilon-moves to the DFA

        This set of Compilers Interview Questions and Answers for Experienced people focuses on “The NFA with epsilon-moves to the DFA”.   The classes of languages P and NP are closed under certain operations, and not closed under others. Decide whether P and NP are closed under each of the following operations. Union Intersection…

  • Compilers Questions and Answers – Finite Automata

    This set of Compilers Multiple Choice Questions & Answers (MCQs) focuses on “Finite Automata ”.   A language L from a grammar G = { VN, S, P, S} is a) Set of symbols over VN b) Set of symbols over S c) Set of symbols over P d) Set of symbols over S  …

  • Compilers Questions and Answers – Relations

    This set of Compilers Multiple Choice Questions & Answers (MCQs) focuses on “Relations ”.   (a,b) what is a? a) Domain b) Range c) All of the mentioned d) None of the mentioned (a,b) what is b? a) Domain b) Range c) All of the mentioned d) None of the mentioned R is said to…

  • Compilers Questions and Answers – Lexical Analysis – 2

    This set of Compilers Multiple Choice Questions & Answers (MCQs) focuses on “Lexical Analysis – 2”.   What constitutes the stages of the compilation process? a) Feasibility study, system, design, and testing b) Implementation and. documentation c) Lexical analysis, syntax. Analysis and code generation d) None of the mentioned The lexical analyzer takes_________as input and…

  • Compilers Questions and Answers – Lexical Analysis – 1

    This set of Compilers Multiple Choice Questions & Answers (MCQs) focuses on “Lexical Analysis – 1”.   The output of lexical analyzer is a) A set of RE b) Syntax Tree c) Set of Tokens d) String Character The context free grammar is ambiguous if a) The grammar contains non-terminals b) Produces more than one…

  • Compilers Questions and Answers – Cross Compiler – 2

    This set of Compilers Multiple Choice Questions & Answers (MCQs) focuses on “Cross Compiler – 2”.   If we compile the sam.c file with the command “gcc -o sam sam.c”, then the executable file will be a) a.out b) sam c) sam.out d) None of the mentioned What will be output of the following code?…

  • Compilers Questions and Answers – Cross Compiler – 1

    This set of Compilers Multiple Choice Questions & Answers (MCQs) focuses on “Cross Compiler”.   A system program that combines separately compiled modules of a program into a form suitable for execution is a) Assembler b) Linking loader c) Cross compiler d) None of the mentioned A compiler for a high-level language that runs on…

  • Compilers Questions and Answers – Finite Automata and Regular Expressions – 2

    This set of Compilers Interview Questions and Answers focuses on “Finite Automata and Regular Expressions – 2”.   Which of the following strings is not generated by the following grammar? S ? SaSbS|e a) aabb b) abab c) aababb d) aaabbb Regular expressions can be used only for values of type string and number. a)…

Back to top button