MCQ Bank
Representing logical depiction of the solution to the problem is known as a ________
- A)
- B)
- C)
- D)
Which statement about manipulators is not true?
- A)
- B)
- C)
- D)
which of the following structure is correct for WHILE loop?
- A)
- B)
- C)
- D)
which of the following is true about the switch statement?
- A)
- B)
- C)
- D)
If the condition is not made false in while loop, what will happen?
- A)
- B)
- C)
- D)
If a function does not return anything, its return type will be ________
- A)
- B)
- C)
- D)
which of the following is the first step in FOR loop?
- A)
- B)
- C)
- D)
When we call a function and pass an argument, an object or variable to the function, it is called ?
- A)
- B)
- C)
- D)
Stream insertion (<<) and extraction operators (>>) are always implemented as ________ function.
- A)
- B)
- C)
- D)
which of the following statement is not true about overloading stream extraction operator (>>)?
- A)
- B)
- C)
- D)
endl is a type of ________ manipulator.
- A)
- B)
- C)
- D)
If Σ = {aa bb} then Σ* will not contain ___.
- A) aaabbb
- B) aabbbb
- C) aabbaa
- D) bbaabbbb
One language can have ___ TG's.
- A) Only one
- B) Only two
- C) More than one
- D) Only three
According to 1st part of the Kleene's theorem if a language can be accepted by an FA then it can be accepted by a ___ as well.
- A) FA
- B) CFG
- C) GTG
- D) TG
Even-palindrome is a ___ language.
- A) Non-regular
- B) Regular
- C) Regular but infinite
- D) Regular but finite
If L is a regular language then Lc is also a ___ language.
- A) Regular
- B) Non-regular
- C) Regular but finite
- D) None of the given
Pumping lemma is generally used to prove that:
- A) A given language is infinite
- B) A given language is not regular
- C) Whether two given regular expressions are equivalent or not
- D) None of these
If the FA has N states, then test the words of length less than N. If no word is accepted by this FA, then it will ___ word/words.
- A) accept all
- B) accept no
- C) accept some
- D) reject no
In CFG the symbols that can't be replaced by anything are called ___.
- A) Terminal
- B) Non-Terminal
- C) Production
- D) All of given
Which of the following is a regular language?
- A) String of odd number of zeroes
- B) Set of all palindromes made up of 0's and 1's
- C) String of 0's whose length is a prime number
- D) All of these